@seanhogg/builderforce-memory-mcp 2026.10.2 → 2026.10.22

package/dist/tools.d.ts

@@ -14,6 +14,7 @@
  * store back into context is more expensive than inlining it.
  */
 import type { MemoryBackend } from "./backend.js";
+import { type RecallProbe } from "./compaction.js";
 import type { ExperienceHost } from "./experience/host.js";
 import { type MemoryTool } from "./tool-core.js";
 export type { MemoryTool, ToolResult } from "./tool-core.js";
@@ -37,6 +38,18 @@ export interface MemoryToolsOptions {
      * beside the memory tools. See {@link createExperienceHost}.
      */
     experience?: ExperienceHost | null;
+    /**
+     * The local model `memory_compact` proves absorption with before it stubs a
+     * fact (see `planLosslessCompaction`). Null/absent → compaction stubs nothing
+     * and says why. The bins pass `lazyRecallProbe()` (the configured Evermind).
+     */
+    recallProbe?: RecallProbe | null;
+    /**
+     * Reads a restore source by path for `memory_restore`. Only hosts that may read
+     * their own disk pass it (the stdio bin); without it the tool takes inline JSON
+     * only, so a networked server never reads a caller-named file.
+     */
+    readRestoreFile?: (path: string) => Promise<string>;
 }
 /**
  * Builds the memory tool set bound to `backend`. Write tools are included only

package/dist/tools.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"tools.d.ts","sourceRoot":"","sources":["../src/tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,KAAK,EAAE,aAAa,EAAwD,MAAM,cAAc,CAAC;AAGxG,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAE3D,OAAO,EAAkB,KAAK,UAAU,EAAmB,MAAM,gBAAgB,CAAC;AAElF,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAE7D,MAAM,WAAW,kBAAkB;IAC/B,2EAA2E;IAC3E,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iFAAiF;IACjF,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,oGAAoG;IACpG,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,mFAAmF;IACnF,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,UAAU,CAAC,EAAE,cAAc,GAAG,IAAI,CAAC;CACtC;AA2DD;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,aAAa,EAAE,IAAI,GAAE,kBAAuB,GAAG,UAAU,EAAE,CAiOpG"}
+{"version":3,"file":"tools.d.ts","sourceRoot":"","sources":["../src/tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,KAAK,EAAE,aAAa,EAAyC,MAAM,cAAc,CAAC;AACzF,OAAO,EAAsB,KAAK,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAGvE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAE3D,OAAO,EAAkB,KAAK,UAAU,EAAmB,MAAM,gBAAgB,CAAC;AAElF,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAE7D,MAAM,WAAW,kBAAkB;IAC/B,2EAA2E;IAC3E,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iFAAiF;IACjF,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,oGAAoG;IACpG,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,mFAAmF;IACnF,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,UAAU,CAAC,EAAE,cAAc,GAAG,IAAI,CAAC;IACnC;;;;OAIG;IACH,WAAW,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC;IACjC;;;;OAIG;IACH,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;CACvD;AAiDD;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,aAAa,EAAE,IAAI,GAAE,kBAAuB,GAAG,UAAU,EAAE,CAyJpG"}

package/dist/tools.js

@@ -14,7 +14,8 @@
  * store back into context is more expensive than inlining it.
  */
 import { z } from "zod";
-import { DEFAULT_STUB_CHARS, planCompaction } from "./compaction.js";
+import { CONTENT_LOST_LABEL } from "./compaction.js";
+import { appendCompactionTools } from "./compaction-tools.js";
 import { buildExperienceTools } from "./experience/tools.js";
 import { appendGatewayCostTools } from "./gateway-tools.js";
 import { clip, fail, ok } from "./tool-core.js";
@@ -32,6 +33,8 @@ const RANKER_LINE = {
     embedding: "Ranked by: semantic recall (SSM embedding fused with lexical).",
     lexical: "Ranked by: lexical recall (fallback - no embedding model loaded).",
 };
+/** A stub whose original is gone is surfaced WITH the label, never as a plain fact. */
+const lostLabel = (h) => (h.contentLost ? ` ${CONTENT_LOST_LABEL}` : "");
 function renderHits(hits, maxChars, method) {
     const ranker = method ? `\n${RANKER_LINE[method]}` : "";
     if (hits.length === 0)
@@ -40,7 +43,7 @@ function renderHits(hits, maxChars, method) {
         .map((h) => {
         const tags = h.tags?.length ? ` tags=[${h.tags.join(", ")}]` : "";
         const score = h.score != null ? ` score=${h.score.toFixed(3)}` : "";
-        return `• ${h.key}${score}${tags}\n  ${clip(h.content, maxChars)}`;
+        return `• ${h.key}${score}${tags}${lostLabel(h)}\n  ${clip(h.content, maxChars)}`;
     })
         .join("\n") + ranker);
 }
@@ -54,18 +57,6 @@ async function rankedRecall(backend, query, topK) {
         return backend.recallRanked(query, topK);
     return { hits: await backend.recall(query, topK) };
 }
