synabun 1.3.0 → 2.0.0

package/mcp-server/dist/services/memory-triage.js

@@ -0,0 +1,189 @@
+/**
+ * Trash triage: rank forget candidates by how little they would be missed.
+ *
+ * Candidates come from cheap local signals — exact duplicate groups, the
+ * duplicate side of a judged `duplicate_of` relation, and old low-importance
+ * memories that were never recalled. The judgment scores each one on the
+ * expendability rubric so the list leads with the safest deletions. Nothing
+ * here deletes: the `memories` tool action `triage` and the Judgments tab
+ * render the list, and a person decides.
+ *
+ * Batches of candidates are judged in parallel and each fails alone. A score
+ * is stored beside the memory's metadata with a fingerprint of what was
+ * judged, and reused until that changes or a week passes, so a repeat triage
+ * only asks about new or changed candidates.
+ */
+import { getDb } from './sqlite.js';
+import { projectAliases } from '../config.js';
+import { judgeExpendability, expendabilityBasis, EXPENDABILITY_LEVELS } from './memory-judgments.js';
+import { surfaceConfig, typesafeConfig } from './typesafe-config.js';
+import { typesafeEnabled, typesafeRetryAfterMs } from './typesafe.js';
+const LEVEL_NAMES = EXPENDABILITY_LEVELS.map(l => l.split(':')[0]);
+const BATCH = 10;
+const JUDGE_CONCURRENCY = 6;
+const SCORE_TTL_MS = 7 * 86_400_000;
+/** Ceiling on candidates considered in one run: every one of them is judged and returned. */
+export const MAX_TRIAGE_LIMIT = 2000;
+/** Rows carried by a progress snapshot; the finished result carries all of them. */
+const PROGRESS_ROWS = 50;
+/** Local candidate discovery; no API calls. */
+export function findTriageCandidates(options = {}) {
+    const d = getDb();
+    const limit = Math.max(1, Math.min(MAX_TRIAGE_LIMIT, Math.floor(options.limit ?? 20)));
+    const where = ['m.trashed_at IS NULL'];
+    const params = [];
+    if (options.project) {
+        const aliases = projectAliases(options.project).map(p => p.toLowerCase());
+        where.push(`lower(m.project) IN (${aliases.map(() => '?').join(',')})`);
+        params.push(...aliases);
+    }
+    const scope = where.join(' AND ');
+    const rows = new Map();
+    const add = (row, reason, duplicateOf = null) => {
+        const id = String(row.id);
+        const existing = rows.get(id);
+        if (existing) {
+            if (!existing.reasons.includes(reason))
+                existing.reasons.push(reason);
+            if (duplicateOf && !existing.duplicateOf)
+                existing.duplicateOf = duplicateOf;
+            return;
+        }
+        rows.set(id, {
+            id, project: String(row.project), category: String(row.category), importance: Number(row.importance), created_at: String(row.created_at),
+            access_count: Number(row.access_count ?? 0), preview: String(row.content).slice(0, 240), content: String(row.content),
+            reasons: [reason], expendability: null, level: null, duplicateOf,
+        });
+    };
+    // Exact copies: every member but the oldest. CROSS JOIN pins the join order so
+    // the oldest-copy lookup starts from the content_hash index; left to itself the
+    // planner scanned the whole project once per copy (3.3 s on 24k memories).
+    for (const row of d.prepare(`SELECT m.id,m.project,m.category,m.importance,m.created_at,m.access_count,m.content,
+      (SELECT o.id FROM memory_metadata om CROSS JOIN memories o ON o.id=om.memory_id WHERE om.content_hash=md.content_hash AND o.trashed_at IS NULL AND o.project=m.project ORDER BY o.created_at,o.id LIMIT 1) AS oldest
+    FROM memories m JOIN memory_metadata md ON md.memory_id=m.id
+    WHERE ${scope} AND md.content_hash IN (SELECT md2.content_hash FROM memory_metadata md2 JOIN memories m2 ON m2.id=md2.memory_id WHERE m2.trashed_at IS NULL GROUP BY md2.content_hash,m2.project HAVING count(*)>1)
+    ORDER BY m.created_at DESC LIMIT ?`).all(...params, limit)) {
+        if (String(row.oldest) !== String(row.id))
+            add(row, `exact copy of ${String(row.oldest).slice(0, 8)}`, String(row.oldest));
+    }
+    // The newer side of a judged duplicate relation.
+    for (const row of d.prepare(`SELECT m.id,m.project,m.category,m.importance,m.created_at,m.access_count,m.content,r.to_id AS canonical
+    FROM memory_relations r JOIN memories m ON m.id=r.from_id JOIN memories t ON t.id=r.to_id
+    WHERE r.kind='duplicate_of' AND r.active=1 AND t.trashed_at IS NULL AND ${scope} ORDER BY r.created_at DESC LIMIT ?`).all(...params, limit)) {
+        add(row, `judged duplicate of ${String(row.canonical).slice(0, 8)}`, String(row.canonical));
+    }
+    // Old, unimportant, never recalled.
+    const cutoff = new Date(Date.now() - 90 * 86_400_000).toISOString();
+    for (const row of d.prepare(`SELECT m.id,m.project,m.category,m.importance,m.created_at,m.access_count,m.content FROM memories m
+    WHERE ${scope} AND m.importance<=3 AND m.access_count=0 AND m.created_at<? ORDER BY m.importance,m.created_at LIMIT ?`).all(...params, cutoff, limit)) {
+        add(row, 'importance ≤ 3, never recalled, older than 90 days');
+    }
+    return [...rows.values()]
+        .sort((a, b) => b.reasons.length - a.reasons.length || a.importance - b.importance || a.created_at.localeCompare(b.created_at))
+        .slice(0, limit);
+}
+const toCandidate = (c) => ({ id: c.id, content: c.content, category: c.category, importance: c.importance, createdAt: c.created_at, accessCount: c.access_count, duplicateOf: c.duplicateOf });
+function setScore(c, s) {
+    c.expendability = Number(s.toFixed(2));
+    c.level = LEVEL_NAMES[Math.max(0, Math.min(LEVEL_NAMES.length - 1, Math.round(s)))];
+}
+function rank(candidates, limit) {
+    return [...candidates].sort((a, b) => {
+        if (a.expendability !== null && b.expendability !== null && a.expendability !== b.expendability)
+            return b.expendability - a.expendability;
+        if ((a.expendability === null) !== (b.expendability === null))
+            return a.expendability === null ? 1 : -1;
+        return b.reasons.length - a.reasons.length || a.importance - b.importance || a.created_at.localeCompare(b.created_at);
+    }).slice(0, limit).map(({ content: _content, duplicateOf: _dup, ...row }) => row);
+}
+/** Reuse stored scores whose basis matches what would be sent now and that are younger than the TTL. */
+function applySavedScores(candidates, bases) {
+    if (!candidates.length)
+        return 0;
+    const stored = new Map(getDb().prepare(`SELECT memory_id,expendability,expendability_at,expendability_basis FROM memory_metadata
+    WHERE memory_id IN (${candidates.map(() => '?').join(',')}) AND expendability IS NOT NULL`).all(...candidates.map(c => c.id)).map(row => [String(row.memory_id), row]));
+    const cutoff = Date.now() - SCORE_TTL_MS;
+    let saved = 0;
+    for (const c of candidates) {
+        const row = stored.get(c.id);
+        if (!row || row.expendability_basis !== bases.get(c.id) || !(Date.parse(String(row.expendability_at)) > cutoff))
+            continue;
+        setScore(c, Number(row.expendability));
+        saved++;
+    }
+    return saved;
+}
+/** Store a batch's fresh scores. Update-only: a busy database or a missing metadata row costs a re-judgment next time, never the ranking. */
+function saveScores(batch, bases) {
+    const d = getDb();
+    try {
+        d.exec('BEGIN IMMEDIATE');
+    }
+    catch {
+        return;
+    }
+    try {
+        const update = d.prepare('UPDATE memory_metadata SET expendability=?,expendability_at=?,expendability_basis=? WHERE memory_id=?');
+        const at = new Date().toISOString();
+        for (const c of batch)
+            if (c.expendability !== null)
+                update.run(c.expendability, at, bases.get(c.id) ?? null, c.id);
+        d.exec('COMMIT');
+    }
+    catch {
+        try {
+            d.exec('ROLLBACK');
+        }
+        catch { /* already rolled back */ }
+    }
+}
+/**
+ * Candidates ranked by judged expendability, or by the local ordering when the
+ * judgment is unavailable. Stored scores are reused; the rest are judged in
+ * parallel batches that fail alone, and nothing new is sent while a 429's
+ * retry-after holds. `onProgress` gets the ranking so far as batches land.
+ */
+export async function triageMemories(options = {}) {
+    const limit = Math.max(1, Math.min(MAX_TRIAGE_LIMIT, Math.floor(options.limit ?? 20)));
+    const candidates = findTriageCandidates({ project: options.project, limit });
+    let saved = 0;
+    let pending = 0;
+    const snapshot = (rowCap = limit) => ({ rows: rank(candidates, Math.min(limit, rowCap)), judged: candidates.some(c => c.expendability !== null), candidates: candidates.length, pending, saved });
+    const emit = () => { try {
+        options.onProgress?.(snapshot(PROGRESS_ROWS));
+    }
+    catch { /* a closed stream must not stop the judging */ } };
+    if (typesafeEnabled() && surfaceConfig('trash-triage').enabled) {
+        const model = typesafeConfig().model;
+        const bases = new Map(candidates.map(c => [c.id, expendabilityBasis(toCandidate(c), model)]));
+        saved = applySavedScores(candidates, bases);
+        const todo = candidates.filter(c => c.expendability === null);
+        const batches = [];
+        for (let i = 0; i < todo.length; i += BATCH)
+            batches.push(todo.slice(i, i + BATCH));
+        pending = todo.length;
+        if (pending && !typesafeRetryAfterMs())
+            emit();
+        for (let i = 0; i < batches.length; i += JUDGE_CONCURRENCY) {
+            if (typesafeRetryAfterMs() > 0)
+                break;
+            await Promise.allSettled(batches.slice(i, i + JUDGE_CONCURRENCY).map(async (batch) => {
+                const scores = await judgeExpendability(batch.map(toCandidate), { entityId: batch[0].id, origin: options.origin ?? 'tool', project: options.project ?? null, sessionId: null });
+                if (scores) {
+                    for (const c of batch) {
+                        const s = scores.get(c.id);
+                        if (s !== undefined)
+                            setScore(c, s);
+                    }
+                    saveScores(batch, bases);
+                }
+                pending -= batch.length;
+                if (pending > 0)
+                    emit();
+            }));
+        }
+        pending = 0;
+    }
+    return snapshot();
+}
+//# sourceMappingURL=memory-triage.js.map

