agent-bober 0.17.1 → 0.19.0

package/dist/orchestrator/memory/fact-detector.js

@@ -0,0 +1,153 @@
+/**
+ * PURE deterministic project-fact detector.
+ *
+ * PURE — no fs reads, no Date.now(), no createClient, no network access, no side effects.
+ * Takes already-parsed manifests/config as inputs and returns FactDraft[] deterministically.
+ * The thin IO caller (seedProjectFacts) handles all fs reads and clock-stamping.
+ *
+ * Mirror of distill.ts: the pure fn is separate from the IO boundary.
+ */
+import { readFile, access } from "node:fs/promises";
+import { join } from "node:path";
+import { FactStore, factsDbPath, ensureFactsDir, writeFact, } from "../../state/facts.js";
+// ── Pure detector ─────────────────────────────────────────────────────
+/**
+ * PURE: map parsed manifests/config into project-fact drafts.
+ * NO fs read, NO Date.now(), NO LLM. Returns [] when nothing is detectable.
+ *
+ * Detection rules:
+ *   project/testCommand   ← packageJson.scripts.test (if truthy)
+ *   project/buildCommand  ← packageJson.scripts.build (if truthy)
+ *   project/packageManager ← first lockfile present: npm > yarn > pnpm
+ *   project/framework     ← first dep/devDep found: next > react > vue
+ *
+ * Scope convention: scope="" (default/programming team) per memoryDir mapping
+ * in src/state/memory.ts:27-32. Namespace is a SEPARATE axis (DB file location).
+ */
+export function detectProjectFacts(inputs, scope = "") {
+    const drafts = [];
+    const pkg = inputs.packageJson;
+    // ── Scripts → testCommand / buildCommand ─────────────────────────
+    const scripts = pkg !== null && typeof pkg === "object" && pkg !== undefined
+        ? pkg.scripts
+        : undefined;
+    if (scripts !== undefined && scripts !== null) {
+        const testCmd = typeof scripts.test === "string" ? scripts.test : undefined;
+        if (testCmd) {
+            drafts.push(makeDraft(scope, "project", "project/testCommand", testCmd));
+        }
+        const buildCmd = typeof scripts.build === "string" ? scripts.build : undefined;
+        if (buildCmd) {
+            drafts.push(makeDraft(scope, "project", "project/buildCommand", buildCmd));
+        }
+    }
+    // ── Lockfile presence → packageManager ───────────────────────────
+    // bober: deterministic order: npm first, then yarn, then pnpm; first match wins
+    const lockfiles = inputs.lockfiles ?? {};
+    if (lockfiles.npm) {
+        drafts.push(makeDraft(scope, "project", "project/packageManager", "npm"));
+    }
+    else if (lockfiles.yarn) {
+        drafts.push(makeDraft(scope, "project", "project/packageManager", "yarn"));
+    }
+    else if (lockfiles.pnpm) {
+        drafts.push(makeDraft(scope, "project", "project/packageManager", "pnpm"));
+    }
+    // ── Dependencies → framework ──────────────────────────────────────
+    // Check deps + devDeps in fixed order: next before react (next implies react)
+    if (pkg !== null && pkg !== undefined) {
+        const deps = pkg.dependencies ?? {};
+        const devDeps = pkg.devDependencies ?? {};
+        const allDeps = { ...deps, ...devDeps };
+        if ("next" in allDeps) {
+            drafts.push(makeDraft(scope, "project", "project/framework", "next"));
+        }
+        else if ("react" in allDeps) {
+            drafts.push(makeDraft(scope, "project", "project/framework", "react"));
+        }
+        else if ("vue" in allDeps) {
+            drafts.push(makeDraft(scope, "project", "project/framework", "vue"));
+        }
+    }
+    return drafts;
+}
+// ── Helper ────────────────────────────────────────────────────────────
+function makeDraft(scope, subject, predicate, value) {
+    return {
+        scope,
+        subject,
+        predicate,
+        value,
+        confidence: 1,
+        sourceRunId: null,
+    };
+}
+// ── IO seed (thin caller) ─────────────────────────────────────────────
+/**
+ * Thin IO wrapper: reads manifests from disk, calls the PURE detectProjectFacts,
+ * then stamps wall-clock time and writes each draft through writeFact (idempotent).
+ *
+ * This is the ONLY function in this module that touches the filesystem or the clock.
+ * It is extracted here so both pipeline.ts and chat-session.ts can reuse one helper
+ * without duplicating the IO pattern.
+ *
+ * A missing package.json or bober.config.json is NORMAL — the detector returns a
+ * partial set of drafts. Never throws for missing files.
+ *
+ * @param projectRoot - Absolute path to the project root
+ * @param namespace   - Memory namespace (undefined → default .bober/memory/)
+ */
+export async function seedProjectFacts(projectRoot, namespace) {
+    // ── Read manifests (best-effort; missing files → null/false) ─────
+    let packageJson = null;
+    try {
+        const raw = await readFile(join(projectRoot, "package.json"), "utf-8");
+        const parsed = JSON.parse(raw);
+        packageJson = typeof parsed === "object" && parsed !== null
+            ? parsed
+            : null;
+    }
+    catch {
+        // Missing or unparseable package.json → leave null
+    }
+    let boberConfig = null;
+    try {
+        const raw = await readFile(join(projectRoot, "bober.config.json"), "utf-8");
+        const parsed = JSON.parse(raw);
+        boberConfig = typeof parsed === "object" && parsed !== null
+            ? parsed
+            : null;
+    }
+    catch {
+        // Missing or unparseable bober.config.json → leave null
+    }
+    // ── Detect lockfile presence (fs.access is synchronous-ish, but async) ──
+    const [npmExists, yarnExists, pnpmExists] = await Promise.all([
+        access(join(projectRoot, "package-lock.json")).then(() => true).catch(() => false),
+        access(join(projectRoot, "yarn.lock")).then(() => true).catch(() => false),
+        access(join(projectRoot, "pnpm-lock.yaml")).then(() => true).catch(() => false),
+    ]);
+    const inputs = {
+        packageJson,
+        boberConfig,
+        lockfiles: { npm: npmExists, yarn: yarnExists, pnpm: pnpmExists },
+    };
+    // ── Detect (PURE) ─────────────────────────────────────────────────
+    const drafts = detectProjectFacts(inputs);
+    if (drafts.length === 0)
+        return;
+    // ── Write through reconcile (idempotent — NOOP on unchanged) ─────
+    // Stamp wall-clock once at the IO boundary (NEVER inside the pure fn).
+    const now = new Date().toISOString();
+    await ensureFactsDir(projectRoot, namespace);
+    const store = new FactStore(factsDbPath(projectRoot, namespace));
+    try {
+        for (const draft of drafts) {
+            await writeFact(store, { ...draft, tValid: now, tCreated: now }, { now });
+        }
+    }
+    finally {
+        store.close();
+    }
+}
+//# sourceMappingURL=fact-detector.js.map

