cortex-mcp 2.8.0 → 3.0.0

package/dist/memory/correction-detector.js

@@ -0,0 +1,129 @@
+"use strict";
+/**
+ * Correction Detector — Catches user corrections automatically.
+ *
+ * The #1 gap in Cortex: when a user says "no, use X instead of Y",
+ * that correction is LOST when the conversation ends.
+ *
+ * This module scans text (both AI responses and user context) for
+ * correction patterns and auto-stores them as high-importance CORRECTION memories.
+ *
+ * Examples it catches:
+ * - "no, use vectors not vectorCache"
+ * - "that's wrong, it should be const"
+ * - "actually the file is in src/db/"
+ * - "I meant to use path.join"
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.detectUserCorrections = detectUserCorrections;
+exports.detectAIAcknowledgments = detectAIAcknowledgments;
+// ─── Correction Patterns ─────────────────────────────────────────────────────
+const USER_CORRECTION_PATTERNS = [
+    // "no, use X not Y" / "no use X instead of Y"
+    {
+        regex: /\bno[,.]?\s+(use|it'?s|it should be|should be|change to|switch to)\s+(.{3,50}?)(?:\s+(?:not|instead of|rather than)\s+(.{3,50}))?[.!]?\s*$/gim,
+        extractGroups: (m) => ({ corrected: m[2]?.trim(), original: m[3]?.trim() }),
+        confidence: 0.90,
+    },
+    // "that's wrong" / "that's incorrect" / "that's not right"
+    {
+        regex: /\b(that'?s|this is)\s+(wrong|incorrect|not right|not correct|a mistake)\b.{0,80}/gi,
+        extractGroups: () => ({}),
+        confidence: 0.85,
+    },
+    // "actually, X" / "actually it should be X"
+    {
+        regex: /\bactually[,.]?\s+(it\s+)?(should be|is|use|the\s+\w+\s+is)\s+(.{5,80})/gi,
+        extractGroups: (m) => ({ corrected: m[3]?.trim() }),
+        confidence: 0.80,
+    },
+    // "I meant X" / "I mean X"
+    {
+        regex: /\bI\s+mean[t]?\s+(.{5,80})/gi,
+        extractGroups: (m) => ({ corrected: m[1]?.trim() }),
+        confidence: 0.75,
+    },
+    // "not X, but Y" / "not X, Y"
+    {
+        regex: /\bnot\s+(.{3,40}?)[,]\s*(but\s+)?(.{3,40})/gi,
+        extractGroups: (m) => ({ original: m[1]?.trim(), corrected: m[3]?.trim() }),
+        confidence: 0.70,
+    },
+    // "X is wrong" / "X is incorrect"
+    {
+        regex: /\b(.{5,40})\s+is\s+(wrong|incorrect|broken|outdated|deprecated)/gi,
+        extractGroups: (m) => ({ original: m[1]?.trim() }),
+        confidence: 0.75,
+    },
+];
+// AI acknowledgment patterns — when the AI itself admits a mistake
+const AI_ACKNOWLEDGMENT_PATTERNS = [
+    { regex: /\b(I apologize|sorry|my mistake|my bad|you'?re right|good catch)\b/gi, confidence: 0.85 },
+    { regex: /\b(let me fix that|let me correct|I was wrong|I made an error)\b/gi, confidence: 0.90 },
+    { regex: /\b(should have (used|been|done)|instead of .{3,30} I should)\b/gi, confidence: 0.85 },
+    { regex: /\b(the (correct|right|actual|proper) (way|approach|method|answer) is)\b/gi, confidence: 0.80 },
+];
+// ─── Main Detector ───────────────────────────────────────────────────────────
+/**
+ * Detect corrections from user context text.
+ * Call this when auto_learn receives context about what the user said.
+ */
+function detectUserCorrections(userText) {
+    if (!userText || userText.length < 10)
+        return [];
+    const results = [];
+    const sentences = splitIntoSentences(userText);
+    for (const sentence of sentences) {
+        for (const pattern of USER_CORRECTION_PATTERNS) {
+            pattern.regex.lastIndex = 0;
+            const match = pattern.regex.exec(sentence);
+            if (match) {
+                const groups = pattern.extractGroups(match);
+                results.push({
+                    original: groups.original || '',
+                    corrected: groups.corrected || '',
+                    fullContext: sentence.trim().slice(0, 200),
+                    confidence: pattern.confidence,
+                    source: 'user_correction',
+                });
+                break; // One match per sentence
+            }
+        }
+    }
+    return results;
+}
+/**
+ * Detect when the AI acknowledges a mistake in its own response.
+ * Call this from auto_learn on the AI's response text.
+ */
+function detectAIAcknowledgments(aiText) {
+    if (!aiText || aiText.length < 15)
+        return [];
+    const results = [];
+    const sentences = splitIntoSentences(aiText);
+    for (const sentence of sentences) {
+        for (const pattern of AI_ACKNOWLEDGMENT_PATTERNS) {
+            pattern.regex.lastIndex = 0;
+            if (pattern.regex.test(sentence)) {
+                results.push({
+                    original: '',
+                    corrected: '',
+                    fullContext: sentence.trim().slice(0, 200),
+                    confidence: pattern.confidence,
+                    source: 'ai_acknowledgment',
+                });
+                break;
+            }
+        }
+    }
+    return results;
+}
+// ─── Helper ──────────────────────────────────────────────────────────────────
+function splitIntoSentences(text) {
+    return text
+        .replace(/\n+/g, '. ')
+        .split(/(?<=[.!?])\s+/)
+        .map(s => s.trim())
+        .filter(s => s.length > 8 && s.length < 300);
+}
+//# sourceMappingURL=correction-detector.js.map

