zklicensing 0.1.0-beta.2 → 0.1.0-beta.21

package/build/compactMerkleMap.d.ts

@@ -0,0 +1,72 @@
+/**
+ * compactMerkleMap.ts
+ *
+ * A drop-in for o1js's MerkleMap (height 256: set, getRoot, getWitness — same
+ * positions, hashes and witnesses) that stores only what the tree can't
+ * compute cheaply: the leaves, and the values of the two children of every
+ * node where two leaves' paths split ("split children", 2(N − 1) of them).
+ * Every other node a witness needs is an empty subtree, a known constant.
+ *
+ * So it can be saved and loaded without re-hashing (toCompact / fromCompact):
+ * a MerkleMap would have to be rebuilt, one 256-hash path per leaf. Changes
+ * (setMany) re-hash only the paths above the changed leaves.
+ */
+import { Field, MerkleMapWitness } from 'o1js';
+export declare const TREE_HEIGHT = 256;
+/** zeros()[l]: the value of an empty subtree whose top is at level l. */
+export declare function zeros(): bigint[];
+/** A key's leaf position, as MerkleMap places it. */
+export declare function keyIndex(key: Field | string | bigint): bigint;
+/** The split-children positions [level, index], in canonical order, for sorted leaf positions. */
+export declare function splitChildren(sorted: bigint[]): Array<[number, bigint]>;
+/** Field values as 32-byte big-endian words, base64. */
+export declare function encodeFields(values: bigint[]): string;
+export declare function decodeFields(b64: string): bigint[];
+export type CompactMapData = {
+    /** Leaf positions, sorted. */
+    indices: bigint[];
+    /** Leaf values, in the same order. */
+    leaves: bigint[];
+    /** Split-children values, in splitChildren order. */
+    splits: bigint[];
+};
+export declare class CompactMerkleMap {
+    private idx;
+    private leaves;
+    private split;
+    private root;
+    /** Number of non-empty leaves. */
+    get size(): number;
+    getRoot(): Field;
+    set(key: Field, value: Field): void;
+    /** Sets several leaves, re-hashing only above them. */
+    setMany(entries: Iterable<[Field | string, Field | bigint]>): void;
+    /** A MerkleMapWitness for `key`, as MerkleMap.getWitness gives it. */
+    getWitness(key: Field): MerkleMapWitness;
+    witnessValues(s: bigint): {
+        isLefts: boolean[];
+        siblings: bigint[];
+    };
+    /** A node's value, when it is a leaf, a split child, or empty; otherwise undefined. */
+    getNode(level: number, index: bigint): bigint | undefined;
+    /** The split-children values in canonical order (for compact copies). */
+    splitValues(): bigint[];
+    toCompact(): CompactMapData;
+    /**
+     * Loads a saved copy without re-hashing the tree: only the path from the
+     * root down to the first split. Throws if the data is inconsistent, or if
+     * `expectedRoot` is given and the copy doesn't fold to it. Values deeper
+     * down aren't re-checked (that would cost the full rebuild): protect a
+     * stored copy with a checksum.
+     */
+    static fromCompact(d: CompactMapData, expectedRoot?: string): CompactMerkleMap;
+    /** Recomputes split values above the changed positions (sorted), and the root. */
+    private recompute;
+    private computeRoot;
+    /**
+     * A node's value: empty, a leaf, a split child kept from before when no
+     * changed leaf is below it, one leaf's path, or the hash of its children.
+     */
+    private valueOf;
+}
+//# sourceMappingURL=compactMerkleMap.d.ts.map

package/build/compactMerkleMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compactMerkleMap.d.ts","sourceRoot":"","sources":["../src/compactMerkleMap.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAQ,KAAK,EAAa,gBAAgB,EAAY,MAAM,MAAM,CAAC;AAE1E,eAAO,MAAM,WAAW,MAAM,CAAC;AAG/B,yEAAyE;AACzE,wBAAgB,KAAK,IAAI,MAAM,EAAE,CAOhC;AAID,qDAAqD;AACrD,wBAAgB,QAAQ,CAAC,GAAG,EAAE,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,CAE7D;AAID,kGAAkG;AAClG,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAQvE;AAED,wDAAwD;AACxD,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAMrD;AACD,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,CAUlD;AAWD,MAAM,MAAM,cAAc,GAAG;IAC3B,8BAA8B;IAC9B,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,sCAAsC;IACtC,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,qDAAqD;IACrD,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAEF,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,GAAG,CAAgB;IAC3B,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,KAAK,CAA6B;IAC1C,OAAO,CAAC,IAAI,CAAoC;IAEhD,kCAAkC;IAClC,IAAI,IAAI,IAAI,MAAM,CAA4B;IAE9C,OAAO,IAAI,KAAK;IAEhB,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI;IAEnC,uDAAuD;IACvD,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,KAAK,GAAG,MAAM,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI;IAclE,sEAAsE;IACtE,UAAU,CAAC,GAAG,EAAE,KAAK,GAAG,gBAAgB;IAKxC,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG;QAAE,OAAO,EAAE,OAAO,EAAE,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE;IAcpE,uFAAuF;IACvF,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAQzD,yEAAyE;IACzE,WAAW,IAAI,MAAM,EAAE;IAIvB,SAAS,IAAI,cAAc;IAI3B;;;;;;OAMG;IACH,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,cAAc,EAAE,YAAY,CAAC,EAAE,MAAM,GAAG,gBAAgB;IAc9E,kFAAkF;IAClF,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,WAAW;IASnB;;;OAGG;IACH,OAAO,CAAC,OAAO;CA0BhB"}