package/mcp-server/dist/services/memory-triage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-triage.js","sourceRoot":"","sources":["../../src/services/memory-triage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AACpC,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,oBAAoB,EAA+B,MAAM,uBAAuB,CAAC;AAClI,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACrE,OAAO,EAAE,eAAe,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AAUtE,MAAM,WAAW,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,MAAM,KAAK,GAAG,EAAE,CAAC;AACjB,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,YAAY,GAAG,CAAC,GAAG,UAAU,CAAC;AACpC,6FAA6F;AAC7F,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAC;AACrC,oFAAoF;AACpF,MAAM,aAAa,GAAG,EAAE,CAAC;AAEzB,+CAA+C;AAC/C,MAAM,UAAU,oBAAoB,CAAC,UAAuD,EAAE;IAC5F,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;IAClB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACvF,MAAM,KAAK,GAAa,CAAC,sBAAsB,CAAC,CAAC;IACjD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QACpB,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QAC1E,KAAK,CAAC,IAAI,CAAC,wBAAwB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxE,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuE,CAAC;IAC5F,MAAM,GAAG,GAAG,CAAC,GAA4B,EAAE,MAAc,EAAE,cAA6B,IAAI,EAAE,EAAE;QAC9F,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,QAAQ,EAAE,CAAC;YAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAAC,IAAI,WAAW,IAAI,CAAC,QAAQ,CAAC,WAAW;gBAAE,QAAQ,CAAC,WAAW,GAAG,WAAW,CAAC;YAAC,OAAO;QAAC,CAAC;QAC9K,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;YACX,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC;YACxI,YAAY,EAAE,MAAM,CAAC,GAAG,CAAC,YAAY,IAAI,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC;YACrH,OAAO,EAAE,CAAC,MAAM,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW;SACjE,CAAC,CAAC;IACL,CAAC,CAAC;IACF,+EAA+E;IAC/E,gFAAgF;IAChF,2EAA2E;IAC3E,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC;;;YAGlB,KAAK;uCACsB,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;QAC7D,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,GAAG,CAAC,GAAG,EAAE,iBAAiB,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7H,CAAC;IACD,iDAAiD;IACjD,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC;;8EAEgD,KAAK,qCAAqC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;QAC9I,GAAG,CAAC,GAAG,EAAE,uBAAuB,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD,oCAAoC;IACpC,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,UAAU,CAAC,CAAC,WAAW,EAAE,CAAC;IACpE,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC;YAClB,KAAK,yGAAyG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;QACxJ,GAAG,CAAC,GAAG,EAAE,oDAAoD,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;SACtB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;SAC9H,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC;AAYD,MAAM,WAAW,GAAG,CAAC,CAAY,EAA0B,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC,UAAU,EAAE,WAAW,EAAE,CAAC,CAAC,YAAY,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;AAEnO,SAAS,QAAQ,CAAC,CAAY,EAAE,CAAS;IACvC,CAAC,CAAC,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtF,CAAC;AAED,SAAS,IAAI,CAAC,UAAuB,EAAE,KAAa;IAClD,OAAO,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnC,IAAI,CAAC,CAAC,aAAa,KAAK,IAAI,IAAI,CAAC,CAAC,aAAa,KAAK,IAAI,IAAI,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,aAAa;YAAE,OAAO,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC;QAC1I,IAAI,CAAC,CAAC,CAAC,aAAa,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,KAAK,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC,aAAa,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxG,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IACxH,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;AACpF,CAAC;AAED,wGAAwG;AACxG,SAAS,gBAAgB,CAAC,UAAuB,EAAE,KAA0B;IAC3E,IAAI,CAAC,UAAU,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC;0BACf,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1K,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,mBAAmB,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC;YAAE,SAAS;QAC1H,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC;QACvC,KAAK,EAAE,CAAC;IACV,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,6IAA6I;AAC7I,SAAS,UAAU,CAAC,KAAkB,EAAE,KAA0B;IAChE,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;IAClB,IAAI,CAAC;QAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO;IAAC,CAAC;IACpD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,uGAAuG,CAAC,CAAC;QAClI,MAAM,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,IAAI,CAAC,CAAC,aAAa,KAAK,IAAI;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,EAAE,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACpH,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnB,CAAC;IAAC,MAAM,CAAC;QACP,IAAI,CAAC;YAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,yBAAyB,CAAC,CAAC;IACjE,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,UAA8H,EAAE;IACnK,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACvF,MAAM,UAAU,GAAG,oBAAoB,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;IAC7E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,QAAQ,GAAG,CAAC,MAAM,GAAG,KAAK,EAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,KAAK,IAAI,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;IAChN,MAAM,IAAI,GAAG,GAAG,EAAE,GAAG,IAAI,CAAC;QAAC,OAAO,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC,CAAC,+CAA+C,CAAC,CAAC,CAAC,CAAC,CAAC;IACxI,IAAI,eAAe,EAAE,IAAI,aAAa,CAAC,cAAc,CAAC,CAAC,OAAO,EAAE,CAAC;QAC/D,MAAM,KAAK,GAAG,cAAc,EAAE,CAAC,KAAK,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,kBAAkB,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9F,KAAK,GAAG,gBAAgB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC5C,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,KAAK,IAAI,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACpF,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,OAAO,IAAI,CAAC,oBAAoB,EAAE;YAAE,IAAI,EAAE,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,iBAAiB,EAAE,CAAC;YAC3D,IAAI,oBAAoB,EAAE,GAAG,CAAC;gBAAE,MAAM;YACtC,MAAM,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,CAAC,GAAG,CAAC,KAAK,EAAC,KAAK,EAAC,EAAE;gBACjF,MAAM,MAAM,GAAG,MAAM,kBAAkB,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;gBAChL,IAAI,MAAM,EAAE,CAAC;oBACX,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;wBAAC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;wBAAC,IAAI,CAAC,KAAK,SAAS;4BAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAAC,CAAC;oBAC3F,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC3B,CAAC;gBACD,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC;gBACxB,IAAI,OAAO,GAAG,CAAC;oBAAE,IAAI,EAAE,CAAC;YAC1B,CAAC,CAAC,CAAC,CAAC;QACN,CAAC;QACD,OAAO,GAAG,CAAC,CAAC;IACd,CAAC;IACD,OAAO,QAAQ,EAAE,CAAC;AACpB,CAAC"}

