@project-ava-supernova/core 0.2.71

package/dist/memory/self-improvement.js

@@ -0,0 +1,178 @@
+/**
+ * Self-Improvement Memory — Ava learns from her own experiences.
+ *
+ * Two pools:
+ * 1. Local — personal learnings per user (~/.ava/self-improvement.json)
+ * 2. Global — shared across all users (Supabase, sanitised)
+ *
+ * NEVER stores user code, messages, or personal data.
+ */
+import { existsSync, readFileSync } from 'node:fs';
+import { writeFile, mkdir } from 'node:fs/promises';
+import { join, dirname } from 'node:path';
+import { randomUUID } from 'node:crypto';
+import { withLock } from '../core/file-lock.js';
+// ─── Constants ───────────────────────────────────────────────────────────────
+const STORE_FILE = 'self-improvement.json';
+const MAX_PROMPT_CHARS = 500;
+// ─── Store I/O ───────────────────────────────────────────────────────────────
+function getStorePath(avaHome) {
+    return join(avaHome, STORE_FILE);
+}
+export function loadStore(avaHome) {
+    const path = getStorePath(avaHome);
+    if (!existsSync(path)) {
+        return { version: 1, local: [], lastGlobalSync: null };
+    }
+    try {
+        const raw = readFileSync(path, 'utf-8');
+        const parsed = JSON.parse(raw);
+        if (typeof parsed === 'object' && Array.isArray(parsed.local)) {
+            return parsed;
+        }
+    }
+    catch {
+        // Corrupted — start fresh
+    }
+    return { version: 1, local: [], lastGlobalSync: null };
+}
+export async function saveStore(avaHome, store) {
+    const storePath = getStorePath(avaHome);
+    const dir = dirname(storePath);
+    if (!existsSync(dir)) {
+        await mkdir(dir, { recursive: true });
+    }
+    await withLock(storePath, async () => {
+        await writeFile(storePath, JSON.stringify(store, null, 2), 'utf-8');
+    });
+}
+// ─── Similarity ──────────────────────────────────────────────────────────────
+/** Simple text similarity using word overlap (Jaccard-like). */
+function textSimilarity(a, b) {
+    const wordsA = new Set(a.toLowerCase().split(/\s+/).filter(w => w.length > 2));
+    const wordsB = new Set(b.toLowerCase().split(/\s+/).filter(w => w.length > 2));
+    if (wordsA.size === 0 || wordsB.size === 0)
+        return 0;
+    let intersection = 0;
+    for (const w of wordsA) {
+        if (wordsB.has(w))
+            intersection++;
+    }
+    return intersection / Math.max(wordsA.size, wordsB.size);
+}
+// ─── Core Functions ──────────────────────────────────────────────────────────
+/**
+ * Add a learning to the local store. Deduplicates against existing entries
+ * by similarity — if a similar learning exists, updates it instead.
+ */
+export async function addLearning(avaHome, learning, sessionId) {
+    const store = loadStore(avaHome);
+    const now = new Date().toISOString();
+    // Check for similar existing learning (same type + category + high text similarity)
+    for (const existing of store.local) {
+        if (existing.type === learning.type &&
+            existing.category === learning.category &&
+            textSimilarity(existing.learned, learning.learned) > 0.6) {
+            // Only count as independent confirmation if from a different session
+            const isNewSession = !sessionId || !existing.lastConfirmedSession || existing.lastConfirmedSession !== sessionId;
+            if (isNewSession) {
+                existing.confirmations += 1;
+                existing.lastConfirmedSession = sessionId;
+            }
+            existing.confidence = Math.min(1, existing.confidence + (isNewSession ? 0.1 : 0.02));
+            existing.updatedAt = now;
+            // Merge context if different
+            if (learning.context && !existing.context.includes(learning.context)) {
+                existing.context = `${existing.context}; ${learning.context}`.slice(0, 200);
+            }
+            await saveStore(avaHome, store);
+            return existing;
+        }
+    }
+    // New learning
+    const entry = {
+        id: randomUUID(),
+        ...learning,
+        confirmations: 1,
+        createdAt: now,
+        updatedAt: now,
+    };
+    store.local.push(entry);
+    // Cap at 200 learnings — prune lowest confidence + oldest
+    if (store.local.length > 200) {
+        store.local.sort((a, b) => {
+            const scoreA = a.confidence * 0.6 + (a.confirmations / 10) * 0.4;
+            const scoreB = b.confidence * 0.6 + (b.confirmations / 10) * 0.4;
+            return scoreB - scoreA;
+        });
+        store.local = store.local.slice(0, 200);
+    }
+    saveStore(avaHome, store);
+    return entry;
+}
+/**
+ * Search for relevant learnings by category/context keywords.
+ * Returns the most relevant learnings sorted by relevance score.
+ */
+export function getRelevantLearnings(avaHome, context, limit = 10) {
+    const store = loadStore(avaHome);
+    if (store.local.length === 0)
+        return [];
+    const keywords = context.toLowerCase().split(/\s+/).filter(w => w.length > 2);
+    if (keywords.length === 0) {
+        // No keywords — return highest confidence learnings
+        return store.local
+            .filter(l => l.confidence >= 0.3)
+            .sort((a, b) => b.confidence - a.confidence)
+            .slice(0, limit);
+    }
+    // Score each learning by keyword match + confidence + confirmations
+    const scored = store.local.map(learning => {
+        const searchText = `${learning.category} ${learning.context} ${learning.learned} ${learning.type}`.toLowerCase();
+        let keywordScore = 0;
+        for (const kw of keywords) {
+            if (searchText.includes(kw))
+                keywordScore++;
+        }
+        const relevance = (keywordScore / keywords.length) * 0.5 +
+            learning.confidence * 0.3 +
+            Math.min(learning.confirmations / 10, 1) * 0.2;
+        return { learning, relevance };
+    });
+    return scored
+        .filter(s => s.relevance > 0.1)
+        .sort((a, b) => b.relevance - a.relevance)
+        .slice(0, limit)
+        .map(s => s.learning);
+}
+/**
+ * Build a concise prompt section with relevant learnings for injection
+ * into the system prompt. Max ~500 chars.
+ */
+export function buildSelfImprovementPrompt(avaHome, currentContext) {
+    const learnings = getRelevantLearnings(avaHome, currentContext || '', 8);
+    if (learnings.length === 0)
+        return '';
+    // Filter to high-enough confidence
+    const usable = learnings.filter(l => l.confidence >= 0.3 || l.confirmations >= 2);
+    if (usable.length === 0)
+        return '';
+    const lines = [];
+    let totalChars = 0;
+    for (const l of usable) {
+        const confirmed = l.confirmations > 1 ? ` (confirmed ${l.confirmations}x)` : '';
+        const sourceLabel = l.source === 'retry-success' ? ' [retry fix]'
+            : l.source === 'error-recovery' ? ' [error fix]'
+                : l.source === 'feedback-negative' ? ' [user feedback]'
+                    : '';
+        const line = `- ${l.learned}${confirmed}${sourceLabel}`;
+        if (totalChars + line.length > MAX_PROMPT_CHARS)
+            break;
+        lines.push(line);
+        totalChars += line.length;
+    }
+    if (lines.length === 0)
+        return '';
+    return `## What I've Learned\n${lines.join('\n')}`;
+}
+//# sourceMappingURL=self-improvement.js.map