package/dist/memory/correction-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"correction-detector.js","sourceRoot":"","sources":["../../src/memory/correction-detector.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;AAwEH,sDAyBC;AAMD,0DAuBC;AApHD,gFAAgF;AAEhF,MAAM,wBAAwB,GAIzB;IACD,8CAA8C;IAC9C;QACI,KAAK,EAAE,+IAA+I;QACtJ,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QAC3E,UAAU,EAAE,IAAI;KACnB;IACD,2DAA2D;IAC3D;QACI,KAAK,EAAE,oFAAoF;QAC3F,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;QACzB,UAAU,EAAE,IAAI;KACnB;IACD,4CAA4C;IAC5C;QACI,KAAK,EAAE,2EAA2E;QAClF,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACnD,UAAU,EAAE,IAAI;KACnB;IACD,2BAA2B;IAC3B;QACI,KAAK,EAAE,8BAA8B;QACrC,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACnD,UAAU,EAAE,IAAI;KACnB;IACD,8BAA8B;IAC9B;QACI,KAAK,EAAE,8CAA8C;QACrD,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QAC3E,UAAU,EAAE,IAAI;KACnB;IACD,kCAAkC;IAClC;QACI,KAAK,EAAE,mEAAmE;QAC1E,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QAClD,UAAU,EAAE,IAAI;KACnB;CACJ,CAAC;AAEF,mEAAmE;AACnE,MAAM,0BAA0B,GAG3B;IACD,EAAE,KAAK,EAAE,sEAAsE,EAAE,UAAU,EAAE,IAAI,EAAE;IACnG,EAAE,KAAK,EAAE,oEAAoE,EAAE,UAAU,EAAE,IAAI,EAAE;IACjG,EAAE,KAAK,EAAE,kEAAkE,EAAE,UAAU,EAAE,IAAI,EAAE;IAC/F,EAAE,KAAK,EAAE,2EAA2E,EAAE,UAAU,EAAE,IAAI,EAAE;CAC3G,CAAC;AAEF,gFAAgF;AAEhF;;;GAGG;AACH,SAAgB,qBAAqB,CAAC,QAAgB;IAClD,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IAEjD,MAAM,OAAO,GAAyB,EAAE,CAAC;IACzC,MAAM,SAAS,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAE/C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QAC/B,KAAK,MAAM,OAAO,IAAI,wBAAwB,EAAE,CAAC;YAC7C,OAAO,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YAC5B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3C,IAAI,KAAK,EAAE,CAAC;gBACR,MAAM,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBAC5C,OAAO,CAAC,IAAI,CAAC;oBACT,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,EAAE;oBAC/B,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,EAAE;oBACjC,WAAW,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;oBAC1C,UAAU,EAAE,OAAO,CAAC,UAAU;oBAC9B,MAAM,EAAE,iBAAiB;iBAC5B,CAAC,CAAC;gBACH,MAAM,CAAC,yBAAyB;YACpC,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAgB,uBAAuB,CAAC,MAAc;IAClD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IAE7C,MAAM,OAAO,GAAyB,EAAE,CAAC;IACzC,MAAM,SAAS,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAE7C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QAC/B,KAAK,MAAM,OAAO,IAAI,0BAA0B,EAAE,CAAC;YAC/C,OAAO,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YAC5B,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/B,OAAO,CAAC,IAAI,CAAC;oBACT,QAAQ,EAAE,EAAE;oBACZ,SAAS,EAAE,EAAE;oBACb,WAAW,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;oBAC1C,UAAU,EAAE,OAAO,CAAC,UAAU;oBAC9B,MAAM,EAAE,mBAAmB;iBAC9B,CAAC,CAAC;gBACH,MAAM;YACV,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED,gFAAgF;AAEhF,SAAS,kBAAkB,CAAC,IAAY;IACpC,OAAO,IAAI;SACN,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC;SACrB,KAAK,CAAC,eAAe,CAAC;SACtB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;AACrD,CAAC"}

