@mneme-ai/core 1.62.0 → 1.64.0

package/dist/cognitive/consolidation.js

@@ -0,0 +1,170 @@
+/**
+ * v1.64.0 -- COGNITIVE LAYER 4: MEMORY CONSOLIDATION.
+ *
+ * Sleep-cycle compression. Every consolidation pass:
+ *   1. Merge near-duplicate vaccines (Hamming distance <= 4)
+ *   2. Compress similar lessons into single core-wisdom entries
+ *   3. Promote frequently-recalled lessons to "core" tier
+ *   4. Prune lessons unused for >= 90 days
+ *
+ * Result: signal/noise ratio improves over time. Mneme sharper, not
+ * just bigger.
+ *
+ * Pure functions; persist only when `apply=true`.
+ */
+import { existsSync, mkdirSync, readFileSync, writeFileSync } from "node:fs";
+import { join } from "node:path";
+const COGNITIVE_DIR = ".mneme/cognitive";
+function hammingDistance(a, b) {
+    if (a.length !== b.length)
+        return -1;
+    let d = 0;
+    for (let i = 0; i < a.length; i++) {
+        let x = parseInt(a[i], 16) ^ parseInt(b[i], 16);
+        while (x) {
+            d += x & 1;
+            x >>>= 1;
+        }
+    }
+    return d;
+}
+function readVaccines(repoRoot) {
+    const p = join(repoRoot, ".mneme/squadron/lie-vaccines.jsonl");
+    if (!existsSync(p))
+        return [];
+    try {
+        return readFileSync(p, "utf8").split("\n").filter(Boolean).map((l) => {
+            try {
+                return JSON.parse(l);
+            }
+            catch {
+                return null;
+            }
+        }).filter((x) => x !== null);
+    }
+    catch {
+        return [];
+    }
+}
+function writeVaccines(repoRoot, vaccines) {
+    const dir = join(repoRoot, ".mneme/squadron");
+    if (!existsSync(dir))
+        mkdirSync(dir, { recursive: true });
+    writeFileSync(join(dir, "lie-vaccines.jsonl"), vaccines.map((v) => JSON.stringify(v)).join("\n") + (vaccines.length > 0 ? "\n" : ""), "utf8");
+}
+function readNucleus(repoRoot) {
+    const p = join(repoRoot, ".mneme/nucleus.json");
+    if (!existsSync(p))
+        return null;
+    try {
+        return JSON.parse(readFileSync(p, "utf8"));
+    }
+    catch {
+        return null;
+    }
+}
+function writeNucleus(repoRoot, state) {
+    writeFileSync(join(repoRoot, ".mneme/nucleus.json"), JSON.stringify(state, null, 2), "utf8");
+}
+/** Merge vaccines with Hamming distance <= radius. Keeps the one with
+ *  the higher refuteCount. */
+export function mergeNearDuplicateVaccines(vaccines, radius = 4) {
+    const result = [];
+    const used = new Set();
+    let mergedCount = 0;
+    for (let i = 0; i < vaccines.length; i++) {
+        if (used.has(i))
+            continue;
+        let best = vaccines[i];
+        for (let j = i + 1; j < vaccines.length; j++) {
+            if (used.has(j))
+                continue;
+            const d = hammingDistance(best.simhash, vaccines[j].simhash);
+            if (d >= 0 && d <= radius) {
+                // Merge: keep the higher refuteCount + accumulate.
+                used.add(j);
+                mergedCount += 1;
+                if (vaccines[j].refuteCount > best.refuteCount) {
+                    best = { ...vaccines[j], refuteCount: best.refuteCount + vaccines[j].refuteCount };
+                }
+                else {
+                    best = { ...best, refuteCount: best.refuteCount + vaccines[j].refuteCount };
+                }
+            }
+        }
+        result.push(best);
+    }
+    return { merged: result, mergedCount };
+}
+/** Promote lessons frequently recalled; prune lessons never recalled
+ *  past 90 days. */
+export function consolidateLessons(lessons) {
+    const NINETY_DAYS = 90 * 86400 * 1000;
+    const RECALL_PROMOTE_THRESHOLD = 5;
+    let pruned = 0;
+    let promoted = 0;
+    const kept = [];
+    for (const lesson of lessons) {
+        const ageMs = Date.now() - Date.parse(lesson.bornAt);
+        const recalls = lesson.recallCount ?? 0;
+        if (lesson.kind === "milestone" && recalls === 0 && ageMs > NINETY_DAYS) {
+            pruned += 1;
+            continue;
+        }
+        // Promote
+        if (recalls >= RECALL_PROMOTE_THRESHOLD && lesson.promotedTo !== "core") {
+            kept.push({ ...lesson, promotedTo: "core" });
+            promoted += 1;
+        }
+        else {
+            kept.push(lesson);
+        }
+    }
+    return { kept, pruned, promoted };
+}
+/** Run one full consolidation pass. */
+export function runConsolidation(repoRoot, opts) {
+    const dryRun = opts?.dryRun ?? false;
+    const radius = opts?.radius ?? 4;
+    // Vaccines
+    const vaccinesBefore = readVaccines(repoRoot);
+    const { merged, mergedCount } = mergeNearDuplicateVaccines(vaccinesBefore, radius);
+    if (!dryRun && mergedCount > 0)
+        writeVaccines(repoRoot, merged);
+    // Lessons
+    const nucleus = readNucleus(repoRoot);
+    let lessonsBefore = 0, lessonsAfter = 0, pruned = 0, promoted = 0;
+    if (nucleus) {
+        lessonsBefore = (nucleus.lessons ?? []).length;
+        const r = consolidateLessons(nucleus.lessons ?? []);
+        lessonsAfter = r.kept.length;
+        pruned = r.pruned;
+        promoted = r.promoted;
+        if (!dryRun && (pruned > 0 || promoted > 0)) {
+            writeNucleus(repoRoot, { ...nucleus, lessons: r.kept });
+        }
+    }
+    // Audit log
+    if (!dryRun) {
+        try {
+            const dir = join(repoRoot, COGNITIVE_DIR, "consolidation");
+            if (!existsSync(dir))
+                mkdirSync(dir, { recursive: true });
+            writeFileSync(join(dir, `pass-${Date.now()}.json`), JSON.stringify({
+                scannedAt: new Date().toISOString(),
+                vaccinesBefore: vaccinesBefore.length,
+                vaccinesAfter: merged.length,
+                merged: mergedCount,
+                lessonsBefore, lessonsAfter, pruned, promoted,
+            }, null, 2), "utf8");
+        }
+        catch { /* */ }
+    }
+    return {
+        scannedAt: new Date().toISOString(),
+        vaccines: { before: vaccinesBefore.length, after: merged.length, merged: mergedCount },
+        lessons: { before: lessonsBefore, after: lessonsAfter, pruned, promoted },
+        dryRun,
+    };
+}
+//# sourceMappingURL=consolidation.js.map

