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

package/dist/trees/RollupMerkleTree.js

@@ -0,0 +1,218 @@
+import { Bool, Field, Poseidon, Provable, Struct } from "o1js";
+import { range } from "../utils";
+import { InMemoryMerkleTreeStorage } from "./InMemoryMerkleTreeStorage";
+class StructTemplate extends Struct({
+    path: Provable.Array(Field, 0),
+    isLeft: Provable.Array(Bool, 0),
+}) {
+}
+/**
+ * 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 function createMerkleTree(height) {
+    var _a;
+    /**
+     * The {@link BaseMerkleWitness} class defines a circuit-compatible base class
+     * for [Merkle Witness'](https://computersciencewiki.org/index.php/Merkle_proof).
+     */
+    class RollupMerkleWitness extends Struct({
+        path: Provable.Array(Field, height - 1),
+        isLeft: Provable.Array(Bool, height - 1),
+    }) {
+        height() {
+            return RollupMerkleWitness.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];
+                // eslint-disable-next-line @typescript-eslint/no-use-before-define
+                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);
+        }
+        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 RollupMerkleWitness({
+                isLeft: Array(height - 1).fill(Bool(true)),
+                path: Array(height - 1).fill(Field(0)),
+            });
+        }
+    }
+    RollupMerkleWitness.height = height;
+    return _a = class AbstractRollupMerkleTree {
+            static get leafCount() {
+                return 2n ** BigInt(AbstractRollupMerkleTree.HEIGHT - 1);
+            }
+            constructor(store) {
+                this.store = store;
+                this.zeroes = [0n];
+                for (let index = 1; index < AbstractRollupMerkleTree.HEIGHT; index += 1) {
+                    const previousLevel = Field(this.zeroes[index - 1]);
+                    this.zeroes.push(Poseidon.hash([previousLevel, previousLevel]).toBigInt());
+                }
+            }
+            assertIndexRange(index) {
+                if (index > this.leafCount) {
+                    throw new Error("Index greater than maximum leaf number");
+                }
+            }
+            /**
+             * 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, index) {
+                this.assertIndexRange(index);
+                return Field(this.store.getNode(index, level) ?? this.zeroes[level]);
+            }
+            /**
+             * 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(AbstractRollupMerkleTree.HEIGHT - 1, 0n).toConstant();
+            }
+            // private in interface
+            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.
+             * @param index Position of the leaf node.
+             * @param leaf New value.
+             */
+            setLeaf(index, leaf) {
+                this.assertIndexRange(index);
+                this.setNode(0, index, leaf);
+                let currentIndex = index;
+                for (let level = 1; level < AbstractRollupMerkleTree.HEIGHT; level += 1) {
+                    currentIndex /= 2n;
+                    const left = this.getNode(level - 1, currentIndex * 2n);
+                    const right = this.getNode(level - 1, currentIndex * 2n + 1n);
+                    this.setNode(level, currentIndex, Poseidon.hash([left, right]));
+                }
+            }
+            /**
+             * 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) {
+                this.assertIndexRange(index);
+                const path = [];
+                const isLefts = [];
+                let currentIndex = index;
+                for (let level = 0; level < AbstractRollupMerkleTree.HEIGHT - 1; level += 1) {
+                    const isLeft = currentIndex % 2n === 0n;
+                    const sibling = this.getNode(level, isLeft ? currentIndex + 1n : currentIndex - 1n);
+                    isLefts.push(Bool(isLeft));
+                    path.push(sibling);
+                    currentIndex /= 2n;
+                }
+                return new RollupMerkleWitness({
+                    isLeft: isLefts,
+                    path,
+                });
+            }
+            // TODO: should this take an optional offset? should it fail if the array is too long?
+            /**
+             * Fills all leaves of the tree.
+             * @param leaves Values to fill the leaves with.
+             */
+            fill(leaves) {
+                leaves.forEach((value, index) => {
+                    this.setLeaf(BigInt(index), value);
+                });
+            }
+            /**
+             * Returns the amount of leaf nodes.
+             * @returns Amount of leaf nodes.
+             */
+            get leafCount() {
+                return AbstractRollupMerkleTree.leafCount;
+            }
+        },
+        _a.HEIGHT = height,
+        _a.EMPTY_ROOT = new _a(new InMemoryMerkleTreeStorage())
+            .getRoot()
+            .toBigInt(),
+        _a.WITNESS = RollupMerkleWitness,
+        _a;
+}
+export class RollupMerkleTree extends createMerkleTree(256) {
+}
+export class RollupMerkleTreeWitness extends RollupMerkleTree.WITNESS {
+}
+/**
+ * More efficient version of `maybeSwapBad` which
+ * reuses an intermediate variable
+ */
+function maybeSwap(b, x, y) {
+    const m = b.toField().mul(x.sub(y)); // b*(x - y)
+    const x1 = y.add(m); // y + b*(x - y)
+    const y2 = x.sub(m); // x - b*(x - y) = x + b*(y - x)
+    return [x1, y2];
+}
+//# sourceMappingURL=RollupMerkleTree.js.map