package/dist/memory/cross-memory-linker.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Cross-Memory Linker — Automatically creates edges between related memories.
+ *
+ * When a new memory is stored, this module finds existing memories that share
+ * topics, files, or keywords and creates graph edges between them.
+ *
+ * This transforms isolated memories into a connected knowledge graph.
+ * When the user asks "tell me about auth", they get a connected story
+ * instead of random fragments.
+ */
+import { MemoryStore } from '../db/memory-store';
+import type { MemoryUnit } from '../types';
+/**
+ * After storing a new memory, auto-link it to related existing memories.
+ * Uses 3 signals: shared files, shared tags, and word overlap.
+ */
+export declare function autoLinkMemory(memoryStore: MemoryStore, newMemory: MemoryUnit): number;
+//# sourceMappingURL=cross-memory-linker.d.ts.map

package/dist/memory/cross-memory-linker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-memory-linker.d.ts","sourceRoot":"","sources":["../../src/memory/cross-memory-linker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,KAAK,EAAE,UAAU,EAAa,MAAM,UAAU,CAAC;AAEtD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,GAAG,MAAM,CAyEtF"}

package/dist/memory/cross-memory-linker.js

@@ -0,0 +1,115 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.autoLinkMemory = autoLinkMemory;
+/**
+ * After storing a new memory, auto-link it to related existing memories.
+ * Uses 3 signals: shared files, shared tags, and word overlap.
+ */
+function autoLinkMemory(memoryStore, newMemory) {
+    let linksCreated = 0;
+    try {
+        // 1. Find memories sharing the same files
+        const fileRelated = [];
+        if (newMemory.relatedFiles && newMemory.relatedFiles.length > 0) {
+            for (const file of newMemory.relatedFiles.slice(0, 3)) {
+                const basename = file.split(/[/\\]/).pop() || file;
+                const related = memoryStore.getByFile(basename, 10);
+                for (const m of related) {
+                    if (m.id !== newMemory.id && m.isActive) {
+                        fileRelated.push(m);
+                    }
+                }
+            }
+        }
+        // 2. Find memories sharing tags
+        const tagRelated = [];
+        const newTags = parseTags(newMemory.tags);
+        if (newTags.length > 0) {
+            for (const tag of newTags.slice(0, 3)) {
+                try {
+                    const tagged = memoryStore.findByTag(tag, 10);
+                    for (const m of tagged) {
+                        if (m.id !== newMemory.id && m.isActive) {
+                            tagRelated.push(m);
+                        }
+                    }
+                }
+                catch { /* tag search might fail */ }
+            }
+        }
+        // 3. Compute word overlap with recent memories
+        const newWords = extractKeywords(newMemory.intent);
+        const recentMemories = memoryStore.getActive(50);
+        const wordRelated = [];
+        for (const m of recentMemories) {
+            if (m.id === newMemory.id)
+                continue;
+            const mWords = extractKeywords(m.intent);
+            const overlap = wordOverlap(newWords, mWords);
+            if (overlap >= 0.3) { // 30%+ word overlap → related
+                wordRelated.push(m);
+            }
+        }
+        // Deduplicate and create edges
+        const seen = new Set();
+        const candidates = [...fileRelated, ...tagRelated, ...wordRelated];
+        for (const related of candidates) {
+            if (seen.has(related.id))
+                continue;
+            seen.add(related.id);
+            if (linksCreated >= 5)
+                break; // Max 5 links per memory
+            const edgeType = fileRelated.includes(related) ? 'same_file' :
+                tagRelated.includes(related) ? 'same_topic' : 'similar';
+            try {
+                memoryStore.addEdge({
+                    sourceId: newMemory.id,
+                    targetId: related.id,
+                    edgeType,
+                    weight: edgeType === 'same_file' ? 0.9 :
+                        edgeType === 'same_topic' ? 0.7 : 0.5,
+                });
+                linksCreated++;
+            }
+            catch { /* edge might already exist */ }
+        }
+    }
+    catch { /* don't break memory storage if linking fails */ }
+    return linksCreated;
+}
+// ─── Helpers ──────────────────────────────────────────────────────────────────
+function parseTags(tags) {
+    if (!tags)
+        return [];
+    if (Array.isArray(tags))
+        return tags;
+    if (typeof tags === 'string') {
+        try {
+            return JSON.parse(tags);
+        }
+        catch {
+            return [];
+        }
+    }
+    return [];
+}
+function extractKeywords(text) {
+    const STOP = new Set(['the', 'a', 'an', 'is', 'are', 'was', 'were', 'to', 'of', 'in',
+        'for', 'on', 'with', 'at', 'by', 'from', 'use', 'always', 'never', 'should',
+        'must', 'not', 'do', 'be', 'it', 'this', 'that', 'and', 'or', 'but', 'we', 'i']);
+    return new Set(text.toLowerCase()
+        .replace(/[^a-z0-9\s]/g, ' ')
+        .split(/\s+/)
+        .filter(w => w.length > 2 && !STOP.has(w)));
+}
+function wordOverlap(a, b) {
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let shared = 0;
+    for (const word of a) {
+        if (b.has(word))
+            shared++;
+    }
+    return shared / Math.min(a.size, b.size);
+}
+//# sourceMappingURL=cross-memory-linker.js.map

