@mikeargento/bitgraph-mcp 0.6.0 → 0.7.1

package/dist/carrier-io.d.ts

@@ -1,52 +0,0 @@
-import { type CarrierVerifyResult } from "@mikeargento/bitgraph-verify";
-/** The window as the tools state it. not_after null = NOT FETCHED, in those words. */
-export interface CarrierWindowView {
-    verdict: "TRUE" | "FALSE" | "UNDETERMINED";
-    not_before: {
-        block: number;
-        hash: string;
-        time: string | null;
-    } | null;
-    /** null when the ceiling has not been fetched into the file yet. */
-    not_after: {
-        block: number;
-        hash: string;
-        time: string | null;
-    } | null;
-    ceiling: "present" | "unfetched" | null;
-    reasons: string[];
-}
-export declare function carrierWindowView(r: CarrierVerifyResult): CarrierWindowView;
-/**
- * One line for a markdown row: the verdict and the window, in the stated
- * words. The floor is temporal (after the block's own time, cryptographically);
- * the ceiling is POSITIONAL: committed before the ANCHORING of the later
- * block, never before that block's mine time, because an anchor is built
- * after the block it carries. Canon §3.5/§3.6: floor in time, ceiling in
- * position; converting the positional ceiling into a clock reading is the
- * one error.
- */
-export declare function carrierLine(view: CarrierWindowView): string;
-/**
- * True when the file's last 8 bytes are the carrier magic. One positioned
- * read; no file that is not a carrier pays more than that.
- */
-export declare function sniffCarrierTail(path: string, size: number): Promise<boolean>;
-export interface CarrierFileResult {
-    /** "ok": readable block, judged. "corrupt": block found but unreadable. */
-    status: "ok" | "corrupt";
-    /** Standard base64 SHA-256 of the COMMITTED bytes inside; the digest every lookup uses. */
-    innerDigestB64: string | null;
-    /** The committed bytes, for callers that go on to sniff or serve them. */
-    inner: Uint8Array | null;
-    result: CarrierVerifyResult | null;
-    view: CarrierWindowView | null;
-    corruptReason: string | null;
-}
-/**
- * Read a tail-confirmed carrier whole and judge it offline: the carried
- * proof, the floor by identity, the witnesses, the ceiling when present.
- * Proof-level judgment (attestation depth stays the audit CLI's job).
- */
-export declare function readCarrierFile(path: string): Promise<CarrierFileResult>;
-//# sourceMappingURL=carrier-io.d.ts.map

package/dist/carrier-io.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"carrier-io.d.ts","sourceRoot":"","sources":["../src/carrier-io.ts"],"names":[],"mappings":"AAkBA,OAAO,EAEL,KAAK,mBAAmB,EACzB,MAAM,8BAA8B,CAAC;AAKtC,sFAAsF;AACtF,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,MAAM,GAAG,OAAO,GAAG,cAAc,CAAC;IAC3C,UAAU,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,GAAG,IAAI,CAAC;IACxE,oEAAoE;IACpE,SAAS,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,GAAG,IAAI,CAAC;IACvE,OAAO,EAAE,SAAS,GAAG,WAAW,GAAG,IAAI,CAAC;IACxC,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,mBAAmB,GAAG,iBAAiB,CAQ3E;AAED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,iBAAiB,GAAG,MAAM,CAS3D;AAED;;;GAGG;AACH,wBAAsB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAUnF;AAED,MAAM,WAAW,iBAAiB;IAChC,2EAA2E;IAC3E,MAAM,EAAE,IAAI,GAAG,SAAS,CAAC;IACzB,2FAA2F;IAC3F,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,0EAA0E;IAC1E,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC;IACzB,MAAM,EAAE,mBAAmB,GAAG,IAAI,CAAC;IACnC,IAAI,EAAE,iBAAiB,GAAG,IAAI,CAAC;IAC/B,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;CAC9B;AAED;;;;GAIG;AACH,wBAAsB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAoB9E"}

package/dist/carrier-io.js

