@aztec/merkle-tree 0.16.1 → 0.16.3

package/dest/index.d.ts

@@ -4,9 +4,13 @@ export * from './interfaces/merkle_tree.js';
 export * from './interfaces/update_only_tree.js';
 export * from './pedersen.js';
 export * from './sparse_tree/sparse_tree.js';
-export * from './standard_indexed_tree/standard_indexed_tree.js';
+export { StandardIndexedTree } from './standard_indexed_tree/standard_indexed_tree.js';
 export * from './standard_tree/standard_tree.js';
 export { INITIAL_LEAF } from './tree_base.js';
 export { newTree } from './new_tree.js';
 export { loadTree } from './load_tree.js';
+export * from './snapshots/snapshot_builder.js';
+export * from './snapshots/full_snapshot.js';
+export * from './snapshots/append_only_snapshot.js';
+export * from './snapshots/indexed_tree_snapshot.js';
 //# sourceMappingURL=index.d.ts.map

package/dest/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,kCAAkC,CAAC;AACjD,cAAc,8BAA8B,CAAC;AAC7C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,kCAAkC,CAAC;AACjD,cAAc,eAAe,CAAC;AAC9B,cAAc,8BAA8B,CAAC;AAC7C,cAAc,kDAAkD,CAAC;AACjE,cAAc,kCAAkC,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,kCAAkC,CAAC;AACjD,cAAc,8BAA8B,CAAC;AAC7C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,kCAAkC,CAAC;AACjD,cAAc,eAAe,CAAC;AAC9B,cAAc,8BAA8B,CAAC;AAC7C,OAAO,EAAE,mBAAmB,EAAE,MAAM,kDAAkD,CAAC;AACvF,cAAc,kCAAkC,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,cAAc,iCAAiC,CAAC;AAChD,cAAc,8BAA8B,CAAC;AAC7C,cAAc,qCAAqC,CAAC;AACpD,cAAc,sCAAsC,CAAC"}

package/dest/index.js

@@ -4,9 +4,13 @@ export * from './interfaces/merkle_tree.js';
 export * from './interfaces/update_only_tree.js';
 export * from './pedersen.js';
 export * from './sparse_tree/sparse_tree.js';
-export * from './standard_indexed_tree/standard_indexed_tree.js';
+export { StandardIndexedTree } from './standard_indexed_tree/standard_indexed_tree.js';
 export * from './standard_tree/standard_tree.js';
 export { INITIAL_LEAF } from './tree_base.js';
 export { newTree } from './new_tree.js';
 export { loadTree } from './load_tree.js';
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi9zcmMvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsY0FBYyxrQ0FBa0MsQ0FBQztBQUNqRCxjQUFjLDhCQUE4QixDQUFDO0FBQzdDLGNBQWMsNkJBQTZCLENBQUM7QUFDNUMsY0FBYyxrQ0FBa0MsQ0FBQztBQUNqRCxjQUFjLGVBQWUsQ0FBQztBQUM5QixjQUFjLDhCQUE4QixDQUFDO0FBQzdDLGNBQWMsa0RBQWtELENBQUM7QUFDakUsY0FBYyxrQ0FBa0MsQ0FBQztBQUNqRCxPQUFPLEVBQUUsWUFBWSxFQUFFLE1BQU0sZ0JBQWdCLENBQUM7QUFDOUMsT0FBTyxFQUFFLE9BQU8sRUFBRSxNQUFNLGVBQWUsQ0FBQztBQUN4QyxPQUFPLEVBQUUsUUFBUSxFQUFFLE1BQU0sZ0JBQWdCLENBQUMifQ==
+export * from './snapshots/snapshot_builder.js';
+export * from './snapshots/full_snapshot.js';
+export * from './snapshots/append_only_snapshot.js';
+export * from './snapshots/indexed_tree_snapshot.js';
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi9zcmMvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsY0FBYyxrQ0FBa0MsQ0FBQztBQUNqRCxjQUFjLDhCQUE4QixDQUFDO0FBQzdDLGNBQWMsNkJBQTZCLENBQUM7QUFDNUMsY0FBYyxrQ0FBa0MsQ0FBQztBQUNqRCxjQUFjLGVBQWUsQ0FBQztBQUM5QixjQUFjLDhCQUE4QixDQUFDO0FBQzdDLE9BQU8sRUFBRSxtQkFBbUIsRUFBRSxNQUFNLGtEQUFrRCxDQUFDO0FBQ3ZGLGNBQWMsa0NBQWtDLENBQUM7QUFDakQsT0FBTyxFQUFFLFlBQVksRUFBRSxNQUFNLGdCQUFnQixDQUFDO0FBQzlDLE9BQU8sRUFBRSxPQUFPLEVBQUUsTUFBTSxlQUFlLENBQUM7QUFDeEMsT0FBTyxFQUFFLFFBQVEsRUFBRSxNQUFNLGdCQUFnQixDQUFDO0FBQzFDLGNBQWMsaUNBQWlDLENBQUM7QUFDaEQsY0FBYyw4QkFBOEIsQ0FBQztBQUM3QyxjQUFjLHFDQUFxQyxDQUFDO0FBQ3BELGNBQWMsc0NBQXNDLENBQUMifQ==

package/dest/interfaces/append_only_tree.d.ts

@@ -1,9 +1,10 @@
 /// <reference types="node" resolution-mode="require"/>
+import { TreeSnapshotBuilder } from '../snapshots/snapshot_builder.js';
 import { MerkleTree } from './merkle_tree.js';
 /**
  * A Merkle tree that supports only appending leaves and not updating existing leaves.
  */
