Expand description
The implementation of sparse MPT.
Modules§
- errors
- Re-export sparse trie error types.
- provider
- Traits and default implementations related to retrieval of blinded trie nodes.
Structs§
- Deferred
Drops - Holds data that should be dropped after any locks are released.
- Parallel
Sparse Trie - A revealed sparse trie with subtries that can be updated in parallel.
- Parallelism
Thresholds - Configuration for controlling when parallelism is enabled in
ParallelSparseTrieoperations. - RlpNode
Path Stack Item - RLP node path stack item.
- RlpNode
Stack Item - RLP node stack item.
- Sparse
State Trie - Sparse state trie representing lazy-loaded Ethereum state trie.
- Sparse
Subtrie - This is a subtrie of the
ParallelSparseTriethat contains a map from path to sparse trie nodes. - Sparse
Subtrie Buffers - Collection of reusable buffers for calculating subtrie hashes.
- Sparse
Trie Updates - Tracks modifications to the sparse trie structure.
Enums§
- Leaf
Lookup - Success value for a leaf lookup operation
- Leaf
Lookup Error - Error type for a leaf lookup operation
- Leaf
Update - Describes an update to a leaf in the sparse trie.
- Leaf
Update Step - Represents the outcome of processing a node during leaf insertion
- Revealable
Sparse Trie - A sparse trie that is either in a “blind” state (no nodes are revealed, root node hash is unknown) or in a “revealed” state (root node has been revealed and the trie can be updated).
- Sparse
Node - Enum representing trie nodes in sparse trie.
- Sparse
Node Type - Enum representing sparse trie node type.
- Sparse
Subtrie Type - Sparse Subtrie Type.
Constants§
- NUM_
LOWER_ SUBTRIES - Number of lower subtries which are managed by the
ParallelSparseTrie. - UPPER_
TRIE_ MAX_ DEPTH - The maximum length of a path, in nibbles, which belongs to the upper subtrie of a
ParallelSparseTrie. All longer paths belong to a lower subtrie.
Traits§
- Sparse
Trie - Trait defining common operations for revealed sparse trie implementations.