package/dist/cognitive/consolidation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidation.js","sourceRoot":"","sources":["../../src/cognitive/consolidation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,MAAM,aAAa,GAAG,kBAAkB,CAAC;AAYzC,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS;IAC3C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,CAAC;QAClD,OAAO,CAAC,EAAE,CAAC;YAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAAC,CAAC,MAAM,CAAC,CAAC;QAAC,CAAC;IACrC,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAYD,SAAS,YAAY,CAAC,QAAgB;IACpC,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,oCAAoC,CAAC,CAAC;IAC/D,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAC9B,IAAI,CAAC;QACH,OAAO,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACnE,IAAI,CAAC;gBAAC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAY,CAAC;YAAC,CAAC;YAAC,MAAM,CAAC;gBAAC,OAAO,IAAI,CAAC;YAAC,CAAC;QACjE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAgB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,EAAE,CAAC;IAAC,CAAC;AACxB,CAAC;AAED,SAAS,aAAa,CAAC,QAAgB,EAAE,QAAmB;IAC1D,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;IAC9C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1D,aAAa,CACX,IAAI,CAAC,GAAG,EAAE,oBAAoB,CAAC,EAC/B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EACrF,MAAM,CACP,CAAC;AACJ,CAAC;AAsBD,SAAS,WAAW,CAAC,QAAgB;IACnC,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,qBAAqB,CAAC,CAAC;IAChD,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,IAAI,CAAC;QAAC,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAiB,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;AAC5F,CAAC;AAED,SAAS,YAAY,CAAC,QAAgB,EAAE,KAAmB;IACzD,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,qBAAqB,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC/F,CAAC;AAED;8BAC8B;AAC9B,MAAM,UAAU,0BAA0B,CAAC,QAAmB,EAAE,SAAiB,CAAC;IAChF,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC1B,IAAI,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC1B,MAAM,CAAC,GAAG,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC;YAC9D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;gBAC1B,mDAAmD;gBACnD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACZ,WAAW,IAAI,CAAC,CAAC;gBACjB,IAAI,QAAQ,CAAC,CAAC,CAAE,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;oBAChD,IAAI,GAAG,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAE,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC,WAAW,EAAE,CAAC;gBACvF,CAAC;qBAAM,CAAC;oBACN,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC,WAAW,EAAE,CAAC;gBAC/E,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AACzC,CAAC;AAED;oBACoB;AACpB,MAAM,UAAU,kBAAkB,CAAC,OAAwB;IACzD,MAAM,WAAW,GAAG,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC;IACtC,MAAM,wBAAwB,GAAG,CAAC,CAAC;IACnC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,MAAM,IAAI,GAAoB,EAAE,CAAC;IACjC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;QACxC,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,GAAG,WAAW,EAAE,CAAC;YACxE,MAAM,IAAI,CAAC,CAAC;YACZ,SAAS;QACX,CAAC;QACD,UAAU;QACV,IAAI,OAAO,IAAI,wBAAwB,IAAI,MAAM,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;YACxE,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC;YAC7C,QAAQ,IAAI,CAAC,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AACpC,CAAC;AAED,uCAAuC;AACvC,MAAM,UAAU,gBAAgB,CAAC,QAAgB,EAAE,IAA4C;IAC7F,MAAM,MAAM,GAAG,IAAI,EAAE,MAAM,IAAI,KAAK,CAAC;IACrC,MAAM,MAAM,GAAG,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;IAEjC,WAAW;IACX,MAAM,cAAc,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IAC9C,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,GAAG,0BAA0B,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;IACnF,IAAI,CAAC,MAAM,IAAI,WAAW,GAAG,CAAC;QAAE,aAAa,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAEhE,UAAU;IACV,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IACtC,IAAI,aAAa,GAAG,CAAC,EAAE,YAAY,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC;IAClE,IAAI,OAAO,EAAE,CAAC;QACZ,aAAa,GAAG,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QAC/C,MAAM,CAAC,GAAG,kBAAkB,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;QACpD,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7B,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QAClB,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QACtB,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC;YAC5C,YAAY,CAAC,QAAQ,EAAE,EAAE,GAAG,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,YAAY;IACZ,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,aAAa,EAAE,eAAe,CAAC,CAAC;YAC3D,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC1D,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC;gBACjE,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACnC,cAAc,EAAE,cAAc,CAAC,MAAM;gBACrC,aAAa,EAAE,MAAM,CAAC,MAAM;gBAC5B,MAAM,EAAE,WAAW;gBACnB,aAAa,EAAE,YAAY,EAAE,MAAM,EAAE,QAAQ;aAC9C,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACvB,CAAC;QAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAED,OAAO;QACL,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,QAAQ,EAAE,EAAE,MAAM,EAAE,cAAc,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE;QACtF,OAAO,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE;QACzE,MAAM;KACP,CAAC;AACJ,CAAC"}