-export interface AppendOnlyTree extends MerkleTree {
+export interface AppendOnlyTree extends MerkleTree, TreeSnapshotBuilder {
     /**
      * Appends a set of leaf values to the tree.
      * @param leaves - The set of leaves to be appended.

package/dest/interfaces/append_only_tree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"append_only_tree.d.ts","sourceRoot":"","sources":["../../src/interfaces/append_only_tree.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE9C;;GAEG;AACH,MAAM,WAAW,cAAe,SAAQ,UAAU;IAChD;;;OAGG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC/C"}
+{"version":3,"file":"append_only_tree.d.ts","sourceRoot":"","sources":["../../src/interfaces/append_only_tree.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE9C;;GAEG;AACH,MAAM,WAAW,cAAe,SAAQ,UAAU,EAAE,mBAAmB;IACrE;;;OAGG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC/C"}

package/dest/interfaces/indexed_tree.d.ts

@@ -1,23 +1,44 @@
 /// <reference types="node" resolution-mode="require"/>
+import { IndexedTreeLeafPreimage } from '@aztec/foundation/trees';
 import { SiblingPath } from '@aztec/types';
-import { LowLeafWitnessData } from '../index.js';
 import { AppendOnlyTree } from './append_only_tree.js';
 /**
- * A leaf of a tree.
+ * All of the data to be return during batch insertion.
  */
-export interface LeafData {
+export interface LowLeafWitnessData<N extends number> {
     /**
-     * A value of the leaf.
+     * Preimage of the low nullifier that proves non membership.
      */
-    value: bigint;
+    leafPreimage: IndexedTreeLeafPreimage;
     /**
-     * An index of the next leaf.
+     * Sibling path to prove membership of low nullifier.
      */
-    nextIndex: bigint;
+    siblingPath: SiblingPath<N>;
     /**
-     * A value of the next leaf.
+     * The index of low nullifier.
      */
-    nextValue: bigint;
+    index: bigint;
+}
+/**
+ * The result of a batch insertion in an indexed merkle tree.
+ */
+export interface BatchInsertionResult<TreeHeight extends number, SubtreeSiblingPathHeight extends number> {
+    /**
+     * Data for the leaves to be updated when inserting the new ones.
+     */
+    lowLeavesWitnessData?: LowLeafWitnessData<TreeHeight>[];
+    /**
+     * Sibling path "pointing to" where the new subtree should be inserted into the tree.
+     */
+    newSubtreeSiblingPath: SiblingPath<SubtreeSiblingPathHeight>;
+    /**
+     * The new leaves being inserted in high to low order. This order corresponds with the order of the low leaves witness.
+     */
+    sortedNewLeaves: Buffer[];
+    /**
+     * The indexes of the sorted new leaves to the original ones.
+     */
+    sortedNewLeavesIndexes: number[];
 }
 /**
  * Indexed merkle tree.
@@ -29,29 +50,29 @@ export interface IndexedTree extends AppendOnlyTree {
      * @param includeUncommitted - If true, the uncommitted changes are included in the search.
      * @returns The found leaf index and a flag indicating if the corresponding leaf's value is equal to `newValue`.
      */
-    findIndexOfPreviousValue(newValue: bigint, includeUncommitted: boolean): {
+    findIndexOfPreviousKey(newValue: bigint, includeUncommitted: boolean): Promise<{
         /**
          * The index of the found leaf.
          */
-        index: number;
+        index: bigint;
         /**
          * A flag indicating if the corresponding leaf's value is equal to `newValue`.
          */
         alreadyPresent: boolean;
-    };
+    } | undefined>;
     /**
-     * Gets the latest LeafData copy.
-     * @param index - Index of the leaf of which to obtain the LeafData copy.
+     * Gets the latest LeafPreimage copy.
+     * @param index - Index of the leaf of which to obtain the LeafPreimage copy.
      * @param includeUncommitted - If true, the uncommitted changes are included in the search.
-     * @returns A copy of the leaf data at the given index or undefined if the leaf was not found.
+     * @returns A copy of the leaf preimage at the given index or undefined if the leaf was not found.
      */
-    getLatestLeafDataCopy(index: number, includeUncommitted: boolean): LeafData | undefined;
+    getLatestLeafPreimageCopy(index: bigint, includeUncommitted: boolean): Promise<IndexedTreeLeafPreimage | undefined>;
     /**
      * Batch insert multiple leaves into the tree.
      * @param leaves - Leaves to insert into the tree.
      * @param subtreeHeight - Height of the subtree.
      * @param includeUncommitted - If true, the uncommitted changes are included in the search.
      */
-    batchInsert<TreeHeight extends number, SubtreeHeight extends number, SubtreeSiblingPathHeight extends number>(leaves: Buffer[], subtreeHeight: SubtreeHeight, includeUncommitted: boolean): Promise<[LowLeafWitnessData<TreeHeight>[], SiblingPath<SubtreeSiblingPathHeight>] | [undefined, SiblingPath<SubtreeSiblingPathHeight>]>;
+    batchInsert<TreeHeight extends number, SubtreeHeight extends number, SubtreeSiblingPathHeight extends number>(leaves: Buffer[], subtreeHeight: SubtreeHeight, includeUncommitted: boolean): Promise<BatchInsertionResult<TreeHeight, SubtreeSiblingPathHeight>>;
 }
 //# sourceMappingURL=indexed_tree.d.ts.map

package/dest/interfaces/indexed_tree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"indexed_tree.d.ts","sourceRoot":"","sources":["../../src/interfaces/indexed_tree.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAEvD;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;IACd;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,WAAY,SAAQ,cAAc;IACjD;;;;;OAKG;IACH,wBAAwB,CACtB,QAAQ,EAAE,MAAM,EAChB,kBAAkB,EAAE,OAAO,GAC1B;QACD;;WAEG;QACH,KAAK,EAAE,MAAM,CAAC;QACd;;WAEG;QACH,cAAc,EAAE,OAAO,CAAC;KACzB,CAAC;IAEF;;;;;OAKG;IACH,qBAAqB,CAAC,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS,CAAC;IAExF;;;;;OAKG;IACH,WAAW,CAAC,UAAU,SAAS,MAAM,EAAE,aAAa,SAAS,MAAM,EAAE,wBAAwB,SAAS,MAAM,EAC1G,MAAM,EAAE,MAAM,EAAE,EAChB,aAAa,EAAE,aAAa,EAC5B,kBAAkB,EAAE,OAAO,GAC1B,OAAO,CACN,CAAC,kBAAkB,CAAC,UAAU,CAAC,EAAE,EAAE,WAAW,CAAC,wBAAwB,CAAC,CAAC,GACzE,CAAC,SAAS,EAAE,WAAW,CAAC,wBAAwB,CAAC,CAAC,CACrD,CAAC;CACH"}
+{"version":3,"file":"indexed_tree.d.ts","sourceRoot":"","sources":["../../src/interfaces/indexed_tree.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,uBAAuB,EAAE,MAAM,yBAAyB,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAEvD;;GAEG;AACH,MAAM,WAAW,kBAAkB,CAAC,CAAC,SAAS,MAAM;IAClD;;OAEG;IACH,YAAY,EAAE,uBAAuB,CAAC;IACtC;;OAEG;IACH,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IAC5B;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB,CAAC,UAAU,SAAS,MAAM,EAAE,wBAAwB,SAAS,MAAM;IACtG;;OAEG;IACH,oBAAoB,CAAC,EAAE,kBAAkB,CAAC,UAAU,CAAC,EAAE,CAAC;IACxD;;OAEG;IACH,qBAAqB,EAAE,WAAW,CAAC,wBAAwB,CAAC,CAAC;IAC7D;;OAEG;IACH,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B;;OAEG;IACH,sBAAsB,EAAE,MAAM,EAAE,CAAC;CAClC;AAED;;GAEG;AACH,MAAM,WAAW,WAAY,SAAQ,cAAc;IACjD;;;;;OAKG;IACH,sBAAsB,CACpB,QAAQ,EAAE,MAAM,EAChB,kBAAkB,EAAE,OAAO,GAC1B,OAAO,CACN;QACE;;WAEG;QACH,KAAK,EAAE,MAAM,CAAC;QACd;;WAEG;QACH,cAAc,EAAE,OAAO,CAAC;KACzB,GACD,SAAS,CACZ,CAAC;IAEF;;;;;OAKG;IACH,yBAAyB,CAAC,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE,OAAO,GAAG,OAAO,CAAC,uBAAuB,GAAG,SAAS,CAAC,CAAC;IAEpH;;;;;OAKG;IACH,WAAW,CAAC,UAAU,SAAS,MAAM,EAAE,aAAa,SAAS,MAAM,EAAE,wBAAwB,SAAS,MAAM,EAC1G,MAAM,EAAE,MAAM,EAAE,EAChB,aAAa,EAAE,aAAa,EAC5B,kBAAkB,EAAE,OAAO,GAC1B,OAAO,CAAC,oBAAoB,CAAC,UAAU,EAAE,wBAAwB,CAAC,CAAC,CAAC;CACxE"}

package/dest/interfaces/merkle_tree.d.ts

@@ -43,5 +43,12 @@ export interface MerkleTree extends SiblingPathSource {
      * @param includeUncommitted - Set to true to include uncommitted updates in the data set.
      */
     getLeafValue(index: bigint, includeUncommitted: boolean): Promise<Buffer | undefined>;
+    /**
+     * Returns the index of a leaf given its value, or undefined if no leaf with that value is found.
+     * @param leaf - The leaf value to look for.
+     * @param includeUncommitted - Indicates whether to include uncommitted data.
+     * @returns The index of the first leaf found with a given value (undefined if not found).
+     */
+    findLeafIndex(leaf: Buffer, includeUncommitted: boolean): Promise<bigint | undefined>;
 }
 //# sourceMappingURL=merkle_tree.d.ts.map

package/dest/interfaces/merkle_tree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"merkle_tree.d.ts","sourceRoot":"","sources":["../../src/interfaces/merkle_tree.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC;;;;OAIG;IACH,cAAc,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;CACvG;AAED;;GAEG;AACH,MAAM,WAAW,UAAW,SAAQ,iBAAiB;IACnD;;;OAGG;IACH,OAAO,CAAC,kBAAkB,EAAE,OAAO,GAAG,MAAM,CAAC;IAE7C;;;OAGG;IACH,YAAY,CAAC,kBAAkB,EAAE,OAAO,GAAG,MAAM,CAAC;IAElD;;OAEG;IACH,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAExB;;OAEG;IACH,QAAQ,IAAI,MAAM,CAAC;IAEnB;;OAEG;IACH,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAE1B;;;;OAIG;IACH,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;CACvF"}
+{"version":3,"file":"merkle_tree.d.ts","sourceRoot":"","sources":["../../src/interfaces/merkle_tree.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC;;;;OAIG;IACH,cAAc,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;CACvG;AAED;;GAEG;AACH,MAAM,WAAW,UAAW,SAAQ,iBAAiB;IACnD;;;OAGG;IACH,OAAO,CAAC,kBAAkB,EAAE,OAAO,GAAG,MAAM,CAAC;IAE7C;;;OAGG;IACH,YAAY,CAAC,kBAAkB,EAAE,OAAO,GAAG,MAAM,CAAC;IAElD;;OAEG;IACH,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAExB;;OAEG;IACH,QAAQ,IAAI,MAAM,CAAC;IAEnB;;OAEG;IACH,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAE1B;;;;OAIG;IACH,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;IAEtF;;;;;OAKG;IACH,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,kBAAkB,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;CACvF"}

package/dest/interfaces/update_only_tree.d.ts

@@ -1,15 +1,15 @@
 /// <reference types="node" resolution-mode="require"/>
-import { LeafData } from '../index.js';
+import { TreeSnapshotBuilder } from '../snapshots/snapshot_builder.js';
 import { MerkleTree } from './merkle_tree.js';
 /**
  * A Merkle tree that supports updates at arbitrary indices but not appending.
  */
-export interface UpdateOnlyTree extends MerkleTree {
+export interface UpdateOnlyTree extends MerkleTree, TreeSnapshotBuilder {
     /**
      * Updates a leaf at a given index in the tree.
      * @param leaf - The leaf value to be updated.
      * @param index - The leaf to be updated.
      */
-    updateLeaf(leaf: Buffer | LeafData, index: bigint): Promise<void>;
+    updateLeaf(leaf: Buffer, index: bigint): Promise<void>;
 }
 //# sourceMappingURL=update_only_tree.d.ts.map

package/dest/interfaces/update_only_tree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"update_only_tree.d.ts","sourceRoot":"","sources":["../../src/interfaces/update_only_tree.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE9C;;GAEG;AACH,MAAM,WAAW,cAAe,SAAQ,UAAU;IAChD;;;;OAIG;IAEH,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACnE"}
+{"version":3,"file":"update_only_tree.d.ts","sourceRoot":"","sources":["../../src/interfaces/update_only_tree.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE9C;;GAEG;AACH,MAAM,WAAW,cAAe,SAAQ,UAAU,EAAE,mBAAmB;IACrE;;;;OAIG;IACH,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACxD"}

package/dest/load_tree.d.ts

@@ -1,3 +1,4 @@
+/// <reference types="node" resolution-mode="require"/>
 import { Hasher } from '@aztec/types';
 import { LevelUp } from 'levelup';
 import { TreeBase } from './tree_base.js';
@@ -9,5 +10,5 @@ import { TreeBase } from './tree_base.js';
  * @param name - Name of the tree.
  * @returns The newly created tree.
  */
-export declare function loadTree<T extends TreeBase>(c: new (...args: any[]) => T, db: LevelUp, hasher: Hasher, name: string): Promise<T>;
+export declare function loadTree<T extends TreeBase>(c: new (db: LevelUp, hasher: Hasher, name: string, depth: number, size: bigint, root: Buffer) => T, db: LevelUp, hasher: Hasher, name: string): Promise<T>;
 //# sourceMappingURL=load_tree.d.ts.map

package/dest/load_tree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"load_tree.d.ts","sourceRoot":"","sources":["../src/load_tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAc,MAAM,gBAAgB,CAAC;AAEtD;;;;;;;GAOG;AACH,wBAAsB,QAAQ,CAAC,CAAC,SAAS,QAAQ,EAC/C,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,EAC5B,EAAE,EAAE,OAAO,EACX,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,GACX,OAAO,CAAC,CAAC,CAAC,CAMZ"}
+{"version":3,"file":"load_tree.d.ts","sourceRoot":"","sources":["../src/load_tree.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAc,MAAM,gBAAgB,CAAC;AAEtD;;;;;;;GAOG;AACH,wBAAsB,QAAQ,CAAC,CAAC,SAAS,QAAQ,EAC/C,CAAC,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,CAAC,EAClG,EAAE,EAAE,OAAO,EACX,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,GACX,OAAO,CAAC,CAAC,CAAC,CAMZ"}

package/dest/load_tree.js

@@ -11,7 +11,6 @@ export async function loadTree(c, db, hasher, name) {
     const meta = await db.get(name);
     const { root, depth, size } = decodeMeta(meta);
     const tree = new c(db, hasher, name, depth, size, root);
-    await tree.initFromDb();
     return tree;
 }
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibG9hZF90cmVlLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vc3JjL2xvYWRfdHJlZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFJQSxPQUFPLEVBQVksVUFBVSxFQUFFLE1BQU0sZ0JBQWdCLENBQUM7QUFFdEQ7Ozs7Ozs7R0FPRztBQUNILE1BQU0sQ0FBQyxLQUFLLFVBQVUsUUFBUSxDQUM1QixDQUE0QixFQUM1QixFQUFXLEVBQ1gsTUFBYyxFQUNkLElBQVk7SUFFWixNQUFNLElBQUksR0FBVyxNQUFNLEVBQUUsQ0FBQyxHQUFHLENBQUMsSUFBSSxDQUFDLENBQUM7SUFDeEMsTUFBTSxFQUFFLElBQUksRUFBRSxLQUFLLEVBQUUsSUFBSSxFQUFFLEdBQUcsVUFBVSxDQUFDLElBQUksQ0FBQyxDQUFDO0lBQy9DLE1BQU0sSUFBSSxHQUFHLElBQUksQ0FBQyxDQUFDLEVBQUUsRUFBRSxNQUFNLEVBQUUsSUFBSSxFQUFFLEtBQUssRUFBRSxJQUFJLEVBQUUsSUFBSSxDQUFDLENBQUM7SUFDeEQsTUFBTSxJQUFJLENBQUMsVUFBVSxFQUFFLENBQUM7SUFDeEIsT0FBTyxJQUFJLENBQUM7QUFDZCxDQUFDIn0=
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibG9hZF90cmVlLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vc3JjL2xvYWRfdHJlZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFJQSxPQUFPLEVBQVksVUFBVSxFQUFFLE1BQU0sZ0JBQWdCLENBQUM7QUFFdEQ7Ozs7Ozs7R0FPRztBQUNILE1BQU0sQ0FBQyxLQUFLLFVBQVUsUUFBUSxDQUM1QixDQUFrRyxFQUNsRyxFQUFXLEVBQ1gsTUFBYyxFQUNkLElBQVk7SUFFWixNQUFNLElBQUksR0FBVyxNQUFNLEVBQUUsQ0FBQyxHQUFHLENBQUMsSUFBSSxDQUFDLENBQUM7SUFDeEMsTUFBTSxFQUFFLElBQUksRUFBRSxLQUFLLEVBQUUsSUFBSSxFQUFFLEdBQUcsVUFBVSxDQUFDLElBQUksQ0FBQyxDQUFDO0lBRS9DLE1BQU0sSUFBSSxHQUFHLElBQUksQ0FBQyxDQUFDLEVBQUUsRUFBRSxNQUFNLEVBQUUsSUFBSSxFQUFFLEtBQUssRUFBRSxJQUFJLEVBQUUsSUFBSSxDQUFDLENBQUM7SUFDeEQsT0FBTyxJQUFJLENBQUM7QUFDZCxDQUFDIn0=

package/dest/new_tree.d.ts

@@ -11,5 +11,5 @@ import { TreeBase } from './tree_base.js';
  * @param prefilledSize - A number of leaves that are prefilled with values.
  * @returns The newly created tree.
  */
-export declare function newTree<T extends TreeBase>(c: new (...args: any[]) => T, db: LevelUp, hasher: Hasher, name: string, depth: number, prefilledSize?: number): Promise<T>;
+export declare function newTree<T extends TreeBase>(c: new (db: LevelUp, hasher: Hasher, name: string, depth: number, size: bigint) => T, db: LevelUp, hasher: Hasher, name: string, depth: number, prefilledSize?: number): Promise<T>;
 //# sourceMappingURL=new_tree.d.ts.map

package/dest/new_tree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"new_tree.d.ts","sourceRoot":"","sources":["../src/new_tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C;;;;;;;;;GASG;AACH,wBAAsB,OAAO,CAAC,CAAC,SAAS,QAAQ,EAC9C,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,EAC5B,EAAE,EAAE,OAAO,EACX,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,aAAa,SAAI,GAChB,OAAO,CAAC,CAAC,CAAC,CAIZ"}
+{"version":3,"file":"new_tree.d.ts","sourceRoot":"","sources":["../src/new_tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C;;;;;;;;;GASG;AACH,wBAAsB,OAAO,CAAC,CAAC,SAAS,QAAQ,EAC9C,CAAC,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,CAAC,EACpF,EAAE,EAAE,OAAO,EACX,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,aAAa,SAAI,GAChB,OAAO,CAAC,CAAC,CAAC,CAIZ"}

package/dest/new_tree.js

@@ -9,8 +9,8 @@
  * @returns The newly created tree.
  */
 export async function newTree(c, db, hasher, name, depth, prefilledSize = 1) {
-    const tree = new c(db, hasher, name, depth, 0n, undefined);
+    const tree = new c(db, hasher, name, depth, 0n);
     await tree.init(prefilledSize);
     return tree;
 }
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibmV3X3RyZWUuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi9zcmMvbmV3X3RyZWUudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBTUE7Ozs7Ozs7OztHQVNHO0FBQ0gsTUFBTSxDQUFDLEtBQUssVUFBVSxPQUFPLENBQzNCLENBQTRCLEVBQzVCLEVBQVcsRUFDWCxNQUFjLEVBQ2QsSUFBWSxFQUNaLEtBQWEsRUFDYixhQUFhLEdBQUcsQ0FBQztJQUVqQixNQUFNLElBQUksR0FBRyxJQUFJLENBQUMsQ0FBQyxFQUFFLEVBQUUsTUFBTSxFQUFFLElBQUksRUFBRSxLQUFLLEVBQUUsRUFBRSxFQUFFLFNBQVMsQ0FBQyxDQUFDO0lBQzNELE1BQU0sSUFBSSxDQUFDLElBQUksQ0FBQyxhQUFhLENBQUMsQ0FBQztJQUMvQixPQUFPLElBQUksQ0FBQztBQUNkLENBQUMifQ==
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibmV3X3RyZWUuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi9zcmMvbmV3X3RyZWUudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBTUE7Ozs7Ozs7OztHQVNHO0FBQ0gsTUFBTSxDQUFDLEtBQUssVUFBVSxPQUFPLENBQzNCLENBQW9GLEVBQ3BGLEVBQVcsRUFDWCxNQUFjLEVBQ2QsSUFBWSxFQUNaLEtBQWEsRUFDYixhQUFhLEdBQUcsQ0FBQztJQUVqQixNQUFNLElBQUksR0FBRyxJQUFJLENBQUMsQ0FBQyxFQUFFLEVBQUUsTUFBTSxFQUFFLElBQUksRUFBRSxLQUFLLEVBQUUsRUFBRSxDQUFDLENBQUM7SUFDaEQsTUFBTSxJQUFJLENBQUMsSUFBSSxDQUFDLGFBQWEsQ0FBQyxDQUFDO0lBQy9CLE9BQU8sSUFBSSxDQUFDO0FBQ2QsQ0FBQyJ9

package/dest/snapshots/append_only_snapshot.d.ts

@@ -0,0 +1,30 @@
+import { Hasher } from '@aztec/types';
+import { LevelUp } from 'levelup';
+import { AppendOnlyTree } from '../interfaces/append_only_tree.js';
+import { TreeBase } from '../tree_base.js';
+import { TreeSnapshot, TreeSnapshotBuilder } from './snapshot_builder.js';
+/**
+ * A more space-efficient way of storing snapshots of AppendOnlyTrees that trades space need for slower
+ * sibling path reads.
+ *
+ * Complexity:
+ *
+ * N - count of non-zero nodes in tree
+ * M - count of snapshots
+ * H - tree height
+ *
+ * Space complexity: O(N + M) (N nodes - stores the last snapshot for each node and M - ints, for each snapshot stores up to which leaf its written to)
+ * Sibling path access:
+ *  Best case: O(H) database reads + O(1) hashes
+ *  Worst case: O(H) database reads + O(H) hashes
+ */
+export declare class AppendOnlySnapshotBuilder implements TreeSnapshotBuilder {
+    #private;
+    private db;
+    private tree;
+    private hasher;
+    constructor(db: LevelUp, tree: TreeBase & AppendOnlyTree, hasher: Hasher);
+    getSnapshot(block: number): Promise<TreeSnapshot>;
+    snapshot(block: number): Promise<TreeSnapshot>;
+}
+//# sourceMappingURL=append_only_snapshot.d.ts.map

package/dest/snapshots/append_only_snapshot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"append_only_snapshot.d.ts","sourceRoot":"","sources":["../../src/snapshots/append_only_snapshot.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAe,MAAM,cAAc,CAAC;AAEnD,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAElC,OAAO,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAC;AACnE,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAc1E;;;;;;;;;;;;;;GAcG;AACH,qBAAa,yBAA0B,YAAW,mBAAmB;;IACvD,OAAO,CAAC,EAAE;IAAW,OAAO,CAAC,IAAI;IAA6B,OAAO,CAAC,MAAM;gBAApE,EAAE,EAAE,OAAO,EAAU,IAAI,EAAE,QAAQ,GAAG,cAAc,EAAU,MAAM,EAAE,MAAM;IAC1F,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;IAUjD,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;CA2ErD"}

package/dest/snapshots/append_only_snapshot.js

@@ -0,0 +1,200 @@
+var _AppendOnlySnapshotBuilder_instances, _AppendOnlySnapshotBuilder_getSnapshotMeta, _AppendOnlySnapshot_instances, _AppendOnlySnapshot_getHistoricalNodeValue, _AppendOnlySnapshot_getBlockNumberThatModifiedNode;
+import { __classPrivateFieldGet } from "tslib";
+import { SiblingPath } from '@aztec/types';
+// stores the last block that modified this node
+const nodeModifiedAtBlockKey = (treeName, level, index) => `snapshot:node:${treeName}:${level}:${index}:block`;
+// stores the value of the node at the above block
+const historicalNodeKey = (treeName, level, index) => `snapshot:node:${treeName}:${level}:${index}:value`;
+// metadata for a snapshot
+const snapshotRootKey = (treeName, block) => `snapshot:root:${treeName}:${block}`;
+const snapshotNumLeavesKey = (treeName, block) => `snapshot:numLeaves:${treeName}:${block}`;
+/**
+ * A more space-efficient way of storing snapshots of AppendOnlyTrees that trades space need for slower
+ * sibling path reads.
+ *
+ * Complexity:
+ *
+ * N - count of non-zero nodes in tree
+ * M - count of snapshots
+ * H - tree height
+ *
+ * Space complexity: O(N + M) (N nodes - stores the last snapshot for each node and M - ints, for each snapshot stores up to which leaf its written to)
+ * Sibling path access:
+ *  Best case: O(H) database reads + O(1) hashes
+ *  Worst case: O(H) database reads + O(H) hashes
+ */
+export class AppendOnlySnapshotBuilder {
+    constructor(db, tree, hasher) {
+        _AppendOnlySnapshotBuilder_instances.add(this);
+        this.db = db;
+        this.tree = tree;
+        this.hasher = hasher;
+    }
+    async getSnapshot(block) {
+        const meta = await __classPrivateFieldGet(this, _AppendOnlySnapshotBuilder_instances, "m", _AppendOnlySnapshotBuilder_getSnapshotMeta).call(this, block);
+        if (typeof meta === 'undefined') {
+            throw new Error(`Snapshot for tree ${this.tree.getName()} at block ${block} does not exist`);
+        }
+        return new AppendOnlySnapshot(this.db, block, meta.numLeaves, meta.root, this.tree, this.hasher);
+    }
+    async snapshot(block) {
+        const meta = await __classPrivateFieldGet(this, _AppendOnlySnapshotBuilder_instances, "m", _AppendOnlySnapshotBuilder_getSnapshotMeta).call(this, block);
+        if (typeof meta !== 'undefined') {
+            // no-op, we already have a snapshot
+            return new AppendOnlySnapshot(this.db, block, meta.numLeaves, meta.root, this.tree, this.hasher);
+        }
+        const batch = this.db.batch();
+        const root = this.tree.getRoot(false);
+        const depth = this.tree.getDepth();
+        const treeName = this.tree.getName();
+        const queue = [[root, 0, 0n]];
+        // walk the tree in BF and store latest nodes
+        while (queue.length > 0) {
+            const [node, level, index] = queue.shift();
+            const historicalValue = await this.db.get(historicalNodeKey(treeName, level, index)).catch(() => undefined);
+            if (!historicalValue || !node.equals(historicalValue)) {
+                // we've never seen this node before or it's different than before
+                // update the historical tree and tag it with the block that modified it
+                batch.put(nodeModifiedAtBlockKey(treeName, level, index), String(block));
+                batch.put(historicalNodeKey(treeName, level, index), node);
+            }
+            else {
+                // if this node hasn't changed, that means, nothing below it has changed either
+                continue;
+            }
+            if (level + 1 > depth) {
+                // short circuit if we've reached the leaf level
+                // otherwise getNode might throw if we ask for the children of a leaf
+                continue;
+            }
+            // these could be undefined because zero hashes aren't stored in the tree
+            const [lhs, rhs] = await Promise.all([
+                this.tree.getNode(level + 1, 2n * index),
+                this.tree.getNode(level + 1, 2n * index + 1n),
+            ]);
+            if (lhs) {
+                queue.push([lhs, level + 1, 2n * index]);
+            }
+            if (rhs) {
+                queue.push([rhs, level + 1, 2n * index + 1n]);
+            }
+        }
+        const numLeaves = this.tree.getNumLeaves(false);
+        batch.put(snapshotNumLeavesKey(treeName, block), String(numLeaves));
+        batch.put(snapshotRootKey(treeName, block), root);
+        await batch.write();
+        return new AppendOnlySnapshot(this.db, block, numLeaves, root, this.tree, this.hasher);
+    }
+}
+_AppendOnlySnapshotBuilder_instances = new WeakSet(), _AppendOnlySnapshotBuilder_getSnapshotMeta = async function _AppendOnlySnapshotBuilder_getSnapshotMeta(block) {
+    try {
+        const treeName = this.tree.getName();
+        const root = await this.db.get(snapshotRootKey(treeName, block));
+        const numLeaves = BigInt(await this.db.get(snapshotNumLeavesKey(treeName, block)));
+        return { root, numLeaves };
+    }
+    catch (err) {
+        return undefined;
+    }
+};
+/**
+ * a
+ */
+class AppendOnlySnapshot {
+    constructor(db, block, leafCount, historicalRoot, tree, hasher) {
+        _AppendOnlySnapshot_instances.add(this);
+        this.db = db;
+        this.block = block;
+        this.leafCount = leafCount;
+        this.historicalRoot = historicalRoot;
+        this.tree = tree;
+        this.hasher = hasher;
+    }
+    async getSiblingPath(index) {
+        const path = [];
+        const depth = this.tree.getDepth();
+        let level = depth;
+        while (level > 0) {
+            const isRight = index & 0x01n;
+            const siblingIndex = isRight ? index - 1n : index + 1n;
+            const sibling = await __classPrivateFieldGet(this, _AppendOnlySnapshot_instances, "m", _AppendOnlySnapshot_getHistoricalNodeValue).call(this, level, siblingIndex);
+            path.push(sibling);
+            level -= 1;
+            index >>= 1n;
+        }
+        return new SiblingPath(depth, path);
+    }
+    getDepth() {
+        return this.tree.getDepth();
+    }
+    getNumLeaves() {
+        return this.leafCount;
+    }
+    getRoot() {
+        // we could recompute it, but it's way cheaper to just store the root
+        return this.historicalRoot;
+    }
+    async getLeafValue(index) {
+        const leafLevel = this.getDepth();
+        const blockNumber = await __classPrivateFieldGet(this, _AppendOnlySnapshot_instances, "m", _AppendOnlySnapshot_getBlockNumberThatModifiedNode).call(this, leafLevel, index);
+        // leaf hasn't been set yet
+        if (typeof blockNumber === 'undefined') {
+            return undefined;
+        }
+        // leaf was set some time in the past
+        if (blockNumber <= this.block) {
+            return this.db.get(historicalNodeKey(this.tree.getName(), leafLevel, index));
+        }
+        // leaf has been set but in a block in the future
+        return undefined;
+    }
+    async findLeafIndex(value) {
+        const numLeaves = this.getNumLeaves();
+        for (let i = 0n; i < numLeaves; i++) {
+            const currentValue = await this.getLeafValue(i);
+            if (currentValue && currentValue.equals(value)) {
+                return i;
+            }
+        }
+        return undefined;
+    }
+}
+_AppendOnlySnapshot_instances = new WeakSet(), _AppendOnlySnapshot_getHistoricalNodeValue = async function _AppendOnlySnapshot_getHistoricalNodeValue(level, index) {
+    const blockNumber = await __classPrivateFieldGet(this, _AppendOnlySnapshot_instances, "m", _AppendOnlySnapshot_getBlockNumberThatModifiedNode).call(this, level, index);
+    // node has never been set
+    if (typeof blockNumber === 'undefined') {
+        return this.tree.getZeroHash(level);
+    }
+    // node was set some time in the past
+    if (blockNumber <= this.block) {
+        return this.db.get(historicalNodeKey(this.tree.getName(), level, index));
+    }
+    // the node has been modified since this snapshot was taken
+    // because we're working with an AppendOnly tree, historical leaves never change
+    // so what we do instead is rebuild this Merkle path up using zero hashes as needed
+    // worst case this will do O(H) hashes
+    //
+    // we first check if this subtree was touched by the block
+    // compare how many leaves this block added to the leaf interval of this subtree
+    // if they don't intersect then the whole subtree was a hash of zero
+    // if they do then we need to rebuild the merkle tree
+    const depth = this.tree.getDepth();
+    const leafStart = index * 2n ** BigInt(depth - level);
+    if (leafStart >= this.leafCount) {
+        return this.tree.getZeroHash(level);
+    }
+    const [lhs, rhs] = await Promise.all([
+        __classPrivateFieldGet(this, _AppendOnlySnapshot_instances, "m", _AppendOnlySnapshot_getHistoricalNodeValue).call(this, level + 1, 2n * index),
+        __classPrivateFieldGet(this, _AppendOnlySnapshot_instances, "m", _AppendOnlySnapshot_getHistoricalNodeValue).call(this, level + 1, 2n * index + 1n),
+    ]);
+    return this.hasher.hash(lhs, rhs);
+}, _AppendOnlySnapshot_getBlockNumberThatModifiedNode = async function _AppendOnlySnapshot_getBlockNumberThatModifiedNode(level, index) {
+    try {
+        const value = await this.db.get(nodeModifiedAtBlockKey(this.tree.getName(), level, index));
+        return parseInt(value.toString(), 10);
+    }
+    catch (err) {
+        return undefined;
+    }
+};
+//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"append_only_snapshot.js","sourceRoot":"","sources":["../../src/snapshots/append_only_snapshot.ts"],"names":[],"mappings":";;AAAA,OAAO,EAAU,WAAW,EAAE,MAAM,cAAc,CAAC;AAQnD,gDAAgD;AAChD,MAAM,sBAAsB,GAAG,CAAC,QAAgB,EAAE,KAAa,EAAE,KAAa,EAAE,EAAE,CAChF,iBAAiB,QAAQ,IAAI,KAAK,IAAI,KAAK,QAAQ,CAAC;AAEtD,kDAAkD;AAClD,MAAM,iBAAiB,GAAG,CAAC,QAAgB,EAAE,KAAa,EAAE,KAAa,EAAE,EAAE,CAC3E,iBAAiB,QAAQ,IAAI,KAAK,IAAI,KAAK,QAAQ,CAAC;AAEtD,0BAA0B;AAC1B,MAAM,eAAe,GAAG,CAAC,QAAgB,EAAE,KAAa,EAAE,EAAE,CAAC,iBAAiB,QAAQ,IAAI,KAAK,EAAE,CAAC;AAClG,MAAM,oBAAoB,GAAG,CAAC,QAAgB,EAAE,KAAa,EAAE,EAAE,CAAC,sBAAsB,QAAQ,IAAI,KAAK,EAAE,CAAC;AAE5G;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,yBAAyB;IACpC,YAAoB,EAAW,EAAU,IAA+B,EAAU,MAAc;;QAA5E,OAAE,GAAF,EAAE,CAAS;QAAU,SAAI,GAAJ,IAAI,CAA2B;QAAU,WAAM,GAAN,MAAM,CAAQ;IAAG,CAAC;IACpG,KAAK,CAAC,WAAW,CAAC,KAAa;QAC7B,MAAM,IAAI,GAAG,MAAM,uBAAA,IAAI,wFAAiB,MAArB,IAAI,EAAkB,KAAK,CAAC,CAAC;QAEhD,IAAI,OAAO,IAAI,KAAK,WAAW,EAAE;YAC/B,MAAM,IAAI,KAAK,CAAC,qBAAqB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,aAAa,KAAK,iBAAiB,CAAC,CAAC;SAC9F;QAED,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACnG,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAa;QAC1B,MAAM,IAAI,GAAG,MAAM,uBAAA,IAAI,wFAAiB,MAArB,IAAI,EAAkB,KAAK,CAAC,CAAC;QAChD,IAAI,OAAO,IAAI,KAAK,WAAW,EAAE;YAC/B,oCAAoC;YACpC,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;SAClG;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;QACrC,MAAM,KAAK,GAA+B,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1D,6CAA6C;QAC7C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE5C,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,iBAAiB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;YAC5G,IAAI,CAAC,eAAe,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,EAAE;gBACrD,kEAAkE;gBAClE,wEAAwE;gBACxE,KAAK,CAAC,GAAG,CAAC,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;gBACzE,KAAK,CAAC,GAAG,CAAC,iBAAiB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;aAC5D;iBAAM;gBACL,+EAA+E;gBAC/E,SAAS;aACV;YAED,IAAI,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE;gBACrB,gDAAgD;gBAChD,qEAAqE;gBACrE,SAAS;aACV;YAED,yEAAyE;YACzE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,GAAG,EAAE,CAAC;aAC9C,CAAC,CAAC;YAEH,IAAI,GAAG,EAAE;gBACP,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;aAC1C;YAED,IAAI,GAAG,EAAE;gBACP,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;aAC/C;SACF;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAChD,KAAK,CAAC,GAAG,CAAC,oBAAoB,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QACpE,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;QAClD,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;QAEpB,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACzF,CAAC;CAoBF;mGAlBC,KAAK,qDAAkB,KAAa;IASlC,IAAI;QACF,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;QACjE,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,oBAAoB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACnF,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;KAC5B;IAAC,OAAO,GAAG,EAAE;QACZ,OAAO,SAAS,CAAC;KAClB;AACH,CAAC;AAGH;;GAEG;AACH,MAAM,kBAAkB;IACtB,YACU,EAAW,EACX,KAAa,EACb,SAAiB,EACjB,cAAsB,EACtB,IAA+B,EAC/B,MAAc;;QALd,OAAE,GAAF,EAAE,CAAS;QACX,UAAK,GAAL,KAAK,CAAQ;QACb,cAAS,GAAT,SAAS,CAAQ;QACjB,mBAAc,GAAd,cAAc,CAAQ;QACtB,SAAI,GAAJ,IAAI,CAA2B;QAC/B,WAAM,GAAN,MAAM,CAAQ;IACrB,CAAC;IAEG,KAAK,CAAC,cAAc,CAAmB,KAAa;QACzD,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnC,IAAI,KAAK,GAAG,KAAK,CAAC;QAElB,OAAO,KAAK,GAAG,CAAC,EAAE;YAChB,MAAM,OAAO,GAAG,KAAK,GAAG,KAAK,CAAC;YAC9B,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAEvD,MAAM,OAAO,GAAG,MAAM,uBAAA,IAAI,iFAAwB,MAA5B,IAAI,EAAyB,KAAK,EAAE,YAAY,CAAC,CAAC;YACxE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEnB,KAAK,IAAI,CAAC,CAAC;YACX,KAAK,KAAK,EAAE,CAAC;SACd;QAED,OAAO,IAAI,WAAW,CAAI,KAAU,EAAE,IAAI,CAAC,CAAC;IAC9C,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC9B,CAAC;IAED,YAAY;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,OAAO;QACL,qEAAqE;QACrE,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,KAAa;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,MAAM,WAAW,GAAG,MAAM,uBAAA,IAAI,yFAAgC,MAApC,IAAI,EAAiC,SAAS,EAAE,KAAK,CAAC,CAAC;QAEjF,2BAA2B;QAC3B,IAAI,OAAO,WAAW,KAAK,WAAW,EAAE;YACtC,OAAO,SAAS,CAAC;SAClB;QAED,qCAAqC;QACrC,IAAI,WAAW,IAAI,IAAI,CAAC,KAAK,EAAE;YAC7B,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC;SAC9E;QAED,iDAAiD;QACjD,OAAO,SAAS,CAAC;IACnB,CAAC;IA+CD,KAAK,CAAC,aAAa,CAAC,KAAa;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YACnC,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,YAAY,IAAI,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;gBAC9C,OAAO,CAAC,CAAC;aACV;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;4FAvDC,KAAK,qDAAyB,KAAa,EAAE,KAAa;IACxD,MAAM,WAAW,GAAG,MAAM,uBAAA,IAAI,yFAAgC,MAApC,IAAI,EAAiC,KAAK,EAAE,KAAK,CAAC,CAAC;IAE7E,0BAA0B;IAC1B,IAAI,OAAO,WAAW,KAAK,WAAW,EAAE;QACtC,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;KACrC;IAED,qCAAqC;IACrC,IAAI,WAAW,IAAI,IAAI,CAAC,KAAK,EAAE;QAC7B,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;KAC1E;IAED,2DAA2D;IAC3D,gFAAgF;IAChF,mFAAmF;IACnF,sCAAsC;IACtC,EAAE;IACF,0DAA0D;IAC1D,gFAAgF;IAChF,oEAAoE;IACpE,qDAAqD;IACrD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IACnC,MAAM,SAAS,GAAG,KAAK,GAAG,EAAE,IAAI,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;IACtD,IAAI,SAAS,IAAI,IAAI,CAAC,SAAS,EAAE;QAC/B,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;KACrC;IAED,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QACnC,uBAAA,IAAI,iFAAwB,MAA5B,IAAI,EAAyB,KAAK,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC;QACnD,uBAAA,IAAI,iFAAwB,MAA5B,IAAI,EAAyB,KAAK,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,GAAG,EAAE,CAAC;KACzD,CAAC,CAAC;IAEH,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC,uDAED,KAAK,6DAAiC,KAAa,EAAE,KAAa;IAChE,IAAI;QACF,MAAM,KAAK,GAAoB,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAC5G,OAAO,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;KACvC;IAAC,OAAO,GAAG,EAAE;QACZ,OAAO,SAAS,CAAC;KAClB;AACH,CAAC"}

package/dest/snapshots/base_full_snapshot.d.ts

@@ -0,0 +1,50 @@
+/// <reference types="node" resolution-mode="require"/>
+import { SiblingPath } from '@aztec/types';
+import { LevelUp, LevelUpChain } from 'levelup';
+import { TreeBase } from '../tree_base.js';
+import { TreeSnapshot, TreeSnapshotBuilder } from './snapshot_builder.js';
+/**
+ * Builds a full snapshot of a tree. This implementation works for any Merkle tree and stores
+ * it in a database in a similar way to how a tree is stored in memory, using pointers.
+ *
+ * Sharing the same database between versions and trees is recommended as the trees would share
+ * structure.
+ *
+ * Implement the protected method `handleLeaf` to store any additional data you need for each leaf.
+ *
+ * Complexity:
+ * N - count of non-zero nodes in tree
+ * M - count of snapshots
+ * H - tree height
+ * Worst case space complexity: O(N * M)
+ * Sibling path access: O(H) database reads
+ */
+export declare abstract class BaseFullTreeSnapshotBuilder<T extends TreeBase, S extends TreeSnapshot> implements TreeSnapshotBuilder<S> {
+    #private;
+    protected db: LevelUp;
+    protected tree: T;
+    constructor(db: LevelUp, tree: T);
+    snapshot(block: number): Promise<S>;
+    protected handleLeaf(_index: bigint, _node: Buffer, _batch: LevelUpChain): Promise<void>;
+    getSnapshot(version: number): Promise<S>;
+    protected abstract openSnapshot(root: Buffer, numLeaves: bigint): S;
+}
+/**
+ * A source of sibling paths from a snapshot tree
+ */
+export declare class BaseFullTreeSnapshot implements TreeSnapshot {
+    #private;
+    protected db: LevelUp;
+    protected historicRoot: Buffer;
+    protected numLeaves: bigint;
+    protected tree: TreeBase;
+    constructor(db: LevelUp, historicRoot: Buffer, numLeaves: bigint, tree: TreeBase);
+    getSiblingPath<N extends number>(index: bigint): Promise<SiblingPath<N>>;
+    getLeafValue(index: bigint): Promise<Buffer | undefined>;
+    getDepth(): number;
+    getRoot(): Buffer;
+    getNumLeaves(): bigint;
+    protected pathFromRootToLeaf(leafIndex: bigint): AsyncGenerator<Buffer[], void, unknown>;
+    findLeafIndex(value: Buffer): Promise<bigint | undefined>;
+}
+//# sourceMappingURL=base_full_snapshot.d.ts.map

package/dest/snapshots/base_full_snapshot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base_full_snapshot.d.ts","sourceRoot":"","sources":["../../src/snapshots/base_full_snapshot.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAEhD,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAU1E;;;;;;;;;;;;;;;GAeG;AACH,8BAAsB,2BAA2B,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,YAAY,CAC1F,YAAW,mBAAmB,CAAC,CAAC,CAAC;;IAErB,SAAS,CAAC,EAAE,EAAE,OAAO;IAAE,SAAS,CAAC,IAAI,EAAE,CAAC;gBAA9B,EAAE,EAAE,OAAO,EAAY,IAAI,EAAE,CAAC;IAE9C,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;IA+DzC,SAAS,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY;IAIlE,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;IAU9C,SAAS,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC;CAoBpE;AAED;;GAEG;AACH,qBAAa,oBAAqB,YAAW,YAAY;;IAErD,SAAS,CAAC,EAAE,EAAE,OAAO;IACrB,SAAS,CAAC,YAAY,EAAE,MAAM;IAC9B,SAAS,CAAC,SAAS,EAAE,MAAM;IAC3B,SAAS,CAAC,IAAI,EAAE,QAAQ;gBAHd,EAAE,EAAE,OAAO,EACX,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,QAAQ;IAGpB,cAAc,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAcxE,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAS9D,QAAQ,IAAI,MAAM;IAIlB,OAAO,IAAI,MAAM;IAIjB,YAAY,IAAI,MAAM;cAIL,kBAAkB,CAAC,SAAS,EAAE,MAAM;IAwC/C,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;CAUhE"}