@mikeargento/bitgraph-mcp 0.1.1

package/dist/server.js

@@ -0,0 +1,375 @@
+// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+/**
+ * @mikeargento/bitgraph-mcp: tool definitions.
+ *
+ * Three gestures, the same three the website has: record a file (take a
+ * BitGraph), check whether bytes are on record, fetch a proof. Only SHA-256
+ * digests ever leave the machine; file contents are never uploaded.
+ */
+import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import { z } from "zod";
+import { ApiError, PartialCommitError, batchCheck, commitDigests, configFromEnv, getProofDetail, search, } from "./api.js";
+import { fromUrlSafeB64, looksLikeDigest, mapConcurrent, sha256FileB64, toUrlSafeB64, } from "./encoding.js";
+import { capJson, positionOf, proofUrl, renderCheckMarkdown, renderProofMarkdown, renderRecordMarkdown, } from "./format.js";
+export const SERVER_VERSION = "0.1.1";
+const HASH_CONCURRENCY = 4;
+const MAX_FILES = 500;
+const responseFormatSchema = z
+    .enum(["markdown", "json"])
+    .default("markdown")
+    .describe("markdown (default): human-readable summary. json: complete structured data.");
+function ok(text, structured) {
+    const result = { content: [{ type: "text", text }] };
+    if (structured !== undefined)
+        result.structuredContent = structured;
+    return result;
+}
+function fail(message) {
+    return { isError: true, content: [{ type: "text", text: message }] };
+}
+function errorText(err) {
+    if (err instanceof ApiError) {
+        const retry = err.retryAfterSec !== null ? ` Retry after ${err.retryAfterSec} seconds.` : "";
+        return `Error: BitGraph API responded ${err.status}: ${err.message}.${retry}`;
+    }
+    return `Error: ${err instanceof Error ? err.message : String(err)}`;
+}
+/** Hash the given paths (bounded concurrency). Throws before any network call. */
+async function hashPaths(paths) {
+    const failures = [];
+    const digests = await mapConcurrent(paths, HASH_CONCURRENCY, async (p) => {
+        try {
+            return await sha256FileB64(p);
+        }
+        catch (err) {
+            failures.push(`${p}: ${err instanceof Error ? err.message : String(err)}`);
+            return "";
+        }
+    });
+    if (failures.length > 0) {
+        throw new Error(`Could not read ${failures.length} file(s); nothing was recorded.\n${failures.join("\n")}\nUse absolute paths to existing regular files.`);
+    }
+    return digests;
+}
+export function buildServer() {
+    const server = new McpServer({
+        name: "bitgraph-mcp-server",
+        version: SERVER_VERSION,
+    });
+    server.registerTool("bitgraph_record", {
+        title: "Take a BitGraph",
+        description: "Take a BitGraph of one or more files: record each file's SHA-256 digest at a new causal position in the BitGraph ledger (bitgraph.ing). " +
+            "Only the digest leaves the machine; file contents are never uploaded. " +
+            "Files whose bytes are already on record are NOT re-recorded by default; they come back as 'on record' with their existing proof. " +
+            "Pass again=true to deliberately record already-recorded bytes at a new causal position (BitGraph Again). " +
+            "Recordings are permanent: the ledger has 10-year retention and no deletes, so only record files the user asked to record. " +
+            "Returns one outcome per file: 'recorded' (newly minted) or 'on record' (was already there), with its position number and proof page URL. " +
+            "Use bitgraph_check instead when the user only wants to know whether a file is on record.",
+        inputSchema: {
+            paths: z
+                .array(z.string().min(1))
+                .min(1)
+                .max(MAX_FILES)
+                .describe(`File paths to record (absolute paths preferred), up to ${MAX_FILES}.`),
+            attribution: z
+                .object({
+                name: z.string().max(200).optional().describe("Submitter's name (self-attributed)."),
+                title: z.string().max(200).optional(),
+                message: z.string().max(2000).optional(),
+            })
+                .optional()
+                .describe("Optional self-attributed submitter's note, stored in the signed proof. Rendered as a note, never as verified identity."),
+            again: z
+                .boolean()
+                .default(false)
+                .describe("false (default): files already on record are returned as-is, nothing minted. true: record every file at a new causal position even if already on record. Positions are per unique file content: two paths with identical bytes yield one position."),
+            response_format: responseFormatSchema,
+        },
+        annotations: {
+            readOnlyHint: false,
+            destructiveHint: false,
+            idempotentHint: false,
+            openWorldHint: true,
+        },
+    }, async ({ paths, attribution, again, response_format }) => {
+        const config = configFromEnv();
+        try {
+            const digests = await hashPaths(paths);
+            // Unique digests, first path wins for display; extra paths listed too.
+            const byDigest = new Map();
+            digests.forEach((d, i) => {
+                const list = byDigest.get(d) ?? [];
+                list.push(paths[i]);
+                byDigest.set(d, list);
+            });
+            const unique = [...byDigest.keys()];
+            const checked = await batchCheck(config, unique.map(toUrlSafeB64));
+            const existing = new Map();
+            for (const d of unique) {
+                const entry = checked.results[toUrlSafeB64(d)];
+                if (entry && entry.proofs.length > 0)
+                    existing.set(d, entry.proofs);
+            }
+            const toMint = again ? unique : unique.filter((d) => !existing.has(d));
+            let minted = [];
+            let partial = null;
+            if (toMint.length > 0) {
+                try {
+                    minted = await commitDigests(config, toMint, attribution);
+                    // A 200 with fewer proofs than digests is still a partial failure;
+                    // never let it reach the success path looking complete.
+                    if (minted.length < toMint.length) {
+                        partial = new PartialCommitError(minted, toMint.length, new Error("commit returned fewer proofs than digests sent"));
+                    }
+                }
+                catch (err) {
+                    if (err instanceof PartialCommitError) {
+                        minted = err.minted;
+                        partial = err;
+                    }
+                    else {
+                        throw err;
+                    }
+                }
+            }
+            const mintedByDigest = new Map();
+            for (const p of minted) {
+                const d = p.artifact?.digestB64;
+                if (d !== undefined)
+                    mintedByDigest.set(d, p);
+            }
+            const outcomes = [];
+            for (const [digest, pathList] of byDigest) {
+                const mintedProof = mintedByDigest.get(digest);
+                const prior = existing.get(digest);
+                for (const path of pathList) {
+                    if (mintedProof) {
+                        const { counter, epoch } = positionOf(mintedProof);
+                        outcomes.push({
+                            path,
+                            digest: toUrlSafeB64(digest),
+                            outcome: "recorded",
+                            counter,
+                            epoch,
+                            total_positions: (prior?.length ?? 0) + 1,
+                            proof_url: proofUrl(config.baseUrl, digest, counter ?? undefined, mintedProof.commit?.epochId),
+                        });
+                    }
+                    else if (prior) {
+                        const first = prior[0]?.proof;
+                        const { counter, epoch } = first ? positionOf(first) : { counter: null, epoch: null };
+                        outcomes.push({
+                            path,
+                            digest: toUrlSafeB64(digest),
+                            outcome: "on record",
+                            counter,
+                            epoch,
+                            total_positions: prior.length,
+                            proof_url: proofUrl(config.baseUrl, digest),
+                        });
+                    }
+                    else {
+                        // Neither minted nor previously on record: lost to a partial
+                        // failure. The honest outcome is "not recorded", never a claim.
+                        outcomes.push({
+                            path,
+                            digest: toUrlSafeB64(digest),
+                            outcome: "not recorded",
+                            counter: null,
+                            epoch: null,
+                            total_positions: 0,
+                            proof_url: null,
+                        });
+                    }
+                }
+            }
+            const structured = {
+                results: outcomes,
+                summary: {
+                    recorded: outcomes.filter((o) => o.outcome === "recorded").length,
+                    on_record: outcomes.filter((o) => o.outcome === "on record").length,
+                    not_recorded: outcomes.filter((o) => o.outcome === "not recorded").length,
+                },
+            };
+            if (partial) {
+                const unrecorded = toMint.length - minted.length;
+                const retryGuidance = again
+                    ? `Some 'not recorded' files MAY still have been recorded server-side if the failure was a timeout. Run bitgraph_check on the 'not recorded' paths first, then re-run bitgraph_record with again=true for only the paths still missing.`
+                    : `Re-run bitgraph_record with the same paths: already-recorded files will come back as 'on record' and only the missing ones will mint.`;
+                return {
+                    isError: true,
+                    content: [
+                        {
+                            type: "text",
+                            text: `${errorText(partial.cause2)}\n` +
+                                `${minted.length} of ${toMint.length} digests were recorded before the failure (those recordings are permanent); ${unrecorded} were not. ` +
+                                `${retryGuidance}\n\n` +
+                                renderRecordMarkdown(outcomes),
+                        },
+                    ],
+                    structuredContent: structured,
+                };
+            }
+            const text = response_format === "json"
+                ? capJson(structured).text
+                : renderRecordMarkdown(outcomes);
+            return ok(text, structured);
+        }
+        catch (err) {
+            return fail(errorText(err));
+        }
+    });
+    server.registerTool("bitgraph_check", {
+        title: "Check for BitGraphs",
+        description: "Check whether files or digests are on record in the BitGraph ledger, without recording anything. " +
+            "Accepts file paths (hashed locally; only digests are sent) and/or raw SHA-256 digests in standard or URL-safe base64. " +
+            "Returns, per item: on record or not, every causal position (a file recorded more than once has several), and the proof page URL. " +
+            "Read-only. Use bitgraph_record to record files that turn out not to be on record.",
+        inputSchema: {
+            paths: z
+                .array(z.string().min(1))
+                .max(MAX_FILES)
+                .optional()
+                .describe("File paths to check."),
+            digests: z
+                .array(z.string().min(1).max(100))
+                .max(MAX_FILES)
+                .optional()
+                .describe("SHA-256 digests, base64 (standard or URL-safe form)."),
+            response_format: responseFormatSchema,
+        },
+        annotations: {
+            readOnlyHint: true,
+            destructiveHint: false,
+            idempotentHint: true,
+            openWorldHint: true,
+        },
+    }, async ({ paths, digests, response_format }) => {
+        const config = configFromEnv();
+        try {
+            const inputs = [];
+            if (paths && paths.length > 0) {
+                const hashed = await hashPaths(paths);
+                hashed.forEach((d, i) => inputs.push({ label: paths[i], standardDigest: d }));
+            }
+            for (const d of digests ?? []) {
+                const trimmed = d.trim();
+                if (!looksLikeDigest(trimmed)) {
+                    return fail(`Error: "${d}" is not a base64 SHA-256 digest. Pass 32-byte digests in standard or URL-safe base64, or use paths to hash files locally.`);
+                }
+                inputs.push({ label: d, standardDigest: fromUrlSafeB64(trimmed) });
+            }
+            if (inputs.length === 0) {
+                return fail("Error: provide at least one of paths or digests.");
+            }
+            const checked = await batchCheck(config, inputs.map((i) => toUrlSafeB64(i.standardDigest)));
+            const outcomes = inputs.map((input) => {
+                const entry = checked.results[toUrlSafeB64(input.standardDigest)];
+                const proofs = entry?.proofs ?? [];
+                const positions = proofs.map((p) => positionOf(p.proof));
+                return {
+                    input: input.label,
+                    digest: toUrlSafeB64(input.standardDigest),
+                    on_record: proofs.length > 0,
+                    positions,
+                    proof_url: proofs.length > 0 ? proofUrl(config.baseUrl, input.standardDigest) : null,
+                };
+            });
+            const structured = {
+                results: outcomes,
+                summary: {
+                    on_record: outcomes.filter((o) => o.on_record).length,
+                    not_on_record: outcomes.filter((o) => !o.on_record).length,
+                },
+            };
+            const text = response_format === "json" ? capJson(structured).text : renderCheckMarkdown(outcomes);
+            return ok(text, structured);
+        }
+        catch (err) {
+            return fail(errorText(err));
+        }
+    });
+    server.registerTool("bitgraph_get_proof", {
+        title: "Get a BitGraph proof",
+        description: "Fetch a BitGraph proof and its context: causal position, every position the same bytes occupy, and the two-sided Ethereum anchor window " +
+            "('BitGraphed between X and Y'). Look up by digest (base64, either form), by BitGraph number (e.g. '4523' or '#4,523', current epoch), or by file path (hashed locally). " +
+            "Exactly one of digest, number, or path is required. Read-only. " +
+            "markdown returns a summary; json returns the full proof object with positions and anchor window.",
+        inputSchema: {
+            digest: z
+                .string()
+                .min(1)
+                .max(100)
+                .optional()
+                .describe("SHA-256 digest, standard or URL-safe base64."),
+            number: z
+                .string()
+                .min(1)
+                .max(30)
+                .optional()
+                .describe("BitGraph counter number in the current epoch, e.g. '4523' or '#4,523'."),
+            path: z.string().min(1).optional().describe("File path; hashed locally."),
+            counter: z
+                .string()
+                .optional()
+                .describe("Select a specific causal position by commit counter (with epoch)."),
+            epoch: z
+                .string()
+                .optional()
+                .describe("URL-safe epoch id qualifying the counter."),
+            response_format: responseFormatSchema,
+        },
+        annotations: {
+            readOnlyHint: true,
+            destructiveHint: false,
+            idempotentHint: true,
+            openWorldHint: true,
+        },
+    }, async ({ digest, number, path, counter, epoch, response_format }) => {
+        const config = configFromEnv();
+        try {
+            const given = [digest, number, path].filter((v) => v !== undefined);
+            if (given.length !== 1) {
+                return fail("Error: pass exactly one of digest, number, or path.");
+            }
+            let urlSafeDigest;
+            let selCounter = counter;
+            if (number !== undefined) {
+                const result = await search(config, number);
+                if (!result.found || result.digest === undefined) {
+                    return fail(`Error: no BitGraph found for number "${number}" in the current epoch. Numbers reset each epoch; look up older recordings by digest or path instead.`);
+                }
+                urlSafeDigest = result.digest;
+                if (selCounter === undefined && result.counter != null)
+                    selCounter = result.counter;
+            }
+            else if (path !== undefined) {
+                const hashed = await hashPaths([path]);
+                urlSafeDigest = toUrlSafeB64(hashed[0]);
+            }
+            else {
+                const trimmed = digest.trim();
+                if (!looksLikeDigest(trimmed)) {
+                    return fail(`Error: "${digest}" is not a base64 SHA-256 digest. Pass a 32-byte digest in standard or URL-safe base64.`);
+                }
+                urlSafeDigest = toUrlSafeB64(fromUrlSafeB64(trimmed));
+            }
+            // The route compares epochs in URL-safe form; accept either form here.
+            const selEpoch = epoch !== undefined ? toUrlSafeB64(fromUrlSafeB64(epoch)) : undefined;
+            const detail = await getProofDetail(config, urlSafeDigest, selCounter, selEpoch);
+            if (detail.proofs.length === 0) {
+                return fail(`Not on record: no proof exists for digest ${urlSafeDigest}. Use bitgraph_record to record the file.`);
+            }
+            if (response_format === "json") {
+                const capped = capJson(detail);
+                return ok(capped.text, detail);
+            }
+            return ok(renderProofMarkdown(detail, config.baseUrl), detail);
+        }
+        catch (err) {
+            return fail(errorText(err));
+        }
+    });
+    return server;
+}
+//# sourceMappingURL=server.js.map