package/dist/memory/cross-memory-linker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-memory-linker.js","sourceRoot":"","sources":["../../src/memory/cross-memory-linker.ts"],"names":[],"mappings":";;AAiBA,wCAyEC;AA7ED;;;GAGG;AACH,SAAgB,cAAc,CAAC,WAAwB,EAAE,SAAqB;IAC1E,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,IAAI,CAAC;QACD,0CAA0C;QAC1C,MAAM,WAAW,GAAiB,EAAE,CAAC;QACrC,IAAI,SAAS,CAAC,YAAY,IAAI,SAAS,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9D,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC;gBACnD,MAAM,OAAO,GAAG,WAAW,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;gBACpD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;oBACtB,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;wBACtC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACxB,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,gCAAgC;QAChC,MAAM,UAAU,GAAiB,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACpC,IAAI,CAAC;oBACD,MAAM,MAAM,GAAG,WAAW,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBAC9C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;wBACrB,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;4BACtC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACvB,CAAC;oBACL,CAAC;gBACL,CAAC;gBAAC,MAAM,CAAC,CAAC,2BAA2B,CAAC,CAAC;YAC3C,CAAC;QACL,CAAC;QAED,+CAA+C;QAC/C,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,cAAc,GAAG,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QACjD,MAAM,WAAW,GAAiB,EAAE,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE;gBAAE,SAAS;YACpC,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACzC,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC9C,IAAI,OAAO,IAAI,GAAG,EAAE,CAAC,CAAC,8BAA8B;gBAChD,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;QACL,CAAC;QAED,+BAA+B;QAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,UAAU,GAAG,CAAC,GAAG,WAAW,EAAE,GAAG,UAAU,EAAE,GAAG,WAAW,CAAC,CAAC;QAEnE,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAAE,SAAS;YACnC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACrB,IAAI,YAAY,IAAI,CAAC;gBAAE,MAAM,CAAC,yBAAyB;YAEvD,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;gBAC7C,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC;YAEzE,IAAI,CAAC;gBACD,WAAW,CAAC,OAAO,CAAC;oBAChB,QAAQ,EAAE,SAAS,CAAC,EAAE;oBACtB,QAAQ,EAAE,OAAO,CAAC,EAAE;oBACpB,QAAQ;oBACR,MAAM,EAAE,QAAQ,KAAK,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBAChC,QAAQ,KAAK,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;iBACxB,CAAC,CAAC;gBAC3B,YAAY,EAAE,CAAC;YACnB,CAAC;YAAC,MAAM,CAAC,CAAC,8BAA8B,CAAC,CAAC;QAC9C,CAAC;IACL,CAAC;IAAC,MAAM,CAAC,CAAC,iDAAiD,CAAC,CAAC;IAE7D,OAAO,YAAY,CAAC;AACxB,CAAC;AAED,iFAAiF;AAEjF,SAAS,SAAS,CAAC,IAAS;IACxB,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC;YAAC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,OAAO,EAAE,CAAC;QAAC,CAAC;IACzD,CAAC;IACD,OAAO,EAAE,CAAC;AACd,CAAC;AAED,SAAS,eAAe,CAAC,IAAY;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;QAChF,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ;QAC3E,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IACrF,OAAO,IAAI,GAAG,CACV,IAAI,CAAC,WAAW,EAAE;SACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;SAC5B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACjD,CAAC;AACN,CAAC;AAED,SAAS,WAAW,CAAC,CAAc,EAAE,CAAc;IAC/C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,EAAE,CAAC;IAC9B,CAAC;IACD,OAAO,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC"}

