@did-btc1/smt / SparseMerkleTree
Class: SparseMerkleTree
Defined in: smt.ts:11
Constructors
Constructor
> new SparseMerkleTree(factory, treeHeight): SparseMerkleTree
Defined in: smt.ts:15
Parameters
factory
treeHeight
number = 256
Returns
SparseMerkleTree
Methods
delete()
> delete(key): void
Defined in: smt.ts:35
delete sets a leaf to the "empty" leaf node, effectively removing it.
Parameters
key
Uint8Array
Returns
void
getRootHash()
> getRootHash(): Uint8Array
Defined in: smt.ts:43
getRootHash returns the MS-SMT root hash after all insertions/deletions.
Returns
Uint8Array
getRootSum()
> getRootSum(): bigint
Defined in: smt.ts:50
getRootSum returns the sum of all leaves in the tree.
Returns
bigint
insert()
> insert(key, value, sum): void
Defined in: smt.ts:26
insert simulates placing a new leaf in the tree at the position determined by the 256-bit key. We'll do a simple recursive approach:
Parameters
key
Uint8Array
value
Uint8Array
sum
bigint
Returns
void