package/dist/server.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"server.js","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AAAA,qFAAqF;AAErF;;;;;;GAMG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AACpE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EACL,QAAQ,EACR,kBAAkB,EAClB,UAAU,EACV,aAAa,EACb,aAAa,EACb,cAAc,EACd,MAAM,GACP,MAAM,UAAU,CAAC;AAClB,OAAO,EACL,cAAc,EACd,eAAe,EACf,aAAa,EACb,aAAa,EACb,YAAY,GACb,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,OAAO,EACP,UAAU,EACV,QAAQ,EACR,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,GAGrB,MAAM,aAAa,CAAC;AAGrB,MAAM,CAAC,MAAM,cAAc,GAAG,OAAO,CAAC;AAEtC,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAC3B,MAAM,SAAS,GAAG,GAAG,CAAC;AAEtB,MAAM,oBAAoB,GAAG,CAAC;KAC3B,IAAI,CAAC,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;KAC1B,OAAO,CAAC,UAAU,CAAC;KACnB,QAAQ,CAAC,6EAA6E,CAAC,CAAC;AAQ3F,SAAS,EAAE,CAAC,IAAY,EAAE,UAAoC;IAC5D,MAAM,MAAM,GAAe,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IACjE,IAAI,UAAU,KAAK,SAAS;QAAE,MAAM,CAAC,iBAAiB,GAAG,UAAU,CAAC;IACpE,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,IAAI,CAAC,OAAe;IAC3B,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;AACvE,CAAC;AAED,SAAS,SAAS,CAAC,GAAY;IAC7B,IAAI,GAAG,YAAY,QAAQ,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,GAAG,CAAC,aAAa,KAAK,IAAI,CAAC,CAAC,CAAC,gBAAgB,GAAG,CAAC,aAAa,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7F,OAAO,iCAAiC,GAAG,CAAC,MAAM,KAAK,GAAG,CAAC,OAAO,IAAI,KAAK,EAAE,CAAC;IAChF,CAAC;IACD,OAAO,UAAU,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;AACtE,CAAC;AAED,kFAAkF;AAClF,KAAK,UAAU,SAAS,CAAC,KAAwB;IAC/C,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,MAAM,aAAa,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE;QACvE,IAAI,CAAC;YACH,OAAO,MAAM,aAAa,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3E,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC,CAAC,CAAC;IACH,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CACb,kBAAkB,QAAQ,CAAC,MAAM,oCAAoC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,iDAAiD,CAC1I,CAAC;IACJ,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,WAAW;IACzB,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC;QAC3B,IAAI,EAAE,qBAAqB;QAC3B,OAAO,EAAE,cAAc;KACxB,CAAC,CAAC;IAEH,MAAM,CAAC,YAAY,CACjB,iBAAiB,EACjB;QACE,KAAK,EAAE,iBAAiB;QACxB,WAAW,EACT,0IAA0I;YAC1I,wEAAwE;YACxE,mIAAmI;YACnI,2GAA2G;YAC3G,4HAA4H;YAC5H,2IAA2I;YAC3I,0FAA0F;QAC5F,WAAW,EAAE;YACX,KAAK,EAAE,CAAC;iBACL,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;iBACxB,GAAG,CAAC,CAAC,CAAC;iBACN,GAAG,CAAC,SAAS,CAAC;iBACd,QAAQ,CAAC,0DAA0D,SAAS,GAAG,CAAC;YACnF,WAAW,EAAE,CAAC;iBACX,MAAM,CAAC;gBACN,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,qCAAqC,CAAC;gBACpF,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;gBACrC,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE;aACzC,CAAC;iBACD,QAAQ,EAAE;iBACV,QAAQ,CACP,wHAAwH,CACzH;YACH,KAAK,EAAE,CAAC;iBACL,OAAO,EAAE;iBACT,OAAO,CAAC,KAAK,CAAC;iBACd,QAAQ,CACP,oPAAoP,CACrP;YACH,eAAe,EAAE,oBAAoB;SACtC;QACD,WAAW,EAAE;YACX,YAAY,EAAE,KAAK;YACnB,eAAe,EAAE,KAAK;YACtB,cAAc,EAAE,KAAK;YACrB,aAAa,EAAE,IAAI;SACpB;KACF,EACD,KAAK,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,eAAe,EAAE,EAAE,EAAE;QACvD,MAAM,MAAM,GAAG,aAAa,EAAE,CAAC;QAC/B,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,KAAK,CAAC,CAAC;YAEvC,uEAAuE;YACvE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;YAC7C,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAW,CAAC,CAAC;gBAC9B,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxB,CAAC,CAAC,CAAC;YACH,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YAEpC,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;YACnE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA2C,CAAC;YACpE,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;oBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YACtE,CAAC;YAED,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAEvE,IAAI,MAAM,GAAoB,EAAE,CAAC;YACjC,IAAI,OAAO,GAA8B,IAAI,CAAC;YAC9C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC;oBACH,MAAM,GAAG,MAAM,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;oBAC1D,mEAAmE;oBACnE,wDAAwD;oBACxD,IAAI,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;wBAClC,OAAO,GAAG,IAAI,kBAAkB,CAC9B,MAAM,EACN,MAAM,CAAC,MAAM,EACb,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAC5D,CAAC;oBACJ,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,IAAI,GAAG,YAAY,kBAAkB,EAAE,CAAC;wBACtC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;wBACpB,OAAO,GAAG,GAAG,CAAC;oBAChB,CAAC;yBAAM,CAAC;wBACN,MAAM,GAAG,CAAC;oBACZ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,cAAc,GAAG,IAAI,GAAG,EAAyB,CAAC;YACxD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC;gBAChC,IAAI,CAAC,KAAK,SAAS;oBAAE,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAChD,CAAC;YAED,MAAM,QAAQ,GAAoB,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC/C,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACnC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,IAAI,WAAW,EAAE,CAAC;wBAChB,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,WAAW,CAAC,CAAC;wBACnD,QAAQ,CAAC,IAAI,CAAC;4BACZ,IAAI;4BACJ,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC;4BAC5B,OAAO,EAAE,UAAU;4BACnB,OAAO;4BACP,KAAK;4BACL,eAAe,EAAE,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC;4BACzC,SAAS,EAAE,QAAQ,CACjB,MAAM,CAAC,OAAO,EACd,MAAM,EACN,OAAO,IAAI,SAAS,EACpB,WAAW,CAAC,MAAM,EAAE,OAAO,CAC5B;yBACF,CAAC,CAAC;oBACL,CAAC;yBAAM,IAAI,KAAK,EAAE,CAAC;wBACjB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;wBAC9B,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;wBACtF,QAAQ,CAAC,IAAI,CAAC;4BACZ,IAAI;4BACJ,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC;4BAC5B,OAAO,EAAE,WAAW;4BACpB,OAAO;4BACP,KAAK;4BACL,eAAe,EAAE,KAAK,CAAC,MAAM;4BAC7B,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC;yBAC5C,CAAC,CAAC;oBACL,CAAC;yBAAM,CAAC;wBACN,6DAA6D;wBAC7D,gEAAgE;wBAChE,QAAQ,CAAC,IAAI,CAAC;4BACZ,IAAI;4BACJ,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC;4BAC5B,OAAO,EAAE,cAAc;4BACvB,OAAO,EAAE,IAAI;4BACb,KAAK,EAAE,IAAI;4BACX,eAAe,EAAE,CAAC;4BAClB,SAAS,EAAE,IAAI;yBAChB,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,UAAU,GAAG;gBACjB,OAAO,EAAE,QAAgD;gBACzD,OAAO,EAAE;oBACP,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC,MAAM;oBACjE,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,WAAW,CAAC,CAAC,MAAM;oBACnE,YAAY,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,cAAc,CAAC,CAAC,MAAM;iBAC1E;aACF,CAAC;YAEF,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;gBACjD,MAAM,aAAa,GAAG,KAAK;oBACzB,CAAC,CAAC,sOAAsO;oBACxO,CAAC,CAAC,uIAAuI,CAAC;gBAC5I,OAAO;oBACL,OAAO,EAAE,IAAI;oBACb,OAAO,EAAE;wBACP;4BACE,IAAI,EAAE,MAAM;4BACZ,IAAI,EACF,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI;gCAChC,GAAG,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,MAAM,+EAA+E,UAAU,aAAa;gCAC1I,GAAG,aAAa,MAAM;gCACtB,oBAAoB,CAAC,QAAQ,CAAC;yBACjC;qBACF;oBACD,iBAAiB,EAAE,UAAU;iBAC9B,CAAC;YACJ,CAAC;YAED,MAAM,IAAI,GACR,eAAe,KAAK,MAAM;gBACxB,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI;gBAC1B,CAAC,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;YACrC,OAAO,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAC9B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC,CACF,CAAC;IAEF,MAAM,CAAC,YAAY,CACjB,gBAAgB,EAChB;QACE,KAAK,EAAE,qBAAqB;QAC5B,WAAW,EACT,mGAAmG;YACnG,wHAAwH;YACxH,mIAAmI;YACnI,mFAAmF;QACrF,WAAW,EAAE;YACX,KAAK,EAAE,CAAC;iBACL,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;iBACxB,GAAG,CAAC,SAAS,CAAC;iBACd,QAAQ,EAAE;iBACV,QAAQ,CAAC,sBAAsB,CAAC;YACnC,OAAO,EAAE,CAAC;iBACP,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;iBACjC,GAAG,CAAC,SAAS,CAAC;iBACd,QAAQ,EAAE;iBACV,QAAQ,CAAC,sDAAsD,CAAC;YACnE,eAAe,EAAE,oBAAoB;SACtC;QACD,WAAW,EAAE;YACX,YAAY,EAAE,IAAI;YAClB,eAAe,EAAE,KAAK;YACtB,cAAc,EAAE,IAAI;YACpB,aAAa,EAAE,IAAI;SACpB;KACF,EACD,KAAK,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,eAAe,EAAE,EAAE,EAAE;QAC5C,MAAM,MAAM,GAAG,aAAa,EAAE,CAAC;QAC/B,IAAI,CAAC;YACH,MAAM,MAAM,GAAqD,EAAE,CAAC;YACpE,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,KAAK,CAAC,CAAC;gBACtC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAW,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1F,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,OAAO,IAAI,EAAE,EAAE,CAAC;gBAC9B,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;gBACzB,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC9B,OAAO,IAAI,CACT,WAAW,CAAC,4HAA4H,CACzI,CAAC;gBACJ,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACrE,CAAC;YACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,IAAI,CAAC,kDAAkD,CAAC,CAAC;YAClE,CAAC;YAED,MAAM,OAAO,GAAG,MAAM,UAAU,CAC9B,MAAM,EACN,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAClD,CAAC;YAEF,MAAM,QAAQ,GAAmB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;gBACpD,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;gBAClE,MAAM,MAAM,GAAG,KAAK,EAAE,MAAM,IAAI,EAAE,CAAC;gBACnC,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACzD,OAAO;oBACL,KAAK,EAAE,KAAK,CAAC,KAAK;oBAClB,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,cAAc,CAAC;oBAC1C,SAAS,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC;oBAC5B,SAAS;oBACT,SAAS,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI;iBACrF,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,MAAM,UAAU,GAAG;gBACjB,OAAO,EAAE,QAAgD;gBACzD,OAAO,EAAE;oBACP,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM;oBACrD,aAAa,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM;iBAC3D;aACF,CAAC;YACF,MAAM,IAAI,GACR,eAAe,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC;YACxF,OAAO,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAC9B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC,CACF,CAAC;IAEF,MAAM,CAAC,YAAY,CACjB,oBAAoB,EACpB;QACE,KAAK,EAAE,sBAAsB;QAC7B,WAAW,EACT,0IAA0I;YAC1I,0KAA0K;YAC1K,iEAAiE;YACjE,kGAAkG;QACpG,WAAW,EAAE;YACX,MAAM,EAAE,CAAC;iBACN,MAAM,EAAE;iBACR,GAAG,CAAC,CAAC,CAAC;iBACN,GAAG,CAAC,GAAG,CAAC;iBACR,QAAQ,EAAE;iBACV,QAAQ,CAAC,8CAA8C,CAAC;YAC3D,MAAM,EAAE,CAAC;iBACN,MAAM,EAAE;iBACR,GAAG,CAAC,CAAC,CAAC;iBACN,GAAG,CAAC,EAAE,CAAC;iBACP,QAAQ,EAAE;iBACV,QAAQ,CAAC,wEAAwE,CAAC;YACrF,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,4BAA4B,CAAC;YACzE,OAAO,EAAE,CAAC;iBACP,MAAM,EAAE;iBACR,QAAQ,EAAE;iBACV,QAAQ,CAAC,mEAAmE,CAAC;YAChF,KAAK,EAAE,CAAC;iBACL,MAAM,EAAE;iBACR,QAAQ,EAAE;iBACV,QAAQ,CAAC,2CAA2C,CAAC;YACxD,eAAe,EAAE,oBAAoB;SACtC;QACD,WAAW,EAAE;YACX,YAAY,EAAE,IAAI;YAClB,eAAe,EAAE,KAAK;YACtB,cAAc,EAAE,IAAI;YACpB,aAAa,EAAE,IAAI;SACpB;KACF,EACD,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,eAAe,EAAE,EAAE,EAAE;QAClE,MAAM,MAAM,GAAG,aAAa,EAAE,CAAC;QAC/B,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;YACpE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC,qDAAqD,CAAC,CAAC;YACrE,CAAC;YAED,IAAI,aAAqB,CAAC;YAC1B,IAAI,UAAU,GAAG,OAAO,CAAC;YACzB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAC5C,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;oBACjD,OAAO,IAAI,CACT,wCAAwC,MAAM,uGAAuG,CACtJ,CAAC;gBACJ,CAAC;gBACD,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC;gBAC9B,IAAI,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,OAAO,IAAI,IAAI;oBAAE,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC;YACtF,CAAC;iBAAM,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACvC,aAAa,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAW,CAAC,CAAC;YACpD,CAAC;iBAAM,CAAC;gBACN,MAAM,OAAO,GAAI,MAAiB,CAAC,IAAI,EAAE,CAAC;gBAC1C,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC9B,OAAO,IAAI,CACT,WAAW,MAAM,yFAAyF,CAC3G,CAAC;gBACJ,CAAC;gBACD,aAAa,GAAG,YAAY,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;YACxD,CAAC;YAED,uEAAuE;YACvE,MAAM,QAAQ,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACvF,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,MAAM,EAAE,aAAa,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;YACjF,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC/B,OAAO,IAAI,CACT,6CAA6C,aAAa,2CAA2C,CACtG,CAAC;YACJ,CAAC;YAED,IAAI,eAAe,KAAK,MAAM,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC/B,OAAO,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,MAA4C,CAAC,CAAC;YACvE,CAAC;YACD,OAAO,EAAE,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,EAAE,MAA4C,CAAC,CAAC;QACvG,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC,CACF,CAAC;IAEF,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,88 @@
+/**
+ * @mikeargento/bitgraph-mcp: wire types.
+ *
+ * Minimal views of the bitgraph/1 schema and the bitgraph.ing API responses.
+ * The canonical, fully documented schema lives in @mikeargento/bitgraph-verify.
+ * Fields not needed for display are kept as unknown; proofs are passed through
+ * verbatim when the caller asks for JSON.
+ */
+export interface ProofCommit {
+    counter?: string;
+    epochId?: string;
+    time?: number;
+    slotCounter?: string;
+    [k: string]: unknown;
+}
+export interface BitGraphProof {
+    version?: string;
+    artifact?: {
+        hashAlg?: string;
+        digestB64?: string;
+    };
+    commit?: ProofCommit;
+    signer?: {
+        publicKeyB64?: string;
+        signatureB64?: string;
+    };
+    environment?: {
+        enforcement?: string;
+        measurement?: string;
+        attestation?: {
+            format?: string;
+            reportB64?: string;
+        };
+    };
+    attribution?: {
+        name?: string;
+        title?: string;
+        message?: string;
+    };
+    proofHash?: string;
+    [k: string]: unknown;
+}
+/** POST /api/proofs/batch response. Keyed by the digest exactly as sent (URL-safe). */
+export interface BatchCheckResponse {
+    results: Record<string, {
+        proofs: Array<{
+            proof: BitGraphProof;
+        }>;
+    }>;
+}
+export interface AnchorView {
+    counter?: string;
+    attrName?: string;
+    blockNumber?: number | null;
+    blockHash?: string | null;
+    etherscanUrl?: string | null;
+    blockTime?: string | null;
+}
+export interface PositionView {
+    counter: string | null;
+    epoch: string | null;
+    lowerTime: string | null;
+    upperTime: string | null;
+}
+/**
+ * GET /api/proofs/digest/{digest} response.
+ * causalWindow naming note: anchorBefore is the EARLIER Ethereum block (the
+ * proof was BitGraphed after it, the lower time bound); anchorAfter is the
+ * LATER block (the upper bound). Present time as "between lower and upper".
+ */
+export interface ProofDetailResponse {
+    proofs: Array<{
+        proof: BitGraphProof;
+    }>;
+    positions?: PositionView[];
+    causalWindow?: {
+        anchorBefore: AnchorView | null;
+        anchorAfter: AnchorView | null;
+    } | null;
+    anchorBlock?: AnchorView | null;
+}
+/** GET /api/search response. */
+export interface SearchResponse {
+    found: boolean;
+    digest?: string;
+    counter?: string | null;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AAEH,MAAM,WAAW,WAAW;IAC1B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,aAAa;IAC5B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IACpD,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,MAAM,CAAC,EAAE;QAAE,YAAY,CAAC,EAAE,MAAM,CAAC;QAAC,YAAY,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAC1D,WAAW,CAAC,EAAE;QACZ,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,WAAW,CAAC,EAAE;YAAE,MAAM,CAAC,EAAE,MAAM,CAAC;YAAC,SAAS,CAAC,EAAE,MAAM,CAAA;SAAE,CAAC;KACvD,CAAC;IACF,WAAW,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAClE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CACtB;AAED,uFAAuF;AACvF,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,MAAM,EAAE,KAAK,CAAC;YAAE,KAAK,EAAE,aAAa,CAAA;SAAE,CAAC,CAAA;KAAE,CAAC,CAAC;CACtE;AAED,MAAM,WAAW,UAAU;IACzB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3B;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B;AAED;;;;;GAKG;AACH,MAAM,WAAW,mBAAmB;IAClC,MAAM,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,aAAa,CAAA;KAAE,CAAC,CAAC;IACxC,SAAS,CAAC,EAAE,YAAY,EAAE,CAAC;IAC3B,YAAY,CAAC,EAAE;QAAE,YAAY,EAAE,UAAU,GAAG,IAAI,CAAC;QAAC,WAAW,EAAE,UAAU,GAAG,IAAI,CAAA;KAAE,GAAG,IAAI,CAAC;IAC1F,WAAW,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC;CACjC;AAED,gCAAgC;AAChC,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,OAAO,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB"}

package/dist/types.js

@@ -0,0 +1,3 @@
+// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,qFAAqF"}

package/package.json

@@ -0,0 +1,47 @@
+{
+  "name": "@mikeargento/bitgraph-mcp",
+  "version": "0.1.1",
+  "description": "MCP server for BitGraph. Take a BitGraph of a file, check whether bytes are on record, and fetch proofs from any MCP client.",
+  "license": "MIT",
+  "homepage": "https://bitgraph.ing",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/mikeargento/bitgraph.git",
+    "directory": "packages/mcp"
+  },
+  "type": "module",
+  "main": "./dist/server.js",
+  "types": "./dist/server.d.ts",
+  "bin": {
+    "bitgraph-mcp": "dist/index.js"
+  },
+  "exports": {
+    ".": {
+      "import": "./dist/server.js",
+      "types": "./dist/server.d.ts"
+    }
+  },
+  "files": [
+    "dist",
+    "src",
+    "README.md",
+    "LICENSE"
+  ],
+  "scripts": {
+    "build": "tsc",
+    "prepack": "tsc",
+    "typecheck": "tsc --noEmit",
+    "test": "tsc && node --test 'dist/__tests__/*.test.js'"
+  },
+  "engines": {
+    "node": ">=20"
+  },
+  "dependencies": {
+    "@modelcontextprotocol/sdk": "^1.29.0",
+    "zod": "^3.25.0"
+  },
+  "devDependencies": {
+    "@types/node": "^20.0.0",
+    "typescript": "^5.4.0"
+  }
+}

