@getplumb/core 0.4.3 → 0.4.5

package/dist/memory-facts-search.js

@@ -0,0 +1,143 @@
+/**
+ * Memory facts hybrid search (Layer 2 retrieval).
+ *
+ * Pipeline (same as raw-log-search, but for memory_facts table):
+ *   1. BM25 keyword search over memory_facts content
+ *   2. KNN vector search via JS cosine similarity
+ *   3. Reciprocal Rank Fusion (RRF, k=60) merges both ranked lists
+ *   4. Apply MEMORY_FACT_BOOST (2.0×) to RRF scores
+ *   5. Return top-k by boosted score
+ *
+ * Search is cross-session: no session filter is applied.
+ * The caller (LocalStore) passes its internal db handle — no separate DB connection.
+ */
+import { Bm25 } from './bm25.js';
+import { embedQuery } from './embedder.js';
+import { knnSearch, deserializeEmbedding } from './vector-search.js';
+import { scoreMemoryFact } from './scorer.js';
+// RRF constant (standard k=60; higher = less weight on top-1 rank).
+const RRF_K = 60;
+// ─── Helpers ──────────────────────────────────────────────────────────────────
+/**
+ * Merge two ranked lists via Reciprocal Rank Fusion.
+ * Each list entry is [id, score] ordered by descending relevance (rank 1 = index 0).
+ * Returns a map of id → rrf_score.
+ */
+function rrf(vecRanked, bm25Ranked) {
+    const scores = new Map();
+    for (let rank = 0; rank < vecRanked.length; rank++) {
+        const id = vecRanked[rank]?.[0];
+        if (id === undefined)
+            continue;
+        scores.set(id, (scores.get(id) ?? 0) + 1 / (RRF_K + rank + 1));
+    }
+    for (let rank = 0; rank < bm25Ranked.length; rank++) {
+        const id = bm25Ranked[rank]?.[0];
+        if (id === undefined)
+            continue;
+        scores.set(id, (scores.get(id) ?? 0) + 1 / (RRF_K + rank + 1));
+    }
+    return scores;
+}
+// ─── Public API ───────────────────────────────────────────────────────────────
+/**
+ * Hybrid search over memory_facts.
+ *
+ * @param db      The WASM SQLite Database instance
+ * @param userId  Scopes the search to this user's data
+ * @param query   Natural language query string
+ * @param limit   Number of results to return (default 10)
+ */
+export async function searchMemoryFacts(db, userId, query, limit = 10) {
+    // ── 1. Fetch all memory_facts rows (non-deleted, with embeddings) ────────
+    const stmt = db.prepare(`SELECT id, content, source_session_id, source_session_label, tags, created_at, vec_rowid
+     FROM memory_facts
+     WHERE user_id = ? AND deleted_at IS NULL AND embed_status = 'done'
+     ORDER BY created_at DESC`);
+    stmt.bind([userId]);
+    const allRows = [];
+    while (stmt.step()) {
+        allRows.push(stmt.get({}));
+    }
+    stmt.finalize();
+    if (allRows.length === 0)
+        return [];
+    const idToRow = new Map(allRows.map((r) => [r.id, r]));
+    // ── 2. BM25 search ───────────────────────────────────────────────────────
+    const corpus = allRows.map((r) => r.content);
+    const bm25 = new Bm25(corpus);
+    const bm25RawScores = bm25.scores(query);
+    const bm25Ranked = allRows
+        .map((r, i) => [r.id, bm25RawScores[i] ?? 0])
+        .sort((a, b) => b[1] - a[1]);
+    // ── 3. Vector search via JS cosine similarity ───────────────────────────
+    const queryVec = await embedQuery(query);
+    // Fetch all embeddings from vec_raw_log (memory_facts use same table)
+    const vecRowids = allRows
+        .filter((r) => r.vec_rowid !== null)
+        .map((r) => r.vec_rowid);
+    if (vecRowids.length === 0) {
+        // No embeddings available — fall back to BM25 only
+        const bm25Only = bm25Ranked
+            .slice(0, limit)
+            .map(([id, score]) => {
+            const row = idToRow.get(id);
+            const boostedScore = scoreMemoryFact(score);
+            return {
+                content: row.content,
+                source_session_id: row.source_session_id,
+                source_session_label: row.source_session_label,
+                created_at: row.created_at,
+                tags: row.tags ? JSON.parse(row.tags) : null,
+                final_score: boostedScore,
+            };
+        });
+        return bm25Only;
+    }
+    // Fetch embeddings for these vec_rowids
+    const placeholders = vecRowids.map(() => '?').join(',');
+    const vecStmt = db.prepare(`SELECT id, embedding FROM vec_raw_log WHERE id IN (${placeholders})`);
+    vecStmt.bind(vecRowids);
+    const vecCorpus = [];
+    while (vecStmt.step()) {
+        const row = vecStmt.get({});
+        vecCorpus.push({
+            id: row.id,
+            embedding: deserializeEmbedding(row.embedding),
+        });
+    }
+    vecStmt.finalize();
+    // Perform KNN search
+    const vecFetchLimit = Math.min(allRows.length, Math.max(limit * 3, 50));
+    const vecResults = knnSearch(queryVec, vecCorpus, vecFetchLimit);
+    // Map vec_raw_log ids back to memory_facts ids
+    const vecRanked = [];
+    for (const vecResult of vecResults) {
+        const factRow = allRows.find((r) => r.vec_rowid === vecResult.id);
+        if (factRow !== undefined) {
+            vecRanked.push([factRow.id, 1 - vecResult.distance]);
+        }
+    }
+    // ── 4. RRF merge ────────────────────────────────────────────────────────
+    const rrfScores = rrf(vecRanked, bm25Ranked);
+    // ── 5. Apply MEMORY_FACT_BOOST ──────────────────────────────────────────
+    const boostedScores = [];
+    for (const [id, rrfScore] of rrfScores) {
+        const boosted = scoreMemoryFact(rrfScore);
+        boostedScores.push([id, boosted]);
+    }
+    boostedScores.sort((a, b) => b[1] - a[1]);
+    // ── 6. Build output ─────────────────────────────────────────────────────
+    return boostedScores.slice(0, limit).map(([id, finalScore]) => {
+        const row = idToRow.get(id);
+        return {
+            content: row.content,
+            source_session_id: row.source_session_id,
+            source_session_label: row.source_session_label,
+            created_at: row.created_at,
+            tags: row.tags ? JSON.parse(row.tags) : null,
+            final_score: finalScore,
+        };
+    });
+}
+//# sourceMappingURL=memory-facts-search.js.map