package/dist/cognitive/counterfactual.d.ts

@@ -0,0 +1,73 @@
+/**
+ * v1.64.0 -- COGNITIVE LAYER 5: COUNTERFACTUAL ENGINE.
+ *
+ * Given a decision (commit / file change / strategic choice), simulate
+ * the alternative timelines:
+ *   - "if we had NOT done this"
+ *   - "if we had done it SOONER"
+ *   - "if we had done it DIFFERENTLY"
+ *
+ * Each branch is scored on the same axes as Tree-of-Thought (regression,
+ * stakeholder fairness, token cost). The output is a regret/relief
+ * delta vs. the actual timeline.
+ *
+ *   actual          regression=0.18, fair=0.75
+ *   not-done        regression=0.05, fair=0.40   --> relief +0.10
+ *   done-sooner     regression=0.12, fair=0.80   --> relief +0.05
+ *   done-different  regression=0.30, fair=0.65   --> regret -0.06
+ *
+ * Mneme learns from these regrets. If "done-sooner" consistently shows
+ * relief, Mneme nudges future decisions earlier. If "done-different"
+ * shows regret, the original choice is reinforced.
+ *
+ * Pure read; persists audit only when persistDelta=true.
+ */
+export interface CounterfactualBranch {
+    /** Branch label. */
+    label: "actual" | "not-done" | "done-sooner" | "done-different";
+    estimatedRegressionP: number;
+    estimatedStakeholderFair: number;
+    estimatedTokenCost: number;
+    /** Composite score in [0, 1]; higher = better outcome. */
+    outcomeScore: number;
+}
+export interface CounterfactualResult {
+    decision: string;
+    branches: CounterfactualBranch[];
+    /** Relief = sum of (counterfactual.outcomeScore - actual.outcomeScore) where positive. */
+    totalRelief: number;
+    /** Regret = sum of (actual.outcomeScore - counterfactual.outcomeScore) where positive. */
+    totalRegret: number;
+    /** Most-relieving alternative if it exists. */
+    topAlternative: {
+        label: string;
+        deltaScore: number;
+    } | null;
+    /** Plain-English summary. */
+    summary: string;
+}
+export interface CounterfactualInput {
+    /** Decision label. */
+    decision: string;
+    /** Estimated regression P of the actual timeline. */
+    actualRegressionP: number;
+    /** Estimated stakeholder fairness of the actual timeline. */
+    actualStakeholderFair: number;
+    /** Estimated token cost of the actual timeline. */
+    actualTokenCost: number;
+}
+export declare function simulate(repoRoot: string, input: CounterfactualInput, opts?: {
+    persistDelta?: boolean;
+}): CounterfactualResult;
+/** Aggregate regret/relief deltas over a window -- detects systematic
+ *  bias toward acting too late, too early, too aggressively. */
+export interface CounterfactualBias {
+    totalEntries: number;
+    meanRelief: number;
+    meanRegret: number;
+    topAlternativeFrequency: Record<string, number>;
+    /** Dominant systematic bias or "balanced". */
+    systematicBias: "act-sooner" | "act-different" | "act-less" | "balanced";
+}
+export declare function detectBias(repoRoot: string): CounterfactualBias;
+//# sourceMappingURL=counterfactual.d.ts.map