package/dist/trees/RollupMerkleTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RollupMerkleTree.js","sourceRoot":"","sources":["../../src/trees/RollupMerkleTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE/D,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAIjC,OAAO,EAAE,yBAAyB,EAAE,MAAM,6BAA6B,CAAC;AAExE,MAAM,cAAe,SAAQ,MAAM,CAAC;IAClC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAC9B,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;CAChC,CAAC;CAAG;AAqFL;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc;;IAC7C;;;OAGG;IACH,MAAM,mBACJ,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,mBAAmB,CAAC,MAAM,CAAC;QACpC,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;gBACtC,mEAAmE;gBACnE,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,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,mBAAmB,CAAC;gBAC7B,MAAM,EAAE,KAAK,CAAO,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChD,IAAI,EAAE,KAAK,CAAQ,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;aAC9C,CAAC,CAAC;QACL,CAAC;;IA9Ea,0BAAM,GAAG,MAAM,CAAC;IAiFhC,YAAO,MAAM,wBAAwB;YAS5B,MAAM,KAAK,SAAS;gBACzB,OAAO,EAAE,IAAI,MAAM,CAAC,wBAAwB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC3D,CAAC;YAUD,YAAmB,KAAsB;gBACvC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;gBACnB,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;gBACnB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,wBAAwB,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE;oBACvE,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;YACH,CAAC;YAEM,gBAAgB,CAAC,KAAa;gBACnC,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE;oBAC1B,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;iBAC3D;YACH,CAAC;YAED;;;;;eAKG;YACI,OAAO,CAAC,KAAa,EAAE,KAAa;gBACzC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;gBAC7B,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACvE,CAAC;YAED;;;eAGG;YACI,OAAO;gBACZ,OAAO,IAAI,CAAC,OAAO,CAAC,wBAAwB,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC;YAC5E,CAAC;YAED,uBAAuB;YACf,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;;;;eAIG;YACI,OAAO,CAAC,KAAa,EAAE,IAAW;gBACvC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;gBAE7B,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC7B,IAAI,YAAY,GAAG,KAAK,CAAC;gBACzB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,wBAAwB,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE;oBACvE,YAAY,IAAI,EAAE,CAAC;oBAEnB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,YAAY,GAAG,EAAE,CAAC,CAAC;oBACxD,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,YAAY,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;oBAE9D,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,YAAY,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;iBACjE;YACH,CAAC;YAED;;;;;;eAMG;YACI,UAAU,CAAC,KAAa;gBAC7B,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;gBAE7B,MAAM,IAAI,GAAG,EAAE,CAAC;gBAChB,MAAM,OAAO,GAAG,EAAE,CAAC;gBACnB,IAAI,YAAY,GAAG,KAAK,CAAC;gBACzB,KACE,IAAI,KAAK,GAAG,CAAC,EACb,KAAK,GAAG,wBAAwB,CAAC,MAAM,GAAG,CAAC,EAC3C,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,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACnB,YAAY,IAAI,EAAE,CAAC;iBACpB;gBACD,OAAO,IAAI,mBAAmB,CAAC;oBAC7B,MAAM,EAAE,OAAO;oBACf,IAAI;iBACL,CAAC,CAAC;YACL,CAAC;YAED,sFAAsF;YACtF;;;eAGG;YACI,IAAI,CAAC,MAAe;gBACzB,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;oBAC9B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;gBACrC,CAAC,CAAC,CAAC;YACL,CAAC;YAED;;;eAGG;YACH,IAAW,SAAS;gBAClB,OAAO,wBAAwB,CAAC,SAAS,CAAC;YAC5C,CAAC;SACF;QApIe,SAAM,GAAG,MAAO;QAEhB,aAAU,GAAG,IAAI,EAAwB,CACrD,IAAI,yBAAyB,EAAE,CAChC;aACE,OAAO,EAAE;aACT,QAAQ,EAAG;QAMA,UAAO,GAAG,mBAAoB;WAwH5C;AACJ,CAAC;AAED,MAAM,OAAO,gBAAiB,SAAQ,gBAAgB,CAAC,GAAG,CAAC;CAAG;AAC9D,MAAM,OAAO,uBAAwB,SAAQ,gBAAgB,CAAC,OAAO;CAAG;AAExE;;;GAGG;AACH,SAAS,SAAS,CAAC,CAAO,EAAE,CAAQ,EAAE,CAAQ;IAC5C,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY;IACjD,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB;IACrC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,gCAAgC;IACrD,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AAClB,CAAC"}