package/dist/memory-facts-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-facts-search.js","sourceRoot":"","sources":["../src/memory-facts-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,SAAS,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AACrE,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAE9C,oEAAoE;AACpE,MAAM,KAAK,GAAG,EAAE,CAAC;AA0BjB,iFAAiF;AAEjF;;;;GAIG;AACH,SAAS,GAAG,CACV,SAAkC,EAClC,UAAmC;IAEnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QACnD,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,EAAE,KAAK,SAAS;YAAE,SAAS;QAC/B,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QACpD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,EAAE,KAAK,SAAS;YAAE,SAAS;QAC/B,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,iFAAiF;AAEjF;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,EAAU,EACV,MAAc,EACd,KAAa,EACb,KAAK,GAAG,EAAE;IAEV,4EAA4E;IAC5E,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB;;;8BAG0B,CAC3B,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAEpB,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,OAAO,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAkB,CAAC,CAAC;IAC9C,CAAC;IACD,IAAI,CAAC,QAAQ,EAAE,CAAC;IAEhB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAwB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9E,4EAA4E;IAC5E,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAEzC,MAAM,UAAU,GAA4B,OAAO;SAChD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAoB,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;SAC9D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/B,2EAA2E;IAC3E,MAAM,QAAQ,GAAG,MAAM,UAAU,CAAC,KAAK,CAAC,CAAC;IAEzC,sEAAsE;IACtE,MAAM,SAAS,GAAG,OAAO;SACtB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC;SACnC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAU,CAAC,CAAC;IAE5B,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,mDAAmD;QACnD,MAAM,QAAQ,GAA6B,UAAU;aAClD,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;aACf,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE;YACnB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAC7B,MAAM,YAAY,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;YAC5C,OAAO;gBACL,OAAO,EAAE,GAAG,CAAC,OAAO;gBACpB,iBAAiB,EAAE,GAAG,CAAC,iBAAiB;gBACxC,oBAAoB,EAAE,GAAG,CAAC,oBAAoB;gBAC9C,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAc,CAAC,CAAC,CAAC,IAAI;gBAC1D,WAAW,EAAE,YAAY;aAC1B,CAAC;QACJ,CAAC,CAAC,CAAC;QACL,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,wCAAwC;IACxC,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,sDAAsD,YAAY,GAAG,CAAC,CAAC;IAClG,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAExB,MAAM,SAAS,GAAmD,EAAE,CAAC;IACrE,OAAO,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAsC,CAAC;QACjE,SAAS,CAAC,IAAI,CAAC;YACb,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,SAAS,EAAE,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC;SAC/C,CAAC,CAAC;IACL,CAAC;IACD,OAAO,CAAC,QAAQ,EAAE,CAAC;IAEnB,qBAAqB;IACrB,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACxE,MAAM,UAAU,GAAG,SAAS,CAAC,QAAQ,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IAEjE,+CAA+C;IAC/C,MAAM,SAAS,GAA4B,EAAE,CAAC;IAC9C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,EAAE,CAAC,CAAC;QAClE,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,MAAM,SAAS,GAAG,GAAG,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAE7C,2EAA2E;IAC3E,MAAM,aAAa,GAA4B,EAAE,CAAC;IAClD,KAAK,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,SAAS,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;QAC1C,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1C,2EAA2E;IAC3E,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,EAAE;QAC5D,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC7B,OAAO;YACL,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,iBAAiB,EAAE,GAAG,CAAC,iBAAiB;YACxC,oBAAoB,EAAE,GAAG,CAAC,oBAAoB;YAC9C,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAc,CAAC,CAAC,CAAC,IAAI;YAC1D,WAAW,EAAE,UAAU;SACxB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/read-path.d.ts

@@ -1,39 +1,48 @@
 /**
- * Read path — Layer 1 retrieval (raw log search only).
+ * Read path — Layer 2 (memory facts) retrieval.
  *
  * buildMemoryContext() is called before every agent response. It queries
- * the raw_log table with hybrid search and returns a MemoryContext ready
+ * memory_facts, applies score boosting, and returns a MemoryContext ready
  * for formatContextBlock().
  *
  * Search is always cross-session — no session filter is applied.
  */