package/dist/memory/daily-diary.d.ts

@@ -0,0 +1,30 @@
+export interface DiaryEntry {
+    type: 'decision' | 'correction' | 'bug_fix' | 'convention' | 'insight' | 'task' | 'file_change';
+    content: string;
+    file?: string;
+}
+/**
+ * Append an entry to today's diary.
+ */
+export declare function appendDiaryEntry(entry: DiaryEntry): void;
+/**
+ * Get diary content for a specific date.
+ */
+export declare function getDiaryForDate(date: string): string | null;
+/**
+ * Get the last N days of diary entries combined.
+ */
+export declare function getRecentDiary(days?: number): string;
+/**
+ * Format diary context for injection into force_recall.
+ * Returns last 2 days of diary, condensed.
+ */
+export declare function formatDiaryContext(): string;
+/**
+ * Get diary stats for dashboard.
+ */
+export declare function getDiaryStats(): {
+    totalDays: number;
+    todayEntries: number;
+};
+//# sourceMappingURL=daily-diary.d.ts.map

package/dist/memory/daily-diary.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"daily-diary.d.ts","sourceRoot":"","sources":["../../src/memory/daily-diary.ts"],"names":[],"mappings":"AAmBA,MAAM,WAAW,UAAU;IACvB,IAAI,EAAE,UAAU,GAAG,YAAY,GAAG,SAAS,GAAG,YAAY,GAAG,SAAS,GAAG,MAAM,GAAG,aAAa,CAAC;IAChG,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;CACjB;AAID;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,UAAU,GAAG,IAAI,CAoBxD;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAQ3D;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,IAAI,GAAE,MAAU,GAAG,MAAM,CAevD;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,IAAI,MAAM,CAU3C;AAED;;GAEG;AACH,wBAAgB,aAAa,IAAI;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,MAAM,CAAA;CAAE,CAY3E"}

package/dist/memory/daily-diary.js