package/dist/memory/self-improvement.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"self-improvement.js","sourceRoot":"","sources":["../../src/memory/self-improvement.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACnD,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAwBhD,gFAAgF;AAEhF,MAAM,UAAU,GAAG,uBAAuB,CAAC;AAC3C,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAE7B,gFAAgF;AAEhF,SAAS,YAAY,CAAC,OAAe;IACnC,OAAO,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AACnC,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,OAAe;IACvC,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACnC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC;IACzD,CAAC;IACD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9D,OAAO,MAA8B,CAAC;QACxC,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,0BAA0B;IAC5B,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC;AACzD,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,OAAe,EAAE,KAA2B;IAC1E,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IAC/B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACxC,CAAC;IACD,MAAM,QAAQ,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE;QACnC,MAAM,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;AACL,CAAC;AAED,gFAAgF;AAEhF,gEAAgE;AAChE,SAAS,cAAc,CAAC,CAAS,EAAE,CAAS;IAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/E,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACrD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,EAAE,CAAC;IACpC,CAAC;IACD,OAAO,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;AAC3D,CAAC;AAED,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,OAAe,EACf,QAAmF,EACnF,SAAkB;IAElB,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAErC,oFAAoF;IACpF,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACnC,IACE,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI;YAC/B,QAAQ,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ;YACvC,cAAc,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,GAAG,GAAG,EACxD,CAAC;YACD,qEAAqE;YACrE,MAAM,YAAY,GAAG,CAAC,SAAS,IAAI,CAAC,QAAQ,CAAC,oBAAoB,IAAI,QAAQ,CAAC,oBAAoB,KAAK,SAAS,CAAC;YACjH,IAAI,YAAY,EAAE,CAAC;gBACjB,QAAQ,CAAC,aAAa,IAAI,CAAC,CAAC;gBAC5B,QAAQ,CAAC,oBAAoB,GAAG,SAAS,CAAC;YAC5C,CAAC;YACD,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,UAAU,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACrF,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC;YACzB,6BAA6B;YAC7B,IAAI,QAAQ,CAAC,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBACrE,QAAQ,CAAC,OAAO,GAAG,GAAG,QAAQ,CAAC,OAAO,KAAK,QAAQ,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC9E,CAAC;YACD,MAAM,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAChC,OAAO,QAAQ,CAAC;QAClB,CAAC;IACH,CAAC;IAED,eAAe;IACf,MAAM,KAAK,GAAoB;QAC7B,EAAE,EAAE,UAAU,EAAE;QAChB,GAAG,QAAQ;QACX,aAAa,EAAE,CAAC;QAChB,SAAS,EAAE,GAAG;QACd,SAAS,EAAE,GAAG;KACf,CAAC;IAEF,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAExB,0DAA0D;IAC1D,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QAC7B,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACxB,MAAM,MAAM,GAAG,CAAC,CAAC,UAAU,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,aAAa,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC;YACjE,MAAM,MAAM,GAAG,CAAC,CAAC,UAAU,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,aAAa,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC;YACjE,OAAO,MAAM,GAAG,MAAM,CAAC;QACzB,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC1C,CAAC;IAED,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAC1B,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAAe,EACf,OAAe,EACf,KAAK,GAAG,EAAE;IAEV,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IACjC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAExC,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9E,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,oDAAoD;QACpD,OAAO,KAAK,CAAC,KAAK;aACf,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,GAAG,CAAC;aAChC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;aAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrB,CAAC;IAED,oEAAoE;IACpE,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;QACxC,MAAM,UAAU,GAAG,GAAG,QAAQ,CAAC,QAAQ,IAAI,QAAQ,CAAC,OAAO,IAAI,QAAQ,CAAC,OAAO,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACjH,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAAE,YAAY,EAAE,CAAC;QAC9C,CAAC;QACD,MAAM,SAAS,GAAG,CAAC,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,GAAG;YACtD,QAAQ,CAAC,UAAU,GAAG,GAAG;YACzB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC;QACjD,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM;SACV,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC;SAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;SACzC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;SACf,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,0BAA0B,CACxC,OAAe,EACf,cAAuB;IAEvB,MAAM,SAAS,GAAG,oBAAoB,CAAC,OAAO,EAAE,cAAc,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;IACzE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEtC,mCAAmC;IACnC,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,GAAG,IAAI,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC;IAClF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QAChF,MAAM,WAAW,GAAG,CAAC,CAAC,MAAM,KAAK,eAAe,CAAC,CAAC,CAAC,cAAc;YAC/D,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,gBAAgB,CAAC,CAAC,CAAC,cAAc;gBAChD,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,mBAAmB,CAAC,CAAC,CAAC,kBAAkB;oBACvD,CAAC,CAAC,EAAE,CAAC;QACP,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,OAAO,GAAG,SAAS,GAAG,WAAW,EAAE,CAAC;QAExD,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,GAAG,gBAAgB;YAAE,MAAM;QACvD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,OAAO,yBAAyB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AACrD,CAAC"}