package/dist/trees/VirtualMerkleTreeStore.d.ts

@@ -0,0 +1,13 @@
+import { MerkleTreeStore } from "./MerkleTreeStore";
+import { InMemoryMerkleTreeStorage } from "./InMemoryMerkleTreeStorage";
+/**
+ * A MemoryMerkleTreeStore that, if falls back to a parent store if it
+ * has no data
+ */
+export declare class VirtualMerkleTreeStore extends InMemoryMerkleTreeStorage {
+    private readonly parent;
+    constructor(parent: MerkleTreeStore);
+    getNode(key: bigint, level: number): bigint | undefined;
+    setNode(key: bigint, level: number, value: bigint): void;
+}
+//# sourceMappingURL=VirtualMerkleTreeStore.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"VirtualMerkleTreeStore.d.ts","sourceRoot":"","sources":["../../src/trees/VirtualMerkleTreeStore.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,yBAAyB,EAAE,MAAM,6BAA6B,CAAC;AAExE;;;GAGG;AACH,qBAAa,sBAAuB,SAAQ,yBAAyB;IAChD,OAAO,CAAC,QAAQ,CAAC,MAAM;gBAAN,MAAM,EAAE,eAAe;IAIpD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAIvD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;CAGhE"}

package/dist/trees/VirtualMerkleTreeStore.js

@@ -0,0 +1,18 @@
+import { InMemoryMerkleTreeStorage } from "./InMemoryMerkleTreeStorage";
+/**
+ * A MemoryMerkleTreeStore that, if falls back to a parent store if it
+ * has no data
+ */
+export class VirtualMerkleTreeStore extends InMemoryMerkleTreeStorage {
+    constructor(parent) {
+        super();
+        this.parent = parent;
+    }
+    getNode(key, level) {
+        return super.getNode(key, level) ?? this.parent.getNode(key, level);
+    }
+    setNode(key, level, value) {
+        super.setNode(key, level, value);
+    }
+}
+//# sourceMappingURL=VirtualMerkleTreeStore.js.map

package/dist/trees/VirtualMerkleTreeStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"VirtualMerkleTreeStore.js","sourceRoot":"","sources":["../../src/trees/VirtualMerkleTreeStore.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,yBAAyB,EAAE,MAAM,6BAA6B,CAAC;AAExE;;;GAGG;AACH,MAAM,OAAO,sBAAuB,SAAQ,yBAAyB;IACnE,YAAoC,MAAuB;QACzD,KAAK,EAAE,CAAC;QAD0B,WAAM,GAAN,MAAM,CAAiB;IAE3D,CAAC;IAEM,OAAO,CAAC,GAAW,EAAE,KAAa;QACvC,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACtE,CAAC;IAEM,OAAO,CAAC,GAAW,EAAE,KAAa,EAAE,KAAa;QACtD,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;CACF"}

package/dist/trees/lmt/AbstractLinkedMerkleTree.d.ts