@@ -0,0 +1,159 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.appendDiaryEntry = appendDiaryEntry;
+exports.getDiaryForDate = getDiaryForDate;
+exports.getRecentDiary = getRecentDiary;
+exports.formatDiaryContext = formatDiaryContext;
+exports.getDiaryStats = getDiaryStats;
+/**
+ * Daily Diary — OpenClaw-style daily Markdown logs.
+ *
+ * Writes append-only daily notes like OpenClaw's memory/YYYY-MM-DD.md.
+ * Each day gets its own file with timestamped entries:
+ * - What was learned
+ * - What files changed
+ * - What decisions were made
+ * - What bugs were fixed
+ *
+ * This gives the AI a "running journal" of recent work.
+ * Injected into force_recall as Layer 7.5 (recent context).
+ *
+ * Stored in: ~/.cortex-memory/diary/YYYY-MM-DD.md
+ */
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const os = __importStar(require("os"));
+const DIARY_DIR = path.join(os.homedir(), '.cortex-memory', 'diary');
+/**
+ * Append an entry to today's diary.
+ */
+function appendDiaryEntry(entry) {
+    try {
+        if (!fs.existsSync(DIARY_DIR))
+            fs.mkdirSync(DIARY_DIR, { recursive: true });
+        const today = getDateString();
+        const diaryPath = path.join(DIARY_DIR, `${today}.md`);
+        const time = new Date().toLocaleTimeString('en-US', { hour12: false, hour: '2-digit', minute: '2-digit' });
+        const icon = ICONS[entry.type] || '📝';
+        const fileSuffix = entry.file ? ` _(${path.basename(entry.file)})_` : '';
+        const line = `- ${time} ${icon} **${entry.type.toUpperCase()}**: ${entry.content}${fileSuffix}\n`;
+        // Create header if new file
+        if (!fs.existsSync(diaryPath)) {
+            const header = `# 📔 Cortex Diary — ${today}\n\n`;
+            fs.writeFileSync(diaryPath, header, 'utf-8');
+        }
+        fs.appendFileSync(diaryPath, line, 'utf-8');
+    }
+    catch { /* diary is non-critical */ }
+}
+/**
+ * Get diary content for a specific date.
+ */
+function getDiaryForDate(date) {
+    try {
+        const diaryPath = path.join(DIARY_DIR, `${date}.md`);
+        if (fs.existsSync(diaryPath)) {
+            return fs.readFileSync(diaryPath, 'utf-8');
+        }
+    }
+    catch { /* */ }
+    return null;
+}
+/**
+ * Get the last N days of diary entries combined.
+ */
+function getRecentDiary(days = 3) {
+    const entries = [];
+    const now = Date.now();
+    const DAY = 24 * 60 * 60 * 1000;
+    for (let i = 0; i < days; i++) {
+        const date = new Date(now - i * DAY);
+        const dateStr = formatDate(date);
+        const content = getDiaryForDate(dateStr);
+        if (content && content.trim().length > 50) {
+            entries.push(content.trim());
+        }
+    }
+    return entries.join('\n\n---\n\n');
+}
+/**
+ * Format diary context for injection into force_recall.
+ * Returns last 2 days of diary, condensed.
+ */
+function formatDiaryContext() {
+    const diary = getRecentDiary(2);
+    if (!diary || diary.length < 50)
+        return '';
+    // Truncate to last 20 entries to avoid flooding context
+    const lines = diary.split('\n').filter(l => l.startsWith('- '));
+    const recent = lines.slice(-20);
+    if (recent.length === 0)
+        return '';
+    return `\n## 📔 Recent Diary (last 2 days)\n${recent.join('\n')}`;
+}
+/**
+ * Get diary stats for dashboard.
+ */
+function getDiaryStats() {
+    try {
+        if (!fs.existsSync(DIARY_DIR))
+            return { totalDays: 0, todayEntries: 0 };
+        const files = fs.readdirSync(DIARY_DIR).filter(f => f.endsWith('.md'));
+        const today = getDiaryForDate(getDateString());
+        const todayEntries = today ? today.split('\n').filter(l => l.startsWith('- ')).length : 0;
+        return { totalDays: files.length, todayEntries };
+    }
+    catch {
+        return { totalDays: 0, todayEntries: 0 };
+    }
+}
+// ─── Helpers ──────────────────────────────────────────────────────────────────
+const ICONS = {
+    decision: '📌',
+    correction: '🔴',
+    bug_fix: '🐛',
+    convention: '📏',
+    insight: '💡',
+    task: '📋',
+    file_change: '📁',
+};
+function getDateString() {
+    return formatDate(new Date());
+}
+function formatDate(d) {
+    return d.toISOString().split('T')[0]; // YYYY-MM-DD
+}
+//# sourceMappingURL=daily-diary.js.map

package/dist/memory/daily-diary.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"daily-diary.js","sourceRoot":"","sources":["../../src/memory/daily-diary.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,4CAoBC;AAKD,0CAQC;AAKD,wCAeC;AAMD,gDAUC;AAKD,sCAYC;AApHD;;;;;;;;;;;;;;GAcG;AACH,uCAAyB;AACzB,2CAA6B;AAC7B,uCAAyB;AAQzB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,gBAAgB,EAAE,OAAO,CAAC,CAAC;AAErE;;GAEG;AACH,SAAgB,gBAAgB,CAAC,KAAiB;IAC9C,IAAI,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC;YAAE,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAE5E,MAAM,KAAK,GAAG,aAAa,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,KAAK,KAAK,CAAC,CAAC;QAEtD,MAAM,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC,kBAAkB,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;QAC3G,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;QACvC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACzE,MAAM,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,KAAK,CAAC,OAAO,GAAG,UAAU,IAAI,CAAC;QAElG,4BAA4B;QAC5B,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,uBAAuB,KAAK,MAAM,CAAC;YAClD,EAAE,CAAC,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACjD,CAAC;QAED,EAAE,CAAC,cAAc,CAAC,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IAAC,MAAM,CAAC,CAAC,2BAA2B,CAAC,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe,CAAC,IAAY;IACxC,IAAI,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,IAAI,KAAK,CAAC,CAAC;QACrD,IAAI,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YAC3B,OAAO,EAAE,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;IACL,CAAC;IAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;IACjB,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAgB,cAAc,CAAC,OAAe,CAAC;IAC3C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,OAAO,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;AACvC,CAAC;AAED;;;GAGG;AACH,SAAgB,kBAAkB;IAC9B,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IAE3C,wDAAwD;IACxD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAChE,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAChC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,OAAO,uCAAuC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AACtE,CAAC;AAED;;GAEG;AACH,SAAgB,aAAa;IACzB,IAAI,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC;YAAE,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;QAExE,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QACvE,MAAM,KAAK,GAAG,eAAe,CAAC,aAAa,EAAE,CAAC,CAAC;QAC/C,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAE1F,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC;IACrD,CAAC;IAAC,MAAM,CAAC;QACL,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IAC7C,CAAC;AACL,CAAC;AAED,iFAAiF;AAEjF,MAAM,KAAK,GAA2B;IAClC,QAAQ,EAAE,IAAI;IACd,UAAU,EAAE,IAAI;IAChB,OAAO,EAAE,IAAI;IACb,UAAU,EAAE,IAAI;IAChB,OAAO,EAAE,IAAI;IACb,IAAI,EAAE,IAAI;IACV,WAAW,EAAE,IAAI;CACpB,CAAC;AAEF,SAAS,aAAa;IAClB,OAAO,UAAU,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,UAAU,CAAC,CAAO;IACvB,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa;AACvD,CAAC"}