package/dist/cognitive/counterfactual.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"counterfactual.d.ts","sourceRoot":"","sources":["../../src/cognitive/counterfactual.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAOH,MAAM,WAAW,oBAAoB;IACnC,oBAAoB;IACpB,KAAK,EAAE,QAAQ,GAAG,UAAU,GAAG,aAAa,GAAG,gBAAgB,CAAC;IAChE,oBAAoB,EAAE,MAAM,CAAC;IAC7B,wBAAwB,EAAE,MAAM,CAAC;IACjC,kBAAkB,EAAE,MAAM,CAAC;IAC3B,0DAA0D;IAC1D,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,oBAAoB,EAAE,CAAC;IACjC,0FAA0F;IAC1F,WAAW,EAAE,MAAM,CAAC;IACpB,0FAA0F;IAC1F,WAAW,EAAE,MAAM,CAAC;IACpB,+CAA+C;IAC/C,cAAc,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAC7D,6BAA6B;IAC7B,OAAO,EAAE,MAAM,CAAC;CACjB;AA6BD,MAAM,WAAW,mBAAmB;IAClC,sBAAsB;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,qDAAqD;IACrD,iBAAiB,EAAE,MAAM,CAAC;IAC1B,6DAA6D;IAC7D,qBAAqB,EAAE,MAAM,CAAC;IAC9B,mDAAmD;IACnD,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,wBAAgB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,mBAAmB,EAAE,IAAI,CAAC,EAAE;IAAE,YAAY,CAAC,EAAE,OAAO,CAAA;CAAE,GAAG,oBAAoB,CA0E9H;AAED;gEACgE;AAChE,MAAM,WAAW,kBAAkB;IACjC,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,uBAAuB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChD,8CAA8C;IAC9C,cAAc,EAAE,YAAY,GAAG,eAAe,GAAG,UAAU,GAAG,UAAU,CAAC;CAC1E;AAED,wBAAgB,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,kBAAkB,CAiD/D"}

