@proto-kit/common 0.1.1-develop.211 → 0.1.1-develop.2137

package/dist/trees/LinkedMerkleTree.js

@@ -0,0 +1,337 @@
+// eslint-disable-next-line max-classes-per-file
+import { Bool, Field, Poseidon, Provable, Struct } from "o1js";
+import { range } from "../utils";
+import { createMerkleTree, maybeSwap, } from "./RollupMerkleTree";
+import { InMemoryLinkedMerkleLeafStore } from "./InMemoryLinkedMerkleLeafStore";
+const RollupMerkleTreeWitness = createMerkleTree(40).WITNESS;
+export class LinkedLeafStruct extends Struct({
+    value: Field,
+    path: Field,
+    nextPath: Field,
+}) {
+    hash() {
+        return Poseidon.hash(LinkedLeafStruct.toFields(this));
+    }
+}
+// We use the RollupMerkleTreeWitness here, although we will actually implement
+// the RollupMerkleTreeWitnessV2 defined below when instantiating the class.
+export class LinkedLeafAndMerkleWitness extends Struct({
+    leaf: LinkedLeafStruct,
+    merkleWitness: RollupMerkleTreeWitness,
+}) {
+}
+class LinkedStructTemplate extends Struct({
+    leafPrevious: LinkedLeafAndMerkleWitness,
+    leafCurrent: LinkedLeafAndMerkleWitness,
+}) {
+}
+export function createLinkedMerkleTree(height) {
+    var _a;
+    class LinkedMerkleWitness extends LinkedStructTemplate {
+    }
+    /**
+     * The {@link RollupMerkleWitness} class defines a circuit-compatible base class
+     * for [Merkle Witness'](https://computersciencewiki.org/index.php/Merkle_proof).
+     */
+    // We define the RollupMerkleWitness again here as we want it to have the same height
+    // as the tree. If we re-used the Witness from the RollupMerkleTree.ts we wouldn't have
+    // control, whilst having the overhead of creating the RollupTree, since the witness is
+    // defined from the tree (for the height reason already described).
+    class RollupMerkleWitnessV2 extends Struct({
+        path: Provable.Array(Field, height - 1),
+        isLeft: Provable.Array(Bool, height - 1),
+    }) {
+        height() {
+            return RollupMerkleWitnessV2.height;
+        }
+        /**
+         * Calculates a root depending on the leaf value.
+         * @param leaf Value of the leaf node that belongs to this Witness.
+         * @returns The calculated root.
+         */
+        calculateRoot(leaf) {
+            let hash = leaf;
+            const n = this.height();
+            for (let index = 1; index < n; ++index) {
+                const isLeft = this.isLeft[index - 1];
+                const [left, right] = maybeSwap(isLeft, hash, this.path[index - 1]);
+                hash = Poseidon.hash([left, right]);
+            }
+            return hash;
+        }
+        /**
+         * Calculates the index of the leaf node that belongs to this Witness.
+         * @returns Index of the leaf.
+         */
+        calculateIndex() {
+            let powerOfTwo = Field(1);
+            let index = Field(0);
+            const n = this.height();
+            for (let i = 1; i < n; ++i) {
+                index = Provable.if(this.isLeft[i - 1], index, index.add(powerOfTwo));
+                powerOfTwo = powerOfTwo.mul(2);
+            }
+            return index;
+        }
+        checkMembership(root, key, value) {
+            const calculatedRoot = this.calculateRoot(value);
+            const calculatedKey = this.calculateIndex();
+            // We don't have to range-check the key, because if it would be greater
+            // than leafCount, it would not match the computedKey
+            key.assertEquals(calculatedKey, "Keys of MerkleWitness does not match");
+            return root.equals(calculatedRoot);
+        }
+        checkMembershipSimple(root, value) {
+            const calculatedRoot = this.calculateRoot(value);
+            return root.equals(calculatedRoot);
+        }
+        checkMembershipGetRoots(root, key, value) {
+            const calculatedRoot = this.calculateRoot(value);
+            const calculatedKey = this.calculateIndex();
+            key.assertEquals(calculatedKey, "Keys of MerkleWitness does not match");
+            return [root.equals(calculatedRoot), root, calculatedRoot];
+        }
+        toShortenedEntries() {
+            return range(0, 5)
+                .concat(range(this.height() - 4, this.height()))
+                .map((index) => [
+                this.path[index].toString(),
+                this.isLeft[index].toString(),
+            ].toString());
+        }
+        static dummy() {
+            return new RollupMerkleWitnessV2({
+                isLeft: Array(this.height - 1).fill(Bool(false)),
+                path: Array(this.height - 1).fill(Field(0)),
+            });
+        }
+    }
+    RollupMerkleWitnessV2.height = height;
+    return _a = class AbstractLinkedRollupMerkleTree {
+            constructor(store) {
+                this.store = store;
+                this.zeroes = [0n];
+                for (let index = 1; index < AbstractLinkedRollupMerkleTree.HEIGHT; index += 1) {
+                    const previousLevel = Field(this.zeroes[index - 1]);
+                    this.zeroes.push(Poseidon.hash([previousLevel, previousLevel]).toBigInt());
+                }
+                // We only do the leaf initialisation when the store
+                // has no values. Otherwise, we leave the store
+                // as is to not overwrite any data.
+                if (this.store.getMaximumIndex() === undefined) {
+                    this.setLeafInitialisation();
+                }
+            }
+            getNode(level, index) {
+                const node = this.store.getNode(index, level);
+                return Field(node ?? this.zeroes[level]);
+            }
+            /**
+             * Returns leaf which lives at a given path.
+             * Errors if the path is not defined.
+             * @param path path of the node.
+             * @returns The data of the node.
+             */
+            getLeaf(path) {
+                const storedLeaf = this.store.getLeaf(path);
+                if (storedLeaf === undefined) {
+                    return undefined;
+                }
+                return new LinkedLeafStruct({
+                    value: Field(storedLeaf.leaf.value),
+                    path: Field(storedLeaf.leaf.path),
+                    nextPath: Field(storedLeaf.leaf.nextPath),
+                });
+            }
+            /**
+             * Returns the root of the [Merkle Tree](https://en.wikipedia.org/wiki/Merkle_tree).
+             * @returns The root of the Merkle Tree.
+             */
+            getRoot() {
+                return this.getNode(AbstractLinkedRollupMerkleTree.HEIGHT - 1, 0n).toConstant();
+            }
+            setNode(level, index, value) {
+                this.store.setNode(index, level, value.toBigInt());
+            }
+            /**
+             * Sets the value of a leaf node at a given index to a given value
+             * and carry the change through to the tree.
+             * @param index Position of the leaf node.
+             * @param leaf New value.
+             */
+            setMerkleLeaf(index, leaf) {
+                this.setNode(0, index, leaf.hash());
+                let tempIndex = index;
+                for (let level = 1; level < AbstractLinkedRollupMerkleTree.HEIGHT; level += 1) {
+                    tempIndex /= 2n;
+                    const leftPrev = this.getNode(level - 1, tempIndex * 2n);
+                    const rightPrev = this.getNode(level - 1, tempIndex * 2n + 1n);
+                    this.setNode(level, tempIndex, Poseidon.hash([leftPrev, rightPrev]));
+                }
+            }
+            /**
+             * Sets the value of a node at a given index to a given value.
+             * @param path Position of the leaf node.
+             * @param value New value.
+             */
+            setLeaf(path, value) {
+                if (value === undefined) {
+                    return new LinkedMerkleWitness({
+                        leafPrevious: this.dummy(),
+                        leafCurrent: this.getWitness(path),
+                    });
+                }
+                const storedLeaf = this.store.getLeaf(path);
+                const prevLeaf = this.store.getLeafLessOrEqual(path);
+                if (prevLeaf === undefined) {
+                    throw Error("Prev leaf shouldn't be undefined");
+                }
+                let witnessPrevious;
+                let index;
+                if (storedLeaf === undefined) {
+                    // The above means the path doesn't already exist, and we are inserting, not updating.
+                    // This requires us to update the node with the previous path, as well.
+                    const tempIndex = this.store.getMaximumIndex();
+                    if (tempIndex === undefined) {
+                        throw Error("Store Max Index not defined");
+                    }
+                    if (tempIndex + 1n >= 2 ** height) {
+                        throw new Error("Index greater than maximum leaf number");
+                    }
+                    witnessPrevious = this.getWitness(prevLeaf.leaf.path);
+                    const newPrevLeaf = {
+                        value: prevLeaf.leaf.value,
+                        path: prevLeaf.leaf.path,
+                        nextPath: path,
+                    };
+                    this.store.setLeaf(prevLeaf.index, newPrevLeaf);
+                    this.setMerkleLeaf(prevLeaf.index, new LinkedLeafStruct({
+                        value: Field(newPrevLeaf.value),
+                        path: Field(newPrevLeaf.path),
+                        nextPath: Field(newPrevLeaf.nextPath),
+                    }));
+                    index = tempIndex + 1n;
+                }
+                else {
+                    witnessPrevious = this.dummy();
+                    index = storedLeaf.index;
+                }
+                const newLeaf = {
+                    value: value,
+                    path: path,
+                    nextPath: prevLeaf.leaf.nextPath,
+                };
+                const witnessNext = this.getWitness(newLeaf.path);
+                this.store.setLeaf(index, newLeaf);
+                this.setMerkleLeaf(index, new LinkedLeafStruct({
+                    value: Field(newLeaf.value),
+                    path: Field(newLeaf.path),
+                    nextPath: Field(newLeaf.nextPath),
+                }));
+                return new LinkedMerkleWitness({
+                    leafPrevious: witnessPrevious,
+                    leafCurrent: witnessNext,
+                });
+            }
+            /**
+             * Sets the value of a leaf node at initialisation,
+             * i.e.  {vale: 0, path: 0, nextPath: Field.Max}
+             */
+            setLeafInitialisation() {
+                // This is the maximum value of the hash
+                const MAX_FIELD_VALUE = Field.ORDER - 1n;
+                this.store.setLeaf(0n, {
+                    value: 0n,
+                    path: 0n,
+                    nextPath: MAX_FIELD_VALUE,
+                });
+                // We now set the leafs in the merkle tree to cascade the values up
+                // the tree.
+                this.setMerkleLeaf(0n, new LinkedLeafStruct({
+                    value: Field(0n),
+                    path: Field(0n),
+                    nextPath: Field(MAX_FIELD_VALUE),
+                }));
+            }
+            /**
+             * Returns the witness (also known as
+             * [Merkle Proof or Merkle Witness](https://computersciencewiki.org/index.php/Merkle_proof))
+             * for the leaf at the given path, otherwise returns a witness for the first unused index.
+             * @param path of the leaf node.
+             * @returns The witness that belongs to the leaf.
+             */
+            getWitness(path) {
+                const storedLeaf = this.store.getLeaf(path);
+                let leaf;
+                let currentIndex;
+                if (storedLeaf === undefined) {
+                    const storeIndex = this.store.getMaximumIndex();
+                    if (storeIndex === undefined) {
+                        throw new Error("Store Undefined");
+                    }
+                    currentIndex = storeIndex + 1n;
+                    leaf = new LinkedLeafStruct({
+                        value: Field(0),
+                        path: Field(0),
+                        nextPath: Field(0),
+                    });
+                }
+                else {
+                    leaf = new LinkedLeafStruct({
+                        value: Field(storedLeaf.leaf.value),
+                        path: Field(storedLeaf.leaf.path),
+                        nextPath: Field(storedLeaf.leaf.nextPath),
+                    });
+                    currentIndex = storedLeaf.index;
+                }
+                const pathArray = [];
+                const isLefts = [];
+                for (let level = 0; level < AbstractLinkedRollupMerkleTree.HEIGHT - 1; level += 1) {
+                    const isLeft = currentIndex % 2n === 0n;
+                    const sibling = this.getNode(level, isLeft ? currentIndex + 1n : currentIndex - 1n);
+                    isLefts.push(Bool(isLeft));
+                    pathArray.push(sibling);
+                    currentIndex /= 2n;
+                }
+                return new LinkedLeafAndMerkleWitness({
+                    merkleWitness: new RollupMerkleWitnessV2({
+                        path: pathArray,
+                        isLeft: isLefts,
+                    }),
+                    leaf: leaf,
+                });
+            }
+            dummy() {
+                return new LinkedLeafAndMerkleWitness({
+                    merkleWitness: new RollupMerkleTreeWitness({
+                        // eslint-disable-next-line @typescript-eslint/consistent-type-assertions
+                        path: Array(40).fill(Field(0)),
+                        // eslint-disable-next-line @typescript-eslint/consistent-type-assertions
+                        isLeft: Array(40).fill(new Bool(true)),
+                    }),
+                    leaf: new LinkedLeafStruct({
+                        value: Field(0),
+                        path: Field(0),
+                        nextPath: Field(0),
+                    }),
+                });
+            }
+            dummyWitness() {
+                return new LinkedMerkleWitness({
+                    leafPrevious: this.dummy(),
+                    leafCurrent: this.dummy(),
+                });
+            }
+        },
+        _a.HEIGHT = height,
+        _a.EMPTY_ROOT = new _a(new InMemoryLinkedMerkleLeafStore())
+            .getRoot()
+            .toBigInt(),
+        _a.WITNESS = LinkedMerkleWitness,
+        _a;
+}
+export class LinkedMerkleTree extends createLinkedMerkleTree(40) {
+}
+export class LinkedMerkleTreeWitness extends LinkedMerkleTree.WITNESS {
+}
+//# sourceMappingURL=LinkedMerkleTree.js.map