@@ -0,0 +1,288 @@
+import { Bool, Field } from "o1js";
+import { RollupMerkleTree } from "../sparse/RollupMerkleTree";
+import { TypedClass } from "../../types";
+import { MerkleTreeStore } from "../sparse/MerkleTreeStore";
+import { LinkedLeafStore } from "./LinkedLeafStore";
+import { LinkedLeafStruct } from "./LinkedMerkleTreeTypes";
+declare const RollupMerkleTreeWitness_base: TypedClass<import("../sparse/RollupMerkleTree").AbstractMerkleWitness> & typeof import("../sparse/RollupMerkleTree").StructTemplate & {
+    dummy: () => import("../sparse/RollupMerkleTree").AbstractMerkleWitness;
+};
+declare class RollupMerkleTreeWitness extends RollupMerkleTreeWitness_base {
+}
+type LinkedMerkleWitnessValue = {
+    leaf: LinkedLeafStruct;
+    merkleWitness: RollupMerkleTreeWitness;
+    checkMembership(root: Field, path: Field, value: Field): Bool;
+};
+declare const LinkedMerkleWitnessTemplate_base: (new (value: {
+    leaf: LinkedLeafStruct;
+    merkleWitness: RollupMerkleTreeWitness;
+}) => {
+    leaf: LinkedLeafStruct;
+    merkleWitness: RollupMerkleTreeWitness;
+}) & {
+    _isStruct: true;
+} & Omit<import("o1js/dist/node/lib/provable/types/provable-intf").Provable<{
+    leaf: LinkedLeafStruct;
+    merkleWitness: RollupMerkleTreeWitness;
+}, {
+    leaf: {
+        value: bigint;
+        path: bigint;
+        nextPath: bigint;
+    };
+    merkleWitness: {
+        path: bigint[];
+        isLeft: boolean[];
+    };
+}>, "fromFields"> & {
+    fromFields: (fields: import("o1js/dist/node/lib/provable/field").Field[]) => {
+        leaf: LinkedLeafStruct;
+        merkleWitness: RollupMerkleTreeWitness;
+    };
+} & {
+    fromValue: (value: {
+        leaf: LinkedLeafStruct | {
+            value: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+            path: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+            nextPath: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+        };
+        merkleWitness: {
+            path: import("o1js/dist/node/lib/provable/field").Field[] | bigint[];
+            isLeft: import("o1js/dist/node/lib/provable/bool").Bool[] | boolean[];
+        } | RollupMerkleTreeWitness;
+    }) => {
+        leaf: LinkedLeafStruct;
+        merkleWitness: RollupMerkleTreeWitness;
+    };
+    toInput: (x: {
+        leaf: LinkedLeafStruct;
+        merkleWitness: RollupMerkleTreeWitness;
+    }) => {
+        fields?: import("o1js/dist/node/lib/provable/field").Field[] | undefined;
+        packed?: [import("o1js/dist/node/lib/provable/field").Field, number][] | undefined;
+    };
+    toJSON: (x: {
+        leaf: LinkedLeafStruct;
+        merkleWitness: RollupMerkleTreeWitness;
+    }) => {
+        leaf: {
+            value: string;
+            path: string;
+            nextPath: string;
+        };
+        merkleWitness: {
+            path: string[];
+            isLeft: boolean[];
+        };
+    };
+    fromJSON: (x: {
+        leaf: {
+            value: string;
+            path: string;
+            nextPath: string;
+        };
+        merkleWitness: {
+            path: string[];
+            isLeft: boolean[];
+        };
+    }) => {
+        leaf: LinkedLeafStruct;
+        merkleWitness: RollupMerkleTreeWitness;
+    };
+    empty: () => {
+        leaf: LinkedLeafStruct;
+        merkleWitness: RollupMerkleTreeWitness;
+    };
+};
+declare class LinkedMerkleWitnessTemplate extends LinkedMerkleWitnessTemplate_base {
+    checkMembership(root: Field, path: Field, value: Field): Bool;
+}
+type LinkedOperationWitnessValue = {
+    leafPrevious: LinkedMerkleWitnessValue;
+    leafCurrent: LinkedMerkleWitnessValue;
+};
+declare const LinkedOperationWitnessTemplate_base: (new (value: {
+    leafPrevious: LinkedMerkleWitnessTemplate;
+    leafCurrent: LinkedMerkleWitnessTemplate;
+}) => {
+    leafPrevious: LinkedMerkleWitnessTemplate;
+    leafCurrent: LinkedMerkleWitnessTemplate;
+}) & {
+    _isStruct: true;
+} & Omit<import("o1js/dist/node/lib/provable/types/provable-intf").Provable<{
+    leafPrevious: LinkedMerkleWitnessTemplate;
+    leafCurrent: LinkedMerkleWitnessTemplate;
+}, {
+    leafPrevious: {
+        leaf: {
+            value: bigint;
+            path: bigint;
+            nextPath: bigint;
+        };
+        merkleWitness: {
+            path: bigint[];
+            isLeft: boolean[];
+        };
+    };
+    leafCurrent: {
+        leaf: {
+            value: bigint;
+            path: bigint;
+            nextPath: bigint;
+        };
+        merkleWitness: {
+            path: bigint[];
+            isLeft: boolean[];
+        };
+    };
+}>, "fromFields"> & {
+    fromFields: (fields: import("o1js/dist/node/lib/provable/field").Field[]) => {
+        leafPrevious: LinkedMerkleWitnessTemplate;
+        leafCurrent: LinkedMerkleWitnessTemplate;
+    };
+} & {
+    fromValue: (value: {
+        leafPrevious: LinkedMerkleWitnessTemplate | {
+            leaf: LinkedLeafStruct | {
+                value: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+                path: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+                nextPath: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+            };
+            merkleWitness: {
+                path: import("o1js/dist/node/lib/provable/field").Field[] | bigint[];
+                isLeft: import("o1js/dist/node/lib/provable/bool").Bool[] | boolean[];
+            } | RollupMerkleTreeWitness;
+        };
+        leafCurrent: LinkedMerkleWitnessTemplate | {
+            leaf: LinkedLeafStruct | {
+                value: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+                path: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+                nextPath: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+            };
+            merkleWitness: {
+                path: import("o1js/dist/node/lib/provable/field").Field[] | bigint[];
+                isLeft: import("o1js/dist/node/lib/provable/bool").Bool[] | boolean[];
+            } | RollupMerkleTreeWitness;
+        };
+    }) => {
+        leafPrevious: LinkedMerkleWitnessTemplate;
+        leafCurrent: LinkedMerkleWitnessTemplate;
+    };
+    toInput: (x: {
+        leafPrevious: LinkedMerkleWitnessTemplate;
+        leafCurrent: LinkedMerkleWitnessTemplate;
+    }) => {
+        fields?: import("o1js/dist/node/lib/provable/field").Field[] | undefined;
+        packed?: [import("o1js/dist/node/lib/provable/field").Field, number][] | undefined;
+    };
+    toJSON: (x: {
+        leafPrevious: LinkedMerkleWitnessTemplate;
+        leafCurrent: LinkedMerkleWitnessTemplate;
+    }) => {
+        leafPrevious: {
+            leaf: {
+                value: string;
+                path: string;
+                nextPath: string;
+            };
+            merkleWitness: {
+                path: string[];
+                isLeft: boolean[];
+            };
+        };
+        leafCurrent: {
+            leaf: {
+                value: string;
+                path: string;
+                nextPath: string;
+            };
+            merkleWitness: {
+                path: string[];
+                isLeft: boolean[];
+            };
+        };
+    };
+    fromJSON: (x: {
+        leafPrevious: {
+            leaf: {
+                value: string;
+                path: string;
+                nextPath: string;
+            };
+            merkleWitness: {
+                path: string[];
+                isLeft: boolean[];
+            };
+        };
+        leafCurrent: {
+            leaf: {
+                value: string;
+                path: string;
+                nextPath: string;
+            };
+            merkleWitness: {
+                path: string[];
+                isLeft: boolean[];
+            };
+        };
+    }) => {
+        leafPrevious: LinkedMerkleWitnessTemplate;
+        leafCurrent: LinkedMerkleWitnessTemplate;
+    };
+    empty: () => {
+        leafPrevious: LinkedMerkleWitnessTemplate;
+        leafCurrent: LinkedMerkleWitnessTemplate;
+    };
+};
+declare class LinkedOperationWitnessTemplate extends LinkedOperationWitnessTemplate_base {
+}
+export interface AbstractLinkedMerkleTree {
+    leafStore: LinkedLeafStore;
+    tree: RollupMerkleTree;
+    /**
+     * 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 path of the leaf node.
+     * @param value New value.
+     */
+    setLeaf(path: bigint, value?: bigint): LinkedOperationWitnessValue;
+    setLeaves(batch: {
+        path: bigint;
+        value: bigint;
+    }[]): void;
+    /**
+     * Returns a leaf which lives at a given path.
+     * Errors otherwise.
+     * @param path Index of the node.
+     * @returns The data of the leaf.
+     */
+    getLeaf(path: bigint): LinkedLeafStruct | undefined;
+    /**
+     * 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.
+     * @param path Position of the leaf node.
+     * @returns The witness that belongs to the leaf.
+     */
+    getReadWitness(path: bigint): LinkedMerkleWitnessValue;
+}
+export interface AbstractLinkedMerkleTreeClass {
+    new (store: MerkleTreeStore, leafStore: LinkedLeafStore): AbstractLinkedMerkleTree;
+    WITNESS: typeof LinkedOperationWitnessTemplate & {
+        fromReadWitness(readWitness: LinkedMerkleWitnessTemplate): LinkedOperationWitnessTemplate;
+    };
+    READ_WITNESS: typeof LinkedMerkleWitnessTemplate & TypedClass<{
+        checkMembership(root: Field, path: Field, value: Field): Bool;
+    }>;
+    HEIGHT: number;
+    EMPTY_ROOT: Field;
+    dummyWitness(): LinkedOperationWitnessValue;
+    dummyReadWitness(): LinkedMerkleWitnessValue;
+}
+export {};
+//# sourceMappingURL=AbstractLinkedMerkleTree.d.ts.map

