ChunkifyCode generates the chunked version of an array representing EVM bytecode.

ForGatherChildren decodes the provided node and traverses the children inside.

New creates the trie instance with provided trie id and the read-only database.

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

NewEmpty is a shortcut to create empty tree.

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

NewSecure creates a new StateTrie.

NewStackTrie allocates and initializes an empty trie.

NewStateTrie creates a trie with an existing root node from a backing database.

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.

NewVerkleTrie constructs a verkle tree based on the specified root hash.

ResolvePath resolves the provided composite node path by separating the path in account trie if it's existent.

StateTrieID constructs an identifier for state trie with the provided state root.

StorageTrieID constructs an identifier for storage trie which belongs to a certain state and contract specified by the stateRoot and owner.

TrieID constructs an identifier for a standard trie(not a second-layer trie) with provided root.

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.

Copy the values here so as to avoid an import cycle.

Copy the values here so as to avoid an import cycle.

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

ErrCommitted is returned when an already committed trie is requested for usage.

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

CodeSyncResult is a response with requested bytecode along with its hash.

ID is the identifier for uniquely identifying a trie.

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

MissingNodeError is returned by the trie functions (Get, Update, Delete) in the case where a trie node is not present in the local database.

NodeSyncResult is a response with requested trie node along with its node path.

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

StateTrie wraps a trie with key hashing.

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.

Trie is a Merkle Patricia Trie.

VerkleTrie is a wrapper around VerkleNode that implements the trie.Trie interface so that Verkle trees can be reused verbatim.

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

ChunkedCode represents a sequence of 32-bytes chunks of code (31 bytes of which are actual code, and 1 byte is the pushdata offset).

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

NodeResolver is used for looking up trie nodes before reaching into the real persistent layer.

OnTrieNode is a callback method invoked when a trie node is committed by the stack trie.

SecureTrie is the old name of StateTrie.

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