package/dist/trees/LinkedMerkleTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedMerkleTree.js","sourceRoot":"","sources":["../../src/trees/LinkedMerkleTree.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAG/D,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAGjC,OAAO,EAEL,gBAAgB,EAChB,SAAS,GACV,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,6BAA6B,EAAE,MAAM,iCAAiC,CAAC;AAEhF,MAAM,uBAAuB,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC;AAC7D,MAAM,OAAO,gBAAiB,SAAQ,MAAM,CAAC;IAC3C,KAAK,EAAE,KAAK;IACZ,IAAI,EAAE,KAAK;IACX,QAAQ,EAAE,KAAK;CAChB,CAAC;IACO,IAAI;QACT,OAAO,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;CACF;AAED,+EAA+E;AAC/E,4EAA4E;AAC5E,MAAM,OAAO,0BAA2B,SAAQ,MAAM,CAAC;IACrD,IAAI,EAAE,gBAAgB;IACtB,aAAa,EAAE,uBAAuB;CACvC,CAAC;CAAG;AAEL,MAAM,oBAAqB,SAAQ,MAAM,CAAC;IACxC,YAAY,EAAE,0BAA0B;IACxC,WAAW,EAAE,0BAA0B;CACxC,CAAC;CAAG;AA4DL,MAAM,UAAU,sBAAsB,CACpC,MAAc;;IAEd,MAAM,mBACJ,SAAQ,oBAAoB;KACa;IAC3C;;;OAGG;IACH,qFAAqF;IACrF,uFAAuF;IACvF,uFAAuF;IACvF,mEAAmE;IACnE,MAAM,qBACJ,SAAQ,MAAM,CAAC;QACb,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC;QACvC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC;KACzC,CAAC;QAKK,MAAM;YACX,OAAO,qBAAqB,CAAC,MAAM,CAAC;QACtC,CAAC;QAED;;;;WAIG;QACI,aAAa,CAAC,IAAW;YAC9B,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAExB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE;gBACtC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAEtC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpE,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;aACrC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;QAED;;;WAGG;QACI,cAAc;YACnB,IAAI,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAExB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;gBAC1B,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;gBACtE,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAChC;YAED,OAAO,KAAK,CAAC;QACf,CAAC;QAEM,eAAe,CAAC,IAAW,EAAE,GAAU,EAAE,KAAY;YAC1D,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACjD,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YAC5C,uEAAuE;YACvE,qDAAqD;YACrD,GAAG,CAAC,YAAY,CAAC,aAAa,EAAE,sCAAsC,CAAC,CAAC;YACxE,OAAO,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QACrC,CAAC;QAEM,qBAAqB,CAAC,IAAW,EAAE,KAAY;YACpD,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QACrC,CAAC;QAEM,uBAAuB,CAC5B,IAAW,EACX,GAAU,EACV,KAAY;YAEZ,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACjD,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YAC5C,GAAG,CAAC,YAAY,CAAC,aAAa,EAAE,sCAAsC,CAAC,CAAC;YACxE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;QAC7D,CAAC;QAEM,kBAAkB;YACvB,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;iBACf,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;iBAC/C,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACb;gBACE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE;gBAC3B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE;aAC9B,CAAC,QAAQ,EAAE,CACb,CAAC;QACN,CAAC;QAEM,MAAM,CAAC,KAAK;YACjB,OAAO,IAAI,qBAAqB,CAAC;gBAC/B,MAAM,EAAE,KAAK,CAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACtD,IAAI,EAAE,KAAK,CAAQ,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;aACnD,CAAC,CAAC;QACL,CAAC;;IAnFa,4BAAM,GAAG,MAAM,CAAC;IAqFhC,YAAO,MAAM,8BAA8B;YAiBzC,YAAmB,KAA4B;gBAC7C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;gBACnB,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;gBACnB,KACE,IAAI,KAAK,GAAG,CAAC,EACb,KAAK,GAAG,8BAA8B,CAAC,MAAM,EAC7C,KAAK,IAAI,CAAC,EACV;oBACA,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;oBACpD,IAAI,CAAC,MAAM,CAAC,IAAI,CACd,QAAQ,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC,CAAC,QAAQ,EAAE,CACzD,CAAC;iBACH;gBACD,oDAAoD;gBACpD,+CAA+C;gBAC/C,mCAAmC;gBACnC,IAAI,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,KAAK,SAAS,EAAE;oBAC9C,IAAI,CAAC,qBAAqB,EAAE,CAAC;iBAC9B;YACH,CAAC;YAEM,OAAO,CAAC,KAAa,EAAE,KAAa;gBACzC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC9C,OAAO,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3C,CAAC;YAED;;;;;eAKG;YACI,OAAO,CAAC,IAAY;gBACzB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC5C,IAAI,UAAU,KAAK,SAAS,EAAE;oBAC5B,OAAO,SAAS,CAAC;iBAClB;gBACD,OAAO,IAAI,gBAAgB,CAAC;oBAC1B,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC;oBACnC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;oBACjC,QAAQ,EAAE,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC;iBAC1C,CAAC,CAAC;YACL,CAAC;YAED;;;eAGG;YACI,OAAO;gBACZ,OAAO,IAAI,CAAC,OAAO,CACjB,8BAA8B,CAAC,MAAM,GAAG,CAAC,EACzC,EAAE,CACH,CAAC,UAAU,EAAE,CAAC;YACjB,CAAC;YAEO,OAAO,CAAC,KAAa,EAAE,KAAa,EAAE,KAAY;gBACxD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;YACrD,CAAC;YAED;;;;;eAKG;YACK,aAAa,CAAC,KAAa,EAAE,IAAsB;gBACzD,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBACpC,IAAI,SAAS,GAAG,KAAK,CAAC;gBACtB,KACE,IAAI,KAAK,GAAG,CAAC,EACb,KAAK,GAAG,8BAA8B,CAAC,MAAM,EAC7C,KAAK,IAAI,CAAC,EACV;oBACA,SAAS,IAAI,EAAE,CAAC;oBAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,GAAG,EAAE,CAAC,CAAC;oBACzD,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;oBAC/D,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;iBACtE;YACH,CAAC;YAED;;;;eAIG;YACI,OAAO,CAAC,IAAY,EAAE,KAAc;gBACzC,IAAI,KAAK,KAAK,SAAS,EAAE;oBACvB,OAAO,IAAI,mBAAmB,CAAC;wBAC7B,YAAY,EAAE,IAAI,CAAC,KAAK,EAAE;wBAC1B,WAAW,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;qBACnC,CAAC,CAAC;iBACJ;gBACD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;gBACrD,IAAI,QAAQ,KAAK,SAAS,EAAE;oBAC1B,MAAM,KAAK,CAAC,kCAAkC,CAAC,CAAC;iBACjD;gBACD,IAAI,eAAe,CAAC;gBACpB,IAAI,KAAa,CAAC;gBAClB,IAAI,UAAU,KAAK,SAAS,EAAE;oBAC5B,sFAAsF;oBACtF,uEAAuE;oBACvE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC;oBAC/C,IAAI,SAAS,KAAK,SAAS,EAAE;wBAC3B,MAAM,KAAK,CAAC,6BAA6B,CAAC,CAAC;qBAC5C;oBACD,IAAI,SAAS,GAAG,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE;wBACjC,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;qBAC3D;oBACD,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACtD,MAAM,WAAW,GAAG;wBAClB,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK;wBAC1B,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI;wBACxB,QAAQ,EAAE,IAAI;qBACf,CAAC;oBACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;oBAChD,IAAI,CAAC,aAAa,CAChB,QAAQ,CAAC,KAAK,EACd,IAAI,gBAAgB,CAAC;wBACnB,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC;wBAC/B,IAAI,EAAE,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC;wBAC7B,QAAQ,EAAE,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC;qBACtC,CAAC,CACH,CAAC;oBAEF,KAAK,GAAG,SAAS,GAAG,EAAE,CAAC;iBACxB;qBAAM;oBACL,eAAe,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC/B,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC;iBAC1B;gBACD,MAAM,OAAO,GAAG;oBACd,KAAK,EAAE,KAAK;oBACZ,IAAI,EAAE,IAAI;oBACV,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,QAAQ;iBACjC,CAAC;gBACF,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBACnC,IAAI,CAAC,aAAa,CAChB,KAAK,EACL,IAAI,gBAAgB,CAAC;oBACnB,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBAC3B,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;iBAClC,CAAC,CACH,CAAC;gBACF,OAAO,IAAI,mBAAmB,CAAC;oBAC7B,YAAY,EAAE,eAAe;oBAC7B,WAAW,EAAE,WAAW;iBACzB,CAAC,CAAC;YACL,CAAC;YAED;;;eAGG;YACK,qBAAqB;gBAC3B,wCAAwC;gBACxC,MAAM,eAAe,GAAW,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC;gBACjD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE;oBACrB,KAAK,EAAE,EAAE;oBACT,IAAI,EAAE,EAAE;oBACR,QAAQ,EAAE,eAAe;iBAC1B,CAAC,CAAC;gBACH,mEAAmE;gBACnE,YAAY;gBACZ,IAAI,CAAC,aAAa,CAChB,EAAE,EACF,IAAI,gBAAgB,CAAC;oBACnB,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;oBAChB,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;oBACf,QAAQ,EAAE,KAAK,CAAC,eAAe,CAAC;iBACjC,CAAC,CACH,CAAC;YACJ,CAAC;YAED;;;;;;eAMG;YACI,UAAU,CAAC,IAAY;gBAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC5C,IAAI,IAAI,CAAC;gBACT,IAAI,YAAoB,CAAC;gBAEzB,IAAI,UAAU,KAAK,SAAS,EAAE;oBAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC;oBAChD,IAAI,UAAU,KAAK,SAAS,EAAE;wBAC5B,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;qBACpC;oBACD,YAAY,GAAG,UAAU,GAAG,EAAE,CAAC;oBAC/B,IAAI,GAAG,IAAI,gBAAgB,CAAC;wBAC1B,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;wBACf,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;wBACd,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;qBACnB,CAAC,CAAC;iBACJ;qBAAM;oBACL,IAAI,GAAG,IAAI,gBAAgB,CAAC;wBAC1B,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC;wBACnC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;wBACjC,QAAQ,EAAE,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC;qBAC1C,CAAC,CAAC;oBACH,YAAY,GAAG,UAAU,CAAC,KAAK,CAAC;iBACjC;gBAED,MAAM,SAAS,GAAG,EAAE,CAAC;gBACrB,MAAM,OAAO,GAAG,EAAE,CAAC;gBAEnB,KACE,IAAI,KAAK,GAAG,CAAC,EACb,KAAK,GAAG,8BAA8B,CAAC,MAAM,GAAG,CAAC,EACjD,KAAK,IAAI,CAAC,EACV;oBACA,MAAM,MAAM,GAAG,YAAY,GAAG,EAAE,KAAK,EAAE,CAAC;oBACxC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAC1B,KAAK,EACL,MAAM,CAAC,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,EAAE,CAC/C,CAAC;oBACF,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;oBAC3B,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACxB,YAAY,IAAI,EAAE,CAAC;iBACpB;gBACD,OAAO,IAAI,0BAA0B,CAAC;oBACpC,aAAa,EAAE,IAAI,qBAAqB,CAAC;wBACvC,IAAI,EAAE,SAAS;wBACf,MAAM,EAAE,OAAO;qBAChB,CAAC;oBACF,IAAI,EAAE,IAAI;iBACX,CAAC,CAAC;YACL,CAAC;YAEM,KAAK;gBACV,OAAO,IAAI,0BAA0B,CAAC;oBACpC,aAAa,EAAE,IAAI,uBAAuB,CAAC;wBACzC,yEAAyE;wBACzE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAY;wBACzC,yEAAyE;wBACzE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAW;qBACjD,CAAC;oBACF,IAAI,EAAE,IAAI,gBAAgB,CAAC;wBACzB,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;wBACf,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;wBACd,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;qBACnB,CAAC;iBACH,CAAC,CAAC;YACL,CAAC;YAEM,YAAY;gBACjB,OAAO,IAAI,mBAAmB,CAAC;oBAC7B,YAAY,EAAE,IAAI,CAAC,KAAK,EAAE;oBAC1B,WAAW,EAAE,IAAI,CAAC,KAAK,EAAE;iBAC1B,CAAC,CAAC;YACL,CAAC;SACF;QA7Qe,SAAM,GAAG,MAAO;QAEhB,aAAU,GAAG,IAAI,EAA8B,CAC3D,IAAI,6BAA6B,EAAE,CACpC;aACE,OAAO,EAAE;aACT,QAAQ,EAAG;QAEA,UAAO,GAAG,mBAAoB;WAqQ5C;AACJ,CAAC;AAED,MAAM,OAAO,gBAAiB,SAAQ,sBAAsB,CAAC,EAAE,CAAC;CAAG;AACnE,MAAM,OAAO,uBAAwB,SAAQ,gBAAgB,CAAC,OAAO;CAAG"}