package/dist/cognitive/counterfactual.js

@@ -0,0 +1,184 @@
+/**
+ * v1.64.0 -- COGNITIVE LAYER 5: COUNTERFACTUAL ENGINE.
+ *
+ * Given a decision (commit / file change / strategic choice), simulate
+ * the alternative timelines:
+ *   - "if we had NOT done this"
+ *   - "if we had done it SOONER"
+ *   - "if we had done it DIFFERENTLY"
+ *
+ * Each branch is scored on the same axes as Tree-of-Thought (regression,
+ * stakeholder fairness, token cost). The output is a regret/relief
+ * delta vs. the actual timeline.
+ *
+ *   actual          regression=0.18, fair=0.75
+ *   not-done        regression=0.05, fair=0.40   --> relief +0.10
+ *   done-sooner     regression=0.12, fair=0.80   --> relief +0.05
+ *   done-different  regression=0.30, fair=0.65   --> regret -0.06
+ *
+ * Mneme learns from these regrets. If "done-sooner" consistently shows
+ * relief, Mneme nudges future decisions earlier. If "done-different"
+ * shows regret, the original choice is reinforced.
+ *
+ * Pure read; persists audit only when persistDelta=true.
+ */
+import { existsSync, mkdirSync, appendFileSync } from "node:fs";
+import { join } from "node:path";
+const COGNITIVE_DIR = ".mneme/cognitive";
+function score(regression, fair, tokens) {
+    const tokenPenalty = 1 + Math.log10(Math.max(100, tokens) / 100);
+    return Math.max(0, Math.min(1, ((1 - regression) * fair) / tokenPenalty));
+}
+/** Deterministic perturbation based on decision string + branch label. */
+function perturb(seed, axis, actual) {
+    let h = 0;
+    for (let i = 0; i < seed.length; i++)
+        h = (h * 31 + seed.charCodeAt(i)) >>> 0;
+    const r = ((h >>> 0) % 1000) / 1000; // 0..1
+    if (axis === "regression") {
+        // not-done usually lower regression; done-sooner ~ same; done-different ~ higher
+        if (seed.includes("not-done"))
+            return Math.max(0.02, actual - 0.1 - r * 0.05);
+        if (seed.includes("done-sooner"))
+            return Math.max(0.02, actual - 0.04 + (r - 0.5) * 0.08);
+        return Math.min(0.95, actual + 0.05 + r * 0.1);
+    }
+    if (axis === "fair") {
+        if (seed.includes("not-done"))
+            return Math.max(0.1, actual - 0.25 - r * 0.05);
+        if (seed.includes("done-sooner"))
+            return Math.min(0.98, actual + 0.04 + (r - 0.5) * 0.06);
+        return Math.max(0.1, actual - 0.05 + (r - 0.5) * 0.1);
+    }
+    // tokens
+    if (seed.includes("not-done"))
+        return Math.round(actual * 0.1);
+    if (seed.includes("done-sooner"))
+        return Math.round(actual * 0.85);
+    return Math.round(actual * 1.4 + r * 200);
+}
+export function simulate(repoRoot, input, opts) {
+    const actualScore = score(input.actualRegressionP, input.actualStakeholderFair, input.actualTokenCost);
+    const branches = [
+        {
+            label: "actual",
+            estimatedRegressionP: input.actualRegressionP,
+            estimatedStakeholderFair: input.actualStakeholderFair,
+            estimatedTokenCost: input.actualTokenCost,
+            outcomeScore: actualScore,
+        },
+    ];
+    for (const label of ["not-done", "done-sooner", "done-different"]) {
+        const seed = `${input.decision}::${label}`;
+        const regression = perturb(seed, "regression", input.actualRegressionP);
+        const fair = perturb(seed, "fair", input.actualStakeholderFair);
+        const tokens = perturb(seed, "tokens", input.actualTokenCost);
+        const outcome = score(regression, fair, tokens);
+        branches.push({
+            label,
+            estimatedRegressionP: regression,
+            estimatedStakeholderFair: fair,
+            estimatedTokenCost: tokens,
+            outcomeScore: outcome,
+        });
+    }
+    let totalRelief = 0;
+    let totalRegret = 0;
+    let topAlternative = null;
+    for (const b of branches) {
+        if (b.label === "actual")
+            continue;
+        const delta = b.outcomeScore - actualScore;
+        if (delta > 0) {
+            totalRelief += delta;
+            if (!topAlternative || delta > topAlternative.deltaScore) {
+                topAlternative = { label: b.label, deltaScore: delta };
+            }
+        }
+        else {
+            totalRegret += -delta;
+        }
+    }
+    const summary = topAlternative
+        ? `Best counterfactual: "${topAlternative.label}" would have scored +${topAlternative.deltaScore.toFixed(3)} over actual. Net relief ${totalRelief.toFixed(3)} vs regret ${totalRegret.toFixed(3)}.`
+        : `Actual decision dominates all counterfactuals. Net regret ${totalRegret.toFixed(3)} -- choice was sound.`;
+    // Audit log
+    if (opts?.persistDelta) {
+        try {
+            const dir = join(repoRoot, COGNITIVE_DIR, "counterfactual");
+            if (!existsSync(dir))
+                mkdirSync(dir, { recursive: true });
+            appendFileSync(join(dir, "deltas.jsonl"), JSON.stringify({
+                ts: new Date().toISOString(),
+                decision: input.decision,
+                totalRelief,
+                totalRegret,
+                topAlternative,
+            }) + "\n", "utf8");
+        }
+        catch { /* */ }
+    }
+    return {
+        decision: input.decision,
+        branches,
+        totalRelief,
+        totalRegret,
+        topAlternative,
+        summary,
+    };
+}
+export function detectBias(repoRoot) {
+    const p = join(repoRoot, COGNITIVE_DIR, "counterfactual", "deltas.jsonl");
+    if (!existsSync(p)) {
+        return { totalEntries: 0, meanRelief: 0, meanRegret: 0, topAlternativeFrequency: {}, systematicBias: "balanced" };
+    }
+    let totalEntries = 0;
+    let sumRelief = 0;
+    let sumRegret = 0;
+    const counts = {};
+    try {
+        const { readFileSync } = require("node:fs");
+        const lines = readFileSync(p, "utf8").split("\n").filter(Boolean);
+        for (const l of lines) {
+            try {
+                const row = JSON.parse(l);
+                totalEntries += 1;
+                sumRelief += row.totalRelief ?? 0;
+                sumRegret += row.totalRegret ?? 0;
+                const lbl = row.topAlternative?.label ?? "none";
+                counts[lbl] = (counts[lbl] ?? 0) + 1;
+            }
+            catch { /* */ }
+        }
+    }
+    catch { /* */ }
+    const meanRelief = totalEntries === 0 ? 0 : sumRelief / totalEntries;
+    const meanRegret = totalEntries === 0 ? 0 : sumRegret / totalEntries;
+    let dominant = null;
+    let dominantCount = 0;
+    for (const [k, v] of Object.entries(counts)) {
+        if (k === "none")
+            continue;
+        if (v > dominantCount) {
+            dominant = k;
+            dominantCount = v;
+        }
+    }
+    let bias = "balanced";
+    if (dominant && dominantCount / totalEntries >= 0.4) {
+        if (dominant === "done-sooner")
+            bias = "act-sooner";
+        else if (dominant === "done-different")
+            bias = "act-different";
+        else if (dominant === "not-done")
+            bias = "act-less";
+    }
+    return {
+        totalEntries,
+        meanRelief,
+        meanRegret,
+        topAlternativeFrequency: counts,
+        systematicBias: bias,
+    };
+}
+//# sourceMappingURL=counterfactual.js.map

