@proto-kit/protocol 0.1.1-develop.164 → 0.1.1-develop.1661

package/dist/utils/PrefixedHashList.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"PrefixedHashList.d.ts","sourceRoot":"","sources":["../../src/utils/PrefixedHashList.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,oBAAoB,EAAY,MAAM,UAAU,CAAC;AAEjE,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAGzD,qBAAa,wBAAwB,CAAC,KAAK,CAAE,SAAQ,gBAAgB,CAAC,KAAK,CAAC;IAC1E,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAQ;gBAG7B,SAAS,EAAE,oBAAoB,CAAC,KAAK,CAAC,EACtC,MAAM,EAAE,MAAM,EACd,kBAAkB,GAAE,KAAgB;IAMtC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,KAAK;CAGzC"}

package/dist/utils/PrefixedHashList.js

@@ -1,12 +0,0 @@
-import { Field, Poseidon } from "snarkyjs";
-import { ProvableHashList } from "./ProvableHashList.js";
-import { stringToField } from "./Utils";
-export class PrefixedProvableHashList extends ProvableHashList {
-  constructor(valueType, prefix, internalCommitment = Field(0)) {
-    super(valueType, internalCommitment);
-    this.prefix = stringToField(prefix);
-  }
-  hash(elements) {
-    return Poseidon.hash([this.prefix, ...elements]);
-  }
-}

package/dist/utils/Utils.d.ts

@@ -1,17 +0,0 @@
-import { Field } from "snarkyjs";
-export type ReturnType<FunctionType extends Function> = FunctionType extends (...args: any[]) => infer Return ? Return : any;
-export type UnTypedClass = new (...args: any[]) => any;
-export type TypedClass<Class> = new (...args: any[]) => Class;
-export type Subclass<Class extends new (...args: any) => any> = (new (...args: any) => InstanceType<Class>) & {
-    [Key in keyof Class]: Class[Key];
-} & {
-    prototype: InstanceType<Class>;
-};
-export declare function notInCircuit(): MethodDecorator;
-export declare function stringToField(value: string, throwOnOverflow?: boolean): import("snarkyjs/dist/node/lib/field").Field;
-/**
- * Note: This only works for strings that have been encoded using the `throwOnOverflow` set to true
- */
-export declare function fieldToString(value: Field | bigint): string;
-export declare function noop(): void;
-//# sourceMappingURL=utils.d.ts.map

package/dist/utils/Utils.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../src/utils/utils.ts"],"names":[],"mappings":"AAGA,OAAO,EAAW,KAAK,EAAmB,MAAM,UAAU,CAAC;AAE3D,MAAM,MAAM,UAAU,CAAC,YAAY,SAAS,QAAQ,IAAI,YAAY,SAAS,CAC3E,GAAG,IAAI,EAAE,GAAG,EAAE,KACX,MAAM,MAAM,GACb,MAAM,GACN,GAAG,CAAC;AAER,MAAM,MAAM,YAAY,GAAG,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC;AAEvD,MAAM,MAAM,UAAU,CAAC,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,KAAK,CAAC;AAE9D,MAAM,MAAM,QAAQ,CAAC,KAAK,SAAS,KAAK,GAAG,IAAI,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC,KAC/D,GAAG,IAAI,EAAE,GAAG,KACT,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG;KACzB,GAAG,IAAI,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC;CACjC,GAAG;IAAE,SAAS,EAAE,YAAY,CAAC,KAAK,CAAC,CAAA;CAAE,CAAC;AAEvC,wBAAgB,YAAY,IAAI,eAAe,CAoB9C;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,eAAe,UAAQ,gDAiCnE;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,GAAG,MAAM,CAmB3D;AAED,wBAAgB,IAAI,IAAI,IAAI,CAAG"}

package/dist/utils/Utils.js