package/dist/trees/LinkedMerkleTreeStore.d.ts

@@ -0,0 +1,24 @@
+import { MerkleTreeStore } from "./MerkleTreeStore";
+export interface LinkedLeafStore {
+    setLeaf: (index: bigint, value: LinkedLeaf) => void;
+    getLeaf: (path: bigint) => {
+        leaf: LinkedLeaf;
+        index: bigint;
+    } | undefined;
+    getLeafLessOrEqual: (path: bigint) => {
+        leaf: LinkedLeaf;
+        index: bigint;
+    } | undefined;
+    getMaximumIndex: () => bigint | undefined;
+}
+export type LinkedLeaf = {
+    value: bigint;
+    path: bigint;
+    nextPath: bigint;
+};
+export interface LinkedMerkleTreeStore extends LinkedLeafStore, MerkleTreeStore {
+}
+export interface PreloadingLinkedMerkleTreeStore extends LinkedMerkleTreeStore {
+    preloadKeys(path: bigint[]): Promise<void>;
+}
+//# sourceMappingURL=LinkedMerkleTreeStore.d.ts.map

package/dist/trees/LinkedMerkleTreeStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedMerkleTreeStore.d.ts","sourceRoot":"","sources":["../../src/trees/LinkedMerkleTreeStore.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,KAAK,IAAI,CAAC;IAEpD,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK;QAAE,IAAI,EAAE,UAAU,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,SAAS,CAAC;IAE3E,kBAAkB,EAAE,CAClB,IAAI,EAAE,MAAM,KACT;QAAE,IAAI,EAAE,UAAU,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,SAAS,CAAC;IAErD,eAAe,EAAE,MAAM,MAAM,GAAG,SAAS,CAAC;CAC3C;AAED,MAAM,MAAM,UAAU,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC;AAC3E,MAAM,WAAW,qBACf,SAAQ,eAAe,EACrB,eAAe;CAAG;AAEtB,MAAM,WAAW,+BAAgC,SAAQ,qBAAqB;IAC5E,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC5C"}