package/mcp-server/dist/services/memory-verification.d.ts

@@ -0,0 +1,24 @@
+import type { DatabaseSync } from 'node:sqlite';
+/** One file's edit-time stale verdict, stored per memory in memory_metadata.stale_verdicts. */
+export interface StaleVerdictRecord {
+    p: number;
+    hash: string | null;
+    rev: number;
+    at: string;
+    session?: string | null;
+}
+export declare function readStaleVerdicts(raw: unknown): Record<string, StaleVerdictRecord>;
+/**
+ * File checks are asynchronous and bounded, never on the recall request path.
+ *
+ * Relative paths resolve against the memory's registered project root — the
+ * process running this job may be the Neural Interface or any stdio server, so
+ * its own cwd says nothing about where the file lives. A relative path that
+ * cannot be anchored, or that is missing once anchored, is `unknown` rather
+ * than `stale`: the base may be wrong, and "stale" makes recall say so.
+ *
+ * A changed checksum counts as current when an edit-time judgment of this
+ * exact file content and this revision found the memory still accurate.
+ */
+export declare function verifyMemorySources(d: DatabaseSync, id: string): Promise<void>;
+//# sourceMappingURL=memory-verification.d.ts.map

package/mcp-server/dist/services/memory-verification.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-verification.d.ts","sourceRoot":"","sources":["../../src/services/memory-verification.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAIhD,+FAA+F;AAC/F,MAAM,WAAW,kBAAkB;IAAG,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE;AAExH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAKlF;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,mBAAmB,CAAC,CAAC,EAAE,YAAY,EAAC,EAAE,EAAC,MAAM,iBAsClE"}

