Crate reth_trie_common

Commonly used types for trie usage.

Modules

• hash_builder
  The implementation of hash builder. MPT hash builder implementation.
• proof
  Proof verification logic.
• root
  Common root computation functions.
• triehashtest-utils
  Implementation of hasher using our keccak256 hashing function for compatibility with triehash crate.

Structs

• AccountProof
  The merkle proof with the relevant account info.
• BranchNode
  A branch node in an Ethereum Merkle Patricia Trie.
• BranchNodeCompact
  A struct representing a branch node in an Ethereum trie.
• BranchNodeRef
  A reference to BranchNode and its state mask. NOTE: The stack may contain more items that specified in the state mask.
• ExtensionNode
  An extension node in an Ethereum Merkle Patricia Trie.
• ExtensionNodeRef
  Reference to the extension node. See ExtensionNode from more information.
• HashBuilder
  A component used to construct the root hash of the trie.
• LeafNode
  A leaf node represents the endpoint or terminal node in the trie. In other words, a leaf node is where actual values are stored.
• LeafNodeRef
  Reference to the leaf node. See LeafNode from more information.
• MultiProof
  The state multiproof of target accounts and multiproofs of their storage tries.
• Nibbles
  Structure representing a sequence of nibbles.
• StorageMultiProof
  The merkle multiproof of storage trie.
• StorageProof
  The merkle proof of the storage entry.
• StorageTrieEntry
  Account storage trie node.
• StoredNibbles
  The representation of nibbles of the merkle trie stored in the database.
• StoredNibblesSubKey
  The representation of nibbles of the merkle trie stored in the database.
• StoredSubNode
  Walker sub node for storing intermediate state root calculation state in the database.
• TrieAccount
  An Ethereum account as represented in the trie.
• TrieMask
  A struct representing a mask of 16 bits, used for Ethereum trie operations.

Enums

• TrieNode
  Enum representing an MPT trie node.

Constants

• CHILD_INDEX_RANGE
  The range of valid child indexes.
• EMPTY_ROOT_HASH
  Root hash of an empty trie.

Functions

• encode_path_leaf
  Encodes a given path leaf as a compact array of bytes.
• word_rlp
  Optimization for quick encoding of a 32-byte word as RLP.