package/dist/trees/lmt/AbstractLinkedMerkleTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AbstractLinkedMerkleTree.d.ts","sourceRoot":"","sources":["../../../src/trees/lmt/AbstractLinkedMerkleTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAU,MAAM,MAAM,CAAC;AAE3C,OAAO,EAAoB,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAChF,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAE5D,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;;;;AAE3D,cAAM,uBAAwB,SAAQ,4BAA4B;CAAG;AAErE,KAAK,wBAAwB,GAAG;IAC9B,IAAI,EAAE,gBAAgB,CAAC;IACvB,aAAa,EAAE,uBAAuB,CAAC;IACvC,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;CAC/D,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIF,cAAM,2BAA4B,SAAQ,gCAGxC;IACO,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI;CAIrE;AAED,KAAK,2BAA2B,GAAG;IACjC,YAAY,EAAE,wBAAwB,CAAC;IACvC,WAAW,EAAE,wBAAwB,CAAC;CACvC,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEF,cAAM,8BAA+B,SAAQ,mCAG3C;CAAG;AAEL,MAAM,WAAW,wBAAwB;IACvC,SAAS,EAAE,eAAe,CAAC;IAE3B,IAAI,EAAE,gBAAgB,CAAC;IAEvB;;;OAGG;IACH,OAAO,IAAI,KAAK,CAAC;IAEjB;;;;OAIG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,2BAA2B,CAAC;IAEnE,SAAS,CAAC,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE,GAAG,IAAI,CAAC;IAE1D;;;;;OAKG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,gBAAgB,GAAG,SAAS,CAAC;IAEpD;;;;;;OAMG;IACH,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,wBAAwB,CAAC;CACxD;AAED,MAAM,WAAW,6BAA6B;IAC5C,KACE,KAAK,EAAE,eAAe,EACtB,SAAS,EAAE,eAAe,GACzB,wBAAwB,CAAC;IAE5B,OAAO,EAAE,OAAO,8BAA8B,GAAG;QAC/C,eAAe,CACb,WAAW,EAAE,2BAA2B,GACvC,8BAA8B,CAAC;KACnC,CAAC;IAEF,YAAY,EAAE,OAAO,2BAA2B,GAC9C,UAAU,CAAC;QACT,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;KAC/D,CAAC,CAAC;IAEL,MAAM,EAAE,MAAM,CAAC;IAEf,UAAU,EAAE,KAAK,CAAC;IAElB,YAAY,IAAI,2BAA2B,CAAC;IAE5C,gBAAgB,IAAI,wBAAwB,CAAC;CAC9C"}