package/build/compactMerkleMap.js

@@ -0,0 +1,224 @@
+// Copyright (c) 2025-2026 zkLicensing project developers
+// SPDX-License-Identifier: BUSL-1.1
+/**
+ * compactMerkleMap.ts
+ *
+ * A drop-in for o1js's MerkleMap (height 256: set, getRoot, getWitness — same
+ * positions, hashes and witnesses) that stores only what the tree can't
+ * compute cheaply: the leaves, and the values of the two children of every
+ * node where two leaves' paths split ("split children", 2(N − 1) of them).
+ * Every other node a witness needs is an empty subtree, a known constant.
+ *
+ * So it can be saved and loaded without re-hashing (toCompact / fromCompact):
+ * a MerkleMap would have to be rebuilt, one 256-hash path per leaf. Changes
+ * (setMany) re-hash only the paths above the changed leaves.
+ */
+import { Bool, Field, MerkleMap, MerkleMapWitness, Poseidon } from 'o1js';
+export const TREE_HEIGHT = 256;
+let zeroCache = null;
+/** zeros()[l]: the value of an empty subtree whose top is at level l. */
+export function zeros() {
+    if (!zeroCache) {
+        const z = [0n];
+        for (let i = 1; i < TREE_HEIGHT; i++)
+            z.push(Poseidon.hash([Field(z[i - 1]), Field(z[i - 1])]).toBigInt());
+        zeroCache = z;
+    }
+    return zeroCache;
+}
+const H = (a, b) => Poseidon.hash([Field(a), Field(b)]).toBigInt();
+const keyMap = new MerkleMap();
+/** A key's leaf position, as MerkleMap places it. */
+export function keyIndex(key) {
+    return keyMap._keyToIndex(Field(key));
+}
+function bitLength(x) { let n = 0; while (x > 0n) {
+    x >>= 1n;
+    n++;
+} return n; }
+/** The split-children positions [level, index], in canonical order, for sorted leaf positions. */
+export function splitChildren(sorted) {
+    const out = [];
+    for (let i = 0; i + 1 < sorted.length; i++) {
+        const a = sorted[i], b = sorted[i + 1];
+        const l = bitLength(a ^ b) - 1; // the children's level; they meet at l + 1
+        out.push([l, a >> BigInt(l)], [l, b >> BigInt(l)]);
+    }
+    return out;
+}
+/** Field values as 32-byte big-endian words, base64. */
+export function encodeFields(values) {
+    const bytes = new Uint8Array(values.length * 32);
+    values.forEach((v, i) => { for (let k = 31; k >= 0; k--) {
+        bytes[i * 32 + k] = Number(v & 0xffn);
+        v >>= 8n;
+    } });
+    let bin = '';
+    for (let i = 0; i < bytes.length; i += 0x8000)
+        bin += String.fromCharCode(...bytes.subarray(i, i + 0x8000));
+    return btoa(bin);
+}
+export function decodeFields(b64) {
+    const bin = atob(b64);
+    if (bin.length % 32)
+        throw new Error('compact data is not a whole number of fields');
+    const out = [];
+    for (let i = 0; i < bin.length; i += 32) {
+        let v = 0n;
+        for (let k = 0; k < 32; k++)
+            v = (v << 8n) | BigInt(bin.charCodeAt(i + k));
+        out.push(v);
+    }
+    return out;
+}
+const nodeKey = (l, j) => `${l}:${j}`;
+const cmp = (a, b) => (a < b ? -1 : a > b ? 1 : 0);
+/** First position >= x in a sorted array. */
+function lower(arr, x) {
+    let lo = 0, hi = arr.length;
+    while (lo < hi) {
+        const m = (lo + hi) >> 1;
+        if (arr[m] < x)
+            lo = m + 1;
+        else
+            hi = m;
+    }
+    return lo;
+}
+export class CompactMerkleMap {
+    idx = [];
+    leaves = new Map();
+    split = new Map();
+    root = zeros()[TREE_HEIGHT - 1];
+    /** Number of non-empty leaves. */
+    get size() { return this.idx.length; }
+    getRoot() { return Field(this.root); }
+    set(key, value) { this.setMany([[key, value]]); }
+    /** Sets several leaves, re-hashing only above them. */
+    setMany(entries) {
+        const changed = [];
+        for (const [k, v] of entries) {
+            const i = keyIndex(k);
+            const val = typeof v === 'bigint' ? v : v.toBigInt();
+            if (!this.leaves.has(i))
+                this.idx.splice(lower(this.idx, i), 0, i);
+            this.leaves.set(i, val);
+            changed.push(i);
+        }
+        if (changed.length === 0)
+            return;
+        changed.sort(cmp);
+        this.recompute(changed);
+    }
+    /** A MerkleMapWitness for `key`, as MerkleMap.getWitness gives it. */
+    getWitness(key) {
+        const { isLefts, siblings } = this.witnessValues(keyIndex(key));
+        return new MerkleMapWitness(isLefts.map(b => Bool(b)), siblings.map(s => Field(s)));
+    }
+    witnessValues(s) {
+        const isLefts = [];
+        const siblings = [];
+        const memo = new Map();
+        for (let l = 0; l < TREE_HEIGHT - 1; l++) {
+            const at = s >> BigInt(l);
+            isLefts.push((at & 1n) === 0n);
+            // A split child, or empty — except for a key not in the map, whose
+            // path meets one non-empty subtree that isn't a split child: computed.
+            siblings.push(this.split.get(nodeKey(l, at ^ 1n)) ?? this.valueOf(l, at ^ 1n, [], memo));
+        }
+        return { isLefts, siblings };
+    }
+    /** A node's value, when it is a leaf, a split child, or empty; otherwise undefined. */
+    getNode(level, index) {
+        if (level === 0 && this.leaves.has(index))
+            return this.leaves.get(index);
+        const v = this.split.get(nodeKey(level, index));
+        if (v !== undefined)
+            return v;
+        const lo = index << BigInt(level), hi = ((index + 1n) << BigInt(level)) - 1n;
+        return lower(this.idx, lo) === lower(this.idx, hi + 1n) ? zeros()[level] : undefined;
+    }
+    /** The split-children values in canonical order (for compact copies). */
+    splitValues() {
+        return splitChildren(this.idx).map(([l, j]) => this.split.get(nodeKey(l, j)));
+    }
+    toCompact() {
+        return { indices: [...this.idx], leaves: this.idx.map(i => this.leaves.get(i)), splits: this.splitValues() };
+    }
+    /**
+     * Loads a saved copy without re-hashing the tree: only the path from the
+     * root down to the first split. Throws if the data is inconsistent, or if
+     * `expectedRoot` is given and the copy doesn't fold to it. Values deeper
+     * down aren't re-checked (that would cost the full rebuild): protect a
+     * stored copy with a checksum.
+     */
+    static fromCompact(d, expectedRoot) {
+        const m = new CompactMerkleMap();
+        for (let i = 1; i < d.indices.length; i++)
+            if (d.indices[i] <= d.indices[i - 1])
+                throw new Error('compact map: positions are not sorted');
+        if (d.leaves.length !== d.indices.length)
+            throw new Error('compact map: one value per leaf expected');
+        const positions = splitChildren(d.indices);
+        if (d.splits.length !== positions.length)
+            throw new Error(`compact map: expected ${positions.length} split values, got ${d.splits.length}`);
+        m.idx = [...d.indices];
+        d.indices.forEach((i, k) => m.leaves.set(i, d.leaves[k]));
+        positions.forEach(([l, j], k) => m.split.set(nodeKey(l, j), d.splits[k]));
+        m.root = m.computeRoot([]);
+        if (expectedRoot !== undefined && m.root.toString() !== expectedRoot)
+            throw new Error('compact map: the saved copy does not fold to its root');
+        return m;
+    }
+    /** Recomputes split values above the changed positions (sorted), and the root. */
+    recompute(changed) {
+        this.root = this.computeRoot(changed);
+    }
+    computeRoot(changed) {
+        const memo = new Map();
+        const next = new Map();
+        for (const [l, j] of splitChildren(this.idx))
+            next.set(nodeKey(l, j), this.valueOf(l, j, changed, memo));
+        const root = this.valueOf(TREE_HEIGHT - 1, 0n, changed, memo);
+        this.split = next;
+        return root;
+    }
+    /**
+     * A node's value: empty, a leaf, a split child kept from before when no
+     * changed leaf is below it, one leaf's path, or the hash of its children.
+     */
+    valueOf(l, j, changed, memo) {
+        const k = nodeKey(l, j);
+        const m = memo.get(k);
+        if (m !== undefined)
+            return m;
+        const z = zeros();
+        const idx = this.idx;
+        const lo = j << BigInt(l), hi = ((j + 1n) << BigInt(l)) - 1n;
+        const a = lower(idx, lo), b = lower(idx, hi + 1n);
+        let v;
+        if (a === b)
+            v = z[l];
+        else if (l === 0)
+            v = this.leaves.get(j);
+        else {
+            const touched = lower(changed, lo) !== lower(changed, hi + 1n);
+            const kept = touched ? undefined : this.split.get(k);
+            if (kept !== undefined)
+                v = kept;
+            else if (b - a === 1) {
+                // One leaf below: its path up to here, beside empty subtrees.
+                const pos = idx[a];
+                let h = this.leaves.get(pos);
+                for (let t = 0; t < l; t++)
+                    h = ((pos >> BigInt(t)) & 1n) === 0n ? H(h, z[t]) : H(z[t], h);
+                v = h;
+            }
+            else
+                v = H(this.valueOf(l - 1, 2n * j, changed, memo), this.valueOf(l - 1, 2n * j + 1n, changed, memo));
+        }
+        memo.set(k, v);
+        return v;
+    }
+}
+//# sourceMappingURL=compactMerkleMap.js.map

