mcp-rag-memory 2.3.0

package/dist/env.js

@@ -0,0 +1,48 @@
+/**
+ * Zero-dependency `.env` loader.
+ *
+ * Loads KEY=VALUE pairs from `RAG_ENV_FILE` (if set) or `<cwd>/.env` into
+ * process.env. Existing environment variables are never overridden, so host
+ * config (MCP clients, CI, shell) always wins. Runs synchronously at import —
+ * must be imported before any module that reads `process.env.*` at load time.
+ * Supports `#` comments, `export KEY=` prefixes, and single/double-quoted values.
+ */
+import * as fs from "fs";
+import * as path from "path";
+function loadDotenv(file) {
+    let raw;
+    try {
+        raw = fs.readFileSync(file, "utf8");
+    }
+    catch {
+        return;
+    }
+    for (const line of raw.split(/\r?\n/)) {
+        let t = line.trim();
+        if (!t || t.startsWith("#"))
+            continue;
+        if (t.startsWith("export "))
+            t = t.slice(7).trimStart();
+        const eq = t.indexOf("=");
+        if (eq <= 0)
+            continue;
+        const key = t.slice(0, eq).trim();
+        let value = t.slice(eq + 1).trim();
+        // Strip trailing inline comments for unquoted values (e.g. `KEY=val # note`).
+        if (!value.startsWith('"') && !value.startsWith("'")) {
+            const hash = value.indexOf(" #");
+            if (hash >= 0)
+                value = value.slice(0, hash).trimEnd();
+        }
+        if (value.length >= 2 && ((value.startsWith('"') && value.endsWith('"')) || (value.startsWith("'") && value.endsWith("'")))) {
+            value = value.slice(1, -1);
+        }
+        if (key && process.env[key] === undefined)
+            process.env[key] = value;
+    }
+}
+const envFile = process.env.RAG_ENV_FILE ?? path.join(process.cwd(), ".env");
+if (process.env.RAG_ENV_FILE || fs.existsSync(envFile)) {
+    loadDotenv(envFile);
+}
+//# sourceMappingURL=env.js.map

package/dist/index.js

@@ -0,0 +1,12 @@
+#!/usr/bin/env node
+/**
+ * MCP server entry point.
+ *
+ * Loads `.env` (from RAG_ENV_FILE or <cwd>/.env) before any module that reads
+ * `process.env.*` at import time, then boots the stdio MCP server. This keeps
+ * `npx mcp-rag-memory` configurable from a plain `.env` file in addition to
+ * environment variables set by the host MCP client.
+ */
+import "./env.js";
+await import("./mcp/rag-server.js");
+//# sourceMappingURL=index.js.map

package/dist/mcp/rag-server.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=rag-server.d.ts.map

package/dist/mcp/rag-server.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rag-server.d.ts","sourceRoot":"","sources":["../../src/mcp/rag-server.ts"],"names":[],"mappings":""}

package/dist/mcp/rag-server.js