package/mcp-server/dist/services/memory-verification.js

@@ -0,0 +1,92 @@
+import { createReadStream } from 'node:fs';
+import { createHash } from 'node:crypto';
+import { isAbsolute, resolve } from 'node:path';
+import { projectRoot } from '../config.js';
+import { surfaceConfig } from './typesafe-config.js';
+export function readStaleVerdicts(raw) {
+    try {
+        const value = JSON.parse(String(raw || '{}'));
+        return value && typeof value === 'object' && !Array.isArray(value) ? value : {};
+    }
+    catch {
+        return {};
+    }
+}
+/**
+ * File checks are asynchronous and bounded, never on the recall request path.
+ *
+ * Relative paths resolve against the memory's registered project root — the
+ * process running this job may be the Neural Interface or any stdio server, so
+ * its own cwd says nothing about where the file lives. A relative path that
+ * cannot be anchored, or that is missing once anchored, is `unknown` rather
+ * than `stale`: the base may be wrong, and "stale" makes recall say so.
+ *
+ * A changed checksum counts as current when an edit-time judgment of this
+ * exact file content and this revision found the memory still accurate.
+ */
+export async function verifyMemorySources(d, id) {
+    const row = d.prepare('SELECT file_checksums,project FROM memories WHERE id=?').get(id);
+    if (!row)
+        return;
+    const revision = Number(d.prepare('SELECT MAX(revision) AS n FROM memory_revisions WHERE memory_id=?').get(id)?.n || 1);
+    let checks;
+    try {
+        checks = JSON.parse(String(row.file_checksums || '{}'));
+    }
+    catch {
+        checks = {};
+    }
+    const files = Object.entries(checks);
+    const base = projectRoot(String(row.project || ''));
+    const verdicts = readStaleVerdicts(d.prepare('SELECT stale_verdicts FROM memory_metadata WHERE memory_id=?').get(id)?.stale_verdicts);
+    const floor = surfaceConfig('edit-stale').minProbability ?? 0.4;
+    let unknown = !files.length || files.length > 10;
+    let stale = false;
+    for (const [file, expected] of files.slice(0, 10)) {
+        const relative = !isAbsolute(file);
+        const target = relative ? (base ? resolve(base, file) : null) : file;
+        if (!target) {
+            unknown = true;
+            continue;
+        }
+        const hash = createHash('sha256');
+        const stream = createReadStream(target, { highWaterMark: 64 * 1024 });
+        let bytes = 0;
+        try {
+            for await (const chunk of stream) {
+                bytes += chunk.length;
+                if (bytes > 4 * 1024 * 1024) {
+                    unknown = true;
+                    break;
+                }
+                hash.update(chunk);
+            }
+            if (bytes <= 4 * 1024 * 1024) {
+                const digest = hash.digest('hex');
+                const judged = verdicts[file];
+                const judgedAccurate = judged && judged.hash === digest && judged.rev === revision && judged.p >= floor;
+                if (digest !== expected && !judgedAccurate)
+                    stale = true;
+            }
+        }
+        catch (error) {
+            if (error.code === 'ENOENT') {
+                if (relative)
+                    unknown = true;
+                else
+                    stale = true;
+            }
+            else
+                unknown = true;
+        }
+        finally {
+            stream.destroy();
+        }
+    }
+    if (Number(d.prepare('SELECT MAX(revision) AS n FROM memory_revisions WHERE memory_id=?').get(id)?.n || 0) !== revision)
+        return;
+    d.prepare(`INSERT INTO memory_metadata(memory_id,verification,verified_revision,checked_at) VALUES(?,?,?,?)
+    ON CONFLICT(memory_id) DO UPDATE SET verification=excluded.verification,verified_revision=excluded.verified_revision,checked_at=excluded.checked_at`)
+        .run(id, stale ? 'stale' : unknown ? 'unknown' : 'current', revision, new Date().toISOString());
+}
+//# sourceMappingURL=memory-verification.js.map

