@freedomofpress/ics23 0.1.0

package/Readme.md

@@ -0,0 +1,3 @@
+Forked from the deprecated www.npmjs.com/package/@confio/ics23 commit b04a0987049611c8d564672d0b74b9f4bc036de6
+
+Modified to support webcat proofs, otherwise not maintained to be in sync with the cosmos spec. Usage discouraged.

package/dist/compress.d.ts

@@ -0,0 +1,3 @@
+import { CommitmentProof } from "./proto/cosmos/ics23/v1/proofs";
+export declare function compress(proof: CommitmentProof): CommitmentProof;
+export declare function decompress(proof: CommitmentProof): CommitmentProof;

package/dist/compress.js

@@ -0,0 +1,96 @@
+import { InnerOp, } from "./proto/cosmos/ics23/v1/proofs";
+export function compress(proof) {
+    if (!proof.batch) {
+        return proof;
+    }
+    return { compressed: compressBatch(proof.batch) };
+}
+export function decompress(proof) {
+    if (!proof.compressed) {
+        return proof;
+    }
+    return { batch: decompressBatch(proof.compressed) };
+}
+function compressBatch(proof) {
+    const centries = [];
+    const lookup = [];
+    const registry = new Map();
+    for (const entry of proof.entries) {
+        if (entry.exist) {
+            const centry = { exist: compressExist(entry.exist, lookup, registry) };
+            centries.push(centry);
+        }
+        else if (entry.nonexist) {
+            const non = entry.nonexist;
+            const centry = {
+                nonexist: {
+                    key: non.key,
+                    left: compressExist(non.left, lookup, registry),
+                    right: compressExist(non.right, lookup, registry),
+                },
+            };
+            centries.push(centry);
+        }
+        else {
+            throw new Error("Unexpected batch entry during compress");
+        }
+    }
+    return {
+        entries: centries,
+        lookupInners: lookup,
+    };
+}
+function compressExist(exist, lookup, registry) {
+    if (!exist) {
+        return undefined;
+    }
+    const path = exist.path.map((inner) => {
+        const sig = InnerOp.encode(inner).finish();
+        let idx = registry.get(sig);
+        if (idx === undefined) {
+            idx = lookup.length;
+            lookup.push(inner);
+            registry.set(sig, idx);
+        }
+        return idx;
+    });
+    return {
+        key: exist.key,
+        value: exist.value,
+        leaf: exist.leaf,
+        path,
+    };
+}
+function decompressBatch(proof) {
+    const lookup = proof.lookupInners;
+    const entries = proof.entries.map((comp) => {
+        if (comp.exist) {
+            return { exist: decompressExist(comp.exist, lookup) };
+        }
+        else if (comp.nonexist) {
+            const non = comp.nonexist;
+            return {
+                nonexist: {
+                    key: non.key,
+                    left: decompressExist(non.left, lookup),
+                    right: decompressExist(non.right, lookup),
+                },
+            };
+        }
+        else {
+            throw new Error("Unexpected batch entry during compress");
+        }
+    });
+    return {
+        entries,
+    };
+}
+function decompressExist(exist, lookup) {
+    if (!exist) {
+        return undefined;
+    }
+    const { key, value, leaf, path } = exist;
+    const newPath = (path || []).map((idx) => lookup[idx]);
+    return { key, value, leaf, path: newPath };
+}
+//# sourceMappingURL=compress.js.map

package/dist/compress.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compress.js","sourceRoot":"","sources":["../src/compress.ts"],"names":[],"mappings":"AAAA,OAAO,EAOL,OAAO,GACR,MAAM,gCAAgC,CAAC;AAExC,MAAM,UAAU,QAAQ,CAAC,KAAsB;IAC7C,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;AACpD,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAsB;IAC/C,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;AACtD,CAAC;AAED,SAAS,aAAa,CAAC,KAAiB;IACtC,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;IAE/C,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAQ,EAAE,CAAC;QACnC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;YACvE,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC3B,MAAM,MAAM,GAAG;gBACb,QAAQ,EAAE;oBACR,GAAG,EAAE,GAAG,CAAC,GAAG;oBACZ,IAAI,EAAE,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC;oBAC/C,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC;iBAClD;aACF,CAAC;YACF,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO,EAAE,QAAQ;QACjB,YAAY,EAAE,MAAM;KACrB,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CACpB,KAAwC,EACxC,MAAiB,EACjB,QAAiC;IAEjC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,IAAI,GAAG,KAAK,CAAC,IAAK,CAAC,GAAG,CAAC,CAAC,KAAc,EAAE,EAAE;QAC9C,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC3C,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,GAAG,EAAE,KAAK,CAAC,GAAG;QACd,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,IAAI;KACL,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,KAA2B;IAClD,MAAM,MAAM,GAAG,KAAK,CAAC,YAAa,CAAC;IACnC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAQ,CAAC,GAAG,CAAC,CAAC,IAA0B,EAAE,EAAE;QAChE,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,OAAO,EAAE,KAAK,EAAE,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;QACxD,CAAC;aAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC1B,OAAO;gBACL,QAAQ,EAAE;oBACR,GAAG,EAAE,GAAG,CAAC,GAAG;oBACZ,IAAI,EAAE,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC;oBACvC,KAAK,EAAE,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC;iBAC1C;aACF,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO;QACL,OAAO;KACR,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CACtB,KAAkD,EAClD,MAA0B;IAE1B,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;IACzC,MAAM,OAAO,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAW,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/D,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC7C,CAAC"}