package/dist/trees/LinkedMerkleTreeStore.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=LinkedMerkleTreeStore.js.map

package/dist/trees/LinkedMerkleTreeStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedMerkleTreeStore.js","sourceRoot":"","sources":["../../src/trees/LinkedMerkleTreeStore.ts"],"names":[],"mappings":""}

package/dist/trees/MerkleTreeStore.d.ts

@@ -0,0 +1,5 @@
+export interface MerkleTreeStore {
+    setNode: (key: bigint, level: number, value: bigint) => void;
+    getNode: (key: bigint, level: number) => bigint | undefined;
+}
+//# sourceMappingURL=MerkleTreeStore.d.ts.map

package/dist/trees/MerkleTreeStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MerkleTreeStore.d.ts","sourceRoot":"","sources":["../../src/trees/MerkleTreeStore.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;IAE7D,OAAO,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,CAAC;CAC7D"}

package/dist/trees/MerkleTreeStore.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=MerkleTreeStore.js.map

package/dist/trees/MerkleTreeStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MerkleTreeStore.js","sourceRoot":"","sources":["../../src/trees/MerkleTreeStore.ts"],"names":[],"mappings":""}

package/dist/trees/MockAsyncMerkleStore.d.ts

@@ -0,0 +1,9 @@
+import { InMemoryMerkleTreeStorage } from "./InMemoryMerkleTreeStorage";
+export declare class MockAsyncMerkleTreeStore {
+    readonly store: InMemoryMerkleTreeStorage;
+    commit(): void;
+    openTransaction(): void;
+    getNodeAsync(key: bigint, level: number): Promise<bigint | undefined>;
+    setNodeAsync(key: bigint, level: number, value: bigint): Promise<void>;
+}
+//# sourceMappingURL=MockAsyncMerkleStore.d.ts.map