package/dist/trees/lmt/AbstractLinkedMerkleTree.js

@@ -0,0 +1,22 @@
+import { Bool, Struct } from "o1js";
+import { createMerkleTree } from "../sparse/RollupMerkleTree";
+import { LinkedLeafStruct } from "./LinkedMerkleTreeTypes";
+class RollupMerkleTreeWitness extends createMerkleTree(40).WITNESS {
+}
+// We use the RollupMerkleTreeWitness here, although we will actually implement
+// the RollupMerkleTreeWitnessV2 defined below when instantiating the class.
+class LinkedMerkleWitnessTemplate extends Struct({
+    leaf: LinkedLeafStruct,
+    merkleWitness: RollupMerkleTreeWitness,
+}) {
+    checkMembership(root, path, value) {
+        // Mock implementation for typing
+        return Bool(true);
+    }
+}
+class LinkedOperationWitnessTemplate extends Struct({
+    leafPrevious: LinkedMerkleWitnessTemplate,
+    leafCurrent: LinkedMerkleWitnessTemplate,
+}) {
+}
+//# sourceMappingURL=AbstractLinkedMerkleTree.js.map

package/dist/trees/lmt/AbstractLinkedMerkleTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AbstractLinkedMerkleTree.js","sourceRoot":"","sources":["../../../src/trees/lmt/AbstractLinkedMerkleTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAS,MAAM,EAAE,MAAM,MAAM,CAAC;AAE3C,OAAO,EAAE,gBAAgB,EAAoB,MAAM,4BAA4B,CAAC;AAKhF,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D,MAAM,uBAAwB,SAAQ,gBAAgB,CAAC,EAAE,CAAC,CAAC,OAAO;CAAG;AAQrE,+EAA+E;AAC/E,4EAA4E;AAC5E,MAAM,2BAA4B,SAAQ,MAAM,CAAC;IAC/C,IAAI,EAAE,gBAAgB;IACtB,aAAa,EAAE,uBAAuB;CACvC,CAAC;IACO,eAAe,CAAC,IAAW,EAAE,IAAW,EAAE,KAAY;QAC3D,iCAAiC;QACjC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;CACF;AAOD,MAAM,8BAA+B,SAAQ,MAAM,CAAC;IAClD,YAAY,EAAE,2BAA2B;IACzC,WAAW,EAAE,2BAA2B;CACzC,CAAC;CAAG"}

