Creates an instance of CompactDeepSparseMerkleSubTree.
Optional
options: { hasher: The hash function to use, defaults to PoseidonHasherFunc; hashKey: whether to hash the key, the default is true; hashValue: whether to hash the value, the default is true.
Optional
hashOptional
hashOptional
hasher?: HasherCompactDeepSparseMerkleSubTree
Protected
configProtected
keyProtected
rootProtected
storeProtected
thProtected
valueAdd a branch to the tree, a branch is generated by smt.prove.
Optional
value: VCompactDeepSparseMerkleSubTree
Delete a value from tree and return the new root of the tree.
{Promise
CompactSparseMerkleTree
Protected
getGet the tree hasher used by the tree.
{TreeHasher<K, V>}
CompactSparseMerkleTree
Check if the key exists in the tree.
{Promise
CompactSparseMerkleTree
Create a merkle proof for a key against the current root.
{Promise
CompactSparseMerkleTree
Create a compacted merkle proof for a key against the current root.
{Promise
CompactSparseMerkleTree
Create an updatable Merkle proof for a key against the current root.
{Promise
CompactSparseMerkleTree
Static
importImport a compacted sparse merkle tree
Optional
options: { hasher: The hash function to use, defaults to PoseidonHasherFunc; hashKey: whether to hash the key, the default is true; hashValue: whether to hash the value, the default is true.
Optional
hashOptional
hashOptional
hasher?: Hasher{Promise<CompactSparseMerkleTree<K, V>>}
CompactSparseMerkleTree
This is used to compute new roots for state transitions based on sideNodes.
CompactSparseMerkleTree