package/dist/orchestrator/memory/fact-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fact-detector.js","sourceRoot":"","sources":["../../../src/orchestrator/memory/fact-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAGjC,OAAO,EACL,SAAS,EACT,WAAW,EACX,cAAc,EACd,SAAS,GACV,MAAM,sBAAsB,CAAC;AAuB9B,yEAAyE;AAEzE;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAqB,EAAE,KAAK,GAAG,EAAE;IAClE,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC;IAE/B,oEAAoE;IACpE,MAAM,OAAO,GACX,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,SAAS;QAC1D,CAAC,CAAE,GAAG,CAAC,OAA+C;QACtD,CAAC,CAAC,SAAS,CAAC;IAEhB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;QAC9C,MAAM,OAAO,GAAG,OAAO,OAAO,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;QAC5E,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,qBAAqB,EAAE,OAAO,CAAC,CAAC,CAAC;QAC3E,CAAC;QAED,MAAM,QAAQ,GAAG,OAAO,OAAO,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;QAC/E,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,sBAAsB,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,gFAAgF;IAChF,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC;IACzC,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC;QAClB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,wBAAwB,EAAE,KAAK,CAAC,CAAC,CAAC;IAC5E,CAAC;SAAM,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,wBAAwB,EAAE,MAAM,CAAC,CAAC,CAAC;IAC7E,CAAC;SAAM,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,wBAAwB,EAAE,MAAM,CAAC,CAAC,CAAC;IAC7E,CAAC;IAED,qEAAqE;IACrE,8EAA8E;IAC9E,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtC,MAAM,IAAI,GAAI,GAAG,CAAC,YAAoD,IAAI,EAAE,CAAC;QAC7E,MAAM,OAAO,GAAI,GAAG,CAAC,eAAuD,IAAI,EAAE,CAAC;QACnF,MAAM,OAAO,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC;QAExC,IAAI,MAAM,IAAI,OAAO,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,mBAAmB,EAAE,MAAM,CAAC,CAAC,CAAC;QACxE,CAAC;aAAM,IAAI,OAAO,IAAI,OAAO,EAAE,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,mBAAmB,EAAE,OAAO,CAAC,CAAC,CAAC;QACzE,CAAC;aAAM,IAAI,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,mBAAmB,EAAE,KAAK,CAAC,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,yEAAyE;AAEzE,SAAS,SAAS,CAChB,KAAa,EACb,OAAe,EACf,SAAiB,EACjB,KAAa;IAEb,OAAO;QACL,KAAK;QACL,OAAO;QACP,SAAS;QACT,KAAK;QACL,UAAU,EAAE,CAAC;QACb,WAAW,EAAE,IAAI;KAClB,CAAC;AACJ,CAAC;AAED,yEAAyE;AAEzE;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,WAAmB,EACnB,SAAkB;IAElB,oEAAoE;IACpE,IAAI,WAAW,GAAmC,IAAI,CAAC;IACvD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,CAAC,EAAE,OAAO,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAY,CAAC;QAC1C,WAAW,GAAG,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI;YACzD,CAAC,CAAE,MAAkC;YACrC,CAAC,CAAC,IAAI,CAAC;IACX,CAAC;IAAC,MAAM,CAAC;QACP,mDAAmD;IACrD,CAAC;IAED,IAAI,WAAW,GAAmC,IAAI,CAAC;IACvD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,mBAAmB,CAAC,EAAE,OAAO,CAAC,CAAC;QAC5E,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAY,CAAC;QAC1C,WAAW,GAAG,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI;YACzD,CAAC,CAAE,MAAkC;YACrC,CAAC,CAAC,IAAI,CAAC;IACX,CAAC;IAAC,MAAM,CAAC;QACP,wDAAwD;IAC1D,CAAC;IAED,2EAA2E;IAC3E,MAAM,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QAC5D,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,mBAAmB,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;QAClF,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;QAC1E,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;KAChF,CAAC,CAAC;IAEH,MAAM,MAAM,GAAkB;QAC5B,WAAW;QACX,WAAW;QACX,SAAS,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE;KAClE,CAAC;IAEF,qEAAqE;IACrE,MAAM,MAAM,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAC1C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAEhC,oEAAoE;IACpE,uEAAuE;IACvE,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAErC,MAAM,cAAc,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,WAAW,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC;QACH,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,SAAS,CAAC,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC"}

