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

package/dist/trees/sparse/RollupMerkleTree.js

@@ -0,0 +1,330 @@
+import { Bool, Field, Poseidon, Provable, Struct } from "o1js";
+import uniqBy from "lodash/uniqBy";
+import { range } from "../../utils";
+import { InMemoryMerkleTreeStorage } from "./InMemoryMerkleTreeStorage";
+/**
+ * More efficient version of `maybeSwapBad` which
+ * reuses an intermediate variable
+ */
+export 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];
+}
+export 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;
+    function generateZeroes() {
+        const zeroes = [0n];
+        for (let index = 1; index < height; index += 1) {
+            const previousLevel = Field(zeroes[index - 1]);
+            zeroes.push(Poseidon.hash([previousLevel, previousLevel]).toBigInt());
+        }
+        return zeroes;
+    }
+    let zeroCache = undefined;
+    function getZeroes() {
+        if (zeroCache === undefined) {
+            zeroCache = generateZeroes();
+        }
+        return zeroCache;
+    }
+    /**
+     * The {@link RollupMerkleWitness} 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];
+                const [left, right] = maybeSwap(isLeft, hash, this.path[index - 1]);
+                hash = Poseidon.hash([left, right]);
+            }
+            return hash;
+        }
+        calculateRootIncrement(leafIndex, leaf) {
+            const root = this.calculateRoot(leaf);
+            const newWitness = Provable.witness(RollupMerkleWitness, () => {
+                const zero = getZeroes();
+                if (zero.length === 0) {
+                    throw new Error("Zeroes not initialized");
+                }
+                const zeroes = zero.map((x) => Field(x));
+                let hash = leaf;
+                const n = this.height();
+                let notDiverged = true;
+                const newPath = leafIndex.add(1).toBits();
+                newPath.push(Bool(false));
+                const newSiblings = [];
+                const newIsLefts = [];
+                for (let index = 0; index < n - 1; ++index) {
+                    const isLeft = this.isLeft[index];
+                    const sibling = this.path[index];
+                    const newIsLeft = newPath[index].not();
+                    // Bool(true) default for root level
+                    let convergesNextLevel = true;
+                    if (index < n - 2) {
+                        convergesNextLevel = newPath[index + 1]
+                            .equals(this.isLeft[index + 1])
+                            .not()
+                            .toBoolean();
+                    }
+                    const nextSibling = 
+                    // eslint-disable-next-line no-nested-ternary
+                    convergesNextLevel && notDiverged
+                        ? hash
+                        : notDiverged
+                            ? zeroes[index]
+                            : sibling;
+                    notDiverged = notDiverged && !convergesNextLevel;
+                    newSiblings.push(nextSibling);
+                    newIsLefts.push(newIsLeft);
+                    const [left, right] = maybeSwap(isLeft, hash, sibling);
+                    hash = Poseidon.hash([left, right]);
+                }
+                return new RollupMerkleWitness({
+                    isLeft: newIsLefts,
+                    path: newSiblings,
+                });
+            });
+            newWitness.calculateIndex().assertEquals(leafIndex.add(1));
+            return [root, newWitness];
+        }
+        /**
+         * 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);
+        }
+        checkMembershipSimple(root, value) {
+            const calculatedRoot = this.calculateRoot(value);
+            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(this.height - 1).fill(Bool(true)),
+                path: Array(this.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 = generateZeroes();
+            }
+            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]));
+                }
+            }
+            setLeaves(updates) {
+                updates.forEach(({ index }) => this.assertIndexRange(index));
+                const changes = [];
+                // We have to reverse here, because uniqBy only takes the first occurrence of every entry,
+                // but we need the last one (since that semantically overwrites the previous one,
+                // so we can ignore it)
+                let levelChanges = uniqBy(updates.reverse(), "index")
+                    // we can assume no index is in this list twice, so we don't care about the 0 case
+                    // This is in reverse order, so its a queue
+                    .sort((a, b) => (a.index < b.index ? 1 : -1));
+                changes.push(...levelChanges
+                    .map(({ leaf, index }) => ({
+                    level: 0,
+                    index,
+                    value: leaf,
+                }))
+                    .reverse());
+                for (let level = 1; level < AbstractRollupMerkleTree.HEIGHT; level += 1) {
+                    const nextLevelChanges = [];
+                    while (levelChanges.length > 0) {
+                        const node = levelChanges.pop();
+                        let newNode;
+                        if (node.index % 2n === 0n) {
+                            let sibling;
+                            const potentialSibling = levelChanges.at(-1);
+                            if (potentialSibling !== undefined &&
+                                potentialSibling.index === node.index + 1n) {
+                                sibling = potentialSibling.leaf;
+                                levelChanges.pop();
+                            }
+                            else {
+                                sibling = Field(this.getNode(level - 1, node.index + 1n));
+                            }
+                            newNode = Poseidon.hash([node.leaf, sibling]);
+                        }
+                        else {
+                            const sibling = Field(this.getNode(level - 1, node.index - 1n));
+                            newNode = Poseidon.hash([sibling, node.leaf]);
+                        }
+                        const nextLevelIndex = node.index / 2n;
+                        changes.push({ level, index: nextLevelIndex, value: newNode });
+                        nextLevelChanges.push({ index: nextLevelIndex, leaf: newNode });
+                    }
+                    levelChanges = nextLevelChanges.reverse();
+                }
+                changes.forEach(({ level, index, value }) => {
+                    this.setNode(level, index, value);
+                });
+            }
+            /**
+             * 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 {
+}
+//# sourceMappingURL=RollupMerkleTree.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"RollupMerkleTree.js","sourceRoot":"","sources":["../../../src/trees/sparse/RollupMerkleTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC/D,OAAO,MAAM,MAAM,eAAe,CAAC;AAEnC,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAIpC,OAAO,EAAE,yBAAyB,EAAE,MAAM,6BAA6B,CAAC;AAExE;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,CAAO,EAAE,CAAQ,EAAE,CAAQ;IACnD,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;AAED,MAAM,OAAO,cAAe,SAAQ,MAAM,CAAC;IACzC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAC9B,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;CAChC,CAAC;CAAG;AA8FL;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc;;IAC7C,SAAS,cAAc;QACrB,MAAM,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;QACpB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE;YAC9C,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;SACvE;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI,SAAS,GAAyB,SAAS,CAAC;IAEhD,SAAS,SAAS;QAChB,IAAI,SAAS,KAAK,SAAS,EAAE;YAC3B,SAAS,GAAG,cAAc,EAAE,CAAC;SAC9B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;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;gBAEtC,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;QAEM,sBAAsB,CAC3B,SAAgB,EAChB,IAAW;YAEX,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YAEtC,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,mBAAmB,EAAE,GAAG,EAAE;gBAC5D,MAAM,IAAI,GAAG,SAAS,EAAE,CAAC;gBAEzB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;oBACrB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;iBAC3C;gBACD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAEzC,IAAI,IAAI,GAAG,IAAI,CAAC;gBAChB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBAExB,IAAI,WAAW,GAAG,IAAI,CAAC;gBACvB,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC1C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAE1B,MAAM,WAAW,GAAY,EAAE,CAAC;gBAChC,MAAM,UAAU,GAAW,EAAE,CAAC;gBAE9B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE;oBAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBAClC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAEjC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;oBAEvC,oCAAoC;oBACpC,IAAI,kBAAkB,GAAG,IAAI,CAAC;oBAC9B,IAAI,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE;wBACjB,kBAAkB,GAAG,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;6BACpC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;6BAC9B,GAAG,EAAE;6BACL,SAAS,EAAE,CAAC;qBAChB;oBAED,MAAM,WAAW;oBACf,6CAA6C;oBAC7C,kBAAkB,IAAI,WAAW;wBAC/B,CAAC,CAAC,IAAI;wBACN,CAAC,CAAC,WAAW;4BACX,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;4BACf,CAAC,CAAC,OAAO,CAAC;oBAEhB,WAAW,GAAG,WAAW,IAAI,CAAC,kBAAkB,CAAC;oBAEjD,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;oBAC9B,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAE3B,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;oBACvD,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;iBACrC;gBAED,OAAO,IAAI,mBAAmB,CAAC;oBAC7B,MAAM,EAAE,UAAU;oBAClB,IAAI,EAAE,WAAW;iBAClB,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;YAEH,UAAU,CAAC,cAAc,EAAE,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAE3D,OAAO,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAC5B,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,qBAAqB,CAAC,IAAW,EAAE,KAAY;YACpD,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACjD,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,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrD,IAAI,EAAE,KAAK,CAAQ,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;aACnD,CAAC,CAAC;QACL,CAAC;;IAtJa,0BAAM,GAAG,MAAM,CAAC;IAyJhC,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;YACjC,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;YAEM,SAAS,CAAC,OAAyC;gBACxD,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;gBAG7D,MAAM,OAAO,GAAa,EAAE,CAAC;gBAE7B,0FAA0F;gBAC1F,iFAAiF;gBACjF,uBAAuB;gBACvB,IAAI,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC;oBACnD,kFAAkF;oBAClF,2CAA2C;qBAC1C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAEhD,OAAO,CAAC,IAAI,CACV,GAAG,YAAY;qBACZ,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;oBACzB,KAAK,EAAE,CAAC;oBACR,KAAK;oBACL,KAAK,EAAE,IAAI;iBACZ,CAAC,CAAC;qBACF,OAAO,EAAE,CACb,CAAC;gBAEF,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,wBAAwB,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE;oBACvE,MAAM,gBAAgB,GAAwB,EAAE,CAAC;oBACjD,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;wBAC9B,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,EAAG,CAAC;wBAEjC,IAAI,OAAO,CAAC;wBACZ,IAAI,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,EAAE,EAAE;4BAC1B,IAAI,OAAO,CAAC;4BACZ,MAAM,gBAAgB,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;4BAC7C,IACE,gBAAgB,KAAK,SAAS;gCAC9B,gBAAgB,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG,EAAE,EAC1C;gCACA,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC;gCAChC,YAAY,CAAC,GAAG,EAAE,CAAC;6BACpB;iCAAM;gCACL,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;6BAC3D;4BACD,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;yBAC/C;6BAAM;4BACL,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;4BAChE,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;yBAC/C;wBAED,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;wBACvC,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;wBAC/D,gBAAgB,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;qBACjE;oBAED,YAAY,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC;iBAC3C;gBAED,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE;oBAC1C,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACpC,CAAC,CAAC,CAAC;YACL,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;QA3Le,SAAM,GAAG,MAAO;QAEhB,aAAU,GAAG,IAAI,EAAwB,CACrD,IAAI,yBAAyB,EAAE,CAChC;aACE,OAAO,EAAE;aACT,QAAQ,EAAG;QAMA,UAAO,GAAG,mBAAoB;WA+K5C;AACJ,CAAC;AAED,MAAM,OAAO,gBAAiB,SAAQ,gBAAgB,CAAC,GAAG,CAAC;CAAG;AAC9D,MAAM,OAAO,uBAAwB,SAAQ,gBAAgB,CAAC,OAAO;CAAG"}

package/dist/types.d.ts

@@ -1,4 +1,6 @@
+import { DynamicProof, Proof, ProofBase, PublicKey, Option } from "o1js";
 export type TypedClass<Class> = new (...args: any[]) => Class;
+export type UnTypedClass = new (...args: any[]) => unknown;
 /**
  * Using simple `keyof Target` would result into the key
  * being `string | number | symbol`, but we want just a `string`
@@ -8,4 +10,64 @@ export type StringKeyOf<Target extends object> = Extract<keyof Target, string> &
  * Utility type to infer element type from an array type
  */
 export type ArrayElement<ArrayType extends readonly unknown[]> = ArrayType extends readonly (infer ElementType)[] ? ElementType : never;