@@ -1,64 +0,0 @@
-// eslint-disable-next-line max-len
-/* eslint-disable @typescript-eslint/no-explicit-any,@typescript-eslint/ban-types, @typescript-eslint/no-unsafe-return,@typescript-eslint/no-empty-function */
-import { Circuit, Field, Poseidon } from "snarkyjs";
-export function notInCircuit() {
-    return function ReplacedFunction(target, propertyKey, descriptor) {
-        // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment
-        const childFunction = descriptor.value;
-        descriptor.value = function value(...args) {
-            if (Circuit.inCheckedComputation() || Circuit.inProver()) {
-                throw new Error(`Method ${propertyKey.toString()} is supposed to be only called outside of the circuit`);
-            }
-            // eslint-disable-next-line max-len
-            // eslint-disable-next-line @typescript-eslint/no-unsafe-call,@typescript-eslint/no-unsafe-member-access
-            return childFunction.apply(this, args);
-        };
-        return descriptor;
-    };
-}
-export function stringToField(value, throwOnOverflow = false) {
-    const fieldSize = Field.sizeInBytes();
-    // eslint-disable-next-line putout/putout
-    const encoder = new TextEncoder();
-    const stringBytes = Array.from(encoder.encode(value));
-    const padding = Array.from({
-        length: fieldSize - stringBytes.length,
-    }).fill(0);
-    const data = stringBytes.concat(padding);
-    if (data.length > fieldSize) {
-        if (throwOnOverflow) {
-            throw new Error("Trying to encode a stringt that is larger than 256 bits");
-        }
-        // Hash the result Field[] to reduce it to
-        const chunks = data.reduce((a, b, index) => {
-            const arrayIndex = index / fieldSize;
-            if (a.length <= arrayIndex) {
-                a.push([]);
-            }
-            a[arrayIndex].push(b);
-            return a;
-        }, []);
-        return Poseidon.hash(chunks.map((x) => Field.fromBytes(x)));
-    }
-    return Field.fromBytes(data);
-}
-/**
- * Note: This only works for strings that have been encoded using the `throwOnOverflow` set to true
- */
-export function fieldToString(value) {
-    if (typeof value === "bigint") {
-        value = Field(value);
-    }
-    let bytes = Field.toBytes(value);
-    // Find start of padded zeroes in order to remove them.
-    const zeroesStart = bytes.length -
-        bytes
-            .slice()
-            .reverse()
-            .findIndex((element) => element !== 0);
-    bytes = bytes.slice(0, zeroesStart);
-    // eslint-disable-next-line putout/putout
-    const decoder = new TextDecoder();
-    return decoder.decode(new Uint8Array(bytes));
-}
-export function noop() { }

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

@@ -1,25 +0,0 @@
-import { AsyncMerkleTreeStore, 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;
-}
-export declare class CachedMerkleTreeStore extends InMemoryMerkleTreeStorage {
-    private readonly parent;
-    private writeCache;
-    constructor(parent: AsyncMerkleTreeStore);
-    setNode(key: bigint, level: number, value: bigint): void;
-    getWrittenNodes(): {
-        [key: number]: {
-            [key: string]: bigint;
-        };
-    };
-    resetWrittenNodes(): void;
-    preloadKey(index: bigint): Promise<void>;
-    mergeIntoParent(): Promise<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":"AAKA,OAAO,EAAE,oBAAoB,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAE1E,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;AAED,qBAAa,qBAAsB,SAAQ,yBAAyB;IAO/C,OAAO,CAAC,QAAQ,CAAC,MAAM;IAN1C,OAAO,CAAC,UAAU,CAIX;gBAE6B,MAAM,EAAE,oBAAoB;IAIzD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAKjD,eAAe,IAAI;QACxB,CAAC,GAAG,EAAE,MAAM,GAAG;YACb,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;SACvB,CAAC;KACH;IAIM,iBAAiB;IAIX,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAiCxC,eAAe,IAAI,OAAO,CAAC,IAAI,CAAC;CAqB9C"}

package/dist/utils/merkletree/InMemoryMerkleTreeStorage.js

@@ -1,77 +0,0 @@
-// eslint-disable-next-line max-len
-/* eslint-disable @typescript-eslint/no-magic-numbers,@typescript-eslint/no-unnecessary-condition */
-import { log } from "@proto-kit/common";
-import { RollupMerkleTree } from "./RollupMerkleTree.js";
-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;
-    }
-}
-export class CachedMerkleTreeStore extends InMemoryMerkleTreeStorage {
-    constructor(parent) {
-        super();
-        this.parent = parent;
-        this.writeCache = {};
-    }
-    setNode(key, level, value) {
-        var _a;
-        super.setNode(key, level, value);
-        ((_a = this.writeCache)[level] ?? (_a[level] = {}))[key.toString()] = value;
-    }
-    getWrittenNodes() {
-        return this.writeCache;
-    }
-    resetWrittenNodes() {
-        this.writeCache = {};
-    }
-    async preloadKey(index) {
-        log.debug(`Preloading MT ${index}`);
-        // Algo from RollupMerkleTree.getWitness()
-        const { leafCount, height } = RollupMerkleTree;
-        if (index >= leafCount) {
-            index %= leafCount;
-        }
-        // eslint-disable-next-line no-warning-comments,max-len
-        // TODO Not practical at the moment. Improve pattern when implementing DB storage
-        for (let level = 0; level < height; level++) {
-            const key = index;
-            const isLeft = index % 2n === 0n;
-            const siblingKey = isLeft ? index + 1n : index - 1n;
-            // eslint-disable-next-line no-await-in-loop
-            const value = await this.parent.getNode(key, level);
-            const sibling = await this.parent.getNode(siblingKey, level);
-            if (level === 0) {
-                log.debug(`Preloaded ${key} @ ${level} -> ${value ?? "-"}`);
-            }
-            if (value !== undefined) {
-                this.setNode(key, level, value);
-            }
-            if (sibling !== undefined) {
-                this.setNode(siblingKey, level, sibling);
-            }
-            index /= 2n;
-        }
-    }
-    async mergeIntoParent() {
-        // In case no state got set we can skip this step
-        if (Object.keys(this.writeCache).length === 0) {
-            return;
-        }
-        this.parent.openTransaction();
-        const { height } = RollupMerkleTree;
-        const nodes = this.getWrittenNodes();
-        const promises = Array.from({ length: height }).flatMap((ignored, level) => Object.entries(nodes[level]).map(async (entry) => {
-            await this.parent.setNode(BigInt(entry[0]), level, entry[1]);
-        }));
-        await Promise.all(promises);
-        this.parent.commit();
-        this.resetWrittenNodes();
-    }
-}

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