package/dist/orchestrator/memory/fact-judge.d.ts

@@ -0,0 +1,19 @@
+import type { FactInput, FactRecord } from "../../state/facts.js";
+import type { ReconcileAction } from "./reconcile.js";
+/**
+ * Interface for resolving ambiguous fact collisions.
+ * The judge is consulted ONLY on a deterministic normalized-key collision
+ * where no exact (scope,subject,predicate) match exists.
+ */
+export interface FactJudge {
+    resolve(incoming: FactInput, candidate: FactRecord): Promise<ReconcileAction>;
+}
+/**
+ * Build an LLM-backed FactJudge.
+ * Mirrors the createClient pattern from src/orchestrator/architect-agent.ts:195-203.
+ * Honoring BOBER_TEST_DETERMINISTIC=1 automatically — createClient short-circuits
+ * to a DeterministicStubClient whose response is non-JSON, causing parseJudgeAction
+ * to return the FALLBACK "add".
+ */
+export declare function createLLMFactJudge(provider?: string | null, endpoint?: string | null, providerConfig?: Record<string, unknown>, model?: string): FactJudge;
+//# sourceMappingURL=fact-judge.d.ts.map

package/dist/orchestrator/memory/fact-judge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fact-judge.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/memory/fact-judge.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAItD;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACxB,OAAO,CAAC,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;CAC/E;AA6GD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,EACxB,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,EACxB,cAAc,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACxC,KAAK,CAAC,EAAE,MAAM,GACb,SAAS,CAUX"}

package/dist/orchestrator/memory/fact-judge.js