+/**
+ * Transforms X | Y => X & Y
+ */
+export type UnionToIntersection<Union> = (Union extends any ? (x: Union) => void : never) extends (x: infer Intersection) => void ? Intersection : never;
+export type MergeObjects<Input extends Record<string, unknown>> = UnionToIntersection<Input[keyof Input]>;
+export type OmitKeys<Record, Keys> = {
+    [Key in keyof Record as Key extends Keys ? never : Key]: Record[Key];
+};
+export declare const EMPTY_PUBLICKEY_X: import("o1js/dist/node/lib/provable/field").Field;
+export declare const EMPTY_PUBLICKEY: PublicKey;
+export type OverwriteObjectType<Base, New> = {
+    [Key in keyof Base]: Key extends keyof New ? New[Key] : Base[Key];
+} & New;
+export type InferProofBase<ProofType extends Proof<any, any> | DynamicProof<any, any>> = ProofType extends Proof<infer PI, infer PO> ? ProofBase<PI, PO> : ProofType extends DynamicProof<infer PI, infer PO> ? ProofBase<PI, PO> : undefined;
+declare const O1PublicKeyOption_base: Omit<import("o1js/dist/node/lib/provable/types/provable-intf").Provable<Option<PublicKey, {
+    x: bigint;
+    isOdd: boolean;
+}>, {
+    x: bigint;
+    isOdd: boolean;
+} | undefined>, "fromFields"> & {
+    fromFields: (fields: import("o1js/dist/node/lib/provable/field").Field[]) => Option<PublicKey, {
+        x: bigint;
+        isOdd: boolean;
+    }>;
+} & (new (option: {
+    isSome: import("o1js/dist/node/lib/provable/bool").Bool;
+    value: PublicKey;
+}) => Option<PublicKey, {
+    x: bigint;
+    isOdd: boolean;
+}>) & {
+    fromValue(value: PublicKey | {
+        x: bigint;
+        isOdd: boolean;
+    } | {
+        isSome: boolean | import("o1js/dist/node/lib/provable/bool").Bool;
+        value: PublicKey | {
+            x: bigint;
+            isOdd: boolean;
+        };
+    } | undefined): Option<PublicKey, {
+        x: bigint;
+        isOdd: boolean;
+    }>;
+    from(value?: PublicKey | {
+        x: bigint;
+        isOdd: boolean;
+    } | undefined): Option<PublicKey, {
+        x: bigint;
+        isOdd: boolean;
+    }>;
+    none(): Option<PublicKey, {
+        x: bigint;
+        isOdd: boolean;
+    }>;
+};
+export declare class O1PublicKeyOption extends O1PublicKeyOption_base {
+}
+export {};
 //# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AACA,MAAM,MAAM,UAAU,CAAC,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,KAAK,CAAC;AAE9D;;;GAGG;AACH,MAAM,MAAM,WAAW,CAAC,MAAM,SAAS,MAAM,IAAI,OAAO,CAAC,MAAM,MAAM,EAAE,MAAM,CAAC,GAC5E,MAAM,CAAC;AAGT;;GAEG;AACH,MAAM,MAAM,YAAY,CAAC,SAAS,SAAS,SAAS,OAAO,EAAE,IAE3D,SAAS,SAAS,SAAS,CAAC,MAAM,WAAW,CAAC,EAAE,GAAG,WAAW,GAAG,KAAK,CAAC"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AACA,OAAO,EAEL,YAAY,EAEZ,KAAK,EACL,SAAS,EACT,SAAS,EACT,MAAM,EACP,MAAM,MAAM,CAAC;AAEd,MAAM,MAAM,UAAU,CAAC,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,KAAK,CAAC;AAE9D,MAAM,MAAM,YAAY,GAAG,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,OAAO,CAAC;AAE3D;;;GAGG;AACH,MAAM,MAAM,WAAW,CAAC,MAAM,SAAS,MAAM,IAAI,OAAO,CAAC,MAAM,MAAM,EAAE,MAAM,CAAC,GAC5E,MAAM,CAAC;AAET;;GAEG;AACH,MAAM,MAAM,YAAY,CAAC,SAAS,SAAS,SAAS,OAAO,EAAE,IAC3D,SAAS,SAAS,SAAS,CAAC,MAAM,WAAW,CAAC,EAAE,GAAG,WAAW,GAAG,KAAK,CAAC;AAEzE;;GAEG;AACH,MAAM,MAAM,mBAAmB,CAAC,KAAK,IAAI,CACvC,KAAK,SAAS,GAAG,GAAG,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,GAAG,KAAK,CAC/C,SAAS,CAAC,CAAC,EAAE,MAAM,YAAY,KAAK,IAAI,GACrC,YAAY,GACZ,KAAK,CAAC;AAEV,MAAM,MAAM,YAAY,CAAC,KAAK,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAC5D,mBAAmB,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;AAE1C,MAAM,MAAM,QAAQ,CAAC,MAAM,EAAE,IAAI,IAAI;KAClC,GAAG,IAAI,MAAM,MAAM,IAAI,GAAG,SAAS,IAAI,GAAG,KAAK,GAAG,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;CACrE,CAAC;AAMF,eAAO,MAAM,iBAAiB,mDAAc,CAAC;AAC7C,eAAO,MAAM,eAAe,WAG1B,CAAC;AAEH,MAAM,MAAM,mBAAmB,CAAC,IAAI,EAAE,GAAG,IAAI;KAC1C,GAAG,IAAI,MAAM,IAAI,GAAG,GAAG,SAAS,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;CAClE,GAAG,GAAG,CAAC;AAER,MAAM,MAAM,cAAc,CACxB,SAAS,SAAS,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,IAE1D,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,GACvC,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,GACjB,SAAS,SAAS,YAAY,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,GAChD,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,GACjB,SAAS,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAElB,qBAAa,iBAAkB,SAAQ,sBAAiB;CAAG"}