package/build/compactMerkleMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compactMerkleMap.js","sourceRoot":"","sources":["../src/compactMerkleMap.ts"],"names":[],"mappings":"AAAA,yDAAyD;AACzD,oCAAoC;AAEpC;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,MAAM,CAAC;AAE1E,MAAM,CAAC,MAAM,WAAW,GAAG,GAAG,CAAC;AAE/B,IAAI,SAAS,GAAoB,IAAI,CAAC;AACtC,yEAAyE;AACzE,MAAM,UAAU,KAAK;IACnB,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC3G,SAAS,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AACD,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;AAEnF,MAAM,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;AAC/B,qDAAqD;AACrD,MAAM,UAAU,QAAQ,CAAC,GAA4B;IACnD,OAAQ,MAAc,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAW,CAAC;AAC3D,CAAC;AAED,SAAS,SAAS,CAAC,CAAS,IAAY,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC;IAAC,CAAC,KAAK,EAAE,CAAC;IAAC,CAAC,EAAE,CAAC;AAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAEhG,kGAAkG;AAClG,MAAM,UAAU,aAAa,CAAC,MAAgB;IAC5C,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,2CAA2C;QAC3E,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,wDAAwD;AACxD,MAAM,UAAU,YAAY,CAAC,MAAgB;IAC3C,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;IACjD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAAC,CAAC,KAAK,EAAE,CAAC;IAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjH,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM;QAAE,GAAG,IAAI,MAAM,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC5G,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;AACnB,CAAC;AACD,MAAM,UAAU,YAAY,CAAC,GAAW;IACtC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACtB,IAAI,GAAG,CAAC,MAAM,GAAG,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;IACrF,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;YAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3E,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AACtD,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,6CAA6C;AAC7C,SAAS,KAAK,CAAC,GAAa,EAAE,CAAS;IACrC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;IAC5B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAAE,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;;YAAM,EAAE,GAAG,CAAC,CAAC;IAAC,CAAC;IACtF,OAAO,EAAE,CAAC;AACZ,CAAC;AAWD,MAAM,OAAO,gBAAgB;IACnB,GAAG,GAAa,EAAE,CAAC;IACnB,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnC,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClC,IAAI,GAAW,KAAK,EAAE,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;IAEhD,kCAAkC;IAClC,IAAI,IAAI,KAAa,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAE9C,OAAO,KAAY,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE7C,GAAG,CAAC,GAAU,EAAE,KAAY,IAAU,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAErE,uDAAuD;IACvD,OAAO,CAAC,OAAmD;QACzD,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACrD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACxB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACjC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED,sEAAsE;IACtE,UAAU,CAAC,GAAU;QACnB,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,OAAO,IAAI,gBAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,CAAC;IAED,aAAa,CAAC,CAAS;QACrB,MAAM,OAAO,GAAc,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;YAC/B,mEAAmE;YACnE,uEAAuE;YACvE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;QAC3F,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;IAC/B,CAAC;IAED,uFAAuF;IACvF,OAAO,CAAC,KAAa,EAAE,KAAa;QAClC,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzE,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;QAC7E,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvF,CAAC;IAED,yEAAyE;IACzE,WAAW;QACT,OAAO,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC;IACjF,CAAC;IAED,SAAS;QACP,OAAO,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;IAChH,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,WAAW,CAAC,CAAiB,EAAE,YAAqB;QACzD,MAAM,CAAC,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC1I,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,OAAO,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;QACtG,MAAM,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,SAAS,CAAC,MAAM,sBAAsB,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QAC5I,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,YAAY,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,YAAY;YAAE,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;QAC/I,OAAO,CAAC,CAAC;IACX,CAAC;IAED,kFAAkF;IAC1E,SAAS,CAAC,OAAiB;QACjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAEO,WAAW,CAAC,OAAiB;QACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;QACzG,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC9D,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACK,OAAO,CAAC,CAAS,EAAE,CAAS,EAAE,OAAiB,EAAE,IAAyB;QAChF,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;QACrB,MAAM,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAC7D,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;QAClD,IAAI,CAAS,CAAC;QACd,IAAI,CAAC,KAAK,CAAC;YAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aACjB,IAAI,CAAC,KAAK,CAAC;YAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;aACrC,CAAC;YACJ,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,OAAO,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAC/D,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrD,IAAI,IAAI,KAAK,SAAS;gBAAE,CAAC,GAAG,IAAI,CAAC;iBAC5B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrB,8DAA8D;gBAC9D,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;gBAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAAE,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC3F,CAAC,GAAG,CAAC,CAAC;YACR,CAAC;;gBAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;QAC5G,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACf,OAAO,CAAC,CAAC;IACX,CAAC;CACF"}

