New creates a trie with an existing root node from db and an assigned owner for storage proximity.

NewDatabase creates a new trie database to store ephemeral trie content before its written out to disk or garbage collected.

NewDatabaseWithConfig creates a new trie database to store ephemeral trie content before its written out to disk or garbage collected.

NewDifferenceIterator constructs a NodeIterator that iterates over elements in b that are not in a.

NewEmpty is a shortcut to create empty tree.

NewFromBinary initialises a serialized stacktrie with the given db.

NewIterator creates a new key-value iterator from a node iterator.

NewSecure creates a trie with an existing root node from a backing database and optional intermediate in-memory node pool.

NewStackTrie allocates and initializes an empty trie.

NewStackTrieWithOwner allocates and initializes an empty trie, but with the additional owner field.

NewSync creates a new trie data download scheduler.

NewSyncPath converts an expanded trie path from nibble form into a compact version that can be sent over the network.

NewUnionIterator constructs a NodeIterator that iterates over elements in the union of the provided NodeIterators.

VerifyProof checks merkle proofs.

VerifyRangeProof checks whether the given leaf nodes and edge proof can prove the given trie leaves range is matched with the specific root.

ErrAlreadyProcessed is returned by the trie sync when it's requested to process a node it already processed previously.

ErrNotRequested is returned by the trie sync when it's requested to process a node it did not request.

Config defines all necessary options for database.

Iterator is a key-value trie iterator that traverses a Trie.

MissingNodeError is returned by the trie functions (TryGet, TryUpdate, TryDelete) in the case where a trie node is not present in the local database.

SecureTrie wraps a trie with key hashing.

StackTrie is a trie implementation that expects keys to be inserted in order.

Sync is the main state trie synchronisation scheduler, which provides yet unknown trie hashes to retrieve, accepts node data associated with said hashes and reconstructs the trie step by step until all is done.

SyncResult is a response with requested data along with it's hash.

Trie is a Merkle Patricia Trie.

Database is an intermediate write layer between the trie data structures and the disk database.

NodeIterator is an iterator to traverse the trie pre-order.

LeafCallback is a callback type invoked when a trie operation reaches a leaf node.

SyncPath is a path tuple identifying a particular trie node either in a single trie (account) or a layered trie (account -> storage).