@@ -1,26 +0,0 @@
-import { type MerkleTreeStore, type SyncMerkleTreeStore } from "./RollupMerkleTree.js";
-export declare class NoOpMerkleTreeStorage implements SyncMerkleTreeStore {
-    parent: MerkleTreeStore;
-    openTransaction(): void;
-    commit(): void;
-    getNode(): bigint | undefined;
-    setNode(): void;
-    virtualize(): MerkleTreeStore;
-    getNodeAsync(): Promise<bigint | undefined>;
-    setNodeAsync(): Promise<void>;
-}
-export declare class MemoryMerkleTreeStorage implements SyncMerkleTreeStore {
-    private readonly nodes;
-    private readonly cache;
-    parent: SyncMerkleTreeStore;
-    constructor(parent?: SyncMerkleTreeStore | undefined);
-    openTransaction(): void;
-    commit(): void;
-    getNode(key: bigint, level: number): bigint | undefined;
-    setNode(key: bigint, level: number, value: bigint): void;
-    virtualize(): MerkleTreeStore;
-    getNodeAsync(key: bigint, level: number): Promise<bigint | undefined>;
-    setNodeAsync(key: bigint, level: number, value: bigint): Promise<void>;
-    cacheFromParent(index: bigint): Promise<void>;
-}
-//# sourceMappingURL=MemoryMerkleTreeStorage.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"MemoryMerkleTreeStorage.d.ts","sourceRoot":"","sources":["../../../src/utils/merkletree/MemoryMerkleTreeStorage.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,KAAK,eAAe,EAEpB,KAAK,mBAAmB,EACzB,MAAM,uBAAuB,CAAC;AAE/B,qBAAa,qBAAsB,YAAW,mBAAmB;IACxD,MAAM,EAAE,eAAe,CAAQ;IAE/B,eAAe,IAAI,IAAI;IAIvB,MAAM,IAAI,IAAI;IAId,OAAO,IAAI,MAAM,GAAG,SAAS;IAI7B,OAAO,IAAI,IAAI;IAIf,UAAU,IAAI,eAAe;IAIvB,YAAY,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAI3C,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC;CAG3C;AAED,qBAAa,uBAAwB,YAAW,mBAAmB;IACjE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAGf;IAEP,OAAO,CAAC,QAAQ,CAAC,KAAK,CAGf;IAEA,MAAM,EAAE,mBAAmB,CAAC;gBAEhB,MAAM,GAAE,mBAAmB,GAAG,SAAqB;IAI/D,eAAe,IAAI,IAAI;IAIvB,MAAM,IAAI,IAAI;IAId,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAQvD,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAIxD,UAAU,IAAI,eAAe;IAIvB,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;IAKH,eAAe,CAAC,KAAK,EAAE,MAAM;CAoB3C"}

