@proto-kit/common 0.1.1-develop.187 → 0.1.1-develop.188

package/dist/src/utils/ProvableHashList.js

@@ -1,43 +0,0 @@
-import { Circuit, Field, Poseidon } from "snarkyjs";
-/**
- * Utilities for creating a hash list from a given value type.
- */
-export class ProvableHashList {
-  constructor(valueType, commitment = Field(0)) {
-    this.valueType = valueType;
-    this.commitment = commitment;
-  }
-  /**
-   * Converts the provided value to Field[] and appends it to
-   * the current hashlist.
-   *
-   * @param value - Value to be appended to the hash list
-   * @returns Current hash list.
-   */
-  push(value) {
-    this.commitment = this.hash([
-      this.commitment,
-      ...this.valueType.toFields(value),
-    ]);
-    return this;
-  }
-  remove(preimage, value) {
-    const success = this.hash([
-      preimage,
-      ...this.valueType.toFields(value),
-    ]).equals(this.commitment);
-    this.commitment = Circuit.if(success, preimage, this.commitment);
-    return success;
-  }
-  /**
-   * @returns Traling hash of the current hashlist.
-   */
-  toField() {
-    return this.commitment;
-  }
-}
-export class DefaultProvableHashList extends ProvableHashList {
-  hash(e) {
-    return Poseidon.hash(e);
-  }
-}

package/dist/utils/PrefixedHashList.d.ts

@@ -1,14 +0,0 @@
-import { Field, FlexibleProvablePure } from "snarkyjs";
-import { ProvableHashList } from "./ProvableHashList.js";
-export declare class PrefixedProvableHashList<
-  Value
-> extends ProvableHashList<Value> {
-  private readonly prefix;
-  constructor(
-    valueType: FlexibleProvablePure<Value>,
-    prefix: string,
-    internalCommitment?: Field
-  );
-  protected hash(elements: Field[]): Field;
-}
-//# sourceMappingURL=PrefixedHashList.d.ts.map

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/PrefixedProvableHashList.d.ts

@@ -1,8 +0,0 @@
-import { Field, FlexibleProvablePure } from "snarkyjs";
-import { ProvableHashList } from "./ProvableHashList.js";
-export declare class PrefixedProvableHashList<Value> extends ProvableHashList<Value> {
-    private readonly prefix;
-    constructor(valueType: FlexibleProvablePure<Value>, prefix: string, internalCommitment?: Field);
-    protected hash(elements: Field[]): Field;
-}
-//# sourceMappingURL=PrefixedProvableHashList.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"PrefixedProvableHashList.d.ts","sourceRoot":"","sources":["../../src/utils/PrefixedProvableHashList.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/PrefixedProvableHashList.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/ProvableHashList.d.ts

@@ -1,26 +0,0 @@
-import { Field, FlexibleProvablePure } from "snarkyjs";
-/**
- * Utilities for creating a hash list from a given value type.
- */
-export declare abstract class ProvableHashList<Value> {
-    private readonly valueType;
-    commitment: Field;
-    constructor(valueType: FlexibleProvablePure<Value>, commitment?: Field);
-    protected abstract hash(elements: Field[]): Field;
-    /**
-     * Converts the provided value to Field[] and appends it to
-     * the current hashlist.
-     *
-     * @param value - Value to be appended to the hash list
-     * @returns Current hash list.
-     */
-    push(value: Value): this;
-    /**
-     * @returns Traling hash of the current hashlist.
-     */
-    toField(): Field;
-}
-export declare class DefaultProvableHashList<Value> extends ProvableHashList<Value> {
-    hash(elements: Field[]): Field;
-}
-//# sourceMappingURL=ProvableHashList.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ProvableHashList.d.ts","sourceRoot":"","sources":["../../src/utils/ProvableHashList.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAY,oBAAoB,EAAE,MAAM,UAAU,CAAC;AAEjE;;GAEG;AACH,8BAAsB,gBAAgB,CAAC,KAAK;IAExC,OAAO,CAAC,QAAQ,CAAC,SAAS;IACnB,UAAU,EAAE,KAAK;gBADP,SAAS,EAAE,oBAAoB,CAAC,KAAK,CAAC,EAChD,UAAU,GAAE,KAAgB;IAGrC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,KAAK;IAEjD;;;;;;OAMG;IACI,IAAI,CAAC,KAAK,EAAE,KAAK;IAQxB;;OAEG;IACI,OAAO;CAGf;AAED,qBAAa,uBAAuB,CAAC,KAAK,CAAE,SAAQ,gBAAgB,CAAC,KAAK,CAAC;IAClE,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,KAAK;CAGtC"}

package/dist/utils/ProvableHashList.js