package/dist/trees/lmt/InMemoryLinkedLeafStore.d.ts

@@ -0,0 +1,21 @@
+import { LinkedLeafStore, LinkedLeaf } from "./LinkedLeafStore";
+export declare class InMemoryLinkedLeafStore implements LinkedLeafStore {
+    leaves: {
+        [key: string]: {
+            leaf: LinkedLeaf;
+            index: bigint;
+        };
+    };
+    maximumIndex?: bigint;
+    getLeaf(path: bigint): {
+        leaf: LinkedLeaf;
+        index: bigint;
+    } | undefined;
+    setLeaf(index: bigint, value: LinkedLeaf): void;
+    getMaximumIndex(): bigint | undefined;
+    getPreviousLeaf(path: bigint): {
+        leaf: LinkedLeaf;
+        index: bigint;
+    } | undefined;
+}
+//# sourceMappingURL=InMemoryLinkedLeafStore.d.ts.map

package/dist/trees/lmt/InMemoryLinkedLeafStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"InMemoryLinkedLeafStore.d.ts","sourceRoot":"","sources":["../../../src/trees/lmt/InMemoryLinkedLeafStore.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEhE,qBAAa,uBAAwB,YAAW,eAAe;IACtD,MAAM,EAAE;QACb,CAAC,GAAG,EAAE,MAAM,GAAG;YAAE,IAAI,EAAE,UAAU,CAAC;YAAC,KAAK,EAAE,MAAM,CAAA;SAAE,CAAC;KACpD,CAAM;IAEA,YAAY,CAAC,EAAE,MAAM,CAAC;IAEtB,OAAO,CACZ,IAAI,EAAE,MAAM,GACX;QAAE,IAAI,EAAE,UAAU,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,SAAS;IAI3C,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI;IAa/C,eAAe,IAAI,MAAM,GAAG,SAAS;IAKrC,eAAe,CACpB,IAAI,EAAE,MAAM,GACX;QAAE,IAAI,EAAE,UAAU,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,SAAS;CAMnD"}