package/dist/memory/embedding-cache.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Embedding Cache — Avoids re-computing embeddings for identical text.
+ *
+ * Extracted from OpenClaw's embedding_cache table architecture.
+ *
+ * Problem: Every recall re-embeds the query, even if it's the exact same text.
+ * With MiniLM this takes ~50ms per embedding — adds up fast.
+ *
+ * Solution: Cache embeddings in memory with an LRU eviction policy.
+ * Cache key = hash of the text content.
+ */
+/**
+ * Get a cached embedding for text, or null if not cached.
+ */
+export declare function getCachedEmbedding(text: string): number[] | null;
+/**
+ * Store an embedding in the cache.
+ * Uses LRU eviction when cache is full.
+ */
+export declare function cacheEmbedding(text: string, embedding: number[]): void;
+/**
+ * Clear the entire embedding cache.
+ */
+export declare function clearEmbeddingCache(): void;
+/**
+ * Get cache stats for debugging/dashboard.
+ */
+export declare function getEmbeddingCacheStats(): {
+    size: number;
+    maxSize: number;
+};
+//# sourceMappingURL=embedding-cache.d.ts.map

package/dist/memory/embedding-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding-cache.d.ts","sourceRoot":"","sources":["../../src/memory/embedding-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAuBH;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI,CAQhE;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI,CAiBtE;AAED;;GAEG;AACH,wBAAgB,mBAAmB,IAAI,IAAI,CAE1C;AAED;;GAEG;AACH,wBAAgB,sBAAsB,IAAI;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAE1E"}

package/dist/memory/embedding-cache.js

@@ -0,0 +1,76 @@
+"use strict";
+/**
+ * Embedding Cache — Avoids re-computing embeddings for identical text.
+ *
+ * Extracted from OpenClaw's embedding_cache table architecture.
+ *
+ * Problem: Every recall re-embeds the query, even if it's the exact same text.
+ * With MiniLM this takes ~50ms per embedding — adds up fast.
+ *
+ * Solution: Cache embeddings in memory with an LRU eviction policy.
+ * Cache key = hash of the text content.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getCachedEmbedding = getCachedEmbedding;
+exports.cacheEmbedding = cacheEmbedding;
+exports.clearEmbeddingCache = clearEmbeddingCache;
+exports.getEmbeddingCacheStats = getEmbeddingCacheStats;
+const CACHE_MAX = 256;
+const cache = new Map();
+/**
+ * Simple FNV-1a hash — fast and good enough for cache keys.
+ */
+function hashText(text) {
+    let hash = 0x811c9dc5;
+    for (let i = 0; i < text.length; i++) {
+        hash ^= text.charCodeAt(i);
+        hash = (hash * 0x01000193) >>> 0;
+    }
+    return hash.toString(36);
+}
+/**
+ * Get a cached embedding for text, or null if not cached.
+ */
+function getCachedEmbedding(text) {
+    const key = hashText(text);
+    const entry = cache.get(key);
+    if (entry) {
+        entry.timestamp = Date.now(); // Touch for LRU
+        return entry.embedding;
+    }
+    return null;
+}
+/**
+ * Store an embedding in the cache.
+ * Uses LRU eviction when cache is full.
+ */
+function cacheEmbedding(text, embedding) {
+    const key = hashText(text);
+    // LRU eviction if full
+    if (cache.size >= CACHE_MAX && !cache.has(key)) {
+        let oldestKey = '';
+        let oldestTime = Infinity;
+        for (const [k, v] of cache) {
+            if (v.timestamp < oldestTime) {
+                oldestTime = v.timestamp;
+                oldestKey = k;
+            }
+        }
+        if (oldestKey)
+            cache.delete(oldestKey);
+    }
+    cache.set(key, { embedding, timestamp: Date.now() });
+}
+/**
+ * Clear the entire embedding cache.
+ */
+function clearEmbeddingCache() {
+    cache.clear();
+}
+/**
+ * Get cache stats for debugging/dashboard.
+ */
+function getEmbeddingCacheStats() {
+    return { size: cache.size, maxSize: CACHE_MAX };
+}
+//# sourceMappingURL=embedding-cache.js.map