package/dist/types.js

@@ -1 +1,14 @@
-export {};
+// allows to reference interfaces as 'classes' rather than instances
+import { Bool, Field, PublicKey, Option, } from "o1js";
+// Because Publickey.empty() is not usable in combination with real
+// cryptographic  operations because it's group evaluation isn't defined in Fp,
+// we use some other arbitrary point which we treat as "empty" in our circuits
+// other arbitrary point
+export const EMPTY_PUBLICKEY_X = Field(4600);
+export const EMPTY_PUBLICKEY = PublicKey.fromObject({
+    x: EMPTY_PUBLICKEY_X,
+    isOdd: Bool(true),
+});
+export class O1PublicKeyOption extends Option(PublicKey) {
+}
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,oEAAoE;AACpE,OAAO,EACL,IAAI,EAEJ,KAAK,EAGL,SAAS,EACT,MAAM,GACP,MAAM,MAAM,CAAC;AAmCd,mEAAmE;AACnE,+EAA+E;AAC/E,8EAA8E;AAC9E,wBAAwB;AACxB,MAAM,CAAC,MAAM,iBAAiB,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;AAC7C,MAAM,CAAC,MAAM,eAAe,GAAG,SAAS,CAAC,UAAU,CAAC;IAClD,CAAC,EAAE,iBAAiB;IACpB,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC;CAClB,CAAC,CAAC;AAeH,MAAM,OAAO,iBAAkB,SAAQ,MAAM,CAAC,SAAS,CAAC;CAAG"}