package/dist/trees/lmt/InMemoryLinkedLeafStore.js

@@ -0,0 +1,26 @@
+export class InMemoryLinkedLeafStore {
+    constructor() {
+        this.leaves = {};
+    }
+    getLeaf(path) {
+        return this.leaves[path.toString()];
+    }
+    setLeaf(index, value) {
+        const leaf = this.getLeaf(value.path);
+        if (leaf !== undefined && leaf?.index !== index) {
+            throw new Error("Cannot change index of existing leaf");
+        }
+        this.leaves[value.path.toString()] = { leaf: value, index: index };
+        if (index > (this.maximumIndex ?? -1)) {
+            this.maximumIndex = index;
+        }
+    }
+    getMaximumIndex() {
+        return this.maximumIndex;
+    }
+    // This gets the leaf with the closest path.
+    getPreviousLeaf(path) {
+        return Object.values(this.leaves).find((storedLeaf) => storedLeaf.leaf.nextPath > path && storedLeaf.leaf.path < path);
+    }
+}
+//# sourceMappingURL=InMemoryLinkedLeafStore.js.map

package/dist/trees/lmt/InMemoryLinkedLeafStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InMemoryLinkedLeafStore.js","sourceRoot":"","sources":["../../../src/trees/lmt/InMemoryLinkedLeafStore.ts"],"names":[],"mappings":"AAEA,MAAM,OAAO,uBAAuB;IAApC;QACS,WAAM,GAET,EAAE,CAAC;IAoCT,CAAC;IAhCQ,OAAO,CACZ,IAAY;QAEZ,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACtC,CAAC;IAEM,OAAO,CAAC,KAAa,EAAE,KAAiB;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAEtC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,EAAE,KAAK,KAAK,KAAK,EAAE;YAC/C,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;SACzD;QAED,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACnE,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,EAAE;YACrC,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;SAC3B;IACH,CAAC;IAEM,eAAe;QACpB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED,4CAA4C;IACrC,eAAe,CACpB,IAAY;QAEZ,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CACpC,CAAC,UAAU,EAAE,EAAE,CACb,UAAU,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CACjE,CAAC;IACJ,CAAC;CACF"}

package/dist/trees/lmt/InMemoryLinkedMerkleLeafStore.d.ts

@@ -0,0 +1,7 @@
+import { InMemoryLinkedLeafStore } from "./InMemoryLinkedLeafStore";
+import { InMemoryMerkleTreeStorage } from "../sparse/InMemoryMerkleTreeStorage";
+declare const InMemoryLinkedMerkleLeafStore_base: import("ts-mixer/dist/types/types").Class<any[], InMemoryLinkedLeafStore & InMemoryMerkleTreeStorage, typeof InMemoryLinkedLeafStore & typeof InMemoryMerkleTreeStorage>;
+export declare class InMemoryLinkedMerkleLeafStore extends InMemoryLinkedMerkleLeafStore_base {
+}
+export {};
+//# sourceMappingURL=InMemoryLinkedMerkleLeafStore.d.ts.map

package/dist/trees/lmt/InMemoryLinkedMerkleLeafStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"InMemoryLinkedMerkleLeafStore.d.ts","sourceRoot":"","sources":["../../../src/trees/lmt/InMemoryLinkedMerkleLeafStore.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AACpE,OAAO,EAAE,yBAAyB,EAAE,MAAM,qCAAqC,CAAC;;AAEhF,qBAAa,6BAA8B,SAAQ,kCAGlD;CAAG"}