@@ -0,0 +1,121 @@
+// ── fact-judge.ts ──────────────────────────────────────────────────────
+//
+// LLM-backed FactJudge for resolving normalized-key ambiguity during
+// fact reconciliation. The ONLY place in the reconcile layer that imports
+// createClient or touches the network.
+//
+// On ANY parse failure or thrown error, resolve() returns "add" — never
+// lets the LLM corrupt the store.
+import { z } from "zod";
+import { createClient } from "../../providers/factory.js";
+import { resolveModel } from "../model-resolver.js";
+// ── Zod schema ─────────────────────────────────────────────────────────
+const JudgeResponseSchema = z.object({
+    action: z.enum(["add", "update", "delete", "noop"]),
+});
+const FALLBACK = "add";
+// ── Helpers (mirrored from turn-classifier.ts) ─────────────────────────
+/**
+ * Strip code fences (```json ... ``` or ``` ... ```) from a string.
+ */
+function stripCodeFences(text) {
+    return text.replace(/```(?:json)?\s*([\s\S]*?)```/g, "$1").trim();
+}
+/**
+ * Extract the first balanced {...} JSON object substring.
+ * Returns null if no balanced object found.
+ */
+function extractFirstObject(text) {
+    const start = text.indexOf("{");
+    if (start === -1)
+        return null;
+    let depth = 0;
+    for (let i = start; i < text.length; i++) {
+        if (text[i] === "{")
+            depth++;
+        else if (text[i] === "}") {
+            depth--;
+            if (depth === 0)
+                return text.slice(start, i + 1);
+        }
+    }
+    return null;
+}
+/**
+ * Defensively parse text into a ReconcileAction.
+ * Returns FALLBACK ("add") on any error.
+ */
+function parseJudgeAction(text) {
+    try {
+        const stripped = stripCodeFences(text);
+        const extracted = extractFirstObject(stripped) ?? stripped;
+        const parsed = JSON.parse(extracted);
+        const result = JudgeResponseSchema.safeParse(parsed);
+        if (result.success) {
+            return result.data.action;
+        }
+        return FALLBACK;
+    }
+    catch {
+        return FALLBACK;
+    }
+}
+// ── LLMFactJudge ──────────────────────────────────────────────────────
+class LLMFactJudge {
+    llm;
+    model;
+    constructor(llm, model) {
+        this.llm = llm;
+        this.model = model;
+    }
+    /**
+     * Resolve an ambiguous fact collision using an LLM judgment.
+     * Uses jsonObjectMode:true for provider parity.
+     * On ANY failure (network, parse error), returns "add" — never corrupts the store.
+     */
+    async resolve(incoming, candidate) {
+        const system = [
+            "You are a fact-reconciliation judge for a semantic knowledge store.",
+            "Given an INCOMING fact and a CANDIDATE active fact with the same normalized subject+predicate,",
+            "decide whether to add, update, delete, or ignore the incoming fact.",
+            "",
+            "Respond ONLY with a JSON object with an 'action' field:",
+            '  {"action":"add"}    — insert the incoming fact as a new active fact (both will coexist)',
+            '  {"action":"update"} — supersede the candidate with the incoming fact',
+            '  {"action":"delete"} — invalidate the candidate, do not insert incoming',
+            '  {"action":"noop"}   — discard the incoming fact, keep the candidate unchanged',
+            "",
+            "Return ONLY the JSON object, no other text.",
+        ].join("\n");
+        const userContent = [
+            `INCOMING: subject="${incoming.subject}", predicate="${incoming.predicate}", value="${incoming.value}"`,
+            `CANDIDATE: subject="${candidate.subject}", predicate="${candidate.predicate}", value="${candidate.value}"`,
+        ].join("\n");
+        try {
+            const response = await this.llm.chat({
+                model: this.model,
+                system,
+                messages: [{ role: "user", content: userContent }],
+                jsonObjectMode: true,
+            });
+            return parseJudgeAction(response.text);
+        }
+        catch {
+            return FALLBACK;
+        }
+    }
+}
+// ── Factory ────────────────────────────────────────────────────────────
+/**
+ * Build an LLM-backed FactJudge.
+ * Mirrors the createClient pattern from src/orchestrator/architect-agent.ts:195-203.
+ * Honoring BOBER_TEST_DETERMINISTIC=1 automatically — createClient short-circuits
+ * to a DeterministicStubClient whose response is non-JSON, causing parseJudgeAction
+ * to return the FALLBACK "add".
+ */
+export function createLLMFactJudge(provider, endpoint, providerConfig, model) {
+    const client = createClient(provider ?? null, endpoint ?? null, providerConfig, model, "FactJudge");
+    const resolvedModel = resolveModel(model ?? "sonnet");
+    return new LLMFactJudge(client, resolvedModel);
+}
+//# sourceMappingURL=fact-judge.js.map