-import type { RawLogSearchResult } from './local-store.js';
-export interface RawChunk {
-    readonly chunkText: string;
-    readonly sessionId: string;
-    readonly sessionLabel: string | null;
+import type { MemoryFactSearchResult } from './local-store.js';
+/** A memory fact chunk with metadata and boosted score. */
+export interface MemoryFactChunk {
+    readonly content: string;
+    readonly sourceSessionId: string;
+    readonly sourceSessionLabel: string | null;
     readonly timestamp: Date;
-    /** Final score from hybrid search (RRF × decay × reranker). */
+    readonly tags: readonly string[] | null;
+    /** Final score from hybrid search with MEMORY_FACT_BOOST applied. */
     readonly score: number;
 }
+/**
+ * Memory context returned by buildMemoryContext().
+ *
+ * relatedMemories holds curated memory facts (high-signal).
+ */
 export interface MemoryContext {
-    readonly relatedConversations: RawChunk[];
+    readonly relatedMemories: MemoryFactChunk[];
 }
 export interface ReadPathOptions {
-    /** Max raw log chunks returned. Default: 3. */
-    maxRawChunks?: number;
+    /** Max memory facts returned. Default: 5. */
+    maxMemoryFacts?: number;
 }
 /**
  * Minimal store interface required by the read path.
  * LocalStore satisfies this; tests can pass a mock.
  */
 export interface ReadPathStore {
-    searchRawLog(query: string, limit?: number): Promise<readonly RawLogSearchResult[]>;
+    /** Layer 2: hybrid search over curated memory facts. */
+    searchMemoryFacts(query: string, limit?: number): Promise<readonly MemoryFactSearchResult[]>;
 }
 /**
  * Build a structured MemoryContext for a given query.
  *
- * Queries Layer 1 (raw log hybrid search) and returns ranked chunks.
+ * Queries Layer 2 (memory facts hybrid search).
+ * Memory facts get MEMORY_FACT_BOOST (2.0×) applied to their scores.
  *
  * @param query   Natural language query (the incoming user message or context).
  * @param store   Any store implementing ReadPathStore (typically LocalStore).

package/dist/read-path.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"read-path.d.ts","sourceRoot":"","sources":["../src/read-path.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAI3D,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC;IACzB,+DAA+D;IAC/D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,oBAAoB,EAAE,QAAQ,EAAE,CAAC;CAC3C;AAED,MAAM,WAAW,eAAe;IAC9B,+CAA+C;IAC/C,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,kBAAkB,EAAE,CAAC,CAAC;CACrF;AAID;;;;;;;;GAQG;AACH,wBAAsB,kBAAkB,CACtC,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,aAAa,EACpB,OAAO,CAAC,EAAE,eAAe,GACxB,OAAO,CAAC,aAAa,CAAC,CAmBxB"}
+{"version":3,"file":"read-path.d.ts","sourceRoot":"","sources":["../src/read-path.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,kBAAkB,CAAC;AAI/D,2DAA2D;AAC3D,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3C,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC;IACzB,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IACxC,qEAAqE;IACrE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,eAAe,EAAE,eAAe,EAAE,CAAC;CAC7C;AAED,MAAM,WAAW,eAAe;IAC9B,6CAA6C;IAC7C,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,wDAAwD;IACxD,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,sBAAsB,EAAE,CAAC,CAAC;CAC9F;AAID;;;;;;;;;GASG;AACH,wBAAsB,kBAAkB,CACtC,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,aAAa,EACpB,OAAO,CAAC,EAAE,eAAe,GACxB,OAAO,CAAC,aAAa,CAAC,CAuBxB"}

package/dist/read-path.js

@@ -1,8 +1,8 @@
 /**
- * Read path — Layer 1 retrieval (raw log search only).
+ * Read path — Layer 2 (memory facts) retrieval.
  *
  * buildMemoryContext() is called before every agent response. It queries
- * the raw_log table with hybrid search and returns a MemoryContext ready
+ * memory_facts, applies score boosting, and returns a MemoryContext ready
  * for formatContextBlock().
  *
  * Search is always cross-session — no session filter is applied.
@@ -11,27 +11,31 @@
 /**
  * Build a structured MemoryContext for a given query.
  *
- * Queries Layer 1 (raw log hybrid search) and returns ranked chunks.
+ * Queries Layer 2 (memory facts hybrid search).
+ * Memory facts get MEMORY_FACT_BOOST (2.0×) applied to their scores.
  *
  * @param query   Natural language query (the incoming user message or context).
  * @param store   Any store implementing ReadPathStore (typically LocalStore).
  * @param options Optional limits.
  */
 export async function buildMemoryContext(query, store, options) {
-    const maxRawChunks = options?.maxRawChunks ?? 3;
-    const rawCandidateLimit = maxRawChunks * 3;
-    // ── Query Layer 1 (raw log) ───────────────────────────────────────────────
-    const rawLogResults = await store.searchRawLog(query, rawCandidateLimit);
-    // ── Build raw chunks (already ranked by hybrid search score) ──────────────
-    const relatedConversations = rawLogResults
-        .slice(0, maxRawChunks)
+    const maxMemoryFacts = options?.maxMemoryFacts ?? 5;
+    const memoryCandidateLimit = maxMemoryFacts * 2;
+    // ── Query Layer 2 (memory facts) ─────────────────────────────────────────
+    const memoryFactResults = await store.searchMemoryFacts(query, memoryCandidateLimit);
+    // ── Build memory fact chunks (scores already have MEMORY_FACT_BOOST applied) ─
+    const relatedMemories = memoryFactResults
+        .slice(0, maxMemoryFacts)
         .map((r) => ({
-        chunkText: r.chunk_text,
-        sessionId: r.session_id,
-        sessionLabel: r.session_label,
-        timestamp: new Date(r.timestamp),
+        content: r.content,
+        sourceSessionId: r.source_session_id,
+        sourceSessionLabel: r.source_session_label,
+        timestamp: new Date(r.created_at),
+        tags: r.tags,
         score: r.final_score,
     }));
-    return { relatedConversations };
+    return {
+        relatedMemories,
+    };
 }
 //# sourceMappingURL=read-path.js.map

package/dist/read-path.js.map

@@ -1 +1 @@
-{"version":3,"file":"read-path.js","sourceRoot":"","sources":["../src/read-path.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAgCH,iFAAiF;AAEjF;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,KAAa,EACb,KAAoB,EACpB,OAAyB;IAEzB,MAAM,YAAY,GAAG,OAAO,EAAE,YAAY,IAAI,CAAC,CAAC;IAChD,MAAM,iBAAiB,GAAG,YAAY,GAAG,CAAC,CAAC;IAE3C,6EAA6E;IAC7E,MAAM,aAAa,GAAG,MAAM,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC;IAEzE,6EAA6E;IAC7E,MAAM,oBAAoB,GAAe,aAAa;SACnD,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC;SACtB,GAAG,CAAC,CAAC,CAAqB,EAAE,EAAE,CAAC,CAAC;QAC/B,SAAS,EAAE,CAAC,CAAC,UAAU;QACvB,SAAS,EAAE,CAAC,CAAC,UAAU;QACvB,YAAY,EAAE,CAAC,CAAC,aAAa;QAC7B,SAAS,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;QAChC,KAAK,EAAE,CAAC,CAAC,WAAW;KACrB,CAAC,CAAC,CAAC;IAEN,OAAO,EAAE,oBAAoB,EAAE,CAAC;AAClC,CAAC"}
+{"version":3,"file":"read-path.js","sourceRoot":"","sources":["../src/read-path.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAwCH,iFAAiF;AAEjF;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,KAAa,EACb,KAAoB,EACpB,OAAyB;IAEzB,MAAM,cAAc,GAAG,OAAO,EAAE,cAAc,IAAI,CAAC,CAAC;IAEpD,MAAM,oBAAoB,GAAG,cAAc,GAAG,CAAC,CAAC;IAEhD,4EAA4E;IAC5E,MAAM,iBAAiB,GAAG,MAAM,KAAK,CAAC,iBAAiB,CAAC,KAAK,EAAE,oBAAoB,CAAC,CAAC;IAErF,gFAAgF;IAChF,MAAM,eAAe,GAAsB,iBAAiB;SACzD,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;SACxB,GAAG,CAAC,CAAC,CAAyB,EAAE,EAAE,CAAC,CAAC;QACnC,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,eAAe,EAAE,CAAC,CAAC,iBAAiB;QACpC,kBAAkB,EAAE,CAAC,CAAC,oBAAoB;QAC1C,SAAS,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;QACjC,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,KAAK,EAAE,CAAC,CAAC,WAAW;KACrB,CAAC,CAAC,CAAC;IAEN,OAAO;QACL,eAAe;KAChB,CAAC;AACJ,CAAC"}

package/dist/schema.d.ts

@@ -1,20 +1,25 @@
 /**
  * SQLite schema for Plumb LocalStore.
  *
- * Single table per user (scoped by user_id column):
- *   - raw_log: Lossless conversation chunks with vector embeddings
+ * Tables:
+ *   - memory_facts: Curated facts written by the agent via plumb_remember
+ *   - vec_raw_log: Embedding vectors for memory_facts (keyed by vec_rowid)
+ *   - nudge_log: One-time upgrade prompt tracking
  *
  * Design principles:
  *   - Cross-session by design: session info stored as metadata, not as a boundary
- *   - Indexes on high-cardinality query axes: user_id, session_id, timestamp
+ *   - Indexes on high-cardinality query axes: user_id, embed_status
  */
-export declare const CREATE_RAW_LOG_TABLE = "\n  CREATE TABLE IF NOT EXISTS raw_log (\n    id            TEXT PRIMARY KEY,\n    user_id       TEXT NOT NULL,\n    session_id    TEXT NOT NULL,\n    session_label TEXT,\n    user_message  TEXT NOT NULL,\n    agent_response TEXT NOT NULL,\n    timestamp     TEXT NOT NULL,\n    source        TEXT NOT NULL,\n    chunk_text    TEXT NOT NULL,\n    chunk_index   INTEGER NOT NULL,\n    vec_rowid     INTEGER,\n    content_hash  TEXT,\n    embed_status  TEXT NOT NULL DEFAULT 'pending',\n    embed_error   TEXT,\n    embed_model   TEXT,\n    parent_id     TEXT REFERENCES raw_log(id),\n    UNIQUE(user_id, content_hash)\n  )\n";
-export declare const CREATE_RAW_LOG_INDEXES: string[];
 /**
- * Embeddings table for vector search over raw_log chunks.
- * Stores embeddings as JSON arrays (WASM-compatible, no native extension needed).
+ * Memory facts table for curated, high-signal facts written by Terra.
+ * Each fact is a short, dense piece of information stored as a single chunk.
+ *
+ * confidence (0–1) and decay_rate ('slow'|'medium'|'fast') drive scoring.
+ * source_session_label is optional human-readable session name for provenance.
+ * vec_rowid links to vec_raw_log for vector similarity search.
  */
-export declare const CREATE_VEC_RAW_LOG = "\n  CREATE TABLE IF NOT EXISTS vec_raw_log (\n    id INTEGER PRIMARY KEY AUTOINCREMENT,\n    embedding TEXT NOT NULL\n  )\n";
+export declare const CREATE_MEMORY_FACTS_TABLE = "\n  CREATE TABLE IF NOT EXISTS memory_facts (\n    id                   TEXT PRIMARY KEY,\n    user_id              TEXT NOT NULL,\n    content              TEXT NOT NULL,\n    confidence           REAL NOT NULL DEFAULT 0.9,\n    decay_rate           TEXT NOT NULL DEFAULT 'slow',\n    source_session_id    TEXT NOT NULL,\n    source_session_label TEXT,\n    tags                 TEXT,\n    created_at           TEXT NOT NULL,\n    deleted_at           TEXT,\n    embed_status         TEXT NOT NULL DEFAULT 'pending',\n    embed_error          TEXT,\n    embed_model          TEXT,\n    vec_rowid            INTEGER\n  )\n";
+export declare const CREATE_MEMORY_FACTS_INDEXES: string[];
 /**
  * Nudge log table for tracking one-time upgrade prompts.
  * Each trigger type fires exactly once per install.

package/dist/schema.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,eAAO,MAAM,oBAAoB,onBAoBhC,CAAC;AAEF,eAAO,MAAM,sBAAsB,UAKlC,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,kBAAkB,gIAK9B,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,sBAAsB,8JAMlC,CAAC;AAEF,wBAAgB,WAAW,CAAC,EAAE,EAAE,OAAO,cAAc,EAAE,MAAM,GAAG,IAAI,CAoEnE"}
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH;;;;;;;GAOG;AACH,eAAO,MAAM,yBAAyB,mnBAiBrC,CAAC;AAEF,eAAO,MAAM,2BAA2B,UAGvC,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,sBAAsB,8JAMlC,CAAC;AAEF,wBAAgB,WAAW,CAAC,EAAE,EAAE,OAAO,cAAc,EAAE,MAAM,GAAG,IAAI,CA6CnE"}

package/dist/schema.js

@@ -1,50 +1,45 @@
 /**
  * SQLite schema for Plumb LocalStore.
  *
- * Single table per user (scoped by user_id column):
- *   - raw_log: Lossless conversation chunks with vector embeddings
+ * Tables:
+ *   - memory_facts: Curated facts written by the agent via plumb_remember
+ *   - vec_raw_log: Embedding vectors for memory_facts (keyed by vec_rowid)
+ *   - nudge_log: One-time upgrade prompt tracking
  *
  * Design principles:
  *   - Cross-session by design: session info stored as metadata, not as a boundary
- *   - Indexes on high-cardinality query axes: user_id, session_id, timestamp
+ *   - Indexes on high-cardinality query axes: user_id, embed_status
  */
-export const CREATE_RAW_LOG_TABLE = `
-  CREATE TABLE IF NOT EXISTS raw_log (
-    id            TEXT PRIMARY KEY,
-    user_id       TEXT NOT NULL,
-    session_id    TEXT NOT NULL,
-    session_label TEXT,
-    user_message  TEXT NOT NULL,
-    agent_response TEXT NOT NULL,
-    timestamp     TEXT NOT NULL,
-    source        TEXT NOT NULL,
-    chunk_text    TEXT NOT NULL,
-    chunk_index   INTEGER NOT NULL,
-    vec_rowid     INTEGER,
-    content_hash  TEXT,
-    embed_status  TEXT NOT NULL DEFAULT 'pending',
-    embed_error   TEXT,
-    embed_model   TEXT,
-    parent_id     TEXT REFERENCES raw_log(id),
-    UNIQUE(user_id, content_hash)
-  )
-`;
-export const CREATE_RAW_LOG_INDEXES = [
-    `CREATE INDEX IF NOT EXISTS idx_raw_log_user_id ON raw_log (user_id)`,
-    `CREATE INDEX IF NOT EXISTS idx_raw_log_session_id ON raw_log (session_id)`,
-    `CREATE INDEX IF NOT EXISTS idx_raw_log_timestamp ON raw_log (timestamp)`,
-    `CREATE INDEX IF NOT EXISTS idx_raw_log_parent_id ON raw_log (parent_id)`,
-];
 /**
- * Embeddings table for vector search over raw_log chunks.
- * Stores embeddings as JSON arrays (WASM-compatible, no native extension needed).
+ * Memory facts table for curated, high-signal facts written by Terra.
+ * Each fact is a short, dense piece of information stored as a single chunk.
+ *
+ * confidence (0–1) and decay_rate ('slow'|'medium'|'fast') drive scoring.
+ * source_session_label is optional human-readable session name for provenance.
+ * vec_rowid links to vec_raw_log for vector similarity search.
  */
-export const CREATE_VEC_RAW_LOG = `
-  CREATE TABLE IF NOT EXISTS vec_raw_log (
-    id INTEGER PRIMARY KEY AUTOINCREMENT,
-    embedding TEXT NOT NULL
+export const CREATE_MEMORY_FACTS_TABLE = `
+  CREATE TABLE IF NOT EXISTS memory_facts (
+    id                   TEXT PRIMARY KEY,
+    user_id              TEXT NOT NULL,
+    content              TEXT NOT NULL,
+    confidence           REAL NOT NULL DEFAULT 0.9,
+    decay_rate           TEXT NOT NULL DEFAULT 'slow',
+    source_session_id    TEXT NOT NULL,
+    source_session_label TEXT,
+    tags                 TEXT,
+    created_at           TEXT NOT NULL,
+    deleted_at           TEXT,
+    embed_status         TEXT NOT NULL DEFAULT 'pending',
+    embed_error          TEXT,
+    embed_model          TEXT,
+    vec_rowid            INTEGER
   )
 `;
+export const CREATE_MEMORY_FACTS_INDEXES = [
+    `CREATE INDEX IF NOT EXISTS idx_memory_facts_user_id ON memory_facts (user_id)`,
+    `CREATE INDEX IF NOT EXISTS idx_memory_facts_embed_status ON memory_facts (embed_status)`,
+];
 /**
  * Nudge log table for tracking one-time upgrade prompts.
  * Each trigger type fires exactly once per install.
@@ -57,24 +52,6 @@ export const CREATE_NUDGE_LOG_TABLE = `
   )
 `;
 export function applySchema(db) {
-    db.exec(CREATE_RAW_LOG_TABLE);
-    for (const idx of CREATE_RAW_LOG_INDEXES) {
-        db.exec(idx);
-    }
-    db.exec(CREATE_VEC_RAW_LOG);
-    // Conditional migration: add content_hash column to raw_log if it doesn't exist yet.
-    const rawLogColumns = db.exec({
-        sql: 'PRAGMA table_info(raw_log)',
-        rowMode: 'object',
-        returnValue: 'resultRows',
-    });
-    const hasContentHash = rawLogColumns.some((c) => c.name === 'content_hash');
-    if (!hasContentHash) {
-        db.exec('ALTER TABLE raw_log ADD COLUMN content_hash TEXT');
-        // Create unique constraint on (user_id, content_hash).
-        // SQLite UNIQUE constraints ignore NULL values, so existing rows with NULL won't conflict.
-        db.exec('CREATE UNIQUE INDEX IF NOT EXISTS idx_raw_log_content_hash ON raw_log(user_id, content_hash)');
-    }
     // Conditional migration: create nudge_log table if it doesn't exist yet.
     const tables = db.exec({
         sql: `SELECT name FROM sqlite_master WHERE type='table' AND name='nudge_log'`,
@@ -84,39 +61,42 @@ export function applySchema(db) {
     if (tables.length === 0) {
         db.exec(CREATE_NUDGE_LOG_TABLE);
     }
-    // T-079: Conditional migration for processing state machine columns (embed only).
-    const rawLogColumns2 = db.exec({
-        sql: 'PRAGMA table_info(raw_log)',
+    // T-118: Create memory_facts table if it doesn't exist (for curated facts from agent).
+    const memoryFactsTables = db.exec({
+        sql: `SELECT name FROM sqlite_master WHERE type='table' AND name='memory_facts'`,
         rowMode: 'object',
         returnValue: 'resultRows',
     });
-    // Add embed columns to raw_log if they don't exist.
-    const hasEmbedStatus = rawLogColumns2.some((c) => c.name === 'embed_status');
-    if (!hasEmbedStatus) {
-        // Add embed columns with defaults.
-        db.exec('ALTER TABLE raw_log ADD COLUMN embed_status TEXT NOT NULL DEFAULT \'pending\'');
-        db.exec('ALTER TABLE raw_log ADD COLUMN embed_error TEXT');
-        db.exec('ALTER TABLE raw_log ADD COLUMN embed_model TEXT');
-        // Backfill embed_status for existing rows based on vec_rowid.
-        // Rows with vec_rowid already set -> embed_status='done', embed_model='Xenova/bge-small-en-v1.5'
-        db.exec(`
-      UPDATE raw_log
-      SET embed_status = 'done', embed_model = 'Xenova/bge-small-en-v1.5'
-      WHERE vec_rowid IS NOT NULL
-    `);
-        // Rows with vec_rowid=NULL remain embed_status='pending' (from DEFAULT).
+    if (memoryFactsTables.length === 0) {
+        db.exec(CREATE_MEMORY_FACTS_TABLE);
+        for (const idx of CREATE_MEMORY_FACTS_INDEXES) {
+            db.exec(idx);
+        }
     }
-    // T-108: Add parent_id column to raw_log if it doesn't exist (for parent-child chunking).
-    const rawLogColumns3 = db.exec({
-        sql: 'PRAGMA table_info(raw_log)',
-        rowMode: 'object',
-        returnValue: 'resultRows',
-    });
-    const hasParentId = rawLogColumns3.some((c) => c.name === 'parent_id');
-    if (!hasParentId) {
-        db.exec('ALTER TABLE raw_log ADD COLUMN parent_id TEXT REFERENCES raw_log(id)');
-        db.exec('CREATE INDEX IF NOT EXISTS idx_raw_log_parent_id ON raw_log (parent_id)');
-        // Existing rows have parent_id=NULL (they are parent-only rows, treated as searchable fallback).
+    else {
+        // Conditional migration: add structured fact columns to existing memory_facts table.
+        const memFactColumns = db.exec({
+            sql: 'PRAGMA table_info(memory_facts)',
+            rowMode: 'object',
+            returnValue: 'resultRows',
+        });
+        const memFactColNames = new Set(memFactColumns.map((c) => c.name));
+        if (!memFactColNames.has('confidence'))
+            db.exec(`ALTER TABLE memory_facts ADD COLUMN confidence REAL NOT NULL DEFAULT 0.9`);
+        if (!memFactColNames.has('decay_rate'))
+            db.exec(`ALTER TABLE memory_facts ADD COLUMN decay_rate TEXT NOT NULL DEFAULT 'slow'`);
+        if (!memFactColNames.has('source_session_label'))
+            db.exec(`ALTER TABLE memory_facts ADD COLUMN source_session_label TEXT`);
+        if (!memFactColNames.has('deleted_at'))
+            db.exec(`ALTER TABLE memory_facts ADD COLUMN deleted_at TEXT`);
     }
+    // T-128: Share vec_raw_log for memory_facts embeddings (table may exist from old raw_log usage)
+    // Create only if it doesn't exist - this allows existing DBs to continue working
+    db.exec(`
+    CREATE TABLE IF NOT EXISTS vec_raw_log (
+      id INTEGER PRIMARY KEY AUTOINCREMENT,
+      embedding TEXT NOT NULL
+    )
+  `);
 }
 //# sourceMappingURL=schema.js.map

package/dist/schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"schema.js","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,MAAM,CAAC,MAAM,oBAAoB,GAAG;;;;;;;;;;;;;;;;;;;;CAoBnC,CAAC;AAEF,MAAM,CAAC,MAAM,sBAAsB,GAAG;IACpC,qEAAqE;IACrE,2EAA2E;IAC3E,yEAAyE;IACzE,yEAAyE;CAC1E,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG;;;;;CAKjC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG;;;;;;CAMrC,CAAC;AAEF,MAAM,UAAU,WAAW,CAAC,EAAiC;IAC3D,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC9B,KAAK,MAAM,GAAG,IAAI,sBAAsB,EAAE,CAAC;QACzC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;IAE5B,qFAAqF;IACrF,MAAM,aAAa,GAAG,EAAE,CAAC,IAAI,CAAC;QAC5B,GAAG,EAAE,4BAA4B;QACjC,OAAO,EAAE,QAAQ;QACjB,WAAW,EAAE,YAAY;KAC1B,CAA4B,CAAC;IAC9B,MAAM,cAAc,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;IAC5E,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,EAAE,CAAC,IAAI,CAAC,kDAAkD,CAAC,CAAC;QAC5D,uDAAuD;QACvD,2FAA2F;QAC3F,EAAE,CAAC,IAAI,CAAC,8FAA8F,CAAC,CAAC;IAC1G,CAAC;IAED,yEAAyE;IACzE,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC;QACrB,GAAG,EAAE,wEAAwE;QAC7E,OAAO,EAAE,QAAQ;QACjB,WAAW,EAAE,YAAY;KAC1B,CAA4B,CAAC;IAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,EAAE,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;IAClC,CAAC;IAED,kFAAkF;IAClF,MAAM,cAAc,GAAG,EAAE,CAAC,IAAI,CAAC;QAC7B,GAAG,EAAE,4BAA4B;QACjC,OAAO,EAAE,QAAQ;QACjB,WAAW,EAAE,YAAY;KAC1B,CAA4B,CAAC;IAE9B,oDAAoD;IACpD,MAAM,cAAc,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;IAC7E,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,mCAAmC;QACnC,EAAE,CAAC,IAAI,CAAC,+EAA+E,CAAC,CAAC;QACzF,EAAE,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;QAC3D,EAAE,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;QAE3D,8DAA8D;QAC9D,iGAAiG;QACjG,EAAE,CAAC,IAAI,CAAC;;;;KAIP,CAAC,CAAC;QACH,yEAAyE;IAC3E,CAAC;IAED,0FAA0F;IAC1F,MAAM,cAAc,GAAG,EAAE,CAAC,IAAI,CAAC;QAC7B,GAAG,EAAE,4BAA4B;QACjC,OAAO,EAAE,QAAQ;QACjB,WAAW,EAAE,YAAY;KAC1B,CAA4B,CAAC;IAC9B,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;IACvE,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,EAAE,CAAC,IAAI,CAAC,sEAAsE,CAAC,CAAC;QAChF,EAAE,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAC;QACnF,iGAAiG;IACnG,CAAC;AACH,CAAC"}
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG;;;;;;;;;;;;;;;;;CAiBxC,CAAC;AAEF,MAAM,CAAC,MAAM,2BAA2B,GAAG;IACzC,+EAA+E;IAC/E,yFAAyF;CAC1F,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG;;;;;;CAMrC,CAAC;AAEF,MAAM,UAAU,WAAW,CAAC,EAAiC;IAC3D,yEAAyE;IACzE,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC;QACrB,GAAG,EAAE,wEAAwE;QAC7E,OAAO,EAAE,QAAQ;QACjB,WAAW,EAAE,YAAY;KAC1B,CAA4B,CAAC;IAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,EAAE,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;IAClC,CAAC;IAED,uFAAuF;IACvF,MAAM,iBAAiB,GAAG,EAAE,CAAC,IAAI,CAAC;QAChC,GAAG,EAAE,2EAA2E;QAChF,OAAO,EAAE,QAAQ;QACjB,WAAW,EAAE,YAAY;KAC1B,CAA4B,CAAC;IAC9B,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnC,EAAE,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,2BAA2B,EAAE,CAAC;YAC9C,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;IACH,CAAC;SAAM,CAAC;QACN,qFAAqF;QACrF,MAAM,cAAc,GAAG,EAAE,CAAC,IAAI,CAAC;YAC7B,GAAG,EAAE,iCAAiC;YACtC,OAAO,EAAE,QAAQ;YACjB,WAAW,EAAE,YAAY;SAC1B,CAA4B,CAAC;QAC9B,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAEnE,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,YAAY,CAAC;YAAE,EAAE,CAAC,IAAI,CAAC,0EAA0E,CAAC,CAAC;QAC5H,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,YAAY,CAAC;YAAE,EAAE,CAAC,IAAI,CAAC,6EAA6E,CAAC,CAAC;QAC/H,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,sBAAsB,CAAC;YAAE,EAAE,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;QAC3H,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,YAAY,CAAC;YAAE,EAAE,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;IACzG,CAAC;IAED,gGAAgG;IAChG,iFAAiF;IACjF,EAAE,CAAC,IAAI,CAAC;;;;;GAKP,CAAC,CAAC;AACL,CAAC"}

package/dist/scorer.d.ts

@@ -1,21 +1,23 @@
+/** Memory fact score boost multiplier (applied after RRF fusion). */
+export declare const MEMORY_FACT_BOOST = 2;
+/** Memory fact minimum score threshold (after boost) for fallback logic.
+ *  Calibrated for RRF hybrid scores: top ~25% of boosted fact scores qualify.
+ */
+export declare const MEMORY_FACT_MIN_SCORE = 0.054;
 export interface ScoreResult {
     readonly score: number;
     readonly isCold: boolean;
 }
-/**
- * Minimal shape required by scoreRawLog().
- * raw_log rows carry a timestamp; other fields are not needed for scoring.
- */
-export interface RawLogChunk {
-    readonly timestamp: Date;
-}
 /**
  * Computes the exponential decay multiplier: e^(-lambda × age_in_days).
  */
 export declare function computeDecay(lambda: number, ageInDays: number): number;
 /**
- * Scores a raw log chunk using medium decay (lambda = 0.012).
- * Raw chunks have no confidence field; decay is applied to a base of 1.0.
+ * Scores a memory fact by applying MEMORY_FACT_BOOST to its hybrid search score.
+ * Memory facts are high-signal curated content, so they get a 2.0× boost.
+ *
+ * @param hybridScore The RRF-fused score from BM25 + vector search.
+ * @returns The boosted score.
  */
-export declare function scoreRawLog(chunk: RawLogChunk, now?: Date): ScoreResult;
+export declare function scoreMemoryFact(hybridScore: number): number;
 //# sourceMappingURL=scorer.d.ts.map

package/dist/scorer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"scorer.d.ts","sourceRoot":"","sources":["../src/scorer.ts"],"names":[],"mappings":"AAMA,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC;CAC1B;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAEtE;AAED;;;GAGG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,WAAW,EAClB,GAAG,GAAE,IAAiB,GACrB,WAAW,CAKb"}
+{"version":3,"file":"scorer.d.ts","sourceRoot":"","sources":["../src/scorer.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,eAAO,MAAM,iBAAiB,IAAM,CAAC;AAErC;;GAEG;AACH,eAAO,MAAM,qBAAqB,QAAQ,CAAC;AAE3C,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAEtE;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,CAE3D"}

package/dist/scorer.js

@@ -1,7 +1,9 @@
-/** Lambda applied to raw log chunks (medium decay). */
-const RAW_LOG_LAMBDA = 0.012;
-/** Cold score threshold — chunks below this are flagged. */
-const COLD_THRESHOLD = 0.01;
+/** Memory fact score boost multiplier (applied after RRF fusion). */
+export const MEMORY_FACT_BOOST = 2.0;
+/** Memory fact minimum score threshold (after boost) for fallback logic.
+ *  Calibrated for RRF hybrid scores: top ~25% of boosted fact scores qualify.
+ */
+export const MEMORY_FACT_MIN_SCORE = 0.054;
 /**
  * Computes the exponential decay multiplier: e^(-lambda × age_in_days).
  */
@@ -9,12 +11,13 @@ export function computeDecay(lambda, ageInDays) {
     return Math.exp(-lambda * ageInDays);
 }
 /**
- * Scores a raw log chunk using medium decay (lambda = 0.012).
- * Raw chunks have no confidence field; decay is applied to a base of 1.0.
+ * Scores a memory fact by applying MEMORY_FACT_BOOST to its hybrid search score.
+ * Memory facts are high-signal curated content, so they get a 2.0× boost.
+ *
+ * @param hybridScore The RRF-fused score from BM25 + vector search.
+ * @returns The boosted score.
  */
-export function scoreRawLog(chunk, now = new Date()) {
-    const ageInDays = (now.getTime() - chunk.timestamp.getTime()) / (1_000 * 60 * 60 * 24);
-    const score = computeDecay(RAW_LOG_LAMBDA, ageInDays);
-    return { score, isCold: score < COLD_THRESHOLD };
+export function scoreMemoryFact(hybridScore) {
+    return hybridScore * MEMORY_FACT_BOOST;
 }
 //# sourceMappingURL=scorer.js.map

package/dist/scorer.js.map

@@ -1 +1 @@
-{"version":3,"file":"scorer.js","sourceRoot":"","sources":["../src/scorer.ts"],"names":[],"mappings":"AAAA,uDAAuD;AACvD,MAAM,cAAc,GAAG,KAAK,CAAC;AAE7B,4DAA4D;AAC5D,MAAM,cAAc,GAAG,IAAI,CAAC;AAe5B;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAAc,EAAE,SAAiB;IAC5D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;AACvC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,KAAkB,EAClB,MAAY,IAAI,IAAI,EAAE;IAEtB,MAAM,SAAS,GACb,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IACvE,MAAM,KAAK,GAAG,YAAY,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC;IACtD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,GAAG,cAAc,EAAE,CAAC;AACnD,CAAC"}
+{"version":3,"file":"scorer.js","sourceRoot":"","sources":["../src/scorer.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAErC;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,KAAK,CAAC;AAO3C;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAAc,EAAE,SAAiB;IAC5D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,WAAmB;IACjD,OAAO,WAAW,GAAG,iBAAiB,CAAC;AACzC,CAAC"}

package/dist/store.d.ts

@@ -1,13 +1,8 @@
-import type { IngestResult, MessageExchange, StoreStatus } from './types.js';
+import type { StoreStatus } from './types.js';
 export interface MemoryStore {
     /**
      * Return current store statistics.
      */
     status(): Promise<StoreStatus>;
-    /**
-     * High-level entry point for ingesting a conversation exchange.
-     * Writes to raw_log table and enqueues embedding.
-     */
-    ingest(exchange: MessageExchange): Promise<IngestResult>;
 }
 //# sourceMappingURL=store.d.ts.map

package/dist/store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../src/store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE7E,MAAM,WAAW,WAAW;IAC1B;;OAEG;IACH,MAAM,IAAI,OAAO,CAAC,WAAW,CAAC,CAAC;IAE/B;;;OAGG;IACH,MAAM,CAAC,QAAQ,EAAE,eAAe,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;CAC1D"}
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../src/store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,MAAM,WAAW,WAAW;IAC1B;;OAEG;IACH,MAAM,IAAI,OAAO,CAAC,WAAW,CAAC,CAAC;CAChC"}