@@ -0,0 +1,275 @@
+#!/usr/bin/env node
+import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
+import { z } from "zod";
+import * as path from "path";
+import { createRequire } from "node:module";
+import { STORAGE_DIR } from "../db/database.js";
+import { embeddingInfo } from "../rag/embeddings.js";
+import { ingestText, ingestFile, ingestDirectory, searchDocs, retrieve, listDocuments, deleteDocument, documentStats, } from "../rag/pipeline.js";
+import { ingestSession as syncSession, ingestLatest as syncLatest, } from "../session/transcript.js";
+import { remember, recall, listMemories, getMemory, updateMemory, forget, consolidate, memoryStats, contextPrompt, MEMORY_TYPES, } from "../memory/memory.js";
+const require = createRequire(import.meta.url);
+const serverVersion = require("../../package.json").version;
+const server = new McpServer({
+    name: "rag-memory-server",
+    version: serverVersion,
+});
+/* ------------------------------------------------------------------ */
+/* System                                                              */
+/* ------------------------------------------------------------------ */
+server.registerTool("system_stats", {
+    description: "Get overall system stats: DB location, documents, chunks, memories, tokens, embedding backend",
+    inputSchema: {},
+}, async () => {
+    const docs = documentStats();
+    const mem = memoryStats();
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({ dbDir: STORAGE_DIR, embedding: embeddingInfo(), documents: docs, memories: mem }, null, 2),
+            },
+        ],
+    };
+});
+/* ------------------------------------------------------------------ */
+/* RAG: ingest                                                         */
+/* ------------------------------------------------------------------ */
+server.registerTool("rag_ingest_text", {
+    description: "Store raw text as a knowledge document (chunked + embedded for later retrieval)",
+    inputSchema: {
+        content: z.string().min(1),
+        title: z.string().describe("Document title"),
+        contentType: z.string().optional().describe("e.g. markdown, typescript, text, json"),
+        metadata: z.record(z.string(), z.unknown()).optional(),
+    },
+}, async (args) => {
+    const res = await ingestText(args.content, args.title, {
+        contentType: args.contentType,
+        metadata: args.metadata,
+    });
+    return { content: [{ type: "text", text: JSON.stringify(res, null, 2) }] };
+});
+server.registerTool("rag_ingest_file", {
+    description: "Read a file and store it as a knowledge document",
+    inputSchema: {
+        path: z.string().describe("Absolute path to the file"),
+        metadata: z.record(z.string(), z.unknown()).optional(),
+    },
+}, async (args) => {
+    const res = await ingestFile(args.path, { metadata: args.metadata });
+    return { content: [{ type: "text", text: JSON.stringify(res, null, 2) }] };
+});
+server.registerTool("rag_ingest_dir", {
+    description: "Recursively ingest supported source files from a directory",
+    inputSchema: {
+        path: z.string().describe("Absolute path to the directory"),
+        recursive: z.boolean().optional().default(true),
+        extensions: z.array(z.string()).optional().describe("File extensions to include, e.g. ['.ts', '.md']"),
+    },
+}, async (args) => {
+    const res = await ingestDirectory(args.path, { recursive: args.recursive, extensions: args.extensions });
+    return { content: [{ type: "text", text: JSON.stringify(res, null, 2) }] };
+});
+/* ------------------------------------------------------------------ */
+/* RAG: search / retrieve                                              */
+/* ------------------------------------------------------------------ */
+server.registerTool("rag_search", {
+    description: "Hybrid semantic + keyword search over stored documents. Returns chunks ranked by relevance with scores.",
+    inputSchema: {
+        query: z.string().min(1),
+        top_k: z.number().int().min(1).max(50).optional().default(10),
+        min_score: z.number().min(0).max(1).optional().default(0.08),
+    },
+}, async (args) => {
+    const hits = await searchDocs(args.query, args.top_k ?? 10, args.min_score ?? 0.08);
+    return {
+        content: [{ type: "text", text: JSON.stringify(hits, null, 2) }],
+    };
+});
+server.registerTool("rag_retrieve", {
+    description: "Retrieve relevant context chunks as a ready-to-inject context block for the LLM. Prefer this over rag_search when the result will be used as context.",
+    inputSchema: {
+        query: z.string().min(1),
+        top_k: z.number().int().min(1).max(20).optional().default(6),
+        min_score: z.number().min(0).max(1).optional().default(0.08),
+    },
+}, async (args) => {
+    const res = await retrieve(args.query, args.top_k ?? 6, args.min_score ?? 0.08);
+    if (res.chunks.length === 0) {
+        return { content: [{ type: "text", text: "No relevant context found." }] };
+    }
+    const lines = res.chunks.map((c) => `--- [${c.docTitle}#${c.chunkIndex}] (score ${c.score.toFixed(3)}) ---\n${c.content}`);
+    return {
+        content: [
+            {
+                type: "text",
+                text: `[Context block: ${res.chunks.length} chunks, ~${res.totalTokens} tokens]\n\n${lines.join("\n\n")}`,
+            },
+        ],
+    };
+});
+/* ------------------------------------------------------------------ */
+/* RAG: document management                                            */
+/* ------------------------------------------------------------------ */
+server.registerTool("rag_list_documents", {
+    description: "List all stored knowledge documents",
+    inputSchema: {},
+}, async () => {
+    const docs = listDocuments();
+    return { content: [{ type: "text", text: JSON.stringify(docs, null, 2) }] };
+});
+server.registerTool("rag_document_stats", {
+    description: "Document storage statistics",
+    inputSchema: {},
+}, async () => {
+    return { content: [{ type: "text", text: JSON.stringify(documentStats(), null, 2) }] };
+});
+server.registerTool("rag_delete_document", {
+    description: "Delete a document and all its chunks by ID",
+    inputSchema: {
+        doc_id: z.string().min(1),
+    },
+}, async (args) => {
+    const res = deleteDocument(args.doc_id);
+    return { content: [{ type: "text", text: JSON.stringify(res) }] };
+});
+/* ------------------------------------------------------------------ */
+/* Context Management: memory                                          */
+/* ------------------------------------------------------------------ */
+server.registerTool("rag_sync_session", {
+    description: "Ingest an opencode session's user inputs (or the latest active session) into the RAG store as searchable documents. Use with the session id from opencode, or omit session_id and pass directory to auto-pick the most recent session in that workspace.",
+    inputSchema: {
+        session_id: z.string().optional().describe("opencode session id; omit to use the latest active session"),
+        directory: z.string().optional().describe("Workspace path used to pick the latest session when session_id is omitted"),
+        limit: z.number().int().min(1).optional().describe("Only ingest the first N user messages"),
+    },
+}, async (args) => {
+    const res = args.session_id
+        ? await syncSession(args.session_id, { limit: args.limit })
+        : await syncLatest({ limit: args.limit, directory: args.directory });
+    return { content: [{ type: "text", text: JSON.stringify(res, null, 2) }] };
+});
+server.registerTool("memory_remember", {
+    description: "Store a piece of long-term memory (fact, decision, preference, instruction, task, insight, conversation). Use this to persist things that should be remembered across sessions.",
+    inputSchema: {
+        content: z.string().min(1).describe("The memory content, written as a self-contained statement"),
+        type: z.enum(MEMORY_TYPES).optional().default("fact"),
+        importance: z.number().min(0).max(1).optional().default(0.5).describe("0..1, higher = keep longer"),
+        tags: z.array(z.string()).optional().describe("Tags for filtering"),
+    },
+}, async (args) => {
+    const rec = await remember({
+        content: args.content,
+        type: args.type,
+        importance: args.importance,
+        tags: args.tags,
+    });
+    return { content: [{ type: "text", text: JSON.stringify(rec, null, 2) }] };
+});
+server.registerTool("memory_recall", {
+    description: "Semantically search long-term memories relevant to a query. This is how you remember past context.",
+    inputSchema: {
+        query: z.string().min(1),
+        top_k: z.number().int().min(1).max(30).optional().default(8),
+        min_score: z.number().min(0).max(1).optional().default(0.1),
+    },
+}, async (args) => {
+    const hits = await recall(args.query, args.top_k ?? 8, args.min_score ?? 0.1);
+    return { content: [{ type: "text", text: JSON.stringify(hits, null, 2) }] };
+});
+server.registerTool("memory_list", {
+    description: "List memories, optionally filtered by type, tag, or minimum importance",
+    inputSchema: {
+        type: z.enum(MEMORY_TYPES).optional(),
+        tag: z.string().optional(),
+        min_importance: z.number().min(0).max(1).optional(),
+        limit: z.number().int().min(1).max(500).optional().default(100),
+    },
+}, async (args) => {
+    const recs = listMemories({
+        type: args.type,
+        tag: args.tag,
+        minImportance: args.min_importance,
+        limit: args.limit,
+    });
+    return { content: [{ type: "text", text: JSON.stringify(recs, null, 2) }] };
+});
+server.registerTool("memory_get", {
+    description: "Get a single memory by ID",
+    inputSchema: {
+        id: z.string().min(1),
+    },
+}, async (args) => {
+    const rec = getMemory(args.id);
+    if (!rec)
+        return { content: [{ type: "text", text: `No memory found with id ${args.id}` }] };
+    return { content: [{ type: "text", text: JSON.stringify(rec, null, 2) }] };
+});
+server.registerTool("memory_update", {
+    description: "Update content / type / importance / tags of an existing memory",
+    inputSchema: {
+        id: z.string().min(1),
+        content: z.string().optional(),
+        type: z.enum(MEMORY_TYPES).optional(),
+        importance: z.number().min(0).max(1).optional(),
+        tags: z.array(z.string()).optional(),
+    },
+}, async (args) => {
+    const rec = await updateMemory(args.id, {
+        content: args.content,
+        type: args.type,
+        importance: args.importance,
+        tags: args.tags,
+    });
+    if (!rec)
+        return { content: [{ type: "text", text: `No memory found with id ${args.id}` }] };
+    return { content: [{ type: "text", text: JSON.stringify(rec, null, 2) }] };
+});
+server.registerTool("memory_forget", {
+    description: "Delete a memory by ID",
+    inputSchema: {
+        id: z.string().min(1),
+    },
+}, async (args) => {
+    const res = forget(args.id);
+    return { content: [{ type: "text", text: JSON.stringify(res) }] };
+});
+server.registerTool("memory_consolidate", {
+    description: "Deduplicate near-identical memories, boost frequently-used ones, and optionally prune stale memories (enable with env RAG_PRUNE=1)",
+    inputSchema: {},
+}, async () => {
+    const res = await consolidate();
+    return { content: [{ type: "text", text: JSON.stringify(res, null, 2) }] };
+});
+server.registerTool("memory_stats", {
+    description: "Long-term memory statistics (count, tokens, importance, by type)",
+    inputSchema: {},
+}, async () => {
+    return { content: [{ type: "text", text: JSON.stringify(memoryStats(), null, 2) }] };
+});
+server.registerTool("memory_context", {
+    description: "Build a compact context block from the most relevant memories for a given topic. Best for injecting memory into prompts.",
+    inputSchema: {
+        topic: z.string().min(1),
+        top_k: z.number().int().min(1).max(20).optional().default(6),
+    },
+}, async (args) => {
+    const { context, sources } = await contextPrompt(args.topic, args.top_k ?? 6);
+    if (!context)
+        return { content: [{ type: "text", text: "No relevant memories found." }] };
+    return {
+        content: [
+            {
+                type: "text",
+                text: `[Memory context: ${sources.length} sources]\n\n${context}`,
+            },
+        ],
+    };
+});
+/* ------------------------------------------------------------------ */
+const transport = new StdioServerTransport();
+await server.connect(transport);
+console.error(`RAG + Context Management MCP server running (db: ${path.resolve(STORAGE_DIR)})`);
+//# sourceMappingURL=rag-server.js.map

