@seanhogg/builderforce-memory-mcp 2026.10.3 → 2026.10.22

package/dist/compaction-tools.d.ts

@@ -0,0 +1,15 @@
+/**
+ * The lossless compaction pair — `memory_compact` and `memory_restore` — split out
+ * of tools.ts the same way the gateway and experience families are.
+ *
+ * `memory_compact` stubs a fact only after archiving its original and proving the
+ * local Evermind absorbed it; `memory_restore` brings back the text of stubs that
+ * predate archiving (`contentLost`). The rules are compaction.ts / restore.ts; this
+ * module is only their I/O against a MemoryBackend.
+ */
+import type { MemoryBackend } from "./backend.js";
+import { type MemoryTool } from "./tool-core.js";
+import type { MemoryToolsOptions } from "./tools.js";
+/** Registers `memory_compact` and `memory_restore`. Caller checks the backend is writable. */
+export declare function appendCompactionTools(tools: MemoryTool[], backend: MemoryBackend, opts: Pick<MemoryToolsOptions, "recallProbe" | "readRestoreFile">): void;
+//# sourceMappingURL=compaction-tools.d.ts.map

package/dist/compaction-tools.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compaction-tools.d.ts","sourceRoot":"","sources":["../src/compaction-tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAE,aAAa,EAA4B,MAAM,cAAc,CAAC;AAG5E,OAAO,EAAY,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC3D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAkCrD,8FAA8F;AAC9F,wBAAgB,qBAAqB,CACjC,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,EAAE,aAAa,EACtB,IAAI,EAAE,IAAI,CAAC,kBAAkB,EAAE,aAAa,GAAG,iBAAiB,CAAC,GAClE,IAAI,CAuJN"}

package/dist/compaction-tools.js