package/dist/union/union.d.ts

@@ -0,0 +1,177 @@
+import { Provable, InferProvable } from "o1js";
+export declare function createQualifiedUnion<T extends (Provable<any> & {
+    name: string;
+})[]>(provables: T): {
+    new (value: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }): {
+        into<Type extends T[number]>(provable: Type): InferProvable<Type>;
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    };
+    from<Type_1 extends T[number]>(provable: Type_1, value: InferProvable<Type_1>): {
+        into<Type extends T[number]>(provable: Type): InferProvable<Type>;
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    };
+    _isStruct: true;
+    toFields: (value: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) => import("o1js/dist/node/lib/provable/field").Field[];
+    toAuxiliary: (value?: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    } | undefined) => any[];
+    sizeInFields: () => number;
+    check: (value: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) => void;
+    toValue: (x: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) => {
+        array: bigint[];
+        type: bigint;
+    };
+    fromValue: ((x: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    } | {
+        array: bigint[];
+        type: bigint;
+    }) => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) & ((value: {
+        array: import("o1js/dist/node/lib/provable/field").Field[] | bigint[];
+        type: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+    }) => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    });
+    toCanonical?: ((x: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) | undefined;
+    fromFields: (fields: import("o1js/dist/node/lib/provable/field").Field[]) => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    };
+    toInput: (x: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: 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: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) => {
+        array: string[];
+        type: string;
+    };
+    fromJSON: (x: {
+        array: string[];
+        type: string;
+    }) => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    };
+    empty: () => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    };
+};
+export type QualifiedUnionType<T extends (Provable<any> & {
+    name: string;
+})[]> = ReturnType<typeof createQualifiedUnion<T>>;
+export declare function createUnknownLengthUnion(length: number): {
+    new (value: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }): {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    };
+    _isStruct: true;
+    toFields: (value: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) => import("o1js/dist/node/lib/provable/field").Field[];
+    toAuxiliary: (value?: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    } | undefined) => any[];
+    sizeInFields: () => number;
+    check: (value: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) => void;
+    toValue: (x: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) => {
+        array: bigint[];
+        type: bigint;
+    };
+    fromValue: ((x: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    } | {
+        array: bigint[];
+        type: bigint;
+    }) => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) & ((value: {
+        array: import("o1js/dist/node/lib/provable/field").Field[] | bigint[];
+        type: string | number | bigint | import("o1js/dist/node/lib/provable/field").Field;
+    }) => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    });
+    toCanonical?: ((x: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) | undefined;
+    fromFields: (fields: import("o1js/dist/node/lib/provable/field").Field[]) => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    };
+    toInput: (x: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: 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: {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    }) => {
+        array: string[];
+        type: string;
+    };
+    fromJSON: (x: {
+        array: string[];
+        type: string;
+    }) => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    };
+    empty: () => {
+        array: import("o1js/dist/node/lib/provable/field").Field[];
+        type: import("o1js/dist/node/lib/provable/field").Field;
+    };
+};
+//# sourceMappingURL=union.d.ts.map