package/mcp-server/dist/services/memory-verification.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-verification.js","sourceRoot":"","sources":["../../src/services/memory-verification.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEhD,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAC3C,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAKrD,MAAM,UAAU,iBAAiB,CAAC,GAAY;IAC5C,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;QAC9C,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAA2C,CAAC,CAAC,CAAC,EAAE,CAAC;IACxH,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,EAAE,CAAC;IAAC,CAAC;AACxB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,CAAe,EAAC,EAAS;IACjE,MAAM,GAAG,GAAC,CAAC,CAAC,OAAO,CAAC,wDAAwD,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtF,IAAG,CAAC,GAAG;QAAC,OAAO;IACf,MAAM,QAAQ,GAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,mEAAmE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACtH,IAAI,MAA6B,CAAC;IAClC,IAAI,CAAC;QAAA,MAAM,GAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,IAAI,IAAI,CAAC,CAAC,CAAC;IAAA,CAAC;IAAA,MAAK,CAAC;QAAA,MAAM,GAAC,EAAE,CAAC;IAAA,CAAC;IAC7E,MAAM,KAAK,GAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACnC,MAAM,IAAI,GAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAC,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,8DAA8D,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpI,MAAM,KAAK,GAAC,aAAa,CAAC,YAAY,CAAC,CAAC,cAAc,IAAI,GAAG,CAAC;IAC9D,IAAI,OAAO,GAAC,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,GAAC,EAAE,CAAC;IAC7C,IAAI,KAAK,GAAC,KAAK,CAAC;IAChB,KAAI,MAAM,CAAC,IAAI,EAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAC,EAAE,CAAC,EAAE,CAAC;QAC/C,MAAM,QAAQ,GAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,MAAM,GAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAClE,IAAG,CAAC,MAAM,EAAC,CAAC;YAAA,OAAO,GAAC,IAAI,CAAC;YAAA,SAAS;QAAA,CAAC;QACnC,MAAM,IAAI,GAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,MAAM,GAAC,gBAAgB,CAAC,MAAM,EAAC,EAAC,aAAa,EAAC,EAAE,GAAC,IAAI,EAAC,CAAC,CAAC;QAC9D,IAAI,KAAK,GAAC,CAAC,CAAC;QACZ,IAAI,CAAC;YACH,IAAI,KAAK,EAAC,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAChC,KAAK,IAAE,KAAK,CAAC,MAAM,CAAC;gBACpB,IAAG,KAAK,GAAC,CAAC,GAAC,IAAI,GAAC,IAAI,EAAC,CAAC;oBAAA,OAAO,GAAC,IAAI,CAAC;oBAAA,MAAM;gBAAA,CAAC;gBAC1C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;YACD,IAAG,KAAK,IAAE,CAAC,GAAC,IAAI,GAAC,IAAI,EAAE,CAAC;gBACtB,MAAM,MAAM,GAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAChC,MAAM,MAAM,GAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC5B,MAAM,cAAc,GAAC,MAAM,IAAI,MAAM,CAAC,IAAI,KAAG,MAAM,IAAI,MAAM,CAAC,GAAG,KAAG,QAAQ,IAAI,MAAM,CAAC,CAAC,IAAE,KAAK,CAAC;gBAChG,IAAG,MAAM,KAAG,QAAQ,IAAI,CAAC,cAAc;oBAAC,KAAK,GAAC,IAAI,CAAC;YACrD,CAAC;QACH,CAAC;QAAA,OAAM,KAAK,EAAC,CAAC;YAAA,IAAI,KAA+B,CAAC,IAAI,KAAG,QAAQ,EAAC,CAAC;gBAAA,IAAG,QAAQ;oBAAC,OAAO,GAAC,IAAI,CAAC;;oBAAK,KAAK,GAAC,IAAI,CAAC;YAAA,CAAC;;gBAAK,OAAO,GAAC,IAAI,CAAC;QAAA,CAAC;gBACzH,CAAC;YAAA,MAAM,CAAC,OAAO,EAAE,CAAC;QAAA,CAAC;IAC5B,CAAC;IACD,IAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,mEAAmE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAG,QAAQ;QAAC,OAAO;IAC5H,CAAC,CAAC,OAAO,CAAC;wJAC4I,CAAC;SACpJ,GAAG,CAAC,EAAE,EAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,EAAC,QAAQ,EAAC,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;AACjG,CAAC"}