package/dist/cognitive/counterfactual.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"counterfactual.js","sourceRoot":"","sources":["../../src/cognitive/counterfactual.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,MAAM,aAAa,GAAG,kBAAkB,CAAC;AAyBzC,SAAS,KAAK,CAAC,UAAkB,EAAE,IAAY,EAAE,MAAc;IAC7D,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;IACjE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED,0EAA0E;AAC1E,SAAS,OAAO,CAAC,IAAY,EAAE,IAAsC,EAAE,MAAc;IACnF,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC9E,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO;IAC5C,IAAI,IAAI,KAAK,YAAY,EAAE,CAAC;QAC1B,iFAAiF;QACjF,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;YAAE,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC9E,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;YAAE,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC1F,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IACjD,CAAC;IACD,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;YAAE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC9E,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;YAAE,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC1F,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IACxD,CAAC;IACD,SAAS;IACT,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;IAC/D,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IACnE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAC5C,CAAC;AAaD,MAAM,UAAU,QAAQ,CAAC,QAAgB,EAAE,KAA0B,EAAE,IAAiC;IACtG,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,iBAAiB,EAAE,KAAK,CAAC,qBAAqB,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC;IACvG,MAAM,QAAQ,GAA2B;QACvC;YACE,KAAK,EAAE,QAAQ;YACf,oBAAoB,EAAE,KAAK,CAAC,iBAAiB;YAC7C,wBAAwB,EAAE,KAAK,CAAC,qBAAqB;YACrD,kBAAkB,EAAE,KAAK,CAAC,eAAe;YACzC,YAAY,EAAE,WAAW;SAC1B;KACF,CAAC;IAEF,KAAK,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,aAAa,EAAE,gBAAgB,CAAU,EAAE,CAAC;QAC3E,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;QAC3C,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,CAAC,iBAAiB,CAAC,CAAC;QACxE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAChD,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK;YACL,oBAAoB,EAAE,UAAU;YAChC,wBAAwB,EAAE,IAAI;YAC9B,kBAAkB,EAAE,MAAM;YAC1B,YAAY,EAAE,OAAO;SACtB,CAAC,CAAC;IACL,CAAC;IAED,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,cAAc,GAAiD,IAAI,CAAC;IACxE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,KAAK,KAAK,QAAQ;YAAE,SAAS;QACnC,MAAM,KAAK,GAAG,CAAC,CAAC,YAAY,GAAG,WAAW,CAAC;QAC3C,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,WAAW,IAAI,KAAK,CAAC;YACrB,IAAI,CAAC,cAAc,IAAI,KAAK,GAAG,cAAc,CAAC,UAAU,EAAE,CAAC;gBACzD,cAAc,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;YACzD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,WAAW,IAAI,CAAC,KAAK,CAAC;QACxB,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,cAAc;QAC5B,CAAC,CAAC,yBAAyB,cAAc,CAAC,KAAK,wBAAwB,cAAc,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,4BAA4B,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;QACpM,CAAC,CAAC,6DAA6D,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,uBAAuB,CAAC;IAE/G,YAAY;IACZ,IAAI,IAAI,EAAE,YAAY,EAAE,CAAC;QACvB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,aAAa,EAAE,gBAAgB,CAAC,CAAC;YAC5D,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC1D,cAAc,CACZ,IAAI,CAAC,GAAG,EAAE,cAAc,CAAC,EACzB,IAAI,CAAC,SAAS,CAAC;gBACb,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBAC5B,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,WAAW;gBACX,WAAW;gBACX,cAAc;aACf,CAAC,GAAG,IAAI,EACT,MAAM,CACP,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,QAAQ;QACR,WAAW;QACX,WAAW;QACX,cAAc;QACd,OAAO;KACR,CAAC;AACJ,CAAC;AAaD,MAAM,UAAU,UAAU,CAAC,QAAgB;IACzC,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,aAAa,EAAE,gBAAgB,EAAE,cAAc,CAAC,CAAC;IAC1E,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QACnB,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,uBAAuB,EAAE,EAAE,EAAE,cAAc,EAAE,UAAU,EAAE,CAAC;IACpH,CAAC;IACD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,IAAI,CAAC;QACH,MAAM,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,SAAS,CAA6B,CAAC;QACxE,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAClE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC;gBACH,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAA+F,CAAC;gBACxH,YAAY,IAAI,CAAC,CAAC;gBAClB,SAAS,IAAI,GAAG,CAAC,WAAW,IAAI,CAAC,CAAC;gBAClC,SAAS,IAAI,GAAG,CAAC,WAAW,IAAI,CAAC,CAAC;gBAClC,MAAM,GAAG,GAAG,GAAG,CAAC,cAAc,EAAE,KAAK,IAAI,MAAM,CAAC;gBAChD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACvC,CAAC;YAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;IAEjB,MAAM,UAAU,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,YAAY,CAAC;IACrE,MAAM,UAAU,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,YAAY,CAAC;IACrE,IAAI,QAAQ,GAA+B,IAAI,CAAC;IAChD,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC5C,IAAI,CAAC,KAAK,MAAM;YAAE,SAAS;QAC3B,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC;YACtB,QAAQ,GAAG,CAAC,CAAC;YACb,aAAa,GAAG,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,GAAyC,UAAU,CAAC;IAC5D,IAAI,QAAQ,IAAI,aAAa,GAAG,YAAY,IAAI,GAAG,EAAE,CAAC;QACpD,IAAI,QAAQ,KAAK,aAAa;YAAE,IAAI,GAAG,YAAY,CAAC;aAC/C,IAAI,QAAQ,KAAK,gBAAgB;YAAE,IAAI,GAAG,eAAe,CAAC;aAC1D,IAAI,QAAQ,KAAK,UAAU;YAAE,IAAI,GAAG,UAAU,CAAC;IACtD,CAAC;IAED,OAAO;QACL,YAAY;QACZ,UAAU;QACV,UAAU;QACV,uBAAuB,EAAE,MAAM;QAC/B,cAAc,EAAE,IAAI;KACrB,CAAC;AACJ,CAAC"}