package/dist/orchestrator/memory/fact-judge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fact-judge.js","sourceRoot":"","sources":["../../../src/orchestrator/memory/fact-judge.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,EAAE;AACF,qEAAqE;AACrE,0EAA0E;AAC1E,uCAAuC;AACvC,EAAE;AACF,wEAAwE;AACxE,kCAAkC;AAElC,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAgBpD,0EAA0E;AAE1E,MAAM,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC;IACnC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;CACpD,CAAC,CAAC;AAEH,MAAM,QAAQ,GAAoB,KAAK,CAAC;AAExC,0EAA0E;AAE1E;;GAEG;AACH,SAAS,eAAe,CAAC,IAAY;IACnC,OAAO,IAAI,CAAC,OAAO,CAAC,+BAA+B,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;AACpE,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,IAAY;IACtC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,KAAK,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAE9B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,KAAK,EAAE,CAAC;aACxB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACzB,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CAAC,IAAY;IACpC,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,kBAAkB,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC;QAC3D,MAAM,MAAM,GAAY,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,mBAAmB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACrD,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QAC5B,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,QAAQ,CAAC;IAClB,CAAC;AACH,CAAC;AAED,yEAAyE;AAEzE,MAAM,YAAY;IACC,GAAG,CAAY;IACf,KAAK,CAAS;IAE/B,YAAY,GAAc,EAAE,KAAa;QACvC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,OAAO,CAAC,QAAmB,EAAE,SAAqB;QACtD,MAAM,MAAM,GAAG;YACb,qEAAqE;YACrE,gGAAgG;YAChG,qEAAqE;YACrE,EAAE;YACF,yDAAyD;YACzD,2FAA2F;YAC3F,wEAAwE;YACxE,0EAA0E;YAC1E,iFAAiF;YACjF,EAAE;YACF,6CAA6C;SAC9C,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,MAAM,WAAW,GAAG;YAClB,sBAAsB,QAAQ,CAAC,OAAO,iBAAiB,QAAQ,CAAC,SAAS,aAAa,QAAQ,CAAC,KAAK,GAAG;YACvG,uBAAuB,SAAS,CAAC,OAAO,iBAAiB,SAAS,CAAC,SAAS,aAAa,SAAS,CAAC,KAAK,GAAG;SAC5G,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBACnC,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM;gBACN,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;gBAClD,cAAc,EAAE,IAAI;aACrB,CAAC,CAAC;YACH,OAAO,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACzC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,QAAQ,CAAC;QAClB,CAAC;IACH,CAAC;CACF;AAED,0EAA0E;AAE1E;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,QAAwB,EACxB,QAAwB,EACxB,cAAwC,EACxC,KAAc;IAEd,MAAM,MAAM,GAAG,YAAY,CACzB,QAAQ,IAAI,IAAI,EAChB,QAAQ,IAAI,IAAI,EAChB,cAAc,EACd,KAAK,EACL,WAAW,CACZ,CAAC;IACF,MAAM,aAAa,GAAG,YAAY,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC;IACtD,OAAO,IAAI,YAAY,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;AACjD,CAAC"}

package/dist/orchestrator/memory/fact-retrieve.d.ts

@@ -0,0 +1,52 @@
+/**
+ * PURE deterministic, STORE-ONLY retrieval of relevant project facts for the planner.
+ *
+ * Opens the FactStore once, reads active facts for the requested scope, then
+ * performs all ranking in memory (pure). Mirrors the retrieve.ts pattern for lessons.
+ *
+ * PURE beyond the single store open/read/close — no network, no Date.now(), no LLM.
+ */
+import type { FactRecord } from "../../state/facts.js";
+/**
+ * Load and rank at most `topK` active facts from the store that are relevant
+ * to the given `keywords` and `scope`.
+ *
+ * ONE store open/read/close, then pure ranking. Scope isolation is enforced by
+ * the SQL WHERE clause in FactStore.getActiveFacts(scope) — facts in scope A
+ * NEVER surface when querying scope B.
+ *
+ * Scoring: deterministic token-overlap between lowercased keyword tokens and
+ * each record's subject + predicate + value tokens.
+ * Sort: score DESC, then id ASC (byte-stable tiebreak, mirrors retrieve.ts:103).
+ *
+ * Design note: when keywords is empty, keywordTokens.size === 0, scoreFact
+ * returns 0 for all records, and the score > 0 filter yields an empty result.
+ * This matches retrieve.ts behaviour. Project facts are few and always written
+ * with known predicates, so callers should pass relevant keywords (e.g. from
+ * the user prompt) to surface them.
+ *
+ * @param projectRoot - Absolute path to the project root containing .bober/
+ * @param scope       - Fact scope (e.g. "" for default/programming team)
+ * @param keywords    - Keywords to rank against (e.g. from the user prompt)
+ * @param options     - topK cap and optional namespace (selects DB file location)
+ */
+export declare function retrieveRelevantFacts(projectRoot: string, scope: string, keywords: string[], { topK, namespace, }?: {
+    topK?: number;
+    namespace?: string;
+}): Promise<FactRecord[]>;
+/**
+ * Render a compact planner context block from an array of FactRecord values.
+ *
+ * Mirrors serializeLessonsForPlanner (retrieve.ts:122-144):
+ *   - Empty input → ""
+ *   - Header line + one "- subject/predicate: value" line per fact
+ *   - Hard charBudget slice (output length is GUARANTEED ≤ charBudget)
+ *
+ * @param records    - Already-ranked records (from retrieveRelevantFacts)
+ * @param options    - charBudget: hard character limit (default DEFAULT_CHAR_BUDGET)
+ * @returns Compact string block, at most charBudget characters
+ */
+export declare function serializeFactsForContext(records: FactRecord[], { charBudget }?: {
+    charBudget?: number;
+}): string;
+//# sourceMappingURL=fact-retrieve.d.ts.map