-const SKIP_REASONS = {
-    not_found: "not found",
-    already_compacted: "already compacted",
-    not_smaller: "already shorter than its stub",
-};
-/** 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");
-}
 /**
  * Builds the memory tool set bound to `backend`. Write tools are included only
  * when `writable` is not false AND the backend actually implements them.
@@ -119,7 +110,9 @@ export function buildMemoryTools(backend, opts = {}) {
                     if (!key)
                         return fail("key is required.");
                     const hit = await backend.get(key);
-                    return hit ? ok(`• ${hit.key}\n  ${hit.content}`) : ok(`No memory found for key "${key}".`);
+                    return hit
+                        ? ok(`• ${hit.key}${lostLabel(hit)}\n  ${hit.content}`)
+                        : ok(`No memory found for key "${key}".`);
                 }
                 catch (err) {
                     return fail(`get failed: ${String(err)}`);
@@ -190,81 +183,9 @@ export function buildMemoryTools(backend, opts = {}) {
             },
         });
     }
-    // memory_compact — the FIRST-CLASS compaction path. It writes through the live
-    // store (get → plan → remember), so a durable backend's in-memory state and its
-    // on-disk snapshot agree afterwards. Compacting the snapshot file behind the
-    // server's back instead is what races: the server still holds the full bodies and
-    // re-snapshots over them on its next write. Requires read + write, so it is
-    // registered alongside the other write tools.
-    if (writable && backend.remember) {
-        tools.push({
-            name: "memory_compact",
-            description: "Shrink memories that have already been absorbed elsewhere (folded into a model, " +
-                "summarised into a longer-lived note) down to a one-line pointer stub, reclaiming the " +
-                "context they were eating. Call this AFTER something durable has learned the facts — " +
-                "never as a way to tidy up, because the full body is gone afterwards. 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.
-                    const hits = new Map();
-                    for (const key of keys) {
-                        const hit = await backend.get(key);
-                        if (hit)
-                            hits.set(key, hit);
-                    }
-                    const plan = planCompaction(keys.map((key) => ({ key, content: hits.get(key)?.content })), {
-                        stub: typeof args["stub"] === "string" ? args["stub"] : undefined,
-                        version: args["version"] == null ? undefined : Number(args["version"]),
-                        maxChars: args["maxChars"] == null ? undefined : Number(args["maxChars"]),
-                    });
-                    // Preserve tags/importance — compaction shortens a body, it does not
-                    // reclassify the fact.
-                    const writes = plan.writes.map((w) => {
-                        const prev = hits.get(w.key);
-                        return { key: w.key, content: w.content, tags: prev?.tags, importance: prev?.importance };
-                    });
-                    if (writes.length > 0) {
-                        if (backend.rememberMany)
-                            await backend.rememberMany(writes);
-                        else
-                            for (const w of writes)
-                                await backend.remember(w);
-                    }
-                    return ok(renderCompaction(plan.writes.length, plan.bytesSaved, plan.skipped));
-                }
-                catch (err) {
-                    return fail(`compact failed: ${String(err)}`);
-                }
-            },
-        });
-    }
+    // memory_compact + memory_restore — the lossless compaction pair (compaction-tools.ts).
+    if (writable && backend.remember)
+        appendCompactionTools(tools, backend, opts);
     if (writable && backend.forget) {
         tools.push({
             name: "memory_forget",

package/dist/tools.js.map

@@ -1 +1 @@
-{"version":3,"file":"tools.js","sourceRoot":"","sources":["../src/tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,kBAAkB,EAAE,cAAc,EAAuB,MAAM,iBAAiB,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAE7D,OAAO,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AAC5D,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAoC,MAAM,gBAAgB,CAAC;AA0BlF,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAC9B,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC;;;;;;;GAOG;AACH,MAAM,WAAW,GAAiC;IAC9C,SAAS,EAAE,gEAAgE;IAC3E,OAAO,EAAE,mEAAmE;CAC/E,CAAC;AAEF,SAAS,UAAU,CAAC,IAAiB,EAAE,QAAgB,EAAE,MAAqB;IAC1E,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACxD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,wBAAwB,MAAM,EAAE,CAAC;IAC/D,OAAO,CACH,IAAI;SACC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACP,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACpE,OAAO,KAAK,CAAC,CAAC,GAAG,GAAG,KAAK,GAAG,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;IACvE,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAC3B,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,YAAY,CACvB,OAAsB,EACtB,KAAa,EACb,IAAY;IAEZ,IAAI,OAAO,CAAC,YAAY;QAAE,OAAO,OAAO,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACnE,OAAO,EAAE,IAAI,EAAE,MAAM,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;AACvD,CAAC;AAED,MAAM,YAAY,GAA6C;IAC3D,SAAS,EAAE,WAAW;IACtB,iBAAiB,EAAE,mBAAmB;IACtC,WAAW,EAAE,+BAA+B;CAC/C,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;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAsB,EAAE,OAA2B,EAAE;IAClF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,IAAI,mBAAmB,CAAC,CAAC;IACvE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,eAAe,IAAI,mBAAmB,CAAC,CAAC;IAC7E,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC;IAEzC,MAAM,KAAK,GAAiB;QACxB;YACI,IAAI,EAAE,eAAe;YACrB,WAAW,EACP,qEAAqE;gBACrE,iFAAiF;gBACjF,oFAAoF;gBACpF,uFAAuF;gBACvF,cAAc;YAClB,WAAW,EAAE;gBACT,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,oDAAoD,CAAC;gBAChF,IAAI,EAAE,CAAC;qBACF,MAAM,EAAE;qBACR,GAAG,EAAE;qBACL,GAAG,CAAC,CAAC,CAAC;qBACN,GAAG,CAAC,UAAU,CAAC;qBACf,QAAQ,EAAE;qBACV,QAAQ,CAAC,oCAAoC,UAAU,IAAI,CAAC;aACpE;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC1C,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;wBAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC,CAAC;oBACrD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC;oBACnE,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;oBACrD,OAAO,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;gBACvF,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,kBAAkB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACjD,CAAC;YACL,CAAC;SACJ;QACD;YACI,IAAI,EAAE,YAAY;YAClB,WAAW,EACP,4EAA4E;gBAC5E,4EAA4E;YAChF,WAAW,EAAE;gBACT,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uBAAuB,CAAC;aACpD;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;oBACtC,IAAI,CAAC,GAAG;wBAAE,OAAO,IAAI,CAAC,kBAAkB,CAAC,CAAC;oBAC1C,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACnC,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,GAAG,OAAO,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,4BAA4B,GAAG,IAAI,CAAC,CAAC;gBAChG,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,eAAe,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC9C,CAAC;YACL,CAAC;SACJ;QACD;YACI,IAAI,EAAE,sBAAsB;YAC5B,WAAW,EACP,2EAA2E;gBAC3E,6EAA6E;YACjF,WAAW,EAAE;gBACT,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uBAAuB,CAAC;gBACjD,KAAK,EAAE,CAAC;qBACH,MAAM,EAAE;qBACR,GAAG,EAAE;qBACL,GAAG,CAAC,CAAC,CAAC;qBACN,GAAG,CAAC,UAAU,CAAC;qBACf,QAAQ,EAAE;qBACV,QAAQ,CAAC,8BAA8B,UAAU,IAAI,CAAC;aAC9D;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;oBACtC,IAAI,CAAC,GAAG;wBAAE,OAAO,IAAI,CAAC,kBAAkB,CAAC,CAAC;oBAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC;oBACxE,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;oBACnD,OAAO,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;gBAC5C,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,yBAAyB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxD,CAAC;YACL,CAAC;SACJ;KACJ,CAAC;IAEF,IAAI,QAAQ,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,iBAAiB;YACvB,WAAW,EACP,0FAA0F;gBAC1F,0FAA0F;gBAC1F,2FAA2F;gBAC3F,cAAc;YAClB,WAAW,EAAE;gBACT,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,8DAA8D,CAAC;gBACxF,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,oBAAoB,CAAC;gBAClD,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,yBAAyB,CAAC;gBACxE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,+BAA+B,CAAC;gBACzF,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,8BAA8B,CAAC;aACzF;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;oBACtC,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC9C,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO;wBAAE,OAAO,IAAI,CAAC,+BAA+B,CAAC,CAAC;oBACnE,MAAM,OAAO,CAAC,QAAS,CAAC;wBACpB,GAAG;wBACH,OAAO;wBACP,IAAI,EAAE,IAAI,CAAC,MAAM,CAAyB;wBAC1C,UAAU,EAAE,IAAI,CAAC,YAAY,CAAuB;wBACpD,KAAK,EAAE,IAAI,CAAC,OAAO,CAAuB;qBAC7C,CAAC,CAAC;oBACH,OAAO,EAAE,CAAC,eAAe,GAAG,IAAI,CAAC,CAAC;gBACtC,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,oBAAoB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACnD,CAAC;YACL,CAAC;SACJ,CAAC,CAAC;IACP,CAAC;IAED,+EAA+E;IAC/E,gFAAgF;IAChF,6EAA6E;IAC7E,kFAAkF;IAClF,4EAA4E;IAC5E,8CAA8C;IAC9C,IAAI,QAAQ,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,gBAAgB;YACtB,WAAW,EACP,kFAAkF;gBAClF,uFAAuF;gBACvF,sFAAsF;gBACtF,yFAAyF;gBACzF,kDAAkD;YACtD,WAAW,EAAE;gBACT,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,wCAAwC,CAAC;gBACnF,IAAI,EAAE,CAAC;qBACF,MAAM,EAAE;qBACR,QAAQ,EAAE;qBACV,QAAQ,CACL,0EAA0E;oBACtE,yEAAyE,CAChF;gBACL,OAAO,EAAE,CAAC;qBACL,MAAM,EAAE;qBACR,GAAG,EAAE;qBACL,GAAG,CAAC,CAAC,CAAC;qBACN,QAAQ,EAAE;qBACV,QAAQ,CAAC,gFAAgF,CAAC;gBAC/F,QAAQ,EAAE,CAAC;qBACN,MAAM,EAAE;qBACR,GAAG,EAAE;qBACL,GAAG,CAAC,EAAE,CAAC;qBACP,GAAG,CAAC,GAAG,CAAC;qBACR,QAAQ,EAAE;qBACV,QAAQ,CAAC,yDAAyD,kBAAkB,IAAI,CAAC;aACjG;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;oBACzB,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;oBACjF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;wBAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC;oBAExD,sEAAsE;oBACtE,qDAAqD;oBACrD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;oBAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;wBACrB,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACnC,IAAI,GAAG;4BAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;oBAChC,CAAC;oBAED,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE;wBACvF,IAAI,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,IAAI,CAAC,MAAM,CAAY,CAAC,CAAC,CAAC,SAAS;wBAC7E,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBACtE,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;qBAC5E,CAAC,CAAC;oBAEH,qEAAqE;oBACrE,uBAAuB;oBACvB,MAAM,MAAM,GAAoB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;wBAClD,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,CAAC;oBACH,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACpB,IAAI,OAAO,CAAC,YAAY;4BAAE,MAAM,OAAO,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;;4BACxD,KAAK,MAAM,CAAC,IAAI,MAAM;gCAAE,MAAM,OAAO,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC;oBAC5D,CAAC;oBAED,OAAO,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;gBACnF,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,mBAAmB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClD,CAAC;YACL,CAAC;SACJ,CAAC,CAAC;IACP,CAAC;IAED,IAAI,QAAQ,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,eAAe;YACrB,WAAW,EAAE,6EAA6E;YAC1F,WAAW,EAAE;gBACT,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,iCAAiC,CAAC;aAC9D;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;oBACtC,IAAI,CAAC,GAAG;wBAAE,OAAO,IAAI,CAAC,kBAAkB,CAAC,CAAC;oBAC1C,MAAM,OAAO,CAAC,MAAO,CAAC,GAAG,CAAC,CAAC;oBAC3B,OAAO,EAAE,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;gBAClC,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,kBAAkB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACjD,CAAC;YACL,CAAC;SACJ,CAAC,CAAC;IACP,CAAC;IAED,IAAI,QAAQ,IAAI,IAAI,CAAC,UAAU;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAEtF,uEAAuE;IACvE,qDAAqD;IACrD,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;QACxC,sBAAsB,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IAC3F,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC"}
+{"version":3,"file":"tools.js","sourceRoot":"","sources":["../src/tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,kBAAkB,EAAoB,MAAM,iBAAiB,CAAC;AACvE,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAE7D,OAAO,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AAC5D,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAoC,MAAM,gBAAgB,CAAC;AAsClF,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAC9B,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC;;;;;;;GAOG;AACH,MAAM,WAAW,GAAiC;IAC9C,SAAS,EAAE,gEAAgE;IAC3E,OAAO,EAAE,mEAAmE;CAC/E,CAAC;AAEF,uFAAuF;AACvF,MAAM,SAAS,GAAG,CAAC,CAAY,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAE5F,SAAS,UAAU,CAAC,IAAiB,EAAE,QAAgB,EAAE,MAAqB;IAC1E,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACxD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,wBAAwB,MAAM,EAAE,CAAC;IAC/D,OAAO,CACH,IAAI;SACC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACP,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACpE,OAAO,KAAK,CAAC,CAAC,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;IACtF,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAC3B,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,YAAY,CACvB,OAAsB,EACtB,KAAa,EACb,IAAY;IAEZ,IAAI,OAAO,CAAC,YAAY;QAAE,OAAO,OAAO,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACnE,OAAO,EAAE,IAAI,EAAE,MAAM,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;AACvD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAsB,EAAE,OAA2B,EAAE;IAClF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,IAAI,mBAAmB,CAAC,CAAC;IACvE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,eAAe,IAAI,mBAAmB,CAAC,CAAC;IAC7E,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC;IAEzC,MAAM,KAAK,GAAiB;QACxB;YACI,IAAI,EAAE,eAAe;YACrB,WAAW,EACP,qEAAqE;gBACrE,iFAAiF;gBACjF,oFAAoF;gBACpF,uFAAuF;gBACvF,cAAc;YAClB,WAAW,EAAE;gBACT,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,oDAAoD,CAAC;gBAChF,IAAI,EAAE,CAAC;qBACF,MAAM,EAAE;qBACR,GAAG,EAAE;qBACL,GAAG,CAAC,CAAC,CAAC;qBACN,GAAG,CAAC,UAAU,CAAC;qBACf,QAAQ,EAAE;qBACV,QAAQ,CAAC,oCAAoC,UAAU,IAAI,CAAC;aACpE;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC1C,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;wBAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC,CAAC;oBACrD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC;oBACnE,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;oBACrD,OAAO,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;gBACvF,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,kBAAkB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACjD,CAAC;YACL,CAAC;SACJ;QACD;YACI,IAAI,EAAE,YAAY;YAClB,WAAW,EACP,4EAA4E;gBAC5E,4EAA4E;YAChF,WAAW,EAAE;gBACT,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uBAAuB,CAAC;aACpD;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;oBACtC,IAAI,CAAC,GAAG;wBAAE,OAAO,IAAI,CAAC,kBAAkB,CAAC,CAAC;oBAC1C,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACnC,OAAO,GAAG;wBACN,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,OAAO,EAAE,CAAC;wBACvD,CAAC,CAAC,EAAE,CAAC,4BAA4B,GAAG,IAAI,CAAC,CAAC;gBAClD,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,eAAe,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC9C,CAAC;YACL,CAAC;SACJ;QACD;YACI,IAAI,EAAE,sBAAsB;YAC5B,WAAW,EACP,2EAA2E;gBAC3E,6EAA6E;YACjF,WAAW,EAAE;gBACT,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uBAAuB,CAAC;gBACjD,KAAK,EAAE,CAAC;qBACH,MAAM,EAAE;qBACR,GAAG,EAAE;qBACL,GAAG,CAAC,CAAC,CAAC;qBACN,GAAG,CAAC,UAAU,CAAC;qBACf,QAAQ,EAAE;qBACV,QAAQ,CAAC,8BAA8B,UAAU,IAAI,CAAC;aAC9D;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;oBACtC,IAAI,CAAC,GAAG;wBAAE,OAAO,IAAI,CAAC,kBAAkB,CAAC,CAAC;oBAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC;oBACxE,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;oBACnD,OAAO,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;gBAC5C,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,yBAAyB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxD,CAAC;YACL,CAAC;SACJ;KACJ,CAAC;IAEF,IAAI,QAAQ,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,iBAAiB;YACvB,WAAW,EACP,0FAA0F;gBAC1F,0FAA0F;gBAC1F,2FAA2F;gBAC3F,cAAc;YAClB,WAAW,EAAE;gBACT,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,8DAA8D,CAAC;gBACxF,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,oBAAoB,CAAC;gBAClD,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,yBAAyB,CAAC;gBACxE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,+BAA+B,CAAC;gBACzF,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,8BAA8B,CAAC;aACzF;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;oBACtC,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC9C,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO;wBAAE,OAAO,IAAI,CAAC,+BAA+B,CAAC,CAAC;oBACnE,MAAM,OAAO,CAAC,QAAS,CAAC;wBACpB,GAAG;wBACH,OAAO;wBACP,IAAI,EAAE,IAAI,CAAC,MAAM,CAAyB;wBAC1C,UAAU,EAAE,IAAI,CAAC,YAAY,CAAuB;wBACpD,KAAK,EAAE,IAAI,CAAC,OAAO,CAAuB;qBAC7C,CAAC,CAAC;oBACH,OAAO,EAAE,CAAC,eAAe,GAAG,IAAI,CAAC,CAAC;gBACtC,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,oBAAoB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACnD,CAAC;YACL,CAAC;SACJ,CAAC,CAAC;IACP,CAAC;IAED,wFAAwF;IACxF,IAAI,QAAQ,IAAI,OAAO,CAAC,QAAQ;QAAE,qBAAqB,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IAE9E,IAAI,QAAQ,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,eAAe;YACrB,WAAW,EAAE,6EAA6E;YAC1F,WAAW,EAAE;gBACT,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,iCAAiC,CAAC;aAC9D;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;gBACpB,IAAI,CAAC;oBACD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;oBACtC,IAAI,CAAC,GAAG;wBAAE,OAAO,IAAI,CAAC,kBAAkB,CAAC,CAAC;oBAC1C,MAAM,OAAO,CAAC,MAAO,CAAC,GAAG,CAAC,CAAC;oBAC3B,OAAO,EAAE,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;gBAClC,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC,kBAAkB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACjD,CAAC;YACL,CAAC;SACJ,CAAC,CAAC;IACP,CAAC;IAED,IAAI,QAAQ,IAAI,IAAI,CAAC,UAAU;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAEtF,uEAAuE;IACvE,qDAAqD;IACrD,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;QACxC,sBAAsB,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IAC3F,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@seanhogg/builderforce-memory-mcp",
-  "version": "2026.10.2",
+  "version": "2026.10.22",
   "mcpName": "io.github.SeanHogg/builderforce-memory",
   "description": "BuilderForce Agent Memory — MCP transport. Exposes @seanhogg/builderforce-memory to any MCP client (Claude Agent SDK in-process, stdio, or HTTP) over a pluggable MemoryBackend, with token-saving fetch-on-demand recall.",
   "type": "module",
@@ -56,8 +56,8 @@
   },
   "peerDependencies": {
     "@anthropic-ai/claude-agent-sdk": ">=0.1.0",
-    "@seanhogg/builderforce-memory": "^2026.10.2",
-    "@seanhogg/builderforce-memory-engine": "^2026.10.2",
+    "@seanhogg/builderforce-memory": "^2026.10.22",
+    "@seanhogg/builderforce-memory-engine": "^2026.10.22",
     "fake-indexeddb": "^6.0.0"
   },
   "peerDependenciesMeta": {
@@ -83,8 +83,8 @@
     "fake-indexeddb": "^6.0.0",
     "typescript": "^6.0.3",
     "@typescript/native-preview": "7.0.0-dev.20260627.2",
-    "@seanhogg/builderforce-memory": "2026.10.2",
-    "@seanhogg/builderforce-memory-engine": "2026.10.2"
+    "@seanhogg/builderforce-memory": "2026.10.22",
+    "@seanhogg/builderforce-memory-engine": "2026.10.22"
   },
   "engines": {
     "node": ">=18.0.0"
@@ -94,7 +94,7 @@
   },
   "scripts": {
     "build": "tsc",
-    "test": "tsc && node --test tests/install.test.mjs tests/tools.test.mjs tests/http.test.mjs tests/compaction.test.mjs tests/recall-method.test.mjs tests/experience.test.mjs",
+    "test": "tsc && node --test tests/install.test.mjs tests/tools.test.mjs tests/http.test.mjs tests/compaction.test.mjs tests/recall-method.test.mjs tests/experience.test.mjs tests/lossless.test.mjs",
     "lint": "eslint src/",
     "typecheck:native": "tsgo --noEmit"
   }

package/server.json

@@ -8,14 +8,14 @@
     "source": "github",
     "subfolder": "packages/memory-mcp"
   },
-  "version": "2026.10.2",
+  "version": "2026.10.22",
   "websiteUrl": "https://builderforce.ai",
   "packages": [
     {
       "registryType": "npm",
       "registryBaseUrl": "https://registry.npmjs.org",
       "identifier": "@seanhogg/builderforce-memory-mcp",
-      "version": "2026.10.2",
+      "version": "2026.10.22",
       "transport": {
         "type": "stdio"
       },

package/src/backend.ts

@@ -8,6 +8,8 @@
  * transports.
  */
 