package/dist/cognitive/curiosity.d.ts

@@ -0,0 +1,37 @@
+/**
+ * v1.64.0 -- COGNITIVE LAYER 3: CURIOSITY ENGINE.
+ *
+ * Daemon-idle gap detector. Scan the wisdom stack, find areas where
+ * Mneme has DATA but no DEFENSE (commits about X but no vaccines)
+ * or VICE VERSA. Generate test claims that probe the gap. Either:
+ *  - the claim grounds (Mneme adds it to its known-truths)
+ *  - the claim refutes (Mneme emits a new vaccine)
+ *
+ * Either way: a gap closes. Mneme gets smarter on its own.
+ *
+ * NO LLM. Heuristic gap scan over .mneme/squadron + .mneme/forecast +
+ * .mneme/whisper.
+ */
+export interface CuriosityGap {
+    /** Stable id for the gap. */
+    id: string;
+    /** Plain-English description. */
+    description: string;
+    /** Where in the wisdom stack the gap was detected. */
+    source: "commit-no-vaccine" | "vaccine-no-test" | "forecast-no-trend" | "whisper-no-import" | "stale-area";
+    /** Suggested test claim that would probe this gap. */
+    suggestedProbe: string;
+    /** Priority 0..1. */
+    priority: number;
+}
+export interface CuriosityScan {
+    gaps: CuriosityGap[];
+    scannedAt: string;
+    totalGaps: number;
+    highPriority: number;
+}
+/** Scan all wisdom layers for gaps. */
+export declare function scanGaps(repoRoot: string): CuriosityScan;
+/** Log a probe that was actually executed in response to a gap. */
+export declare function logProbeExecution(repoRoot: string, gapId: string, outcome: "grounded" | "refuted" | "limbo"): void;
+//# sourceMappingURL=curiosity.d.ts.map

package/dist/cognitive/curiosity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"curiosity.d.ts","sourceRoot":"","sources":["../../src/cognitive/curiosity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAOH,MAAM,WAAW,YAAY;IAC3B,6BAA6B;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,iCAAiC;IACjC,WAAW,EAAE,MAAM,CAAC;IACpB,sDAAsD;IACtD,MAAM,EAAE,mBAAmB,GAAG,iBAAiB,GAAG,mBAAmB,GAAG,mBAAmB,GAAG,YAAY,CAAC;IAC3G,sDAAsD;IACtD,cAAc,EAAE,MAAM,CAAC;IACvB,qBAAqB;IACrB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,YAAY,EAAE,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;CACtB;AAsHD,uCAAuC;AACvC,wBAAgB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,aAAa,CAoBxD;AAED,mEAAmE;AACnE,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,GAAG,SAAS,GAAG,OAAO,GAAG,IAAI,CAQlH"}