package/dist/mcp/rag-server.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rag-server.js","sourceRoot":"","sources":["../../src/mcp/rag-server.ts"],"names":[],"mappings":";AACA,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AACpE,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AACjF,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,EACL,UAAU,EACV,UAAU,EACV,eAAe,EACf,UAAU,EACV,QAAQ,EACR,aAAa,EACb,cAAc,EACd,aAAa,GACd,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,aAAa,IAAI,WAAW,EAC5B,YAAY,IAAI,UAAU,GAC3B,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,QAAQ,EACR,MAAM,EACN,YAAY,EACZ,SAAS,EACT,YAAY,EACZ,MAAM,EACN,WAAW,EACX,WAAW,EACX,aAAa,EACb,YAAY,GACb,MAAM,qBAAqB,CAAC;AAE7B,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC/C,MAAM,aAAa,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAAC,OAAiB,CAAC;AAEtE,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC;IAC3B,IAAI,EAAE,mBAAmB;IACzB,OAAO,EAAE,aAAa;CACvB,CAAC,CAAC;AAEH,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,MAAM,CAAC,YAAY,CACjB,cAAc,EACd;IACE,WAAW,EAAE,+FAA+F;IAC5G,WAAW,EAAE,EAAE;CAChB,EACD,KAAK,IAAI,EAAE;IACT,MAAM,IAAI,GAAG,aAAa,EAAE,CAAC;IAC7B,MAAM,GAAG,GAAG,WAAW,EAAE,CAAC;IAC1B,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAClB,EAAE,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,aAAa,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,EAClF,IAAI,EACJ,CAAC,CACF;aACF;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,MAAM,CAAC,YAAY,CACjB,iBAAiB,EACjB;IACE,WAAW,EAAE,iFAAiF;IAC9F,WAAW,EAAE;QACX,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gBAAgB,CAAC;QAC5C,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;QACpF,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,QAAQ,EAAE;KACvD;CACF,EACD,KAAK,EAAE,IAAkG,EAAE,EAAE;IAC3G,MAAM,GAAG,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,EAAE;QACrD,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,QAAQ,EAAE,IAAI,CAAC,QAAQ;KACxB,CAAC,CAAC;IACH,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC7E,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,iBAAiB,EACjB;IACE,WAAW,EAAE,kDAAkD;IAC/D,WAAW,EAAE;QACX,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,2BAA2B,CAAC;QACtD,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,QAAQ,EAAE;KACvD;CACF,EACD,KAAK,EAAE,IAA0D,EAAE,EAAE;IACnE,MAAM,GAAG,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACrE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC7E,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,gBAAgB,EAChB;IACE,WAAW,EAAE,4DAA4D;IACzE,WAAW,EAAE;QACX,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gCAAgC,CAAC;QAC3D,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;QAC/C,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iDAAiD,CAAC;KACvG;CACF,EACD,KAAK,EAAE,IAAkE,EAAE,EAAE;IAC3E,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;IACzG,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC7E,CAAC,CACF,CAAC;AAEF,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,MAAM,CAAC,YAAY,CACjB,YAAY,EACZ;IACE,WAAW,EAAE,yGAAyG;IACtH,WAAW,EAAE;QACX,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;QAC7D,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;KAC7D;CACF,EACD,KAAK,EAAE,IAA2D,EAAE,EAAE;IACpE,MAAM,IAAI,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC;IACpF,OAAO;QACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;KACjE,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,cAAc,EACd;IACE,WAAW,EACT,uJAAuJ;IACzJ,WAAW,EAAE;QACX,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5D,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;KAC7D;CACF,EACD,KAAK,EAAE,IAA2D,EAAE,EAAE;IACpE,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC;IAChF,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,4BAA4B,EAAE,CAAC,EAAE,CAAC;IAC7E,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,UAAU,YAAY,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IAC3H,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,mBAAmB,GAAG,CAAC,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,WAAW,eAAe,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;aAC1G;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,MAAM,CAAC,YAAY,CACjB,oBAAoB,EACpB;IACE,WAAW,EAAE,qCAAqC;IAClD,WAAW,EAAE,EAAE;CAChB,EACD,KAAK,IAAI,EAAE;IACT,MAAM,IAAI,GAAG,aAAa,EAAE,CAAC;IAC7B,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC9E,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,oBAAoB,EACpB;IACE,WAAW,EAAE,6BAA6B;IAC1C,WAAW,EAAE,EAAE;CAChB,EACD,KAAK,IAAI,EAAE;IACT,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AACzF,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,qBAAqB,EACrB;IACE,WAAW,EAAE,4CAA4C;IACzD,WAAW,EAAE;QACX,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;KAC1B;CACF,EACD,KAAK,EAAE,IAAwB,EAAE,EAAE;IACjC,MAAM,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxC,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;AACpE,CAAC,CACF,CAAC;AAEF,wEAAwE;AACxE,yEAAyE;AACzE,wEAAwE;AAExE,MAAM,CAAC,YAAY,CACjB,kBAAkB,EAClB;IACE,WAAW,EACT,0PAA0P;IAC5P,WAAW,EAAE;QACX,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,4DAA4D,CAAC;QACxG,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,2EAA2E,CAAC;QACtH,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;KAC5F;CACF,EACD,KAAK,EAAE,IAAiE,EAAE,EAAE;IAC1E,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU;QACzB,CAAC,CAAC,MAAM,WAAW,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3D,CAAC,CAAC,MAAM,UAAU,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IACvE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC7E,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,iBAAiB,EACjB;IACE,WAAW,EACT,iLAAiL;IACnL,WAAW,EAAE;QACX,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,2DAA2D,CAAC;QAChG,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;QACrD,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,4BAA4B,CAAC;QACnG,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,oBAAoB,CAAC;KACpE;CACF,EACD,KAAK,EAAE,IAA8E,EAAE,EAAE;IACvF,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC;QACzB,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,IAAI,EAAE,IAAI,CAAC,IAAa;QACxB,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;KAChB,CAAC,CAAC;IACH,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC7E,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,eAAe,EACf;IACE,WAAW,EAAE,oGAAoG;IACjH,WAAW,EAAE;QACX,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5D,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC;KAC5D;CACF,EACD,KAAK,EAAE,IAA2D,EAAE,EAAE;IACpE,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC,CAAC;IAC9E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC9E,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,aAAa,EACb;IACE,WAAW,EAAE,wEAAwE;IACrF,WAAW,EAAE;QACX,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,QAAQ,EAAE;QACrC,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAC1B,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE;QACnD,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC;KAChE;CACF,EACD,KAAK,EAAE,IAA8E,EAAE,EAAE;IACvF,MAAM,IAAI,GAAG,YAAY,CAAC;QACxB,IAAI,EAAE,IAAI,CAAC,IAAa;QACxB,GAAG,EAAE,IAAI,CAAC,GAAG;QACb,aAAa,EAAE,IAAI,CAAC,cAAc;QAClC,KAAK,EAAE,IAAI,CAAC,KAAK;KAClB,CAAC,CAAC;IACH,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC9E,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,YAAY,EACZ;IACE,WAAW,EAAE,2BAA2B;IACxC,WAAW,EAAE;QACX,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;KACtB;CACF,EACD,KAAK,EAAE,IAAoB,EAAE,EAAE;IAC7B,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,2BAA2B,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IAC7F,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC7E,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,eAAe,EACf;IACE,WAAW,EAAE,iEAAiE;IAC9E,WAAW,EAAE;QACX,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrB,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAC9B,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,QAAQ,EAAE;QACrC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE;QAC/C,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE;KACrC;CACF,EACD,KAAK,EAAE,IAA2F,EAAE,EAAE;IACpG,MAAM,GAAG,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;QACtC,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,IAAI,EAAE,IAAI,CAAC,IAAa;QACxB,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;KAChB,CAAC,CAAC;IACH,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,2BAA2B,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IAC7F,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC7E,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,eAAe,EACf;IACE,WAAW,EAAE,uBAAuB;IACpC,WAAW,EAAE;QACX,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;KACtB;CACF,EACD,KAAK,EAAE,IAAoB,EAAE,EAAE;IAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5B,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;AACpE,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,oBAAoB,EACpB;IACE,WAAW,EAAE,oIAAoI;IACjJ,WAAW,EAAE,EAAE;CAChB,EACD,KAAK,IAAI,EAAE;IACT,MAAM,GAAG,GAAG,MAAM,WAAW,EAAE,CAAC;IAChC,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC7E,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,cAAc,EACd;IACE,WAAW,EAAE,kEAAkE;IAC/E,WAAW,EAAE,EAAE;CAChB,EACD,KAAK,IAAI,EAAE;IACT,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AACvF,CAAC,CACF,CAAC;AAEF,MAAM,CAAC,YAAY,CACjB,gBAAgB,EAChB;IACE,WAAW,EAAE,0HAA0H;IACvI,WAAW,EAAE;QACX,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;KAC7D;CACF,EACD,KAAK,EAAE,IAAuC,EAAE,EAAE;IAChD,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,MAAM,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;IAC9E,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,6BAA6B,EAAE,CAAC,EAAE,CAAC;IAC1F,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,oBAAoB,OAAO,CAAC,MAAM,gBAAgB,OAAO,EAAE;aAClE;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,wEAAwE;AAExE,MAAM,SAAS,GAAG,IAAI,oBAAoB,EAAE,CAAC;AAC7C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;AAChC,OAAO,CAAC,KAAK,CAAC,oDAAoD,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC"}

