Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

RSKIP107 Updated to reflect current status and specification #413

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

RSKIP107 Updated to reflect current status and specification #413

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
17d8878
Update RSKIP107.md
raullaprida Nov 20, 2023
8fa1b08
Update RSKIP107.md
raullaprida Nov 20, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 5 additions & 6 deletions IPs/RSKIP107.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
rskip: 107
title: Smaller Unitrie Nodes for Higher Scalability
description:
status: Draft
status: Adopted
purpose: Sca
author: SDL (@sergiodemianlerner)
layer: Core
Expand All @@ -19,7 +19,7 @@ created: 2019
| **Purpose** | Sca |
| **Layer** | Core |
| **Complexity** | 1 |
| **Status** | Draft |
| **Status** | Adopted |

# Abstract

Expand Down Expand Up @@ -77,9 +77,8 @@ The new node format is as follows:
- **valueHash**, 32 bytes: Hash digest of value stored
- **valueLength**, uint24 (3 bytes): size of the value contained (if lvalue>0 and hasLongVal)

- if the left and right nodes are not present:

- **treeSize**, 0-9 bytes: the size of the tree, variable length integer
- if the node is not terminal (meaning either the left or right nodes are present, which can be validated by checking that at least one of the two bits for 'nodePresent' is set to 1) :
- **childrenSize**, 0-9 bytes: the size in bytes of the underlying subtree, excluding the current node (the root of the subtree), represented as a variable-length integer

- if !hasLongVal:
- **value**, variable-size extends up to the bounds of the node buffer: stored value
Expand All @@ -90,7 +89,7 @@ The overhead for a small leaf node is 2 bytes (flags and 1-byte of prefix length

Because an Unitrie account having 1 RBTC-wei occupies 3 bytes. Assuming a 27-byte shared prefix, the space consumed without node overhead is 30 bytes. Therefore we've reduced the overhead of small accounts from 266% (80/30) to 7% (2/30).

The value treeSize enables sharding the state tree between nodes and requesting pieces in parallel from different nodes by specifying and offset and size of the requested chunk, while still being able to validate each piece independently, without the need to collect all pieces first.
The value childrenSize enables sharding the state tree between nodes and requesting pieces in parallel from different nodes by specifying and offset and size of the requested chunk, while still being able to validate each piece independently, without the need to collect all pieces first.

**Shared Prefix Size Compression**

Expand Down