@int-loop/core 0.0.0-stage → 0.2.0

package/LICENSE

@@ -0,0 +1,59 @@
+Copyright 2026 Captivated Ltd
+
+Licensed under the Apache License, Version 2.0 (the full text follows).
+
+Apache License
+
+Version 2.0, January 2004
+
+http://www.apache.org/licenses/ 
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
+
+"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below).
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
+
+You must give any other recipients of the Work or Derivative Works a copy of this License; and
+
+You must cause any modified files to carry prominent notices stating that You changed the files; and
+
+You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
+
+If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS

package/README.md

@@ -1,3 +1,23 @@
-# Temporary Holding Version
+# @int-loop/core
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+The shared code behind [int-loop](https://int-loop.com), the approval service for AI agents, and its offline verifier.
+
+- Request, decision, ledger and receipt schemas (zod)
+- RFC 8785 (JCS) canonicalisation and SHA-256 helpers
+- Passkey (WebAuthn) binding construction and assertion verification
+- Offline verification of ledgers, evidence packs and receipts
+
+It has no I/O and no platform-specific APIs, so it runs in Node, browsers and Workers alike. Most people want the CLI, [`@int-loop/verify`](https://www.npmjs.com/package/@int-loop/verify).
+
+```ts
+import { verifyReceipt } from "@int-loop/core";
+
+const report = await verifyReceipt(receiptJson, trustedKeys, {
+  documents: { article: articleBytes },
+});
+if (!report.ok) throw new Error("not approved");
+```
+
+`trustedKeys` is int-loop's published key list, from `https://int-loop.com/.well-known/int-loop-keys.json`. Fetch it once and pin it.
+
+Licensed under Apache-2.0.

package/dist/anchor.d.ts

@@ -0,0 +1,70 @@
+import { z } from "zod";
+import type { LedgerEntry } from "./schema/ledger.ts";
+import type { VerificationFailure } from "./verify.ts";
+export declare const ANCHOR_LEAF_TYPE = "int-loop.anchor-leaf/1";
+export declare const AnchorTimestamp: z.ZodObject<{
+    tsa: z.ZodString;
+    token: z.ZodString;
+    gen_time: z.ZodISODateTime;
+}, z.core.$strict>;
+export type AnchorTimestamp = z.infer<typeof AnchorTimestamp>;
+export declare const AnchorCreatedPayload: z.ZodObject<{
+    anchored: z.ZodObject<{
+        seq: z.ZodNumber;
+        entry_hash: z.ZodString;
+    }, z.core.$strict>;
+    merkle: z.ZodObject<{
+        root: z.ZodString;
+        leaf_index: z.ZodNumber;
+        tree_size: z.ZodNumber;
+        path: z.ZodArray<z.ZodString>;
+    }, z.core.$strict>;
+    timestamps: z.ZodArray<z.ZodObject<{
+        tsa: z.ZodString;
+        token: z.ZodString;
+        gen_time: z.ZodISODateTime;
+    }, z.core.$strict>>;
+}, z.core.$strict>;
+export type AnchorCreatedPayload = z.infer<typeof AnchorCreatedPayload>;
+export type AnchorLeaf = {
+    tenant_id: string;
+    seq: number;
+    entry_hash: string;
+};
+export declare const AnchorLeafSchema: z.ZodObject<{
+    tenant_id: z.ZodString;
+    seq: z.ZodNumber;
+    entry_hash: z.ZodString;
+}, z.core.$strict>;
+export declare function anchorLeafHash(leaf: AnchorLeaf): Promise<Uint8Array<ArrayBuffer>>;
+export declare function merkleRoot(leafHashes: readonly Uint8Array[]): Promise<Uint8Array<ArrayBuffer>>;
+/** The inclusion path for leaf `index`, nearest sibling first. */
+export declare function merklePath(leafHashes: readonly Uint8Array[], index: number): Promise<Uint8Array<ArrayBuffer>[]>;
+/** Recomputes the root from a leaf and its path (RFC 9162 2.1.3.2), or null if the path does not fit the tree. */
+export declare function rootFromPath(leafHash: Uint8Array, index: number, size: number, path: readonly Uint8Array[]): Promise<Uint8Array | null>;
+/**
+ * The tree for one anchoring round: one leaf per tenant, in tenant order. Returns the root
+ * to stamp, and each tenant's anchor.created payload once the stamps are in.
+ */
+export declare function anchorTree(leaves: readonly AnchorLeaf[]): Promise<{
+    root: Uint8Array<ArrayBuffer>;
+    payload: (tenantId: string, timestamps: AnchorTimestamp[]) => Promise<AnchorCreatedPayload>;
+}>;
+/** How far a TSA's clock may disagree with int-loop's before the verifier objects. */
+export declare const ANCHOR_CLOCK_TOLERANCE_MS: number;
+export type AnchorReport = {
+    anchors_checked: number;
+    /** The newest anchored entry and the earliest time a TSA vouches it existed. */
+    anchored_through: {
+        seq: number;
+        gen_time: string;
+        tsas: string[];
+    } | null;
+    failures: VerificationFailure[];
+};
+/**
+ * Checks every anchor.created entry: the anchored entry is in the ledger with that hash,
+ * its leaf leads to the stamped root, and every timestamp token verifies against `roots`
+ * for that root, at a time consistent with when the entries were recorded.
+ */
+export declare function verifyAnchors(entries: readonly LedgerEntry[], roots: readonly Uint8Array[]): Promise<AnchorReport>;

package/dist/anchor.js

@@ -0,0 +1,201 @@
+// Anchoring: once an hour, each tenant's latest ledger entry is timestamped by
+// independent RFC 3161 timestamp authorities, so not even int-loop can rewrite
+// history afterwards without it showing.
+//
+// One stamp covers every tenant. The heads are the leaves of a Merkle tree (RFC 9162
+// hashing, domain-separated leaves and nodes); the TSAs stamp the root, and each
+// tenant's anchor.created entry records its own leaf's path to that root. A tenant's
+// evidence pack therefore proves its own chain head existed at the stamped time and
+// reveals nothing about other tenants beyond opaque sibling hashes.
+import { z } from "zod";
+import { canonicalise } from "./jcs.js";
+import { concatBytes, fromBase64Url, fromHex, sha256, toHex, utf8 } from "./hash.js";
+import { Base64Url, Sha256Hex, TenantId, Timestamp } from "./schema/common.js";
+import { verifyTimestampToken } from "./tsp.js";
+export const ANCHOR_LEAF_TYPE = "int-loop.anchor-leaf/1";
+export const AnchorTimestamp = z.strictObject({
+    /** Which TSA, e.g. "freetsa". Informational: trust comes from the token's certificate chain. */
+    tsa: z.string().regex(/^[a-z][a-z0-9-]{0,31}$/),
+    /** The DER TimeStampToken. */
+    token: Base64Url,
+    /** The time inside the token, repeated for readers; the verifier checks they agree. */
+    gen_time: Timestamp,
+});
+export const AnchorCreatedPayload = z.strictObject({
+    anchored: z.strictObject({ seq: z.number().int().positive(), entry_hash: Sha256Hex }),
+    merkle: z.strictObject({
+        root: Sha256Hex,
+        leaf_index: z.number().int().nonnegative(),
+        tree_size: z.number().int().positive(),
+        path: z.array(Sha256Hex).max(64),
+    }),
+    timestamps: z.array(AnchorTimestamp).min(1).max(8),
+});
+export const AnchorLeafSchema = z.strictObject({ tenant_id: TenantId, seq: z.number().int().positive(), entry_hash: Sha256Hex });
+// ---- Merkle tree (RFC 9162 section 2.1) ----------------------------------------------
+export async function anchorLeafHash(leaf) {
+    const body = utf8(canonicalise({ type: ANCHOR_LEAF_TYPE, tenant_id: leaf.tenant_id, seq: leaf.seq, entry_hash: leaf.entry_hash }));
+    return sha256(concatBytes(Uint8Array.of(0), body));
+}
+const node = (left, right) => sha256(concatBytes(Uint8Array.of(1), left, right));
+/** The largest power of two smaller than n (n > 1). */
+const split = (n) => 2 ** Math.floor(Math.log2(n - 1));
+export async function merkleRoot(leafHashes) {
+    if (leafHashes.length === 0)
+        throw new Error("a Merkle tree needs at least one leaf");
+    if (leafHashes.length === 1)
+        return new Uint8Array(leafHashes[0]);
+    const k = split(leafHashes.length);
+    return node(await merkleRoot(leafHashes.slice(0, k)), await merkleRoot(leafHashes.slice(k)));
+}
+/** The inclusion path for leaf `index`, nearest sibling first. */
+export async function merklePath(leafHashes, index) {
+    if (index < 0 || index >= leafHashes.length)
+        throw new Error("leaf index out of range");
+    if (leafHashes.length === 1)
+        return [];
+    const k = split(leafHashes.length);
+    return index < k
+        ? [...(await merklePath(leafHashes.slice(0, k), index)), await merkleRoot(leafHashes.slice(k))]
+        : [...(await merklePath(leafHashes.slice(k), index - k)), await merkleRoot(leafHashes.slice(0, k))];
+}
+/** Recomputes the root from a leaf and its path (RFC 9162 2.1.3.2), or null if the path does not fit the tree. */
+export async function rootFromPath(leafHash, index, size, path) {
+    if (index >= size)
+        return null;
+    let fn = index;
+    let sn = size - 1;
+    let r = leafHash;
+    for (const p of path) {
+        if (sn === 0)
+            return null;
+        if (fn % 2 === 1 || fn === sn) {
+            r = await node(p, r);
+            while (fn % 2 === 0 && fn !== 0) {
+                fn = Math.floor(fn / 2);
+                sn = Math.floor(sn / 2);
+            }
+        }
+        else {
+            r = await node(r, p);
+        }
+        fn = Math.floor(fn / 2);
+        sn = Math.floor(sn / 2);
+    }
+    return sn === 0 ? r : null;
+}
+/**
+ * The tree for one anchoring round: one leaf per tenant, in tenant order. Returns the root
+ * to stamp, and each tenant's anchor.created payload once the stamps are in.
+ */
+export async function anchorTree(leaves) {
+    const sorted = [...leaves].map((l) => AnchorLeafSchema.parse(l)).sort((a, b) => (a.tenant_id < b.tenant_id ? -1 : a.tenant_id > b.tenant_id ? 1 : 0));
+    for (let i = 1; i < sorted.length; i++)
+        if (sorted[i].tenant_id === sorted[i - 1].tenant_id)
+            throw new Error(`two leaves for ${sorted[i].tenant_id}`);
+    const hashes = await Promise.all(sorted.map((l) => anchorLeafHash(l)));
+    const root = await merkleRoot(hashes);
+    return {
+        root,
+        payload: async (tenantId, timestamps) => {
+            const index = sorted.findIndex((l) => l.tenant_id === tenantId);
+            if (index < 0)
+                throw new Error(`no leaf for ${tenantId}`);
+            const leaf = sorted[index];
+            return AnchorCreatedPayload.parse({
+                anchored: { seq: leaf.seq, entry_hash: leaf.entry_hash },
+                merkle: { root: toHex(root), leaf_index: index, tree_size: sorted.length, path: (await merklePath(hashes, index)).map(toHex) },
+                timestamps,
+            });
+        },
+    };
+}
+// ---- Verification -----------------------------------------------------------------------
+/** How far a TSA's clock may disagree with int-loop's before the verifier objects. */
+export const ANCHOR_CLOCK_TOLERANCE_MS = 5 * 60_000;
+/**
+ * Checks every anchor.created entry: the anchored entry is in the ledger with that hash,
+ * its leaf leads to the stamped root, and every timestamp token verifies against `roots`
+ * for that root, at a time consistent with when the entries were recorded.
+ */
+export async function verifyAnchors(entries, roots) {
+    const failures = [];
+    const bySeq = new Map(entries.map((e) => [e.seq, e]));
+    let anchors_checked = 0;
+    let anchored_through = null;
+    for (const entry of entries) {
+        if (entry.type !== "anchor.created")
+            continue;
+        anchors_checked++;
+        const fail = (check, message) => failures.push({ seq: entry.seq, check, message });
+        try {
+            const parsed = AnchorCreatedPayload.safeParse(entry.payload);
+            if (!parsed.success) {
+                fail("anchor", parsed.error.issues.map((i) => i.message).join("; "));
+                continue;
+            }
+            const p = parsed.data;
+            const anchored = bySeq.get(p.anchored.seq);
+            if (p.anchored.seq >= entry.seq) {
+                fail("anchor", "an anchor can only cover entries recorded before it");
+                continue;
+            }
+            if (!anchored) {
+                fail("anchor", `anchored entry ${p.anchored.seq} is not in this ledger`);
+                continue;
+            }
+            if (anchored.entry_hash !== p.anchored.entry_hash) {
+                fail("anchor", `anchored hash does not match entry ${p.anchored.seq}`);
+                continue;
+            }
+            const leaf = await anchorLeafHash({ tenant_id: entry.tenant_id, seq: p.anchored.seq, entry_hash: p.anchored.entry_hash });
+            const root = await rootFromPath(leaf, p.merkle.leaf_index, p.merkle.tree_size, p.merkle.path.map(fromHex));
+            if (root === null || toHex(root) !== p.merkle.root) {
+                fail("anchor", "the anchored entry is not in the stamped Merkle tree");
+                continue;
+            }
+            // Labels are the recorder's word; independence is judged by the root each token chains to.
+            const tsas = new Set();
+            const rootsUsed = new Map();
+            const verified = [];
+            let earliest = null;
+            for (const ts of p.timestamps) {
+                const problems = [];
+                if (tsas.has(ts.tsa))
+                    problems.push(`two timestamps from ${ts.tsa}`);
+                tsas.add(ts.tsa);
+                const result = await verifyTimestampToken(fromBase64Url(ts.token), { digest: fromHex(p.merkle.root), roots });
+                if (!result.ok) {
+                    fail("timestamp", `${ts.tsa}: ${result.reason}`);
+                    continue;
+                }
+                const at = Date.parse(result.gen_time);
+                if (at !== Date.parse(ts.gen_time))
+                    problems.push(`recorded time ${ts.gen_time} differs from the token's ${result.gen_time}`);
+                if (at < Date.parse(anchored.recorded_at) - ANCHOR_CLOCK_TOLERANCE_MS)
+                    problems.push(`stamped before entry ${anchored.seq} was recorded`);
+                if (at > Date.parse(entry.recorded_at) + ANCHOR_CLOCK_TOLERANCE_MS)
+                    problems.push("stamped after the anchor itself was recorded");
+                const sameRoot = rootsUsed.get(result.root_sha256);
+                if (sameRoot !== undefined)
+                    problems.push(`chains to the same root as ${sameRoot}, so it is not an independent timestamp`);
+                rootsUsed.set(result.root_sha256, ts.tsa);
+                // Only a timestamp with nothing wrong counts towards what the anchor proves.
+                if (problems.length) {
+                    for (const m of problems)
+                        fail("timestamp", `${ts.tsa}: ${m}`);
+                    continue;
+                }
+                verified.push(ts.tsa);
+                earliest = earliest === null ? at : Math.min(earliest, at);
+            }
+            if (earliest !== null && (anchored_through === null || p.anchored.seq >= anchored_through.seq)) {
+                anchored_through = { seq: p.anchored.seq, gen_time: new Date(earliest).toISOString(), tsas: verified };
+            }
+        }
+        catch (err) {
+            fail("internal", err instanceof Error ? err.message : String(err));
+        }
+    }
+    return { anchors_checked, anchored_through, failures };
+}

package/dist/binding.d.ts

@@ -0,0 +1,103 @@
+import { z } from "zod";
+import { Fact } from "./schema/request.ts";
+/** Exactly what the approval page rendered. Hashed to `displayed_hash`. */
+export declare const DisplayedContent: z.ZodObject<{
+    title: z.ZodString;
+    facts: z.ZodArray<z.ZodDiscriminatedUnion<[z.ZodObject<{
+        key: z.ZodString;
+        label: z.ZodString;
+        type: z.ZodLiteral<"money">;
+        value: z.ZodObject<{
+            amount_minor: z.ZodNumber;
+            currency: z.ZodString;
+        }, z.core.$strict>;
+    }, z.core.$strict>, z.ZodObject<{
+        key: z.ZodString;
+        label: z.ZodString;
+        type: z.ZodLiteral<"text">;
+        value: z.ZodString;
+    }, z.core.$strict>, z.ZodObject<{
+        key: z.ZodString;
+        label: z.ZodString;
+        type: z.ZodLiteral<"date">;
+        value: z.ZodUnion<readonly [z.ZodISODate, z.ZodISODateTime]>;
+    }, z.core.$strict>, z.ZodObject<{
+        key: z.ZodString;
+        label: z.ZodString;
+        type: z.ZodLiteral<"enum">;
+        value: z.ZodString;
+        choices: z.ZodOptional<z.ZodArray<z.ZodString>>;
+    }, z.core.$strict>, z.ZodObject<{
+        key: z.ZodString;
+        label: z.ZodString;
+        type: z.ZodLiteral<"list">;
+        value: z.ZodArray<z.ZodString>;
+    }, z.core.$strict>, z.ZodObject<{
+        key: z.ZodString;
+        label: z.ZodString;
+        type: z.ZodLiteral<"url">;
+        value: z.ZodURL;
+    }, z.core.$strict>, z.ZodObject<{
+        key: z.ZodString;
+        label: z.ZodString;
+        type: z.ZodLiteral<"count">;
+        value: z.ZodNumber;
+    }, z.core.$strict>, z.ZodObject<{
+        key: z.ZodString;
+        label: z.ZodString;
+        type: z.ZodLiteral<"document">;
+        value: z.ZodObject<{
+            media_type: z.ZodEnum<{
+                "text/markdown": "text/markdown";
+                "text/plain": "text/plain";
+            }>;
+            body: z.ZodString;
+        }, z.core.$strict>;
+    }, z.core.$strict>], "type">>;
+    narrative: z.ZodString;
+    options: z.ZodArray<z.ZodObject<{
+        id: z.ZodString;
+        label: z.ZodString;
+        kind: z.ZodEnum<{
+            approve: "approve";
+            approve_with_conditions: "approve_with_conditions";
+            choose: "choose";
+            deny: "deny";
+            more_info: "more_info";
+        }>;
+    }, z.core.$strict>>;
+    policy_reason: z.ZodArray<z.ZodString>;
+    clarifications: z.ZodOptional<z.ZodArray<z.ZodObject<{
+        question: z.ZodString;
+        answer: z.ZodString;
+    }, z.core.$strict>>>;
+}, z.core.$strict>;
+export type DisplayedContent = z.infer<typeof DisplayedContent>;
+export declare const ComprehensionAnswer: z.ZodObject<{
+    question_id: z.ZodString;
+    answer: z.ZodString;
+}, z.core.$strict>;
+export declare const BindingInput: z.ZodObject<{
+    request_id: z.ZodString;
+    request_version: z.ZodNumber;
+    displayed_hash: z.ZodString;
+    option_id: z.ZodString;
+    rationale_hash: z.ZodNullable<z.ZodString>;
+    text_hash: z.ZodNullable<z.ZodString>;
+    comprehension: z.ZodNullable<z.ZodObject<{
+        question_id: z.ZodString;
+        answer: z.ZodString;
+    }, z.core.$strict>>;
+    approver_id: z.ZodString;
+    nonce: z.ZodString;
+    issued_at: z.ZodISODateTime;
+}, z.core.$strict>;
+export type BindingInput = z.infer<typeof BindingInput>;
+/**
+ * SHA-256 (hex) of each document fact's body, as UTF-8, keyed by fact key. A publisher checks
+ * the bytes it is about to ship against this value.
+ */
+export declare function documentHashes(facts: readonly Fact[]): Promise<Record<string, string>>;
+export declare function displayedHash(content: DisplayedContent): Promise<string>;
+/** The 32-byte WebAuthn challenge: SHA-256(JCS(binding)). */
+export declare function bindingChallenge(input: BindingInput): Promise<Uint8Array<ArrayBuffer>>;

package/dist/binding.js

@@ -0,0 +1,54 @@
+// Passkey binding: the WebAuthn challenge commits to exactly what the approver
+// saw and chose, so the assertion proves the holder of that passkey approved
+// that payload and nothing else. See "Passkey binding" in CLAUDE.md.
+import { z } from "zod";
+import { hashCanonical, hashCanonicalHex, hashTextHex } from "./hash.js";
+import { Base64Url, PersonId, RequestId, Sha256Hex, Slug, Timestamp } from "./schema/common.js";
+import { Fact, Option } from "./schema/request.js";
+/** Exactly what the approval page rendered. Hashed to `displayed_hash`. */
+export const DisplayedContent = z.strictObject({
+    title: z.string(),
+    facts: z.array(Fact),
+    narrative: z.string(),
+    options: z.array(Option),
+    // "Why you're receiving this": the names of the matching policy rules.
+    policy_reason: z.array(z.string()),
+    // Questions approvers asked and the agent's answers, from earlier versions.
+    clarifications: z.array(z.strictObject({ question: z.string(), answer: z.string() })).optional(),
+});
+export const ComprehensionAnswer = z.strictObject({
+    question_id: z.string().min(1),
+    answer: z.string(),
+});
+export const BindingInput = z.strictObject({
+    request_id: RequestId,
+    request_version: z.number().int().positive(),
+    displayed_hash: Sha256Hex,
+    option_id: Slug,
+    rationale_hash: Sha256Hex.nullable(),
+    // The approver's conditions (approve_with_conditions) or question (more_info).
+    text_hash: Sha256Hex.nullable(),
+    comprehension: ComprehensionAnswer.nullable(),
+    approver_id: PersonId,
+    // Server-issued, single use: 32 random bytes, base64url.
+    nonce: Base64Url.min(43),
+    issued_at: Timestamp,
+});
+/**
+ * SHA-256 (hex) of each document fact's body, as UTF-8, keyed by fact key. A publisher checks
+ * the bytes it is about to ship against this value.
+ */
+export async function documentHashes(facts) {
+    const out = {};
+    for (const f of facts)
+        if (f.type === "document")
+            out[f.key] = await hashTextHex(f.value.body);
+    return out;
+}
+export async function displayedHash(content) {
+    return hashCanonicalHex(DisplayedContent.parse(content));
+}
+/** The 32-byte WebAuthn challenge: SHA-256(JCS(binding)). */
+export async function bindingChallenge(input) {
+    return hashCanonical(BindingInput.parse(input));
+}

package/dist/cbor.d.ts

@@ -0,0 +1,11 @@
+export type CborValue = number | Uint8Array | string | boolean | null | CborValue[] | Map<CborValue, CborValue>;
+export declare class CborError extends Error {
+    name: string;
+}
+/** Decodes exactly one CBOR item and rejects trailing bytes. */
+export declare function decodeCbor(bytes: Uint8Array): CborValue;
+/** Decodes the first CBOR item and reports how many bytes it used. */
+export declare function decodeCborPrefix(bytes: Uint8Array): {
+    value: CborValue;
+    length: number;
+};

package/dist/cbor.js

@@ -0,0 +1,94 @@
+// Minimal CBOR decoder (RFC 8949), enough to read a COSE_Key: unsigned and
+// negative integers, byte and text strings, arrays, maps, and true/false/null.
+// Indefinite lengths, tags and floats are rejected, as no COSE_Key uses them.
+export class CborError extends Error {
+    name = "CborError";
+}
+const decoder = new TextDecoder("utf-8", { fatal: true, ignoreBOM: false });
+/** Decodes exactly one CBOR item and rejects trailing bytes. */
+export function decodeCbor(bytes) {
+    const { value, length } = decodeCborPrefix(bytes);
+    if (length !== bytes.length)
+        throw new CborError("trailing bytes after CBOR item");
+    return value;
+}
+/** Decodes the first CBOR item and reports how many bytes it used. */
+export function decodeCborPrefix(bytes) {
+    const state = { bytes, pos: 0 };
+    const value = readItem(state, 0);
+    return { value, length: state.pos };
+}
+function readByte(s) {
+    const b = s.bytes[s.pos];
+    if (b === undefined)
+        throw new CborError("unexpected end of CBOR data");
+    s.pos++;
+    return b;
+}
+function readLength(s, info) {
+    if (info < 24)
+        return info;
+    const size = info === 24 ? 1 : info === 25 ? 2 : info === 26 ? 4 : info === 27 ? 8 : 0;
+    if (size === 0)
+        throw new CborError(`unsupported additional info ${info}`);
+    let n = 0;
+    for (let i = 0; i < size; i++)
+        n = n * 256 + readByte(s);
+    if (!Number.isSafeInteger(n))
+        throw new CborError("CBOR integer exceeds safe range");
+    return n;
+}
+function readBytes(s, len) {
+    if (s.pos + len > s.bytes.length)
+        throw new CborError("unexpected end of CBOR data");
+    const out = s.bytes.slice(s.pos, s.pos + len);
+    s.pos += len;
+    return out;
+}
+function readItem(s, depth) {
+    if (depth > 16)
+        throw new CborError("CBOR nesting too deep");
+    const initial = readByte(s);
+    const major = initial >> 5;
+    const info = initial & 0x1f;
+    switch (major) {
+        case 0:
+            return readLength(s, info);
+        case 1:
+            return -1 - readLength(s, info);
+        case 2:
+            return readBytes(s, readLength(s, info));
+        case 3:
+            return decoder.decode(readBytes(s, readLength(s, info)));
+        case 4: {
+            const len = readLength(s, info);
+            const arr = [];
+            for (let i = 0; i < len; i++)
+                arr.push(readItem(s, depth + 1));
+            return arr;
+        }
+        case 5: {
+            const len = readLength(s, info);
+            const map = new Map();
+            for (let i = 0; i < len; i++) {
+                const key = readItem(s, depth + 1);
+                if (typeof key !== "number" && typeof key !== "string")
+                    throw new CborError("CBOR map keys must be integers or text");
+                if (map.has(key))
+                    throw new CborError(`duplicate CBOR map key ${key}`);
+                map.set(key, readItem(s, depth + 1));
+            }
+            return map;
+        }
+        case 7:
+            if (info === 20)
+                return false;
+            if (info === 21)
+                return true;
+            if (info === 22)
+                return null;
+            throw new CborError(`unsupported CBOR simple value ${info}`);
+        default:
+            throw new CborError(`unsupported CBOR major type ${major}`);
+    }
+}

package/dist/comprehension.d.ts

@@ -0,0 +1,12 @@
+import type { Fact } from "./schema/request.ts";
+export type ComprehensionQuestion = {
+    question_id: string;
+    fact_key: string;
+    prompt: string;
+    /** Formatted values, in display order. Exactly one is correct. */
+    choices: string[];
+    answer: string;
+};
+/** Facts a question can be built from: values with plausible wrong answers. */
+export declare function comprehensionFacts(facts: readonly Fact[]): Fact[];
+export declare function comprehensionQuestion(facts: readonly Fact[], seed: string, format: (f: Fact) => string): Promise<ComprehensionQuestion | null>;