package/dist/orchestrator/memory/fact-retrieve.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fact-retrieve.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/memory/fact-retrieve.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAiDvD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAsB,qBAAqB,CACzC,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAAE,EAClB,EACE,IAAoB,EACpB,SAAS,GACV,GAAE;IAAE,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5C,OAAO,CAAC,UAAU,EAAE,CAAC,CAuBvB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,UAAU,EAAE,EACrB,EAAE,UAAgC,EAAE,GAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,GACjE,MAAM,CAgBR"}

package/dist/orchestrator/memory/fact-retrieve.js

@@ -0,0 +1,117 @@
+/**
+ * PURE deterministic, STORE-ONLY retrieval of relevant project facts for the planner.
+ *
+ * Opens the FactStore once, reads active facts for the requested scope, then
+ * performs all ranking in memory (pure). Mirrors the retrieve.ts pattern for lessons.
+ *
+ * PURE beyond the single store open/read/close — no network, no Date.now(), no LLM.
+ */
+import { FactStore, factsDbPath, ensureFactsDir } from "../../state/facts.js";
+// ── Constants ─────────────────────────────────────────────────────────
+/** Default number of facts to return. */
+const DEFAULT_TOP_K = 5;
+/** Default character budget for the serialized planner block. */
+const DEFAULT_CHAR_BUDGET = 1200;
+// ── Helpers ───────────────────────────────────────────────────────────
+/**
+ * Tokenize a string into lowercase alphanumeric tokens.
+ * COPIED verbatim from retrieve.ts:30-35 (not exported there).
+ * Splits on any non-alphanumeric character and filters empty tokens.
+ */
+function tokenize(s) {
+    return s
+        .toLowerCase()
+        .split(/[^a-z0-9]+/)
+        .filter((t) => t.length > 0);
+}
+/**
+ * Score a FactRecord against a set of lowercased keyword tokens.
+ * Counts shared tokens across subject, predicate, and value.
+ * Returns 0 if there is no overlap.
+ */
+function scoreFact(record, keywordTokens) {
+    if (keywordTokens.size === 0)
+        return 0;
+    const recordTokens = new Set([
+        ...tokenize(record.subject),
+        ...tokenize(record.predicate),
+        ...tokenize(record.value),
+    ]);
+    let count = 0;
+    for (const t of keywordTokens) {
+        if (recordTokens.has(t)) {
+            count++;
+        }
+    }
+    return count;
+}
+// ── Core ──────────────────────────────────────────────────────────────
+/**
+ * Load and rank at most `topK` active facts from the store that are relevant
+ * to the given `keywords` and `scope`.
+ *
+ * ONE store open/read/close, then pure ranking. Scope isolation is enforced by
+ * the SQL WHERE clause in FactStore.getActiveFacts(scope) — facts in scope A
+ * NEVER surface when querying scope B.
+ *
+ * Scoring: deterministic token-overlap between lowercased keyword tokens and
+ * each record's subject + predicate + value tokens.
+ * Sort: score DESC, then id ASC (byte-stable tiebreak, mirrors retrieve.ts:103).
+ *
+ * Design note: when keywords is empty, keywordTokens.size === 0, scoreFact
+ * returns 0 for all records, and the score > 0 filter yields an empty result.
+ * This matches retrieve.ts behaviour. Project facts are few and always written
+ * with known predicates, so callers should pass relevant keywords (e.g. from
+ * the user prompt) to surface them.
+ *
+ * @param projectRoot - Absolute path to the project root containing .bober/
+ * @param scope       - Fact scope (e.g. "" for default/programming team)
+ * @param keywords    - Keywords to rank against (e.g. from the user prompt)
+ * @param options     - topK cap and optional namespace (selects DB file location)
+ */
+export async function retrieveRelevantFacts(projectRoot, scope, keywords, { topK = DEFAULT_TOP_K, namespace, } = {}) {
+    await ensureFactsDir(projectRoot, namespace);
+    const store = new FactStore(factsDbPath(projectRoot, namespace));
+    try {
+        // Scope-isolated by SQL WHERE scope = ? AND t_invalidated IS NULL
+        const records = store.getActiveFacts(scope);
+        const keywordTokens = new Set(keywords.flatMap(tokenize));
+        const scored = records
+            .map((r) => ({ r, score: scoreFact(r, keywordTokens) }))
+            .filter((x) => x.score > 0); // non-matching keyword → empty (mirrors retrieve.ts:96)
+        // Sort: score DESC, then id ASC (byte-stable final tiebreak)
+        scored.sort((a, b) => b.score - a.score || // 1. token overlap (DOMINANT)
+            a.r.id.localeCompare(b.r.id));
+        return scored.slice(0, topK).map((x) => x.r);
+    }
+    finally {
+        store.close();
+    }
+}
+/**
+ * Render a compact planner context block from an array of FactRecord values.
+ *
+ * Mirrors serializeLessonsForPlanner (retrieve.ts:122-144):
+ *   - Empty input → ""
+ *   - Header line + one "- subject/predicate: value" line per fact
+ *   - Hard charBudget slice (output length is GUARANTEED ≤ charBudget)
+ *
+ * @param records    - Already-ranked records (from retrieveRelevantFacts)
+ * @param options    - charBudget: hard character limit (default DEFAULT_CHAR_BUDGET)
+ * @returns Compact string block, at most charBudget characters
+ */
+export function serializeFactsForContext(records, { charBudget = DEFAULT_CHAR_BUDGET } = {}) {
+    if (records.length === 0) {
+        return "";
+    }
+    const lines = [
+        "## Project facts (durable semantic memory)",
+        "",
+        ...records.map((r) => `- ${r.subject}/${r.predicate}: ${r.value}`),
+        "",
+    ];
+    const block = lines.join("\n");
+    // Hard truncation to charBudget (sc-5-5 guarantee — never exceed budget)
+    return block.slice(0, charBudget);
+}
+//# sourceMappingURL=fact-retrieve.js.map