+import type { ArchivedFact } from "./compaction.js";
+
 /** A single recalled memory, normalised across backends. */
 export interface RecallHit {
     /** Stable identifier for the memory. */
@@ -26,6 +28,18 @@ export interface RecallHit {
     importance?: number;
     /** Unix-ms write time. */
     timestamp?: number;
+    /**
+     * Set when the stored body is a compaction stub that was resolved to its
+     * archived original: `content` is then the FULL original and this is the stub
+     * actually stored. Absent for an ordinary (uncompacted) memory.
+     */
+    stub?: string;
+    /**
+     * True when the stored body is a compaction stub with NO archived original — the
+     * text is gone and only the one-line pointer remains. Readers must label it
+     * (`CONTENT_LOST_LABEL`) and treat it as unverified; `memory_restore` clears it.
+     */
+    contentLost?: boolean;
 }
 
 /**
@@ -99,4 +113,19 @@ export interface MemoryBackend {
 
     /** Delete a memory by key. Optional — read-only backends omit it. */
     forget?(key: string): Promise<void>;
+
+    /**
+     * Durably store the full originals of facts about to be compacted. Optional —
+     * but `memory_compact` stubs NOTHING on a backend without it, because a stub
+     * whose original was never kept is lost content. Must be durable before it
+     * resolves: the compactor writes the stubs only afterwards.
+     */
+    archive?(facts: ArchivedFact[]): Promise<void>;
+
+    /**
+     * Keys whose stored body is a compaction stub with no archived original
+     * (`contentLost`). Optional; `memory_restore` uses it to match restore records
+     * by text, and falls back to key-only matching without it.
+     */
+    lostKeys?(): Promise<string[]>;
 }