@@ -0,0 +1,192 @@
+/**
+ * The lossless compaction pair — `memory_compact` and `memory_restore` — split out
+ * of tools.ts the same way the gateway and experience families are.
+ *
+ * `memory_compact` stubs a fact only after archiving its original and proving the
+ * local Evermind absorbed it; `memory_restore` brings back the text of stubs that
+ * predate archiving (`contentLost`). The rules are compaction.ts / restore.ts; this
+ * module is only their I/O against a MemoryBackend.
+ */
+import { z } from "zod";
+import { DEFAULT_STUB_CHARS, planLosslessCompaction } from "./compaction.js";
+import { parseRestoreSource, planRestore, restoredArchive } from "./restore.js";
+import { fail, ok } from "./tool-core.js";
+const SKIP_REASONS = {
+    not_found: "not found",
+    already_compacted: "already compacted",
+    not_smaller: "already shorter than its stub",
+    no_probe: "no local Evermind model to prove it was absorbed (set BUILDERFORCE_MEMORY_MODEL)",
+    probe_failed: "the Evermind model could not answer a recall question about it — not absorbed yet",
+    no_archive: "this backend cannot archive the original, so stubbing would lose it",
+};
+/** One-line compaction receipt: what shrank, what it saved, and what was left alone. */
+function renderCompaction(compacted, bytesSaved, skipped) {
+    const lines = [`Compacted ${compacted} memory(ies), ${bytesSaved} character(s) reclaimed.`];
+    for (const s of skipped)
+        lines.push(`• skipped ${s.key} — ${SKIP_REASONS[s.reason]}`);
+    return lines.join("\n");
+}
+/** `memory_restore` input: inline JSON always; a file path only where the host may read its disk. */
+function restoreSchema(allowFile) {
+    const shape = {
+        json: z.string().optional().describe("The export itself, as JSON text (array, or JSON Lines)."),
+    };
+    if (allowFile)
+        shape["file"] = z.string().optional().describe("Path to a JSON export file to restore from.");
+    return shape;
+}
+/** Write a batch through the backend's batch path when it has one. */
+async function writeAll(backend, writes) {
+    if (writes.length === 0)
+        return;
+    if (backend.rememberMany)
+        await backend.rememberMany(writes);
+    else
+        for (const w of writes)
+            await backend.remember(w);
+}
+/** Registers `memory_compact` and `memory_restore`. Caller checks the backend is writable. */
+export function appendCompactionTools(tools, backend, opts) {
+    // memory_compact — the FIRST-CLASS compaction path. It writes through the live
+    // store (get → plan → archive → remember), so a durable backend's in-memory state
+    // and its on-disk snapshot agree afterwards. It is LOSSLESS: each original is
+    // archived before its body is stubbed, and only facts the local Evermind answers
+    // a recall probe about are stubbed at all (see planLosslessCompaction).
+    tools.push({
+        name: "memory_compact",
+        description: "Shrink memories that have already been absorbed into the local Evermind model down to " +
+            "a one-line pointer stub, reclaiming the context they were eating. Each fact is first " +
+            "checked with a recall question put to the model; facts it cannot answer stay as they " +
+            "are. The full original is archived and memory_recall / memory_get still return it, so " +
+            "nothing is lost. Already-compacted keys are skipped, so repeating the call is safe.",
+        inputSchema: {
+            keys: z.array(z.string()).min(1).describe("Exact keys of the memories to compact."),
+            stub: z
+                .string()
+                .optional()
+                .describe("Explicit replacement body applied to every listed key. Omit to generate " +
+                "'[absorbed→Evermind vN] <first line>' from each entry's own first line."),
+            version: z
+                .number()
+                .int()
+                .min(0)
+                .optional()
+                .describe("Version of the model that absorbed these facts; appears in the generated stub."),
+            maxChars: z
+                .number()
+                .int()
+                .min(20)
+                .max(500)
+                .optional()
+                .describe(`Max characters of the generated pointer line (default ${DEFAULT_STUB_CHARS}).`),
+        },
+        handler: async (args) => {
+            try {
+                const raw = args["keys"];
+                const keys = Array.isArray(raw) ? raw.map((k) => String(k)).filter(Boolean) : [];
+                if (keys.length === 0)
+                    return fail("keys is required.");
+                // ONE read pass: the hit carries both the body the plan reasons about
+                // and the tags/importance the rewrite must preserve. A stub resolved to
+                // its archive reports the STORED stub in `hit.stub` — that is what the
+                // plan must see, or an archived fact would be compacted again.
+                const hits = new Map();
+                for (const key of keys) {
+                    const hit = await backend.get(key);
+                    if (hit)
+                        hits.set(key, hit);
+                }
+                const plan = await planLosslessCompaction(keys.map((key) => {
+                    const hit = hits.get(key);
+                    return { key, content: hit ? (hit.stub ?? hit.content) : undefined };
+                }), {
+                    stub: typeof args["stub"] === "string" ? args["stub"] : undefined,
+                    version: args["version"] == null ? undefined : Number(args["version"]),
+                    maxChars: args["maxChars"] == null ? undefined : Number(args["maxChars"]),
+                    probe: opts.recallProbe ?? null,
+                    canArchive: typeof backend.archive === "function",
+                });
+                if (plan.writes.length > 0) {
+                    // Originals FIRST, durably — only then may the bodies become stubs.
+                    await backend.archive(plan.writes.map((w) => w.archive));
+                    // Preserve tags/importance — compaction shortens a body, it does not
+                    // reclassify the fact.
+                    await writeAll(backend, plan.writes.map((w) => {
+                        const prev = hits.get(w.key);
+                        return { key: w.key, content: w.content, tags: prev?.tags, importance: prev?.importance };
+                    }));
+                }
+                return ok(renderCompaction(plan.writes.length, plan.bytesSaved, plan.skipped));
+            }
+            catch (err) {
+                return fail(`compact failed: ${String(err)}`);
+            }
+        },
+    });
+    // memory_restore — the way back for stubs whose original was never archived
+    // (`contentLost`). The text is matched to a stub by key, or by its first line
+    // against the stub's pointer, then archived beside the stub (the stub stays, so
+    // the token saving stays) — or written back as the body on a backend that
+    // cannot archive.
+    tools.push({
+        name: "memory_restore",
+        description: "Restore the full text of memories marked '(content lost)' — compaction stubs whose " +
+            "original was never kept — from an export. Accepts [{key, content}] (a memory export) " +
+            "or the Evermind coordinator's [{id, text}] record dump; records are matched by key, " +
+            "else by their first line against the stub. Restored memories recall in full again.",
+        inputSchema: restoreSchema(!!opts.readRestoreFile),
+        handler: async (args) => {
+            try {
+                const file = typeof args["file"] === "string" ? args["file"] : "";
+                let text = typeof args["json"] === "string" ? args["json"] : "";
+                if (file && opts.readRestoreFile)
+                    text = await opts.readRestoreFile(file);
+                if (!text.trim())
+                    return fail(opts.readRestoreFile ? "file or json is required." : "json is required.");
+                const records = parseRestoreSource(text);
+                if (records.length === 0)
+                    return fail("no restorable records (need {key, content} or {id, text} rows).");
+                // Targets: the lost stubs (all of them when the backend can list them,
+                // else just the keys the records name).
+                const keys = new Set(backend.lostKeys ? await backend.lostKeys() : []);
+                for (const r of records)
+                    if (r.key)
+                        keys.add(r.key);
+                const targets = [];
+                const hits = new Map();
+                for (const key of keys) {
+                    const hit = await backend.get(key);
+                    if (!hit?.contentLost)
+                        continue;
+                    hits.set(key, hit);
+                    targets.push({ key, stub: hit.content });
+                }
+                const plan = planRestore(records, targets);
+                if (plan.matches.length > 0) {
+                    if (backend.archive) {
+                        await backend.archive(plan.matches.map((m) => restoredArchive(m, hits.get(m.key).content)));
+                    }
+                    else {
+                        await writeAll(backend, plan.matches.map((m) => {
+                            const prev = hits.get(m.key);
+                            return { key: m.key, content: m.content, tags: prev?.tags, importance: prev?.importance };
+                        }));
+                    }
+                }
+                const lines = [
+                    `Restored ${plan.matches.length} memory(ies) of ${targets.length} with lost content.`,
+                    ...plan.matches.map((m) => `• ${m.key} (matched by ${m.via})`),
+                ];
+                if (plan.ambiguous.length > 0)
+                    lines.push(`Ambiguous (left alone): ${plan.ambiguous.join(", ")}`);
+                if (plan.unmatched > 0)
+                    lines.push(`${plan.unmatched} record(s) matched no lost memory.`);
+                return ok(lines.join("\n"));
+            }
+            catch (err) {
+                return fail(`restore failed: ${String(err)}`);
+            }
+        },
+    });
+}
+//# sourceMappingURL=compaction-tools.js.map

