@proto-kit/protocol 0.1.1-develop.336 → 0.1.1-develop.455

package/test/Option.test.ts

@@ -0,0 +1,64 @@
+import { Bool, Field, Poseidon } from "o1js";
+
+import {
+  Option,
+  ProvableOption,
+  ProvableStateTransition,
+  StateTransition,
+} from "../src";
+
+describe("option", () => {
+  it.each([
+    [
+      Option.from(Bool(true), Field(5), Bool(false), Field),
+      { isSome: true, value: Poseidon.hash([Field(5)]) },
+    ],
+    [
+      Option.from(Bool(true), Field(0), Bool(false), Field),
+      { isSome: true, value: Poseidon.hash([Field(0)]) },
+    ],
+    [
+      Option.from(Bool(true), Field(0), Bool(true), Field),
+      { isSome: true, value: Field(0) },
+    ],
+    [
+      Option.from(Bool(false), Field(1), Bool(false), Field),
+      { isSome: false, value: Poseidon.hash([Field(1)]) },
+    ],
+  ])("should encode to correct provable", (option, provableTemplate) => {
+    expect.assertions(4);
+
+    const provableInput = new ProvableOption({
+      isSome: Bool(provableTemplate.isSome),
+      value: provableTemplate.value,
+    });
+
+    const provable = option.toProvable();
+    const fields = ProvableOption.toFields(provable);
+
+    expect(provable.value.toBigInt()).toStrictEqual(
+      provableInput.value.toBigInt()
+    );
+    expect(provable.isSome.toBoolean()).toStrictEqual(
+      provableInput.isSome.toBoolean()
+    );
+
+    expect(fields[0]).toStrictEqual(provableInput.isSome.toFields()[0]);
+    expect(fields[1]).toStrictEqual(provableInput.value);
+  });
+});
+
+describe.skip("StateTransition", () => {
+  it.each([
+    StateTransition.fromTo(
+      Field(
+        "12400094993176908175853015388851707312254268028646194084157588096832563763032"
+      ),
+      Option.fromValue(Field(0), Field),
+      Option.fromValue(Field(100), Field)
+    ),
+  ])("should encode StateTransition correctly", (st) => {
+    const provable = st.toProvable();
+    console.log(ProvableStateTransition.toJSON(provable));
+  });
+});

package/test/StateTransition.test.ts

@@ -13,7 +13,7 @@ import {
 import {
   RollupMerkleTree,
   type RollupMerkleWitness,
-} from "../src/utils/merkletree/RollupMerkleTree.js";
+} from "../../common/src/trees/RollupMerkleTree.js";
 import { StateTransitionProver } from "../src/prover/statetransition/StateTransitionProver.js";
 import type { StateTransitionWitnessProvider } from "../src/prover/statetransition/StateTransitionWitnessProvider.js";
 

package/dist/utils/merkletree/InMemoryMerkleTreeStorage.d.ts

@@ -1,11 +0,0 @@
-import { MerkleTreeStore } from "./MerkleTreeStore";
-export declare class InMemoryMerkleTreeStorage implements MerkleTreeStore {
-    protected readonly 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/utils/merkletree/InMemoryMerkleTreeStorage.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"InMemoryMerkleTreeStorage.d.ts","sourceRoot":"","sources":["../../../src/utils/merkletree/InMemoryMerkleTreeStorage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD,qBAAa,yBAA0B,YAAW,eAAe;IAC/D,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE;QACxB,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/utils/merkletree/InMemoryMerkleTreeStorage.js

@@ -1,12 +0,0 @@
-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;
-    }
-}

package/dist/utils/merkletree/MerkleTreeStore.d.ts

