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

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

NewDatabase initializes the trie database with default settings, note the legacy hash-based scheme is used by default.

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.

NewStackTrieOptions initializes an empty options for stackTrie.

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

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.

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.

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

HashDefaults represents a config for using hash-based scheme with default settings.

Config defines all necessary options for database.

Database is the wrapper of the underlying backend which is shared by different types of node backend as an entrypoint.

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.

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

StackTrieOptions contains the configured options for manipulating the stackTrie.

StateTrie wraps a trie with key hashing.

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.

Reader wraps the Node method of a backing trie store.

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

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

SecureTrie is the old name of StateTrie.