Execute a batch of put and delete operations. The execution is batched, so calling this function with multiple updates provides more opportunities for optimization and can be faster than call put() and del() multiple times.
Given a key, delete any mapping that exists for that key.
Given a key, retrieve a Witness for the mapping.
Insert a new mapping into the tree. If the key is already mapped in the tree, it is updated with the new value.
The root hash of the tree.
The root hash of the tree, as a bigint. Reading this property is more efficient than obtaining a buffer.
Search for the given key, returning a SearchResult which contains the path traversed to search for the key.
Generated using TypeDoc
The interface for a merkle tree.