@@ -1,35 +0,0 @@
-import { Field, Poseidon } from "snarkyjs";
-/**
- * Utilities for creating a hash list from a given value type.
- */
-export class ProvableHashList {
-    constructor(valueType, commitment = Field(0)) {
-        this.valueType = valueType;
-        this.commitment = commitment;
-    }
-    /**
-     * Converts the provided value to Field[] and appends it to
-     * the current hashlist.
-     *
-     * @param value - Value to be appended to the hash list
-     * @returns Current hash list.
-     */
-    push(value) {
-        this.commitment = this.hash([
-            this.commitment,
-            ...this.valueType.toFields(value),
-        ]);
-        return this;
-    }
-    /**
-     * @returns Traling hash of the current hashlist.
-     */
-    toField() {
-        return this.commitment;
-    }
-}
-export class DefaultProvableHashList extends ProvableHashList {
-    hash(elements) {
-        return Poseidon.hash(elements);
-    }
-}

package/dist/utils/Utils.d.ts

@@ -1,22 +0,0 @@
-import { Field, Proof } from "snarkyjs";
-export type ReturnType<FunctionType extends Function> = FunctionType extends (...args: any[]) => infer Return ? Return : any;
-export type ClassType = new (...args: any[]) => any;
-export type TypedClassConstructor<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 interface ZkProgramType<PublicInputType> {
-    name: string;
-    compile: () => Promise<{
-        verificationKey: string;
-    }>;
-    verify: (proof: Proof<PublicInputType>) => Promise<boolean>;
-    digest: () => string;
-    publicInputType: TypedClassConstructor<PublicInputType>;
-}
-export declare function notInCircuit(): MethodDecorator;
-export declare function stringToField(value: string): Field;
-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":"AAKA,OAAO,EAAW,KAAK,EAAY,KAAK,EAAE,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,SAAS,GAAG,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC;AAEpD,MAAM,MAAM,qBAAqB,CAAC,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,KAAK,CAAC;AAEzE,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,MAAM,WAAW,aAAa,CAAC,eAAe;IAC5C,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,OAAO,CAAC;QAAE,eAAe,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACpD,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;IAC5D,MAAM,EAAE,MAAM,MAAM,CAAC;IAGrB,eAAe,EAAE,qBAAqB,CAAC,eAAe,CAAC,CAAC;CACzD;AAED,wBAAgB,YAAY,IAAI,eAAe,CAoB9C;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,SAwB1C;AAED,wBAAgB,IAAI,IAAI,IAAI,CAAG"}

package/dist/utils/Utils.js

@@ -1,41 +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 { TextEncoder } from "node:util";
-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) {
-    const fieldSize = Field.sizeInBytes();
-    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) {
-        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);
-}
-export function noop() { }

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/RollupMerkleTree.d.ts

@@ -1,143 +0,0 @@
-import { Bool, Field } from "snarkyjs";
-export { RollupMerkleTree, RollupMerkleWitness };
-export { maybeSwap };
-export interface Virtualizable<T> {
-    parent: T;
-    virtualize: () => T;
-}
-export interface MerkleTreeStore extends Virtualizable<MerkleTreeStore> {
-    openTransaction: () => void;
-    commit: () => void;
-    setNodeAsync: (key: bigint, level: number, value: bigint) => Promise<void>;
-    getNodeAsync: (key: bigint, level: number) => Promise<bigint | undefined>;
-}
-export interface SyncMerkleTreeStore extends MerkleTreeStore {
-    setNode: (key: bigint, level: number, value: bigint) => void;
-    getNode: (key: bigint, level: number) => bigint | undefined;
-}
-declare const RollupMerkleWitness_base: (new (value: {
-    path: Field[];
-    isLeft: Bool[];
-}) => {
-    path: Field[];
-    isLeft: Bool[];
-}) & {
-    _isStruct: true;
-} & import("snarkyjs/dist/node/snarky").ProvablePure<{
-    path: Field[];
-    isLeft: Bool[];
-}> & {
-    toInput: (x: {
-        path: Field[];
-        isLeft: Bool[];
-    }) => {
-        fields?: Field[] | undefined;
-        packed?: [Field, number][] | undefined;
-    };
-    toJSON: (x: {
-        path: Field[];
-        isLeft: Bool[];
-    }) => {
-        path: string[];
-        isLeft: boolean[];
-    };
-    fromJSON: (x: {
-        path: string[];
-        isLeft: boolean[];
-    }) => {
-        path: 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: SyncMerkleTreeStore;
-    constructor(store: SyncMerkleTreeStore);
-    /**
-     * 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;AAMlE,OAAO,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,CAAC;AAIjD,OAAO,EAAE,SAAS,EAAE,CAAC;AAGrB,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,MAAM,EAAE,CAAC,CAAC;IAEV,UAAU,EAAE,MAAM,CAAC,CAAC;CACrB;AAED,MAAM,WAAW,eAAgB,SAAQ,aAAa,CAAC,eAAe,CAAC;IACrE,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,mBAAoB,SAAQ,eAAe;IAC1D,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;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAED;;;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,mBAAmB,CAAC;gBAExB,KAAK,EAAE,mBAAmB;IAY7C;;;;;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;IAkBzC;;;;;;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"}