package/build/contractInterface.d.ts

@@ -1,55 +1,195 @@
-// Hand-written declarations for contractInterface.ts.
-// tsc can't emit these automatically because the inferred return types of
-// Struct() and SmartContract reference internal o1js paths outside this
-// package's rootDir, triggering TS2742. Callers get full typing on the
-// methods they actually invoke by importing the corresponding o1js types
-// directly (Field, PublicKey, etc.) in their own code.
-
-import type { Field, UInt64 } from 'o1js';
-
-export const LicenseIssuedEvent: any;
+/**
+ * contractInterface.ts
+ *
+ * Public contract interface: event Structs, slot/grace constants, duration
+ * helpers, and a minimal `LicensingAppEventsContract` SmartContract subclass
+ * that has the events declaration but no @method bodies.
+ *
+ * The full `LicensingApp` (with provable method bodies) lives in the private
+ * zklicensing-app package; only the things needed to decode events and reason
+ * about durations are published here so a public verify service can replay
+ * the archive without pulling in the contract source.
+ *
+ * `CANONICAL_VK_HASH` is the verification-key hash of the published
+ * `LicensingApp` circuit. Bump it whenever the on-chain zkApp changes
+ * and rerun the backend's boot assertion (see zklicensing-app/src/keeperService.ts)
+ * / the verify service's `ensureCompiled()` check to catch drift.
+ */
+import { Bool, Field, PublicKey, SmartContract, UInt32, UInt64 } from 'o1js';
+export declare const LicenseIssuedEvent: any;
 export type LicenseIssuedEvent = any;
