Module mpt

Helper types to work with Ethereum’s Merkle Patricia Trie nodes

Structs

FullNode

Intermediate trie node with children (refers to node with same name in Geth). This struct only handles the proof representation, i.e. a child is either empty or a 32-byte hash of its subtree.

ShortNode

Trie node where value is either the RLP-encoded item we’re proving or an intermediate hash (refers to node with same name in Geth) Proof verification should return value. key is an implementation detail of the trie.

Traits

Node