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

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

@@ -0,0 +1,74 @@
+import { Field } from "o1js";
+declare const LinkedLeafStruct_base: (new (value: {
+    value: import("o1js/dist/node/lib/provable/field").Field;
+    path: import("o1js/dist/node/lib/provable/field").Field;
+    nextPath: import("o1js/dist/node/lib/provable/field").Field;
+}) => {
+    value: import("o1js/dist/node/lib/provable/field").Field;
+    path: import("o1js/dist/node/lib/provable/field").Field;
+    nextPath: import("o1js/dist/node/lib/provable/field").Field;
+}) & {
+    _isStruct: true;
+} & Omit<import("o1js/dist/node/lib/provable/types/provable-intf").Provable<{
+    value: import("o1js/dist/node/lib/provable/field").Field;
+    path: import("o1js/dist/node/lib/provable/field").Field;
+    nextPath: import("o1js/dist/node/lib/provable/field").Field;
+}, {
+    value: bigint;
+    path: bigint;
+    nextPath: bigint;
+}>, "fromFields"> & {
+    fromFields: (fields: import("o1js/dist/node/lib/provable/field").Field[]) => {
+        value: import("o1js/dist/node/lib/provable/field").Field;
+        path: import("o1js/dist/node/lib/provable/field").Field;
+        nextPath: import("o1js/dist/node/lib/provable/field").Field;
+    };
+} & {
+    fromValue: (value: {
+        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;
+    }) => {
+        value: import("o1js/dist/node/lib/provable/field").Field;
+        path: import("o1js/dist/node/lib/provable/field").Field;
+        nextPath: import("o1js/dist/node/lib/provable/field").Field;
+    };
+    toInput: (x: {
+        value: import("o1js/dist/node/lib/provable/field").Field;
+        path: import("o1js/dist/node/lib/provable/field").Field;
+        nextPath: import("o1js/dist/node/lib/provable/field").Field;
+    }) => {
+        fields?: import("o1js/dist/node/lib/provable/field").Field[] | undefined;
+        packed?: [import("o1js/dist/node/lib/provable/field").Field, number][] | undefined;
+    };
+    toJSON: (x: {
+        value: import("o1js/dist/node/lib/provable/field").Field;
+        path: import("o1js/dist/node/lib/provable/field").Field;
+        nextPath: import("o1js/dist/node/lib/provable/field").Field;
+    }) => {
+        value: string;
+        path: string;
+        nextPath: string;
+    };
+    fromJSON: (x: {
+        value: string;
+        path: string;
+        nextPath: string;
+    }) => {
+        value: import("o1js/dist/node/lib/provable/field").Field;
+        path: import("o1js/dist/node/lib/provable/field").Field;
+        nextPath: import("o1js/dist/node/lib/provable/field").Field;
+    };
+    empty: () => {
+        value: import("o1js/dist/node/lib/provable/field").Field;
+        path: import("o1js/dist/node/lib/provable/field").Field;
+        nextPath: import("o1js/dist/node/lib/provable/field").Field;
+    };
+};
+export declare class LinkedLeafStruct extends LinkedLeafStruct_base {
+    isDummy(): import("o1js/dist/node/lib/provable/bool").Bool;
+    hash(): Field;
+    static dummy(): LinkedLeafStruct;
+}
+export {};
+//# sourceMappingURL=LinkedMerkleTreeTypes.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedMerkleTreeTypes.d.ts","sourceRoot":"","sources":["../../../src/trees/lmt/LinkedMerkleTreeTypes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAA8B,MAAM,MAAM,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEzD,qBAAa,gBAAiB,SAAQ,qBAIpC;IACO,OAAO;IAIP,IAAI,IAAI,KAAK;WAKN,KAAK,IAAI,gBAAgB;CAOxC"}

package/dist/trees/lmt/LinkedMerkleTreeTypes.js

