EdgeNode

Represents an edge node in a Merkle Patricia Trie

An edge node compresses a path of nodes in the trie, storing both the compressed path and the hash of the child node. This optimization reduces the depth of the trie when consecutive nodes have only one child, improving efficiency in Starknet storage proofs.

Fields

• path - The compressed path as a felt252 value
• child - Hash of the child node at the end of this path
• length - Length of the compressed path in bits

Fully qualified path: alexandria_merkle_tree::storage_proof::EdgeNode

[derive(Drop, Copy, Serde)]
pub struct EdgeNode { /* private fields */ }