package/src/__tests__/encoding.test.ts

@@ -0,0 +1,64 @@
+// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+
+import { test } from "node:test";
+import { strict as assert } from "node:assert";
+import { createHash } from "node:crypto";
+import { writeFile, mkdtemp } from "node:fs/promises";
+import { tmpdir } from "node:os";
+import { join } from "node:path";
+import {
+  fromUrlSafeB64,
+  looksLikeDigest,
+  mapConcurrent,
+  sha256FileB64,
+  toUrlSafeB64,
+} from "../encoding.js";
+
+// A real 32-byte digest with + and / to exercise both substitutions.
+const STANDARD = createHash("sha256").update("bitgraph").digest("base64");
+
+test("url-safe round trip preserves the digest", () => {
+  const safe = toUrlSafeB64(STANDARD);
+  assert.ok(!safe.includes("+") && !safe.includes("/") && !safe.includes("="));
+  assert.equal(fromUrlSafeB64(safe), STANDARD);
+});
+
+test("fromUrlSafeB64 is a no-op on standard base64", () => {
+  assert.equal(fromUrlSafeB64(STANDARD), STANDARD);
+});
+
+test("looksLikeDigest accepts both forms, rejects junk", () => {
+  assert.ok(looksLikeDigest(STANDARD));
+  assert.ok(looksLikeDigest(toUrlSafeB64(STANDARD)));
+  assert.ok(!looksLikeDigest("not-a-digest"));
+  assert.ok(!looksLikeDigest(""));
+  assert.ok(!looksLikeDigest(Buffer.alloc(16).toString("base64"))); // 16 bytes, not 32
+});
+
+test("sha256FileB64 matches crypto over the same bytes", async () => {
+  const dir = await mkdtemp(join(tmpdir(), "bitgraph-mcp-"));
+  const file = join(dir, "sample.bin");
+  const bytes = Buffer.from("BitGraph proves causal ordering.\n");
+  await writeFile(file, bytes);
+  const expected = createHash("sha256").update(bytes).digest("base64");
+  assert.equal(await sha256FileB64(file), expected);
+});
+
+test("sha256FileB64 rejects directories and missing files", async () => {
+  await assert.rejects(() => sha256FileB64(tmpdir()), /Not a regular file/);
+  await assert.rejects(() => sha256FileB64(join(tmpdir(), "definitely-missing-9x7")));
+});
+
+test("mapConcurrent preserves order and honors the limit", async () => {
+  let inFlight = 0;
+  let peak = 0;
+  const out = await mapConcurrent([1, 2, 3, 4, 5, 6, 7, 8], 3, async (n) => {
+    inFlight += 1;
+    peak = Math.max(peak, inFlight);
+    await new Promise((r) => setTimeout(r, 5));
+    inFlight -= 1;
+    return n * 2;
+  });
+  assert.deepEqual(out, [2, 4, 6, 8, 10, 12, 14, 16]);
+  assert.ok(peak <= 3, `peak concurrency ${peak} exceeded 3`);
+});