@@ -1,91 +0,0 @@
-// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
-/**
- * @mikeargento/bitgraph-mcp: BitGraphed files (bitgraph-carrier/1).
- *
- * A BitGraphed file is committed bytes followed by one structural block that
- * carries the proof and the anchor evidence. The block is found from the END
- * of the file, by structure, never by scanning. Everything here is local:
- * an 8-byte tail read decides whether a file is a carrier at all, and the
- * full judgment runs offline through @mikeargento/bitgraph-verify.
- *
- * The one rule that cannot bend: the envelope is never the recorded thing,
- * the bytes inside it are. So the tools look up the INNER digest, and
- * bitgraph_record never mints carrier bytes, the same structural guarantee
- * the site's drop box gives.
- */
-import { open } from "node:fs/promises";
-import { CARRIER_MAGIC, CARRIER_OVERHEAD, parseCarrier, verifyCarrier, } from "@mikeargento/bitgraph-verify";
-/** ISO string for a witness timestamp (seconds), or null when the header was unreadable. */
-const iso = (ts) => (ts === null ? null : new Date(ts * 1000).toISOString());
-export function carrierWindowView(r) {
-    return {
-        verdict: r.verdict,
-        not_before: r.bounds ? { block: r.bounds.notBefore.blockNumber, hash: r.bounds.notBefore.blockHash, time: iso(r.bounds.notBefore.timestamp) } : null,
-        not_after: r.bounds?.notAfter ? { block: r.bounds.notAfter.blockNumber, hash: r.bounds.notAfter.blockHash, time: iso(r.bounds.notAfter.timestamp) } : null,
-        ceiling: r.ceiling,
-        reasons: r.reasons,
-    };
-}
-/**
- * One line for a markdown row: the verdict and the window, in the stated
- * words. The floor is temporal (after the block's own time, cryptographically);
- * the ceiling is POSITIONAL: committed before the ANCHORING of the later
- * block, never before that block's mine time, because an anchor is built
- * after the block it carries. Canon §3.5/§3.6: floor in time, ceiling in
- * position; converting the positional ceiling into a clock reading is the
- * one error.
- */
-export function carrierLine(view) {
-    const parts = [`carried proof ${view.verdict}`];
-    if (view.not_before)
-        parts.push(`after block ${view.not_before.block}${view.not_before.time ? ` (mined ${view.not_before.time})` : ""}`);
-    parts.push(view.not_after
-        ? `before the anchoring of block ${view.not_after.block}${view.not_after.time ? ` (block mined ${view.not_after.time})` : ""}`
-        : "closing anchor NOT FETCHED (drop the file on bitgraph.ing to complete it)");
-    return parts.join(" · ");
-}
-/**
- * True when the file's last 8 bytes are the carrier magic. One positioned
- * read; no file that is not a carrier pays more than that.
- */
-export async function sniffCarrierTail(path, size) {
-    if (size < CARRIER_OVERHEAD)
-        return false;
-    const fd = await open(path, "r");
-    try {
-        const tail = Buffer.alloc(CARRIER_MAGIC.length);
-        await fd.read(tail, 0, tail.length, size - tail.length);
-        return tail.equals(Buffer.from(CARRIER_MAGIC));
-    }
-    finally {
-        await fd.close();
-    }
-}
-/**
- * Read a tail-confirmed carrier whole and judge it offline: the carried
- * proof, the floor by identity, the witnesses, the ceiling when present.
- * Proof-level judgment (attestation depth stays the audit CLI's job).
- */
-export async function readCarrierFile(path) {
-    const fd = await open(path, "r");
-    let bytes;
-    try {
-        const info = await fd.stat();
-        const buf = Buffer.alloc(info.size);
-        await fd.read(buf, 0, info.size, 0);
-        bytes = new Uint8Array(buf);
-    }
-    finally {
-        await fd.close();
-    }
-    const parsed = parseCarrier(bytes);
-    if (parsed.kind !== "carrier") {
-        const reason = parsed.kind === "corrupt" ? parsed.reason : "the tail magic matched but no block parsed";
-        return { status: "corrupt", innerDigestB64: null, inner: null, result: null, view: null, corruptReason: reason };
-    }
-    const result = await verifyCarrier(bytes);
-    const { createHash } = await import("node:crypto");
-    const innerDigestB64 = createHash("sha256").update(parsed.inner).digest("base64");
-    return { status: "ok", innerDigestB64, inner: parsed.inner, result, view: carrierWindowView(result), corruptReason: null };
-}
-//# sourceMappingURL=carrier-io.js.map