package/dist/memory/tfidf.d.ts

@@ -0,0 +1,71 @@
+/**
+ * TF-IDF (Term Frequency - Inverse Document Frequency) engine for memory retrieval.
+ *
+ * Provides much better search quality than substring matching, with zero external
+ * dependencies. Pure math — works everywhere (Node.js, bundled extension, CLI).
+ *
+ * Architecture is open for future neural embedding augmentation.
+ */
+/** Tokenize text into normalized terms. */
+export declare function tokenize(text: string): string[];
+/** A sparse term-frequency vector. Keys are terms, values are TF weights. */
+export type TermVector = Map<string, number>;
+/** Build a TF vector from tokenized terms (log-normalized TF). */
+export declare function buildTermVector(terms: string[]): TermVector;
+/** Cosine similarity between two sparse vectors. Returns 0–1. */
+export declare function cosineSimilarity(a: TermVector, b: TermVector): number;
+/**
+ * Cosine similarity between two DENSE vectors (e.g. neural embeddings).
+ * Returns ~-1..1 (0 if empty, length-mismatched, or zero-magnitude).
+ */
+export declare function cosineDense(a: number[], b: number[]): number;
+/**
+ * A lightweight TF-IDF index over a set of documents.
+ *
+ * Documents are identified by string IDs. The index is rebuilt in-memory
+ * on load — no serialization needed since the memory store is small.
+ */
+export declare class TfIdfIndex {
+    /** Document term vectors (TF component). */
+    private docVectors;
+    /** IDF weights per term across all documents. */
+    private idfWeights;
+    /** Total document count. */
+    private docCount;
+    /** Which documents contain each term (for IDF). */
+    private documentFrequency;
+    /** Clear the entire index. */
+    clear(): void;
+    /** Add or update a document in the index. */
+    addDocument(id: string, text: string): void;
+    /** Remove a document from the index. */
+    removeDocument(id: string): void;
+    /**
+     * Search the index with a query string. Returns document IDs ranked by
+     * TF-IDF cosine similarity, descending.
+     */
+    search(query: string, limit?: number): Array<{
+        id: string;
+        score: number;
+    }>;
+    /**
+     * Find documents similar to a given document (by ID).
+     * Useful for conflict/duplicate detection.
+     */
+    findSimilar(id: string, threshold?: number): Array<{
+        id: string;
+        score: number;
+    }>;
+    /**
+     * Compute similarity between a raw text and an existing document.
+     * Used for conflict detection before the new doc is indexed.
+     */
+    similarityToText(existingId: string, newText: string): number;
+    /** Number of indexed documents. */
+    get size(): number;
+    /** Recompute IDF weights from current document frequencies. */
+    private recomputeIdf;
+    /** Apply IDF weights to a TF vector, producing a TF-IDF vector. */
+    private applyIdf;
+}
+//# sourceMappingURL=tfidf.d.ts.map