package/dist/memory/embedding-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding-cache.js","sourceRoot":"","sources":["../../src/memory/embedding-cache.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;AA0BH,gDAQC;AAMD,wCAiBC;AAKD,kDAEC;AAKD,wDAEC;AArED,MAAM,SAAS,GAAG,GAAG,CAAC;AAOtB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;AAE5C;;GAEG;AACH,SAAS,QAAQ,CAAC,IAAY;IAC1B,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,CAAC,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,SAAgB,kBAAkB,CAAC,IAAY;IAC3C,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAI,KAAK,EAAE,CAAC;QACR,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,gBAAgB;QAC9C,OAAO,KAAK,CAAC,SAAS,CAAC;IAC3B,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAgB,cAAc,CAAC,IAAY,EAAE,SAAmB;IAC5D,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAE3B,uBAAuB;IACvB,IAAI,KAAK,CAAC,IAAI,IAAI,SAAS,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7C,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,IAAI,UAAU,GAAG,QAAQ,CAAC;QAC1B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,SAAS,GAAG,UAAU,EAAE,CAAC;gBAC3B,UAAU,GAAG,CAAC,CAAC,SAAS,CAAC;gBACzB,SAAS,GAAG,CAAC,CAAC;YAClB,CAAC;QACL,CAAC;QACD,IAAI,SAAS;YAAE,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;AACzD,CAAC;AAED;;GAEG;AACH,SAAgB,mBAAmB;IAC/B,KAAK,CAAC,KAAK,EAAE,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,SAAgB,sBAAsB;IAClC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;AACpD,CAAC"}

package/dist/memory/embedding-manager.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"embedding-manager.d.ts","sourceRoot":"","sources":["../../src/memory/embedding-manager.ts"],"names":[],"mappings":"AAeA,wBAAgB,oBAAoB,IAAI,IAAI,CAG3C;AAiED,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CA4BzD;AAED,wBAAgB,aAAa,IAAI,OAAO,CAEvC;AAED,wBAAgB,eAAe,IAAI,IAAI,CAMtC"}
+{"version":3,"file":"embedding-manager.d.ts","sourceRoot":"","sources":["../../src/memory/embedding-manager.ts"],"names":[],"mappings":"AAeA,wBAAgB,oBAAoB,IAAI,IAAI,CAK3C;AAiED,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CA4BzD;AAED,wBAAgB,aAAa,IAAI,OAAO,CAEvC;AAED,wBAAgB,eAAe,IAAI,IAAI,CAMtC"}

package/dist/memory/embedding-manager.js

@@ -50,8 +50,10 @@ let workerReady = false;
 const pendingEmbeddings = new Map();
 let workerFailed = false;
 function startEmbeddingWorker() {
-    // Lazy: just mark that we want embedding. Actual worker starts on first use.
-    console.log('  [cortex-mcp] Embedding worker registered (lazy — starts on first use)');
+    // Eagerly boot worker on startup to avoid 5-10s latency on first use
+    if (!ensureWorkerStarted()) {
+        console.log('  [cortex-mcp] Embedding worker unavailable, running FTS-only mode');
+    }
 }
 function ensureWorkerStarted() {
     if (embeddingWorker)
@@ -98,7 +100,7 @@ function ensureWorkerStarted() {
             workerFailed = true;
             embeddingWorker = null;
             // Reject all pending embeddings
-            for (const [id, pending] of pendingEmbeddings) {
+            for (const [_id, pending] of pendingEmbeddings) {
                 pending.reject(new Error('Worker crashed'));
             }
             pendingEmbeddings.clear();
@@ -110,7 +112,7 @@ function ensureWorkerStarted() {
                 workerFailed = true;
                 embeddingWorker = null;
                 // Reject all pending embeddings
-                for (const [id, pending] of pendingEmbeddings) {
+                for (const [_id, pending] of pendingEmbeddings) {
                     pending.reject(new Error('Worker exited'));
                 }
                 pendingEmbeddings.clear();