package/dist/utils/merkletree/MemoryMerkleTreeStorage.js

@@ -1,79 +0,0 @@
-/* eslint-disable @typescript-eslint/no-magic-numbers */
-import { noop } from "../utils";
-import { RollupMerkleTree, } from "./RollupMerkleTree.js";
-export class NoOpMerkleTreeStorage {
-    constructor() {
-        this.parent = this;
-    }
-    openTransaction() {
-        noop();
-    }
-    commit() {
-        noop();
-    }
-    getNode() {
-        return undefined;
-    }
-    setNode() {
-        noop();
-    }
-    virtualize() {
-        return this;
-    }
-    async getNodeAsync() {
-        return undefined;
-    }
-    async setNodeAsync() {
-        return undefined;
-    }
-}
-export class MemoryMerkleTreeStorage {
-    constructor(parent = undefined) {
-        this.nodes = {};
-        this.cache = {};
-        this.parent = parent ?? new NoOpMerkleTreeStorage();
-    }
-    openTransaction() {
-        noop();
-    }
-    commit() {
-        noop();
-    }
-    getNode(key, level) {
-        return (this.nodes[level]?.[key.toString()] ??
-            this.cache[level]?.[key.toString()] ??
-            this.parent.getNode(key, level));
-    }
-    setNode(key, level, value) {
-        var _a;
-        ((_a = this.nodes)[level] ?? (_a[level] = {}))[key.toString()] = value;
-    }
-    virtualize() {
-        return new MemoryMerkleTreeStorage(this);
-    }
-    async getNodeAsync(key, level) {
-        return this.getNode(key, level);
-    }
-    async setNodeAsync(key, level, value) {
-        this.setNode(key, level, value);
-        return undefined;
-    }
-    async cacheFromParent(index) {
-        var _a;
-        // Algo from RollupMerkleTree.getWitness()
-        const { leafCount, height } = RollupMerkleTree;
-        if (index >= leafCount) {
-            index %= leafCount;
-        }
-        for (let level = 0; level < height - 1; level++) {
-            const isLeft = index % 2n === 0n;
-            const key = isLeft ? index + 1n : index - 1n;
-            // eslint-disable-next-line no-await-in-loop
-            const value = await this.parent.getNodeAsync(key, level);
-            if (value !== undefined) {
-                ((_a = this.nodes)[level] ?? (_a[level] = {}))[key.toString()] = value;
-            }
-            index /= 2n;
-        }
-    }
-}

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

@@ -1,11 +0,0 @@
-export interface AsyncMerkleTreeStore {
-    openTransaction: () => void;
-    commit: () => void;
-    setNode: (key: bigint, level: number, value: bigint) => Promise<void>;
-    getNode: (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,OAAO,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IAEtE,OAAO,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;CACtE;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,130 +0,0 @@
-import { Bool, Field } from "snarkyjs";
-import { MerkleTreeStore } from "./MerkleTreeStore";
-export { RollupMerkleTree, RollupMerkleWitness };
-export { maybeSwap };
-declare const RollupMerkleWitness_base: (new (value: {
-    path: import("snarkyjs/dist/node/lib/field").Field[];
-    isLeft: Bool[];
-}) => {
-    path: import("snarkyjs/dist/node/lib/field").Field[];
-    isLeft: Bool[];
-}) & {
-    _isStruct: true;
-} & import("snarkyjs/dist/node/snarky").ProvablePure<{
-    path: import("snarkyjs/dist/node/lib/field").Field[];
-    isLeft: Bool[];
-}> & {
-    toInput: (x: {
-        path: import("snarkyjs/dist/node/lib/field").Field[];
-        isLeft: Bool[];
-    }) => {
-        fields?: import("snarkyjs/dist/node/lib/field").Field[] | undefined;
-        packed?: [import("snarkyjs/dist/node/lib/field").Field, number][] | undefined;
-    };
-    toJSON: (x: {
-        path: import("snarkyjs/dist/node/lib/field").Field[];
-        isLeft: Bool[];
-    }) => {
-        path: string[];
-        isLeft: boolean[];
-    };
-    fromJSON: (x: {
-        path: string[];
-        isLeft: boolean[];
-    }) => {
-        path: import("snarkyjs/dist/node/lib/field").Field[];
-        isLeft: 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;
-}
-/**
- * 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 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,EAAW,KAAK,EAAoB,MAAM,UAAU,CAAC;AAGlE,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;CAa/B;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;IAEI,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,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"}