package/dist/orchestrator/memory/fact-retrieve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fact-retrieve.js","sourceRoot":"","sources":["../../../src/orchestrator/memory/fact-retrieve.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAG9E,yEAAyE;AAEzE,yCAAyC;AACzC,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB,iEAAiE;AACjE,MAAM,mBAAmB,GAAG,IAAI,CAAC;AAEjC,yEAAyE;AAEzE;;;;GAIG;AACH,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,CAAC;SACL,WAAW,EAAE;SACb,KAAK,CAAC,YAAY,CAAC;SACnB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACjC,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,MAAkB,EAAE,aAA0B;IAC/D,IAAI,aAAa,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEvC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAS;QACnC,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC;QAC3B,GAAG,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC;QAC7B,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC;KAC1B,CAAC,CAAC;IAEH,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,KAAK,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,yEAAyE;AAEzE;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,WAAmB,EACnB,KAAa,EACb,QAAkB,EAClB,EACE,IAAI,GAAG,aAAa,EACpB,SAAS,MACgC,EAAE;IAE7C,MAAM,cAAc,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,WAAW,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC;QACH,kEAAkE;QAClE,MAAM,OAAO,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAE1D,MAAM,MAAM,GAAG,OAAO;aACnB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC;aACvD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,wDAAwD;QAEvF,6DAA6D;QAC7D,MAAM,CAAC,IAAI,CACT,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAyB,8BAA8B;YACxE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAC/B,CAAC;QAEF,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,wBAAwB,CACtC,OAAqB,EACrB,EAAE,UAAU,GAAG,mBAAmB,KAA8B,EAAE;IAElE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,KAAK,GAAG;QACZ,4CAA4C;QAC5C,EAAE;QACF,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;QAClE,EAAE;KACH,CAAC;IAEF,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAE/B,yEAAyE;IACzE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;AACpC,CAAC"}

package/dist/orchestrator/memory/hygiene.d.ts