package/dist/memory/tfidf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf.d.ts","sourceRoot":"","sources":["../../src/memory/tfidf.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAmBH,2CAA2C;AAC3C,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAM/C;AAED,6EAA6E;AAC7E,MAAM,MAAM,UAAU,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAE7C,kEAAkE;AAClE,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,UAAU,CAW3D;AAED,iEAAiE;AACjE,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,GAAG,MAAM,CAkBrE;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAU5D;AAED;;;;;GAKG;AACH,qBAAa,UAAU;IACrB,4CAA4C;IAC5C,OAAO,CAAC,UAAU,CAAiC;IACnD,iDAAiD;IACjD,OAAO,CAAC,UAAU,CAA6B;IAC/C,4BAA4B;IAC5B,OAAO,CAAC,QAAQ,CAAK;IACrB,mDAAmD;IACnD,OAAO,CAAC,iBAAiB,CAA6B;IAEtD,8BAA8B;IAC9B,KAAK,IAAI,IAAI;IAOb,6CAA6C;IAC7C,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAmB3C,wCAAwC;IACxC,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAqBhC;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAmBvE;;;OAGG;IACH,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,SAAM,GAAG,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAoB9E;;;OAGG;IACH,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM;IAY7D,mCAAmC;IACnC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAID,+DAA+D;IAC/D,OAAO,CAAC,YAAY;IAUpB,mEAAmE;IACnE,OAAO,CAAC,QAAQ;CAQjB"}