package/dist/carrier-io.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"carrier-io.js","sourceRoot":"","sources":["../src/carrier-io.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAE9F;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxC,OAAO,EACL,aAAa,EAAE,gBAAgB,EAAE,YAAY,EAAE,aAAa,GAE7D,MAAM,8BAA8B,CAAC;AAEtC,4FAA4F;AAC5F,MAAM,GAAG,GAAG,CAAC,EAAiB,EAAiB,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;AAY3G,MAAM,UAAU,iBAAiB,CAAC,CAAsB;IACtD,OAAO;QACL,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI;QACpJ,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI;QAC1J,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,OAAO,EAAE,CAAC,CAAC,OAAO;KACnB,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,IAAuB;IACjD,MAAM,KAAK,GAAa,CAAC,iBAAiB,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAC1D,IAAI,IAAI,CAAC,UAAU;QAAE,KAAK,CAAC,IAAI,CAAC,eAAe,IAAI,CAAC,UAAU,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACzI,KAAK,CAAC,IAAI,CACR,IAAI,CAAC,SAAS;QACZ,CAAC,CAAC,iCAAiC,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,iBAAiB,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC9H,CAAC,CAAC,2EAA2E,CAChF,CAAC;IACF,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,IAAY,EAAE,IAAY;IAC/D,IAAI,IAAI,GAAG,gBAAgB;QAAE,OAAO,KAAK,CAAC;IAC1C,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACjC,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QACxD,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACjD,CAAC;YAAS,CAAC;QACT,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC;IACnB,CAAC;AACH,CAAC;AAcD;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,IAAY;IAChD,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACjC,IAAI,KAAiB,CAAC;IACtB,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpC,KAAK,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;YAAS,CAAC;QACT,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC;IACnB,CAAC;IACD,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,4CAA4C,CAAC;QACxG,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,CAAC;IACnH,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,CAAC;IACnD,MAAM,cAAc,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAClF,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,iBAAiB,CAAC,MAAM,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;AAC7H,CAAC"}

package/dist/encoding.d.ts

@@ -1,19 +0,0 @@
-/** Standard base64 → URL-safe unpadded base64. */
-export declare function toUrlSafeB64(b64: string): string;
-/**
- * URL-safe base64 → standard base64 with padding.
- * A no-op (apart from re-padding) when the input is already standard base64,
- * so it is safe to call on either form.
- */
-export declare function fromUrlSafeB64(urlSafe: string): string;
-/** True if the string plausibly encodes 32 bytes of SHA-256 in either base64 form. */
-export declare function looksLikeDigest(s: string): boolean;
-/**
- * SHA-256 of a file's bytes as standard base64.
- * Streams from disk, so file size is not a memory concern. Only this digest
- * ever leaves the machine; file contents are never uploaded.
- */
-export declare function sha256FileB64(path: string): Promise<string>;
-/** Run an async mapper over items with bounded concurrency, preserving order. */
-export declare function mapConcurrent<T, R>(items: readonly T[], concurrency: number, fn: (item: T, index: number) => Promise<R>): Promise<R[]>;
-//# sourceMappingURL=encoding.d.ts.map

package/dist/encoding.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"encoding.d.ts","sourceRoot":"","sources":["../src/encoding.ts"],"names":[],"mappings":"AAcA,kDAAkD;AAClD,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAEhD;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAItD;AAED,sFAAsF;AACtF,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAIlD;AAED;;;;GAIG;AACH,wBAAsB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAUjE;AAED,iFAAiF;AACjF,wBAAsB,aAAa,CAAC,CAAC,EAAE,CAAC,EACtC,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,WAAW,EAAE,MAAM,EACnB,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GACzC,OAAO,CAAC,CAAC,EAAE,CAAC,CAYd"}

package/dist/encoding.js