@@ -0,0 +1,66 @@
+/**
+ * PURE deterministic lesson hygiene: decay-based pruning + conflict quarantine.
+ *
+ * PURE — the clock is never read here; `now` is injected by the CLI handler
+ * (mirrors reconcileFact's { now } pattern at reconcile.ts:54). Operates
+ * ONLY on the fields each record carries; the CLI assembles recency input (createdAt)
+ * by reading per-lesson files and passing it in via PrunableLesson.createdAt.
+ *
+ * Conflict detection: DETERMINISTIC — two lessons sharing the same contradiction key
+ * (category root + discriminator tag) with opposing polarity markers are BOTH moved
+ * to quarantine. No LLM.
+ *
+ * Decay: lessons below `minOccurrences` that are also older than `maxAgeMs` are
+ * quarantined. Missing createdAt is treated as "maximally stale" (decays immediately
+ * when occurrences are below threshold), which is conservative and documented here
+ * as a deliberate choice — prefer to quarantine an unknown-age low-occurrence lesson
+ * rather than silently keep it forever.
+ */
+import type { LessonIndexRecord } from "../../state/memory.js";
+/** Default age threshold for decay: 30 days in milliseconds. */
+export declare const THIRTY_DAYS_MS: number;
+/** A LessonIndexRecord enriched with CLI-derived recency proxy (ISO createdAt). */
+export interface PrunableLesson extends LessonIndexRecord {
+    /** ISO 8601 createdAt, assembled by the CLI from the per-lesson .md file. May be absent. */
+    createdAt?: string;
+}
+export interface PruneOptions {
+    /** Injected ISO wall-clock — NEVER read inside this module. */
+    now: string;
+    /**
+     * Lessons with occurrences strictly below this value AND older than maxAgeMs
+     * are quarantined as decayed. Default: 2.
+     */
+    minOccurrences?: number;
+    /**
+     * Age threshold in milliseconds. A lesson is considered stale when
+     * (now - createdAt) > maxAgeMs. Default: 30 days.
+     */
+    maxAgeMs?: number;
+}
+export interface PruneResult {
+    /** Lessons retained in INDEX.md. Sorted by lessonId ASC for byte-stability. */
+    kept: PrunableLesson[];
+    /** Lessons to be moved to QUARANTINE.md. Sorted by lessonId ASC for byte-stability. */
+    quarantined: PrunableLesson[];
+}
+/**
+ * Partition lessons into kept vs. quarantined.
+ *
+ * Phase 1 (conflict detection): identifies deterministically contradictory pairs.
+ *   A pair is contradictory when both records share the same contradiction key
+ *   (category root + discriminator tag) AND carry opposing polarity markers
+ *   (one "keep"-marked, one "avoid"-marked). BOTH are quarantined.
+ *
+ * Phase 2 (decay): for remaining records, quarantines those below `minOccurrences`
+ *   that are also stale (createdAt older than maxAgeMs, or createdAt absent).
+ *
+ * Both output arrays are sorted by lessonId ASC for byte-identical repeated runs.
+ *
+ * @param records - Enriched lesson records (with optional createdAt from CLI)
+ * @param opts.now - ISO 8601 wall-clock, injected — never read inside
+ * @param opts.minOccurrences - Below-threshold occurrence count (default 2)
+ * @param opts.maxAgeMs - Staleness threshold in ms (default 30 days)
+ */
+export declare function pruneLessons(records: PrunableLesson[], { now, minOccurrences, maxAgeMs }: PruneOptions): PruneResult;
+//# sourceMappingURL=hygiene.d.ts.map

package/dist/orchestrator/memory/hygiene.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hygiene.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/memory/hygiene.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAI/D,gEAAgE;AAChE,eAAO,MAAM,cAAc,QAA2B,CAAC;AAQvD,mFAAmF;AACnF,MAAM,WAAW,cAAe,SAAQ,iBAAiB;IACvD,4FAA4F;IAC5F,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,YAAY;IAC3B,+DAA+D;IAC/D,GAAG,EAAE,MAAM,CAAC;IACZ;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,WAAW;IAC1B,+EAA+E;IAC/E,IAAI,EAAE,cAAc,EAAE,CAAC;IACvB,uFAAuF;IACvF,WAAW,EAAE,cAAc,EAAE,CAAC;CAC/B;AAkDD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,YAAY,CAC1B,OAAO,EAAE,cAAc,EAAE,EACzB,EAAE,GAAG,EAAE,cAAkB,EAAE,QAAyB,EAAE,EAAE,YAAY,GACnE,WAAW,CAsEb"}