cortex-mcp 2.4.0 → 2.6.0

package/CHANGELOG.md

@@ -2,7 +2,55 @@
 
 All notable changes to Cortex MCP Server are documented here.
 
-## [2.1.0] -- 2026-03-02
+## [2.4.0] -- 2026-03-03
+
+### Added
+
+- **Independent importance scoring** — Memories scored by type (CORRECTION=0.85, INSIGHT=0.55) + content signal boosts (file paths, error keywords, version numbers)
+- **Topic tag extraction** — Auto-tags memories with technologies, domains, and actions (`['typescript', 'auth', 'database', 'testing']`)
+- **FTS resolved filter** — Full-text search excludes resolved-tagged memories from results
+- **Code block safety** — `splitSentences` strips ``` fenced blocks and inline code before extraction
+- **Dashboard auto-refresh** — Auto-refreshes every 30 seconds via meta tag
+
+### Changed
+
+- **Action field** — Now stores source (`auto_learn:decision`) instead of duplicating intent content
+
+## [2.3.1] -- 2026-03-03
+
+### Removed
+
+- **Dead code: `event-bus.ts`** — 60 lines, 0 imports anywhere in codebase
+- **Dead method: `cleanFTSQuery()`** — Unused private method in hybrid-retriever.ts
+
+### Added
+
+- **Memory decay Step 5** — Deactivate resolved memories >7 days old
+
+### Fixed
+
+- **Lint** — Prefixed unused `_confidence` parameter in completion-resolver.ts
+- **README** — Updated "What's New in v2.0" → "What's New in v2.3"
+
+## [2.3.0] -- 2026-03-03
+
+### Fixed (Critical Brain Bugs)
+
+- **Markdown bullet extraction** — `splitSentences()` now splits on newlines and bullets, not just periods. 4x more memories extracted from AI responses
+- **Solo developer capture** — Added "I used/chose/picked" patterns (was only "we used")
+- **DECISION vs CORRECTION misclassification** — Raised DECISION confidence to 0.78 (was 0.70, CORRECTION's "instead of" won at 0.75)
+- **Completion resolver wired** — `completion-resolver.ts` was dead code, now integrated into `handleAutoLearn`
+- **Ranker resolved penalty** — Resolved-tagged memories score 85% lower (0.15x multiplier)
+- **Context builder filter** — Excludes resolved memories from context output
+
+## [2.2.0] -- 2026-03-02
+
+### Added
+
+- **20 MCP tools** — Added `review_code`, `pre_check`, `check_impact`, `resume_work`
+- **Attention ranking** — Debugging context boosts bug-fix memories, coding boosts conventions
+- **Meta-memory** — Knowledge gap detection for files with zero memories
+- **Memory consolidation** — Duplicate memories merge, keeping highest importance
 
 ### Fixed
 

package/README.md

@@ -10,18 +10,20 @@
 
 Cortex is an MCP (Model Context Protocol) server that provides persistent, intelligent memory to any AI coding assistant — Cursor, Claude Code, Windsurf, Cline, or any MCP-compatible tool.
 
-## What's New in v2.3
-
+## What's New in v2.4
+
+- **🧠 Smart importance scoring** — Memories ranked by type (CORRECTION > INSIGHT) + content signals (file paths, error keywords boost importance)
+- **🏷️ Auto topic tags** — Memories auto-tagged with technologies, domains, and actions (`['typescript', 'auth', 'database']`)
+- **🏁 Task completion tracking** — Say "finished SEO work" and old SEO memories get demoted automatically
+- **🔍 Resolved memory filtering** — FTS search, ranker, and context builder all exclude completed work
+- **🛡️ Code block safety** — Auto-learn no longer extracts from code blocks (no `const foo = bar()` as memories)
+- **📊 Dashboard auto-refresh** — Updates every 30 seconds
 - **Free LLM integration** — Add `OPENROUTER_API_KEY` for 3x smarter memory extraction (zero cost!)
-- **🔥 Daily streaks** — Track consecutive days of use ("7-day streak!")
-- **💡 Tip of the day** — Random useful memory surfaced every session
+- **40+ auto-learn patterns** — Captures decisions, corrections, conventions, bug fixes from AI responses
 - **Error fingerprints** — Auto-captures stack traces, TS errors, npm failures for instant fix recall
 - **Success tracking** — Detects "that worked!" and stores proven approaches
-- **Project memory filtering** — Memories boosted for current project, penalized for others
-- **Git-enhanced resume** — Shows recent commits when resuming work
 - **Brain Health Score** — Gamified 0-100 score with grades (Newborn → Genius)
-- **40+ auto-learn patterns** — 3x more patterns for capturing knowledge from conversations
-- **Cross-platform fixes** — Windows-compatible git commands, proper stderr handling
+- **Git-enhanced resume** — Shows recent commits + branch context when resuming work
 
 See [CHANGELOG.md](CHANGELOG.md) for full details.
 
@@ -126,16 +128,6 @@ Then add to your MCP config:
 
 Restart your IDE and Cortex is active.
 
-### Option 3: Direct Download (Binaries)
-
-No Node.js required. Download from the latest release:
-
-- [Windows](https://github.com/jaswanthkumarj1234-beep/cortex-mcp/releases/latest/download/cortex-win.exe)
-- [macOS](https://github.com/jaswanthkumarj1234-beep/cortex-mcp/releases/latest/download/cortex-macos)
-- [Linux](https://github.com/jaswanthkumarj1234-beep/cortex-mcp/releases/latest/download/cortex-linux)
-
-Then configure your MCP client to run the executable directly.
-
 ### Try the Demo
 
 See Cortex in action without any AI client:
@@ -168,26 +160,30 @@ Step-by-step instructions for your IDE: **[Cursor · Claude Code · Windsurf ·
 | **Setup**                   |          `npm i -g cortex-mcp` + 1 config line           |          Varies          |
 | **Offline**                 |          100% local SQLite (no API key needed)           |    Often requires API    |
 
-### 16 MCP Tools
-
-| Tool              | Purpose                                                    |
-| ----------------- | ---------------------------------------------------------- |
-| `force_recall`    | Full brain dump at conversation start (12+ layer pipeline) |
-| `recall_memory`   | Search memories by topic (FTS + vector + graph)            |
-| `store_memory`    | Store a decision, correction, convention, or bug fix       |
-| `quick_store`     | One-liner memory storage with auto-classification          |
-| `auto_learn`      | Extract memories from AI responses automatically           |
-| `scan_project`    | Scan project structure, stack, git, exports, architecture  |
-| `verify_code`     | Check if imports/exports/env vars actually exist           |
-| `verify_files`    | Check if file paths are real or hallucinated               |
-| `get_context`     | Get compressed context for current file                    |
-| `get_stats`       | Memory database statistics                                 |
-| `list_memories`   | List all active memories                                   |
-| `update_memory`   | Update an existing memory                                  |
-| `delete_memory`   | Delete a memory                                            |
-| `export_memories` | Export all memories to JSON                                |
-| `import_memories` | Import memories from JSON                                  |
-| `health_check`    | Server health check                                        |
+### 20 MCP Tools
+
+| Tool              | Purpose                                                                            |
+| ----------------- | ---------------------------------------------------------------------------------- |
+| `force_recall`    | Full brain dump at conversation start (12+ layer pipeline)                         |
+| `recall_memory`   | Search memories by topic (FTS + vector + graph)                                    |
+| `store_memory`    | Store a decision, correction, convention, or bug fix                               |
+| `quick_store`     | One-liner memory storage with auto-classification                                  |
+| `auto_learn`      | Extract memories from AI responses automatically                                   |
+| `scan_project`    | Scan project structure, stack, git, exports, architecture                          |
+| `verify_code`     | Check if imports/exports/env vars actually exist                                   |
+| `verify_files`    | Check if file paths are real or hallucinated                                       |
+| `get_context`     | Get compressed context for current file                                            |
+| `review_code`     | Review code against stored conventions and past bug patterns                       |
+| `pre_check`       | Pre-flight check before editing — get all conventions and past bugs for a file     |
+| `check_impact`    | Impact analysis — check which files depend on the file you plan to modify          |
+| `resume_work`     | Resume after a break — get last session summary, recent corrections, pending tasks |
+| `get_stats`       | Memory database statistics                                                         |
+| `list_memories`   | List all active memories                                                           |
+| `update_memory`   | Update an existing memory                                                          |
+| `delete_memory`   | Delete a memory                                                                    |
+| `export_memories` | Export all memories to JSON                                                        |
+| `import_memories` | Import memories from JSON                                                          |
+| `health_check`    | Server health check                                                                |
 
 ### 12+ Layer Brain Pipeline
 
@@ -369,7 +365,7 @@ graph TB
 - **Windows**: Install [Visual Studio Build Tools](https://visualstudio.microsoft.com/visual-cpp-build-tools/)
 - **macOS**: Run `xcode-select --install`
 - **Linux**: Run `sudo apt-get install build-essential python3`
-      </details>
+  </details>
 
 <details>
 <summary><strong>License key not working</strong></summary>

package/dist/memory/access-pattern-tracker.d.ts

@@ -0,0 +1,51 @@
+/**
+ * Access Pattern Tracker — Learns which memory types each user actually uses.
+ *
+ * Tracks recall/search patterns and builds a personal preference profile.
+ * The ranker uses this to boost memory types the user accesses most often.
+ *
+ * Example: If a user recalls CORRECTION memories 5x more than INSIGHT,
+ * future results boost CORRECTIONs so the brain feels personalized.
+ */
+import { MemoryStore } from '../db/memory-store';
+export interface AccessProfile {
+    typeCounts: Record<string, number>;
+    totalAccesses: number;
+    lastUpdated: number;
+}
+/**
+ * Record that the user accessed a memory of a given type.
+ * Called whenever recall_memory, force_recall, or pre_check returns results.
+ */
+export declare function recordAccess(type: string): void;
+/**
+ * Record accesses for a batch of recalled memories.
+ */
+export declare function recordBatchAccess(memories: Array<{
+    type: string;
+}>): void;
+/**
+ * Get a personalized boost multiplier for a memory type.
+ * Types the user accesses frequently get boosted (up to 1.8x).
+ * Types never accessed stay at 1.0x (neutral).
+ *
+ * Uses frequency ratio: (type_count / total) normalized to 1.0-1.8 range.
+ */
+export declare function getPersonalBoost(type: string): number;
+/**
+ * Get the full access profile (for dashboard/stats).
+ */
+export declare function getAccessProfile(): AccessProfile;
+/**
+ * Try to load access profile from stored memories (persistence across restarts).
+ */
+export declare function loadAccessProfile(memoryStore: MemoryStore): void;
+/**
+ * Get top accessed types (for diagnostics).
+ */
+export declare function getTopTypes(n?: number): Array<{
+    type: string;
+    count: number;
+    boost: number;
+}>;
+//# sourceMappingURL=access-pattern-tracker.d.ts.map

package/dist/memory/access-pattern-tracker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"access-pattern-tracker.d.ts","sourceRoot":"","sources":["../../src/memory/access-pattern-tracker.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAEjD,MAAM,WAAW,aAAa;IAC1B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,aAAa,EAAE,MAAM,CAAC;IACtB,WAAW,EAAE,MAAM,CAAC;CACvB;AASD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAI/C;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,IAAI,CAIzE;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAYrD;AAED;;GAEG;AACH,wBAAgB,gBAAgB,IAAI,aAAa,CAEhD;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,WAAW,GAAG,IAAI,CAkBhE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,CAAC,GAAE,MAAU,GAAG,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAShG"}

package/dist/memory/access-pattern-tracker.js

@@ -0,0 +1,92 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.recordAccess = recordAccess;
+exports.recordBatchAccess = recordBatchAccess;
+exports.getPersonalBoost = getPersonalBoost;
+exports.getAccessProfile = getAccessProfile;
+exports.loadAccessProfile = loadAccessProfile;
+exports.getTopTypes = getTopTypes;
+// In-memory access profile (persisted via session tracker)
+let accessProfile = {
+    typeCounts: {},
+    totalAccesses: 0,
+    lastUpdated: Date.now(),
+};
+/**
+ * Record that the user accessed a memory of a given type.
+ * Called whenever recall_memory, force_recall, or pre_check returns results.
+ */
+function recordAccess(type) {
+    accessProfile.typeCounts[type] = (accessProfile.typeCounts[type] || 0) + 1;
+    accessProfile.totalAccesses++;
+    accessProfile.lastUpdated = Date.now();
+}
+/**
+ * Record accesses for a batch of recalled memories.
+ */
+function recordBatchAccess(memories) {
+    for (const m of memories) {
+        recordAccess(m.type);
+    }
+}
+/**
+ * Get a personalized boost multiplier for a memory type.
+ * Types the user accesses frequently get boosted (up to 1.8x).
+ * Types never accessed stay at 1.0x (neutral).
+ *
+ * Uses frequency ratio: (type_count / total) normalized to 1.0-1.8 range.
+ */
+function getPersonalBoost(type) {
+    if (accessProfile.totalAccesses < 10)
+        return 1.0; // Not enough data yet
+    const typeCount = accessProfile.typeCounts[type] || 0;
+    const frequency = typeCount / accessProfile.totalAccesses;
+    // Expected frequency if all types were equal (~20% with 5 types)
+    const expectedFreq = 0.2;
+    // Boost = 1.0 + (frequency - expected) * scale, clamped to [0.7, 1.8]
+    const boost = 1.0 + (frequency - expectedFreq) * 4.0;
+    return Math.max(0.7, Math.min(1.8, boost));
+}
+/**
+ * Get the full access profile (for dashboard/stats).
+ */
+function getAccessProfile() {
+    return { ...accessProfile };
+}
+/**
+ * Try to load access profile from stored memories (persistence across restarts).
+ */
+function loadAccessProfile(memoryStore) {
+    try {
+        const profileMemories = memoryStore.getByType('INSIGHT', 100);
+        // Reconstruct from access_count of each type
+        const all = memoryStore.getActive(500);
+        const typeCounts = {};
+        let total = 0;
+        for (const m of all) {
+            const count = m.accessCount || 0;
+            if (count > 0) {
+                typeCounts[m.type] = (typeCounts[m.type] || 0) + count;
+                total += count;
+            }
+        }
+        if (total > 0) {
+            accessProfile = { typeCounts, totalAccesses: total, lastUpdated: Date.now() };
+        }
+    }
+    catch { /* fresh install, no data yet */ }
+}
+/**
+ * Get top accessed types (for diagnostics).
+ */
+function getTopTypes(n = 5) {
+    return Object.entries(accessProfile.typeCounts)
+        .sort(([, a], [, b]) => b - a)
+        .slice(0, n)
+        .map(([type, count]) => ({
+        type,
+        count,
+        boost: getPersonalBoost(type),
+    }));
+}
+//# sourceMappingURL=access-pattern-tracker.js.map

package/dist/memory/access-pattern-tracker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"access-pattern-tracker.js","sourceRoot":"","sources":["../../src/memory/access-pattern-tracker.ts"],"names":[],"mappings":";;AA4BA,oCAIC;AAKD,8CAIC;AASD,4CAYC;AAKD,4CAEC;AAKD,8CAkBC;AAKD,kCASC;AAzFD,2DAA2D;AAC3D,IAAI,aAAa,GAAkB;IAC/B,UAAU,EAAE,EAAE;IACd,aAAa,EAAE,CAAC;IAChB,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;CAC1B,CAAC;AAEF;;;GAGG;AACH,SAAgB,YAAY,CAAC,IAAY;IACrC,aAAa,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3E,aAAa,CAAC,aAAa,EAAE,CAAC;IAC9B,aAAa,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,SAAgB,iBAAiB,CAAC,QAAiC;IAC/D,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACvB,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAAC,IAAY;IACzC,IAAI,aAAa,CAAC,aAAa,GAAG,EAAE;QAAE,OAAO,GAAG,CAAC,CAAC,sBAAsB;IAExE,MAAM,SAAS,GAAG,aAAa,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,SAAS,GAAG,aAAa,CAAC,aAAa,CAAC;IAE1D,iEAAiE;IACjE,MAAM,YAAY,GAAG,GAAG,CAAC;IAEzB,sEAAsE;IACtE,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,SAAS,GAAG,YAAY,CAAC,GAAG,GAAG,CAAC;IACrD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,SAAgB,gBAAgB;IAC5B,OAAO,EAAE,GAAG,aAAa,EAAE,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,SAAgB,iBAAiB,CAAC,WAAwB;IACtD,IAAI,CAAC;QACD,MAAM,eAAe,GAAG,WAAW,CAAC,SAAS,CAAC,SAAgB,EAAE,GAAG,CAAC,CAAC;QACrE,6CAA6C;QAC7C,MAAM,GAAG,GAAG,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,UAAU,GAA2B,EAAE,CAAC;QAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YAClB,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC;YACjC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACZ,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;gBACvD,KAAK,IAAI,KAAK,CAAC;YACnB,CAAC;QACL,CAAC;QACD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACZ,aAAa,GAAG,EAAE,UAAU,EAAE,aAAa,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QAClF,CAAC;IACL,CAAC;IAAC,MAAM,CAAC,CAAC,gCAAgC,CAAC,CAAC;AAChD,CAAC;AAED;;GAEG;AACH,SAAgB,WAAW,CAAC,IAAY,CAAC;IACrC,OAAO,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC;SAC1C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;SAC7B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QACrB,IAAI;QACJ,KAAK;QACL,KAAK,EAAE,gBAAgB,CAAC,IAAI,CAAC;KAChC,CAAC,CAAC,CAAC;AACZ,CAAC"}

package/dist/memory/auto-learner.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"auto-learner.d.ts","sourceRoot":"","sources":["../../src/memory/auto-learner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,MAAM,MAAM,UAAU,GAAG,UAAU,GAAG,YAAY,GAAG,YAAY,GAAG,SAAS,GAAG,SAAS,GACnF,gBAAgB,GAAG,eAAe,GAAG,QAAQ,GAAG,cAAc,CAAC;AAErE,MAAM,WAAW,eAAe;IAC5B,IAAI,EAAE,UAAU,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAClB;AAmRD,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,eAAe,EAAE,CAsD/D"}
+{"version":3,"file":"auto-learner.d.ts","sourceRoot":"","sources":["../../src/memory/auto-learner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,MAAM,MAAM,UAAU,GAAG,UAAU,GAAG,YAAY,GAAG,YAAY,GAAG,SAAS,GAAG,SAAS,GACnF,gBAAgB,GAAG,eAAe,GAAG,QAAQ,GAAG,cAAc,CAAC;AAErE,MAAM,WAAW,eAAe;IAC5B,IAAI,EAAE,UAAU,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAClB;AAmRD,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,eAAe,EAAE,CA0D/D"}

package/dist/memory/auto-learner.js

@@ -262,7 +262,8 @@ function extractMemories(text) {
     const sentences = splitSentences(text);
     const results = [];
     const seen = new Set();
-    for (const sentence of sentences) {
+    for (let i = 0; i < sentences.length; i++) {
+        const sentence = sentences[i];
         // Collect ALL matching patterns for this sentence
         const candidates = [];
         for (const pattern of PATTERNS) {
@@ -295,14 +296,44 @@ function extractMemories(text) {
         if (seen.has(key))
             continue;
         seen.add(key);
+        // --- NEW: Extract real reasoning from context ---
+        const reason = extractReason(sentence, sentences, i) || best.reason;
         results.push({
             type: best.type,
             content,
             confidence: best.confidence,
-            reason: best.reason,
+            reason,
         });
     }
     // Return only high-confidence matches (avoid noise)
     return results.filter(r => r.confidence >= 0.55);
 }
+/**
+ * Extract the REAL reason from context — looks for "because", "since", "due to" etc.
+ * If the reason clause is in the same sentence, extract it.
+ * If it's in the next sentence, grab that as context.
+ */
+function extractReason(sentence, allSentences, index) {
+    // Check for inline reasoning: "X because Y", "X since Y", "X due to Y"
+    const reasonPatterns = [
+        /\b(?:because|since|as)\s+(.{10,120})/i,
+        /\b(?:due to|caused by|in order to|so that)\s+(.{10,100})/i,
+        /\b(?:the reason (?:is|was|being))\s+(.{10,100})/i,
+        /\b(?:this (?:is|was) (?:because|needed|required|necessary))\s+(.{10,100})/i,
+    ];
+    for (const pat of reasonPatterns) {
+        const match = sentence.match(pat);
+        if (match && match[1]) {
+            return match[1].replace(/\s+/g, ' ').trim().slice(0, 120);
+        }
+    }
+    // Check next sentence for reasoning context
+    if (index + 1 < allSentences.length) {
+        const next = allSentences[index + 1];
+        if (/^(because|since|this is because|the reason|due to|otherwise)/i.test(next.trim())) {
+            return next.trim().slice(0, 120);
+        }
+    }
+    return null;
+}
 //# sourceMappingURL=auto-learner.js.map

package/dist/memory/auto-learner.js.map

@@ -1 +1 @@
-{"version":3,"file":"auto-learner.js","sourceRoot":"","sources":["../../src/memory/auto-learner.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;AA6RH,0CAsDC;AAvUD,iFAAiF;AAEjF,MAAM,QAAQ,GAKT;IACG,wEAAwE;IACxE;QACI,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE;YACL,4EAA4E;YAC5E,gGAAgG;YAChG,yCAAyC;YACzC,6EAA6E;YAC7E,uEAAuE;YACvE,kEAAkE;SACrE;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,kCAAkC;KAC7C;IAED,4DAA4D;IAC5D;QACI,IAAI,EAAE,UAAU;QAChB,OAAO,EAAE;YACL,gIAAgI;YAChI,yFAAyF;YACzF,wEAAwE;YACxE,6DAA6D;YAC7D,+DAA+D;YAC/D,sEAAsE;YACtE,iEAAiE;SACpE;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,gCAAgC;KAC3C;IAED,4DAA4D;IAC5D;QACI,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE;YACL,yEAAyE;YACzE,4EAA4E;YAC5E,8EAA8E;SACjF;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,6CAA6C;KACxD;IAED,0CAA0C;IAC1C;QACI,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE;YACL,4FAA4F;YAC5F,8EAA8E;YAC9E,4EAA4E;SAC/E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,kCAAkC;KAC7C;IAED,qEAAqE;IACrE;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,iFAAiF;YACjF,2DAA2D;YAC3D,oFAAoF;YACpF,iEAAiE;YACjE,wDAAwD;YACxD,wDAAwD;SAC3D;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,+BAA+B;KAC1C;IAED,sDAAsD;IACtD;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,6DAA6D;YAC7D,wEAAwE;YACxE,8DAA8D;YAC9D,2EAA2E;SAC9E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,0CAA0C;KACrD;IAED,uCAAuC;IACvC;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,6FAA6F;YAC7F,iEAAiE;SACpE;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,+BAA+B;KAC1C;IAED,qEAAqE;IAErE,8EAA8E;IAC9E;QACI,IAAI,EAAE,gBAAgB;QACtB,OAAO,EAAE;YACL,4EAA4E;YAC5E,sEAAsE;YACtE,mEAAmE;YACnE,2EAA2E;SAC9E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,6DAA6D;KACxE;IAED,4EAA4E;IAC5E;QACI,IAAI,EAAE,eAAe;QACrB,OAAO,EAAE;YACL,0IAA0I;YAC1I,iGAAiG;YACjG,+DAA+D;YAC/D,iEAAiE;YACjE,yDAAyD;SAC5D;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,4CAA4C;KACvD;IAED,qEAAqE;IACrE;QACI,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE;YACL,+EAA+E;YAC/E,mBAAmB,EAAG,mCAAmC;YACzD,0DAA0D;YAC1D,0EAA0E;YAC1E,uDAAuD;SAC1D;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,8DAA8D;KACzE;IAED,4EAA4E;IAC5E;QACI,IAAI,EAAE,cAAc;QACpB,OAAO,EAAE;YACL,6DAA6D;YAC7D,8FAA8F;YAC9F,sDAAsD;YACtD,uEAAuE;SAC1E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,uCAAuC;KAClD;IAED,iFAAiF;IACjF;QACI,IAAI,EAAE,UAAU;QAChB,OAAO,EAAE;YACL,4DAA4D;YAC5D,sEAAsE;YACtE,qEAAqE;YACrE,qDAAqD;YACrD,uEAAuE;SAC1E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,iCAAiC;KAC5C;IAED,yEAAyE;IACzE;QACI,IAAI,EAAE,UAAU;QAChB,OAAO,EAAE;YACL,iGAAiG;YACjG,oEAAoE;YACpE,4FAA4F;YAC5F,0EAA0E;SAC7E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,uCAAuC;KAClD;IAED,2EAA2E;IAC3E;QACI,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE;YACL,6DAA6D;YAC7D,uDAAuD;YACvD,oEAAoE;YACpE,0CAA0C;YAC1C,wDAAwD;SAC3D;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,+BAA+B;KAC1C;IAED,wEAAwE;IACxE;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,yDAAyD;YACzD,+CAA+C;YAC/C,8EAA8E;YAC9E,mDAAmD;YACnD,mFAAmF;SACtF;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,4CAA4C;KACvD;IAED,6EAA6E;IAC7E;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,gFAAgF;YAChF,oEAAoE;YACpE,+DAA+D;YAC/D,wFAAwF;YACxF,6FAA6F;SAChG;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,sCAAsC;KACjD;IAED,oFAAoF;IACpF;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,0EAA0E;YAC1E,6DAA6D;YAC7D,qCAAqC;YACrC,mEAAmE;YACnE,iCAAiC;YACjC,wEAAwE;YACxE,8EAA8E;SACjF;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,qFAAqF;KAChG;CACJ,CAAC;AAEN,iFAAiF;AAEjF,SAAS,cAAc,CAAC,IAAY;IAChC,uEAAuE;IACvE,6EAA6E;IAC7E,0EAA0E;IAC1E,iDAAiD;IACjD,OAAO,IAAI;SACN,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAS,4CAA4C;SACnF,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAiB,oBAAoB;SAC5D,KAAK,CAAC,KAAK,CAAC,CAA8B,0BAA0B;SACpE,OAAO,CAAC,IAAI,CAAC,EAAE;QACZ,0DAA0D;QAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACpF,8CAA8C;QAC9C,OAAO,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAC1C,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE,IAAI,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;AACtD,CAAC;AAED,iFAAiF;AAEjF,SAAS,SAAS,CAAC,IAAY;IAC3B,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACtF,CAAC;AAED,iFAAiF;AAEjF,SAAgB,eAAe,CAAC,IAAY;IACxC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IAEzC,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IACvC,MAAM,OAAO,GAAsB,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QAC/B,kDAAkD;QAClD,MAAM,UAAU,GAAuC,EAAE,CAAC;QAE1D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;gBACnC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,oBAAoB;gBAC1C,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACxB,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACV,CAAC;YACL,CAAC;YACD,IAAI,OAAO,EAAE,CAAC;gBACV,UAAU,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;YACjC,CAAC;QACL,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEtC,yDAAyD;QACzD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvE,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QAEnC,oCAAoC;QACpC,MAAM,OAAO,GAAG,QAAQ;aACnB,OAAO,CAAC,kEAAkE,EAAE,EAAE,CAAC;aAC/E,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;aACpB,IAAI,EAAE,CAAC;QAEZ,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE;YAAE,SAAS;QAElC,8BAA8B;QAC9B,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QAC9D,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEd,OAAO,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,OAAO;YACP,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,MAAM,EAAE,IAAI,CAAC,MAAM;SACtB,CAAC,CAAC;IACP,CAAC;IAED,oDAAoD;IACpD,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC;AACrD,CAAC"}
+{"version":3,"file":"auto-learner.js","sourceRoot":"","sources":["../../src/memory/auto-learner.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;AA6RH,0CA0DC;AA3UD,iFAAiF;AAEjF,MAAM,QAAQ,GAKT;IACG,wEAAwE;IACxE;QACI,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE;YACL,4EAA4E;YAC5E,gGAAgG;YAChG,yCAAyC;YACzC,6EAA6E;YAC7E,uEAAuE;YACvE,kEAAkE;SACrE;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,kCAAkC;KAC7C;IAED,4DAA4D;IAC5D;QACI,IAAI,EAAE,UAAU;QAChB,OAAO,EAAE;YACL,gIAAgI;YAChI,yFAAyF;YACzF,wEAAwE;YACxE,6DAA6D;YAC7D,+DAA+D;YAC/D,sEAAsE;YACtE,iEAAiE;SACpE;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,gCAAgC;KAC3C;IAED,4DAA4D;IAC5D;QACI,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE;YACL,yEAAyE;YACzE,4EAA4E;YAC5E,8EAA8E;SACjF;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,6CAA6C;KACxD;IAED,0CAA0C;IAC1C;QACI,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE;YACL,4FAA4F;YAC5F,8EAA8E;YAC9E,4EAA4E;SAC/E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,kCAAkC;KAC7C;IAED,qEAAqE;IACrE;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,iFAAiF;YACjF,2DAA2D;YAC3D,oFAAoF;YACpF,iEAAiE;YACjE,wDAAwD;YACxD,wDAAwD;SAC3D;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,+BAA+B;KAC1C;IAED,sDAAsD;IACtD;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,6DAA6D;YAC7D,wEAAwE;YACxE,8DAA8D;YAC9D,2EAA2E;SAC9E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,0CAA0C;KACrD;IAED,uCAAuC;IACvC;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,6FAA6F;YAC7F,iEAAiE;SACpE;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,+BAA+B;KAC1C;IAED,qEAAqE;IAErE,8EAA8E;IAC9E;QACI,IAAI,EAAE,gBAAgB;QACtB,OAAO,EAAE;YACL,4EAA4E;YAC5E,sEAAsE;YACtE,mEAAmE;YACnE,2EAA2E;SAC9E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,6DAA6D;KACxE;IAED,4EAA4E;IAC5E;QACI,IAAI,EAAE,eAAe;QACrB,OAAO,EAAE;YACL,0IAA0I;YAC1I,iGAAiG;YACjG,+DAA+D;YAC/D,iEAAiE;YACjE,yDAAyD;SAC5D;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,4CAA4C;KACvD;IAED,qEAAqE;IACrE;QACI,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE;YACL,+EAA+E;YAC/E,mBAAmB,EAAG,mCAAmC;YACzD,0DAA0D;YAC1D,0EAA0E;YAC1E,uDAAuD;SAC1D;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,8DAA8D;KACzE;IAED,4EAA4E;IAC5E;QACI,IAAI,EAAE,cAAc;QACpB,OAAO,EAAE;YACL,6DAA6D;YAC7D,8FAA8F;YAC9F,sDAAsD;YACtD,uEAAuE;SAC1E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,uCAAuC;KAClD;IAED,iFAAiF;IACjF;QACI,IAAI,EAAE,UAAU;QAChB,OAAO,EAAE;YACL,4DAA4D;YAC5D,sEAAsE;YACtE,qEAAqE;YACrE,qDAAqD;YACrD,uEAAuE;SAC1E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,iCAAiC;KAC5C;IAED,yEAAyE;IACzE;QACI,IAAI,EAAE,UAAU;QAChB,OAAO,EAAE;YACL,iGAAiG;YACjG,oEAAoE;YACpE,4FAA4F;YAC5F,0EAA0E;SAC7E;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,uCAAuC;KAClD;IAED,2EAA2E;IAC3E;QACI,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE;YACL,6DAA6D;YAC7D,uDAAuD;YACvD,oEAAoE;YACpE,0CAA0C;YAC1C,wDAAwD;SAC3D;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,+BAA+B;KAC1C;IAED,wEAAwE;IACxE;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,yDAAyD;YACzD,+CAA+C;YAC/C,8EAA8E;YAC9E,mDAAmD;YACnD,mFAAmF;SACtF;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,4CAA4C;KACvD;IAED,6EAA6E;IAC7E;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,gFAAgF;YAChF,oEAAoE;YACpE,+DAA+D;YAC/D,wFAAwF;YACxF,6FAA6F;SAChG;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,sCAAsC;KACjD;IAED,oFAAoF;IACpF;QACI,IAAI,EAAE,SAAS;QACf,OAAO,EAAE;YACL,0EAA0E;YAC1E,6DAA6D;YAC7D,qCAAqC;YACrC,mEAAmE;YACnE,iCAAiC;YACjC,wEAAwE;YACxE,8EAA8E;SACjF;QACD,UAAU,EAAE,IAAI;QAChB,MAAM,EAAE,qFAAqF;KAChG;CACJ,CAAC;AAEN,iFAAiF;AAEjF,SAAS,cAAc,CAAC,IAAY;IAChC,uEAAuE;IACvE,6EAA6E;IAC7E,0EAA0E;IAC1E,iDAAiD;IACjD,OAAO,IAAI;SACN,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAS,4CAA4C;SACnF,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAiB,oBAAoB;SAC5D,KAAK,CAAC,KAAK,CAAC,CAA8B,0BAA0B;SACpE,OAAO,CAAC,IAAI,CAAC,EAAE;QACZ,0DAA0D;QAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACpF,8CAA8C;QAC9C,OAAO,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAC1C,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE,IAAI,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;AACtD,CAAC;AAED,iFAAiF;AAEjF,SAAS,SAAS,CAAC,IAAY;IAC3B,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACtF,CAAC;AAED,iFAAiF;AAEjF,SAAgB,eAAe,CAAC,IAAY;IACxC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IAEzC,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IACvC,MAAM,OAAO,GAAsB,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,kDAAkD;QAClD,MAAM,UAAU,GAAuC,EAAE,CAAC;QAE1D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;gBACnC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,oBAAoB;gBAC1C,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACxB,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACV,CAAC;YACL,CAAC;YACD,IAAI,OAAO,EAAE,CAAC;gBACV,UAAU,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;YACjC,CAAC;QACL,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEtC,yDAAyD;QACzD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvE,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QAEnC,oCAAoC;QACpC,MAAM,OAAO,GAAG,QAAQ;aACnB,OAAO,CAAC,kEAAkE,EAAE,EAAE,CAAC;aAC/E,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;aACpB,IAAI,EAAE,CAAC;QAEZ,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE;YAAE,SAAS;QAElC,8BAA8B;QAC9B,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QAC9D,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEd,mDAAmD;QACnD,MAAM,MAAM,GAAG,aAAa,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC;QAEpE,OAAO,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,OAAO;YACP,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,MAAM;SACT,CAAC,CAAC;IACP,CAAC;IAED,oDAAoD;IACpD,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC;AACrD,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,QAAgB,EAAE,YAAsB,EAAE,KAAa;IAC1E,uEAAuE;IACvE,MAAM,cAAc,GAAG;QACnB,uCAAuC;QACvC,2DAA2D;QAC3D,kDAAkD;QAClD,4EAA4E;KAC/E,CAAC;IAEF,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACpB,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC9D,CAAC;IACL,CAAC;IAED,4CAA4C;IAC5C,IAAI,KAAK,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,+DAA+D,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YACpF,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACrC,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,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"}