package/dist/ics23.d.ts

@@ -0,0 +1,18 @@
+import { CommitmentRoot } from "./proofs";
+import { CommitmentProof, ProofSpec } from "./proto/cosmos/ics23/v1/proofs";
+/**
+ * verifyMembership ensures proof is (contains) a valid existence proof for the given
+ */
+export declare function verifyMembership(proof: CommitmentProof, spec: ProofSpec, root: CommitmentRoot, key: Uint8Array, value: Uint8Array): Promise<boolean>;
+/**
+ * verifyNonMembership ensures proof is (contains) a valid non-existence proof for the given key
+ */
+export declare function verifyNonMembership(proof: CommitmentProof, spec: ProofSpec, root: CommitmentRoot, key: Uint8Array): Promise<boolean>;
+/**
+ * batchVerifyMembership ensures proof is (contains) a valid existence proof for the given
+ */
+export declare function batchVerifyMembership(proof: CommitmentProof, spec: ProofSpec, root: CommitmentRoot, items: Map<Uint8Array, Uint8Array>): Promise<boolean>;
+/**
+ * batchVerifyNonMembership ensures proof is (contains) a valid existence proof for the given
+ */
+export declare function batchVerifyNonMembership(proof: CommitmentProof, spec: ProofSpec, root: CommitmentRoot, keys: readonly Uint8Array[]): Promise<boolean>;

package/dist/ics23.js

