BuildTrie builds a trie using the proof paths (including inner nodes), and then sets all the keys-values (leaves).

https://github.com/eqlabs/pathfinder/blob/main/crates/merkle-tree/src/tree.rs#L514 GetProof generates a set of proof nodes from the root to the leaf.

ProofToPath returns a set of storage nodes from the root to the end of the proof path.

RunOnTempTriePedersen creates an in-memory Trie of height `height` and runs `do` on that Trie.

verifyProof checks if `leafPath` leads from `root` to `leafHash` along the `proofNodes` https://github.com/eqlabs/pathfinder/blob/main/crates/merkle-tree/src/tree.rs#L2006.

VerifyRangeProof verifies the range proof for the given range of keys.

A Node represents a node in the [Trie] https://docs.starknet.io/architecture-and-concepts/network-architecture/starknet-state/#trie_construction.

https://github.com/starknet-io/starknet-p2p-specs/blob/main/p2p/proto/snapshot.proto#L6.

Storage is a database transaction on a trie.

storageNode is the on-disk representation of a [Node], where key is the storage key and node is the value.

Trie is a dense Merkle Patricia Trie (i.e., all internal nodes have two children).