package/mcp-server/dist/services/memory-writer.d.ts

@@ -0,0 +1,26 @@
+import { type JudgeContext } from './memory-judgments.js';
+import type { MemoryPayload } from '../types.js';
+export declare class IdempotencyConflict extends Error {
+}
+export interface WriteMemoryOptions {
+    idempotencyKey?: string;
+    kind?: string;
+    sourceRef?: string | null;
+    existingId?: string;
+    /** The id a new row gets, chosen by the caller so its judgments can be logged against it. */
+    id?: string;
+    /** Attribution for the duplicate-gate judgment. */
+    judge?: JudgeContext;
+}
+export interface WriteMemoryResult {
+    id: string;
+    existing: boolean;
+    pending: boolean;
+    /** Set when the duplicate gate refused the write: `id` is the memory it duplicates. */
+    duplicate?: {
+        probability: number;
+    };
+}
+/** The receipt and new memory commit together, across MCP and hook processes. */
+export declare function writeMemory(payload: MemoryPayload, options?: WriteMemoryOptions): Promise<WriteMemoryResult>;
+//# sourceMappingURL=memory-writer.d.ts.map

package/mcp-server/dist/services/memory-writer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-writer.d.ts","sourceRoot":"","sources":["../../src/services/memory-writer.ts"],"names":[],"mappings":"AAMA,OAAO,EAAmB,KAAK,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAE3E,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAEjD,qBAAa,mBAAoB,SAAQ,KAAK;CAAG;AAEjD,MAAM,WAAW,kBAAkB;IACjC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAE1B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,6FAA6F;IAC7F,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,mDAAmD;IACnD,KAAK,CAAC,EAAE,YAAY,CAAC;CACtB;AAED,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,OAAO,CAAC;IAClB,OAAO,EAAE,OAAO,CAAC;IACjB,uFAAuF;IACvF,SAAS,CAAC,EAAE;QAAE,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC;CACrC;AA8BD,iFAAiF;AACjF,wBAAsB,WAAW,CAAC,OAAO,EAAE,aAAa,EAAE,OAAO,GAAE,kBAAuB,GAAG,OAAO,CAAC,iBAAiB,CAAC,CA+DtH"}

package/mcp-server/dist/services/memory-writer.js