package/dist/memory/tfidf.js

@@ -0,0 +1,223 @@
+/**
+ * TF-IDF (Term Frequency - Inverse Document Frequency) engine for memory retrieval.
+ *
+ * Provides much better search quality than substring matching, with zero external
+ * dependencies. Pure math — works everywhere (Node.js, bundled extension, CLI).
+ *
+ * Architecture is open for future neural embedding augmentation.
+ */
+/** Stopwords to exclude from indexing (common English words that add noise). */
+const STOPWORDS = new Set([
+    'the', 'a', 'an', 'is', 'are', 'was', 'were', 'be', 'been', 'being',
+    'have', 'has', 'had', 'do', 'does', 'did', 'will', 'would', 'could',
+    'should', 'may', 'might', 'shall', 'can', 'need', 'dare', 'ought',
+    'used', 'to', 'of', 'in', 'for', 'on', 'with', 'at', 'by', 'from',
+    'as', 'into', 'through', 'during', 'before', 'after', 'above', 'below',
+    'between', 'out', 'off', 'over', 'under', 'again', 'further', 'then',
+    'once', 'here', 'there', 'when', 'where', 'why', 'how', 'all', 'both',
+    'each', 'few', 'more', 'most', 'other', 'some', 'such', 'no', 'nor',
+    'not', 'only', 'own', 'same', 'so', 'than', 'too', 'very', 'just',
+    'because', 'but', 'and', 'or', 'if', 'while', 'that', 'this', 'what',
+    'which', 'who', 'whom', 'these', 'those', 'it', 'its', 'i', 'me',
+    'my', 'we', 'our', 'you', 'your', 'he', 'him', 'his', 'she', 'her',
+    'they', 'them', 'their', 'about', 'up', 'also', 'like', 'use', 'make',
+]);
+/** Tokenize text into normalized terms. */
+export function tokenize(text) {
+    return text
+        .toLowerCase()
+        .replace(/[^a-z0-9\-_./]/g, ' ') // keep hyphens, underscores, dots, slashes (file paths, tool names)
+        .split(/\s+/)
+        .filter(w => w.length > 1 && !STOPWORDS.has(w));
+}
+/** Build a TF vector from tokenized terms (log-normalized TF). */
+export function buildTermVector(terms) {
+    const freq = new Map();
+    for (const term of terms) {
+        freq.set(term, (freq.get(term) ?? 0) + 1);
+    }
+    // Log-normalized TF: 1 + log(count)
+    const vector = new Map();
+    for (const [term, count] of freq) {
+        vector.set(term, 1 + Math.log(count));
+    }
+    return vector;
+}
+/** Cosine similarity between two sparse vectors. Returns 0–1. */
+export function cosineSimilarity(a, b) {
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (const [term, weightA] of a) {
+        normA += weightA * weightA;
+        const weightB = b.get(term);
+        if (weightB !== undefined) {
+            dot += weightA * weightB;
+        }
+    }
+    for (const [, weightB] of b) {
+        normB += weightB * weightB;
+    }
+    if (normA === 0 || normB === 0)
+        return 0;
+    return dot / (Math.sqrt(normA) * Math.sqrt(normB));
+}
+/**
+ * Cosine similarity between two DENSE vectors (e.g. neural embeddings).
+ * Returns ~-1..1 (0 if empty, length-mismatched, or zero-magnitude).
+ */
+export function cosineDense(a, b) {
+    if (a.length === 0 || a.length !== b.length)
+        return 0;
+    let dot = 0, normA = 0, normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    if (normA === 0 || normB === 0)
+        return 0;
+    return dot / (Math.sqrt(normA) * Math.sqrt(normB));
+}
+/**
+ * A lightweight TF-IDF index over a set of documents.
+ *
+ * Documents are identified by string IDs. The index is rebuilt in-memory
+ * on load — no serialization needed since the memory store is small.
+ */
+export class TfIdfIndex {
+    /** Document term vectors (TF component). */
+    docVectors = new Map();
+    /** IDF weights per term across all documents. */
+    idfWeights = new Map();
+    /** Total document count. */
+    docCount = 0;
+    /** Which documents contain each term (for IDF). */
+    documentFrequency = new Map();
+    /** Clear the entire index. */
+    clear() {
+        this.docVectors.clear();
+        this.idfWeights.clear();
+        this.documentFrequency.clear();
+        this.docCount = 0;
+    }
+    /** Add or update a document in the index. */
+    addDocument(id, text) {
+        // Remove old document if updating
+        this.removeDocument(id);
+        const terms = tokenize(text);
+        const vector = buildTermVector(terms);
+        this.docVectors.set(id, vector);
+        this.docCount++;
+        // Update document frequency
+        const uniqueTerms = new Set(terms);
+        for (const term of uniqueTerms) {
+            this.documentFrequency.set(term, (this.documentFrequency.get(term) ?? 0) + 1);
+        }
+        // Recompute IDF (fast for typical memory sizes < 1000 entries)
+        this.recomputeIdf();
+    }
+    /** Remove a document from the index. */
+    removeDocument(id) {
+        const oldVector = this.docVectors.get(id);
+        if (!oldVector)
+            return;
+        // Decrement document frequency for old terms
+        for (const term of oldVector.keys()) {
+            const df = this.documentFrequency.get(term);
+            if (df !== undefined) {
+                if (df <= 1) {
+                    this.documentFrequency.delete(term);
+                }
+                else {
+                    this.documentFrequency.set(term, df - 1);
+                }
+            }
+        }
+        this.docVectors.delete(id);
+        this.docCount--;
+        this.recomputeIdf();
+    }
+    /**
+     * Search the index with a query string. Returns document IDs ranked by
+     * TF-IDF cosine similarity, descending.
+     */
+    search(query, limit = 10) {
+        const queryTerms = tokenize(query);
+        if (queryTerms.length === 0)
+            return [];
+        const queryVector = this.applyIdf(buildTermVector(queryTerms));
+        const results = [];
+        for (const [id, docTf] of this.docVectors) {
+            const docTfIdf = this.applyIdf(docTf);
+            const score = cosineSimilarity(queryVector, docTfIdf);
+            if (score > 0) {
+                results.push({ id, score });
+            }
+        }
+        results.sort((a, b) => b.score - a.score);
+        return results.slice(0, limit);
+    }
+    /**
+     * Find documents similar to a given document (by ID).
+     * Useful for conflict/duplicate detection.
+     */
+    findSimilar(id, threshold = 0.3) {
+        const docTf = this.docVectors.get(id);
+        if (!docTf)
+            return [];
+        const docTfIdf = this.applyIdf(docTf);
+        const results = [];
+        for (const [otherId, otherTf] of this.docVectors) {
+            if (otherId === id)
+                continue;
+            const otherTfIdf = this.applyIdf(otherTf);
+            const score = cosineSimilarity(docTfIdf, otherTfIdf);
+            if (score >= threshold) {
+                results.push({ id: otherId, score });
+            }
+        }
+        results.sort((a, b) => b.score - a.score);
+        return results;
+    }
+    /**
+     * Compute similarity between a raw text and an existing document.
+     * Used for conflict detection before the new doc is indexed.
+     */
+    similarityToText(existingId, newText) {
+        const existingTf = this.docVectors.get(existingId);
+        if (!existingTf)
+            return 0;
+        const newTerms = tokenize(newText);
+        if (newTerms.length === 0)
+            return 0;
+        const newVector = this.applyIdf(buildTermVector(newTerms));
+        const existingTfIdf = this.applyIdf(existingTf);
+        return cosineSimilarity(newVector, existingTfIdf);
+    }
+    /** Number of indexed documents. */
+    get size() {
+        return this.docCount;
+    }
+    // ── Private ──────────────────────────────────────────────────────────────
+    /** Recompute IDF weights from current document frequencies. */
+    recomputeIdf() {
+        this.idfWeights.clear();
+        if (this.docCount === 0)
+            return;
+        for (const [term, df] of this.documentFrequency) {
+            // Smooth IDF: log(1 + N/df) — avoids division by zero, reduces extreme weights
+            this.idfWeights.set(term, Math.log(1 + this.docCount / df));
+        }
+    }
+    /** Apply IDF weights to a TF vector, producing a TF-IDF vector. */
+    applyIdf(tf) {
+        const tfidf = new Map();
+        for (const [term, tfWeight] of tf) {
+            const idf = this.idfWeights.get(term) ?? Math.log(1 + this.docCount); // unseen term gets max IDF
+            tfidf.set(term, tfWeight * idf);
+        }
+        return tfidf;
+    }
+}
+//# sourceMappingURL=tfidf.js.map