@@ -1,64 +0,0 @@
-// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
-/**
- * @mikeargento/bitgraph-mcp: digest encoding and file hashing.
- *
- * BitGraph uses two base64 forms for the same SHA-256 digest:
- * standard base64 with padding inside proof objects and commit requests,
- * URL-safe unpadded base64 in API lookups, S3 keys, and proof page URLs.
- */
-import { createHash } from "node:crypto";
-import { createReadStream } from "node:fs";
-import { stat } from "node:fs/promises";
-/** Standard base64 → URL-safe unpadded base64. */
-export function toUrlSafeB64(b64) {
-    return b64.replace(/\+/g, "-").replace(/\//g, "_").replace(/=+$/, "");
-}
-/**
- * URL-safe base64 → standard base64 with padding.
- * A no-op (apart from re-padding) when the input is already standard base64,
- * so it is safe to call on either form.
- */
-export function fromUrlSafeB64(urlSafe) {
-    let b64 = urlSafe.replace(/-/g, "+").replace(/_/g, "/");
-    while (b64.length % 4 !== 0)
-        b64 += "=";
-    return b64;
-}
-/** True if the string plausibly encodes 32 bytes of SHA-256 in either base64 form. */
-export function looksLikeDigest(s) {
-    const normalized = fromUrlSafeB64(s.trim());
-    if (!/^[A-Za-z0-9+/]{43}=$/.test(normalized))
-        return false;
-    return Buffer.from(normalized, "base64").length === 32;
-}
-/**
- * SHA-256 of a file's bytes as standard base64.
- * Streams from disk, so file size is not a memory concern. Only this digest
- * ever leaves the machine; file contents are never uploaded.
- */
-export async function sha256FileB64(path) {
-    const info = await stat(path);
-    if (!info.isFile()) {
-        throw new Error(`Not a regular file: ${path}`);
-    }
-    const hash = createHash("sha256");
-    for await (const chunk of createReadStream(path)) {
-        hash.update(chunk);
-    }
-    return hash.digest("base64");
-}
-/** Run an async mapper over items with bounded concurrency, preserving order. */
-export async function mapConcurrent(items, concurrency, fn) {
-    const results = new Array(items.length);
-    let next = 0;
-    async function worker() {
-        while (next < items.length) {
-            const index = next++;
-            results[index] = await fn(items[index], index);
-        }
-    }
-    const workers = Array.from({ length: Math.min(concurrency, items.length) }, () => worker());
-    await Promise.all(workers);
-    return results;
-}
-//# sourceMappingURL=encoding.js.map

package/dist/encoding.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"encoding.js","sourceRoot":"","sources":["../src/encoding.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAE9F;;;;;;GAMG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAExC,kDAAkD;AAClD,MAAM,UAAU,YAAY,CAAC,GAAW;IACtC,OAAO,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AACxE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,OAAe;IAC5C,IAAI,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACxD,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;QAAE,GAAG,IAAI,GAAG,CAAC;IACxC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,eAAe,CAAC,CAAS;IACvC,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5C,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,UAAU,CAAC;QAAE,OAAO,KAAK,CAAC;IAC3D,OAAO,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,MAAM,KAAK,EAAE,CAAC;AACzD,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,IAAY;IAC9C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,uBAAuB,IAAI,EAAE,CAAC,CAAC;IACjD,CAAC;IACD,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAClC,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC,MAAM,CAAC,KAAe,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AAC/B,CAAC;AAED,iFAAiF;AACjF,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,KAAmB,EACnB,WAAmB,EACnB,EAA0C;IAE1C,MAAM,OAAO,GAAQ,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC7C,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,UAAU,MAAM;QACnB,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,IAAI,EAAE,CAAC;YACrB,OAAO,CAAC,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,KAAK,CAAM,EAAE,KAAK,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5F,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC3B,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/scan.d.ts

@@ -1,60 +0,0 @@
-/**
- * @mikeargento/bitgraph-mcp: the scan.
- *
- * One pass over each file yields its SHA-256 (the member's origin) and a
- * hasher left open after the placement's prefix and the file's last byte, so
- * the member's fused digest can be finished later, for whatever slot the set
- * is made under, without reading the file again. A placement is prefix,
- * original, suffix (its frame): trailer/1 has no prefix and container/2's is
- * the original's tar header, which depends on the size alone; the suffix
- * carries the commitment and is hashed at BitGraph time. Node's SHA-256 is
- * the platform's own, and a Hash can be copied mid-stream, which is the whole
- * trick: the copy takes the suffix, so no file is read twice or held in
- * memory, and the original is never touched.
- */
-import { type Hash } from "node:crypto";
-/** The placements the scan makes: chosen from the bytes by the core, never from the name. */
-export type ScanPlacement = "trailer/1" | "container/2";
-export interface ScannedFile {
-    path: string;
-    name: string;
-    size: number;
-    /** SHA-256 of the file, standard base64: the member's origin. */
-    digestB64: string;
-    originDigest: Uint8Array;
-    placement: ScanPlacement;
-    /**
-     * The hasher after the placement's prefix and the file's bytes, still open.
-     * Null when the file's length changed while it was read: its fused digest
-     * then needs the bytes again.
-     */
-    state: Hash | null;
-    /** True when the bytes carry what looks like a C2PA manifest (Content Credentials). */
-    c2pa: boolean;
-}
-/** One-shot form for bytes already in memory (a carrier's committed bytes). */
-export declare function sniffC2paBytes(bytes: Uint8Array): boolean;
-/** Hash one file in a single pass. Throws, before any network call, when the path is not a regular file. */
-export declare function scanFile(path: string): Promise<ScannedFile>;
-/**
- * A member's fused digest for a slot: the open hasher, copied, finished with
- * the placement's suffix for that slot's commitment. The hash of prefix,
- * original, suffix is exactly the hash of the placement's own build, which
- * a test pins.
- */
-export declare function fusedDigestFor(file: ScannedFile, commitment: Uint8Array): Uint8Array;
-export interface Expansion {
-    /** Regular files in the order given; a directory contributes its files sorted by name, depth first. */
-    files: string[];
-    /** How many of the inputs were directories. */
-    directories: number;
-}
-/**
- * Paths to files: a regular file is itself; a directory is every regular
- * file under it, recursively, with hidden entries (names starting with a
- * dot) and symbolic links left out. The same file twice is one file. A path
- * that is missing or neither kind, or more than `limit` files in all, throws
- * before any network call; the message names every path that failed.
- */
-export declare function expandPaths(paths: readonly string[], limit: number): Promise<Expansion>;
-//# sourceMappingURL=scan.d.ts.map

package/dist/scan.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"scan.d.ts","sourceRoot":"","sources":["../src/scan.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAc,KAAK,IAAI,EAAE,MAAM,aAAa,CAAC;AAOpD,6FAA6F;AAC7F,MAAM,MAAM,aAAa,GAAG,WAAW,GAAG,aAAa,CAAC;AAExD,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,iEAAiE;IACjE,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,UAAU,CAAC;IACzB,SAAS,EAAE,aAAa,CAAC;IACzB;;;;OAIG;IACH,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC;IACnB,uFAAuF;IACvF,IAAI,EAAE,OAAO,CAAC;CACf;AAuCD,+EAA+E;AAC/E,wBAAgB,cAAc,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAEzD;AAKD,4GAA4G;AAC5G,wBAAsB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,CAuDjE;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,GAAG,UAAU,CAMpF;AAED,MAAM,WAAW,SAAS;IACxB,uGAAuG;IACvG,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,+CAA+C;IAC/C,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;;;;;GAMG;AACH,wBAAsB,WAAW,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,CA2C7F"}

package/dist/scan.js

@@ -1,201 +0,0 @@
-// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
-/**
- * @mikeargento/bitgraph-mcp: the scan.
- *
- * One pass over each file yields its SHA-256 (the member's origin) and a
- * hasher left open after the placement's prefix and the file's last byte, so
- * the member's fused digest can be finished later, for whatever slot the set
- * is made under, without reading the file again. A placement is prefix,
- * original, suffix (its frame): trailer/1 has no prefix and container/2's is
- * the original's tar header, which depends on the size alone; the suffix
- * carries the commitment and is hashed at BitGraph time. Node's SHA-256 is
- * the platform's own, and a Hash can be copied mid-stream, which is the whole
- * trick: the copy takes the suffix, so no file is read twice or held in
- * memory, and the original is never touched.
- */
-import { createHash } from "node:crypto";
-import { createReadStream } from "node:fs";
-import { readdir, stat } from "node:fs/promises";
-import { basename, join } from "node:path";
-import { placementForBytes } from "@mikeargento/bitgraph";
-import { getPlacement } from "@mikeargento/bitgraph-verify";
-/**
- * Content Credentials detection, structural and cheap: a C2PA manifest lives
- * in a JUMBF box whose description ("jumd") is followed within a few bytes by
- * the store label "c2pa", in every container (JPEG APP11, PNG caBX, ISO BMFF).
- * Requiring the pair in order and near each other keeps a stray "c2pa" in
- * prose from counting. Detection, not judgment: the proof page parses and
- * displays the manifest itself.
- */
-const JUMD = Buffer.from("jumd", "ascii");
-const C2PA_LABEL = Buffer.from("c2pa", "ascii");
-const C2PA_NEAR = 96;
-function windowHasC2pa(buf) {
-    for (let i = buf.indexOf(JUMD); i !== -1; i = buf.indexOf(JUMD, i + 1)) {
-        const from = i + JUMD.length;
-        const to = Math.min(buf.length, i + C2PA_NEAR);
-        if (buf.subarray(from, to).indexOf(C2PA_LABEL) !== -1)
-            return true;
-    }
-    return false;
-}
-class C2paSniffer {
-    found = false;
-    /** The last C2PA_NEAR + 4 bytes of the previous chunk, so a pair split across chunks is seen whole. */
-    carry = Buffer.alloc(0);
-    update(chunk) {
-        if (this.found)
-            return;
-        const buf = this.carry.length > 0 ? Buffer.concat([this.carry, chunk]) : chunk;
-        if (windowHasC2pa(buf)) {
-            this.found = true;
-            return;
-        }
-        const keep = Math.min(buf.length, C2PA_NEAR + JUMD.length);
-        this.carry = Buffer.from(buf.subarray(buf.length - keep));
-    }
-}
-/** One-shot form for bytes already in memory (a carrier's committed bytes). */
-export function sniffC2paBytes(bytes) {
-    return windowHasC2pa(Buffer.from(bytes.buffer, bytes.byteOffset, bytes.byteLength));
-}
-/** Bytes the placement decision reads: every magic number sits in the first 16. */
-const SNIFF = 64;
-/** Hash one file in a single pass. Throws, before any network call, when the path is not a regular file. */
-export async function scanFile(path) {
-    const info = await stat(path);
-    if (!info.isFile())
-        throw new Error(`Not a regular file: ${path}`);
-    const size = info.size;
-    const origin = createHash("sha256");
-    // Held in one object: the closures below assign to it.
-    const run = { fused: null, placement: null };
-    let head = null;
-    let bytes = 0;
-    const start = (p) => {
-        run.placement = p;
-        // A second hasher runs over prefix and bytes when the prefix is not
-        // empty; with an empty prefix the origin hasher's own state is the fused state.
-        const prefix = getPlacement(p)?.scanPrefix?.(size) ?? null;
-        if (prefix !== null && prefix.length > 0)
-            run.fused = createHash("sha256").update(prefix);
-    };
-    const sniffer = new C2paSniffer();
-    const feed = (chunk) => {
-        origin.update(chunk);
-        if (run.fused !== null)
-            run.fused.update(chunk);
-        sniffer.update(chunk);
-    };
-    for await (const raw of createReadStream(path)) {
-        const chunk = raw;
-        if (run.placement === null) {
-            head = head === null ? chunk : Buffer.concat([head, chunk]);
-            if (head.length >= SNIFF) {
-                start(placementForBytes(new Uint8Array(head.subarray(0, SNIFF))));
-                feed(head);
-                head = null;
-            }
-        }
-        else {
-            feed(chunk);
-        }
-        bytes += chunk.length;
-    }
-    if (run.placement === null) {
-        // A short file: decide from what there is, then hash it.
-        start(placementForBytes(new Uint8Array(head ?? Buffer.alloc(0))));
-        if (head !== null)
-            feed(head);
-    }
-    const placement = run.placement;
-    const state = bytes !== size ? null : (run.fused ?? origin);
-    // When the origin hasher is the state its digest is taken from a copy, so it stays open.
-    const digest = state === origin ? origin.copy().digest() : origin.digest();
-    return {
-        path,
-        name: basename(path),
-        size,
-        digestB64: digest.toString("base64"),
-        originDigest: Uint8Array.from(digest),
-        placement,
-        state,
-        c2pa: sniffer.found,
-    };
-}
-/**
- * A member's fused digest for a slot: the open hasher, copied, finished with
- * the placement's suffix for that slot's commitment. The hash of prefix,
- * original, suffix is exactly the hash of the placement's own build, which
- * a test pins.
- */
-export function fusedDigestFor(file, commitment) {
-    if (file.state === null)
-        throw new Error(`${file.path}: the file changed while it was read`);
-    const placement = getPlacement(file.placement);
-    if (placement?.frame === undefined)
-        throw new Error(`placement ${file.placement} has no frame`);
-    const { suffix } = placement.frame({ originalSize: file.size, originDigest: file.originDigest, commitment });
-    return Uint8Array.from(file.state.copy().update(suffix).digest());
-}
-/**
- * Paths to files: a regular file is itself; a directory is every regular
- * file under it, recursively, with hidden entries (names starting with a
- * dot) and symbolic links left out. The same file twice is one file. A path
- * that is missing or neither kind, or more than `limit` files in all, throws
- * before any network call; the message names every path that failed.
- */
-export async function expandPaths(paths, limit) {
-    const files = [];
-    const seen = new Set();
-    const failures = [];
-    let directories = 0;
-    const push = (p) => {
-        if (seen.has(p))
-            return;
-        seen.add(p);
-        files.push(p);
-        if (files.length > limit)
-            throw new Error(`more than ${limit} files; BitGraph fewer at a time`);
-    };
-    const walk = async (dir) => {
-        const entries = (await readdir(dir, { withFileTypes: true }))
-            .filter((e) => !e.name.startsWith("."))
-            .sort((a, b) => (a.name < b.name ? -1 : a.name > b.name ? 1 : 0));
-        for (const e of entries) {
-            const full = join(dir, e.name);
-            if (e.isSymbolicLink())
-                continue;
-            if (e.isDirectory())
-                await walk(full);
-            else if (e.isFile())
-                push(full);
-        }
-    };
-    for (const p of paths) {
-        try {
-            const info = await stat(p);
-            if (info.isDirectory()) {
-                directories += 1;
-                await walk(p);
-            }
-            else if (info.isFile()) {
-                push(p);
-            }
-            else {
-                throw new Error("not a regular file or a directory");
-            }
-        }
-        catch (err) {
-            const message = err instanceof Error ? err.message : String(err);
-            if (message.startsWith("more than "))
-                throw err;
-            failures.push(`${p}: ${message}`);
-        }
-    }
-    if (failures.length > 0) {
-        throw new Error(`Could not read ${failures.length} path(s); nothing was BitGraphed.\n${failures.join("\n")}\nUse absolute paths to existing regular files or directories.`);
-    }
-    return { files, directories };
-}
-//# sourceMappingURL=scan.js.map

package/dist/scan.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scan.js","sourceRoot":"","sources":["../src/scan.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAE9F;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,UAAU,EAAa,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAuB5D;;;;;;;GAOG;AACH,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAC1C,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAChD,MAAM,SAAS,GAAG,EAAE,CAAC;AAErB,SAAS,aAAa,CAAC,GAAW;IAChC,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACvE,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;QAC/C,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IACrE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,WAAW;IACf,KAAK,GAAG,KAAK,CAAC;IACd,uGAAuG;IAC/F,KAAK,GAAW,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,KAAa;QAClB,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/E,IAAI,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3D,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IAC5D,CAAC;CACF;AAED,+EAA+E;AAC/E,MAAM,UAAU,cAAc,CAAC,KAAiB;IAC9C,OAAO,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;AACtF,CAAC;AAED,mFAAmF;AACnF,MAAM,KAAK,GAAG,EAAE,CAAC;AAEjB,4GAA4G;AAC5G,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,IAAY;IACzC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,IAAI,EAAE,CAAC,CAAC;IACnE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IACpC,uDAAuD;IACvD,MAAM,GAAG,GAA4D,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IACtG,IAAI,IAAI,GAAkB,IAAI,CAAC;IAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAG,CAAC,CAAgB,EAAE,EAAE;QACjC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC;QAClB,oEAAoE;QACpE,gFAAgF;QAChF,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;QAC3D,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5F,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,CAAC,KAAa,EAAE,EAAE;QAC7B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,GAAG,CAAC,KAAK,KAAK,IAAI;YAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAChD,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC,CAAC;IACF,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,GAAa,CAAC;QAC5B,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAC3B,IAAI,GAAG,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YAC5D,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;gBACzB,KAAK,CAAC,iBAAiB,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClE,IAAI,CAAC,IAAI,CAAC,CAAC;gBACX,IAAI,GAAG,IAAI,CAAC;YACd,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,CAAC;QACd,CAAC;QACD,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;IACxB,CAAC;IACD,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;QAC3B,yDAAyD;QACzD,KAAK,CAAC,iBAAiB,CAAC,IAAI,UAAU,CAAC,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,IAAI,IAAI,KAAK,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,MAAM,SAAS,GAAG,GAAG,CAAC,SAA0B,CAAC;IACjD,MAAM,KAAK,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,MAAM,CAAC,CAAC;IAC5D,yFAAyF;IACzF,MAAM,MAAM,GAAG,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;IAC3E,OAAO;QACL,IAAI;QACJ,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC;QACpB,IAAI;QACJ,SAAS,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;QACpC,YAAY,EAAE,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC;QACrC,SAAS;QACT,KAAK;QACL,IAAI,EAAE,OAAO,CAAC,KAAK;KACpB,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,IAAiB,EAAE,UAAsB;IACtE,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,sCAAsC,CAAC,CAAC;IAC7F,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/C,IAAI,SAAS,EAAE,KAAK,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,SAAS,eAAe,CAAC,CAAC;IAChG,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,UAAU,EAAE,CAAC,CAAC;IAC7G,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;AACpE,CAAC;AASD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,KAAwB,EAAE,KAAa;IACvE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE;QACzB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO;QACxB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,aAAa,KAAK,kCAAkC,CAAC,CAAC;IAClG,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,KAAK,EAAE,GAAW,EAAiB,EAAE;QAChD,MAAM,OAAO,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;aAC1D,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;aACtC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,CAAC,cAAc,EAAE;gBAAE,SAAS;YACjC,IAAI,CAAC,CAAC,WAAW,EAAE;gBAAE,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC;iBACjC,IAAI,CAAC,CAAC,MAAM,EAAE;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACvB,WAAW,IAAI,CAAC,CAAC;gBACjB,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjE,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,CAAC;gBAAE,MAAM,GAAG,CAAC;YAChD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,kBAAkB,QAAQ,CAAC,MAAM,sCAAsC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;IAC9K,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;AAChC,CAAC"}

package/dist/task.d.ts

@@ -1,55 +0,0 @@
-import type { BitGraphProof, SlotAllocation } from "@mikeargento/bitgraph-verify";
-import { type ApiConfig } from "./api.js";
-export declare const SLOT_TTL_SECONDS = 120;
-export interface TaskState {
-    v: 1;
-    task: true;
-    slot: SlotAllocation;
-}
-export declare function encodeTaskToken(state: TaskState): string;
-export declare function decodeTaskToken(token: string): TaskState | null;
-export interface Begun {
-    token: string;
-    /** Unpadded base64url: the string to put into the task. */
-    commitment: string;
-    commitmentB64: string;
-    slotCounter: string;
-    epoch: string;
-    floor: {
-        block: number;
-    } | null;
-}
-/** Step one of the task form: a held slot and its commitment, before any work exists. */
-export declare function beginTask(config: ApiConfig): Promise<Begun>;
-export interface SealedTask {
-    proof: BitGraphProof;
-    artifactDigestB64: string;
-    /** Byte offsets of the commitment string inside the task bytes, when the bytes were given. */
-    offsets: number[] | null;
-}
-/**
- * Step two: the task bytes (a path, or the bytes themselves) sealed under
- * the held slot with the inline marker. When the bytes are in hand the
- * commitment is looked for BEFORE the commit, so a task that does not carry
- * it is refused without spending the slot.
- */
-export declare function sealTask(config: ApiConfig, state: TaskState, task: {
-    path: string;
-} | {
-    bytes: Uint8Array;
-} | {
-    digestB64: string;
-}): Promise<SealedTask>;
-export declare const TASK_INSTRUCTIONS: string;
-/**
- * Write a sealed task's proof beside the file it is about, whole, and say
- * where. `make_task.txt` gets `make_task.proof.json`; a name already taken
- * gets the position's counter in it rather than being overwritten.
- *
- * ⚠️ THE SERVER WRITES IT, NOT THE AGENT. Handed the JSON to save, an agent
- * tidied it and dropped slotAllocation and environment, and the signature
- * had no body left to be checked against (Grok, 2026-09-13). A file this
- * process writes is the proof exactly as the boundary returned it.
- */
-export declare function writeProofBeside(sealedPath: string, proof: BitGraphProof): Promise<string>;
-//# sourceMappingURL=task.d.ts.map

package/dist/task.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"task.d.ts","sourceRoot":"","sources":["../src/task.ts"],"names":[],"mappings":"AAqBA,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAClF,OAAO,EAAY,KAAK,SAAS,EAAE,MAAM,UAAU,CAAC;AAGpD,eAAO,MAAM,gBAAgB,MAAM,CAAC;AAKpC,MAAM,WAAW,SAAS;IACxB,CAAC,EAAE,CAAC,CAAC;IACL,IAAI,EAAE,IAAI,CAAC;IACX,IAAI,EAAE,cAAc,CAAC;CACtB;AASD,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CAExD;AAED,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAO/D;AAkBD,MAAM,WAAW,KAAK;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,2DAA2D;IAC3D,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;CACjC;AAED,yFAAyF;AACzF,wBAAsB,SAAS,CAAC,MAAM,EAAE,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,CAcjE;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,aAAa,CAAC;IACrB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,8FAA8F;IAC9F,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;CAC1B;AAED;;;;;GAKG;AACH,wBAAsB,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,KAAK,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,SAAS,EAAE,MAAM,CAAA;CAAE,GAAG,OAAO,CAAC,UAAU,CAAC,CA4B/J;AAkBD,eAAO,MAAM,iBAAiB,QAK0J,CAAC;AAEzL;;;;;;;;;GASG;AACH,wBAAsB,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC,CAWhG"}