@aztec/merkle-tree 0.7.10 → 0.8.5

package/dest/test/test_suite.js

@@ -1,119 +0,0 @@
-import { CircuitsWasm } from '@aztec/circuits.js';
-import { SiblingPath } from '@aztec/types';
-import { default as levelup } from 'levelup';
-import { Pedersen } from '../index.js';
-import { appendLeaves } from './utils/append_leaves.js';
-import { createMemDown } from './utils/create_mem_down.js';
-const expectSameTrees = async (tree1, tree2, includeUncommitted = true) => {
-    const size = tree1.getNumLeaves(includeUncommitted);
-    expect(size).toBe(tree2.getNumLeaves(includeUncommitted));
-    expect(tree1.getRoot(includeUncommitted).toString('hex')).toBe(tree2.getRoot(includeUncommitted).toString('hex'));
-    for (let i = 0; i < size; ++i) {
-        const siblingPath1 = await tree1.getSiblingPath(BigInt(i), includeUncommitted);
-        const siblingPath2 = await tree2.getSiblingPath(BigInt(i), includeUncommitted);
-        expect(siblingPath2).toStrictEqual(siblingPath1);
-    }
-};
-export const treeTestSuite = (testName, createDb, createFromName) => {
-    describe(testName, () => {
-        const values = [];
-        let wasm;
-        let pedersen;
-        beforeAll(() => {
-            for (let i = 0; i < 32; ++i) {
-                const v = Buffer.alloc(32, i + 1);
-                v.writeUInt32BE(i, 28);
-                values[i] = v;
-            }
-        });
-        beforeEach(async () => {
-            wasm = await CircuitsWasm.get();
-            pedersen = new Pedersen(wasm);
-        });
-        it('should revert changes on rollback', async () => {
-            const levelDownEmpty = createMemDown();
-            const dbEmpty = levelup(levelDownEmpty);
-            const emptyTree = await createDb(dbEmpty, pedersen, 'test', 10);
-            const levelDown = createMemDown();
-            const db = levelup(levelDown);
-            const tree = await createDb(db, pedersen, 'test2', 10);
-            await appendLeaves(tree, values.slice(0, 4));
-            const firstRoot = tree.getRoot(true);
-            expect(firstRoot).not.toEqual(emptyTree.getRoot(true));
-            // committed root should still be the empty root
-            expect(tree.getRoot(false)).toEqual(emptyTree.getRoot(false));
-            await tree.rollback();
-            // both committed and uncommitted trees should be equal to the empty tree
-            await expectSameTrees(tree, emptyTree, true);
-            await expectSameTrees(tree, emptyTree, false);
-            // append the leaves again
-            await appendLeaves(tree, values.slice(0, 4));
-            expect(tree.getRoot(true)).toEqual(firstRoot);
-            // committed root should still be the empty root
-            expect(tree.getRoot(false)).toEqual(emptyTree.getRoot(false));
-            expect(firstRoot).not.toEqual(emptyTree.getRoot(true));
-            await tree.rollback();
-            // both committed and uncommitted trees should be equal to the empty tree
-            await expectSameTrees(tree, emptyTree, true);
-            await expectSameTrees(tree, emptyTree, false);
-        });
-        it('should not revert changes after commit', async () => {
-            const levelDownEmpty = createMemDown();
-            const dbEmpty = levelup(levelDownEmpty);
-            const emptyTree = await createDb(dbEmpty, pedersen, 'test', 10);
-            const levelDown = createMemDown();
-            const db = levelup(levelDown);
-            const tree = await createDb(db, pedersen, 'test2', 10);
-            await appendLeaves(tree, values.slice(0, 4));
-            expect(tree.getRoot(true)).not.toEqual(emptyTree.getRoot(true));
-            // committed root should still be the empty root
-            expect(tree.getRoot(false)).toEqual(emptyTree.getRoot(false));
-            await tree.commit();
-            await tree.rollback();
-            expect(tree.getRoot(true)).not.toEqual(emptyTree.getRoot(true));
-            expect(tree.getRoot(false)).not.toEqual(emptyTree.getRoot(true));
-        });
-        it('should be able to restore from previous committed data', async () => {
-            const levelDown = createMemDown();
-            const db = levelup(levelDown);
-            const tree = await createDb(db, pedersen, 'test', 10);
-            await appendLeaves(tree, values.slice(0, 4));
-            await tree.commit();
-            const db2 = levelup(levelDown);
-            const tree2 = await createFromName(db2, pedersen, 'test');
-            // both committed and uncommitted should be equal to the restored data
-            expect(tree.getRoot(true)).toEqual(tree2.getRoot(true));
-            expect(tree.getRoot(false)).toEqual(tree2.getRoot(false));
-            for (let i = 0; i < 4; ++i) {
-                expect(await tree.getSiblingPath(BigInt(i), true)).toEqual(await tree2.getSiblingPath(BigInt(i), true));
-                expect(await tree.getSiblingPath(BigInt(i), false)).toEqual(await tree2.getSiblingPath(BigInt(i), false));
-            }
-        });
-        it('should throw an error if previous data does not exist for the given name', async () => {
-            const db = levelup(createMemDown());
-            await expect((async () => {
-                await createFromName(db, pedersen, 'a_whole_new_tree');
-            })()).rejects.toThrow();
-        });
-        it('should serialize sibling path data to a buffer and be able to deserialize it back', async () => {
-            const db = levelup(createMemDown());
-            const tree = await createDb(db, pedersen, 'test', 10);
-            await appendLeaves(tree, values.slice(0, 1));
-            const siblingPath = await tree.getSiblingPath(0n, true);
-            const buf = siblingPath.toBuffer();
-            const recovered = SiblingPath.fromBuffer(buf);
-            expect(recovered).toEqual(siblingPath);
-            const deserialized = SiblingPath.deserialize(buf);
-            expect(deserialized.elem).toEqual(siblingPath);
-            expect(deserialized.adv).toBe(4 + 10 * 32);
-            const dummyData = Buffer.alloc(23, 1);
-            const paddedBuf = Buffer.concat([dummyData, buf]);
-            const recovered2 = SiblingPath.fromBuffer(paddedBuf, 23);
-            expect(recovered2).toEqual(siblingPath);
-            const deserialized2 = SiblingPath.deserialize(buf);
-            expect(deserialized2.elem).toEqual(siblingPath);
-            expect(deserialized2.adv).toBe(4 + 10 * 32);
-        });
-    });
-};
-//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"test_suite.js","sourceRoot":"","sources":["../../src/test/test_suite.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,OAAO,EAAU,WAAW,EAAE,MAAM,cAAc,CAAC;AAEnD,OAAO,EAAE,OAAO,IAAI,OAAO,EAAE,MAAM,SAAS,CAAC;AAE7C,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAE3D,MAAM,eAAe,GAAG,KAAK,EAC3B,KAAsC,EACtC,KAAsC,EACtC,kBAAkB,GAAG,IAAI,EACzB,EAAE;IACF,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC;IACpD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC,CAAC;IAC1D,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAElH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;QAC7B,MAAM,YAAY,GAAG,MAAM,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;QAC/E,MAAM,YAAY,GAAG,MAAM,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;QAC/E,MAAM,CAAC,YAAY,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;KAClD;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,QAAgB,EAChB,QAK6C,EAC7C,cAAoH,EACpH,EAAE;IACF,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACtB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,IAAiB,CAAC;QACtB,IAAI,QAAkB,CAAC;QAEvB,SAAS,CAAC,GAAG,EAAE;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE;gBAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClC,CAAC,CAAC,aAAa,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;aACf;QACH,CAAC,CAAC,CAAC;QAEH,UAAU,CAAC,KAAK,IAAI,EAAE;YACpB,IAAI,GAAG,MAAM,YAAY,CAAC,GAAG,EAAE,CAAC;YAChC,QAAQ,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;YACjD,MAAM,cAAc,GAAG,aAAa,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;YACxC,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;YAEhE,MAAM,SAAS,GAAG,aAAa,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;YACvD,MAAM,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAE7C,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YACvD,gDAAgD;YAChD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YAE9D,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;YAEtB,yEAAyE;YACzE,MAAM,eAAe,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;YAC7C,MAAM,eAAe,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;YAE9C,0BAA0B;YAC1B,MAAM,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAE7C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC9C,gDAAgD;YAChD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YAE9D,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAEvD,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;YAEtB,yEAAyE;YACzE,MAAM,eAAe,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;YAC7C,MAAM,eAAe,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,KAAK,IAAI,EAAE;YACtD,MAAM,cAAc,GAAG,aAAa,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;YACxC,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;YAEhE,MAAM,SAAS,GAAG,aAAa,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;YACvD,MAAM,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAE7C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAChE,gDAAgD;YAChD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YAE9D,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;YAEtB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAChE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE,KAAK,IAAI,EAAE;YACtE,MAAM,SAAS,GAAG,aAAa,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;YACtD,MAAM,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;YAEpB,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,MAAM,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YAE1D,sEAAsE;YACtE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YACxD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;gBAC1B,MAAM,CAAC,MAAM,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBACxG,MAAM,CAAC,MAAM,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;aAC3G;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0EAA0E,EAAE,KAAK,IAAI,EAAE;YACxF,MAAM,EAAE,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;YACpC,MAAM,MAAM,CACV,CAAC,KAAK,IAAI,EAAE;gBACV,MAAM,cAAc,CAAC,EAAE,EAAE,QAAQ,EAAE,kBAAkB,CAAC,CAAC;YACzD,CAAC,CAAC,EAAE,CACL,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QACtB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mFAAmF,EAAE,KAAK,IAAI,EAAE;YACjG,MAAM,EAAE,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;YACtD,MAAM,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAE7C,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACxD,MAAM,GAAG,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC;YACnC,MAAM,SAAS,GAAG,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YAC9C,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACvC,MAAM,YAAY,GAAG,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YAClD,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YAC/C,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YAE3C,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACtC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;YAClD,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YACzD,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACxC,MAAM,aAAa,GAAG,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YACnD,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YAChD,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}