package/dist/memory/tfidf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf.js","sourceRoot":"","sources":["../../src/memory/tfidf.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,gFAAgF;AAChF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;IACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IACjE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM;IACjE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO;IACtE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM;IACpE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;IACrE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK;IACnE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;IACjE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IACpE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI;IAChE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;IAClE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;CACtE,CAAC,CAAC;AAEH,2CAA2C;AAC3C,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC,CAAE,oEAAoE;SACrG,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAKD,kEAAkE;AAClE,MAAM,UAAU,eAAe,CAAC,KAAe;IAC7C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,oCAAoC;IACpC,MAAM,MAAM,GAAe,IAAI,GAAG,EAAE,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,gBAAgB,CAAC,CAAa,EAAE,CAAa;IAC3D,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,KAAK,IAAI,OAAO,GAAG,OAAO,CAAC;QAC3B,MAAM,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,GAAG,IAAI,OAAO,GAAG,OAAO,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5B,KAAK,IAAI,OAAO,GAAG,OAAO,CAAC;IAC7B,CAAC;IAED,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzC,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,CAAW,EAAE,CAAW;IAClD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzC,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,UAAU;IACrB,4CAA4C;IACpC,UAAU,GAAG,IAAI,GAAG,EAAsB,CAAC;IACnD,iDAAiD;IACzC,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,4BAA4B;IACpB,QAAQ,GAAG,CAAC,CAAC;IACrB,mDAAmD;IAC3C,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEtD,8BAA8B;IAC9B,KAAK;QACH,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpB,CAAC;IAED,6CAA6C;IAC7C,WAAW,CAAC,EAAU,EAAE,IAAY;QAClC,kCAAkC;QAClC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAExB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,QAAQ,EAAE,CAAC;QAEhB,4BAA4B;QAC5B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChF,CAAC;QAED,+DAA+D;QAC/D,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED,wCAAwC;IACxC,cAAc,CAAC,EAAU;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS;YAAE,OAAO;QAEvB,6CAA6C;QAC7C,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;YACpC,MAAM,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5C,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;oBACZ,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACtC,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAa,EAAE,KAAK,GAAG,EAAE;QAC9B,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEvC,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAyC,EAAE,CAAC;QAEzD,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,gBAAgB,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YACtD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,EAAU,EAAE,SAAS,GAAG,GAAG;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QAEtB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,OAAO,GAAyC,EAAE,CAAC;QAEzD,KAAK,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACjD,IAAI,OAAO,KAAK,EAAE;gBAAE,SAAS;YAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;YACrD,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,UAAkB,EAAE,OAAe;QAClD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACnD,IAAI,CAAC,UAAU;YAAE,OAAO,CAAC,CAAC;QAE1B,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEpC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3D,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAChD,OAAO,gBAAgB,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;IACpD,CAAC;IAED,mCAAmC;IACnC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,4EAA4E;IAE5E,+DAA+D;IACvD,YAAY;QAClB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC;YAAE,OAAO;QAEhC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAChD,+EAA+E;YAC/E,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,mEAAmE;IAC3D,QAAQ,CAAC,EAAc;QAC7B,MAAM,KAAK,GAAe,IAAI,GAAG,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,2BAA2B;YAClG,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,GAAG,GAAG,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/dist/memory/training-export.d.ts