package/src/backends/memory-store.ts

@@ -12,10 +12,20 @@
  * The embedder does NOT have to be a GPU runtime: `EvermindTextEmbedder` from the
  * engine is a pure-CPU `EvermindLM`, which is what lets the headless stdio server
  * rank recall semantically (see ./evermind-embedder.ts).
+ *
+ * Ranking signals: recall also weights each fused score by the fact's importance
+ * (x(0.5+importance), the cloud recall's factor) and a half-life recency decay —
+ * both ON by default here ({@link DEFAULT_RECALL_RANKING}).
+ *
+ * Compaction stubs: a stored body that is an `[absorbed→Evermind …]` stub is
+ * resolved to its ARCHIVED original (../persistence/fact-archive.ts) on every read,
+ * so recall returns the full text; a stub with no archive is flagged `contentLost`.
  */
 
 import type { MemoryBackend, RankedRecall, RecallHit, RememberInput } from "../backend.js";
+import { defaultArchiveFile, isContentLost, isStub, type ArchivedFact } from "../compaction.js";
 import { dynamicImport } from "../dynamic-import.js";
+import { FileFactArchive, MemoryFactArchive, type FactArchive } from "../persistence/fact-archive.js";
 import { SharedJsonFile, type SharedFileFs } from "../persistence/shared-json-file.js";
 
 // Structural views of the @seanhogg/builderforce-memory surface we use, so this package
@@ -28,8 +38,29 @@ interface MemoryEntryLike {
     importance?: number;
 }
 
+/**
+ * Recall ranking signals — the subset of the store's `HybridRetrieveOptions` this
+ * backend sets. Structural, so this package needs no type import from the runtime.
+ */
+export interface RecallRanking {
+    /** Weight each fused score by `0.5 + importance`. */
+    importanceWeight?: boolean;
+    /** Half-life (days) of the recency decay over each fact's write time; 0 = off. */
+    recencyHalfLifeDays?: number;
+}
+
+/** Recall ranking defaults: importance ON, 90-day half-life recency decay ON. */
+export const DEFAULT_RECALL_RANKING: Readonly<Required<RecallRanking>> = Object.freeze({
+    importanceWeight: true,
+    recencyHalfLifeDays: 90,
+});
+
 interface MemoryStoreLike {
-    remember(key: string, content: string, opts?: { ttlMs?: number; tags?: string[]; importance?: number }): Promise<void>;
+    remember(
+        key: string,
+        content: string,
+        opts?: { ttlMs?: number; tags?: string[]; importance?: number; timestamp?: number },
+    ): Promise<void>;
     recall(key: string): Promise<MemoryEntryLike | undefined>;
     recallAll(): Promise<MemoryEntryLike[]>;
     recallByTag(tag: string): Promise<MemoryEntryLike[]>;
@@ -38,12 +69,18 @@ interface MemoryStoreLike {
         query: string,
         topK: number,
         runtime?: unknown,
+        opts?: RecallRanking,
     ): Promise<{ hits: Array<{ entry: MemoryEntryLike; score: number }>; method: "embedding" | "lexical" }>;
     forget(key: string): Promise<void>;
 }
 
-function toHit(e: MemoryEntryLike, score?: number): RecallHit {
-    return {
+/**
+ * Normalise a stored entry into a hit, resolving a compaction stub: with an archived
+ * original the hit carries the FULL text (and the stored stub in `stub`); without one
+ * it keeps the stub and is flagged `contentLost`.
+ */
+function toHit(e: MemoryEntryLike, archived: ArchivedFact | undefined, score?: number): RecallHit {
+    const base: RecallHit = {
         key: e.key,
         content: e.content,
         ...(score === undefined ? {} : { score }),
@@ -51,14 +88,31 @@ function toHit(e: MemoryEntryLike, score?: number): RecallHit {
         importance: e.importance,
         timestamp: e.timestamp,
     };
+    if (!isStub(e.content)) return base;
+    if (archived) return { ...base, content: archived.content, stub: e.content };
+    return { ...base, contentLost: true };
+}
+
+export interface MemoryStoreBackendOptions {
+    /** Where compacted originals are kept. Default: an in-process archive. */
+    archive?: FactArchive;
+    /** Recall ranking signals. Default {@link DEFAULT_RECALL_RANKING}; `false` = fusion alone. */
+    ranking?: RecallRanking | false;
 }
 
 export class MemoryStoreBackend implements MemoryBackend {
+    private readonly facts: FactArchive;
+    private readonly ranking: RecallRanking | undefined;
+
     constructor(
         private readonly store: MemoryStoreLike,
         /** Optional SSMRuntime; enables embedding-based recall when present. */
         private readonly runtime?: unknown,
-    ) {}
+        opts: MemoryStoreBackendOptions = {},
+    ) {
+        this.facts = opts.archive ?? new MemoryFactArchive();
+        this.ranking = opts.ranking === false ? undefined : { ...DEFAULT_RECALL_RANKING, ...opts.ranking };
+    }
 
     /** Plain recall — {@link recallRanked} with the ranker's name dropped. ONE path. */
     async recall(query: string, topK: number): Promise<RecallHit[]> {
@@ -66,18 +120,35 @@ export class MemoryStoreBackend implements MemoryBackend {
     }
 
     async recallRanked(query: string, topK: number): Promise<RankedRecall> {
-        const ranked = await this.store.recallRanked(query, topK, this.runtime);
-        return { hits: ranked.hits.map((h) => toHit(h.entry, h.score)), method: ranked.method };
+        const ranked = await this.store.recallRanked(query, topK, this.runtime, this.ranking);
+        const rows = this.facts.all();
+        return { hits: ranked.hits.map((h) => toHit(h.entry, rows[h.entry.key], h.score)), method: ranked.method };
     }
 
     async get(key: string): Promise<RecallHit | undefined> {
         const e = await this.store.recall(key);
-        return e ? toHit(e) : undefined;
+        return e ? toHit(e, this.facts.get(key)) : undefined;
     }
 
     async recallByTag(tag: string, limit: number): Promise<RecallHit[]> {
         const entries = await this.store.recallByTag(tag);
-        return entries.slice(0, limit).map(toHit);
+        const rows = this.facts.all();
+        return entries.slice(0, limit).map((e) => toHit(e, rows[e.key]));
+    }
+
+    async archive(facts: ArchivedFact[]): Promise<void> {
+        this.facts.putMany(facts);
+    }
+
+    /** Keys whose stored body is a stub with no archived original. */
+    async lostKeys(): Promise<string[]> {
+        const rows = this.facts.all();
+        return (await this.store.recallAll()).filter((e) => isContentLost(e.content, rows[e.key])).map((e) => e.key);
+    }
+
+    /** Every archived row, read once — the snapshot writer's `contentLost` source. */
+    archivedRows(): Readonly<Record<string, ArchivedFact>> {
+        return this.facts.all();
     }
 
     async remember(input: RememberInput): Promise<void> {
@@ -144,6 +215,18 @@ export interface LocalBackendOptions {
      * when `BUILDERFORCE_MEMORY_MODEL` is set, so this is mostly for tests.
      */
     semanticRecall?: false;
+    /**
+     * Recall ranking signals (importance weighting, half-life recency decay).
+     * Default {@link DEFAULT_RECALL_RANKING} — both on; `false` ranks by fusion alone.
+     */
+    ranking?: RecallRanking | false;
+    /**
+     * Where compacted originals are archived. Default: beside `persistFile`
+     * (`memory.archive.json`) when there is one, else in-process.
+     */
+    archiveFile?: string;
+    /** Diagnostic sink (stderr by default — stdout is the MCP stdio channel). */
+    log?: (line: string) => void;
 }
 
 /**
@@ -159,6 +242,14 @@ interface SnapshotEntry {
     content: string;
     tags?: string[];
     importance?: number;
+    /** Unix-ms write time — persisted so recency ranking survives a respawn. */
+    timestamp?: number;
+    /**
+     * Written as true for a stub with no archived original, so dependency-free
+     * readers (the Claude Code hook) can label it without reading the archive.
+     * Derived on every write — never read back as truth; the archive decides.
+     */
+    contentLost?: true;
 }
 
 type FsLike = SharedFileFs & { mkdirSync(path: string, opts: { recursive: boolean }): void };
@@ -269,17 +360,41 @@ class DiskPersistedBackend implements MemoryBackend {
             if (!wanted.has(existing.key)) await this.store.forget(existing.key);
         }
         for (const raw of entries) {
-            await this.store.remember(raw.key, raw.content, { tags: raw.tags, importance: raw.importance });
+            await this.store.remember(raw.key, raw.content, {
+                tags: raw.tags,
+                importance: raw.importance,
+                ...(typeof raw.timestamp === "number" && Number.isFinite(raw.timestamp) ? { timestamp: raw.timestamp } : {}),
+            });
         }
     }
 
+    /**
+     * Archive first — durable before the caller writes the stubs. When the rows
+     * RESTORE lost stubs (memory_restore), the snapshot is rewritten too, so its
+     * derived `contentLost` flags stop naming them.
+     */
+    async archive(facts: ArchivedFact[]): Promise<void> {
+        await this.ensureFresh();
+        const lostBefore = new Set(await this.inner.lostKeys());
+        await this.inner.archive(facts);
+        if (facts.some((f) => lostBefore.has(f.key))) await this.snapshot();
+    }
+
+    async lostKeys(): Promise<string[]> {
+        await this.ensureFresh();
+        return this.inner.lostKeys();
+    }
+
     private async snapshot(): Promise<void> {
         const entries = await this.store.recallAll();
+        const rows = this.inner.archivedRows();
         const out: SnapshotEntry[] = entries.map((e) => ({
             key: e.key,
             content: e.content,
             tags: e.tags,
             importance: e.importance,
+            timestamp: e.timestamp,
+            ...(isContentLost(e.content, rows[e.key]) ? { contentLost: true as const } : {}),
         }));
         this.file.write(JSON.stringify(out, null, 2));
     }
@@ -321,9 +436,9 @@ export async function createLocalMemoryStoreBackend(opts: LocalBackendOptions =
     }
 
     const store = new MemoryStore({ idbFactory, dbName: opts.dbName, maxEntries });
-    const backend = new MemoryStoreBackend(store, runtime);
+    const log = opts.log ?? ((line: string) => void globalThis.process?.stderr?.write(`${line}\n`));
 
-    if (!opts.persistFile) return backend;
+    if (!opts.persistFile) return new MemoryStoreBackend(store, runtime, { ranking: opts.ranking });
 
     // Disk-mirror requested. node:fs/path are loaded indirectly so a browser
     // bundle of this module never statically pulls in Node builtins.
@@ -332,8 +447,23 @@ export async function createLocalMemoryStoreBackend(opts: LocalBackendOptions =
     const dir = path.dirname(opts.persistFile);
     if (dir && !fs.existsSync(dir)) fs.mkdirSync(dir, { recursive: true });
 
+    // The archive sits beside the snapshot, OUTSIDE it: it must survive the snapshot
+    // being rebuilt, rewritten by another process, or capped — see fact-archive.ts.
+    const archive = new FileFactArchive(opts.archiveFile ?? defaultArchiveFile(opts.persistFile), fs);
+    const backend = new MemoryStoreBackend(store, runtime, { archive, ranking: opts.ranking });
     const persisted = new DiskPersistedBackend(backend, store, new SharedJsonFile(opts.persistFile, fs));
     // Boot hydration IS the freshness check with no stamp yet — see ensureFresh().
     await persisted.ensureFresh();
+
+    // Facts compacted before archiving existed are stubs whose text is gone. Every
+    // read flags them `contentLost` (and so does the next snapshot); say so once at
+    // boot so the loss is visible, with the way back.
+    const lost = await persisted.lostKeys();
+    if (lost.length > 0) {
+        log(
+            `[builderforce-memory] ${lost.length} memory(ies) are compaction stubs with no archived original ` +
+                `(content lost — re-verify before relying on them). Recover the text with memory_restore.`,
+        );
+    }
     return persisted;
 }

package/src/bin/http.ts

@@ -24,9 +24,12 @@ import { createLocalMemoryStoreBackend } from "../backends/memory-store.js";
 import { createRecallEmbedder } from "../embedding/index.js";
 import { createExperienceHost } from "../experience/host.js";
 import { resolveMemoryFile } from "../install/server-spec.js";
+import { lazyRecallProbe } from "../model/recall-probe.js";
 import { createMemoryHttpHandler } from "../transports/http.js";
 
-const memoryFile = resolveMemoryFile();
+const memoryFile = resolveMemoryFile(process.env, undefined, {
+    log: (line) => void process.stderr.write(`${line}\n`),
+});
 
 const backend = await createLocalMemoryStoreBackend({
     dbName: process.env["BUILDERFORCE_MEMORY_DB"],
@@ -46,6 +49,9 @@ const handler = createMemoryHttpHandler(backend, {
     gatewayUrl: process.env["BUILDERFORCE_GATEWAY_URL"] ?? "https://api.builderforce.ai",
     gatewayApiKey: process.env["BUILDERFORCE_API_KEY"],
     experience: await createExperienceHost({ memoryFile }),
+    recallProbe: lazyRecallProbe(),
+    // No readRestoreFile: a networked server never reads a caller-named path —
+    // memory_restore takes the export inline.
 });
 
 if (process.env["BUILDERFORCE_MEMORY_EXPERIENCE"] === "1" && !process.env["BUILDERFORCE_MEMORY_TOKEN"]) {

package/src/bin/install.ts

@@ -22,7 +22,7 @@ import nodeFs from "node:fs";
 import { HOSTS } from "../install/hosts.js";
 import { installMemoryServer, type HostSelector } from "../install/install.js";
 import { installClaudeCombo } from "../install/claude-hooks.js";
-import { defaultMemoryFile } from "../install/server-spec.js";
+import { resolveMemoryFile } from "../install/server-spec.js";
 
 function argValue(name: string): string | undefined {
     const hit = process.argv.find((a) => a.startsWith(`--${name}=`));
@@ -55,7 +55,11 @@ const hosts: HostSelector =
           ? "all"
           : hostArg.split(",").map((s) => s.trim()).filter(Boolean);
 
-const memoryFile = argValue("memory-file") ?? defaultMemoryFile();
+// The SAME resolver the servers and the hook use — so an install on a machine whose
+// live store sits at a legacy location bakes THAT path, not an empty new one.
+const memoryFile =
+    argValue("memory-file") ??
+    resolveMemoryFile(process.env, undefined, { log: (line) => process.stderr.write(`${line}\n`) });
 
 let results;
 try {
@@ -112,6 +116,6 @@ if (results.length === 0) {
     );
 } else {
     process.stdout.write(
-        `\nDone — ${wrote} config(s) written. Store: ${memoryFile}\nRestart the agent(s) to connect. Tools: memory_recall · memory_remember · memory_get · memory_recall_by_tag · memory_forget · memory_compact\n`,
+        `\nDone — ${wrote} config(s) written. Store: ${memoryFile}\nRestart the agent(s) to connect. Tools: memory_recall · memory_remember · memory_get · memory_recall_by_tag · memory_forget · memory_compact · memory_restore\n`,
     );
 }