-
-export const ExpiryUpdateEvent: any;
+export declare const ExpiryUpdateEvent: any;
 export type ExpiryUpdateEvent = any;
-
-export const PriceUpdatedEvent: any;
+export declare const PriceUpdatedEvent: any;
 export type PriceUpdatedEvent = any;
-
-export const AppCreatedEvent: any;
+export declare const AppCreatedEvent: any;
 export type AppCreatedEvent = any;
-
-export const LicenseMigratedEvent: any;
-export type LicenseMigratedEvent = any;
-
-export function unpackPrices(packed: Field): { priceMonthly: UInt64; priceYearly: UInt64; priceFiveYear: UInt64 };
-
-export const MONTHLY_SLOTS_N: number;
-export const ONE_YEAR_SLOTS_N: number;
-export const FIVE_YEAR_SLOTS_N: number;
-export const REFUND_WINDOW_N: number;
-export const GRACE_PERIOD_N: number;
-export const MS_PER_SLOT_N: number;
-export const SLOTS_PER_DAY_N: number;
-export const TOLERANCE_WINDOW_N: number;
-
-export const EMPTY: Field;
-export const EMPTY_ROOT: Field;
-
-export const DURATION_LABELS: readonly ['1 Month', '1 Year', '5 Years'];
-export type DurationLabel = '1 Month' | '1 Year' | '5 Years';
-export const DURATION_INDEX: { readonly '1 Month': 0; readonly '1 Year': 1; readonly '5 Years': 2 };
-
-export function durationSlotsFromLabel(label?: string | null): number | null;
-export function durationIndexFromLabel(label?: string | null): number | null;
-export function durationLabelFromIndex(idx: number): DurationLabel | null;
-
-export const LicensingAppEventsContract: any;
-
-export const SUPPORTED_LICENSING_APP_VERSIONS: readonly number[];
-export function fetchLicensingAppVersion(zkAppAddress: string): Promise<number | null>;
-
-export const CANONICAL_VK_HASHES: Readonly<Record<number, string>>;
-export const CURRENT_GENERATION: number;
-export const CANONICAL_VK_HASH: string;
-export const CANONICAL_LICENSE_PROOF_VK_HASH: string;
+export declare const AppRetiredEvent: any;
+export type AppRetiredEvent = any;
+/**
+ * What the vendor or the platform signs to retire an app: bound to the app,
+ * its frozen root, the one successor that may start from it, and `force`
+ * (only the platform may: retire with purchases in escrow, whose funds then
+ * stay on the retired contract).
+ */
+export declare const APP_RETIRE_TAG: Field;
+export declare function appRetireMessage(app: PublicKey, licensesRoot: Field, successor: PublicKey, force: Bool): Field[];
+/**
+ * LicensingApp's on-chain state, in declaration order (appState index of
+ * each field; a PublicKey takes two). A successor's initializeSuccessor
+ * reads its predecessor's through account preconditions.
+ */
+export declare const LICENSING_APP_STATE: {
+    readonly licensesRoot: 0;
+    readonly vendorX: 1;
+    readonly vendorIsOdd: 2;
+    readonly escrowRoot: 3;
+    readonly pricesPacked: 4;
+    readonly version: 5;
+    readonly ancestorsRoot: 6;
+    readonly forkActivationSlot: 7;
+    readonly deviceCap: 8;
+    readonly retired: 9;
+    readonly successorX: 10;
+    readonly successorIsOdd: 11;
+    readonly payoutX: 12;
+    readonly payoutIsOdd: 13;
+    readonly pendingPayoutX: 14;
+    readonly pendingPayoutIsOdd: 15;
+    readonly pendingPayoutSlot: 16;
+    readonly platformX: 17;
+    readonly platformIsOdd: 18;
+    readonly treasuryX: 19;
+    readonly treasuryIsOdd: 20;
+    readonly platformEpoch: 21;
+    readonly vendorNonce: 22;
+    readonly networkId: 23;
+};
+export declare const KEY_TAGS: Readonly<Record<'PLATFORM_KEY' | 'PLATFORM_RECOVER' | 'VENDOR_KEY' | 'LICENSE_TRANSFER', Field>>;
+/**
+ * The platform's key (signs platform retires and cancels), its treasury
+ * (receives the 2%) and how many times they changed, as every app and
+ * registry holds them. A new contract starts with the current ones (the
+ * keeper checks them before listing it); a successor carries its
+ * predecessor's over, checked on chain.
+ */
+export declare const PlatformState: any;
+export type PlatformState = any;
+/**
+ * A change of the platform key and treasury: signed by the current platform
+ * key and the new one. Bound to the network and the next epoch, not to a
+ * contract, so one pair of signatures updates every app and registry on the
+ * network (anyone may send them; each contract takes it once).
+ */
+export declare function platformKeyMessage(a: {
+    network: Field;
+    epoch: UInt32;
+    key: PublicKey;
+    treasury: PublicKey;
+}): Field[];
+/**
+ * The same, signed by the offline recovery key alone (compiled into the
+ * circuits): it can always set a new platform key and treasury, lost or
+ * stolen, at any epoch above a contract's current one.
+ */
+export declare function platformRecoverMessage(a: {
+    network: Field;
+    epoch: UInt32;
+    key: PublicKey;
+    treasury: PublicKey;
+}): Field[];
+/** A new vendor key for an app: signed by the current vendor key and the new one; `nonce` is the app's vendorNonce. */
+export declare function vendorKeyMessage(a: {
+    network: Field;
+    app: PublicKey;
+    nonce: UInt32;
+    vendor: PublicKey;
+}): Field[];
+/**
+ * A license moving to a new owner key (`to` = ownerPubKeyHash of the new
+ * key): signed by the current owner key and the new one, over the license
+ * as it is now (its leaf hash) and a last slot it may land by.
+ */
+export declare function licenseTransferMessage(a: {
+    network: Field;
+    app: PublicKey;
+    leafHash: Field;
+    to: Field;
+    validUntil: UInt32;
+}): Field[];
+/**
+ * How long a new payout address waits before it takes effect: 48 hours at
+ * 90 s per slot. Payments keep going to the current one until it is
+ * applied, and the owner can cancel it meanwhile.
+ */
+export declare const PAYOUT_DELAY_SLOTS_N = 1920;
+/** A payout address was proposed; anyone may apply it from `effectiveSlot` on. */
+export declare const PayoutProposedEvent: any;
+export type PayoutProposedEvent = any;
+/** The payout address now in use (applied), or the pending one cancelled (`applied` false). */
+export declare const PayoutChangedEvent: any;
+export type PayoutChangedEvent = any;
+export declare const PlatformChangedEvent: any;
+export type PlatformChangedEvent = any;
+export declare const VendorChangedEvent: any;
+export type VendorChangedEvent = any;
+/**
+ * A license moved to a new owner key: the same leaf under `to`. `wallet` is
+ * the transaction's sender, the new owner's wallet that paid for it (as
+ * LicenseIssuedEvent's `buyer`), so a replay lists it under that wallet.
+ */
+export declare const LicenseTransferredEvent: any;
+export type LicenseTransferredEvent = any;
+export declare const DeviceBoundEvent: any;
+export type DeviceBoundEvent = any;
+export declare const DeviceUnboundEvent: any;
+export type DeviceUnboundEvent = any;
+import { MONTHLY_SLOTS_N, ONE_YEAR_SLOTS_N, FIVE_YEAR_SLOTS_N, PERPETUAL_SLOTS_N, REFUND_WINDOW_N, GRACE_PERIOD_N, MS_PER_SLOT_N, SLOTS_PER_DAY_N } from './slotConstants.js';
+export { MONTHLY_SLOTS_N, ONE_YEAR_SLOTS_N, FIVE_YEAR_SLOTS_N, PERPETUAL_SLOTS_N, REFUND_WINDOW_N, GRACE_PERIOD_N, MS_PER_SLOT_N, SLOTS_PER_DAY_N, };
+export declare const TOLERANCE_WINDOW_N = 40;
+export declare const MIGRATION_BUMP_LOOKBACK_N = 20160;
+/**
+ * A license's expiry as the app's contract treats it: a successor deployed
+ * across a Mina hardfork (forkActivationSlot > 0) starts with its
+ * predecessor's licenses, and a license that lapsed during the pre-fork
+ * freeze (expiry before the fork slot, but within grace + lookback of it)
+ * counts as expiring at the fork slot, so the 7-day grace runs from there.
+ * renewLicense applies the same rule in-circuit; verification uses this.
+ */
+export declare function effectiveExpirySlot(expirySlot: number, forkActivationSlot?: number): number;
+/**
+ * The fork bump shared by licenses and permits: an expiry before the fork
+ * slot, but within `grace` + MIGRATION_BUMP_LOOKBACK_N of it (it lapsed
+ * during the pre-fork freeze, when it couldn't be renewed), counts as
+ * expiring at the fork slot. Licenses use their 7-day grace, permits their
+ * registry's grace period.
+ */
+export declare function forkBumpedExpiry(expirySlot: number, forkActivationSlot: number, grace: number): number;
+export declare const EMPTY: Field;
+export declare const EMPTY_ROOT: Field;
+export declare const DURATION_LABELS: readonly ["1 Month", "1 Year", "5 Years", "Perpetual"];
+export type DurationLabel = typeof DURATION_LABELS[number];
+export declare const DURATION_INDEX: {
+    readonly '1 Month': 0;
+    readonly '1 Year': 1;
+    readonly '5 Years': 2;
+    readonly Perpetual: 3;
+};
+export declare function durationSlotsFromLabel(label?: string | null): number | null;
+export declare function durationIndexFromLabel(label?: string | null): number | null;
+export declare function durationLabelFromIndex(idx: number): DurationLabel | null;
+export declare class LicensingAppEventsContract extends SmartContract {
+    events: any;
+}
+export declare function unpackPrices(packed: Field): {
+    priceMonthly: UInt64;
+    priceYearly: UInt64;
+    priceFiveYear: UInt64;
+    pricePerpetual: UInt64;
+};
+export declare const SUPPORTED_LICENSING_APP_VERSIONS: readonly number[];
+export declare function fetchLicensingAppVersion(zkAppAddress: string): Promise<number | null>;
+export declare const CANONICAL_VK_HASHES: Readonly<Record<number, string>>;
+export declare const CURRENT_GENERATION: number;
+export declare const CANONICAL_VK_HASH: string;
+//# sourceMappingURL=contractInterface.d.ts.map