package/dest/test/utils/append_leaves.d.ts

@@ -1,5 +0,0 @@
-/// <reference types="node" resolution-mode="require"/>
-import { AppendOnlyTree } from '../../interfaces/append_only_tree.js';
-import { UpdateOnlyTree } from '../../interfaces/update_only_tree.js';
-export declare const appendLeaves: (tree: AppendOnlyTree | UpdateOnlyTree, leaves: Buffer[]) => Promise<void>;
-//# sourceMappingURL=append_leaves.d.ts.map

package/dest/test/utils/append_leaves.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"append_leaves.d.ts","sourceRoot":"","sources":["../../../src/test/utils/append_leaves.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AAEtE,eAAO,MAAM,YAAY,SAAgB,cAAc,GAAG,cAAc,UAAU,MAAM,EAAE,kBAWzF,CAAC"}

package/dest/test/utils/append_leaves.js

@@ -1,14 +0,0 @@
-export const appendLeaves = async (tree, leaves) => {
-    if ('appendLeaves' in tree) {
-        // This branch is used by the standard tree test suite, which implements appendLeaves
-        await tree.appendLeaves(leaves);
-    }
-    else {
-        // This branch is used by the sparse tree test suite, which does not implement appendLeaves
-        for (const value of leaves) {
-            const index = tree.getNumLeaves(true);
-            await tree.updateLeaf(value, index);
-        }
-    }
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYXBwZW5kX2xlYXZlcy5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uL3NyYy90ZXN0L3V0aWxzL2FwcGVuZF9sZWF2ZXMudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBR0EsTUFBTSxDQUFDLE1BQU0sWUFBWSxHQUFHLEtBQUssRUFBRSxJQUFxQyxFQUFFLE1BQWdCLEVBQUUsRUFBRTtJQUM1RixJQUFJLGNBQWMsSUFBSSxJQUFJLEVBQUU7UUFDMUIscUZBQXFGO1FBQ3JGLE1BQU0sSUFBSSxDQUFDLFlBQVksQ0FBQyxNQUFNLENBQUMsQ0FBQztLQUNqQztTQUFNO1FBQ0wsMkZBQTJGO1FBQzNGLEtBQUssTUFBTSxLQUFLLElBQUksTUFBTSxFQUFFO1lBQzFCLE1BQU0sS0FBSyxHQUFHLElBQUksQ0FBQyxZQUFZLENBQUMsSUFBSSxDQUFDLENBQUM7WUFDdEMsTUFBTSxJQUFJLENBQUMsVUFBVSxDQUFDLEtBQUssRUFBRSxLQUFLLENBQUMsQ0FBQztTQUNyQztLQUNGO0FBQ0gsQ0FBQyxDQUFDIn0=

package/dest/test/utils/create_mem_down.d.ts

@@ -1,3 +0,0 @@
-import { type MemDown } from 'memdown';
-export declare const createMemDown: () => MemDown<any, any>;
-//# sourceMappingURL=create_mem_down.d.ts.map

package/dest/test/utils/create_mem_down.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"create_mem_down.d.ts","sourceRoot":"","sources":["../../../src/test/utils/create_mem_down.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,OAAO,EAAsB,MAAM,SAAS,CAAC;AAE3D,eAAO,MAAM,aAAa,yBAAgD,CAAC"}

package/dest/test/utils/create_mem_down.js

@@ -1,3 +0,0 @@
-import { default as memdown } from 'memdown';
-export const createMemDown = () => memdown();
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY3JlYXRlX21lbV9kb3duLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vc3JjL3Rlc3QvdXRpbHMvY3JlYXRlX21lbV9kb3duLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sRUFBZ0IsT0FBTyxJQUFJLE9BQU8sRUFBRSxNQUFNLFNBQVMsQ0FBQztBQUUzRCxNQUFNLENBQUMsTUFBTSxhQUFhLEdBQUcsR0FBRyxFQUFFLENBQUUsT0FBZSxFQUF1QixDQUFDIn0=

package/dest/test/utils/pedersen_with_counter.d.ts

@@ -1,24 +0,0 @@
-/// <reference types="node" resolution-mode="require"/>
-import { Pedersen } from '../../index.js';
-/**
- * A test utility allowing us to count the number of times the compress function has been called.
- */
-export declare class PedersenWithCounter extends Pedersen {
-    /**
-     * The number of times the compress function has been called.
-     */
-    compressCounter: number;
-    /**
-     * Compresses two 32-byte hashes.
-     * @param lhs - The first hash.
-     * @param rhs - The second hash.
-     * @returns The new 32-byte hash.
-     */
-    compress(lhs: Uint8Array, rhs: Uint8Array): Buffer;
-    /**
-     * Resets the compress counter.
-     * @returns void
-     */
-    resetCounter(): void;
-}
-//# sourceMappingURL=pedersen_with_counter.d.ts.map

package/dest/test/utils/pedersen_with_counter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"pedersen_with_counter.d.ts","sourceRoot":"","sources":["../../../src/test/utils/pedersen_with_counter.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C;;GAEG;AACH,qBAAa,mBAAoB,SAAQ,QAAQ;IAC/C;;OAEG;IACI,eAAe,SAAK;IAE3B;;;;;OAKG;IACI,QAAQ,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,GAAG,MAAM;IAKzD;;;OAGG;IACI,YAAY;CAGpB"}

package/dest/test/utils/pedersen_with_counter.js

@@ -1,31 +0,0 @@
-import { Pedersen } from '../../index.js';
-/**
- * A test utility allowing us to count the number of times the compress function has been called.
- */
-export class PedersenWithCounter extends Pedersen {
-    constructor() {
-        super(...arguments);
-        /**
-         * The number of times the compress function has been called.
-         */
-        this.compressCounter = 0;
-    }
-    /**
-     * Compresses two 32-byte hashes.
-     * @param lhs - The first hash.
-     * @param rhs - The second hash.
-     * @returns The new 32-byte hash.
-     */
-    compress(lhs, rhs) {
-        this.compressCounter++;
-        return super.compress(lhs, rhs);
-    }
-    /**
-     * Resets the compress counter.
-     * @returns void
-     */
-    resetCounter() {
-        this.compressCounter = 0;
-    }
-}
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicGVkZXJzZW5fd2l0aF9jb3VudGVyLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vc3JjL3Rlc3QvdXRpbHMvcGVkZXJzZW5fd2l0aF9jb3VudGVyLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sRUFBRSxRQUFRLEVBQUUsTUFBTSxnQkFBZ0IsQ0FBQztBQUUxQzs7R0FFRztBQUNILE1BQU0sT0FBTyxtQkFBb0IsU0FBUSxRQUFRO0lBQWpEOztRQUNFOztXQUVHO1FBQ0ksb0JBQWUsR0FBRyxDQUFDLENBQUM7SUFvQjdCLENBQUM7SUFsQkM7Ozs7O09BS0c7SUFDSSxRQUFRLENBQUMsR0FBZSxFQUFFLEdBQWU7UUFDOUMsSUFBSSxDQUFDLGVBQWUsRUFBRSxDQUFDO1FBQ3ZCLE9BQU8sS0FBSyxDQUFDLFFBQVEsQ0FBQyxHQUFHLEVBQUUsR0FBRyxDQUFDLENBQUM7SUFDbEMsQ0FBQztJQUVEOzs7T0FHRztJQUNJLFlBQVk7UUFDakIsSUFBSSxDQUFDLGVBQWUsR0FBRyxDQUFDLENBQUM7SUFDM0IsQ0FBQztDQUNGIn0=

package/package.local.json

@@ -1,3 +0,0 @@
-{
-  "files": ["dest", "src", "!*.test.*", "!dest/test", "!src/test"]
-}

package/src/sparse_tree/sparse_tree.test.ts

@@ -1,179 +0,0 @@
-import { CircuitsWasm } from '@aztec/circuits.js';
-import { createDebugLogger } from '@aztec/foundation/log';
-import { IWasmModule } from '@aztec/foundation/wasm';
-import { Hasher, SiblingPath } from '@aztec/types';
-
-import { randomBytes } from 'crypto';
-import { default as levelup } from 'levelup';
-
-import { INITIAL_LEAF, newTree } from '../index.js';
-import { UpdateOnlyTree } from '../interfaces/update_only_tree.js';
-import { loadTree } from '../load_tree.js';
-import { Pedersen } from '../pedersen.js';
-import { standardBasedTreeTestSuite } from '../test/standard_based_test_suite.js';
-import { treeTestSuite } from '../test/test_suite.js';
-import { createMemDown } from '../test/utils/create_mem_down.js';
-import { SparseTree } from './sparse_tree.js';
-
-const log = createDebugLogger('aztec:sparse_tree_test');
-
-const createDb = async (
-  levelUp: levelup.LevelUp,
-  hasher: Hasher,
-  name: string,
-  depth: number,
-): Promise<UpdateOnlyTree> => {
-  return await newTree(SparseTree, levelUp, hasher, name, depth);
-};
-
-const createFromName = async (levelUp: levelup.LevelUp, hasher: Hasher, name: string): Promise<UpdateOnlyTree> => {
-  return await loadTree(SparseTree, levelUp, hasher, name);
-};
-
-const TEST_TREE_DEPTH = 3;
-
-treeTestSuite('SparseTree', createDb, createFromName);
-standardBasedTreeTestSuite('SparseTree', createDb);
-
-describe('SparseTreeSpecific', () => {
-  let wasm: IWasmModule;
-  let pedersen: Pedersen;
-
-  beforeEach(async () => {
-    wasm = await CircuitsWasm.get();
-    pedersen = new Pedersen(wasm);
-  });
-
-  it('throws when index is bigger than (2^DEPTH - 1) ', async () => {
-    const db = levelup(createMemDown());
-    const depth = 32;
-    const tree = await createDb(db, pedersen, 'test', depth);
-
-    const index = 2n ** BigInt(depth);
-    await expect(tree.updateLeaf(Buffer.alloc(32), index)).rejects.toThrow();
-  });
-
-  it('updating non-empty leaf does not change tree size', async () => {
-    const depth = 32;
-    const maxIndex = 2 ** depth - 1;
-
-    const db = levelup(createMemDown());
-    const tree = await createDb(db, pedersen, 'test', depth);
-
-    const randomIndex = BigInt(Math.floor(Math.random() * maxIndex));
-    expect(tree.getNumLeaves(false)).toEqual(0n);
-
-    // Insert a leaf
-    await tree.updateLeaf(randomBytes(32), randomIndex);
-    expect(tree.getNumLeaves(true)).toEqual(1n);
-
-    // Update a leaf
-    await tree.updateLeaf(randomBytes(32), randomIndex);
-    expect(tree.getNumLeaves(true)).toEqual(1n);
-  });
-
-  it('deleting leaf decrements tree size', async () => {
-    const depth = 254;
-    const maxIndex = 2 ** depth - 1;
-
-    const db = levelup(createMemDown());
-    const tree = await createDb(db, pedersen, 'test', depth);
-
-    const randomIndex = BigInt(Math.floor(Math.random() * maxIndex));
-    expect(tree.getNumLeaves(false)).toEqual(0n);
-
-    // Insert a leaf
-    await tree.updateLeaf(randomBytes(32), randomIndex);
-    expect(tree.getNumLeaves(true)).toEqual(1n);
-
-    // Delete a leaf
-    await tree.updateLeaf(INITIAL_LEAF, randomIndex);
-    expect(tree.getNumLeaves(true)).toEqual(0n);
-  });
-
-  it('should have correct root and sibling path after in a "non-append-only" way', async () => {
-    const db = levelup(createMemDown());
-    const tree = await createDb(db, pedersen, 'test', 3);
-
-    const level2ZeroHash = pedersen.compress(INITIAL_LEAF, INITIAL_LEAF);
-    const level1ZeroHash = pedersen.compress(level2ZeroHash, level2ZeroHash);
-
-    expect(tree.getNumLeaves(false)).toEqual(0n);
-    expect(tree.getRoot(false)).toEqual(pedersen.compress(level1ZeroHash, level1ZeroHash));
-
-    // Insert leaf at index 3
-    let level1LeftHash: Buffer;
-    const leafAtIndex3 = randomBytes(32);
-    {
-      await tree.updateLeaf(leafAtIndex3, 3n);
-      expect(tree.getNumLeaves(true)).toEqual(1n);
-      const level2Hash = pedersen.compress(INITIAL_LEAF, leafAtIndex3);
-      level1LeftHash = pedersen.compress(level2ZeroHash, level2Hash);
-      const root = pedersen.compress(level1LeftHash, level1ZeroHash);
-      expect(tree.getRoot(true)).toEqual(root);
-      expect(await tree.getSiblingPath(3n, true)).toEqual(
-        new SiblingPath(TEST_TREE_DEPTH, [INITIAL_LEAF, level2ZeroHash, level1ZeroHash]),
-      );
-    }
-
-    // Insert leaf at index 6
-    let level1RightHash: Buffer;
-    {
-      const leafAtIndex6 = randomBytes(32);
-      await tree.updateLeaf(leafAtIndex6, 6n);
-      expect(tree.getNumLeaves(true)).toEqual(2n);
-      const level2Hash = pedersen.compress(leafAtIndex6, INITIAL_LEAF);
-      level1RightHash = pedersen.compress(level2ZeroHash, level2Hash);
-      const root = pedersen.compress(level1LeftHash, level1RightHash);
-      expect(tree.getRoot(true)).toEqual(root);
-      expect(await tree.getSiblingPath(6n, true)).toEqual(
-        new SiblingPath(TEST_TREE_DEPTH, [INITIAL_LEAF, level2ZeroHash, level1LeftHash]),
-      );
-    }
-
-    // Insert leaf at index 2
-    const leafAtIndex2 = randomBytes(32);
-    {
-      await tree.updateLeaf(leafAtIndex2, 2n);
-      expect(tree.getNumLeaves(true)).toEqual(3n);
-      const level2Hash = pedersen.compress(leafAtIndex2, leafAtIndex3);
-      level1LeftHash = pedersen.compress(level2ZeroHash, level2Hash);
-      const root = pedersen.compress(level1LeftHash, level1RightHash);
-      expect(tree.getRoot(true)).toEqual(root);
-      expect(await tree.getSiblingPath(2n, true)).toEqual(
-        new SiblingPath(TEST_TREE_DEPTH, [leafAtIndex3, level2ZeroHash, level1RightHash]),
-      );
-    }
-
-    // Updating leaf at index 3
-    {
-      const updatedLeafAtIndex3 = randomBytes(32);
-      await tree.updateLeaf(updatedLeafAtIndex3, 3n);
-      expect(tree.getNumLeaves(true)).toEqual(3n);
-      const level2Hash = pedersen.compress(leafAtIndex2, updatedLeafAtIndex3);
-      level1LeftHash = pedersen.compress(level2ZeroHash, level2Hash);
-      const root = pedersen.compress(level1LeftHash, level1RightHash);
-      expect(tree.getRoot(true)).toEqual(root);
-      expect(await tree.getSiblingPath(3n, true)).toEqual(
-        new SiblingPath(TEST_TREE_DEPTH, [leafAtIndex2, level2ZeroHash, level1RightHash]),
-      );
-    }
-  });
-
-  // This one is a performance measurement and is enabled only to check regression in performance.
-  it.skip('measures time of inserting 1000 leaves at random positions for depth 254', async () => {
-    const depth = 254;
-    const maxIndex = 2 ** depth - 1;
-
-    const db = levelup(createMemDown());
-    const tree = await createDb(db, pedersen, 'test', depth);
-
-    const leaves = Array.from({ length: 1000 }).map(() => randomBytes(32));
-    const indices = Array.from({ length: 1000 }).map(() => BigInt(Math.floor(Math.random() * maxIndex)));
-
-    const start = Date.now();
-    await Promise.all(leaves.map((leaf, i) => tree.updateLeaf(leaf, indices[i])));
-    const end = Date.now();
-    log(`Inserting 1000 leaves at random positions for depth 254 took ${end - start}ms`);
-  }, 300_000);
-});