@199-bio/engram 0.7.4 → 0.8.0

package/dist/consolidation/consolidator.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"consolidator.d.ts","sourceRoot":"","sources":["../../src/consolidation/consolidator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAE,cAAc,EAAU,MAAM,EAAW,MAAM,wBAAwB,CAAC;AAEjF,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AA0FtD,UAAU,kBAAkB;IAC1B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,2BAA2B,CAAC,EAAE,MAAM,CAAC;CACtC;AAED,qBAAa,YAAY;IACvB,OAAO,CAAC,MAAM,CAA0B;IACxC,OAAO,CAAC,EAAE,CAAiB;IAC3B,OAAO,CAAC,KAAK,CAA+B;IAC5C,OAAO,CAAC,MAAM,CAA6B;gBAGzC,EAAE,EAAE,cAAc,EAClB,KAAK,CAAC,EAAE,cAAc,EACtB,MAAM,CAAC,EAAE,YAAY;IAYvB,YAAY,IAAI,OAAO;IAIvB;;;OAGG;IACG,WAAW,CAAC,OAAO,GAAE,kBAAuB,GAAG,OAAO,CAAC;QAC3D,cAAc,EAAE,MAAM,CAAC;QACvB,mBAAmB,EAAE,MAAM,CAAC;QAC5B,iBAAiB,EAAE,MAAM,CAAC;KAC3B,CAAC;IAwEF;;OAEG;YACW,gBAAgB;IAoE9B;;OAEG;IACG,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAuHjE;;OAEG;IACH,SAAS,IAAI;QACX,UAAU,EAAE,OAAO,CAAC;QACpB,sBAAsB,EAAE,MAAM,CAAC;QAC/B,sBAAsB,EAAE,MAAM,CAAC;QAC/B,YAAY,EAAE,MAAM,CAAC;QACrB,wBAAwB,EAAE,MAAM,CAAC;KAClC;IAeD;;;OAGG;IACG,mBAAmB,CAAC,OAAO,GAAE;QACjC,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,SAAS,CAAC,EAAE,MAAM,CAAC;KACf,GAAG,OAAO,CAAC;QACf,iBAAiB,EAAE,MAAM,CAAC;QAC1B,eAAe,EAAE,MAAM,CAAC;QACxB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;IAwFF;;OAEG;YACW,2BAA2B;IAqDzC;;;OAGG;IACG,aAAa,IAAI,OAAO,CAAC;QAC7B,iBAAiB,EAAE,MAAM,CAAC;QAC1B,eAAe,EAAE,MAAM,CAAC;QACxB,cAAc,EAAE,MAAM,CAAC;QACvB,mBAAmB,EAAE,MAAM,CAAC;KAC7B,CAAC;CAkBH"}
+{"version":3,"file":"consolidator.d.ts","sourceRoot":"","sources":["../../src/consolidation/consolidator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAE,cAAc,EAAU,MAAM,EAAW,MAAM,wBAAwB,CAAC;AAEjF,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AA0FtD,UAAU,kBAAkB;IAC1B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,2BAA2B,CAAC,EAAE,MAAM,CAAC;CACtC;AAED,qBAAa,YAAY;IACvB,OAAO,CAAC,MAAM,CAA0B;IACxC,OAAO,CAAC,EAAE,CAAiB;IAC3B,OAAO,CAAC,KAAK,CAA+B;IAC5C,OAAO,CAAC,MAAM,CAA6B;gBAGzC,EAAE,EAAE,cAAc,EAClB,KAAK,CAAC,EAAE,cAAc,EACtB,MAAM,CAAC,EAAE,YAAY;IAYvB,YAAY,IAAI,OAAO;IAIvB;;;OAGG;IACG,WAAW,CAAC,OAAO,GAAE,kBAAuB,GAAG,OAAO,CAAC;QAC3D,cAAc,EAAE,MAAM,CAAC;QACvB,mBAAmB,EAAE,MAAM,CAAC;QAC5B,iBAAiB,EAAE,MAAM,CAAC;KAC3B,CAAC;IAwEF;;OAEG;YACW,gBAAgB;IAoE9B;;OAEG;IACG,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAuHjE;;OAEG;IACH,SAAS,IAAI;QACX,UAAU,EAAE,OAAO,CAAC;QACpB,sBAAsB,EAAE,MAAM,CAAC;QAC/B,sBAAsB,EAAE,MAAM,CAAC;QAC/B,YAAY,EAAE,MAAM,CAAC;QACrB,wBAAwB,EAAE,MAAM,CAAC;KAClC;IAeD;;;OAGG;IACG,mBAAmB,CAAC,OAAO,GAAE;QACjC,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,SAAS,CAAC,EAAE,MAAM,CAAC;KACf,GAAG,OAAO,CAAC;QACf,iBAAiB,EAAE,MAAM,CAAC;QAC1B,eAAe,EAAE,MAAM,CAAC;QACxB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;IAwFF;;OAEG;YACW,2BAA2B;IAqDzC;;;OAGG;IACG,aAAa,IAAI,OAAO,CAAC;QAC7B,iBAAiB,EAAE,MAAM,CAAC;QAC1B,eAAe,EAAE,MAAM,CAAC;QACxB,cAAc,EAAE,MAAM,CAAC;QACvB,mBAAmB,EAAE,MAAM,CAAC;QAC5B,kBAAkB,EAAE,MAAM,CAAC;QAC3B,aAAa,EAAE,MAAM,CAAC;KACvB,CAAC;CA4BH"}

package/dist/index.js

@@ -58,7 +58,7 @@ async function initialize() {
 // ============ MCP Server ============
 const server = new Server({
     name: "engram",
-    version: "0.7.2",
+    version: "0.8.0",
 }, {
     capabilities: {
         tools: {},
@@ -257,6 +257,37 @@ const TOOLS = [
             openWorldHint: true, // Calls Anthropic API for consolidation
         },
     },
+    {
+        name: "memory_feedback",
+        description: "Signal which memories from a recall were actually useful. Call AFTER using memories to answer user's question. This enables the memory system to learn which memories help together (Hebbian learning). Optional but improves memory quality over time.",
+        inputSchema: {
+            type: "object",
+            properties: {
+                recall_id: {
+                    type: "string",
+                    description: "The recall_id from the recall response",
+                },
+                useful_memory_ids: {
+                    type: "array",
+                    items: { type: "string" },
+                    description: "IDs of memories that actually helped answer the question. Empty array if none were useful.",
+                },
+                need_more: {
+                    type: "boolean",
+                    description: "Set true if the memories were insufficient and you need a deeper search with more results",
+                    default: false,
+                },
+            },
+            required: ["recall_id", "useful_memory_ids"],
+        },
+        annotations: {
+            title: "Memory Feedback",
+            readOnlyHint: false,
+            destructiveHint: false,
+            idempotentHint: true,
+            openWorldHint: false,
+        },
+    },
 ];
 // List available tools
 server.setRequestHandler(ListToolsRequestSchema, async () => ({
@@ -314,11 +345,11 @@ server.setRequestHandler(CallToolRequestSchema, async (request) => {
             }
             case "recall": {
                 const { query, limit = 5, include_graph = true } = args;
-                const results = await search.search(query, {
+                const response = await search.search(query, {
                     limit,
                     includeGraph: include_graph,
                 });
-                const formatted = results.map((r) => ({
+                const formatted = response.results.map((r) => ({
                     id: r.memory.id,
                     content: r.memory.content,
                     source: r.memory.source,
@@ -330,14 +361,24 @@ server.setRequestHandler(CallToolRequestSchema, async (request) => {
                         .map(([k]) => k)
                         .join(", "),
                 }));
+                // Format connected memories (Hebbian associations)
+                const connectedFormatted = response.connected_memories.map((c) => ({
+                    id: c.memory.id,
+                    content: c.memory.content,
+                    connected_to: c.connected_to,
+                    connection_strength: c.strength.toFixed(2),
+                }));
                 return {
                     content: [
                         {
                             type: "text",
                             text: JSON.stringify({
+                                recall_id: response.recall_id, // For memory_feedback
                                 query,
                                 results: formatted,
                                 count: formatted.length,
+                                connected_memories: connectedFormatted,
+                                hint: formatted.length > 0 ? "Call memory_feedback with useful_memory_ids after answering" : undefined,
                             }, null, 2),
                         },
                     ],
@@ -497,6 +538,81 @@ server.setRequestHandler(CallToolRequestSchema, async (request) => {
                     ],
                 };
             }
+            case "memory_feedback": {
+                const { recall_id, useful_memory_ids, need_more = false } = args;
+                // Update the retrieval log with feedback
+                const updated = db.updateRetrievalFeedback(recall_id, useful_memory_ids, need_more);
+                if (!updated) {
+                    return {
+                        content: [
+                            {
+                                type: "text",
+                                text: JSON.stringify({
+                                    success: false,
+                                    error: `Recall ID not found: ${recall_id}`,
+                                }),
+                            },
+                        ],
+                    };
+                }
+                // If need_more is set, do an expanded search
+                if (need_more) {
+                    const expandedResponse = await search.expandSearch(recall_id);
+                    const formatted = expandedResponse.results.map((r) => ({
+                        id: r.memory.id,
+                        content: r.memory.content,
+                        source: r.memory.source,
+                        timestamp: r.memory.timestamp.toISOString(),
+                        relevance_score: r.score.toFixed(4),
+                        matched_via: Object.entries(r.sources)
+                            .filter(([, v]) => v !== undefined)
+                            .map(([k]) => k)
+                            .join(", "),
+                    }));
+                    return {
+                        content: [
+                            {
+                                type: "text",
+                                text: JSON.stringify({
+                                    success: true,
+                                    feedback_recorded: true,
+                                    useful_count: useful_memory_ids.length,
+                                    expanded_search: true,
+                                    additional_results: formatted,
+                                    additional_count: formatted.length,
+                                }, null, 2),
+                            },
+                        ],
+                    };
+                }
+                // Process deferred learning if we have enough feedback
+                const unprocessed = db.getUnprocessedRetrievalLogs(50);
+                let learningApplied = 0;
+                for (const log of unprocessed) {
+                    if (log.useful_ids && log.useful_ids.length >= 2) {
+                        // Strengthen connections between useful memories
+                        db.recordCoUseful(log.useful_ids);
+                        learningApplied++;
+                    }
+                }
+                if (unprocessed.length > 0) {
+                    db.markRetrievalLogsProcessed(unprocessed.map(l => l.id));
+                }
+                return {
+                    content: [
+                        {
+                            type: "text",
+                            text: JSON.stringify({
+                                success: true,
+                                feedback_recorded: true,
+                                useful_count: useful_memory_ids.length,
+                                learning_applied: learningApplied > 0,
+                                connections_strengthened: learningApplied,
+                            }, null, 2),
+                        },
+                    ],
+                };
+            }
             default:
                 throw new Error(`Unknown tool: ${name}`);
         }

package/dist/retrieval/hybrid.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hybrid.d.ts","sourceRoot":"","sources":["../../src/retrieval/hybrid.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAA0B,MAAM,cAAc,CAAC;AAEzF,MAAM,WAAW,kBAAkB;IACjC,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE;QACP,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;KAChB,CAAC;CACH;AAwDD,qBAAa,YAAY;IAErB,OAAO,CAAC,EAAE;IACV,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,SAAS;gBAFT,EAAE,EAAE,cAAc,EAClB,KAAK,EAAE,cAAc,EACrB,SAAS,EAAE,gBAAgB,GAAG,eAAe;IAGvD;;;;;OAKG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,OAAO,GAAE;QACP,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,YAAY,CAAC,EAAE,OAAO,CAAC;QACvB,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,cAAc,CAAC,EAAE,MAAM,CAAC;QACxB,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,YAAY,CAAC,EAAE,OAAO,CAAC;KACnB,GACL,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAyIhC;;OAEG;YACW,UAAU;IASxB;;OAEG;YACW,cAAc;IAS5B;;;OAGG;IACH,OAAO,CAAC,aAAa;IAQrB;;;OAGG;YACW,WAAW;IA8BzB;;OAEG;IACG,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAOhD;;OAEG;IACG,YAAY,IAAI,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAYhD;;OAEG;IACG,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;CAGvD"}
+{"version":3,"file":"hybrid.d.ts","sourceRoot":"","sources":["../../src/retrieval/hybrid.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAA0B,MAAM,cAAc,CAAC;AAEzF,MAAM,WAAW,kBAAkB;IACjC,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE;QACP,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,SAAS,CAAC,EAAE,MAAM,CAAC;KACpB,CAAC;CACH;AAED,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,kBAAkB,EAAE,KAAK,CAAC;QACxB,MAAM,EAAE,MAAM,CAAC;QACf,YAAY,EAAE,MAAM,CAAC;QACrB,QAAQ,EAAE,MAAM,CAAC;KAClB,CAAC,CAAC;CACJ;AAwDD,qBAAa,YAAY;IAIrB,OAAO,CAAC,EAAE;IACV,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,SAAS;IALnB,OAAO,CAAC,SAAS,CAAS;gBAGhB,EAAE,EAAE,cAAc,EAClB,KAAK,EAAE,cAAc,EACrB,SAAS,EAAE,gBAAgB,GAAG,eAAe;IAMvD;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAIxB;;;;;OAKG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,OAAO,GAAE;QACP,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,YAAY,CAAC,EAAE,OAAO,CAAC;QACvB,kBAAkB,CAAC,EAAE,OAAO,CAAC;QAC7B,gBAAgB,CAAC,EAAE,MAAM,CAAC;QAC1B,qBAAqB,CAAC,EAAE,MAAM,CAAC;QAC/B,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,cAAc,CAAC,EAAE,MAAM,CAAC;QACxB,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,gBAAgB,CAAC,EAAE,MAAM,CAAC;QAC1B,YAAY,CAAC,EAAE,OAAO,CAAC;KACnB,GACL,OAAO,CAAC,oBAAoB,CAAC;IAuNhC;;;OAGG;IACG,YAAY,CAChB,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE;QAAE,eAAe,CAAC,EAAE,MAAM,CAAA;KAAO,GACzC,OAAO,CAAC,oBAAoB,CAAC;IAyBhC;;OAEG;YACW,UAAU;IASxB;;OAEG;YACW,cAAc;IAS5B;;;OAGG;IACH,OAAO,CAAC,aAAa;IAQrB;;;OAGG;YACW,WAAW;IA8BzB;;OAEG;IACG,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAOhD;;OAEG;IACG,YAAY,IAAI,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAYhD;;OAEG;IACG,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;CAGvD"}

package/dist/storage/database.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"database.d.ts","sourceRoot":"","sources":["../../src/storage/database.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAOH,MAAM,WAAW,MAAM;IACrB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,EAAE,IAAI,GAAG,IAAI,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,IAAI,GAAG,IAAI,CAAC;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,GAAG,WAAW,CAAC;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,IAAI,CAAC;IAChB,YAAY,EAAE,OAAO,CAAC;CACvB;AAED,MAAM,WAAW,MAAM;IACrB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,GAAG,OAAO,GAAG,SAAS,GAAG,OAAO,GAAG,cAAc,CAAC;IAChE,UAAU,EAAE,IAAI,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;CAC1C;AAED,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,IAAI,CAAC;IACjB,WAAW,EAAE,IAAI,GAAG,IAAI,CAAC;CAC1B;AAED,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IAC3C,UAAU,EAAE,IAAI,CAAC;CAClB;AAED,MAAM,WAAW,MAAM;IACrB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,IAAI,CAAC;IACjB,YAAY,EAAE,IAAI,CAAC;IACnB,UAAU,EAAE,IAAI,CAAC;CAClB;AAED,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,OAAO,CAAC;IAClB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,UAAU,EAAE,IAAI,CAAC;IACjB,WAAW,EAAE,IAAI,GAAG,IAAI,CAAC;CAC1B;AAED,qBAAa,cAAc;IACzB,OAAO,CAAC,EAAE,CAAoB;IAC9B,OAAO,CAAC,SAAS,CAA8C;gBAEnD,MAAM,EAAE,MAAM;IAoB1B,OAAO,CAAC,UAAU;IAgKlB;;OAEG;IACH,OAAO,CAAC,aAAa;IAqBrB,YAAY,CACV,OAAO,EAAE,MAAM,EACf,MAAM,GAAE,MAAuB,EAC/B,UAAU,GAAE,MAAY,EACxB,OAAO,GAAE;QACP,SAAS,CAAC,EAAE,IAAI,CAAC;QACjB,eAAe,CAAC,EAAE,MAAM,CAAC;KACrB,GACL,MAAM;IAkBT,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAKpC,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,YAAY,GAAG,UAAU,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI;IAyB9G,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAMjC;;;OAGG;IACH,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAW7B,cAAc,CAAC,KAAK,GAAE,MAAa,EAAE,eAAe,GAAE,OAAe,EAAE,MAAM,GAAE,MAAU,GAAG,MAAM,EAAE;IAUpG;;OAEG;IACH,aAAa,CACX,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,GAAG,WAAW,EAC1B,OAAO,EAAE,MAAM,EACf,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO;IAcV,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,GAAG,IAAI;IAKtC,OAAO,CAAC,gBAAgB;IAOxB;;OAEG;IACH,kBAAkB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,EAAE;IAOhD;;OAEG;IACH,yBAAyB,CAAC,KAAK,GAAE,MAAY,GAAG,OAAO,EAAE;IAOzD;;OAEG;IACH,wBAAwB,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,IAAI;IAOpD;;OAEG;IACH,iBAAiB,CAAC,KAAK,GAAE,MAAW,GAAG,KAAK,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,IAAI,CAAA;KAAE,CAAC;IAgBhH,OAAO,CAAC,YAAY;IAcpB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,KAAK,CAAC,MAAM,GAAG;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAkBhF,OAAO,CAAC,eAAe;IAavB,YAAY,CACV,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,EACpB,QAAQ,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAW,GAC9C,MAAM;IAUT,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAKpC,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAU7C;;;OAGG;IACH,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,GAAE,MAAY,GAAG,MAAM,GAAG,IAAI;IA+BvE;;;OAGG;IACH,OAAO,CAAC,uBAAuB;IA4C/B;;OAEG;IACH,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG;QAAE,iBAAiB,EAAE,MAAM,CAAC;QAAC,cAAc,EAAE,MAAM,CAAA;KAAE;IAgCxG;;OAEG;IACH,qBAAqB,IAAI,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,mBAAmB,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAoCjF,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE;IAgB9D,YAAY,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,KAAK,GAAE,MAAY,GAAG,MAAM,EAAE;IAiBlE,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAMjC,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAA;KAAE,GAAG,MAAM,GAAG,IAAI;IAc1F,cAAc,CACZ,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,cAAc,GAAE,MAAM,GAAG,IAAW,EACpC,UAAU,GAAE,MAAY,GACvB,WAAW;IAUd,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI;IAK9C,qBAAqB,CAAC,QAAQ,EAAE,MAAM,EAAE,cAAc,GAAE,OAAe,GAAG,WAAW,EAAE;IAYvF,iBAAiB,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAOnC,cAAc,CACZ,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,MAAM,EAClB,IAAI,EAAE,MAAM,EACZ,UAAU,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAW,GAChD,QAAQ;IAUX,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI;IAKxC,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,GAAE,MAAM,GAAG,IAAI,GAAG,MAAe,GAAG,QAAQ,EAAE;IAiB5F,YAAY,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI;IActF,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQnC,QAAQ,CACN,aAAa,EAAE,MAAM,EACrB,KAAK,GAAE,MAAU,EACjB,aAAa,CAAC,EAAE,MAAM,EAAE,GACvB;QAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,WAAW,EAAE,CAAA;KAAE;IA2C7E,YAAY,CACV,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,eAAe,EAAE,MAAM,EAAE,EACzB,OAAO,GAAE;QACP,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,WAAW,CAAC,EAAE,IAAI,CAAC;QACnB,SAAS,CAAC,EAAE,IAAI,CAAC;KACb,GACL,MAAM;IA4BT,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAKpC,UAAU,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,KAAK,GAAE,MAAY,GAAG,MAAM,EAAE;IAgBzD,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAU5C,yBAAyB,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,GAAE,MAAY,GAAG,MAAM,EAAE;IAoBtE,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQjC,mBAAmB,CACjB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,MAAM,EACnB,QAAQ,CAAC,EAAE,MAAM,GAChB,aAAa;IAUhB,gBAAgB,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI;IAKlD,iBAAiB,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,KAAK,GAAE,MAAY,GAAG,aAAa,EAAE;IAgB3E,oBAAoB,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,OAAO;IAU7D,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQxC,QAAQ,IAAI;QACV,QAAQ,EAAE,MAAM,CAAC;QACjB,QAAQ,EAAE,MAAM,CAAC;QACjB,SAAS,EAAE,MAAM,CAAC;QAClB,YAAY,EAAE,MAAM,CAAC;QACrB,OAAO,EAAE,MAAM,CAAC;QAChB,cAAc,EAAE,MAAM,CAAC;QACvB,QAAQ,EAAE,MAAM,CAAC;QACjB,uBAAuB,EAAE,MAAM,CAAC;KACjC;IA4BD,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,OAAO,CAAC,IAAI;IASZ,OAAO,CAAC,WAAW;IAgBnB,OAAO,CAAC,WAAW;IAUnB,OAAO,CAAC,gBAAgB;IAYxB,OAAO,CAAC,aAAa;IAWrB,OAAO,CAAC,WAAW;IAcnB,OAAO,CAAC,kBAAkB;CAa3B"}
+{"version":3,"file":"database.d.ts","sourceRoot":"","sources":["../../src/storage/database.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAOH,MAAM,WAAW,MAAM;IACrB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,EAAE,IAAI,GAAG,IAAI,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,IAAI,GAAG,IAAI,CAAC;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,GAAG,WAAW,CAAC;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,IAAI,CAAC;IAChB,YAAY,EAAE,OAAO,CAAC;CACvB;AAED,MAAM,WAAW,MAAM;IACrB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,GAAG,OAAO,GAAG,SAAS,GAAG,OAAO,GAAG,cAAc,CAAC;IAChE,UAAU,EAAE,IAAI,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;CAC1C;AAED,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,IAAI,CAAC;IACjB,WAAW,EAAE,IAAI,GAAG,IAAI,CAAC;CAC1B;AAED,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IAC3C,UAAU,EAAE,IAAI,CAAC;CAClB;AAED,MAAM,WAAW,MAAM;IACrB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,IAAI,CAAC;IACjB,YAAY,EAAE,IAAI,CAAC;IACnB,UAAU,EAAE,IAAI,CAAC;CAClB;AAED,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,OAAO,CAAC;IAClB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,UAAU,EAAE,IAAI,CAAC;IACjB,WAAW,EAAE,IAAI,GAAG,IAAI,CAAC;CAC1B;AAED;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,IAAI,GAAG,IAAI,CAAC;IACxB,UAAU,EAAE,IAAI,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,UAAU,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAC5B,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,EAAE,IAAI,CAAC;IAChB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,qBAAa,cAAc;IACzB,OAAO,CAAC,EAAE,CAAoB;IAC9B,OAAO,CAAC,SAAS,CAA8C;gBAEnD,MAAM,EAAE,MAAM;IAoB1B,OAAO,CAAC,UAAU;IAuMlB;;OAEG;IACH,OAAO,CAAC,aAAa;IAqBrB,YAAY,CACV,OAAO,EAAE,MAAM,EACf,MAAM,GAAE,MAAuB,EAC/B,UAAU,GAAE,MAAY,EACxB,OAAO,GAAE;QACP,SAAS,CAAC,EAAE,IAAI,CAAC;QACjB,eAAe,CAAC,EAAE,MAAM,CAAC;KACrB,GACL,MAAM;IAkBT,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAKpC,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,YAAY,GAAG,UAAU,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI;IAyB9G,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAMjC;;;OAGG;IACH,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAW7B,cAAc,CAAC,KAAK,GAAE,MAAa,EAAE,eAAe,GAAE,OAAe,EAAE,MAAM,GAAE,MAAU,GAAG,MAAM,EAAE;IAUpG;;OAEG;IACH,aAAa,CACX,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,GAAG,WAAW,EAC1B,OAAO,EAAE,MAAM,EACf,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO;IAcV,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,GAAG,IAAI;IAKtC,OAAO,CAAC,gBAAgB;IAOxB;;OAEG;IACH,kBAAkB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,EAAE;IAOhD;;OAEG;IACH,yBAAyB,CAAC,KAAK,GAAE,MAAY,GAAG,OAAO,EAAE;IAOzD;;OAEG;IACH,wBAAwB,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,IAAI;IAOpD;;OAEG;IACH,iBAAiB,CAAC,KAAK,GAAE,MAAW,GAAG,KAAK,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,IAAI,CAAA;KAAE,CAAC;IAgBhH,OAAO,CAAC,YAAY;IAcpB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,KAAK,CAAC,MAAM,GAAG;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAkBhF,OAAO,CAAC,eAAe;IAavB,YAAY,CACV,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,EACpB,QAAQ,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAW,GAC9C,MAAM;IAUT,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAKpC,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAU7C;;;OAGG;IACH,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,GAAE,MAAY,GAAG,MAAM,GAAG,IAAI;IA+BvE;;;OAGG;IACH,OAAO,CAAC,uBAAuB;IA4C/B;;OAEG;IACH,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG;QAAE,iBAAiB,EAAE,MAAM,CAAC;QAAC,cAAc,EAAE,MAAM,CAAA;KAAE;IAgCxG;;OAEG;IACH,qBAAqB,IAAI,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,mBAAmB,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAoCjF,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE;IAgB9D,YAAY,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,KAAK,GAAE,MAAY,GAAG,MAAM,EAAE;IAiBlE,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAMjC,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAA;KAAE,GAAG,MAAM,GAAG,IAAI;IAc1F,cAAc,CACZ,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,cAAc,GAAE,MAAM,GAAG,IAAW,EACpC,UAAU,GAAE,MAAY,GACvB,WAAW;IAUd,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI;IAK9C,qBAAqB,CAAC,QAAQ,EAAE,MAAM,EAAE,cAAc,GAAE,OAAe,GAAG,WAAW,EAAE;IAYvF,iBAAiB,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAOnC,cAAc,CACZ,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,MAAM,EAClB,IAAI,EAAE,MAAM,EACZ,UAAU,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAW,GAChD,QAAQ;IAUX,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI;IAKxC,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,GAAE,MAAM,GAAG,IAAI,GAAG,MAAe,GAAG,QAAQ,EAAE;IAiB5F,YAAY,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI;IActF,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQnC,QAAQ,CACN,aAAa,EAAE,MAAM,EACrB,KAAK,GAAE,MAAU,EACjB,aAAa,CAAC,EAAE,MAAM,EAAE,GACvB;QAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,WAAW,EAAE,CAAA;KAAE;IA2C7E,YAAY,CACV,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,eAAe,EAAE,MAAM,EAAE,EACzB,OAAO,GAAE;QACP,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,WAAW,CAAC,EAAE,IAAI,CAAC;QACnB,SAAS,CAAC,EAAE,IAAI,CAAC;KACb,GACL,MAAM;IA4BT,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAKpC,UAAU,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,KAAK,GAAE,MAAY,GAAG,MAAM,EAAE;IAgBzD,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAU5C,yBAAyB,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,GAAE,MAAY,GAAG,MAAM,EAAE;IAoBtE,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQjC,mBAAmB,CACjB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,MAAM,EACnB,QAAQ,CAAC,EAAE,MAAM,GAChB,aAAa;IAUhB,gBAAgB,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI;IAKlD,iBAAiB,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,KAAK,GAAE,MAAY,GAAG,aAAa,EAAE;IAgB3E,oBAAoB,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,OAAO;IAU7D,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQxC;;;OAGG;IACH,qBAAqB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,gBAAgB;IAqBzE,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,gBAAgB,GAAG,IAAI;IAKlD;;OAEG;IACH,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,GAAE,MAAU,GAAG,gBAAgB,EAAE;IASnF;;OAEG;IACH,qBAAqB,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,WAAW,GAAE,MAAY,EAAE,KAAK,GAAE,MAAW,GAAG,MAAM,EAAE;IAoBnG;;OAEG;IACH,iBAAiB,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI;IAqB5C;;;OAGG;IACH,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI;IA6BzC;;OAEG;IACH,gBAAgB,CAAC,aAAa,GAAE,MAAW,EAAE,WAAW,GAAE,MAAY,GAAG,MAAM;IAkB/E;;OAEG;IACH,kBAAkB,CAChB,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,MAAM,EAAE,GAClB,YAAY;IASf,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI;IAKtD;;OAEG;IACH,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,OAAO,GAAG,OAAO;IAS1F;;OAEG;IACH,2BAA2B,CAAC,KAAK,GAAE,MAAY,GAAG,YAAY,EAAE;IAUhE;;OAEG;IACH,0BAA0B,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI;IAQ/C;;OAEG;IACH,oBAAoB,CAAC,OAAO,GAAE,MAAU,GAAG,MAAM;IAUjD,QAAQ,IAAI;QACV,QAAQ,EAAE,MAAM,CAAC;QACjB,QAAQ,EAAE,MAAM,CAAC;QACjB,SAAS,EAAE,MAAM,CAAC;QAClB,YAAY,EAAE,MAAM,CAAC;QACrB,OAAO,EAAE,MAAM,CAAC;QAChB,cAAc,EAAE,MAAM,CAAC;QACvB,QAAQ,EAAE,MAAM,CAAC;QACjB,uBAAuB,EAAE,MAAM,CAAC;KACjC;IA4BD,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,OAAO,CAAC,IAAI;IASZ,OAAO,CAAC,WAAW;IAgBnB,OAAO,CAAC,WAAW;IAUnB,OAAO,CAAC,gBAAgB;IAYxB,OAAO,CAAC,aAAa;IAWrB,OAAO,CAAC,WAAW;IAcnB,OAAO,CAAC,kBAAkB;IAc1B,OAAO,CAAC,eAAe;IAavB,OAAO,CAAC,iBAAiB;CAa1B"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@199-bio/engram",
-  "version": "0.7.4",
+  "version": "0.8.0",
   "description": "Give Claude a perfect memory. Local-first MCP server with hybrid search.",
   "type": "module",
   "main": "dist/index.js",

package/src/consolidation/consolidator.ts

@@ -596,6 +596,8 @@ Respond with JSON only.`;
     memoriesCreated: number;
     digestsCreated: number;
     contradictionsFound: number;
+    connectionsDecayed: number;
+    logsCleanedUp: number;
   }> {
     console.error("[Consolidator] Starting sleep cycle...");
 
@@ -607,11 +609,21 @@ Respond with JSON only.`;
     const memoryResult = await this.consolidate();
     console.error(`[Consolidator] Memories: ${memoryResult.memoriesProcessed} → ${memoryResult.digestsCreated} digests`);
 
+    // Step 3: Decay unused Hebbian connections (memories that haven't fired together recently)
+    const connectionsDecayed = this.db.decayConnections(30, 0.9);
+    console.error(`[Consolidator] Connections decayed: ${connectionsDecayed}`);
+
+    // Step 4: Clean up old retrieval logs
+    const logsCleanedUp = this.db.cleanupRetrievalLogs(7);
+    console.error(`[Consolidator] Retrieval logs cleaned: ${logsCleanedUp}`);
+
     return {
       episodesProcessed: episodeResult.episodesProcessed,
       memoriesCreated: episodeResult.memoriesCreated,
       digestsCreated: memoryResult.digestsCreated,
       contradictionsFound: memoryResult.contradictionsFound,
+      connectionsDecayed,
+      logsCleanedUp,
     };
   }
 }

package/src/index.ts

@@ -76,7 +76,7 @@ async function initialize(): Promise<void> {
 const server = new Server(
   {
     name: "engram",
-    version: "0.7.2",
+    version: "0.8.0",
   },
   {
     capabilities: {
@@ -280,6 +280,37 @@ const TOOLS = [
       openWorldHint: true,  // Calls Anthropic API for consolidation
     },
   },
+  {
+    name: "memory_feedback",
+    description: "Signal which memories from a recall were actually useful. Call AFTER using memories to answer user's question. This enables the memory system to learn which memories help together (Hebbian learning). Optional but improves memory quality over time.",
+    inputSchema: {
+      type: "object" as const,
+      properties: {
+        recall_id: {
+          type: "string",
+          description: "The recall_id from the recall response",
+        },
+        useful_memory_ids: {
+          type: "array",
+          items: { type: "string" },
+          description: "IDs of memories that actually helped answer the question. Empty array if none were useful.",
+        },
+        need_more: {
+          type: "boolean",
+          description: "Set true if the memories were insufficient and you need a deeper search with more results",
+          default: false,
+        },
+      },
+      required: ["recall_id", "useful_memory_ids"],
+    },
+    annotations: {
+      title: "Memory Feedback",
+      readOnlyHint: false,
+      destructiveHint: false,
+      idempotentHint: true,
+      openWorldHint: false,
+    },
+  },
 ];
 
 // List available tools
@@ -366,12 +397,12 @@ server.setRequestHandler(CallToolRequestSchema, async (request) => {
           include_graph?: boolean;
         };
 
-        const results = await search.search(query, {
+        const response = await search.search(query, {
           limit,
           includeGraph: include_graph,
         });
 
-        const formatted = results.map((r) => ({
+        const formatted = response.results.map((r) => ({
           id: r.memory.id,
           content: r.memory.content,
           source: r.memory.source,
@@ -384,14 +415,25 @@ server.setRequestHandler(CallToolRequestSchema, async (request) => {
             .join(", "),
         }));
 
+        // Format connected memories (Hebbian associations)
+        const connectedFormatted = response.connected_memories.map((c) => ({
+          id: c.memory.id,
+          content: c.memory.content,
+          connected_to: c.connected_to,
+          connection_strength: c.strength.toFixed(2),
+        }));
+
         return {
           content: [
             {
               type: "text" as const,
               text: JSON.stringify({
+                recall_id: response.recall_id,  // For memory_feedback
                 query,
                 results: formatted,
                 count: formatted.length,
+                connected_memories: connectedFormatted,
+                hint: formatted.length > 0 ? "Call memory_feedback with useful_memory_ids after answering" : undefined,
               }, null, 2),
             },
           ],
@@ -575,6 +617,95 @@ server.setRequestHandler(CallToolRequestSchema, async (request) => {
         };
       }
 
+      case "memory_feedback": {
+        const { recall_id, useful_memory_ids, need_more = false } = args as {
+          recall_id: string;
+          useful_memory_ids: string[];
+          need_more?: boolean;
+        };
+
+        // Update the retrieval log with feedback
+        const updated = db.updateRetrievalFeedback(recall_id, useful_memory_ids, need_more);
+
+        if (!updated) {
+          return {
+            content: [
+              {
+                type: "text" as const,
+                text: JSON.stringify({
+                  success: false,
+                  error: `Recall ID not found: ${recall_id}`,
+                }),
+              },
+            ],
+          };
+        }
+
+        // If need_more is set, do an expanded search
+        if (need_more) {
+          const expandedResponse = await search.expandSearch(recall_id);
+
+          const formatted = expandedResponse.results.map((r) => ({
+            id: r.memory.id,
+            content: r.memory.content,
+            source: r.memory.source,
+            timestamp: r.memory.timestamp.toISOString(),
+            relevance_score: r.score.toFixed(4),
+            matched_via: Object.entries(r.sources)
+              .filter(([, v]) => v !== undefined)
+              .map(([k]) => k)
+              .join(", "),
+          }));
+
+          return {
+            content: [
+              {
+                type: "text" as const,
+                text: JSON.stringify({
+                  success: true,
+                  feedback_recorded: true,
+                  useful_count: useful_memory_ids.length,
+                  expanded_search: true,
+                  additional_results: formatted,
+                  additional_count: formatted.length,
+                }, null, 2),
+              },
+            ],
+          };
+        }
+
+        // Process deferred learning if we have enough feedback
+        const unprocessed = db.getUnprocessedRetrievalLogs(50);
+        let learningApplied = 0;
+
+        for (const log of unprocessed) {
+          if (log.useful_ids && log.useful_ids.length >= 2) {
+            // Strengthen connections between useful memories
+            db.recordCoUseful(log.useful_ids);
+            learningApplied++;
+          }
+        }
+
+        if (unprocessed.length > 0) {
+          db.markRetrievalLogsProcessed(unprocessed.map(l => l.id));
+        }
+
+        return {
+          content: [
+            {
+              type: "text" as const,
+              text: JSON.stringify({
+                success: true,
+                feedback_recorded: true,
+                useful_count: useful_memory_ids.length,
+                learning_applied: learningApplied > 0,
+                connections_strengthened: learningApplied,
+              }, null, 2),
+            },
+          ],
+        };
+      }
+
       default:
         throw new Error(`Unknown tool: ${name}`);
     }

package/src/retrieval/hybrid.ts

@@ -16,9 +16,20 @@ export interface HybridSearchResult {
     bm25?: number;
     semantic?: number;
     graph?: number;
+    connected?: number;  // Rank from Hebbian connections
   };
 }
 
+export interface HybridSearchResponse {
+  results: HybridSearchResult[];
+  recall_id: string;  // For LLM feedback
+  connected_memories: Array<{
+    memory: Memory;
+    connected_to: string;  // ID of the memory it's connected to
+    strength: number;
+  }>;
+}
+
 /**
  * Calculate Ebbinghaus forgetting curve retention
  * R = e^(-t/S) where t=time since last access, S=stability
@@ -74,11 +85,23 @@ function adjustScore(memory: Memory, baseScore: number, now: Date): { adjusted:
 }
 
 export class HybridSearch {
+  private sessionId: string;
+
   constructor(
     private db: EngramDatabase,
     private graph: KnowledgeGraph,
     private retriever: ColBERTRetriever | SimpleRetriever
-  ) {}
+  ) {
+    // Generate a session ID for this search instance
+    this.sessionId = `session_${Date.now()}_${Math.random().toString(36).slice(2, 8)}`;
+  }
+
+  /**
+   * Generate a unique recall ID for tracking
+   */
+  private generateRecallId(): string {
+    return `recall_${Date.now()}_${Math.random().toString(36).slice(2, 8)}`;
+  }
 
   /**
    * Search using all available methods and fuse results
@@ -91,21 +114,36 @@ export class HybridSearch {
     options: {
       limit?: number;
       includeGraph?: boolean;
+      includeConnections?: boolean;  // Include Hebbian-connected memories
+      connectionBudget?: number;     // How many results to allocate to connections (default: 30%)
+      minConnectionStrength?: number; // Minimum strength to include connections
       bm25Weight?: number;
       semanticWeight?: number;
       graphWeight?: number;
-      useReranking?: boolean;  // Use ColBERT to rerank BM25 results
+      connectionWeight?: number;     // Weight for connected memories in RRF
+      useReranking?: boolean;        // Use ColBERT to rerank BM25 results
     } = {}
-  ): Promise<HybridSearchResult[]> {
+  ): Promise<HybridSearchResponse> {
     const {
       limit = 10,
       includeGraph = true,
+      includeConnections = true,
+      connectionBudget = 0.3,        // 30% of results can be connected memories
+      minConnectionStrength = 0.3,
       bm25Weight = 1.0,
       semanticWeight = 1.0,
       graphWeight = 0.3,
-      useReranking = true,  // Default: reranking mode for better quality
+      connectionWeight = 0.5,
+      useReranking = true,
     } = options;
 
+    // Generate recall_id for tracking
+    const recallId = this.generateRecallId();
+
+    // Calculate budgets: 70% direct results, 30% connected
+    const directBudget = Math.ceil(limit * (1 - connectionBudget));
+    const connectedBudget = limit - directBudget;
+
     // Fetch more candidates than needed for fusion
     const candidateLimit = Math.max(limit * 3, 30);
 
@@ -139,11 +177,15 @@ export class HybridSearch {
     graphMemories.forEach(m => allCandidateIds.add(m.id));
 
     if (allCandidateIds.size === 0) {
-      return [];
+      return {
+        results: [],
+        recall_id: recallId,
+        connected_memories: [],
+      };
     }
 
     // Create rankings for RRF
-    const rankings: Map<string, { bm25?: number; semantic?: number; graph?: number }> = new Map();
+    const rankings: Map<string, { bm25?: number; semantic?: number; graph?: number; connected?: number }> = new Map();
 
     // BM25 ranking
     bm25Results.forEach((result, rank) => {
@@ -168,7 +210,7 @@ export class HybridSearch {
 
     // Calculate RRF scores
     const k = 60; // RRF constant
-    const rrfScores: Array<{ id: string; score: number; sources: typeof rankings extends Map<string, infer V> ? V : never }> = [];
+    const rrfScores: Array<{ id: string; score: number; sources: { bm25?: number; semantic?: number; graph?: number; connected?: number } }> = [];
 
     for (const [id, ranks] of rankings) {
       let score = 0;
@@ -204,11 +246,7 @@ export class HybridSearch {
           score: adjusted,
           retention,
           originalScore: score,
-          sources: {
-            bm25: sources.bm25,
-            semantic: sources.semantic,
-            graph: sources.graph,
-          },
+          sources,
         });
       }
     }
@@ -216,9 +254,44 @@ export class HybridSearch {
     // Re-sort by adjusted score (accounts for recency/stability)
     adjustedResults.sort((a, b) => b.score - a.score);
 
-    // Take top results and update access counts
+    // Take top direct results
+    const directResults = adjustedResults.slice(0, directBudget);
+    const directIds = directResults.map(r => r.memory.id);
+
+    // Find Hebbian-connected memories (not already in direct results)
+    let connectedMemories: Array<{ memory: Memory; connected_to: string; strength: number }> = [];
+    if (includeConnections && directIds.length > 0) {
+      const connectedIds = this.db.getConnectedMemoryIds(directIds, minConnectionStrength, connectedBudget * 2);
+
+      for (const connId of connectedIds) {
+        if (directIds.includes(connId)) continue;
+
+        const memory = this.db.getMemory(connId);
+        if (!memory) continue;
+
+        // Find which direct result this is connected to
+        const connections = this.db.getMemoryConnections(connId, minConnectionStrength);
+        const connectedTo = connections.find(c =>
+          directIds.includes(c.memory_a === connId ? c.memory_b : c.memory_a)
+        );
+
+        if (connectedTo) {
+          connectedMemories.push({
+            memory,
+            connected_to: connectedTo.memory_a === connId ? connectedTo.memory_b : connectedTo.memory_a,
+            strength: connectedTo.strength,
+          });
+        }
+      }
+
+      // Sort by strength and limit
+      connectedMemories.sort((a, b) => b.strength - a.strength);
+      connectedMemories = connectedMemories.slice(0, connectedBudget);
+    }
+
+    // Build final results (direct + space for connected)
     const results: HybridSearchResult[] = [];
-    for (const result of adjustedResults.slice(0, limit)) {
+    for (const result of directResults) {
       // Update access count (which also increases stability for future searches)
       this.db.touchMemory(result.memory.id);
 
@@ -230,7 +303,71 @@ export class HybridSearch {
       });
     }
 
-    return results;
+    // Add connected memories to results with their own scores
+    for (const { memory, strength } of connectedMemories) {
+      const baseScore = strength * connectionWeight;
+      const { adjusted, retention } = adjustScore(memory, baseScore, now);
+
+      this.db.touchMemory(memory.id);
+
+      results.push({
+        memory,
+        score: adjusted,
+        retention,
+        sources: { connected: 1 },
+      });
+    }
+
+    // Track co-retrieval for Hebbian learning (all result IDs)
+    const allResultIds = results.map(r => r.memory.id);
+    if (allResultIds.length >= 2) {
+      this.db.recordCoRetrieval(allResultIds);
+    }
+
+    // Log this retrieval for deferred learning
+    try {
+      this.db.createRetrievalLog(this.sessionId, recallId, query, allResultIds);
+    } catch {
+      // Ignore duplicate recall_id errors (can happen with rapid queries)
+    }
+
+    return {
+      results,
+      recall_id: recallId,
+      connected_memories: connectedMemories,
+    };
+  }
+
+  /**
+   * Expanded search when LLM needs more memories
+   * Relaxes constraints and follows weaker connections
+   */
+  async expandSearch(
+    recallId: string,
+    options: { additionalLimit?: number } = {}
+  ): Promise<HybridSearchResponse> {
+    const { additionalLimit = 10 } = options;
+
+    // Get the original retrieval log
+    const log = this.db.getRetrievalLog(recallId);
+    if (!log) {
+      return { results: [], recall_id: recallId, connected_memories: [] };
+    }
+
+    // Search again with relaxed parameters
+    const response = await this.search(log.query, {
+      limit: additionalLimit + log.memory_ids.length,
+      includeConnections: true,
+      minConnectionStrength: 0.1,  // Lower threshold
+      connectionBudget: 0.5,       // More connected memories
+    });
+
+    // Filter out memories already returned
+    const existingIds = new Set(log.memory_ids);
+    response.results = response.results.filter(r => !existingIds.has(r.memory.id));
+    response.connected_memories = response.connected_memories.filter(c => !existingIds.has(c.memory.id));
+
+    return response;
   }
 
   /**

package/src/storage/database.ts

@@ -87,6 +87,38 @@ export interface Contradiction {
   resolved_at: Date | null;
 }
 
+/**
+ * Hebbian connection between two memories
+ * "Neurons that fire together, wire together"
+ * Strength increases when memories are useful TOGETHER, not just co-retrieved
+ */
+export interface MemoryConnection {
+  id: string;
+  memory_a: string;
+  memory_b: string;
+  strength: number;        // 0-1, how strongly connected
+  co_retrievals: number;   // Times retrieved together
+  co_useful: number;       // Times BOTH were useful together (from LLM feedback)
+  last_fired: Date | null; // Last time this connection was activated
+  created_at: Date;
+}
+
+/**
+ * Log of retrieval sessions for deferred learning
+ * We don't update connections immediately - we batch process after N turns
+ */
+export interface RetrievalLog {
+  id: string;
+  session_id: string;
+  recall_id: string;       // Unique ID for this recall operation
+  query: string;
+  memory_ids: string[];    // All memories retrieved
+  useful_ids: string[] | null; // From LLM feedback (null = no feedback yet)
+  need_more: boolean;      // LLM requested more memories
+  timestamp: Date;
+  processed: boolean;      // Has this been used for learning?
+}
+
 export class EngramDatabase {
   private db: Database.Database;
   private stmtCache: Map<string, Database.Statement> = new Map();
@@ -269,6 +301,45 @@ export class EngramDatabase {
       CREATE INDEX IF NOT EXISTS idx_contradictions_entity ON contradictions(entity_id);
       CREATE INDEX IF NOT EXISTS idx_contradictions_resolved ON contradictions(resolved);
     `);
+
+    // Memory connections table (Hebbian learning)
+    // "Neurons that fire together, wire together"
+    this.db.exec(`
+      CREATE TABLE IF NOT EXISTS memory_connections (
+        id TEXT PRIMARY KEY,
+        memory_a TEXT NOT NULL REFERENCES memories(id) ON DELETE CASCADE,
+        memory_b TEXT NOT NULL REFERENCES memories(id) ON DELETE CASCADE,
+        strength REAL DEFAULT 0.1,
+        co_retrievals INTEGER DEFAULT 0,
+        co_useful INTEGER DEFAULT 0,
+        last_fired DATETIME,
+        created_at DATETIME DEFAULT CURRENT_TIMESTAMP,
+        UNIQUE(memory_a, memory_b)
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_connections_memory_a ON memory_connections(memory_a);
+      CREATE INDEX IF NOT EXISTS idx_connections_memory_b ON memory_connections(memory_b);
+      CREATE INDEX IF NOT EXISTS idx_connections_strength ON memory_connections(strength);
+    `);
+
+    // Retrieval logs for deferred learning
+    this.db.exec(`
+      CREATE TABLE IF NOT EXISTS retrieval_logs (
+        id TEXT PRIMARY KEY,
+        session_id TEXT NOT NULL,
+        recall_id TEXT NOT NULL UNIQUE,
+        query TEXT NOT NULL,
+        memory_ids TEXT NOT NULL,
+        useful_ids TEXT,
+        need_more INTEGER DEFAULT 0,
+        timestamp DATETIME DEFAULT CURRENT_TIMESTAMP,
+        processed INTEGER DEFAULT 0
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_retrieval_logs_session ON retrieval_logs(session_id);
+      CREATE INDEX IF NOT EXISTS idx_retrieval_logs_recall ON retrieval_logs(recall_id);
+      CREATE INDEX IF NOT EXISTS idx_retrieval_logs_processed ON retrieval_logs(processed);
+    `);
   }
 
   /**
@@ -1043,6 +1114,220 @@ export class EngramDatabase {
     return result.changes > 0;
   }
 
+  // ============ Memory Connections (Hebbian Learning) ============
+
+  /**
+   * Get or create a connection between two memories
+   * Always stores with smaller ID first for consistency
+   */
+  getOrCreateConnection(memoryA: string, memoryB: string): MemoryConnection {
+    // Normalize order: smaller ID always first
+    const [a, b] = memoryA < memoryB ? [memoryA, memoryB] : [memoryB, memoryA];
+
+    const existing = this.stmt(
+      "SELECT * FROM memory_connections WHERE memory_a = ? AND memory_b = ?"
+    ).get(a, b) as Record<string, unknown> | undefined;
+
+    if (existing) {
+      return this.rowToConnection(existing);
+    }
+
+    const id = randomUUID();
+    this.db.prepare(`
+      INSERT INTO memory_connections (id, memory_a, memory_b)
+      VALUES (?, ?, ?)
+    `).run(id, a, b);
+
+    return this.getConnection(id)!;
+  }
+
+  getConnection(id: string): MemoryConnection | null {
+    const row = this.stmt("SELECT * FROM memory_connections WHERE id = ?").get(id) as Record<string, unknown> | undefined;
+    return row ? this.rowToConnection(row) : null;
+  }
+
+  /**
+   * Get all connections for a memory
+   */
+  getMemoryConnections(memoryId: string, minStrength: number = 0): MemoryConnection[] {
+    const rows = this.stmt(`
+      SELECT * FROM memory_connections
+      WHERE (memory_a = ? OR memory_b = ?) AND strength >= ?
+      ORDER BY strength DESC
+    `).all(memoryId, memoryId, minStrength) as Record<string, unknown>[];
+    return rows.map(r => this.rowToConnection(r));
+  }
+
+  /**
+   * Get connected memory IDs for a set of memories
+   */
+  getConnectedMemoryIds(memoryIds: string[], minStrength: number = 0.3, limit: number = 10): string[] {
+    if (memoryIds.length === 0) return [];
+
+    const placeholders = memoryIds.map(() => "?").join(",");
+    const rows = this.db.prepare(`
+      SELECT DISTINCT
+        CASE WHEN memory_a IN (${placeholders}) THEN memory_b ELSE memory_a END as connected_id,
+        strength
+      FROM memory_connections
+      WHERE (memory_a IN (${placeholders}) OR memory_b IN (${placeholders}))
+        AND strength >= ?
+      ORDER BY strength DESC
+      LIMIT ?
+    `).all(...memoryIds, ...memoryIds, ...memoryIds, minStrength, limit) as Array<{ connected_id: string; strength: number }>;
+
+    // Filter out memories that are already in the input set
+    const inputSet = new Set(memoryIds);
+    return rows.map(r => r.connected_id).filter(id => !inputSet.has(id));
+  }
+
+  /**
+   * Record that memories were retrieved together (co-retrieval)
+   */
+  recordCoRetrieval(memoryIds: string[]): void {
+    if (memoryIds.length < 2) return;
+
+    // Update all pairs
+    for (let i = 0; i < memoryIds.length; i++) {
+      for (let j = i + 1; j < memoryIds.length; j++) {
+        const [a, b] = memoryIds[i] < memoryIds[j]
+          ? [memoryIds[i], memoryIds[j]]
+          : [memoryIds[j], memoryIds[i]];
+
+        this.db.prepare(`
+          INSERT INTO memory_connections (id, memory_a, memory_b, co_retrievals, last_fired)
+          VALUES (?, ?, ?, 1, CURRENT_TIMESTAMP)
+          ON CONFLICT(memory_a, memory_b) DO UPDATE SET
+            co_retrievals = co_retrievals + 1,
+            last_fired = CURRENT_TIMESTAMP
+        `).run(randomUUID(), a, b);
+      }
+    }
+  }
+
+  /**
+   * Record that memories were useful together (from LLM feedback)
+   * This is what actually strengthens connections
+   */
+  recordCoUseful(memoryIds: string[]): void {
+    if (memoryIds.length < 2) return;
+
+    for (let i = 0; i < memoryIds.length; i++) {
+      for (let j = i + 1; j < memoryIds.length; j++) {
+        const [a, b] = memoryIds[i] < memoryIds[j]
+          ? [memoryIds[i], memoryIds[j]]
+          : [memoryIds[j], memoryIds[i]];
+
+        // Get current stats to calculate new strength
+        const conn = this.getOrCreateConnection(a, b);
+        const newCoUseful = conn.co_useful + 1;
+        const newCoRetrievals = Math.max(conn.co_retrievals, newCoUseful);
+
+        // Calculate strength with diminishing returns
+        const usefulRatio = newCoUseful / Math.max(1, newCoRetrievals);
+        const diminished = Math.sqrt(usefulRatio);
+        const confidence = Math.min(1, newCoUseful / 3); // Require 3+ co-useful for strong connection
+        const newStrength = diminished * confidence;
+
+        this.db.prepare(`
+          UPDATE memory_connections
+          SET co_useful = ?, strength = ?, last_fired = CURRENT_TIMESTAMP
+          WHERE memory_a = ? AND memory_b = ?
+        `).run(newCoUseful, newStrength, a, b);
+      }
+    }
+  }
+
+  /**
+   * Decay unused connections (called during consolidation)
+   */
+  decayConnections(daysThreshold: number = 30, decayFactor: number = 0.9): number {
+    const result = this.db.prepare(`
+      UPDATE memory_connections
+      SET strength = strength * ?
+      WHERE last_fired < datetime('now', '-' || ? || ' days')
+        AND strength > 0.05
+    `).run(decayFactor, daysThreshold);
+
+    // Clean up very weak connections
+    this.db.prepare(`
+      DELETE FROM memory_connections WHERE strength < 0.05
+    `).run();
+
+    return result.changes;
+  }
+
+  // ============ Retrieval Logs (Deferred Learning) ============
+
+  /**
+   * Log a retrieval for later learning
+   */
+  createRetrievalLog(
+    sessionId: string,
+    recallId: string,
+    query: string,
+    memoryIds: string[]
+  ): RetrievalLog {
+    const id = randomUUID();
+    this.db.prepare(`
+      INSERT INTO retrieval_logs (id, session_id, recall_id, query, memory_ids)
+      VALUES (?, ?, ?, ?, ?)
+    `).run(id, sessionId, recallId, query, JSON.stringify(memoryIds));
+    return this.getRetrievalLog(recallId)!;
+  }
+
+  getRetrievalLog(recallId: string): RetrievalLog | null {
+    const row = this.stmt("SELECT * FROM retrieval_logs WHERE recall_id = ?").get(recallId) as Record<string, unknown> | undefined;
+    return row ? this.rowToRetrievalLog(row) : null;
+  }
+
+  /**
+   * Update retrieval log with LLM feedback
+   */
+  updateRetrievalFeedback(recallId: string, usefulIds: string[], needMore: boolean): boolean {
+    const result = this.db.prepare(`
+      UPDATE retrieval_logs
+      SET useful_ids = ?, need_more = ?
+      WHERE recall_id = ?
+    `).run(JSON.stringify(usefulIds), needMore ? 1 : 0, recallId);
+    return result.changes > 0;
+  }
+
+  /**
+   * Get unprocessed retrieval logs for learning
+   */
+  getUnprocessedRetrievalLogs(limit: number = 100): RetrievalLog[] {
+    const rows = this.stmt(`
+      SELECT * FROM retrieval_logs
+      WHERE processed = 0 AND useful_ids IS NOT NULL
+      ORDER BY timestamp ASC
+      LIMIT ?
+    `).all(limit) as Record<string, unknown>[];
+    return rows.map(r => this.rowToRetrievalLog(r));
+  }
+
+  /**
+   * Mark retrieval logs as processed
+   */
+  markRetrievalLogsProcessed(ids: string[]): void {
+    if (ids.length === 0) return;
+    const placeholders = ids.map(() => "?").join(",");
+    this.db.prepare(`
+      UPDATE retrieval_logs SET processed = 1 WHERE id IN (${placeholders})
+    `).run(...ids);
+  }
+
+  /**
+   * Clean up old retrieval logs
+   */
+  cleanupRetrievalLogs(daysOld: number = 7): number {
+    const result = this.db.prepare(`
+      DELETE FROM retrieval_logs
+      WHERE processed = 1 AND timestamp < datetime('now', '-' || ? || ' days')
+    `).run(daysOld);
+    return result.changes;
+  }
+
   // ============ Statistics ============
 
   getStats(): {
@@ -1174,4 +1459,31 @@ export class EngramDatabase {
       resolved_at: row.resolved_at ? new Date(row.resolved_at as string) : null,
     };
   }
+
+  private rowToConnection(row: Record<string, unknown>): MemoryConnection {
+    return {
+      id: row.id as string,
+      memory_a: row.memory_a as string,
+      memory_b: row.memory_b as string,
+      strength: row.strength as number,
+      co_retrievals: row.co_retrievals as number,
+      co_useful: row.co_useful as number,
+      last_fired: row.last_fired ? new Date(row.last_fired as string) : null,
+      created_at: new Date(row.created_at as string),
+    };
+  }
+
+  private rowToRetrievalLog(row: Record<string, unknown>): RetrievalLog {
+    return {
+      id: row.id as string,
+      session_id: row.session_id as string,
+      recall_id: row.recall_id as string,
+      query: row.query as string,
+      memory_ids: JSON.parse(row.memory_ids as string),
+      useful_ids: row.useful_ids ? JSON.parse(row.useful_ids as string) : null,
+      need_more: Boolean(row.need_more),
+      timestamp: new Date(row.timestamp as string),
+      processed: Boolean(row.processed),
+    };
+  }
 }

package/src/web/chat-handler.ts

@@ -669,15 +669,15 @@ export class ChatHandler {
         const query = input.query as string;
         const limit = (input.limit as number) || 10;
 
-        const results = await this.search.search(query, { limit });
+        const response = await this.search.search(query, { limit });
         return {
-          results: results.map((r) => ({
+          results: response.results.map((r) => ({
             id: r.memory.id,
             content: r.memory.content.substring(0, 300) + (r.memory.content.length > 300 ? "..." : ""),
             timestamp: r.memory.timestamp.toISOString(),
             score: r.score.toFixed(3),
           })),
-          count: results.length,
+          count: response.results.length,
         };
       }
 

package/src/web/server.ts

@@ -241,9 +241,9 @@ export class EngramWebServer {
       const offset = parseInt(url.searchParams.get("offset") || "0");
 
       if (query) {
-        const results = await this.search.search(query, { limit });
+        const response = await this.search.search(query, { limit });
         res.end(JSON.stringify({
-          memories: results.map(r => ({
+          memories: response.results.map(r => ({
             ...r.memory,
             score: r.score,
             sources: r.sources,