@jayanth-kumar-morem/sparse-merkle-tree
Version:
A TypeScript implementation of Sparse Merkle Trees with Poseidon hash function support
22 lines • 689 B
TypeScript
export declare class SMT {
private leaves;
private poseidon;
private defaults;
private depth;
constructor(poseidon: any, depth?: number);
private hash;
private getPathBits;
add(key: bigint, value: bigint): void;
get(key: bigint): bigint | undefined;
has(key: bigint): boolean;
get root(): bigint;
createNonMembershipProof(key: bigint): {
siblings: bigint[];
pathBits: number[];
root: bigint;
};
private computeSiblingAtLevel;
private computeSubtreeRoot;
verifyNonMembershipProof(key: bigint, siblings: bigint[], pathBits: number[], expectedRoot: bigint): boolean;
}
//# sourceMappingURL=index.d.ts.map