package/dist/compaction-tools.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compaction-tools.js","sourceRoot":"","sources":["../src/compaction-tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,kBAAkB,EAAE,sBAAsB,EAAuB,MAAM,iBAAiB,CAAC;AAClG,OAAO,EAAE,kBAAkB,EAAE,WAAW,EAAE,eAAe,EAAsB,MAAM,cAAc,CAAC;AACpG,OAAO,EAAE,IAAI,EAAE,EAAE,EAAmB,MAAM,gBAAgB,CAAC;AAG3D,MAAM,YAAY,GAA6C;IAC3D,SAAS,EAAE,WAAW;IACtB,iBAAiB,EAAE,mBAAmB;IACtC,WAAW,EAAE,+BAA+B;IAC5C,QAAQ,EAAE,kFAAkF;IAC5F,YAAY,EAAE,mFAAmF;IACjG,UAAU,EAAE,qEAAqE;CACpF,CAAC;AAEF,wFAAwF;AACxF,SAAS,gBAAgB,CAAC,SAAiB,EAAE,UAAkB,EAAE,OAAyB;IACtF,MAAM,KAAK,GAAG,CAAC,aAAa,SAAS,iBAAiB,UAAU,0BAA0B,CAAC,CAAC;IAC5F,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACtF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC;AAED,qGAAqG;AACrG,SAAS,aAAa,CAAC,SAAkB;IACrC,MAAM,KAAK,GAAkB;QACzB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,yDAAyD,CAAC;KAClG,CAAC;IACF,IAAI,SAAS;QAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,6CAA6C,CAAC,CAAC;IAC7G,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,sEAAsE;AACtE,KAAK,UAAU,QAAQ,CAAC,OAAsB,EAAE,MAAuB;IACnE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAChC,IAAI,OAAO,CAAC,YAAY;QAAE,MAAM,OAAO,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;;QACxD,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,MAAM,OAAO,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,qBAAqB,CACjC,KAAmB,EACnB,OAAsB,EACtB,IAAiE;IAEjE,+EAA+E;IAC/E,kFAAkF;IAClF,8EAA8E;IAC9E,iFAAiF;IACjF,wEAAwE;IACxE,KAAK,CAAC,IAAI,CAAC;QACP,IAAI,EAAE,gBAAgB;QACtB,WAAW,EACP,wFAAwF;YACxF,uFAAuF;YACvF,uFAAuF;YACvF,wFAAwF;YACxF,qFAAqF;QACzF,WAAW,EAAE;YACT,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,wCAAwC,CAAC;YACnF,IAAI,EAAE,CAAC;iBACF,MAAM,EAAE;iBACR,QAAQ,EAAE;iBACV,QAAQ,CACL,0EAA0E;gBACtE,yEAAyE,CAChF;YACL,OAAO,EAAE,CAAC;iBACL,MAAM,EAAE;iBACR,GAAG,EAAE;iBACL,GAAG,CAAC,CAAC,CAAC;iBACN,QAAQ,EAAE;iBACV,QAAQ,CAAC,gFAAgF,CAAC;YAC/F,QAAQ,EAAE,CAAC;iBACN,MAAM,EAAE;iBACR,GAAG,EAAE;iBACL,GAAG,CAAC,EAAE,CAAC;iBACP,GAAG,CAAC,GAAG,CAAC;iBACR,QAAQ,EAAE;iBACV,QAAQ,CAAC,yDAAyD,kBAAkB,IAAI,CAAC;SACjG;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;YACpB,IAAI,CAAC;gBACD,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;gBACzB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC;gBAExD,sEAAsE;gBACtE,wEAAwE;gBACxE,uEAAuE;gBACvE,+DAA+D;gBAC/D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;gBAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACrB,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACnC,IAAI,GAAG;wBAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBAChC,CAAC;gBAED,MAAM,IAAI,GAAG,MAAM,sBAAsB,CACrC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;oBACb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAC1B,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;gBACzE,CAAC,CAAC,EACF;oBACI,IAAI,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,IAAI,CAAC,MAAM,CAAY,CAAC,CAAC,CAAC,SAAS;oBAC7E,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACtE,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACzE,KAAK,EAAE,IAAI,CAAC,WAAW,IAAI,IAAI;oBAC/B,UAAU,EAAE,OAAO,OAAO,CAAC,OAAO,KAAK,UAAU;iBACpD,CACJ,CAAC;gBAEF,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,oEAAoE;oBACpE,MAAM,OAAO,CAAC,OAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;oBAC1D,qEAAqE;oBACrE,uBAAuB;oBACvB,MAAM,QAAQ,CACV,OAAO,EACP,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;wBAClB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;oBAC9F,CAAC,CAAC,CACL,CAAC;gBACN,CAAC;gBAED,OAAO,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YACnF,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACX,OAAO,IAAI,CAAC,mBAAmB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClD,CAAC;QACL,CAAC;KACJ,CAAC,CAAC;IAEH,4EAA4E;IAC5E,8EAA8E;IAC9E,gFAAgF;IAChF,0EAA0E;IAC1E,kBAAkB;IAClB,KAAK,CAAC,IAAI,CAAC;QACP,IAAI,EAAE,gBAAgB;QACtB,WAAW,EACP,qFAAqF;YACrF,uFAAuF;YACvF,sFAAsF;YACtF,oFAAoF;QACxF,WAAW,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC;QAClD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;YACpB,IAAI,CAAC;gBACD,MAAM,IAAI,GAAG,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,IAAI,CAAC,MAAM,CAAY,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9E,IAAI,IAAI,GAAG,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,IAAI,CAAC,MAAM,CAAY,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5E,IAAI,IAAI,IAAI,IAAI,CAAC,eAAe;oBAAE,IAAI,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;gBAC1E,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;oBAAE,OAAO,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,2BAA2B,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC;gBAExG,MAAM,OAAO,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;gBACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC,iEAAiE,CAAC,CAAC;gBAEzG,uEAAuE;gBACvE,wCAAwC;gBACxC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC/E,KAAK,MAAM,CAAC,IAAI,OAAO;oBAAE,IAAI,CAAC,CAAC,GAAG;wBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpD,MAAM,OAAO,GAAoB,EAAE,CAAC;gBACpC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;gBAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACrB,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACnC,IAAI,CAAC,GAAG,EAAE,WAAW;wBAAE,SAAS;oBAChC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;oBACnB,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;gBAC7C,CAAC;gBAED,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBAC3C,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC1B,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;wBAClB,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBACjG,CAAC;yBAAM,CAAC;wBACJ,MAAM,QAAQ,CACV,OAAO,EACP,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;4BACnB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;4BAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;wBAC9F,CAAC,CAAC,CACL,CAAC;oBACN,CAAC;gBACL,CAAC;gBAED,MAAM,KAAK,GAAG;oBACV,YAAY,IAAI,CAAC,OAAO,CAAC,MAAM,mBAAmB,OAAO,CAAC,MAAM,qBAAqB;oBACrF,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,GAAG,GAAG,CAAC;iBACjE,CAAC;gBACF,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,2BAA2B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClG,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,oCAAoC,CAAC,CAAC;gBAC1F,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAChC,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACX,OAAO,IAAI,CAAC,mBAAmB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClD,CAAC;QACL,CAAC;KACJ,CAAC,CAAC;AACP,CAAC"}

