Update adds a sorted list of keys and their values to the trie If Update is called multiple times, only the state after the last update is commited. W

NewSMT creates a new SMT given a keySize and a hash function.

Get fetches the value of a key by going down the current trie root.

update adds a sorted list of keys and their values to the trie. It returns the root of the updated tree.

Commit stores the updated nodes to disk Commit should be called for every block otherwise past tries are not recorded and it is not possible to revert

loadChildren looks for the children of a node. if the node is not stored in cache, it will be loaded from db.

get fetches the value of a key given a trie root

AtomicUpdate can be called multiple times and all the updated nodes will be commited and roots will be stored in past tries. Can be used for updating

VerifyMerkleProofCompressed verifies that key/value is included in the trie with latest root

maybeDeleteRevertedNode adds the node to updatedNodes to be reverted

MerkleProofCompressed returns a compressed merkle proof. The proof contains a bitmap of non default hashes and the non default hashes.

interiorHash hashes 2 children to get the parent hash and stores it in the updatedNodes and maybe in liveCache. the key is the hash and the value is t

MerkleProof creates a merkle proof for a key in the latest trie A non inclusion proof is a proof to a default value

MerkleProofCompressed2 returns a compressed merkle proof like MerkleProofCompressed This version 1st calls MerkleProof and then removes the default no

Stash rolls back the changes made by previous updates made without commit and loads the cache from before the rollback.

VerifyMerkleProof verifies that key/value is included in the trie with latest root

deleteOldNode deletes an old node that has been updated

loadDefaultHashes creates the default hashes

merkleProof generates a Merke proof of inclusion or non inclusion for a given trie root

shortcutToSubTreeRoot computes the subroot at height of a subtree containing one key

Revert rewinds the state tree to a previous version All the nodes (subtree roots and values) reverted are deleted from the database.

commit stores the updated nodes to disk.

deleteSubTree deletes all the nodes contained in a tree

loadBatch fetches a batch of nodes in cache or db

maybeAddShortcutToKV adds a shortcut key to the keys array to be updated. this is used when a subtree containing a shortcut node is being updated

maybeDeleteSubTree compares the subtree nodes of 2 tries and keeps only the older one

merkleProofCompressed generates a Merke proof of inclusion or non inclusion for a given trie root a proof node is only appended if it is non default a

parseBatch decodes the byte data into a slice of nodes and bitmap

splitKeys devides the array of keys into 2 so they can update left and right branches in parallel

storeNode stores a batch and deletes the old node from cache

unrollShortcutAndKey returns the merkle proof nodes of an empty key in a subtree that contains another key the key we are proving is not in the tree,

unrollShortcutAndKeyCompressed returns the merkle proof nodes of an empty key in a subtree that contains another key the key we are proving is not in

updateLeft updates the left side of the tree

updateParallel updates both sides of the trie simultaneously

updateRight updates the right side of the tree

verifyMerkleProof verifies that a key/value is included in the trie with given root

verifyMerkleProof verifies that a key/value is included in the trie with given root

go test -run=xxx -bench=. -benchmem -test.benchtime=20s

CheckRoot returns true if the root exists in Database.

DefaultHash is a getter for the defaultHashes array

* // Because of the batching, variable sized keys are no longer available func TestSmtDifferentKeySize(t *testing.T) { keySize := 20 smt := NewSMT(u

test updating and deleting at the same time