package/dist/trees/MockAsyncMerkleStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MockAsyncMerkleStore.d.ts","sourceRoot":"","sources":["../../src/trees/MockAsyncMerkleStore.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,yBAAyB,EAAE,MAAM,6BAA6B,CAAC;AAExE,qBAAa,wBAAwB;IACnC,SAAgB,KAAK,4BAAmC;IAEjD,MAAM,IAAI,IAAI;IAId,eAAe,IAAI,IAAI;IAIjB,YAAY,CACvB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAIjB,YAAY,CACvB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,IAAI,CAAC;CAGjB"}

package/dist/trees/MockAsyncMerkleStore.js

@@ -0,0 +1,20 @@
+import { noop } from "../utils";
+import { InMemoryMerkleTreeStorage } from "./InMemoryMerkleTreeStorage";
+export class MockAsyncMerkleTreeStore {
+    constructor() {
+        this.store = new InMemoryMerkleTreeStorage();
+    }
+    commit() {
+        noop();
+    }
+    openTransaction() {
+        noop();
+    }
+    async getNodeAsync(key, level) {
+        return this.store.getNode(key, level);
+    }
+    async setNodeAsync(key, level, value) {
+        this.store.setNode(key, level, value);
+    }
+}
+//# sourceMappingURL=MockAsyncMerkleStore.js.map