@@ -0,0 +1,50 @@
+import { Field, Poseidon, Provable, Struct } from "o1js";
+export class LinkedLeafStruct extends Struct({
+    value: Field,
+    path: Field,
+    nextPath: Field,
+}) {
+    isDummy() {
+        return this.path.equals(0).and(this.nextPath.equals(0));
+    }
+    hash() {
+        const hash = Poseidon.hash(LinkedLeafStruct.toFields(this));
+        return Provable.if(this.isDummy(), Field(0), hash);
+    }
+    static dummy() {
+        return new LinkedLeafStruct({
+            value: Field(0),
+            path: Field(0),
+            nextPath: Field(0),
+        });
+    }
+}
+// export class LinkedMerkleTreeGlobalState extends Struct({
+//   root: Field,
+//   lastOccupiedIndex: Field,
+// }) {
+//   public static equals(
+//     state1: LinkedMerkleTreeGlobalState,
+//     state2: LinkedMerkleTreeGlobalState
+//   ): Bool {
+//     return state1.root
+//       .equals(state2.root)
+//       .and(state1.lastOccupiedIndex.equals(state2.lastOccupiedIndex));
+//   }
+//
+//   public static assertEquals(
+//     state1: LinkedMerkleTreeGlobalState,
+//     state2: LinkedMerkleTreeGlobalState,
+//     msg?: string
+//   ) {
+//     state1.root.assertEquals(
+//       state2.root,
+//       msg !== undefined ? `${msg}: root` : msg
+//     );
+//     state1.lastOccupiedIndex.assertEquals(
+//       state2.lastOccupiedIndex,
+//       msg !== undefined ? `${msg}: lastOccupiedIndex` : msg
+//     );
+//   }
+// }
+//# sourceMappingURL=LinkedMerkleTreeTypes.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedMerkleTreeTypes.js","sourceRoot":"","sources":["../../../src/trees/lmt/LinkedMerkleTreeTypes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAEzD,MAAM,OAAO,gBAAiB,SAAQ,MAAM,CAAC;IAC3C,KAAK,EAAE,KAAK;IACZ,IAAI,EAAE,KAAK;IACX,QAAQ,EAAE,KAAK;CAChB,CAAC;IACO,OAAO;QACZ,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IAEM,IAAI;QACT,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5D,OAAO,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACrD,CAAC;IAEM,MAAM,CAAC,KAAK;QACjB,OAAO,IAAI,gBAAgB,CAAC;YAC1B,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;YACf,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YACd,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;SACnB,CAAC,CAAC;IACL,CAAC;CACF;AAED,4DAA4D;AAC5D,iBAAiB;AACjB,8BAA8B;AAC9B,OAAO;AACP,0BAA0B;AAC1B,2CAA2C;AAC3C,0CAA0C;AAC1C,cAAc;AACd,yBAAyB;AACzB,6BAA6B;AAC7B,yEAAyE;AACzE,MAAM;AACN,EAAE;AACF,gCAAgC;AAChC,2CAA2C;AAC3C,2CAA2C;AAC3C,mBAAmB;AACnB,QAAQ;AACR,gCAAgC;AAChC,qBAAqB;AACrB,iDAAiD;AACjD,SAAS;AACT,6CAA6C;AAC7C,kCAAkC;AAClC,8DAA8D;AAC9D,SAAS;AACT,MAAM;AACN,IAAI"}

package/dist/trees/sparse/InMemoryMerkleTreeStorage.d.ts

@@ -0,0 +1,11 @@
+import { MerkleTreeStore } from "./MerkleTreeStore";
+export declare class InMemoryMerkleTreeStorage implements MerkleTreeStore {
+    nodes: {
+        [key: number]: {
+            [key: string]: bigint;
+        };
+    };
+    getNode(key: bigint, level: number): bigint | undefined;
+    setNode(key: bigint, level: number, value: bigint): void;
+}
+//# sourceMappingURL=InMemoryMerkleTreeStorage.d.ts.map