package/build/contractInterface.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"contractInterface.d.ts","sourceRoot":"","sources":["../src/contractInterface.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,IAAI,EAA8B,KAAK,EAAE,SAAS,EAAE,aAAa,EAAU,MAAM,EAAE,MAAM,EAAa,MAAM,MAAM,CAAC;AA8B5H,eAAO,MAAM,kBAAkB,EAAE,GAO/B,CAAC;AACH,MAAM,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAErC,eAAO,MAAM,iBAAiB,EAAE,GAG9B,CAAC;AACH,MAAM,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAEpC,eAAO,MAAM,iBAAiB,EAAE,GAK9B,CAAC;AACH,MAAM,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAEpC,eAAO,MAAM,eAAe,EAAE,GAM5B,CAAC;AACH,MAAM,MAAM,eAAe,GAAG,GAAG,CAAC;AAOlC,eAAO,MAAM,eAAe,EAAE,GAAwF,CAAC;AACvH,MAAM,MAAM,eAAe,GAAG,GAAG,CAAC;AAElC;;;;;GAKG;AACH,eAAO,MAAM,cAAc,EAAE,KAAkC,CAAC;AAChE,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,SAAS,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,GAAG,KAAK,EAAE,CAEhH;AAED;;;;GAIG;AACH,eAAO,MAAM,mBAAmB;;;;;;;;;;;;;;;;;;;;;;;;;CAOtB,CAAC;AAaX,eAAO,MAAM,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,cAAc,GAAG,kBAAkB,GAAG,YAAY,GAAG,kBAAkB,EAAE,KAAK,CAAC,CAKrH,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,aAAa,EAAE,GAAoE,CAAC;AACjG,MAAM,MAAM,aAAa,GAAG,GAAG,CAAC;AAEhC;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE;IAAE,OAAO,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,SAAS,CAAA;CAAE,GAAG,KAAK,EAAE,CAErH;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EAAE;IAAE,OAAO,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,SAAS,CAAA;CAAE,GAAG,KAAK,EAAE,CAEzH;AAED,uHAAuH;AACvH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE;IAAE,OAAO,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,SAAS,CAAA;CAAE,GAAG,KAAK,EAAE,CAEjH;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EAAE;IAAE,OAAO,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,KAAK,CAAC;IAAC,EAAE,EAAE,KAAK,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GAAG,KAAK,EAAE,CAErI;AAED;;;;GAIG;AACH,eAAO,MAAM,oBAAoB,OAAQ,CAAC;AAE1C,kFAAkF;AAClF,eAAO,MAAM,mBAAmB,EAAE,GAA0D,CAAC;AAC7F,MAAM,MAAM,mBAAmB,GAAG,GAAG,CAAC;AACtC,+FAA+F;AAC/F,eAAO,MAAM,kBAAkB,EAAE,GAAkD,CAAC;AACpF,MAAM,MAAM,kBAAkB,GAAG,GAAG,CAAC;AACrC,eAAO,MAAM,oBAAoB,EAAE,GAA2D,CAAC;AAC/F,MAAM,MAAM,oBAAoB,GAAG,GAAG,CAAC;AACvC,eAAO,MAAM,kBAAkB,EAAE,GAAkD,CAAC;AACpF,MAAM,MAAM,kBAAkB,GAAG,GAAG,CAAC;AACrC;;;;GAIG;AACH,eAAO,MAAM,uBAAuB,EAAE,GAA2D,CAAC;AAClG,MAAM,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAe1C,eAAO,MAAM,gBAAgB,EAAE,GAK7B,CAAC;AACH,MAAM,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAYnC,eAAO,MAAM,kBAAkB,EAAE,GAI/B,CAAC;AACH,MAAM,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAQrC,OAAO,EACL,eAAe,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,iBAAiB,EACvE,eAAe,EAAE,cAAc,EAAE,aAAa,EAAE,eAAe,EAChE,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,eAAe,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,iBAAiB,EACvE,eAAe,EAAE,cAAc,EAAE,aAAa,EAAE,eAAe,GAChE,CAAC;AASF,eAAO,MAAM,kBAAkB,KAAK,CAAC;AASrC,eAAO,MAAM,yBAAyB,QAAS,CAAC;AAEhD;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,kBAAkB,SAAI,GAAG,MAAM,CAEtF;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAGtG;AAED,eAAO,MAAM,KAAK,EAAE,KAAqB,CAAC;AAC1C,eAAO,MAAM,UAAU,EAAE,KAAiC,CAAC;AAM3D,eAAO,MAAM,eAAe,wDAAyD,CAAC;AACtF,MAAM,MAAM,aAAa,GAAG,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;AAE3D,eAAO,MAAM,cAAc;;;;;CAAuE,CAAC;AAEnG,wBAAgB,sBAAsB,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAM3E;AAED,wBAAgB,sBAAsB,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAM3E;AAED,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI,CAExE;AAUD,qBAAa,0BAA2B,SAAQ,aAAa;IAC3D,MAAM,EAAE,GAAG,CAgBT;CACH;AAiCD,wBAAgB,YAAY,CAAC,MAAM,EAAE,KAAK,GAAG;IAC3C,YAAY,EAAI,MAAM,CAAC;IACvB,WAAW,EAAK,MAAM,CAAC;IACvB,aAAa,EAAG,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;CACxB,CASA;AAgBD,eAAO,MAAM,gCAAgC,EAAE,SAAS,MAAM,EAAQ,CAAC;AAKvE,wBAAsB,wBAAwB,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAU3F;AAuBD,eAAO,MAAM,mBAAmB,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAGhE,CAAC;AAEF,eAAO,MAAM,kBAAkB,EAAE,MAAU,CAAC;AAE5C,eAAO,MAAM,iBAAiB,EAAE,MAAgD,CAAC"}