package/dist/memory/memory.d.ts

@@ -0,0 +1,69 @@
+export declare const MEMORY_TYPES: readonly ["fact", "preference", "decision", "instruction", "task", "insight", "conversation"];
+export type MemoryType = (typeof MEMORY_TYPES)[number];
+export interface MemoryInput {
+    content: string;
+    type?: MemoryType;
+    importance?: number;
+    tags?: string[];
+}
+export interface MemoryRecord {
+    id: string;
+    type: MemoryType;
+    content: string;
+    importance: number;
+    tags: string[];
+    recallCount: number;
+    lastRecalled: number | null;
+    createdAt: number;
+    updatedAt: number;
+}
+export interface MemoryRecallHit extends MemoryRecord {
+    score: number;
+    /** Exponential decay factor applied to the raw similarity (0..1, based on staleness). */
+    decay: number;
+}
+export declare function remember(input: MemoryInput): Promise<MemoryRecord>;
+export declare function recall(query: string, topK?: number, minScore?: number): Promise<MemoryRecallHit[]>;
+export declare function listMemories(opts?: {
+    type?: MemoryType;
+    tag?: string;
+    minImportance?: number;
+    limit?: number;
+}): MemoryRecord[];
+export declare function getMemory(id: string): MemoryRecord | null;
+export declare function updateMemory(id: string, patch: {
+    content?: string;
+    type?: MemoryType;
+    importance?: number;
+    tags?: string[];
+}): Promise<MemoryRecord | null>;
+export declare function forget(id: string): {
+    deleted: boolean;
+};
+export interface ConsolidationReport {
+    removedDuplicates: number;
+    promoted: number;
+    pruned: number;
+    totals: {
+        memories: number;
+        tokens: number;
+    };
+}
+/**
+ * - Removes near-duplicate memories (dot product > 0.92) keeping the highest-importance one.
+ * - Promotes importance of frequently-needed memories (recall_count >= 5) by +0.1.
+ * - Optionally prunes stale, low-importance, never-recalled memories (RAG_PRUNE=1,
+ *   RAG_PRUNE_IMPORTANCE=0.2, RAG_PRUNE_AGE_DAYS=90). Off by default — deletes are irreversible.
+ */
+export declare function consolidate(): Promise<ConsolidationReport>;
+export declare function memoryStats(): {
+    memories: number;
+    tokens: number;
+    avgImportance: number;
+    byType: Record<string, number>;
+};
+export declare function contextPrompt(query: string, topK?: number): Promise<{
+    context: string;
+    sources: MemoryRecallHit[];
+}>;
+//# sourceMappingURL=memory.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../src/memory/memory.ts"],"names":[],"mappings":"AAMA,eAAO,MAAM,YAAY,+FAQf,CAAC;AAEX,MAAM,MAAM,UAAU,GAAG,CAAC,OAAO,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC;AAKvD,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,UAAU,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,eAAgB,SAAQ,YAAY;IACnD,KAAK,EAAE,MAAM,CAAC;IACd,yFAAyF;IACzF,KAAK,EAAE,MAAM,CAAC;CACf;AAED,wBAAsB,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,YAAY,CAAC,CAgBxE;AAED,wBAAsB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,SAAI,EAAE,QAAQ,SAAM,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,CAwBhG;AAED,wBAAgB,YAAY,CAAC,IAAI,GAAE;IAAE,IAAI,CAAC,EAAE,UAAU,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,YAAY,EAAE,CAyBnI;AAED,wBAAgB,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI,CA6BzD;AAED,wBAAsB,YAAY,CAChC,EAAE,EAAE,MAAM,EACV,KAAK,EAAE;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,UAAU,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,GACnF,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAkB9B;AAED,wBAAgB,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG;IAAE,OAAO,EAAE,OAAO,CAAA;CAAE,CAKvD;AAED,MAAM,WAAW,mBAAmB;IAClC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CAC9C;AAED;;;;;GAKG;AACH,wBAAsB,WAAW,IAAI,OAAO,CAAC,mBAAmB,CAAC,CA0EhE;AAED,wBAAgB,WAAW,IAAI;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,CAczH;AAED,wBAAsB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,SAAI,GAAG,OAAO,CAAC;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,eAAe,EAAE,CAAA;CAAE,CAAC,CAKrH"}