package/dist/union/union.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"union.d.ts","sourceRoot":"","sources":["../../src/union/union.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAiB,aAAa,EAAiB,MAAM,MAAM,CAAC;AAI7E,wBAAgB,oBAAoB,CAClC,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,EAAE,EAC9C,SAAS,EAAE,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAsCb;AAED,MAAM,MAAM,kBAAkB,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,EAAE,IAC3E,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;AAE7C,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,MAAM;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAKtD"}

package/dist/union/union.js

@@ -0,0 +1,35 @@
+import { Provable, Struct, Field } from "o1js";
+import { padArray } from "../utils";
+export function createQualifiedUnion(provables) {
+    const maxLength = Math.max(...provables.map((provable) => provable.sizeInFields()));
+    const typeMap = Object.fromEntries(provables.map(({ name }, index) => [name, index]));
+    class ProvableUnion extends Struct({
+        array: Provable.Array(Field, maxLength),
+        type: Field,
+    }) {
+        static from(provable, value) {
+            const fields = provable.toFields(value);
+            const fullFields = padArray(fields, maxLength, () => Field(0));
+            return new ProvableUnion({
+                array: fullFields,
+                type: Field(typeMap[provable.name]),
+            });
+        }
+        into(provable) {
+            const size = provable.sizeInFields();
+            const fields = this.array.slice(0, size);
+            this.array.slice(size).forEach((field) => field.assertEquals(0));
+            this.type.assertEquals(typeMap[provable.name]);
+            return provable.fromFields(fields, []);
+        }
+    }
+    return ProvableUnion;
+}
+export function createUnknownLengthUnion(length) {
+    return class UnknownLengthUnion extends Struct({
+        array: Provable.Array(Field, length),
+        type: Field,
+    }) {
+    };
+}
+//# sourceMappingURL=union.js.map