@@ -0,0 +1,51 @@
+import type { MemoryGraph } from './graph-engine.js';
+/**
+ * Training Data Export — graph → JSONL with reasoning chains.
+ *
+ * Every node with its edges is a potential training example for Ava's
+ * future own-model. This module traverses the graph and produces
+ * structured training examples that include causal reasoning chains —
+ * far more valuable than flat fact pairs because they teach the model
+ * WHY, not just WHAT.
+ *
+ * Export formats:
+ *   - JSONL-SFT: supervised fine-tuning (prompt/response pairs)
+ *   - JSONL-DPO: direct preference optimisation (prompt/chosen/rejected)
+ *   - Reasoning chains: traverses because/approved-by/resolved-by edges
+ */
+import type { EdgeType } from './types.js';
+/** A single training example. */
+export interface TrainingExample {
+    /** The context/question. */
+    prompt: string;
+    /** The ideal response. */
+    response: string;
+    /** Reasoning chain (from edge traversal). */
+    reasoning?: string;
+    /** Which edge types contributed to this example. */
+    edgeTypes: EdgeType[];
+    /** Confidence of the source nodes. */
+    confidence: number;
+    /** Category for filtering. */
+    category: string;
+    /** Metadata for dataset management. */
+    metadata: {
+        nodeIds: string[];
+        project?: string;
+        generatedAt: string;
+    };
+}
+/**
+ * Export training examples from the graph by traversing decision chains.
+ */
+export declare function exportTrainingData(graph: MemoryGraph): TrainingExample[];
+/**
+ * Format training examples as JSONL for SFT (supervised fine-tuning).
+ */
+export declare function toJsonlSft(examples: TrainingExample[]): string;
+/**
+ * Format as JSONL with reasoning chains visible in the response.
+ * More suitable for training models that should show their work.
+ */
+export declare function toJsonlWithReasoning(examples: TrainingExample[]): string;
+//# sourceMappingURL=training-export.d.ts.map

package/dist/memory/training-export.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"training-export.d.ts","sourceRoot":"","sources":["../../src/memory/training-export.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD;;;;;;;;;;;;;GAaG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAE3C,iCAAiC;AACjC,MAAM,WAAW,eAAe;IAC9B,4BAA4B;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,0BAA0B;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,6CAA6C;IAC7C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,oDAAoD;IACpD,SAAS,EAAE,QAAQ,EAAE,CAAC;IACtB,sCAAsC;IACtC,UAAU,EAAE,MAAM,CAAC;IACnB,8BAA8B;IAC9B,QAAQ,EAAE,MAAM,CAAC;IACjB,uCAAuC;IACvC,QAAQ,EAAE;QACR,OAAO,EAAE,MAAM,EAAE,CAAC;QAClB,OAAO,CAAC,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC;CACH;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,WAAW,GAAG,eAAe,EAAE,CAqFxE;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,QAAQ,EAAE,eAAe,EAAE,GAAG,MAAM,CAiB9D;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,eAAe,EAAE,GAAG,MAAM,CAgBxE"}