package/dist/memory/memory.js

@@ -0,0 +1,221 @@
+import { getDB, newId, nowMs, packVector, unpackVector } from "../db/database.js";
+import { dotProduct } from "../rag/embedder.js";
+import { estimateTokens } from "../rag/chunker.js";
+import { embedText } from "../rag/embeddings.js";
+import { vectorSearch, invalidateVectorCache } from "../rag/vector-search.js";
+export const MEMORY_TYPES = [
+    "fact",
+    "preference",
+    "decision",
+    "instruction",
+    "task",
+    "insight",
+    "conversation",
+];
+/** Half-life in days for the recall decay curve. */
+const DECAY_HALF_LIFE_DAYS = Number(process.env.RAG_MEMORY_HALF_LIFE_DAYS ?? 14);
+export async function remember(input) {
+    const db = getDB();
+    const id = newId();
+    const ts = nowMs();
+    const type = input.type ?? "fact";
+    const importance = clampImportance(input.importance ?? 0.5);
+    const tags = JSON.stringify(input.tags ?? []);
+    const vec = await embedText(input.content);
+    db.prepare(`INSERT INTO memories (id, type, content, importance, embedding, tags, recall_count, last_recalled, created_at, updated_at)
+     VALUES (?, ?, ?, ?, ?, ?, 0, NULL, ?, ?)`).run(id, type, input.content, importance, packVector(vec), tags, ts, ts);
+    invalidateVectorCache();
+    return getMemory(id);
+}
+export async function recall(query, topK = 8, minScore = 0.1) {
+    const db = getDB();
+    const q = await embedText(query);
+    const hits = vectorSearch(q, { topK: topK * 2, minScore, collection: "memories" });
+    const ts = nowMs();
+    const bump = db.prepare("UPDATE memories SET recall_count = recall_count + 1, last_recalled = ? WHERE id = ?");
+    const results = [];
+    for (const h of hits) {
+        const rec = getMemory(h.key);
+        if (!rec)
+            continue;
+        bump.run(ts, rec.id);
+        const ageMs = ts - (rec.lastRecalled ?? rec.createdAt);
+        const decay = Math.pow(0.5, ageMs / (DECAY_HALF_LIFE_DAYS * 86_400_000));
+        results.push({
+            ...rec,
+            recallCount: rec.recallCount + 1,
+            lastRecalled: ts,
+            score: h.score * decay,
+            decay,
+        });
+    }
+    results.sort((a, b) => b.score - a.score);
+    return results.slice(0, topK);
+}
+export function listMemories(opts = {}) {
+    const db = getDB();
+    const clauses = [];
+    const params = [];
+    if (opts.type) {
+        clauses.push("type = ?");
+        params.push(opts.type);
+    }
+    if (opts.tag) {
+        clauses.push("EXISTS (SELECT 1 FROM json_each(memories.tags) AS _tg WHERE _tg.value = ?)");
+        params.push(opts.tag);
+    }
+    if (opts.minImportance !== undefined) {
+        clauses.push("importance >= ?");
+        params.push(opts.minImportance);
+    }
+    const where = clauses.length ? ` WHERE ${clauses.join(" AND ")}` : "";
+    const limit = Math.min(opts.limit ?? 100, 500);
+    const rows = db
+        .prepare(`SELECT id FROM memories${where} ORDER BY updated_at DESC LIMIT ${limit}`)
+        .all(...params);
+    return rows.map((r) => getMemory(r.id)).filter(Boolean);
+}
+export function getMemory(id) {
+    const db = getDB();
+    const row = db
+        .prepare("SELECT * FROM memories WHERE id = ?")
+        .get(id);
+    if (!row)
+        return null;
+    return {
+        id: row.id,
+        type: row.type,
+        content: row.content,
+        importance: row.importance,
+        tags: JSON.parse(row.tags),
+        recallCount: row.recall_count,
+        lastRecalled: row.last_recalled,
+        createdAt: row.created_at,
+        updatedAt: row.updated_at,
+    };
+}
+export async function updateMemory(id, patch) {
+    const db = getDB();
+    const existing = getMemory(id);
+    if (!existing)
+        return null;
+    const content = patch.content ?? existing.content;
+    const type = patch.type ?? existing.type;
+    const importance = patch.importance !== undefined ? clampImportance(patch.importance) : existing.importance;
+    const tags = patch.tags ?? existing.tags;
+    const vec = await embedText(content);
+    const ts = nowMs();
+    db.prepare("UPDATE memories SET content = ?, type = ?, importance = ?, tags = ?, embedding = ?, updated_at = ? WHERE id = ?").run(content, type, importance, JSON.stringify(tags), packVector(vec), ts, id);
+    invalidateVectorCache();
+    return getMemory(id);
+}
+export function forget(id) {
+    const db = getDB();
+    const res = db.prepare("DELETE FROM memories WHERE id = ?").run(id);
+    invalidateVectorCache();
+    return { deleted: Number(res.changes) > 0 };
+}
+/**
+ * - Removes near-duplicate memories (dot product > 0.92) keeping the highest-importance one.
+ * - Promotes importance of frequently-needed memories (recall_count >= 5) by +0.1.
+ * - Optionally prunes stale, low-importance, never-recalled memories (RAG_PRUNE=1,
+ *   RAG_PRUNE_IMPORTANCE=0.2, RAG_PRUNE_AGE_DAYS=90). Off by default — deletes are irreversible.
+ */
+export async function consolidate() {
+    const db = getDB();
+    const rows = db.prepare("SELECT id, embedding FROM memories").all();
+    const records = rows
+        .map((r) => ({ id: r.id, rec: getMemory(r.id) }))
+        .filter((r) => r.rec !== null && r.rec !== undefined);
+    const vectors = [];
+    for (const r of records) {
+        const vec = unpackVector(rows.find((row) => row.id === r.id)?.embedding ?? null);
+        if (vec)
+            vectors.push({ id: r.id, vec });
+    }
+    let removedDuplicates = 0;
+    const toDelete = new Set();
+    for (let i = 0; i < vectors.length; i++) {
+        if (toDelete.has(vectors[i].id))
+            continue;
+        for (let j = i + 1; j < vectors.length; j++) {
+            if (toDelete.has(vectors[j].id))
+                continue;
+            const sim = dotProduct(vectors[i].vec, vectors[j].vec);
+            if (sim >= 0.92) {
+                const a = records.find((r) => r.id === vectors[i].id).rec;
+                const b = records.find((r) => r.id === vectors[j].id).rec;
+                if (a.importance >= b.importance) {
+                    toDelete.add(vectors[j].id);
+                }
+                else {
+                    toDelete.add(vectors[i].id);
+                    const tmpId = vectors[i].id;
+                    vectors[i].id = vectors[j].id;
+                    vectors[j].id = tmpId;
+                }
+                removedDuplicates++;
+            }
+        }
+    }
+    const delStmt = db.prepare("DELETE FROM memories WHERE id = ?");
+    for (const id of toDelete)
+        delStmt.run(id);
+    let promoted = 0;
+    const bumpPromotion = async () => {
+        for (const rec of listMemories()) {
+            if (rec.recallCount >= 5 && rec.importance < 1) {
+                await updateMemory(rec.id, { importance: Math.min(1, rec.importance + 0.1) });
+                promoted++;
+            }
+        }
+    };
+    let pruned = 0;
+    const pruneEnabled = process.env.RAG_PRUNE === "1" || process.env.RAG_PRUNE === "true";
+    if (pruneEnabled) {
+        const minImp = Number(process.env.RAG_PRUNE_IMPORTANCE ?? 0.2);
+        const maxAgeDays = Number(process.env.RAG_PRUNE_AGE_DAYS ?? 90);
+        const cutoff = nowMs() - maxAgeDays * 86_400_000;
+        const stale = db
+            .prepare("SELECT id FROM memories WHERE importance < ? AND recall_count = 0 AND created_at < ?")
+            .all(minImp, cutoff);
+        for (const s of stale) {
+            delStmt.run(s.id);
+            pruned++;
+        }
+    }
+    await bumpPromotion();
+    invalidateVectorCache();
+    const stats = memoryStats();
+    return {
+        removedDuplicates,
+        promoted,
+        pruned,
+        totals: { memories: stats.memories, tokens: stats.tokens },
+    };
+}
+export function memoryStats() {
+    const db = getDB();
+    const count = db.prepare("SELECT COUNT(*) AS c FROM memories").get();
+    const avg = db.prepare("SELECT COALESCE(AVG(importance),0) AS a FROM memories").get();
+    const byTypeRows = db.prepare("SELECT type, COUNT(*) AS c FROM memories GROUP BY type").all();
+    const byType = {};
+    for (const r of byTypeRows)
+        byType[r.type] = r.c;
+    let totalTokens = 0;
+    for (const r of db.prepare("SELECT content FROM memories").all()) {
+        totalTokens += estimateTokens(r.content);
+    }
+    return { memories: count.c, tokens: totalTokens, avgImportance: avg.a, byType };
+}
+export async function contextPrompt(query, topK = 6) {
+    const hits = await recall(query, topK);
+    if (hits.length === 0)
+        return { context: "", sources: [] };
+    const lines = hits.map((h) => `[${h.type}, importance ${h.importance.toFixed(2)}] ${h.content}`);
+    return { context: lines.join("\n"), sources: hits };
+}
+function clampImportance(v) {
+    return Math.min(1, Math.max(0, v));
+}
+//# sourceMappingURL=memory.js.map