package/dist/trees/MockAsyncMerkleStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MockAsyncMerkleStore.js","sourceRoot":"","sources":["../../src/trees/MockAsyncMerkleStore.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AAEhC,OAAO,EAAE,yBAAyB,EAAE,MAAM,6BAA6B,CAAC;AAExE,MAAM,OAAO,wBAAwB;IAArC;QACkB,UAAK,GAAG,IAAI,yBAAyB,EAAE,CAAC;IAwB1D,CAAC;IAtBQ,MAAM;QACX,IAAI,EAAE,CAAC;IACT,CAAC;IAEM,eAAe;QACpB,IAAI,EAAE,CAAC;IACT,CAAC;IAEM,KAAK,CAAC,YAAY,CACvB,GAAW,EACX,KAAa;QAEb,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;IAEM,KAAK,CAAC,YAAY,CACvB,GAAW,EACX,KAAa,EACb,KAAa;QAEb,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;CACF"}

package/dist/trees/RollupMerkleTree.d.ts

@@ -0,0 +1,147 @@
+import { Bool, Field } from "o1js";
+import { TypedClass } from "../types";
+import { MerkleTreeStore } from "./MerkleTreeStore";
+declare const StructTemplate_base: (new (value: {
+    path: import("o1js/dist/node/lib/provable/field").Field[];
+    isLeft: import("o1js/dist/node/lib/provable/bool").Bool[];
+}) => {
+    path: import("o1js/dist/node/lib/provable/field").Field[];
+    isLeft: import("o1js/dist/node/lib/provable/bool").Bool[];
+}) & {
+    _isStruct: true;
+} & Omit<import("o1js/dist/node/lib/provable/types/provable-intf").Provable<{
+    path: import("o1js/dist/node/lib/provable/field").Field[];
+    isLeft: import("o1js/dist/node/lib/provable/bool").Bool[];
+}, {
+    path: bigint[];
+    isLeft: boolean[];
+}>, "fromFields"> & {
+    fromFields: (fields: import("o1js/dist/node/lib/provable/field").Field[]) => {
+        path: import("o1js/dist/node/lib/provable/field").Field[];
+        isLeft: import("o1js/dist/node/lib/provable/bool").Bool[];
+    };
+} & {
+    fromValue: (value: {
+        path: import("o1js/dist/node/lib/provable/field").Field[] | bigint[];
+        isLeft: import("o1js/dist/node/lib/provable/bool").Bool[] | boolean[];
+    }) => {
+        path: import("o1js/dist/node/lib/provable/field").Field[];
+        isLeft: import("o1js/dist/node/lib/provable/bool").Bool[];
+    };
+    toInput: (x: {
+        path: import("o1js/dist/node/lib/provable/field").Field[];
+        isLeft: import("o1js/dist/node/lib/provable/bool").Bool[];
+    }) => {
+        fields?: import("o1js/dist/node/lib/provable/field").Field[] | undefined;
+        packed?: [import("o1js/dist/node/lib/provable/field").Field, number][] | undefined;
+    };
+    toJSON: (x: {
+        path: import("o1js/dist/node/lib/provable/field").Field[];
+        isLeft: import("o1js/dist/node/lib/provable/bool").Bool[];
+    }) => {
+        path: string[];
+        isLeft: boolean[];
+    };
+    fromJSON: (x: {
+        path: string[];
+        isLeft: boolean[];
+    }) => {
+        path: import("o1js/dist/node/lib/provable/field").Field[];
+        isLeft: import("o1js/dist/node/lib/provable/bool").Bool[];
+    };
+    empty: () => {
+        path: import("o1js/dist/node/lib/provable/field").Field[];
+        isLeft: import("o1js/dist/node/lib/provable/bool").Bool[];
+    };
+};
+declare class StructTemplate extends StructTemplate_base {
+}
+export interface AbstractMerkleWitness extends StructTemplate {
+    height(): number;
+    /**
+     * Calculates a root depending on the leaf value.
+     * @param leaf Value of the leaf node that belongs to this Witness.
+     * @returns The calculated root.
+     */
+    calculateRoot(hash: Field): Field;
+    /**
+     * Calculates the index of the leaf node that belongs to this Witness.
+     * @returns Index of the leaf.
+     */
+    calculateIndex(): Field;
+    checkMembership(root: Field, key: Field, value: Field): Bool;
+    checkMembershipGetRoots(root: Field, key: Field, value: Field): [Bool, Field, Field];
+    toShortenedEntries(): string[];
+}
+export interface AbstractMerkleTree {
+    store: MerkleTreeStore;
+    readonly leafCount: bigint;
+    assertIndexRange(index: bigint): void;
+    /**
+     * Returns a node which lives at a given index and level.
+     * @param level Level of the node.
+     * @param index Index of the node.
+     * @returns The data of the node.
+     */
+    getNode(level: number, index: bigint): Field;
+    /**
+     * Returns the root of the [Merkle Tree](https://en.wikipedia.org/wiki/Merkle_tree).
+     * @returns The root of the Merkle Tree.
+     */
+    getRoot(): Field;
+    /**
+     * Sets the value of a leaf node at a given index to a given value.
+     * @param index Position of the leaf node.
+     * @param leaf New value.
+     */
+    setLeaf(index: bigint, leaf: Field): void;
+    /**
+     * Returns the witness (also known as
+     * [Merkle Proof or Merkle Witness](https://computersciencewiki.org/index.php/Merkle_proof))
+     * for the leaf at the given index.
+     * @param index Position of the leaf node.
+     * @returns The witness that belongs to the leaf.
+     */
+    getWitness(index: bigint): AbstractMerkleWitness;
+    /**
+     * Fills all leaves of the tree.
+     * @param leaves Values to fill the leaves with.
+     */
+    fill(leaves: Field[]): void;
+}
+export interface AbstractMerkleTreeClass {
+    new (store: MerkleTreeStore): AbstractMerkleTree;
+    WITNESS: TypedClass<AbstractMerkleWitness> & typeof StructTemplate & {
+        dummy: () => AbstractMerkleWitness;
+    };
+    HEIGHT: number;
+    EMPTY_ROOT: bigint;
+    get leafCount(): bigint;
+}
+/**
+ * A [Merkle Tree](https://en.wikipedia.org/wiki/Merkle_tree) is a binary tree in
+ * which every leaf is the cryptography hash of a piece of data,
+ * and every node is the hash of the concatenation of its two child nodes.
+ *
+ * A Merkle Tree allows developers to easily and securely verify
+ * the integrity of large amounts of data.
+ *
+ * Take a look at our [documentation](https://docs.minaprotocol.com/en/zkapps)
+ * on how to use Merkle Trees in combination with zkApps and
+ * zero knowledge programming!
+ *
+ * Levels are indexed from leaves (level 0) to root (level N - 1).
+ *
+ * This function takes a height as argument and returns a class
+ * that implements a merkletree with that specified height.
+ *
+ * It also holds the Witness class under tree.WITNESS
+ */
+export declare function createMerkleTree(height: number): AbstractMerkleTreeClass;
+declare const RollupMerkleTree_base: AbstractMerkleTreeClass;
+export declare class RollupMerkleTree extends RollupMerkleTree_base {
+}
+export declare class RollupMerkleTreeWitness extends RollupMerkleTree.WITNESS {
+}
+export {};
+//# sourceMappingURL=RollupMerkleTree.d.ts.map