@@ -0,0 +1,126 @@
+import { randomUUID, createHash } from 'node:crypto';
+import { getDb, upsertMemory, memoryVectors } from './sqlite.js';
+import { generateEmbedding } from './local-embeddings.js';
+import { invalidateCache } from './neural-interface.js';
+import { projectAliases } from '../config.js';
+import { judgeDuplicates } from './memory-judgments.js';
+import { surfaceConfig } from './typesafe-config.js';
+export class IdempotencyConflict extends Error {
+}
+/** Cosine floor for "worth asking": generous, because the judgment decides. */
+const DUPLICATE_CANDIDATE_THRESHOLD = 0.9;
+/**
+ * Before insert, ask whether the new memory restates a fact already stored
+ * in the same project. Judged before any transaction; a null judgment means
+ * "store it" — maintenance still relates duplicates after the fact.
+ */
+async function duplicateGate(d, vector, payload, context = {}) {
+    const settings = surfaceConfig('duplicate-gate');
+    if (!settings.enabled)
+        return null;
+    const aliases = projectAliases(payload.project).map(p => p.toLowerCase());
+    const ids = new Set(d.prepare(`SELECT id FROM memories WHERE trashed_at IS NULL AND lower(project) IN (${aliases.map(() => '?').join(',')})`).all(...aliases).map(r => String(r.id)));
+    if (!ids.size)
+        return null;
+    const hits = memoryVectors.topK(vector, 3, DUPLICATE_CANDIDATE_THRESHOLD, ids);
+    if (!hits.length)
+        return null;
+    const candidates = hits.map(hit => {
+        const row = d.prepare('SELECT content,created_at FROM memories WHERE id=? AND trashed_at IS NULL').get(hit.id);
+        return { id: hit.id, content: String(row?.content ?? ''), recordedAt: row?.created_at ? String(row.created_at) : undefined };
+    }).filter(c => c.content);
+    if (!candidates.length)
+        return null;
+    const verdicts = await judgeDuplicates(payload.content, candidates, context);
+    if (!verdicts?.size)
+        return null;
+    let best = null;
+    for (const [id, probability] of verdicts)
+        if (!best || probability > best.probability)
+            best = { id, probability };
+    return best && best.probability >= (settings.minConfidence ?? 0.85) ? best : null;
+}
+/** The receipt and new memory commit together, across MCP and hook processes. */
+export async function writeMemory(payload, options = {}) {
+    const d = getDb();
+    const hash = createHash('sha256').update(payload.content).digest('hex');
+    const findRetry = () => options.idempotencyKey ? d.prepare(`
+    SELECT m.id, md.request_hash FROM memory_metadata md JOIN memories m ON m.id=md.memory_id
+    WHERE md.project=? AND md.category=? AND md.idempotency_key=?
+  `).get(payload.project, payload.category, options.idempotencyKey) : undefined;
+    const receipt = (row) => {
+        if (row.request_hash !== hash)
+            throw new IdempotencyConflict('Idempotency key already belongs to different content.');
+        return { id: String(row.id), existing: true, pending: false };
+    };
+    const previous = findRetry();
+    if (previous)
+        return receipt(previous);
+    // Check the old hook tracker inside the same transaction used by new writes.
+    const adopt = () => {
+        if (!options.existingId || !options.idempotencyKey)
+            return undefined;
+        const row = d.prepare(`SELECT m.id, md.idempotency_key FROM memories m
+      LEFT JOIN memory_metadata md ON md.memory_id=m.id
+      WHERE m.id=? AND m.project=? AND m.category=? AND m.content=? AND m.source=? AND m.trashed_at IS NULL`)
+            .get(options.existingId, payload.project, payload.category, payload.content, payload.source);
+        if (!row || (row.idempotency_key && row.idempotency_key !== options.idempotencyKey))
+            return undefined;
+        d.prepare(`INSERT INTO memory_metadata(memory_id,kind,source_ref,content_hash,idempotency_key,project,category,request_hash)
+      VALUES(?,?,?,?,?,?,?,?) ON CONFLICT(memory_id) DO UPDATE SET idempotency_key=excluded.idempotency_key,request_hash=excluded.request_hash`)
+            .run(row.id, options.kind || 'note', options.sourceRef || null, hash, options.idempotencyKey, payload.project, payload.category, hash);
+        return { id: String(row.id), existing: true, pending: false };
+    };
+    if (options.existingId) {
+        d.exec('BEGIN IMMEDIATE');
+        try {
+            const found = findRetry();
+            const adopted = found ? receipt(found) : adopt();
+            d.exec('COMMIT');
+            if (adopted)
+                return adopted;
+        }
+        catch (error) {
+            d.exec('ROLLBACK');
+            throw error;
+        }
+    }
+    let pending = false;
+    let vector;
+    try {
+        vector = await generateEmbedding(payload.content);
+    }
+    catch {
+        vector = new Array(384).fill(0);
+        pending = true;
+    }
+    // The gate needs a real vector to find candidates; a pending embedding
+    // means maintenance will judge relations once it exists.
+    if (!pending) {
+        const duplicate = await duplicateGate(d, vector, payload, options.judge);
+        if (duplicate)
+            return { id: duplicate.id, existing: true, pending: false, duplicate: { probability: duplicate.probability } };
+    }
+    const id = options.id ?? randomUUID();
+    d.exec('BEGIN IMMEDIATE');
+    try {
+        const retry = findRetry();
+        if (retry) {
+            const result = receipt(retry);
+            d.exec('COMMIT');
+            return result;
+        }
+        upsertMemory(id, vector, payload);
+        d.prepare('INSERT INTO memory_metadata(memory_id,kind,source_ref,content_hash,idempotency_key,project,category,request_hash) VALUES(?,?,?,?,?,?,?,?)')
+            .run(id, options.kind || 'note', options.sourceRef || null, hash, options.idempotencyKey || null, payload.project, payload.category, hash);
+        d.exec('COMMIT');
+    }
+    catch (error) {
+        d.exec('ROLLBACK');
+        memoryVectors.invalidate();
+        throw error;
+    }
+    invalidateCache('remember', id);
+    return { id, existing: false, pending };
+}
+//# sourceMappingURL=memory-writer.js.map