package/dist/compaction.d.ts

@@ -1,5 +1,5 @@
 /**
- * Compaction — turning an ABSORBED memory into a terse pointer stub.
+ * Compaction — turning an ABSORBED memory into a terse pointer stub, LOSSLESSLY.
  *
  * Once a fact has been folded into an Evermind (or any downstream learner) the
  * full body has done its job: keeping it verbatim in the store means every
@@ -7,10 +7,24 @@
  * Compaction replaces the body with a one-line `[absorbed→Evermind vN] <first
  * line>` pointer, so the fact stops filling context while it stays findable.
  *
+ * Two rules make that safe:
+ *   1. The full original is ARCHIVED before the body is stubbed — in a sidecar
+ *      `<memory>.archive.json` beside the snapshot, never inside it, so it survives
+ *      the snapshot round-trip, an external rewrite of the snapshot, and the
+ *      store's entry cap / eviction. Recall resolves a stub back to its archive.
+ *   2. A fact is stubbed only after a RECALL PROBE passes: a question generated
+ *      from the fact is put to the local Evermind model, and an answer that does
+ *      not carry the fact (or no model at all) leaves the fact uncompacted —
+ *      "absorbed" is proven, not asserted.
+ *
+ * A stub with no archive is a fact whose text is gone (compacted before rule 1
+ * existed): {@link isContentLost} names it, and every reader labels it with
+ * {@link CONTENT_LOST_LABEL} until `memory_restore` brings the text back.
+ *
  * The rules live here — not in the tool handler and not in a transport — because
  * BOTH the in-process `memory_compact` tool and any external compactor (the
- * BuilderForce VS Code extension rewrites the snapshot directly) must produce
- * byte-identical stubs; otherwise re-running either one re-stubs the other's work.
+ * BuilderForce VS Code extension) must produce byte-identical stubs and the same
+ * archive; otherwise re-running either one re-stubs the other's work.
  *
  * Dependency-free and published as its own subpath
  * (`@seanhogg/builderforce-memory-mcp/compaction`), so an external compactor imports
@@ -31,23 +45,48 @@ export declare function isStub(content: string): boolean;
 export declare function firstLine(content: string, max?: number): string;
 /** Build the terse stub that replaces an absorbed entry's body. */
 export declare function memoryStub(content: string, version: number, maxChars?: number): string;
+/** The pointer text inside a stub (after the `] `), without a trailing ellipsis. */
+export declare function stubPointer(stub: string): string;
 /** One entry considered for compaction. */
 export interface CompactionCandidate {
     key: string;
     content: string;
 }