package/dist/trees/RollupMerkleTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RollupMerkleTree.d.ts","sourceRoot":"","sources":["../../src/trees/RollupMerkleTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAA8B,MAAM,MAAM,CAAC;AAG/D,OAAO,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAEtC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAGpD,cAAM,cAAe,SAAQ,mBAG3B;CAAG;AAEL,MAAM,WAAW,qBAAsB,SAAQ,cAAc;IAC3D,MAAM,IAAI,MAAM,CAAC;IAEjB;;;;OAIG;IACH,aAAa,CAAC,IAAI,EAAE,KAAK,GAAG,KAAK,CAAC;IAElC;;;OAGG;IACH,cAAc,IAAI,KAAK,CAAC;IAExB,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAE7D,uBAAuB,CACrB,IAAI,EAAE,KAAK,EACX,GAAG,EAAE,KAAK,EACV,KAAK,EAAE,KAAK,GACX,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAExB,kBAAkB,IAAI,MAAM,EAAE,CAAC;CAChC;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,eAAe,CAAC;IACvB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAE3B,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAEtC;;;;;OAKG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC;IAE7C;;;OAGG;IACH,OAAO,IAAI,KAAK,CAAC;IAEjB;;;;OAIG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC;IAE1C;;;;;;OAMG;IACH,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,qBAAqB,CAAC;IAEjD;;;OAGG;IACH,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;CAC7B;AAED,MAAM,WAAW,uBAAuB;IACtC,KAAK,KAAK,EAAE,eAAe,GAAG,kBAAkB,CAAC;IAEjD,OAAO,EAAE,UAAU,CAAC,qBAAqB,CAAC,GACxC,OAAO,cAAc,GAAG;QAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;KAAE,CAAC;IAEjE,MAAM,EAAE,MAAM,CAAC;IAEf,UAAU,EAAE,MAAM,CAAC;IAEnB,IAAI,SAAS,IAAI,MAAM,CAAC;CACzB;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,uBAAuB,CAmOxE;;AAED,qBAAa,gBAAiB,SAAQ,qBAAqB;CAAG;AAC9D,qBAAa,uBAAwB,SAAQ,gBAAgB,CAAC,OAAO;CAAG"}