package/mcp-server/dist/services/memory-writer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-writer.js","sourceRoot":"","sources":["../../src/services/memory-writer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAErD,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACjE,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAqB,MAAM,uBAAuB,CAAC;AAC3E,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAGrD,MAAM,OAAO,mBAAoB,SAAQ,KAAK;CAAG;AAsBjD,+EAA+E;AAC/E,MAAM,6BAA6B,GAAG,GAAG,CAAC;AAE1C;;;;GAIG;AACH,KAAK,UAAU,aAAa,CAAC,CAAe,EAAE,MAAgB,EAAE,OAAsB,EAAE,UAAwB,EAAE;IAChH,MAAM,QAAQ,GAAG,aAAa,CAAC,gBAAgB,CAAC,CAAC;IACjD,IAAI,CAAC,QAAQ,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IAC1E,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,2EAA2E,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACtL,IAAI,CAAC,GAAG,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAC3B,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,6BAA6B,EAAE,GAAG,CAAC,CAAC;IAC/E,IAAI,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;QAChC,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,2EAA2E,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAA0D,CAAC;QACxK,OAAO,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,OAAO,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC/H,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IAC1B,IAAI,CAAC,UAAU,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC,OAAO,CAAC,OAAO,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IAC7E,IAAI,CAAC,QAAQ,EAAE,IAAI;QAAE,OAAO,IAAI,CAAC;IACjC,IAAI,IAAI,GAA+C,IAAI,CAAC;IAC5D,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,QAAQ;QAAE,IAAI,CAAC,IAAI,IAAI,WAAW,GAAG,IAAI,CAAC,WAAW;YAAE,IAAI,GAAG,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC;IAClH,OAAO,IAAI,IAAI,IAAI,CAAC,WAAW,IAAI,CAAC,QAAQ,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACpF,CAAC;AAED,iFAAiF;AACjF,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,OAAsB,EAAE,UAA8B,EAAE;IACxF,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;IAClB,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACxE,MAAM,SAAS,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;;;GAG1D,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC9E,MAAM,OAAO,GAAG,CAAC,GAA4B,EAAE,EAAE;QAC/C,IAAI,GAAG,CAAC,YAAY,KAAK,IAAI;YAAE,MAAM,IAAI,mBAAmB,CAAC,uDAAuD,CAAC,CAAC;QACtH,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAChE,CAAC,CAAC;IACF,MAAM,QAAQ,GAAG,SAAS,EAAE,CAAC;IAC7B,IAAI,QAAQ;QAAE,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;IAEvC,6EAA6E;IAC7E,MAAM,KAAK,GAAG,GAAG,EAAE;QACjB,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,CAAC,OAAO,CAAC,cAAc;YAAE,OAAO,SAAS,CAAC;QACrE,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC;;4GAEkF,CAAC;aACtG,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QAC/F,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,IAAI,GAAG,CAAC,eAAe,KAAK,OAAO,CAAC,cAAc,CAAC;YAAE,OAAO,SAAS,CAAC;QACtG,CAAC,CAAC,OAAO,CAAC;+IACiI,CAAC;aACzI,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,IAAI,MAAM,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,cAAc,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACzI,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAChE,CAAC,CAAC;IACF,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACvB,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC1B,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,SAAS,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YACjD,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACjB,IAAI,OAAO;gBAAE,OAAO,OAAO,CAAC;QAC9B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAAC,MAAM,KAAK,CAAC;QAAC,CAAC;IACtD,CAAC;IAED,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,IAAI,MAAgB,CAAC;IACrB,IAAI,CAAC;QAAC,MAAM,GAAG,MAAM,iBAAiB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAAC,CAAC;IAC1D,MAAM,CAAC;QAAC,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAAC,OAAO,GAAG,IAAI,CAAC;IAAC,CAAC;IAC1D,uEAAuE;IACvE,yDAAyD;IACzD,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,SAAS,GAAG,MAAM,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QACzE,IAAI,SAAS;YAAE,OAAO,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,WAAW,EAAE,SAAS,CAAC,WAAW,EAAE,EAAE,CAAC;IAChI,CAAC;IACD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,IAAI,UAAU,EAAE,CAAC;IACtC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAC1B,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,SAAS,EAAE,CAAC;QAC1B,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YAC9B,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACjB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QAClC,CAAC,CAAC,OAAO,CAAC,2IAA2I,CAAC;aACnJ,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,IAAI,MAAM,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,cAAc,IAAI,IAAI,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC7I,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAAC,aAAa,CAAC,UAAU,EAAE,CAAC;QAAC,MAAM,KAAK,CAAC;IAAC,CAAC;IAChF,eAAe,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;IAChC,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AAC1C,CAAC"}