@@ -0,0 +1,118 @@
+import { decompress } from "./compress";
+import { verifyExistence, verifyNonExistence } from "./proofs";
+import { keyForComparison } from "./proofs";
+import { bytesBefore, bytesEqual } from "./specs";
+/*
+This implements the client side functions as specified in
+https://github.com/cosmos/ics/tree/master/spec/ics-023-vector-commitments
+
+In particular:
+
+  // Assumes ExistenceProof
+  type verifyMembership = (root: CommitmentRoot, proof: CommitmentProof, key: Key, value: Value) => boolean
+
+  // Assumes NonExistenceProof
+  type verifyNonMembership = (root: CommitmentRoot, proof: CommitmentProof, key: Key) => boolean
+
+  // Assumes BatchProof - required ExistenceProofs may be a subset of all items proven
+  type batchVerifyMembership = (root: CommitmentRoot, proof: CommitmentProof, items: Map<Key, Value>) => boolean
+
+  // Assumes BatchProof - required NonExistenceProofs may be a subset of all items proven
+  type batchVerifyNonMembership = (root: CommitmentRoot, proof: CommitmentProof, keys: Set<Key>) => boolean
+
+We make an adjustment to accept a Spec to ensure the provided proof is in the format of the expected merkle store.
+This can avoid an range of attacks on fake preimages, as we need to be careful on how to map key, value -> leaf
+and determine neighbors
+*/
+/**
+ * verifyMembership ensures proof is (contains) a valid existence proof for the given
+ */
+export async function verifyMembership(proof, spec, root, key, value) {
+    const norm = decompress(proof);
+    const exist = getExistForKey(norm, key);
+    if (!exist) {
+        return false;
+    }
+    try {
+        await verifyExistence(exist, spec, root, key, value);
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * verifyNonMembership ensures proof is (contains) a valid non-existence proof for the given key
+ */
+export async function verifyNonMembership(proof, spec, root, key) {
+    const norm = decompress(proof);
+    const nonexist = await getNonExistForKey(spec, norm, key);
+    if (!nonexist) {
+        return false;
+    }
+    try {
+        await verifyNonExistence(nonexist, spec, root, key);
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * batchVerifyMembership ensures proof is (contains) a valid existence proof for the given
+ */
+export async function batchVerifyMembership(proof, spec, root, items) {
+    const norm = decompress(proof);
+    for (const [key, value] of items.entries()) {
+        if (!(await verifyMembership(norm, spec, root, key, value))) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * batchVerifyNonMembership ensures proof is (contains) a valid existence proof for the given
+ */
+export async function batchVerifyNonMembership(proof, spec, root, keys) {
+    const norm = decompress(proof);
+    for (const key of keys) {
+        if (!(await verifyNonMembership(norm, spec, root, key))) {
+            return false;
+        }
+    }
+    return true;
+}
+function getExistForKey(proof, key) {
+    const match = (p) => !!p && bytesEqual(key, p.key);
+    if (match(proof.exist)) {
+        return proof.exist;
+    }
+    else if (proof.batch) {
+        return proof.batch
+            .entries.map((x) => x.exist || null)
+            .find(match);
+    }
+    return undefined;
+}
+async function getNonExistForKey(spec, proof, key) {
+    const match = async (p) => {
+        return (!!p &&
+            (!p.left ||
+                bytesBefore(await keyForComparison(spec, p.left.key), await keyForComparison(spec, key))) &&
+            (!p.right ||
+                bytesBefore(await keyForComparison(spec, key), await keyForComparison(spec, p.right.key))));
+    };
+    if (await match(proof.nonexist)) {
+        return proof.nonexist;
+    }
+    else if (proof.batch) {
+        for (const entry of proof.batch.entries || []) {
+            const candidate = entry.nonexist || null;
+            if (await match(candidate)) {
+                return candidate;
+            }
+        }
+    }
+    return undefined;
+}
+//# sourceMappingURL=ics23.js.map

package/dist/ics23.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ics23.js","sourceRoot":"","sources":["../src/ics23.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,EAAkB,eAAe,EAAE,kBAAkB,EAAE,MAAM,UAAU,CAAC;AAC/E,OAAO,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AAQ5C,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAClD;;;;;;;;;;;;;;;;;;;;;EAqBE;AAEF;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,KAAsB,EACtB,IAAe,EACf,IAAoB,EACpB,GAAe,EACf,KAAiB;IAEjB,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACxC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,CAAC;QACH,MAAM,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACrD,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,KAAsB,EACtB,IAAe,EACf,IAAoB,EACpB,GAAe;IAEf,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,MAAM,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC1D,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,CAAC;QACH,MAAM,kBAAkB,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,KAAsB,EACtB,IAAe,EACf,IAAoB,EACpB,KAAkC;IAElC,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,IAAI,CAAC,CAAC,MAAM,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,KAAsB,EACtB,IAAe,EACf,IAAoB,EACpB,IAA2B;IAE3B,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,MAAM,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;YACxD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,cAAc,CACrB,KAAsB,EACtB,GAAe;IAEf,MAAM,KAAK,GAAG,CAAC,CAAoC,EAAW,EAAE,CAC9D,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,GAAI,CAAC,CAAC;IACjC,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,KAAK,CAAC,KAAM,CAAC;IACtB,CAAC;SAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACvB,OAAO,KAAK,CAAC,KAAK;aACf,OAAQ,CAAC,GAAG,CAAC,CAAC,CAAa,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC;aAChD,IAAI,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,KAAK,UAAU,iBAAiB,CAC9B,IAAe,EACf,KAAsB,EACtB,GAAe;IAEf,MAAM,KAAK,GAAG,KAAK,EACjB,CAAuC,EACrB,EAAE;QACpB,OAAO,CACL,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,CAAC,CAAC,IAAI;gBACN,WAAW,CACT,MAAM,gBAAgB,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAI,CAAC,EACzC,MAAM,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAClC,CAAC;YACJ,CAAC,CAAC,CAAC,CAAC,KAAK;gBACP,WAAW,CACT,MAAM,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,EACjC,MAAM,gBAAgB,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAI,CAAC,CAC3C,CAAC,CACL,CAAC;IACJ,CAAC,CAAC;IACF,IAAI,MAAM,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QAChC,OAAO,KAAK,CAAC,QAAS,CAAC;IACzB,CAAC;SAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACvB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC;YAC9C,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC;YACzC,IAAI,MAAM,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC3B,OAAO,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+export { verifyMembership, verifyNonMembership } from "./ics23";
+export { calculateExistenceRoot, CommitmentRoot, iavlSpec, tendermintSpec, verifyExistence, verifyNonExistence, } from "./proofs";
+export { verifyWebcatProof, webcatSpec } from "./webcat";

package/dist/index.js

@@ -0,0 +1,4 @@
+export { verifyMembership, verifyNonMembership } from "./ics23";
+export { calculateExistenceRoot, iavlSpec, tendermintSpec, verifyExistence, verifyNonExistence, } from "./proofs";
+export { verifyWebcatProof, webcatSpec } from "./webcat";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EACL,sBAAsB,EAEtB,QAAQ,EACR,cAAc,EACd,eAAe,EACf,kBAAkB,GACnB,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC"}

package/dist/ops.d.ts

@@ -0,0 +1,4 @@
+import { HashOp, InnerOp, LeafOp } from "./proto/cosmos/ics23/v1/proofs";
+export declare function applyLeaf(leaf: LeafOp, key: Uint8Array, value: Uint8Array): Promise<Uint8Array>;
+export declare function applyInner(inner: InnerOp, child: Uint8Array): Promise<Uint8Array>;
+export declare function doHash(hashOp: HashOp, preimage: Uint8Array): Promise<Uint8Array>;

package/dist/ops.js

@@ -0,0 +1,111 @@
+import { HashOp, LengthOp, } from "./proto/cosmos/ics23/v1/proofs";
+const subtle = globalThis.crypto?.subtle;
+async function sha256(preimage) {
+    if (!subtle) {
+        throw new Error("Web Crypto API is not available");
+    }
+    const digest = await subtle.digest("SHA-256", preimage);
+    return new Uint8Array(digest);
+}
+export async function applyLeaf(leaf, key, value) {
+    if (key.length === 0) {
+        throw new Error("Missing key");
+    }
+    if (value.length === 0) {
+        throw new Error("Missing value");
+    }
+    const pkey = await prepareLeafData(ensureHash(leaf.prehashKey), ensureLength(leaf.length), key);
+    const pvalue = await prepareLeafData(ensureHash(leaf.prehashValue), ensureLength(leaf.length), value);
+    const data = new Uint8Array([
+        ...ensureBytes(leaf.prefix),
+        ...pkey,
+        ...pvalue,
+    ]);
+    return doHash(ensureHash(leaf.hash), data);
+}
+export async function applyInner(inner, child) {
+    if (child.length === 0) {
+        throw new Error("Inner op needs child value");
+    }
+    const preimage = new Uint8Array([
+        ...ensureBytes(inner.prefix),
+        ...child,
+        ...ensureBytes(inner.suffix),
+    ]);
+    return doHash(ensureHash(inner.hash), preimage);
+}
+function ensure(maybe, value) {
+    return maybe === undefined || maybe === null ? value : maybe;
+}
+const ensureHash = (h) => ensure(h, HashOp.NO_HASH);
+const ensureLength = (l) => ensure(l, LengthOp.NO_PREFIX);
+const ensureBytes = (b) => ensure(b, new Uint8Array([]));
+async function prepareLeafData(hashOp, lengthOp, data) {
+    const h = await doHashOrNoop(hashOp, data);
+    return doLengthOp(lengthOp, h);
+}
+// doHashOrNoop will return the preimage untouched if hashOp == NONE,
+// otherwise, perform doHash
+async function doHashOrNoop(hashOp, preimage) {
+    if (hashOp === HashOp.NO_HASH) {
+        return preimage;
+    }
+    return doHash(hashOp, preimage);
+}
+// doHash will perform the specified hash on the preimage.
+// if hashOp == NONE, it will return an error (use doHashOrNoop if you want different behavior)
+export async function doHash(hashOp, preimage) {
+    if (hashOp === HashOp.SHA256) {
+        return sha256(preimage);
+    }
+    throw new Error(`Unsupported hashop: ${hashOp}`);
+}
+// doLengthOp will calculate the proper prefix and return it prepended
+//   doLengthOp(op, data) -> length(data) || data
+function doLengthOp(lengthOp, data) {
+    switch (lengthOp) {
+        case LengthOp.NO_PREFIX:
+            return data;
+        case LengthOp.VAR_PROTO:
+            return new Uint8Array([...encodeVarintProto(data.length), ...data]);
+        case LengthOp.REQUIRE_32_BYTES:
+            if (data.length !== 32) {
+                throw new Error(`Length is ${data.length}, not 32 bytes`);
+            }
+            return data;
+        case LengthOp.REQUIRE_64_BYTES:
+            if (data.length !== 64) {
+                throw new Error(`Length is ${data.length}, not 64 bytes`);
+            }
+            return data;
+        case LengthOp.FIXED32_LITTLE:
+            return new Uint8Array([...encodeFixed32Le(data.length), ...data]);
+        // TODO
+        // case LengthOp_VAR_RLP:
+        // case LengthOp_FIXED32_BIG:
+        // case LengthOp_FIXED64_BIG:
+        // case LengthOp_FIXED64_LITTLE:
+    }
+    throw new Error(`Unsupported lengthop: ${lengthOp}`);
+}
+function encodeVarintProto(n) {
+    let enc = [];
+    let l = n;
+    while (l >= 128) {
+        const b = (l % 128) + 128;
+        enc = [...enc, b];
+        l = l / 128;
+    }
+    enc = [...enc, l];
+    return new Uint8Array(enc);
+}
+function encodeFixed32Le(n) {
+    const enc = new Uint8Array(4);
+    let l = n;
+    for (let i = enc.length; i > 0; i--) {
+        enc[Math.abs(i - enc.length)] = l % 256;
+        l = Math.floor(l / 256);
+    }
+    return enc;
+}
+//# sourceMappingURL=ops.js.map

package/dist/ops.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ops.js","sourceRoot":"","sources":["../src/ops.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,MAAM,EAGN,QAAQ,GACT,MAAM,gCAAgC,CAAC;AAExC,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC;AAEzC,KAAK,UAAU,MAAM,CAAC,QAAoB;IACxC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACrD,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IACxD,OAAO,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;AAChC,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,IAAY,EACZ,GAAe,EACf,KAAiB;IAEjB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrB,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IACnC,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,eAAe,CAChC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,EAC3B,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EACzB,GAAG,CACJ,CAAC;IACF,MAAM,MAAM,GAAG,MAAM,eAAe,CAClC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,EAC7B,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EACzB,KAAK,CACN,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC;QAC1B,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3B,GAAG,IAAI;QACP,GAAG,MAAM;KACV,CAAC,CAAC;IACH,OAAO,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAC7C,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,KAAc,EACd,KAAiB;IAEjB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;IAChD,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC;QAC9B,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC;QAC5B,GAAG,KAAK;QACR,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC;KAC7B,CAAC,CAAC;IACH,OAAO,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,MAAM,CAAI,KAA2B,EAAE,KAAQ;IACtD,OAAO,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;AAC/D,CAAC;AAED,MAAM,UAAU,GAAG,CAAC,CAA4B,EAAU,EAAE,CAC1D,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;AAC5B,MAAM,YAAY,GAAG,CAAC,CAA8B,EAAY,EAAE,CAChE,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;AAChC,MAAM,WAAW,GAAG,CAAC,CAAgC,EAAc,EAAE,CACnE,MAAM,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;AAEhC,KAAK,UAAU,eAAe,CAC5B,MAAc,EACd,QAAkB,EAClB,IAAgB;IAEhB,MAAM,CAAC,GAAG,MAAM,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC3C,OAAO,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;AACjC,CAAC;AAED,qEAAqE;AACrE,4BAA4B;AAC5B,KAAK,UAAU,YAAY,CACzB,MAAc,EACd,QAAoB;IAEpB,IAAI,MAAM,KAAK,MAAM,CAAC,OAAO,EAAE,CAAC;QAC9B,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AAClC,CAAC;AAED,0DAA0D;AAC1D,+FAA+F;AAC/F,MAAM,CAAC,KAAK,UAAU,MAAM,CAC1B,MAAc,EACd,QAAoB;IAEpB,IAAI,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QAC7B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC1B,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,uBAAuB,MAAM,EAAE,CAAC,CAAC;AACnD,CAAC;AAED,sEAAsE;AACtE,iDAAiD;AACjD,SAAS,UAAU,CAAC,QAAkB,EAAE,IAAgB;IACtD,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,QAAQ,CAAC,SAAS;YACrB,OAAO,IAAI,CAAC;QACd,KAAK,QAAQ,CAAC,SAAS;YACrB,OAAO,IAAI,UAAU,CAAC,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QACtE,KAAK,QAAQ,CAAC,gBAAgB;YAC5B,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,MAAM,gBAAgB,CAAC,CAAC;YAC5D,CAAC;YACD,OAAO,IAAI,CAAC;QACd,KAAK,QAAQ,CAAC,gBAAgB;YAC5B,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,MAAM,gBAAgB,CAAC,CAAC;YAC5D,CAAC;YACD,OAAO,IAAI,CAAC;QACd,KAAK,QAAQ,CAAC,cAAc;YAC1B,OAAO,IAAI,UAAU,CAAC,CAAC,GAAG,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QACpE,OAAO;QACP,yBAAyB;QACzB,6BAA6B;QAC7B,6BAA6B;QAC7B,gCAAgC;IAClC,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,yBAAyB,QAAQ,EAAE,CAAC,CAAC;AACvD,CAAC;AAED,SAAS,iBAAiB,CAAC,CAAS;IAClC,IAAI,GAAG,GAAsB,EAAE,CAAC;IAChC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,IAAI,GAAG,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QAC1B,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;QAClB,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACd,CAAC;IACD,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;IAClB,OAAO,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;AAC7B,CAAC;AAED,SAAS,eAAe,CAAC,CAAS;IAChC,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QACxC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/proofs.d.ts

@@ -0,0 +1,11 @@
+import { ExistenceProof, InnerOp, InnerSpec, NonExistenceProof, ProofSpec } from "./proto/cosmos/ics23/v1/proofs";
+export declare const iavlSpec: ProofSpec;
+export declare const tendermintSpec: ProofSpec;
+export declare const smtSpec: ProofSpec;
+export type CommitmentRoot = Uint8Array;
+export declare function keyForComparison(spec: ProofSpec, key: Uint8Array): Promise<Uint8Array>;
+export declare function verifyExistence(proof: ExistenceProof, spec: ProofSpec, root: CommitmentRoot, key: Uint8Array, value: Uint8Array): Promise<void>;
+export declare function verifyNonExistence(proof: NonExistenceProof, spec: ProofSpec, root: CommitmentRoot, key: Uint8Array): Promise<void>;
+export declare function calculateExistenceRoot(proof: ExistenceProof): Promise<CommitmentRoot>;
+export declare function ensureSpec(proof: ExistenceProof, spec: ProofSpec): void;
+export declare function ensureLeftNeighbor(spec: InnerSpec, left: readonly InnerOp[], right: readonly InnerOp[]): void;

package/dist/proofs.js

@@ -0,0 +1,235 @@
+import { applyInner, applyLeaf, doHash } from "./ops";
+import { HashOp, LengthOp, } from "./proto/cosmos/ics23/v1/proofs";
+import { bytesEqual, ensureBytesBefore, ensureBytesEqual, ensureInner, ensureLeaf, } from "./specs";
+export const iavlSpec = {
+    leafSpec: {
+        prefix: Uint8Array.from([0]),
+        hash: HashOp.SHA256,
+        prehashValue: HashOp.SHA256,
+        prehashKey: HashOp.NO_HASH,
+        length: LengthOp.VAR_PROTO,
+    },
+    innerSpec: {
+        childOrder: [0, 1],
+        minPrefixLength: 4,
+        maxPrefixLength: 12,
+        childSize: 33,
+        hash: HashOp.SHA256,
+        emptyChild: new Uint8Array(),
+    },
+    minDepth: 0,
+    maxDepth: 255,
+    prehashKeyBeforeComparison: false,
+};
+export const tendermintSpec = {
+    leafSpec: {
+        prefix: Uint8Array.from([0]),
+        hash: HashOp.SHA256,
+        prehashValue: HashOp.SHA256,
+        prehashKey: HashOp.NO_HASH,
+        length: LengthOp.VAR_PROTO,
+    },
+    innerSpec: {
+        childOrder: [0, 1],
+        minPrefixLength: 1,
+        maxPrefixLength: 1,
+        childSize: 32,
+        hash: HashOp.SHA256,
+        emptyChild: new Uint8Array(),
+    },
+    minDepth: 0,
+    maxDepth: 255,
+    prehashKeyBeforeComparison: false,
+};
+export const smtSpec = {
+    leafSpec: {
+        hash: HashOp.SHA256,
+        prehashKey: HashOp.SHA256,
+        prehashValue: HashOp.SHA256,
+        length: LengthOp.NO_PREFIX,
+        prefix: Uint8Array.from([0]),
+    },
+    innerSpec: {
+        childOrder: [0, 1],
+        childSize: 32,
+        minPrefixLength: 1,
+        maxPrefixLength: 1,
+        emptyChild: new Uint8Array(32),
+        hash: HashOp.SHA256,
+    },
+    maxDepth: 256,
+    minDepth: 0,
+    prehashKeyBeforeComparison: true,
+};
+export async function keyForComparison(spec, key) {
+    if (!spec.prehashKeyBeforeComparison) {
+        return key;
+    }
+    return doHash(spec.leafSpec.prehashKey, key);
+}
+// verifyExistence will throw an error if the proof doesn't link key, value -> root
+// or if it doesn't fulfill the spec
+export async function verifyExistence(proof, spec, root, key, value) {
+    ensureSpec(proof, spec);
+    const calc = await calculateExistenceRoot(proof);
+    ensureBytesEqual(calc, root);
+    ensureBytesEqual(key, proof.key);
+    ensureBytesEqual(value, proof.value);
+}
+// Verify does all checks to ensure the proof has valid non-existence proofs,
+// and they ensure the given key is not in the CommitmentState,
+// throwing an error if there is an issue
+export async function verifyNonExistence(proof, spec, root, key) {
+    let leftKey;
+    let rightKey;
+    if (proof.left) {
+        await verifyExistence(proof.left, spec, root, proof.left.key, proof.left.value);
+        leftKey = proof.left.key;
+    }
+    if (proof.right) {
+        await verifyExistence(proof.right, spec, root, proof.right.key, proof.right.value);
+        rightKey = proof.right.key;
+    }
+    if (!leftKey && !rightKey) {
+        throw new Error("neither left nor right proof defined");
+    }
+    if (leftKey) {
+        ensureBytesBefore(await keyForComparison(spec, leftKey), await keyForComparison(spec, key));
+    }
+    if (rightKey) {
+        ensureBytesBefore(await keyForComparison(spec, key), await keyForComparison(spec, rightKey));
+    }
+    if (!spec.innerSpec) {
+        throw new Error("no inner spec");
+    }
+    if (!leftKey) {
+        ensureLeftMost(spec.innerSpec, proof.right.path);
+    }
+    else if (!rightKey) {
+        ensureRightMost(spec.innerSpec, proof.left.path);
+    }
+    else {
+        ensureLeftNeighbor(spec.innerSpec, proof.left.path, proof.right.path);
+    }
+    return;
+}
+// Calculate determines the root hash that matches the given proof.
+// You must validate the result is what you have in a header.
+// Returns error if the calculations cannot be performed.
+export async function calculateExistenceRoot(proof) {
+    if (!proof.key || !proof.value) {
+        throw new Error("Existence proof needs key and value set");
+    }
+    if (!proof.leaf) {
+        throw new Error("Existence proof must start with a leaf operation");
+    }
+    const path = proof.path || [];
+    let res = await applyLeaf(proof.leaf, proof.key, proof.value);
+    for (const inner of path) {
+        res = await applyInner(inner, res);
+    }
+    return res;
+}
+// ensureSpec throws an Error if proof doesn't fulfill spec
+export function ensureSpec(proof, spec) {
+    if (!proof.leaf) {
+        throw new Error("Existence proof must start with a leaf operation");
+    }
+    if (!spec.leafSpec) {
+        throw new Error("Spec must include leafSpec");
+    }
+    if (!spec.innerSpec) {
+        throw new Error("Spec must include innerSpec");
+    }
+    ensureLeaf(proof.leaf, spec.leafSpec);
+    const path = proof.path || [];
+    if (spec.minDepth && path.length < spec.minDepth) {
+        throw new Error(`Too few inner nodes ${path.length}`);
+    }
+    if (spec.maxDepth && path.length > spec.maxDepth) {
+        throw new Error(`Too many inner nodes ${path.length}`);
+    }
+    for (const inner of path) {
+        ensureInner(inner, spec.leafSpec.prefix, spec.innerSpec);
+    }
+}
+function ensureLeftMost(spec, path) {
+    const { minPrefix, maxPrefix, suffix } = getPadding(spec, 0);
+    // ensure every step has a prefix and suffix defined to be leftmost
+    for (const step of path) {
+        if (!hasPadding(step, minPrefix, maxPrefix, suffix)) {
+            throw new Error("Step not leftmost");
+        }
+    }
+}
+function ensureRightMost(spec, path) {
+    const len = spec.childOrder.length - 1;
+    const { minPrefix, maxPrefix, suffix } = getPadding(spec, len);
+    // ensure every step has a prefix and suffix defined to be leftmost
+    for (const step of path) {
+        if (!hasPadding(step, minPrefix, maxPrefix, suffix)) {
+            throw new Error("Step not leftmost");
+        }
+    }
+}
+export function ensureLeftNeighbor(spec, left, right) {
+    const mutleft = [...left];
+    const mutright = [...right];
+    let topleft = mutleft.pop();
+    let topright = mutright.pop();
+    while (bytesEqual(topleft.prefix, topright.prefix) &&
+        bytesEqual(topleft.suffix, topright.suffix)) {
+        topleft = mutleft.pop();
+        topright = mutright.pop();
+    }
+    // now topleft and topright are the first divergent nodes
+    // make sure they are left and right of each other
+    if (!isLeftStep(spec, topleft, topright)) {
+        throw new Error(`Not left neightbor at first divergent step`);
+    }
+    // make sure the paths are left and right most possibilities respectively
+    ensureRightMost(spec, mutleft);
+    ensureLeftMost(spec, mutright);
+}
+// isLeftStep assumes left and right have common parents
+// checks if left is exactly one slot to the left of right
+function isLeftStep(spec, left, right) {
+    const leftidx = orderFromPadding(spec, left);
+    const rightidx = orderFromPadding(spec, right);
+    return rightidx === leftidx + 1;
+}
+function orderFromPadding(spec, inner) {
+    for (let branch = 0; branch < spec.childOrder.length; branch++) {
+        const { minPrefix, maxPrefix, suffix } = getPadding(spec, branch);
+        if (hasPadding(inner, minPrefix, maxPrefix, suffix)) {
+            return branch;
+        }
+    }
+    throw new Error(`Cannot find any valid spacing for this node`);
+}
+function hasPadding(op, minPrefix, maxPrefix, suffix) {
+    if ((op.prefix || []).length < minPrefix) {
+        return false;
+    }
+    if ((op.prefix || []).length > maxPrefix) {
+        return false;
+    }
+    return (op.suffix || []).length === suffix;
+}
+function getPadding(spec, branch) {
+    const idx = getPosition(spec.childOrder, branch);
+    // count how many children are in the prefix
+    const prefix = idx * spec.childSize;
+    const minPrefix = prefix + spec.minPrefixLength;
+    const maxPrefix = prefix + spec.maxPrefixLength;
+    // count how many children are in the suffix
+    const suffix = (spec.childOrder.length - 1 - idx) * spec.childSize;
+    return { minPrefix, maxPrefix, suffix };
+}
+function getPosition(order, branch) {
+    if (branch < 0 || branch >= order.length) {
+        throw new Error(`Invalid branch: ${branch}`);
+    }
+    return order.findIndex((val) => val === branch);
+}
+//# sourceMappingURL=proofs.js.map

package/dist/proofs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"proofs.js","sourceRoot":"","sources":["../src/proofs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,OAAO,CAAC;AACtD,OAAO,EAEL,MAAM,EAGN,QAAQ,GAGT,MAAM,gCAAgC,CAAC;AACxC,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,gBAAgB,EAChB,WAAW,EACX,UAAU,GACX,MAAM,SAAS,CAAC;AAEjB,MAAM,CAAC,MAAM,QAAQ,GAAc;IACjC,QAAQ,EAAE;QACR,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,EAAE,MAAM,CAAC,MAAM;QACnB,YAAY,EAAE,MAAM,CAAC,MAAM;QAC3B,UAAU,EAAE,MAAM,CAAC,OAAO;QAC1B,MAAM,EAAE,QAAQ,CAAC,SAAS;KAC3B;IACD,SAAS,EAAE;QACT,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAClB,eAAe,EAAE,CAAC;QAClB,eAAe,EAAE,EAAE;QACnB,SAAS,EAAE,EAAE;QACb,IAAI,EAAE,MAAM,CAAC,MAAM;QACnB,UAAU,EAAE,IAAI,UAAU,EAAE;KAC7B;IACD,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,GAAG;IACb,0BAA0B,EAAE,KAAK;CAClC,CAAC;AAEF,MAAM,CAAC,MAAM,cAAc,GAAc;IACvC,QAAQ,EAAE;QACR,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,EAAE,MAAM,CAAC,MAAM;QACnB,YAAY,EAAE,MAAM,CAAC,MAAM;QAC3B,UAAU,EAAE,MAAM,CAAC,OAAO;QAC1B,MAAM,EAAE,QAAQ,CAAC,SAAS;KAC3B;IACD,SAAS,EAAE;QACT,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAClB,eAAe,EAAE,CAAC;QAClB,eAAe,EAAE,CAAC;QAClB,SAAS,EAAE,EAAE;QACb,IAAI,EAAE,MAAM,CAAC,MAAM;QACnB,UAAU,EAAE,IAAI,UAAU,EAAE;KAC7B;IACD,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,GAAG;IACb,0BAA0B,EAAE,KAAK;CAClC,CAAC;AAEF,MAAM,CAAC,MAAM,OAAO,GAAc;IAChC,QAAQ,EAAE;QACR,IAAI,EAAE,MAAM,CAAC,MAAM;QACnB,UAAU,EAAE,MAAM,CAAC,MAAM;QACzB,YAAY,EAAE,MAAM,CAAC,MAAM;QAC3B,MAAM,EAAE,QAAQ,CAAC,SAAS;QAC1B,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;KAC7B;IACD,SAAS,EAAE;QACT,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAClB,SAAS,EAAE,EAAE;QACb,eAAe,EAAE,CAAC;QAClB,eAAe,EAAE,CAAC;QAClB,UAAU,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC;QAC9B,IAAI,EAAE,MAAM,CAAC,MAAM;KACpB;IACD,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,CAAC;IACX,0BAA0B,EAAE,IAAI;CACjC,CAAC;AAIF,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,IAAe,EACf,GAAe;IAEf,IAAI,CAAC,IAAI,CAAC,0BAA0B,EAAE,CAAC;QACrC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,CAAC,QAAS,CAAC,UAAW,EAAE,GAAG,CAAC,CAAC;AACjD,CAAC;AAED,mFAAmF;AACnF,oCAAoC;AACpC,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,KAAqB,EACrB,IAAe,EACf,IAAoB,EACpB,GAAe,EACf,KAAiB;IAEjB,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACxB,MAAM,IAAI,GAAG,MAAM,sBAAsB,CAAC,KAAK,CAAC,CAAC;IACjD,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7B,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,GAAI,CAAC,CAAC;IAClC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,KAAM,CAAC,CAAC;AACxC,CAAC;AAED,6EAA6E;AAC7E,+DAA+D;AAC/D,yCAAyC;AACzC,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,KAAwB,EACxB,IAAe,EACf,IAAoB,EACpB,GAAe;IAEf,IAAI,OAA+B,CAAC;IACpC,IAAI,QAAgC,CAAC;IAErC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;QACf,MAAM,eAAe,CACnB,KAAK,CAAC,IAAI,EACV,IAAI,EACJ,IAAI,EACJ,KAAK,CAAC,IAAI,CAAC,GAAI,EACf,KAAK,CAAC,IAAI,CAAC,KAAM,CAClB,CAAC;QACF,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAI,CAAC;IAC5B,CAAC;IACD,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChB,MAAM,eAAe,CACnB,KAAK,CAAC,KAAK,EACX,IAAI,EACJ,IAAI,EACJ,KAAK,CAAC,KAAK,CAAC,GAAI,EAChB,KAAK,CAAC,KAAK,CAAC,KAAM,CACnB,CAAC;QACF,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAI,CAAC;IAC9B,CAAC;IAED,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1D,CAAC;IAED,IAAI,OAAO,EAAE,CAAC;QACZ,iBAAiB,CACf,MAAM,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,EACrC,MAAM,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAClC,CAAC;IACJ,CAAC;IACD,IAAI,QAAQ,EAAE,CAAC;QACb,iBAAiB,CACf,MAAM,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,EACjC,MAAM,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CACvC,CAAC;IACJ,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IACnC,CAAC;IACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,KAAM,CAAC,IAAK,CAAC,CAAC;IACrD,CAAC;SAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACrB,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,IAAK,CAAC,IAAK,CAAC,CAAC;IACrD,CAAC;SAAM,CAAC;QACN,kBAAkB,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,IAAK,CAAC,IAAK,EAAE,KAAK,CAAC,KAAM,CAAC,IAAK,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO;AACT,CAAC;AAED,mEAAmE;AACnE,6DAA6D;AAC7D,yDAAyD;AACzD,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,KAAqB;IAErB,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC7D,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;IAE9B,IAAI,GAAG,GAAG,MAAM,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC9D,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,GAAG,GAAG,MAAM,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,UAAU,CAAC,KAAqB,EAAE,IAAe;IAC/D,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;IACtE,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;IAChD,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACjD,CAAC;IACD,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAEtC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;IAC9B,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACjD,MAAM,IAAI,KAAK,CAAC,uBAAuB,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACjD,MAAM,IAAI,KAAK,CAAC,wBAAwB,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACzD,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC3D,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,IAAe,EAAE,IAAwB;IAC/D,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE7D,mEAAmE;IACnE,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC;YACpD,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,IAAe,EAAE,IAAwB;IAChE,MAAM,GAAG,GAAG,IAAI,CAAC,UAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IACxC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAE/D,mEAAmE;IACnE,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC;YACpD,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,IAAe,EACf,IAAwB,EACxB,KAAyB;IAEzB,MAAM,OAAO,GAAc,CAAC,GAAG,IAAI,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAc,CAAC,GAAG,KAAK,CAAC,CAAC;IAEvC,IAAI,OAAO,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;IAC7B,IAAI,QAAQ,GAAG,QAAQ,CAAC,GAAG,EAAG,CAAC;IAC/B,OACE,UAAU,CAAC,OAAO,CAAC,MAAO,EAAE,QAAQ,CAAC,MAAO,CAAC;QAC7C,UAAU,CAAC,OAAO,CAAC,MAAO,EAAE,QAAQ,CAAC,MAAO,CAAC,EAC7C,CAAC;QACD,OAAO,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;QACzB,QAAQ,GAAG,QAAQ,CAAC,GAAG,EAAG,CAAC;IAC7B,CAAC;IAED,yDAAyD;IACzD,kDAAkD;IAClD,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAChE,CAAC;IAED,yEAAyE;IACzE,eAAe,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAC/B,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AACjC,CAAC;AAED,wDAAwD;AACxD,0DAA0D;AAC1D,SAAS,UAAU,CAAC,IAAe,EAAE,IAAa,EAAE,KAAc;IAChE,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC/C,OAAO,QAAQ,KAAK,OAAO,GAAG,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAe,EAAE,KAAc;IACvD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,UAAW,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;QAChE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClE,IAAI,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC;YACpD,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,UAAU,CACjB,EAAW,EACX,SAAiB,EACjB,SAAiB,EACjB,MAAc;IAEd,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,CAAC,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC;AAC7C,CAAC;AAOD,SAAS,UAAU,CAAC,IAAe,EAAE,MAAc;IACjD,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,UAAW,EAAE,MAAM,CAAC,CAAC;IAElD,4CAA4C;IAC5C,MAAM,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,SAAU,CAAC;IACrC,MAAM,SAAS,GAAG,MAAM,GAAG,IAAI,CAAC,eAAgB,CAAC;IACjD,MAAM,SAAS,GAAG,MAAM,GAAG,IAAI,CAAC,eAAgB,CAAC;IAEjD,4CAA4C;IAC5C,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,UAAW,CAAC,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,SAAU,CAAC;IACrE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;AAC1C,CAAC;AAED,SAAS,WAAW,CAAC,KAAwB,EAAE,MAAc;IAC3D,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,mBAAmB,MAAM,EAAE,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC;AAClD,CAAC"}