package/dist/trees/sparse/InMemoryMerkleTreeStorage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"InMemoryMerkleTreeStorage.d.ts","sourceRoot":"","sources":["../../../src/trees/sparse/InMemoryMerkleTreeStorage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD,qBAAa,yBAA0B,YAAW,eAAe;IACxD,KAAK,EAAE;QACZ,CAAC,GAAG,EAAE,MAAM,GAAG;YACb,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;SACvB,CAAC;KACH,CAAM;IAEA,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/sparse/InMemoryMerkleTreeStorage.js

@@ -0,0 +1,13 @@
+export class InMemoryMerkleTreeStorage {
+    constructor() {
+        this.nodes = {};
+    }
+    getNode(key, level) {
+        return this.nodes[level]?.[key.toString()];
+    }
+    setNode(key, level, value) {
+        var _a;
+        ((_a = this.nodes)[level] ?? (_a[level] = {}))[key.toString()] = value;
+    }
+}
+//# sourceMappingURL=InMemoryMerkleTreeStorage.js.map

package/dist/trees/sparse/InMemoryMerkleTreeStorage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InMemoryMerkleTreeStorage.js","sourceRoot":"","sources":["../../../src/trees/sparse/InMemoryMerkleTreeStorage.ts"],"names":[],"mappings":"AAEA,MAAM,OAAO,yBAAyB;IAAtC;QACS,UAAK,GAIR,EAAE,CAAC;IAST,CAAC;IAPQ,OAAO,CAAC,GAAW,EAAE,KAAa;QACvC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC7C,CAAC;IAEM,OAAO,CAAC,GAAW,EAAE,KAAa,EAAE,KAAa;;QACtD,OAAC,IAAI,CAAC,KAAK,EAAC,KAAK,SAAL,KAAK,IAAM,EAAE,EAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;IACrD,CAAC;CACF"}

package/dist/trees/sparse/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/sparse/MerkleTreeStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MerkleTreeStore.d.ts","sourceRoot":"","sources":["../../../src/trees/sparse/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/sparse/MerkleTreeStore.js

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

package/dist/trees/sparse/MerkleTreeStore.js.map

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

package/dist/trees/sparse/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/sparse/MockAsyncMerkleStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MockAsyncMerkleStore.d.ts","sourceRoot":"","sources":["../../../src/trees/sparse/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/sparse/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/sparse/MockAsyncMerkleStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MockAsyncMerkleStore.js","sourceRoot":"","sources":["../../../src/trees/sparse/MockAsyncMerkleStore.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAEnC,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/sparse/RollupMerkleTree.d.ts

@@ -0,0 +1,158 @@
+import { Bool, Field } from "o1js";
+import { TypedClass } from "../../types";
+import { MerkleTreeStore } from "./MerkleTreeStore";
+/**
+ * More efficient version of `maybeSwapBad` which
+ * reuses an intermediate variable
+ */
+export declare function maybeSwap(b: Bool, x: Field, y: Field): [Field, Field];
+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[];
+    };
+};
+export declare class StructTemplate extends StructTemplate_base {
+}
+export interface AbstractMerkleWitness extends StructTemplate {
+    height(): number;
+    /**
+     * Calculates a root depending on the leaf value.
+     * @param hash Value of the leaf node that belongs to this Witness.
+     * @returns The calculated root.
+     */
+    calculateRoot(hash: Field): Field;
+    calculateRootIncrement(index: Field, leaf: Field): [Field, AbstractMerkleWitness];
+    /**
+     * 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;
+    checkMembershipSimple(root: 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;
+    setLeaves(updates: {
+        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/sparse/RollupMerkleTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RollupMerkleTree.d.ts","sourceRoot":"","sources":["../../../src/trees/sparse/RollupMerkleTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAA8B,MAAM,MAAM,CAAC;AAI/D,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAGpD;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAKrE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAED,qBAAa,cAAe,SAAQ,mBAGlC;CAAG;AAEL,MAAM,WAAW,qBAAsB,SAAQ,cAAc;IAC3D,MAAM,IAAI,MAAM,CAAC;IAEjB;;;;OAIG;IACH,aAAa,CAAC,IAAI,EAAE,KAAK,GAAG,KAAK,CAAC;IAElC,sBAAsB,CACpB,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,KAAK,GACV,CAAC,KAAK,EAAE,qBAAqB,CAAC,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,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAEvD,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,SAAS,CAAC,OAAO,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,KAAK,CAAA;KAAE,EAAE,GAAG,IAAI,CAAC;IAE3D;;;;;;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,CAoXxE;;AAED,qBAAa,gBAAiB,SAAQ,qBAAqB;CAAG;AAC9D,qBAAa,uBAAwB,SAAQ,gBAAgB,CAAC,OAAO;CAAG"}