-/** A body rewrite the caller should apply. */
+/**
+ * The full original of a compacted fact — what the archive keeps so a stub is
+ * never the only copy. Written BEFORE the stub replaces the body.
+ */
+export interface ArchivedFact {
+    key: string;
+    /** The original, full body. */
+    content: string;
+    /** The stub that replaced it. */
+    stub: string;
+    /** Evermind version that absorbed it. */
+    version: number;
+    /** Unix ms the archive row was written. */
+    archivedAt: number;
+}
+/** A body rewrite the caller should apply — archive `archive` FIRST, then write `content`. */
 export interface CompactionWrite {
     key: string;
     /** The stub that replaces the entry's body. */
     content: string;
     /** Characters recovered by this rewrite. */
     bytesSaved: number;
+    /** The original body, to be archived before the stub is written. */
+    archive: ArchivedFact;
 }
 /** Why a candidate was left alone. */
 export interface CompactionSkip {
     key: string;
-    reason: "not_found" | "already_compacted" | "not_smaller";
+    reason: "not_found" | "already_compacted" | "not_smaller"
+    /** No local model to probe with — the fact cannot be proven absorbed. */
+     | "no_probe"
+    /** The model could not answer the probe question generated from the fact. */
+     | "probe_failed"
+    /** The caller cannot archive the original, so stubbing would lose it. */
+     | "no_archive";
 }
 /** The decided plan: what to write, what to leave, and the total recovered. */
 export interface CompactionPlan {
@@ -63,14 +102,81 @@ export interface CompactionOptions {
     version?: number;
     /** Max characters of a generated pointer line. Default {@link DEFAULT_STUB_CHARS}. */
     maxChars?: number;
+    /** Clock for {@link ArchivedFact.archivedAt}. Default `Date.now()`. */
+    now?: number;
 }
 /**
- * Decide the compaction for a set of candidates. Pure — no I/O — so the same
- * rules are unit-testable and reusable by any caller that can read and write
- * memories. `undefined` content means the key was not found.
+ * Decide the STRUCTURAL compaction for a set of candidates: what is already a
+ * stub, what would not shrink. Pure — no I/O — and NOT the whole contract: a
+ * caller must still archive each write's `archive` before applying it, and prove
+ * absorption — {@link planLosslessCompaction} runs this and then the probe.
+ * `undefined` content means the key was not found.
  */
 export declare function planCompaction(candidates: Array<CompactionCandidate | {
     key: string;
     content: undefined;
 }>, opts?: CompactionOptions): CompactionPlan;
+/**
+ * The local model compaction asks before it stubs a fact. `answer` returns the
+ * model's text for a question, or null when it cannot answer at all.
+ */
+export interface RecallProbe {
+    answer(question: string): Promise<string | null>;
+}
+/** A question generated from one fact, and the token a correct answer must carry. */
+export interface ProbeQuestion {
+    question: string;
+    expected: string;
+}
+/**
+ * A cloze question over the fact's pointer line: its most identifying token is
+ * blanked and the model must supply it. Deterministic, so the same fact always
+ * gets the same question. Null when the line has nothing worth blanking.
+ */
+export declare function probeQuestionFor(key: string, content: string): ProbeQuestion | null;
+/** True when the model's answer carries the blanked token (case-insensitive). */
+export declare function probePasses(answer: string | null | undefined, expected: string): boolean;
+/** Options for {@link planLosslessCompaction}. */
+export interface LosslessCompactionOptions extends CompactionOptions {
+    /** The local model to prove absorption with. Null/absent → nothing is stubbed. */
+    probe?: RecallProbe | null;
+    /** False when the caller cannot archive originals → nothing is stubbed. Default true. */
+    canArchive?: boolean;
+}
+/**
+ * The full compaction contract: {@link planCompaction}'s structural rules, then a
+ * recall probe per surviving write. A write is kept only when the model answers
+ * the question generated from its fact; otherwise the fact stays uncompacted and
+ * the reason is recorded. The caller then archives every write's `archive` BEFORE
+ * applying its stub.
+ */
+export declare function planLosslessCompaction(candidates: Array<CompactionCandidate | {
+    key: string;
+    content: undefined;
+}>, opts?: LosslessCompactionOptions): Promise<CompactionPlan>;
+/**
+ * Label every reader attaches to a stub whose original text no longer exists
+ * anywhere (compacted before archiving existed).
+ */
+export declare const CONTENT_LOST_LABEL = "(content lost \u2014 re-verify before relying on it)";
+/**
+ * Where the archive lives: beside the snapshot, under the same name — the same
+ * convention as the vector cache (`memory.json` → `memory.archive.json`).
+ */
+export declare function defaultArchiveFile(memoryFile: string): string;
+/** True when `content` is a stub AND no archived original exists for it. */
+export declare function isContentLost(content: string, archived: ArchivedFact | undefined): boolean;
+/** On-disk archive: key → the latest archived original for that key. Never pruned. */
+export interface ArchiveSnapshot {
+    version: 1;
+    facts: Record<string, ArchivedFact>;
+}
+/** Parse archive text; an absent/corrupt file is an empty archive. */
+export declare function parseArchive(text: string | null | undefined): Record<string, ArchivedFact>;
+/**
+ * Merge `facts` into archive text, returning the next text. Rows are only ever
+ * added or replaced by a newer archive of the same key — never removed — so a
+ * forgotten or evicted stub keeps its original.
+ */
+export declare function mergeArchive(text: string | null | undefined, facts: ArchivedFact[]): string;
 //# sourceMappingURL=compaction.d.ts.map

package/dist/compaction.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compaction.d.ts","sourceRoot":"","sources":["../src/compaction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH;;;;GAIG;AACH,eAAO,MAAM,WAAW,4BAAuB,CAAC;AAEhD,6DAA6D;AAC7D,eAAO,MAAM,kBAAkB,MAAM,CAAC;AAEtC,qDAAqD;AACrD,wBAAgB,MAAM,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAE/C;AAED,4FAA4F;AAC5F,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,SAAqB,GAAG,MAAM,CAO3E;AAED,mEAAmE;AACnE,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,SAAqB,GAAG,MAAM,CAElG;AAED,2CAA2C;AAC3C,MAAM,WAAW,mBAAmB;IAChC,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;CACnB;AAED,8CAA8C;AAC9C,MAAM,WAAW,eAAe;IAC5B,GAAG,EAAE,MAAM,CAAC;IACZ,+CAA+C;IAC/C,OAAO,EAAE,MAAM,CAAC;IAChB,4CAA4C;IAC5C,UAAU,EAAE,MAAM,CAAC;CACtB;AAED,sCAAsC;AACtC,MAAM,WAAW,cAAc;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,WAAW,GAAG,mBAAmB,GAAG,aAAa,CAAC;CAC7D;AAED,+EAA+E;AAC/E,MAAM,WAAW,cAAc;IAC3B,MAAM,EAAE,eAAe,EAAE,CAAC;IAC1B,OAAO,EAAE,cAAc,EAAE,CAAC;IAC1B,UAAU,EAAE,MAAM,CAAC;CACtB;AAED,uDAAuD;AACvD,MAAM,WAAW,iBAAiB;IAC9B,8FAA8F;IAC9F,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,wFAAwF;IACxF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,sFAAsF;IACtF,QAAQ,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAC1B,UAAU,EAAE,KAAK,CAAC,mBAAmB,GAAG;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,SAAS,CAAA;CAAE,CAAC,EAC5E,IAAI,GAAE,iBAAsB,GAC7B,cAAc,CA6BhB"}
+{"version":3,"file":"compaction.d.ts","sourceRoot":"","sources":["../src/compaction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAEH;;;;GAIG;AACH,eAAO,MAAM,WAAW,4BAAuB,CAAC;AAEhD,6DAA6D;AAC7D,eAAO,MAAM,kBAAkB,MAAM,CAAC;AAEtC,qDAAqD;AACrD,wBAAgB,MAAM,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAE/C;AAED,4FAA4F;AAC5F,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,SAAqB,GAAG,MAAM,CAO3E;AAED,mEAAmE;AACnE,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,SAAqB,GAAG,MAAM,CAElG;AAED,oFAAoF;AACpF,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAKhD;AAED,2CAA2C;AAC3C,MAAM,WAAW,mBAAmB;IAChC,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,+BAA+B;IAC/B,OAAO,EAAE,MAAM,CAAC;IAChB,iCAAiC;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,yCAAyC;IACzC,OAAO,EAAE,MAAM,CAAC;IAChB,2CAA2C;IAC3C,UAAU,EAAE,MAAM,CAAC;CACtB;AAED,8FAA8F;AAC9F,MAAM,WAAW,eAAe;IAC5B,GAAG,EAAE,MAAM,CAAC;IACZ,+CAA+C;IAC/C,OAAO,EAAE,MAAM,CAAC;IAChB,4CAA4C;IAC5C,UAAU,EAAE,MAAM,CAAC;IACnB,oEAAoE;IACpE,OAAO,EAAE,YAAY,CAAC;CACzB;AAED,sCAAsC;AACtC,MAAM,WAAW,cAAc;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EACA,WAAW,GACX,mBAAmB,GACnB,aAAa;IACf,yEAAyE;OACvE,UAAU;IACZ,6EAA6E;OAC3E,cAAc;IAChB,yEAAyE;OACvE,YAAY,CAAC;CACtB;AAED,+EAA+E;AAC/E,MAAM,WAAW,cAAc;IAC3B,MAAM,EAAE,eAAe,EAAE,CAAC;IAC1B,OAAO,EAAE,cAAc,EAAE,CAAC;IAC1B,UAAU,EAAE,MAAM,CAAC;CACtB;AAED,uDAAuD;AACvD,MAAM,WAAW,iBAAiB;IAC9B,8FAA8F;IAC9F,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,wFAAwF;IACxF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,sFAAsF;IACtF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,uEAAuE;IACvE,GAAG,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAC1B,UAAU,EAAE,KAAK,CAAC,mBAAmB,GAAG;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,SAAS,CAAA;CAAE,CAAC,EAC5E,IAAI,GAAE,iBAAsB,GAC7B,cAAc,CAmChB;AAID;;;GAGG;AACH,MAAM,WAAW,WAAW;IACxB,MAAM,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;CACpD;AAED,qFAAqF;AACrF,MAAM,WAAW,aAAa;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CACpB;AAcD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI,CAYnF;AAED,iFAAiF;AACjF,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAGxF;AAED,kDAAkD;AAClD,MAAM,WAAW,yBAA0B,SAAQ,iBAAiB;IAChE,kFAAkF;IAClF,KAAK,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC;IAC3B,yFAAyF;IACzF,UAAU,CAAC,EAAE,OAAO,CAAC;CACxB;AAED;;;;;;GAMG;AACH,wBAAsB,sBAAsB,CACxC,UAAU,EAAE,KAAK,CAAC,mBAAmB,GAAG;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,SAAS,CAAA;CAAE,CAAC,EAC5E,IAAI,GAAE,yBAA8B,GACrC,OAAO,CAAC,cAAc,CAAC,CA6BzB;AAID;;;GAGG;AACH,eAAO,MAAM,kBAAkB,yDAAoD,CAAC;AAEpF;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,CAE7D;AAED,4EAA4E;AAC5E,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,YAAY,GAAG,SAAS,GAAG,OAAO,CAE1F;AAED,sFAAsF;AACtF,MAAM,WAAW,eAAe;IAC5B,OAAO,EAAE,CAAC,CAAC;IACX,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;CACvC;AAED,sEAAsE;AACtE,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAgB1F;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,CAK3F"}

package/dist/compaction.js

@@ -1,5 +1,5 @@
 /**
- * Compaction — turning an ABSORBED memory into a terse pointer stub.
+ * Compaction — turning an ABSORBED memory into a terse pointer stub, LOSSLESSLY.
  *
  * Once a fact has been folded into an Evermind (or any downstream learner) the
  * full body has done its job: keeping it verbatim in the store means every
@@ -7,10 +7,24 @@
  * Compaction replaces the body with a one-line `[absorbed→Evermind vN] <first
  * line>` pointer, so the fact stops filling context while it stays findable.
  *
+ * Two rules make that safe:
+ *   1. The full original is ARCHIVED before the body is stubbed — in a sidecar
+ *      `<memory>.archive.json` beside the snapshot, never inside it, so it survives
+ *      the snapshot round-trip, an external rewrite of the snapshot, and the
+ *      store's entry cap / eviction. Recall resolves a stub back to its archive.
+ *   2. A fact is stubbed only after a RECALL PROBE passes: a question generated
+ *      from the fact is put to the local Evermind model, and an answer that does
+ *      not carry the fact (or no model at all) leaves the fact uncompacted —
+ *      "absorbed" is proven, not asserted.
+ *
+ * A stub with no archive is a fact whose text is gone (compacted before rule 1
+ * existed): {@link isContentLost} names it, and every reader labels it with
+ * {@link CONTENT_LOST_LABEL} until `memory_restore` brings the text back.
+ *
  * The rules live here — not in the tool handler and not in a transport — because
  * BOTH the in-process `memory_compact` tool and any external compactor (the
- * BuilderForce VS Code extension rewrites the snapshot directly) must produce
- * byte-identical stubs; otherwise re-running either one re-stubs the other's work.
+ * BuilderForce VS Code extension) must produce byte-identical stubs and the same
+ * archive; otherwise re-running either one re-stubs the other's work.
  *
  * Dependency-free and published as its own subpath
  * (`@seanhogg/builderforce-memory-mcp/compaction`), so an external compactor imports
@@ -41,13 +55,23 @@ export function firstLine(content, max = DEFAULT_STUB_CHARS) {
 export function memoryStub(content, version, maxChars = DEFAULT_STUB_CHARS) {
     return `${STUB_PREFIX} v${version}] ${firstLine(content, maxChars)}`;
 }
+/** The pointer text inside a stub (after the `] `), without a trailing ellipsis. */
+export function stubPointer(stub) {
+    const s = stub.trim();
+    const close = s.indexOf("] ");
+    const pointer = isStub(s) && close >= 0 ? s.slice(close + 2) : s;
+    return pointer.replace(/…$/, "").trim();
+}
 /**
- * Decide the compaction for a set of candidates. Pure — no I/O — so the same
- * rules are unit-testable and reusable by any caller that can read and write
- * memories. `undefined` content means the key was not found.
+ * Decide the STRUCTURAL compaction for a set of candidates: what is already a
+ * stub, what would not shrink. Pure — no I/O — and NOT the whole contract: a
+ * caller must still archive each write's `archive` before applying it, and prove
+ * absorption — {@link planLosslessCompaction} runs this and then the probe.
+ * `undefined` content means the key was not found.
  */
 export function planCompaction(candidates, opts = {}) {
     const version = opts.version ?? 0;
+    const now = opts.now ?? Date.now();
     const maxChars = Math.max(20, opts.maxChars ?? DEFAULT_STUB_CHARS);
     const writes = [];
     const skipped = [];
@@ -69,9 +93,139 @@ export function planCompaction(candidates, opts = {}) {
             continue;
         }
         const saved = content.length - stub.length;
-        writes.push({ key: c.key, content: stub, bytesSaved: saved });
+        writes.push({
+            key: c.key,
+            content: stub,
+            bytesSaved: saved,
+            archive: { key: c.key, content, stub, version, archivedAt: now },
+        });
         bytesSaved += saved;
     }
     return { writes, skipped, bytesSaved };
 }
+const PROBE_BLANK = "____";
+/** Tokens of a line that a cloze question can blank: alphanumeric, 4+ chars. */
+function probeTokens(line) {
+    return (line.match(/[A-Za-z0-9][A-Za-z0-9_.-]*[A-Za-z0-9]/g) ?? []).filter((t) => t.length >= 4);
+}
+/** How identifying a token is: digits and capitals beat length (a name/version IS the fact). */
+function salience(token) {
+    return (/[0-9]/.test(token) ? 100 : 0) + (/[A-Z]/.test(token) ? 50 : 0) + token.length;
+}
+/**
+ * A cloze question over the fact's pointer line: its most identifying token is
+ * blanked and the model must supply it. Deterministic, so the same fact always
+ * gets the same question. Null when the line has nothing worth blanking.
+ */
+export function probeQuestionFor(key, content) {
+    const line = firstLine(content, 400);
+    const tokens = probeTokens(line);
+    if (tokens.length === 0)
+        return null;
+    let expected = tokens[0];
+    for (const t of tokens)
+        if (salience(t) > salience(expected))
+            expected = t;
+    const at = line.indexOf(expected);
+    const cloze = `${line.slice(0, at)}${PROBE_BLANK}${line.slice(at + expected.length)}`;
+    return {
+        question: `Stored memory "${key}": ${cloze}\nThe missing word (${PROBE_BLANK}) is:`,
+        expected,
+    };
+}
+/** True when the model's answer carries the blanked token (case-insensitive). */
+export function probePasses(answer, expected) {
+    if (typeof answer !== "string" || !expected)
+        return false;
+    return answer.toLowerCase().includes(expected.toLowerCase());
+}
+/**
+ * The full compaction contract: {@link planCompaction}'s structural rules, then a
+ * recall probe per surviving write. A write is kept only when the model answers
+ * the question generated from its fact; otherwise the fact stays uncompacted and
+ * the reason is recorded. The caller then archives every write's `archive` BEFORE
+ * applying its stub.
+ */
+export async function planLosslessCompaction(candidates, opts = {}) {
+    const structural = planCompaction(candidates, opts);
+    const writes = [];
+    const skipped = [...structural.skipped];
+    for (const w of structural.writes) {
+        if (opts.canArchive === false) {
+            skipped.push({ key: w.key, reason: "no_archive" });
+            continue;
+        }
+        if (!opts.probe) {
+            skipped.push({ key: w.key, reason: "no_probe" });
+            continue;
+        }
+        const q = probeQuestionFor(w.key, w.archive.content);
+        let answer = null;
+        if (q) {
+            try {
+                answer = await opts.probe.answer(q.question);
+            }
+            catch {
+                answer = null;
+            }
+        }
+        if (!q || !probePasses(answer, q.expected)) {
+            skipped.push({ key: w.key, reason: "probe_failed" });
+            continue;
+        }
+        writes.push(w);
+    }
+    return { writes, skipped, bytesSaved: writes.reduce((n, w) => n + w.bytesSaved, 0) };
+}
+// ── Archive + lost content ───────────────────────────────────────────────────
+/**
+ * Label every reader attaches to a stub whose original text no longer exists
+ * anywhere (compacted before archiving existed).
+ */
+export const CONTENT_LOST_LABEL = "(content lost — re-verify before relying on it)";
+/**
+ * Where the archive lives: beside the snapshot, under the same name — the same
+ * convention as the vector cache (`memory.json` → `memory.archive.json`).
+ */
+export function defaultArchiveFile(memoryFile) {
+    return memoryFile.replace(/\.json$/i, "") + ".archive.json";
+}
+/** True when `content` is a stub AND no archived original exists for it. */
+export function isContentLost(content, archived) {
+    return isStub(content) && !archived;
+}
+/** Parse archive text; an absent/corrupt file is an empty archive. */
+export function parseArchive(text) {
+    if (!text)
+        return {};
+    let parsed;
+    try {
+        parsed = JSON.parse(text);
+    }
+    catch {
+        return {};
+    }
+    const facts = parsed && typeof parsed === "object" ? parsed.facts : undefined;
+    if (!facts || typeof facts !== "object")
+        return {};
+    // Null prototype: a memory key is arbitrary text, "__proto__" included.
+    const out = Object.create(null);
+    for (const [key, f] of Object.entries(facts)) {
+        if (f && typeof f.content === "string")
+            out[key] = { ...f, key };
+    }
+    return out;
+}
+/**
+ * Merge `facts` into archive text, returning the next text. Rows are only ever
+ * added or replaced by a newer archive of the same key — never removed — so a
+ * forgotten or evicted stub keeps its original.
+ */
+export function mergeArchive(text, facts) {
+    const all = parseArchive(text);
+    for (const f of facts)
+        all[f.key] = f;
+    const snap = { version: 1, facts: all };
+    return `${JSON.stringify(snap, null, 2)}\n`;
+}
 //# sourceMappingURL=compaction.js.map

package/dist/compaction.js.map

@@ -1 +1 @@
-{"version":3,"file":"compaction.js","sourceRoot":"","sources":["../src/compaction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH;;;;GAIG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,oBAAoB,CAAC;AAEhD,6DAA6D;AAC7D,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAEtC,qDAAqD;AACrD,MAAM,UAAU,MAAM,CAAC,OAAe;IAClC,OAAO,OAAO,CAAC,SAAS,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;AACvD,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,SAAS,CAAC,OAAe,EAAE,GAAG,GAAG,kBAAkB;IAC/D,MAAM,IAAI,GACN,OAAO;SACF,KAAK,CAAC,OAAO,CAAC;SACd,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SACpB,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACzC,OAAO,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAC7E,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,UAAU,CAAC,OAAe,EAAE,OAAe,EAAE,QAAQ,GAAG,kBAAkB;IACtF,OAAO,GAAG,WAAW,KAAK,OAAO,KAAK,SAAS,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;AACzE,CAAC;AAwCD;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC1B,UAA4E,EAC5E,OAA0B,EAAE;IAE5B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,CAAC;IACnE,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;QAC1B,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACjD,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;YAClD,SAAS;QACb,CAAC;QACD,IAAI,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,mBAAmB,EAAE,CAAC,CAAC;YAC1D,SAAS;QACb,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QACjE,0EAA0E;QAC1E,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YAChC,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC,CAAC;YACpD,SAAS;QACb,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9D,UAAU,IAAI,KAAK,CAAC;IACxB,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;AAC3C,CAAC"}
+{"version":3,"file":"compaction.js","sourceRoot":"","sources":["../src/compaction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAEH;;;;GAIG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,oBAAoB,CAAC;AAEhD,6DAA6D;AAC7D,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAEtC,qDAAqD;AACrD,MAAM,UAAU,MAAM,CAAC,OAAe;IAClC,OAAO,OAAO,CAAC,SAAS,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;AACvD,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,SAAS,CAAC,OAAe,EAAE,GAAG,GAAG,kBAAkB;IAC/D,MAAM,IAAI,GACN,OAAO;SACF,KAAK,CAAC,OAAO,CAAC;SACd,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SACpB,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACzC,OAAO,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAC7E,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,UAAU,CAAC,OAAe,EAAE,OAAe,EAAE,QAAQ,GAAG,kBAAkB;IACtF,OAAO,GAAG,WAAW,KAAK,OAAO,KAAK,SAAS,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;AACzE,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,WAAW,CAAC,IAAY;IACpC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IACtB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;AAC5C,CAAC;AAqED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAC1B,UAA4E,EAC5E,OAA0B,EAAE;IAE5B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,CAAC;IACnE,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;QAC1B,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACjD,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;YAClD,SAAS;QACb,CAAC;QACD,IAAI,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,mBAAmB,EAAE,CAAC,CAAC;YAC1D,SAAS;QACb,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QACjE,0EAA0E;QAC1E,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YAChC,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC,CAAC;YACpD,SAAS;QACb,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC;YACR,GAAG,EAAE,CAAC,CAAC,GAAG;YACV,OAAO,EAAE,IAAI;YACb,UAAU,EAAE,KAAK;YACjB,OAAO,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE;SACnE,CAAC,CAAC;QACH,UAAU,IAAI,KAAK,CAAC;IACxB,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;AAC3C,CAAC;AAkBD,MAAM,WAAW,GAAG,MAAM,CAAC;AAE3B,gFAAgF;AAChF,SAAS,WAAW,CAAC,IAAY;IAC7B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,wCAAwC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;AACrG,CAAC;AAED,gGAAgG;AAChG,SAAS,QAAQ,CAAC,KAAa;IAC3B,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;AAC3F,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAW,EAAE,OAAe;IACzD,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC;YAAE,QAAQ,GAAG,CAAC,CAAC;IAC3E,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;IACtF,OAAO;QACH,QAAQ,EAAE,kBAAkB,GAAG,MAAM,KAAK,uBAAuB,WAAW,OAAO;QACnF,QAAQ;KACX,CAAC;AACN,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,WAAW,CAAC,MAAiC,EAAE,QAAgB;IAC3E,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC1D,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC;AACjE,CAAC;AAUD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CACxC,UAA4E,EAC5E,OAAkC,EAAE;IAEpC,MAAM,UAAU,GAAG,cAAc,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACpD,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,OAAO,GAAqB,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IAC1D,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,EAAE,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;YACnD,SAAS;QACb,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACd,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;YACjD,SAAS;QACb,CAAC;QACD,MAAM,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACrD,IAAI,MAAM,GAAkB,IAAI,CAAC;QACjC,IAAI,CAAC,EAAE,CAAC;YACJ,IAAI,CAAC;gBACD,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YACjD,CAAC;YAAC,MAAM,CAAC;gBACL,MAAM,GAAG,IAAI,CAAC;YAClB,CAAC;QACL,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC,CAAC;YACrD,SAAS;QACb,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC;AACzF,CAAC;AAED,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,iDAAiD,CAAC;AAEpF;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,UAAkB;IACjD,OAAO,UAAU,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,GAAG,eAAe,CAAC;AAChE,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,aAAa,CAAC,OAAe,EAAE,QAAkC;IAC7E,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;AACxC,CAAC;AAQD,sEAAsE;AACtE,MAAM,UAAU,YAAY,CAAC,IAA+B;IACxD,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,IAAI,MAAuC,CAAC;IAC5C,IAAI,CAAC;QACD,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAoC,CAAC;IACjE,CAAC;IAAC,MAAM,CAAC;QACL,OAAO,EAAE,CAAC;IACd,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IAC9E,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,EAAE,CAAC;IACnD,wEAAwE;IACxE,MAAM,GAAG,GAAiC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAiC,CAAC;IAC9F,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,OAAO,CAAC,CAAC,OAAO,KAAK,QAAQ;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;IACrE,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAA+B,EAAE,KAAqB;IAC/E,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACtC,MAAM,IAAI,GAAoB,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IACzD,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC;AAChD,CAAC"}