wyrm-mcp 7.2.0 → 7.2.2

package/dist/memory-artifacts.js

@@ -1,67 +1,9 @@
-/**
- * Wyrm Memory Artifacts — Distilled knowledge for AI intelligence amplification.
- *
- * Stores problem-solution records, lessons, patterns, and anti-patterns that
- * help AI models recall what worked in the past and apply it to new tasks.
- *
- * @copyright 2026 Ghost Protocol (Pvt) Ltd.
- * @license AGPL-3.0-or-later — dual-licensed; commercial terms: ghosts.lk@proton.me. See LICENSE.
- */
-import { emitEvent } from './events.js';
-import { sanitizeFtsQuery, buildFtsMatchQuery } from './security.js';
-import { getActor } from './handlers/boundary.js';
-import { buildPage, DEFAULT_PAGE_SIZE } from './keyset.js';
-/** Maximum artifacts returned from a recall query (before reranking) */
-const MAX_CANDIDATES = 40;
-/** Maximum artifacts included in a context brief */
-const MAX_BRIEF_ITEMS = 10;
-/** Minimum confidence to include in auto-generated briefs */
-const MIN_BRIEF_CONFIDENCE = 0.3;
-export class MemoryArtifacts {
-    db;
-    /** Optional dense-vector index — when set, `recallHybrid` fuses FTS + vectors (RRF). */
-    vectorStore;
-    setVectorStore(vs) { this.vectorStore = vs; }
-    constructor(db) {
-        this.db = db;
-    }
-    /** Best-effort dense-vector index of an ACTIVE artifact. Fire-and-forget: embedding
-     * is async + may be unavailable (Ollama down) — it must never block or break add(). */
-    indexArtifact(a) {
-        if (!this.vectorStore)
-            return;
-        const text = `${a.problem}${a.validated_fix ? ' ' + a.validated_fix : ''}`.slice(0, 2000);
-        void this.vectorStore.addVector(text, 'artifact', a.id, a.project_id).catch(() => { });
-    }
-    // ==================== CRUD ====================
-    add(projectId, opts) {
-        const tags = opts.tags?.length ? opts.tags.join(',') : null;
-        // v7 F2 (T009): stamp the writing actor (NULL outside a fleet context).
-        // `created_by` keeps its 6.x display semantics untouched.
-        const ambient = getActor();
-        const result = this.db.prepare(`
+import{emitEvent as y}from"./events.js";import{sanitizeFtsQuery as v,buildFtsMatchQuery as k}from"./security.js";import{getActor as w}from"./handlers/boundary.js";import{buildPage as b,DEFAULT_PAGE_SIZE as T}from"./keyset.js";const D=40,M=10,I=.3;class U{db;vectorStore;setVectorStore(t){this.vectorStore=t}constructor(t){this.db=t}indexArtifact(t){if(!this.vectorStore)return;const e=`${t.problem}${t.validated_fix?" "+t.validated_fix:""}`.slice(0,2e3);this.vectorStore.addVector(e,"artifact",t.id,t.project_id).catch(()=>{})}add(t,e){const n=e.tags?.length?e.tags.join(","):null,i=w(),a=this.db.prepare(`
       INSERT INTO memory_artifacts
         (project_id, kind, problem, constraints, validated_fix, why_it_worked,
          outcome, source_session_id, tags, confidence, needs_review, created_by, agent_id, run_id)
       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
-    `).run(projectId, opts.kind, opts.problem.trim(), opts.constraints?.trim() ?? null, opts.validatedFix?.trim() ?? null, opts.whyItWorked?.trim() ?? null, opts.outcome ?? 'neutral', opts.sourceSessionId ?? null, tags, opts.confidence ?? 1.0, opts.needsReview ?? 0, opts.createdBy ?? 'local', ambient.agent_id, ambient.run_id);
-        const artifact = this.get(result.lastInsertRowid);
-        // Live Memory: emit ONLY for active memories. Review-queue candidates
-        // (harvest dumps 1000s with needsReview=1) must not flood the event log.
-        if (!opts.needsReview) {
-            emitEvent(this.db, {
-                projectId, kind: 'capture', refTable: 'memory_artifacts', refId: artifact.id,
-                isShared: !!artifact.is_shared,
-            });
-            this.indexArtifact(artifact); // best-effort dense index for hybrid recall
-        }
-        return artifact;
-    }
-    get(id) {
-        return this.db.prepare('SELECT * FROM memory_artifacts WHERE id = ?').get(id) ?? null;
-    }
-    update(id, updates) {
-        this.db.prepare(`
+    `).run(t,e.kind,e.problem.trim(),e.constraints?.trim()??null,e.validatedFix?.trim()??null,e.whyItWorked?.trim()??null,e.outcome??"neutral",e.sourceSessionId??null,n,e.confidence??1,e.needsReview??0,e.createdBy??"local",i.agent_id,i.run_id),r=this.get(a.lastInsertRowid);return e.needsReview||(y(this.db,{projectId:t,kind:"capture",refTable:"memory_artifacts",refId:r.id,isShared:!!r.is_shared}),this.indexArtifact(r)),r}get(t){return this.db.prepare("SELECT * FROM memory_artifacts WHERE id = ?").get(t)??null}update(t,e){return this.db.prepare(`
       UPDATE memory_artifacts SET
         confidence = COALESCE(?, confidence),
         validated_fix = COALESCE(?, validated_fix),
@@ -70,182 +12,17 @@ export class MemoryArtifacts {
         needs_review = COALESCE(?, needs_review),
         updated_at = datetime('now')
       WHERE id = ?
-    `).run(updates.confidence ?? null, updates.validated_fix ?? null, updates.why_it_worked ?? null, updates.last_validated_at ?? null, updates.needs_review ?? null, id);
-        return this.get(id);
-    }
-    /** Mark an artifact as superseded by a newer/better one. */
-    markSuperseded(oldId, newId) {
-        this.db.prepare('UPDATE memory_artifacts SET supersedes_id = ?, updated_at = datetime(\'now\') WHERE id = ?').run(newId, oldId);
-    }
-    /** Record that an artifact was used and whether it helped. */
-    recordFeedback(id, success) {
-        const col = success ? 'reuse_success_count' : 'reuse_failure_count';
-        this.db.prepare(`
+    `).run(e.confidence??null,e.validated_fix??null,e.why_it_worked??null,e.last_validated_at??null,e.needs_review??null,t),this.get(t)}markSuperseded(t,e){this.db.prepare("UPDATE memory_artifacts SET supersedes_id = ?, updated_at = datetime('now') WHERE id = ?").run(e,t)}recordFeedback(t,e){const n=e?"reuse_success_count":"reuse_failure_count";this.db.prepare(`
       UPDATE memory_artifacts SET
         reuse_count = reuse_count + 1,
-        ${col} = ${col} + 1,
+        ${n} = ${n} + 1,
         confidence = CASE
           WHEN ? THEN MIN(1.0, confidence + 0.05)
           ELSE MAX(0.0, confidence - 0.1)
         END,
         updated_at = datetime('now')
       WHERE id = ?
-    `).run(success ? 1 : 0, id);
-    }
-    // ==================== RETRIEVAL ====================
-    /**
-     * 2-stage retrieval: FTS candidates → sort by weighted relevance.
-     * Excludes superseded artifacts and those below minConfidence.
-     */
-    recall(projectId, query, opts = {}) {
-        const limit = opts.limit ?? 10;
-        const minConf = opts.minConfidence ?? 0.0;
-        // Stage 1: FTS candidates
-        const ftsCandidates = this.searchByFts(projectId, query, MAX_CANDIDATES, opts.kind, minConf);
-        // Stage 2: Tag candidates (exact tag matches not covered by FTS)
-        const tagCandidates = this.searchByTags(projectId, query, MAX_CANDIDATES, opts.kind, minConf);
-        // Merge and dedupe by id
-        const seen = new Set();
-        const merged = [];
-        // ftsCandidates arrive in bm25 order (best first) — keep the rank so the score
-        // below preserves it instead of flattening every FTS hit to one value.
-        ftsCandidates.forEach((a, i) => {
-            seen.add(a.id);
-            merged.push({ artifact: a, inFts: true, inTag: false, ftsRank: i });
-        });
-        for (const a of tagCandidates) {
-            if (!seen.has(a.id)) {
-                seen.add(a.id);
-                merged.push({ artifact: a, inFts: false, inTag: true });
-            }
-            else {
-                const existing = merged.find(m => m.artifact.id === a.id);
-                if (existing)
-                    existing.inTag = true;
-            }
-        }
-        // Score and rerank — also enforce minConf as a safety net
-        const results = merged
-            .filter(({ artifact }) => artifact.confidence >= minConf)
-            .map(({ artifact, inFts, inTag, ftsRank }) => {
-            // bm25 rank is the PRIMARY signal: earlier FTS candidates (lower rank) score
-            // higher, so the query's relevance ordering survives the merge/re-sort.
-            let relevance;
-            if (inFts) {
-                const rankScore = 1 - (ftsRank ?? 0) / (ftsCandidates.length + 1); // ~1.0 best → ~0 worst
-                relevance = (inTag ? 0.7 : 0.55) + 0.45 * rankScore; // 0.55..1.0 for FTS hits
-            }
-            else {
-                relevance = 0.4; // tag-only match
-            }
-            // Boost by confidence
-            relevance *= artifact.confidence;
-            // Boost positive outcomes slightly
-            if (artifact.outcome === 'positive')
-                relevance *= 1.1;
-            // Freshness: decay slowly over 180 days
-            const daysSinceValidated = (Date.now() - new Date(artifact.last_validated_at).getTime()) / (1000 * 60 * 60 * 24);
-            const freshnessScore = Math.max(0.5, 1.0 - daysSinceValidated / 180);
-            relevance *= freshnessScore;
-            return {
-                artifact,
-                relevance_score: Math.min(1.0, relevance),
-                match_type: (inFts && inTag ? 'both' : inFts ? 'fts' : 'tag'),
-            };
-        });
-        return results.sort((a, b) => b.relevance_score - a.relevance_score).slice(0, limit);
-    }
-    /**
-     * Hybrid recall: FTS (bm25) ⊕ dense vectors (cosine), fused by convex score-blend
-     * (default, α=0.7) or RRF (WYRM_RERANK_FUSION=rrf). Gracefully degrades to lexical
-     * `recall()` when no vector store is wired or the embedding provider is unavailable.
-     * Async (embedding the query is async). Measured on real LoCoMo (nomic-embed-text,
-     * local): FTS recall@10 59.9% → hybrid+RRF 72.2% → hybrid+convex recall@5 62.1% / @10 72.7%.
-     */
-    async recallHybrid(projectId, query, opts = {}) {
-        const limit = opts.limit ?? 10;
-        const minConf = opts.minConfidence ?? 0.0;
-        if (!this.vectorStore)
-            return this.recall(projectId, query, opts); // no vectors → lexical
-        // Candidate depth 50 (LoCoMo-grid-tuned): convex fusion tolerates depth where
-        // RRF dilutes — raising RRF's depth actually regressed recall@10 in the sweep.
-        const CAND = Math.max(50, limit * 5);
-        const ftsCands = this.searchByFts(projectId, query, CAND, opts.kind, minConf);
-        let vecScored = [];
-        try {
-            const hits = await this.vectorStore.search(query, CAND, projectId, ['artifact']);
-            vecScored = hits.map((h) => ({ id: h.content_id, s: h.similarity })); // keep cosine for convex fusion
-        }
-        catch { /* provider down → fall through to FTS-only */ }
-        if (vecScored.length === 0)
-            return this.recall(projectId, query, opts); // nothing indexed yet
-        // Fusion. DEFAULT = convex score-blend: α·(min-max-normalized cosine) +
-        // (1-α)·(rank-normalized FTS). Won the LoCoMo grid (recall@5 60.3%→62.1%,
-        // recall@10 →72.7% at α=0.7, cand=50) vs RRF. WYRM_RERANK_FUSION=rrf falls back.
-        const RRF_K = 60;
-        const rawAlpha = Number(process.env.WYRM_RERANK_ALPHA); // dense-vector weight
-        const ALPHA = Number.isFinite(rawAlpha) ? Math.max(0, Math.min(1, rawAlpha)) : 0.7; // NaN / out-of-range / "0.7x" → 0.7
-        const score = new Map();
-        if (process.env.WYRM_RERANK_FUSION === 'rrf') {
-            ftsCands.forEach((a, r) => score.set(a.id, (score.get(a.id) ?? 0) + 1 / (RRF_K + r + 1)));
-            vecScored.forEach((x, r) => score.set(x.id, (score.get(x.id) ?? 0) + 1 / (RRF_K + r + 1)));
-        }
-        else {
-            const fn = ftsCands.length + 1; // FTS has no bm25 score exposed here → rank-normalize
-            ftsCands.forEach((a, r) => score.set(a.id, (score.get(a.id) ?? 0) + (1 - ALPHA) * (1 - r / fn)));
-            const ss = vecScored.map((x) => x.s), lo = Math.min(...ss), hi = Math.max(...ss), span = hi - lo;
-            vecScored.forEach((x) => score.set(x.id, (score.get(x.id) ?? 0) + ALPHA * (span > 1e-9 ? (x.s - lo) / span : 1)));
-        }
-        const ftsIds = new Set(ftsCands.map((a) => a.id));
-        const vecIds = new Set(vecScored.map((x) => x.id));
-        const byId = new Map(ftsCands.map((a) => [a.id, a]));
-        const ranked = [...score.entries()].sort((a, b) => b[1] - a[1]);
-        const top = ranked[0]?.[1] ?? 1;
-        const out = [];
-        for (const [id, s] of ranked) {
-            if (out.length >= limit)
-                break;
-            const art = byId.get(id) ?? this.get(id) ?? undefined;
-            if (!art)
-                continue;
-            // Vector-only hits bypass the FTS WHERE-clause, so enforce the same filters here.
-            if (art.confidence < minConf || art.needs_review === 1 || art.supersedes_id != null)
-                continue;
-            if (opts.kind && art.kind !== opts.kind)
-                continue;
-            const match_type = ftsIds.has(id) && vecIds.has(id) ? 'hybrid' : vecIds.has(id) ? 'vector' : 'fts';
-            out.push({ artifact: art, relevance_score: Math.min(1, s / top), match_type });
-        }
-        return out;
-    }
-    searchByFts(projectId, query, limit, kind, minConf = 0.0) {
-        // Build a SAFE FTS5 MATCH query (OR-joined quoted terms). The old code passed
-        // the raw natural-language query — punctuation like "?" made FTS5 throw, so EVERY
-        // recall silently fell back to listRecent() (recency, not relevance). Use the same
-        // helpers the rest of the search surface uses; ORDER BY rank gives bm25 ranking.
-        // sanitizeFtsQuery THROWS on an empty-after-sanitization query (e.g. an
-        // operator-/punctuation-only input). That must degrade to recency, never
-        // throw out of recall()/context_build() — guard it.
-        let match = '';
-        try {
-            const sanitized = sanitizeFtsQuery(query);
-            match = sanitized ? buildFtsMatchQuery(sanitized) : '';
-        }
-        catch {
-            return this.listRecent(projectId, limit, kind);
-        }
-        if (!match)
-            return this.listRecent(projectId, limit, kind);
-        const kindClause = kind ? 'AND a.kind = ?' : '';
-        const params = [match, projectId, minConf];
-        if (kind)
-            params.push(kind);
-        params.push(limit);
-        try {
-            // NB: reference the FTS table by its FULL NAME in MATCH, not an alias —
-            // `<alias> MATCH ?` throws "no such column" in SQLite FTS5, which is what sent
-            // every recall into the listRecent() fallback (recency instead of relevance).
-            return this.db.prepare(`
+    `).run(e?1:0,t)}recall(t,e,n={}){const i=n.limit??10,a=n.minConfidence??0,r=this.searchByFts(t,e,D,n.kind,a),o=this.searchByTags(t,e,D,n.kind,a),l=new Set,_=[];r.forEach((d,c)=>{l.add(d.id),_.push({artifact:d,inFts:!0,inTag:!1,ftsRank:c})});for(const d of o)if(!l.has(d.id))l.add(d.id),_.push({artifact:d,inFts:!1,inTag:!0});else{const c=_.find(p=>p.artifact.id===d.id);c&&(c.inTag=!0)}return _.filter(({artifact:d})=>d.confidence>=a).map(({artifact:d,inFts:c,inTag:p,ftsRank:E})=>{let f;if(c){const R=1-(E??0)/(r.length+1);f=(p?.7:.55)+.45*R}else f=.4;f*=d.confidence,d.outcome==="positive"&&(f*=1.1);const h=(Date.now()-new Date(d.last_validated_at).getTime())/(1e3*60*60*24),A=Math.max(.5,1-h/180);return f*=A,{artifact:d,relevance_score:Math.min(1,f),match_type:c&&p?"both":c?"fts":"tag"}}).sort((d,c)=>c.relevance_score-d.relevance_score).slice(0,i)}async recallHybrid(t,e,n={}){const i=n.limit??10,a=n.minConfidence??0;if(!this.vectorStore)return this.recall(t,e,n);const r=Math.max(50,i*5),o=this.searchByFts(t,e,r,n.kind,a);let l=[];try{l=(await this.vectorStore.search(e,r,t,["artifact"])).map(u=>({id:u.content_id,s:u.similarity}))}catch{}if(l.length===0)return this.recall(t,e,n);const _=60,m=Number(process.env.WYRM_RERANK_ALPHA),d=Number.isFinite(m)?Math.max(0,Math.min(1,m)):.7,c=new Map;if(process.env.WYRM_RERANK_FUSION==="rrf")o.forEach((s,u)=>c.set(s.id,(c.get(s.id)??0)+1/(_+u+1))),l.forEach((s,u)=>c.set(s.id,(c.get(s.id)??0)+1/(_+u+1)));else{const s=o.length+1;o.forEach((C,L)=>c.set(C.id,(c.get(C.id)??0)+(1-d)*(1-L/s)));const u=l.map(C=>C.s),S=Math.min(...u),N=Math.max(...u),g=N-S;l.forEach(C=>c.set(C.id,(c.get(C.id)??0)+d*(g>1e-9?(C.s-S)/g:1)))}const p=new Set(o.map(s=>s.id)),E=new Set(l.map(s=>s.id)),f=new Map(o.map(s=>[s.id,s])),h=[...c.entries()].sort((s,u)=>u[1]-s[1]),A=h[0]?.[1]??1,R=[];for(const[s,u]of h){if(R.length>=i)break;const S=f.get(s)??this.get(s)??void 0;if(!S||S.confidence<a||S.needs_review===1||S.supersedes_id!=null||n.kind&&S.kind!==n.kind)continue;const N=p.has(s)&&E.has(s)?"hybrid":E.has(s)?"vector":"fts";R.push({artifact:S,relevance_score:Math.min(1,u/A),match_type:N})}return R}searchByFts(t,e,n,i,a=0){let r="";try{const _=v(e);r=_?k(_):""}catch{return this.listRecent(t,n,i)}if(!r)return this.listRecent(t,n,i);const o=i?"AND a.kind = ?":"",l=[r,t,a];i&&l.push(i),l.push(n);try{return this.db.prepare(`
         SELECT a.* FROM memory_artifacts a
         JOIN memory_artifacts_fts ON a.id = memory_artifacts_fts.rowid
         WHERE memory_artifacts_fts MATCH ?
@@ -253,249 +30,53 @@ export class MemoryArtifacts {
           AND a.confidence >= ?
           AND a.supersedes_id IS NULL
           AND a.needs_review = 0
-          ${kindClause}
+          ${o}
         ORDER BY rank, a.confidence DESC
         LIMIT ?
-      `).all(...params);
-        }
-        catch {
-            return this.listRecent(projectId, limit, kind);
-        }
-    }
-    searchByTags(projectId, query, limit, kind, minConf = 0.0) {
-        // Match any word in the query against tags
-        const words = query.toLowerCase().split(/\s+/).filter(w => w.length > 2);
-        if (!words.length)
-            return [];
-        // Escape LIKE wildcards in user input to prevent injection
-        const escapeLike = (s) => s.replace(/[%_\\]/g, '\\$&');
-        const likeClause = words.map(() => "LOWER(tags) LIKE ? ESCAPE '\\'").join(' OR ');
-        const likeParams = words.map(w => `%${escapeLike(w)}%`);
-        const kindClause = kind ? 'AND kind = ?' : '';
-        const params = [projectId, minConf, ...likeParams];
-        if (kind)
-            params.push(kind);
-        params.push(limit);
-        return this.db.prepare(`
+      `).all(...l)}catch{return this.listRecent(t,n,i)}}searchByTags(t,e,n,i,a=0){const r=e.toLowerCase().split(/\s+/).filter(c=>c.length>2);if(!r.length)return[];const o=c=>c.replace(/[%_\\]/g,"\\$&"),l=r.map(()=>"LOWER(tags) LIKE ? ESCAPE '\\'").join(" OR "),_=r.map(c=>`%${o(c)}%`),m=i?"AND kind = ?":"",d=[t,a,..._];return i&&d.push(i),d.push(n),this.db.prepare(`
       SELECT * FROM memory_artifacts
       WHERE project_id = ? AND confidence >= ? AND supersedes_id IS NULL
         AND needs_review = 0
-        AND (${likeClause})
-        ${kindClause}
+        AND (${l})
+        ${m}
       ORDER BY confidence DESC, reuse_success_count DESC
       LIMIT ?
-    `).all(...params);
-    }
-    listRecent(projectId, limit = 20, kind) {
-        const kindClause = kind ? 'AND kind = ?' : '';
-        const params = [projectId];
-        if (kind)
-            params.push(kind);
-        params.push(limit);
-        return this.db.prepare(`
+    `).all(...d)}listRecent(t,e=20,n){const i=n?"AND kind = ?":"",a=[t];return n&&a.push(n),a.push(e),this.db.prepare(`
       SELECT * FROM memory_artifacts
       WHERE project_id = ? AND supersedes_id IS NULL AND needs_review = 0
-        ${kindClause}
+        ${i}
       ORDER BY confidence DESC, created_at DESC
       LIMIT ?
-    `).all(...params);
-    }
-    // ==================== CONTEXT BRIEF ====================
-    /**
-     * Assemble an optimized memory brief for injection into an AI model's context.
-     * Excludes credentials/sensitive content. Groups by kind. Deduplicates.
-     * Returns sections with headings + items, plus raw text for direct injection.
-     */
-    buildContextBrief(projectId, task, opts = {}) {
-        const kinds = opts.kinds ?? ['pattern', 'heuristic', 'reasoning_trace', 'lesson', 'anti_pattern'];
-        const maxItems = opts.maxItems ?? MAX_BRIEF_ITEMS;
-        const minConf = opts.minConfidence ?? MIN_BRIEF_CONFIDENCE;
-        // Recall relevant artifacts
-        const recalled = this.recall(projectId, task, { limit: maxItems * 2, minConfidence: minConf });
-        // Group by kind, pick top items per kind
-        const byKind = new Map();
-        for (const r of recalled) {
-            if (!kinds.includes(r.artifact.kind))
-                continue;
-            const existing = byKind.get(r.artifact.kind) ?? [];
-            existing.push(r);
-            byKind.set(r.artifact.kind, existing);
-        }
-        const KIND_LABELS = {
-            pattern: '✅ Proven Patterns',
-            heuristic: '💡 Heuristics',
-            reasoning_trace: '🧠 Past Reasoning',
-            lesson: '📚 Lessons Learned',
-            anti_pattern: '⚠️ Anti-Patterns to Avoid',
-        };
-        // Prioritize: patterns > heuristics > reasoning_traces > lessons > anti_patterns
-        const kindOrder = ['pattern', 'heuristic', 'reasoning_trace', 'lesson', 'anti_pattern'];
-        const sections = [];
-        const sourceIds = [];
-        let totalItems = 0;
-        for (const kind of kindOrder) {
-            if (!kinds.includes(kind))
-                continue;
-            const items = byKind.get(kind) ?? [];
-            if (!items.length)
-                continue;
-            const sectionItems = [];
-            for (const r of items) {
-                if (totalItems >= maxItems)
-                    break;
-                const a = r.artifact;
-                let line = `**Problem:** ${a.problem}`;
-                if (a.constraints)
-                    line += `\n  _Constraints:_ ${a.constraints}`;
-                if (a.validated_fix)
-                    line += `\n  _Solution:_ ${a.validated_fix}`;
-                if (a.why_it_worked)
-                    line += `\n  _Why it worked:_ ${a.why_it_worked}`;
-                if (a.outcome === 'negative')
-                    line += `\n  _Note: This approach failed — avoid it_`;
-                sectionItems.push(line);
-                sourceIds.push(a.id);
-                totalItems++;
-            }
-            if (sectionItems.length) {
-                sections.push({ heading: KIND_LABELS[kind], items: sectionItems, source: kind });
-            }
-        }
-        // Build formatted text
-        let text = '';
-        if (sections.length > 0) {
-            text += '---\n## 󱅝 Memory Brief\n_Relevant past knowledge from Wyrm:_\n\n';
-            for (const section of sections) {
-                text += `### ${section.heading}\n`;
-                for (const item of section.items) {
-                    text += `- ${item}\n`;
-                }
-                text += '\n';
-            }
-            text += '---\n';
-        }
-        return { sections, text, sourceIds };
-    }
-    // ==================== STATS ====================
-    getStats(projectId) {
-        const total = this.db.prepare('SELECT COUNT(*) as n FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NULL').get(projectId).n;
-        const supersededCount = this.db.prepare('SELECT COUNT(*) as n FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NOT NULL').get(projectId).n;
-        const avgConfidence = this.db.prepare('SELECT AVG(confidence) as v FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NULL').get(projectId).v ?? 0;
-        const kindRows = this.db.prepare('SELECT kind, COUNT(*) as cnt FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NULL GROUP BY kind').all(projectId);
-        const byKind = {};
-        for (const r of kindRows)
-            byKind[r.kind] = r.cnt;
-        return { total, byKind, avgConfidence: Math.round(avgConfidence * 100) / 100, supersededCount };
-    }
-    listAll(projectId, opts = {}) {
-        const kindClause = opts.kind ? 'AND kind = ?' : '';
-        const supersededClause = opts.includeSuperseded ? '' : 'AND supersedes_id IS NULL';
-        const params = [projectId];
-        if (opts.kind)
-            params.push(opts.kind);
-        params.push(opts.limit ?? 50);
-        return this.db.prepare(`
+    `).all(...a)}buildContextBrief(t,e,n={}){const i=n.kinds??["pattern","heuristic","reasoning_trace","lesson","anti_pattern"],a=n.maxItems??M,r=n.minConfidence??I,o=this.recall(t,e,{limit:a*2,minConfidence:r}),l=new Map;for(const f of o){if(!i.includes(f.artifact.kind))continue;const h=l.get(f.artifact.kind)??[];h.push(f),l.set(f.artifact.kind,h)}const _={pattern:"\u2705 Proven Patterns",heuristic:"\u{1F4A1} Heuristics",reasoning_trace:"\u{1F9E0} Past Reasoning",lesson:"\u{1F4DA} Lessons Learned",anti_pattern:"\u26A0\uFE0F Anti-Patterns to Avoid"},m=["pattern","heuristic","reasoning_trace","lesson","anti_pattern"],d=[],c=[];let p=0;for(const f of m){if(!i.includes(f))continue;const h=l.get(f)??[];if(!h.length)continue;const A=[];for(const R of h){if(p>=a)break;const s=R.artifact;let u=`**Problem:** ${s.problem}`;s.constraints&&(u+=`
+  _Constraints:_ ${s.constraints}`),s.validated_fix&&(u+=`
+  _Solution:_ ${s.validated_fix}`),s.why_it_worked&&(u+=`
+  _Why it worked:_ ${s.why_it_worked}`),s.outcome==="negative"&&(u+=`
+  _Note: This approach failed \u2014 avoid it_`),A.push(u),c.push(s.id),p++}A.length&&d.push({heading:_[f],items:A,source:f})}let E="";if(d.length>0){E+=`---
+## \u{F115D} Memory Brief
+_Relevant past knowledge from Wyrm:_
+
+`;for(const f of d){E+=`### ${f.heading}
+`;for(const h of f.items)E+=`- ${h}
+`;E+=`
+`}E+=`---
+`}return{sections:d,text:E,sourceIds:c}}getStats(t){const e=this.db.prepare("SELECT COUNT(*) as n FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NULL").get(t).n,n=this.db.prepare("SELECT COUNT(*) as n FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NOT NULL").get(t).n,i=this.db.prepare("SELECT AVG(confidence) as v FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NULL").get(t).v??0,a=this.db.prepare("SELECT kind, COUNT(*) as cnt FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NULL GROUP BY kind").all(t),r={};for(const o of a)r[o.kind]=o.cnt;return{total:e,byKind:r,avgConfidence:Math.round(i*100)/100,supersededCount:n}}listAll(t,e={}){const n=e.kind?"AND kind = ?":"",i=e.includeSuperseded?"":"AND supersedes_id IS NULL",a=[t];return e.kind&&a.push(e.kind),a.push(e.limit??50),this.db.prepare(`
       SELECT * FROM memory_artifacts
-      WHERE project_id = ? ${kindClause} ${supersededClause}
+      WHERE project_id = ? ${n} ${i}
       ORDER BY confidence DESC, created_at DESC
       LIMIT ?
-    `).all(...params);
-    }
-    /**
-     * Keyset-paginated sibling of `listAll` (v7 F4 T035). Orders by
-     * `(confidence DESC, id DESC)` — a TOTAL order (id is the unique tiebreak),
-     * so a page boundary that falls inside a run of tied-confidence artifacts
-     * drops nothing and repeats nothing (the bare-sortKey bug the cloud-sync
-     * keyset cursor taught us). The composite cursor `(confidence, id)` is opaque
-     * on the wire; a malformed cursor degrades to "first page" upstream.
-     *
-     * Over-fetches by one (`pageSize + 1`) so the caller can tell "is there more"
-     * without a COUNT. `pageSize` is already clamped to `[1, MAX_PAGE_SIZE]` by
-     * the keyset helper before it reaches here.
-     */
-    listPage(projectId, opts = { pageSize: DEFAULT_PAGE_SIZE }) {
-        const kindClause = opts.kind ? 'AND kind = ?' : '';
-        const supersededClause = opts.includeSuperseded ? '' : 'AND supersedes_id IS NULL';
-        // The wyrm://project/{id}/memory resource is advertised as a project's
-        // "validated memory artifacts" (handlers/resources.ts), and every other
-        // validated read path here enforces needs_review = 0 (searchByTags,
-        // listRecent, the FTS recall). Match that contract so the resource never
-        // surfaces unreviewed/quarantined rows (security pass #2, finding #2).
-        const reviewedClause = 'AND needs_review = 0';
-        const params = [projectId];
-        if (opts.kind)
-            params.push(opts.kind);
-        // Keyset predicate for a (confidence DESC, id DESC) total order: resume
-        // strictly AFTER the anchor row. `confidence` is bound as a number, the id
-        // as the unique tiebreak. Confidence is stored as a REAL so the cursor's
-        // string sortKey is parsed back to a float here (the encode round-trips it).
-        let keysetClause = '';
-        if (opts.after) {
-            const afterConf = Number(opts.after.sortKey);
-            if (Number.isFinite(afterConf)) {
-                keysetClause = 'AND (confidence < ? OR (confidence = ? AND id < ?))';
-                params.push(afterConf, afterConf, opts.after.id);
-            }
-        }
-        const fetch = opts.pageSize + 1;
-        params.push(fetch);
-        const rows = this.db.prepare(`
+    `).all(...a)}listPage(t,e={pageSize:T}){const n=e.kind?"AND kind = ?":"",i=e.includeSuperseded?"":"AND supersedes_id IS NULL",a="AND needs_review = 0",r=[t];e.kind&&r.push(e.kind);let o="";if(e.after){const m=Number(e.after.sortKey);Number.isFinite(m)&&(o="AND (confidence < ? OR (confidence = ? AND id < ?))",r.push(m,m,e.after.id))}const l=e.pageSize+1;r.push(l);const _=this.db.prepare(`
       SELECT * FROM memory_artifacts
-      WHERE project_id = ? ${kindClause} ${supersededClause} ${reviewedClause} ${keysetClause}
+      WHERE project_id = ? ${n} ${i} ${a} ${o}
       ORDER BY confidence DESC, id DESC
       LIMIT ?
-    `).all(...params);
-        return buildPage(rows, opts.pageSize, (r) => ({ sortKey: String(r.confidence), id: r.id }));
-    }
-    /**
-     * Find (and optionally delete) stale, low-confidence artifacts safe to prune.
-     *
-     * A candidate must be: strictly below `minConfidence`, untouched for at least
-     * `olderThanDays` (or never accessed), already reviewed (needs_review = 0),
-     * and not superseding another artifact. When `projectId` is supplied the
-     * sweep is scoped to that project via an exact equality bind, so a prune can
-     * never reach into another project's rows; omit it for a global prune. The
-     * candidate set is capped at 500 per call. When `dryRun` is false the matched
-     * rows are deleted and the delete re-asserts needs_review = 0 as a final
-     * guard. Returns the candidates plus the number actually deleted.
-     */
-    pruneStale(opts = {}) {
-        const minConfidence = opts.minConfidence ?? 0.3;
-        const olderThanDays = opts.olderThanDays ?? 90;
-        const dryRun = opts.dryRun ?? true;
-        const scoped = opts.projectId != null;
-        const params = [minConfidence, `-${olderThanDays} days`];
-        if (scoped)
-            params.push(opts.projectId);
-        const candidates = this.db.prepare(`
+    `).all(...r);return b(_,e.pageSize,m=>({sortKey:String(m.confidence),id:m.id}))}pruneStale(t={}){const e=t.minConfidence??.3,n=t.olderThanDays??90,i=t.dryRun??!0,a=t.projectId!=null,r=[e,`-${n} days`];a&&r.push(t.projectId);const o=this.db.prepare(`
       SELECT id, kind, problem, confidence, last_accessed_at
       FROM memory_artifacts
       WHERE confidence < ?
         AND (last_accessed_at IS NULL OR last_accessed_at < datetime('now', ?))
         AND needs_review = 0
         AND supersedes_id IS NULL
-        ${scoped ? 'AND project_id = ?' : ''}
+        ${a?"AND project_id = ?":""}
       ORDER BY confidence ASC
       LIMIT 500
-    `).all(...params);
-        if (dryRun || candidates.length === 0) {
-            return { candidates, deleted: 0, dryRun };
-        }
-        return { candidates, deleted: this.deleteArtifacts(candidates.map(c => c.id)), dryRun };
-    }
-    /**
-     * Delete artifacts by id, refusing any still flagged needs_review (a final
-     * guard so a stale id list can never remove a row that has since been queued
-     * for review). Returns the number of rows actually deleted. The CLI uses this
-     * to delete exactly the candidate set it showed the operator, so the confirmed
-     * set and the deleted set are always identical (no re-select in between).
-     */
-    deleteArtifacts(ids) {
-        if (ids.length === 0)
-            return 0;
-        const placeholders = ids.map(() => '?').join(',');
-        const result = this.db.prepare(`DELETE FROM memory_artifacts WHERE id IN (${placeholders}) AND needs_review = 0`).run(...ids);
-        return result.changes;
-    }
-}
-//# sourceMappingURL=memory-artifacts.js.map
+    `).all(...r);return i||o.length===0?{candidates:o,deleted:0,dryRun:i}:{candidates:o,deleted:this.deleteArtifacts(o.map(l=>l.id)),dryRun:i}}deleteArtifacts(t){if(t.length===0)return 0;const e=t.map(()=>"?").join(",");return this.db.prepare(`DELETE FROM memory_artifacts WHERE id IN (${e}) AND needs_review = 0`).run(...t).changes}}export{U as MemoryArtifacts};