@@ -1,11 +0,0 @@
-export interface AsyncMerkleTreeStore {
-    openTransaction: () => void;
-    commit: () => void;
-    setNodeAsync: (key: bigint, level: number, value: bigint) => Promise<void>;
-    getNodeAsync: (key: bigint, level: number) => Promise<bigint | undefined>;
-}
-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/utils/merkletree/MerkleTreeStore.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"MerkleTreeStore.d.ts","sourceRoot":"","sources":["../../../src/utils/merkletree/MerkleTreeStore.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,oBAAoB;IACnC,eAAe,EAAE,MAAM,IAAI,CAAC;IAE5B,MAAM,EAAE,MAAM,IAAI,CAAC;IAEnB,YAAY,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IAE3E,YAAY,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;CAC3E;AAED,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/utils/merkletree/MerkleTreeStore.js

@@ -1 +0,0 @@
-export {};

package/dist/utils/merkletree/RollupMerkleTree.d.ts

@@ -1,132 +0,0 @@
-import { Bool, Field } from "o1js";
-import { MerkleTreeStore } from "./MerkleTreeStore";
-export { RollupMerkleTree, RollupMerkleWitness };
-export { maybeSwap };
-declare const RollupMerkleWitness_base: (new (value: {
-    path: import("o1js/dist/node/lib/field").Field[];
-    isLeft: import("o1js/dist/node/lib/bool").Bool[];
-}) => {
-    path: import("o1js/dist/node/lib/field").Field[];
-    isLeft: import("o1js/dist/node/lib/bool").Bool[];
-}) & {
-    _isStruct: true;
-} & import("o1js/dist/node/snarky").ProvablePure<{
-    path: import("o1js/dist/node/lib/field").Field[];
-    isLeft: import("o1js/dist/node/lib/bool").Bool[];
-}> & {
-    toInput: (x: {
-        path: import("o1js/dist/node/lib/field").Field[];
-        isLeft: import("o1js/dist/node/lib/bool").Bool[];
-    }) => {
-        fields?: import("o1js/dist/node/lib/field").Field[] | undefined;
-        packed?: [import("o1js/dist/node/lib/field").Field, number][] | undefined;
-    };
-    toJSON: (x: {
-        path: import("o1js/dist/node/lib/field").Field[];
-        isLeft: import("o1js/dist/node/lib/bool").Bool[];
-    }) => {
-        path: string[];
-        isLeft: boolean[];
-    };
-    fromJSON: (x: {
-        path: string[];
-        isLeft: boolean[];
-    }) => {
-        path: import("o1js/dist/node/lib/field").Field[];
-        isLeft: import("o1js/dist/node/lib/bool").Bool[];
-    };
-};
-/**
- * The {@link BaseMerkleWitness} class defines a circuit-compatible base class
- * for [Merkle Witness'](https://computersciencewiki.org/index.php/Merkle_proof).
- */
-declare class RollupMerkleWitness extends RollupMerkleWitness_base {
-    static height: number;
-    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;
-    toShortenedEntries(): string[];
-}
-/**
- * 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).
- */
-declare class RollupMerkleTree {
-    static height: number;
-    static get leafCount(): bigint;
-    private readonly zeroes;
-    readonly store: MerkleTreeStore;
-    constructor(store: MerkleTreeStore);
-    /**
-     * 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;
-    private setNode;
-    /**
-     * TODO: if this is passed an index bigger than the max, it will set a couple
-     * of out-of-bounds nodes but not affect the real Merkle root. OK?
-     */
-    /**
-     * 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): RollupMerkleWitness;
-    /**
-     * Fills all leaves of the tree.
-     * @param leaves Values to fill the leaves with.
-     */
-    fill(leaves: Field[]): void;
-    /**
-     * Returns the amount of leaf nodes.
-     * @returns Amount of leaf nodes.
-     */
-    get leafCount(): bigint;
-}
-export declare namespace MerkleTreeUtils {
-    function normalizeKey(key: Field): Field;
-    function checkMembership(witness: RollupMerkleWitness, root: Field, key: Field, value: Field): Bool;
-    function checkMembershipGetRoots(witness: RollupMerkleWitness, root: Field, key: Field, value: Field): [Bool, Field, Field];
-    function computeRoot(witness: RollupMerkleWitness, value: Field): Field;
-}
-/**
- * More efficient version of `maybeSwapBad` which
- * reuses an intermediate variable
- */
-declare function maybeSwap(b: Bool, x: Field, y: Field): [Field, Field];
-//# sourceMappingURL=RollupMerkleTree.d.ts.map

package/dist/utils/merkletree/RollupMerkleTree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"RollupMerkleTree.d.ts","sourceRoot":"","sources":["../../../src/utils/merkletree/RollupMerkleTree.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,IAAI,EAAE,KAAK,EAA8B,MAAM,MAAM,CAAC;AAK/D,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAIpD,OAAO,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,CAAC;AAIjD,OAAO,EAAE,SAAS,EAAE,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAErB;;;GAGG;AACH,cAAM,mBAAoB,SAAQ,wBAGhC;IACA,OAAc,MAAM,SAAO;IAEpB,MAAM,IAAI,MAAM;IAIvB;;;;OAIG;IACI,aAAa,CAAC,IAAI,EAAE,KAAK,GAAG,KAAK;IAaxC;;;OAGG;IACI,cAAc,IAAI,KAAK;IAkBvB,kBAAkB;CAO1B;AAED;;;;;;;;;;;;;GAaG;AACH,cAAM,gBAAgB;IACpB,OAAc,MAAM,SAAO;IAE3B,WAAkB,SAAS,IAAI,MAAM,CAEpC;IAED,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAW;IAElC,SAAgB,KAAK,EAAE,eAAe,CAAC;gBAEpB,KAAK,EAAE,eAAe;IAYzC;;;;;OAKG;IAEI,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK;IAInD;;;OAGG;IAEI,OAAO,IAAI,KAAK;IAMvB,OAAO,CAAC,OAAO;IAIf;;;OAGG;IAEH;;;;OAIG;IAEI,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK;IAgBzC;;;;;;OAMG;IACI,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,mBAAmB;IAqBrD;;;OAGG;IAEI,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE;IAM3B;;;OAGG;IACH,IAAW,SAAS,IAAI,MAAM,CAE7B;CACF;AAGD,yBAAiB,eAAe,CAAC;IAC/B,SAAgB,YAAY,CAAC,GAAG,EAAE,KAAK,GAAG,KAAK,CAS9C;IAED,SAAgB,eAAe,CAC7B,OAAO,EAAE,mBAAmB,EAC5B,IAAI,EAAE,KAAK,EACX,GAAG,EAAE,KAAK,EACV,KAAK,EAAE,KAAK,GACX,IAAI,CAKN;IAED,SAAgB,uBAAuB,CACrC,OAAO,EAAE,mBAAmB,EAC5B,IAAI,EAAE,KAAK,EACX,GAAG,EAAE,KAAK,EACV,KAAK,EAAE,KAAK,GACX,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAKtB;IAED,SAAgB,WAAW,CACzB,OAAO,EAAE,mBAAmB,EAC5B,KAAK,EAAE,KAAK,GACX,KAAK,CAEP;CACF;AAED;;;GAGG;AACH,iBAAS,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAK9D"}

package/dist/utils/merkletree/RollupMerkleTree.js

@@ -1,251 +0,0 @@
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
-    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
-    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
-    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
-    return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __metadata = (this && this.__metadata) || function (k, v) {
-    if (typeof Reflect === "object" && typeof Reflect.metadata === "function") return Reflect.metadata(k, v);
-};
-/* eslint-disable id-length */
-/* eslint-disable line-comment-position */
-/* eslint-disable no-inline-comments */
-/* eslint-disable @typescript-eslint/no-magic-numbers */
-import { Bool, Field, Poseidon, Provable, Struct } from "o1js";
-import { range } from "@proto-kit/common";
-import { notInCircuit } from "../utils";
-// external API
-// eslint-disable-next-line @typescript-eslint/no-use-before-define
-export { RollupMerkleTree, RollupMerkleWitness };
-// internal API
-// eslint-disable-next-line @typescript-eslint/no-use-before-define
-export { maybeSwap };
-/**
- * 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, 256 - 1),
-    isLeft: Provable.Array(Bool, 256 - 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(hash) {
-        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();
-        // eslint-disable-next-line no-underscore-dangle
-        for (let index_ = 1; index_ < n; ++index_) {
-            index = Provable.if(this.isLeft[index_ - 1], index, index.add(powerOfTwo));
-            powerOfTwo = powerOfTwo.mul(2);
-        }
-        return index;
-    }
-    toShortenedEntries() {
-        return range(0, 5)
-            .concat(range(251, 255))
-            .map((index) => [this.path[index].toString(), this.isLeft[index].toString()].toString());
-    }
-}
-RollupMerkleWitness.height = 256;
-/**
- * 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).
- */
-class RollupMerkleTree {
-    static get leafCount() {
-        return 2n ** BigInt(RollupMerkleTree.height - 1);
-    }
-    constructor(store) {
-        this.store = store;
-        // eslint-disable-next-line @shopify/prefer-class-properties
-        this.zeroes = [0n];
-        for (let index = 1; index < RollupMerkleTree.height; index += 1) {
-            const previousLevel = Field(this.zeroes[index - 1]);
-            this.zeroes.push(Poseidon.hash([previousLevel, previousLevel]).toBigInt());
-        }
-    }
-    /**
-     * 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) {
-        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(RollupMerkleTree.height - 1, 0n);
-    }
-    // eslint-disable-next-line no-warning-comments
-    // TODO: this allows to set a node at an index larger than the size. OK?
-    setNode(level, index, value) {
-        this.store.setNode(index, level, value.toBigInt());
-    }
-    /**
-     * TODO: if this is passed an index bigger than the max, it will set a couple
-     * of out-of-bounds nodes but not affect the real Merkle root. OK?
-     */
-    /**
-     * 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) {
-        if (index >= this.leafCount) {
-            index %= this.leafCount;
-        }
-        this.setNode(0, index, leaf);
-        let currentIndex = index;
-        for (let level = 1; level < RollupMerkleTree.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) {
-        if (index >= this.leafCount) {
-            throw new Error("Index too large for merkle height");
-        }
-        const path = [];
-        const isLefts = [];
-        for (let level = 0; level < RollupMerkleTree.height - 1; level += 1) {
-            const isLeft = index % 2n === 0n;
-            const sibling = this.getNode(level, isLeft ? index + 1n : index - 1n);
-            isLefts.push(Bool(isLeft));
-            path.push(sibling);
-            index /= 2n;
-        }
-        return new RollupMerkleWitness({
-            isLeft: isLefts,
-            path,
-        });
-    }
-    // eslint-disable-next-line no-warning-comments, max-len
-    // 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 RollupMerkleTree.leafCount;
-    }
-}
-RollupMerkleTree.height = 256;
-__decorate([
-    notInCircuit(),
-    __metadata("design:type", Function),
-    __metadata("design:paramtypes", [Number, BigInt]),
-    __metadata("design:returntype", Field)
-], RollupMerkleTree.prototype, "getNode", null);
-__decorate([
-    notInCircuit(),
-    __metadata("design:type", Function),
-    __metadata("design:paramtypes", []),
-    __metadata("design:returntype", Field)
-], RollupMerkleTree.prototype, "getRoot", null);
-__decorate([
-    notInCircuit(),
-    __metadata("design:type", Function),
-    __metadata("design:paramtypes", [BigInt, Field]),
-    __metadata("design:returntype", void 0)
-], RollupMerkleTree.prototype, "setLeaf", null);
-__decorate([
-    notInCircuit(),
-    __metadata("design:type", Function),
-    __metadata("design:paramtypes", [Array]),
-    __metadata("design:returntype", void 0)
-], RollupMerkleTree.prototype, "fill", null);
-// eslint-disable-next-line @typescript-eslint/no-namespace
-export var MerkleTreeUtils;
-(function (MerkleTreeUtils) {
-    function normalizeKey(key) {
-        // if(NJORD_MERKLE_TREE_HEIGHT < 256){
-        //     return fieldMod(key, Field(RollupMerkleTree.leafCount).toConstant())
-        // eslint-disable-next-line max-len
-        //     // return modPower2(key, RollupMerkleTree.height - 1) //TODO Fix modPower2
-        // }else{
-        return key;
-        // }
-    }
-    MerkleTreeUtils.normalizeKey = normalizeKey;
-    function checkMembership(witness, root, key, value) {
-        const root2 = witness.calculateRoot(value);
-        const key2 = witness.calculateIndex();
-        key.assertEquals(key2, "Keys of MerkleWitness does not match");
-        return root.equals(root2);
-    }
-    MerkleTreeUtils.checkMembership = checkMembership;
-    function checkMembershipGetRoots(witness, root, key, value) {
-        const root2 = witness.calculateRoot(value);
-        const key2 = witness.calculateIndex();
-        key.assertEquals(key2, "Keys of MerkleWitness does not match");
-        return [root.equals(root2), root, root2];
-    }
-    MerkleTreeUtils.checkMembershipGetRoots = checkMembershipGetRoots;
-    function computeRoot(witness, value) {
-        return witness.calculateRoot(value);
-    }
-    MerkleTreeUtils.computeRoot = computeRoot;
-})(MerkleTreeUtils || (MerkleTreeUtils = {}));
-/**
- * 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];
-}

package/src/utils/merkletree/InMemoryMerkleTreeStorage.ts

@@ -1,17 +0,0 @@
-import { MerkleTreeStore } from "./MerkleTreeStore";
-
-export class InMemoryMerkleTreeStorage implements MerkleTreeStore {
-  protected readonly nodes: {
-    [key: number]: {
-      [key: string]: bigint;
-    };
-  } = {};
-
-  public getNode(key: bigint, level: number): bigint | undefined {
-    return this.nodes[level]?.[key.toString()];
-  }
-
-  public setNode(key: bigint, level: number, value: bigint): void {
-    (this.nodes[level] ??= {})[key.toString()] = value;
-  }
-}

package/src/utils/merkletree/MerkleTreeStore.ts

@@ -1,15 +0,0 @@
-export interface AsyncMerkleTreeStore {
-  openTransaction: () => void;
-
-  commit: () => void;
-
-  setNodeAsync: (key: bigint, level: number, value: bigint) => Promise<void>;
-
-  getNodeAsync: (key: bigint, level: number) => Promise<bigint | undefined>;
-}
-
-export interface MerkleTreeStore {
-  setNode: (key: bigint, level: number, value: bigint) => void;
-
-  getNode: (key: bigint, level: number) => bigint | undefined;
-}