agentic-flow 3.0.0-alpha.2 → 3.1.0

package/dist/reasoningbank/core/consolidate.js

@@ -12,10 +12,10 @@ import * as db from '../db/queries.js';
 export async function consolidate() {
     const config = loadConfig();
     const startTime = Date.now();
-    console.log('[INFO] Starting memory consolidation...');
+    console.error('[INFO] Starting memory consolidation...');
     const runId = ulid();
     const memories = db.getAllActiveMemories();
-    console.log(`[INFO] Processing ${memories.length} active memories`);
+    console.error(`[INFO] Processing ${memories.length} active memories`);
     let duplicatesFound = 0;
     let contradictionsFound = 0;
     let itemsPruned = 0;
@@ -38,7 +38,7 @@ export async function consolidate() {
         items_pruned: itemsPruned,
         duration_ms: durationMs
     });
-    console.log(`[INFO] Consolidation complete: ${duplicatesFound} dupes, ${contradictionsFound} contradictions, ${itemsPruned} pruned in ${durationMs}ms`);
+    console.error(`[INFO] Consolidation complete: ${duplicatesFound} dupes, ${contradictionsFound} contradictions, ${itemsPruned} pruned in ${durationMs}ms`);
     db.logMetric('rb.consolidate.duration_ms', durationMs);
     db.logMetric('rb.consolidate.duplicates', duplicatesFound);
     db.logMetric('rb.consolidate.contradictions', contradictionsFound);
@@ -53,75 +53,143 @@ export async function consolidate() {
 }
 /**
  * Deduplicate highly similar memories
+ * PERFORMANCE FIX: Use bucketing/blocking to reduce O(n²) to ~O(n·k)
+ * by only comparing memories within the same semantic bucket
  */
 async function deduplicateMemories(memories, threshold) {
     let duplicatesFound = 0;
-    // Fetch embeddings for all memories
+    if (memories.length === 0)
+        return 0;
+    // Fetch all embeddings in a single batch query (instead of N queries)
     const dbConn = db.getDb();
+    const ids = memories.map(m => m.id);
+    const placeholders = ids.map(() => '?').join(',');
+    const rows = dbConn.prepare(`SELECT id, vector FROM pattern_embeddings WHERE id IN (${placeholders})`).all(...ids);
     const embeddingsMap = new Map();
+    for (const row of rows) {
+        embeddingsMap.set(row.id, new Float32Array(row.vector));
+    }
+    // PERFORMANCE: Use locality-sensitive hashing (LSH) bucketing
+    // Group memories by their dominant embedding dimension to reduce comparisons
+    const buckets = new Map();
+    const BUCKET_GRANULARITY = 10; // Number of buckets per dimension
     for (const mem of memories) {
-        const row = dbConn.prepare('SELECT vector FROM pattern_embeddings WHERE id = ?').get(mem.id);
-        if (row) {
-            embeddingsMap.set(mem.id, new Float32Array(row.vector));
+        const emb = embeddingsMap.get(mem.id);
+        if (!emb)
+            continue;
+        // Find dominant dimension and bucket
+        let maxDim = 0;
+        let maxVal = -Infinity;
+        for (let i = 0; i < Math.min(emb.length, 32); i++) { // Check first 32 dims
+            if (Math.abs(emb[i]) > maxVal) {
+                maxVal = Math.abs(emb[i]);
+                maxDim = i;
+            }
+        }
+        const bucketKey = maxDim * BUCKET_GRANULARITY + Math.floor((emb[maxDim] + 1) * BUCKET_GRANULARITY / 2);
+        if (!buckets.has(bucketKey)) {
+            buckets.set(bucketKey, []);
         }
+        buckets.get(bucketKey).push(mem);
     }
-    // Compare all pairs
-    for (let i = 0; i < memories.length; i++) {
-        for (let j = i + 1; j < memories.length; j++) {
-            const mem1 = memories[i];
-            const mem2 = memories[j];
+    // Compare only within buckets (and neighboring buckets for safety)
+    const deletedIds = new Set();
+    for (const [bucketKey, bucketMemories] of buckets) {
+        // Compare within bucket
+        for (let i = 0; i < bucketMemories.length; i++) {
+            const mem1 = bucketMemories[i];
+            if (deletedIds.has(mem1.id))
+                continue;
             const emb1 = embeddingsMap.get(mem1.id);
-            const emb2 = embeddingsMap.get(mem2.id);
-            if (!emb1 || !emb2)
+            if (!emb1)
                 continue;
-            const similarity = cosineSimilarity(emb1, emb2);
-            if (similarity >= threshold) {
-                // Mark as duplicate
-                db.storeLink(mem1.id, mem2.id, 'duplicate_of', similarity);
-                duplicatesFound++;
-                // Merge: keep the one with higher usage
-                if (mem1.usage_count < mem2.usage_count) {
-                    // Delete mem1 (lower usage)
-                    dbConn.prepare('DELETE FROM patterns WHERE id = ?').run(mem1.id);
-                    console.log(`[INFO] Merged duplicate: ${mem1.pattern_data.title} → ${mem2.pattern_data.title}`);
+            for (let j = i + 1; j < bucketMemories.length; j++) {
+                const mem2 = bucketMemories[j];
+                if (deletedIds.has(mem2.id))
+                    continue;
+                const emb2 = embeddingsMap.get(mem2.id);
+                if (!emb2)
+                    continue;
+                const similarity = cosineSimilarity(emb1, emb2);
+                if (similarity >= threshold) {
+                    // Mark as duplicate
+                    db.storeLink(mem1.id, mem2.id, 'duplicate_of', similarity);
+                    duplicatesFound++;
+                    // Merge: keep the one with higher usage
+                    if (mem1.usage_count < mem2.usage_count) {
+                        deletedIds.add(mem1.id);
+                        console.error(`[INFO] Merged duplicate: ${mem1.pattern_data?.title || mem1.id} → ${mem2.pattern_data?.title || mem2.id}`);
+                    }
+                    else {
+                        deletedIds.add(mem2.id);
+                    }
                 }
             }
         }
     }
+    // Batch delete all duplicates in a single transaction
+    if (deletedIds.size > 0) {
+        const deleteIds = Array.from(deletedIds);
+        const deletePlaceholders = deleteIds.map(() => '?').join(',');
+        dbConn.prepare(`DELETE FROM patterns WHERE id IN (${deletePlaceholders})`).run(...deleteIds);
+    }
     return duplicatesFound;
 }
 /**
  * Detect contradicting memories
  * Uses embedding similarity + semantic analysis
+ * PERFORMANCE FIX: Reuses embeddings from deduplication phase and uses bucketing
  */
-async function detectContradictions(memories, threshold) {
+async function detectContradictions(memories, threshold, preloadedEmbeddings) {
     let contradictionsFound = 0;
-    const dbConn = db.getDb();
-    const embeddingsMap = new Map();
+    if (memories.length === 0)
+        return 0;
+    // Use preloaded embeddings if available, otherwise fetch in batch
+    let embeddingsMap;
+    if (preloadedEmbeddings) {
+        embeddingsMap = preloadedEmbeddings;
+    }
+    else {
+        const dbConn = db.getDb();
+        const ids = memories.map(m => m.id);
+        const placeholders = ids.map(() => '?').join(',');
+        const rows = dbConn.prepare(`SELECT id, vector FROM pattern_embeddings WHERE id IN (${placeholders})`).all(...ids);
+        embeddingsMap = new Map();
+        for (const row of rows) {
+            embeddingsMap.set(row.id, new Float32Array(row.vector));
+        }
+    }
+    // PERFORMANCE: Group by outcome first, only compare across different outcomes
+    const outcomeGroups = new Map();
     for (const mem of memories) {
-        const row = dbConn.prepare('SELECT vector FROM pattern_embeddings WHERE id = ?').get(mem.id);
-        if (row) {
-            embeddingsMap.set(mem.id, new Float32Array(row.vector));
+        const outcome = mem.pattern_data?.source?.outcome ?? 'unknown';
+        if (!outcomeGroups.has(outcome)) {
+            outcomeGroups.set(outcome, []);
         }
+        outcomeGroups.get(outcome).push(mem);
     }
-    // Look for memories with high similarity but opposite outcomes
-    for (let i = 0; i < memories.length; i++) {
-        for (let j = i + 1; j < memories.length; j++) {
-            const mem1 = memories[i];
-            const mem2 = memories[j];
-            const emb1 = embeddingsMap.get(mem1.id);
-            const emb2 = embeddingsMap.get(mem2.id);
-            if (!emb1 || !emb2)
-                continue;
-            const similarity = cosineSimilarity(emb1, emb2);
-            // High similarity but different outcomes = potential contradiction
-            if (similarity >= threshold) {
-                const outcome1 = mem1.pattern_data.source?.outcome;
-                const outcome2 = mem2.pattern_data.source?.outcome;
-                if (outcome1 !== outcome2) {
-                    db.storeLink(mem1.id, mem2.id, 'contradicts', similarity);
-                    contradictionsFound++;
-                    console.log(`[WARN] Contradiction detected: ${mem1.pattern_data.title} vs ${mem2.pattern_data.title}`);
+    // Only compare memories with different outcomes
+    const outcomeKeys = Array.from(outcomeGroups.keys());
+    for (let o1 = 0; o1 < outcomeKeys.length; o1++) {
+        for (let o2 = o1 + 1; o2 < outcomeKeys.length; o2++) {
+            const group1 = outcomeGroups.get(outcomeKeys[o1]);
+            const group2 = outcomeGroups.get(outcomeKeys[o2]);
+            // Compare across groups (different outcomes)
+            for (const mem1 of group1) {
+                const emb1 = embeddingsMap.get(mem1.id);
+                if (!emb1)
+                    continue;
+                for (const mem2 of group2) {
+                    const emb2 = embeddingsMap.get(mem2.id);
+                    if (!emb2)
+                        continue;
+                    const similarity = cosineSimilarity(emb1, emb2);
+                    // High similarity but different outcomes = contradiction
+                    if (similarity >= threshold) {
+                        db.storeLink(mem1.id, mem2.id, 'contradicts', similarity);
+                        contradictionsFound++;
+                        console.error(`[WARN] Contradiction detected: ${mem1.pattern_data?.title || mem1.id} vs ${mem2.pattern_data?.title || mem2.id}`);
+                    }
                 }
             }
         }

package/dist/reasoningbank/core/consolidate.js.map

@@ -1 +1 @@
-{"version":3,"file":"consolidate.js","sourceRoot":"","sources":["../../../src/reasoningbank/core/consolidate.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACnD,OAAO,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAUvC;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW;IAC/B,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,OAAO,CAAC,GAAG,CAAC,yCAAyC,CAAC,CAAC;IAEvD,MAAM,KAAK,GAAG,IAAI,EAAE,CAAC;IACrB,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;IAE3C,OAAO,CAAC,GAAG,CAAC,qBAAqB,QAAQ,CAAC,MAAM,kBAAkB,CAAC,CAAC;IAEpE,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,uCAAuC;IACvC,eAAe,GAAG,MAAM,mBAAmB,CAAC,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,mBAAmB,CAAC,CAAC;IAE9F,gCAAgC;IAChC,mBAAmB,GAAG,MAAM,oBAAoB,CAAC,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,uBAAuB,CAAC,CAAC;IAEvG,qCAAqC;IACrC,WAAW,GAAG,EAAE,CAAC,gBAAgB,CAAC;QAChC,UAAU,EAAE,MAAM,CAAC,WAAW,CAAC,cAAc;QAC7C,aAAa,EAAE,MAAM,CAAC,WAAW,CAAC,mBAAmB;KACtD,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAE1C,0BAA0B;IAC1B,EAAE,CAAC,qBAAqB,CAAC;QACvB,MAAM,EAAE,KAAK;QACb,eAAe,EAAE,QAAQ,CAAC,MAAM;QAChC,gBAAgB,EAAE,eAAe;QACjC,oBAAoB,EAAE,mBAAmB;QACzC,YAAY,EAAE,WAAW;QACzB,WAAW,EAAE,UAAU;KACxB,CAAC,CAAC;IAEH,OAAO,CAAC,GAAG,CAAC,kCAAkC,eAAe,WAAW,mBAAmB,oBAAoB,WAAW,cAAc,UAAU,IAAI,CAAC,CAAC;IAExJ,EAAE,CAAC,SAAS,CAAC,4BAA4B,EAAE,UAAU,CAAC,CAAC;IACvD,EAAE,CAAC,SAAS,CAAC,2BAA2B,EAAE,eAAe,CAAC,CAAC;IAC3D,EAAE,CAAC,SAAS,CAAC,+BAA+B,EAAE,mBAAmB,CAAC,CAAC;IACnE,EAAE,CAAC,SAAS,CAAC,uBAAuB,EAAE,WAAW,CAAC,CAAC;IAEnD,OAAO;QACL,cAAc,EAAE,QAAQ,CAAC,MAAM;QAC/B,eAAe;QACf,mBAAmB;QACnB,WAAW;QACX,UAAU;KACX,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,mBAAmB,CAChC,QAAe,EACf,SAAiB;IAEjB,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,oCAAoC;IACpC,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;IAC1B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAwB,CAAC;IAEtD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,oDAAoD,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAmC,CAAC;QAC/H,IAAI,GAAG,EAAE,CAAC;YACR,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAEzB,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxC,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAExC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;gBAAE,SAAS;YAE7B,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAEhD,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,oBAAoB;gBACpB,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;gBAC3D,eAAe,EAAE,CAAC;gBAElB,wCAAwC;gBACxC,IAAI,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;oBACxC,4BAA4B;oBAC5B,MAAM,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACjE,OAAO,CAAC,GAAG,CAAC,4BAA4B,IAAI,CAAC,YAAY,CAAC,KAAK,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC;gBAClG,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,eAAe,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,oBAAoB,CACjC,QAAe,EACf,SAAiB;IAEjB,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAE5B,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;IAC1B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAwB,CAAC;IAEtD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,oDAAoD,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAmC,CAAC;QAC/H,IAAI,GAAG,EAAE,CAAC;YACR,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,+DAA+D;IAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAEzB,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxC,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAExC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;gBAAE,SAAS;YAE7B,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAEhD,mEAAmE;YACnE,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC;gBACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC;gBAEnD,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBAC1B,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC;oBAC1D,mBAAmB,EAAE,CAAC;oBACtB,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,YAAY,CAAC,KAAK,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC;gBACzG,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,mBAAmB,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB;IAC/B,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAG,EAAE,CAAC,kCAAkC,EAAE,CAAC;IACzD,OAAO,QAAQ,IAAI,MAAM,CAAC,WAAW,CAAC,iBAAiB,CAAC;AAC1D,CAAC","sourcesContent":["/**\n * Memory Consolidation\n * Algorithm 4 from ReasoningBank paper: Dedup, Contradict, Prune\n */\n\nimport { ulid } from 'ulid';\nimport { loadConfig } from '../utils/config.js';\nimport { cosineSimilarity } from '../utils/mmr.js';\nimport * as db from '../db/queries.js';\n\nexport interface ConsolidationResult {\n  itemsProcessed: number;\n  duplicatesFound: number;\n  contradictionsFound: number;\n  itemsPruned: number;\n  durationMs: number;\n}\n\n/**\n * Run consolidation: deduplicate, detect contradictions, prune old memories\n */\nexport async function consolidate(): Promise<ConsolidationResult> {\n  const config = loadConfig();\n  const startTime = Date.now();\n\n  console.log('[INFO] Starting memory consolidation...');\n\n  const runId = ulid();\n  const memories = db.getAllActiveMemories();\n\n  console.log(`[INFO] Processing ${memories.length} active memories`);\n\n  let duplicatesFound = 0;\n  let contradictionsFound = 0;\n  let itemsPruned = 0;\n\n  // Step 1: Deduplicate similar memories\n  duplicatesFound = await deduplicateMemories(memories, config.consolidate.duplicate_threshold);\n\n  // Step 2: Detect contradictions\n  contradictionsFound = await detectContradictions(memories, config.consolidate.contradiction_threshold);\n\n  // Step 3: Prune old, unused memories\n  itemsPruned = db.pruneOldMemories({\n    maxAgeDays: config.consolidate.prune_age_days,\n    minConfidence: config.consolidate.min_confidence_keep\n  });\n\n  const durationMs = Date.now() - startTime;\n\n  // Store consolidation run\n  db.storeConsolidationRun({\n    run_id: runId,\n    items_processed: memories.length,\n    duplicates_found: duplicatesFound,\n    contradictions_found: contradictionsFound,\n    items_pruned: itemsPruned,\n    duration_ms: durationMs\n  });\n\n  console.log(`[INFO] Consolidation complete: ${duplicatesFound} dupes, ${contradictionsFound} contradictions, ${itemsPruned} pruned in ${durationMs}ms`);\n\n  db.logMetric('rb.consolidate.duration_ms', durationMs);\n  db.logMetric('rb.consolidate.duplicates', duplicatesFound);\n  db.logMetric('rb.consolidate.contradictions', contradictionsFound);\n  db.logMetric('rb.consolidate.pruned', itemsPruned);\n\n  return {\n    itemsProcessed: memories.length,\n    duplicatesFound,\n    contradictionsFound,\n    itemsPruned,\n    durationMs\n  };\n}\n\n/**\n * Deduplicate highly similar memories\n */\nasync function deduplicateMemories(\n  memories: any[],\n  threshold: number\n): Promise<number> {\n  let duplicatesFound = 0;\n\n  // Fetch embeddings for all memories\n  const dbConn = db.getDb();\n  const embeddingsMap = new Map<string, Float32Array>();\n\n  for (const mem of memories) {\n    const row = dbConn.prepare('SELECT vector FROM pattern_embeddings WHERE id = ?').get(mem.id) as { vector: Buffer } | undefined;\n    if (row) {\n      embeddingsMap.set(mem.id, new Float32Array(row.vector));\n    }\n  }\n\n  // Compare all pairs\n  for (let i = 0; i < memories.length; i++) {\n    for (let j = i + 1; j < memories.length; j++) {\n      const mem1 = memories[i];\n      const mem2 = memories[j];\n\n      const emb1 = embeddingsMap.get(mem1.id);\n      const emb2 = embeddingsMap.get(mem2.id);\n\n      if (!emb1 || !emb2) continue;\n\n      const similarity = cosineSimilarity(emb1, emb2);\n\n      if (similarity >= threshold) {\n        // Mark as duplicate\n        db.storeLink(mem1.id, mem2.id, 'duplicate_of', similarity);\n        duplicatesFound++;\n\n        // Merge: keep the one with higher usage\n        if (mem1.usage_count < mem2.usage_count) {\n          // Delete mem1 (lower usage)\n          dbConn.prepare('DELETE FROM patterns WHERE id = ?').run(mem1.id);\n          console.log(`[INFO] Merged duplicate: ${mem1.pattern_data.title} → ${mem2.pattern_data.title}`);\n        }\n      }\n    }\n  }\n\n  return duplicatesFound;\n}\n\n/**\n * Detect contradicting memories\n * Uses embedding similarity + semantic analysis\n */\nasync function detectContradictions(\n  memories: any[],\n  threshold: number\n): Promise<number> {\n  let contradictionsFound = 0;\n\n  const dbConn = db.getDb();\n  const embeddingsMap = new Map<string, Float32Array>();\n\n  for (const mem of memories) {\n    const row = dbConn.prepare('SELECT vector FROM pattern_embeddings WHERE id = ?').get(mem.id) as { vector: Buffer } | undefined;\n    if (row) {\n      embeddingsMap.set(mem.id, new Float32Array(row.vector));\n    }\n  }\n\n  // Look for memories with high similarity but opposite outcomes\n  for (let i = 0; i < memories.length; i++) {\n    for (let j = i + 1; j < memories.length; j++) {\n      const mem1 = memories[i];\n      const mem2 = memories[j];\n\n      const emb1 = embeddingsMap.get(mem1.id);\n      const emb2 = embeddingsMap.get(mem2.id);\n\n      if (!emb1 || !emb2) continue;\n\n      const similarity = cosineSimilarity(emb1, emb2);\n\n      // High similarity but different outcomes = potential contradiction\n      if (similarity >= threshold) {\n        const outcome1 = mem1.pattern_data.source?.outcome;\n        const outcome2 = mem2.pattern_data.source?.outcome;\n\n        if (outcome1 !== outcome2) {\n          db.storeLink(mem1.id, mem2.id, 'contradicts', similarity);\n          contradictionsFound++;\n          console.log(`[WARN] Contradiction detected: ${mem1.pattern_data.title} vs ${mem2.pattern_data.title}`);\n        }\n      }\n    }\n  }\n\n  return contradictionsFound;\n}\n\n/**\n * Check if consolidation should run\n * Returns true if threshold of new memories is reached\n */\nexport function shouldConsolidate(): boolean {\n  const config = loadConfig();\n  const newCount = db.countNewMemoriesSinceConsolidation();\n  return newCount >= config.consolidate.trigger_threshold;\n}\n"]}
+{"version":3,"file":"consolidate.js","sourceRoot":"","sources":["../../../src/reasoningbank/core/consolidate.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACnD,OAAO,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAUvC;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW;IAC/B,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,OAAO,CAAC,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAEzD,MAAM,KAAK,GAAG,IAAI,EAAE,CAAC;IACrB,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;IAE3C,OAAO,CAAC,KAAK,CAAC,qBAAqB,QAAQ,CAAC,MAAM,kBAAkB,CAAC,CAAC;IAEtE,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,uCAAuC;IACvC,eAAe,GAAG,MAAM,mBAAmB,CAAC,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,mBAAmB,CAAC,CAAC;IAE9F,gCAAgC;IAChC,mBAAmB,GAAG,MAAM,oBAAoB,CAAC,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,uBAAuB,CAAC,CAAC;IAEvG,qCAAqC;IACrC,WAAW,GAAG,EAAE,CAAC,gBAAgB,CAAC;QAChC,UAAU,EAAE,MAAM,CAAC,WAAW,CAAC,cAAc;QAC7C,aAAa,EAAE,MAAM,CAAC,WAAW,CAAC,mBAAmB;KACtD,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAE1C,0BAA0B;IAC1B,EAAE,CAAC,qBAAqB,CAAC;QACvB,MAAM,EAAE,KAAK;QACb,eAAe,EAAE,QAAQ,CAAC,MAAM;QAChC,gBAAgB,EAAE,eAAe;QACjC,oBAAoB,EAAE,mBAAmB;QACzC,YAAY,EAAE,WAAW;QACzB,WAAW,EAAE,UAAU;KACxB,CAAC,CAAC;IAEH,OAAO,CAAC,KAAK,CAAC,kCAAkC,eAAe,WAAW,mBAAmB,oBAAoB,WAAW,cAAc,UAAU,IAAI,CAAC,CAAC;IAE1J,EAAE,CAAC,SAAS,CAAC,4BAA4B,EAAE,UAAU,CAAC,CAAC;IACvD,EAAE,CAAC,SAAS,CAAC,2BAA2B,EAAE,eAAe,CAAC,CAAC;IAC3D,EAAE,CAAC,SAAS,CAAC,+BAA+B,EAAE,mBAAmB,CAAC,CAAC;IACnE,EAAE,CAAC,SAAS,CAAC,uBAAuB,EAAE,WAAW,CAAC,CAAC;IAEnD,OAAO;QACL,cAAc,EAAE,QAAQ,CAAC,MAAM;QAC/B,eAAe;QACf,mBAAmB;QACnB,WAAW;QACX,UAAU;KACX,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,mBAAmB,CAChC,QAAe,EACf,SAAiB;IAEjB,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEpC,sEAAsE;IACtE,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;IAC1B,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpC,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,0DAA0D,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAA0C,CAAC;IAE5J,MAAM,aAAa,GAAG,IAAI,GAAG,EAAwB,CAAC;IACtD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,8DAA8D;IAC9D,6EAA6E;IAC7E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAC;IACzC,MAAM,kBAAkB,GAAG,EAAE,CAAC,CAAC,kCAAkC;IAEjE,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,GAAG;YAAE,SAAS;QAEnB,qCAAqC;QACrC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,sBAAsB;YACzE,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;gBAC9B,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,GAAG,CAAC,CAAC;YACb,CAAC;QACH,CAAC;QACD,MAAM,SAAS,GAAG,MAAM,GAAG,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,kBAAkB,GAAG,CAAC,CAAC,CAAC;QAEvG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC;IAED,mEAAmE;IACnE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,KAAK,MAAM,CAAC,SAAS,EAAE,cAAc,CAAC,IAAI,OAAO,EAAE,CAAC;QAClD,wBAAwB;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEtC,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAEtC,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,IAAI;oBAAE,SAAS;gBAEpB,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAEhD,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;oBAC5B,oBAAoB;oBACpB,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;oBAC3D,eAAe,EAAE,CAAC;oBAElB,wCAAwC;oBACxC,IAAI,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;wBACxC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACxB,OAAO,CAAC,KAAK,CAAC,4BAA4B,IAAI,CAAC,YAAY,EAAE,KAAK,IAAI,IAAI,CAAC,EAAE,MAAM,IAAI,CAAC,YAAY,EAAE,KAAK,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;oBAC5H,CAAC;yBAAM,CAAC;wBACN,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC1B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,sDAAsD;IACtD,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzC,MAAM,kBAAkB,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9D,MAAM,CAAC,OAAO,CAAC,qCAAqC,kBAAkB,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IAC/F,CAAC;IAED,OAAO,eAAe,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,oBAAoB,CACjC,QAAe,EACf,SAAiB,EACjB,mBAA+C;IAE/C,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAE5B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEpC,kEAAkE;IAClE,IAAI,aAAwC,CAAC;IAE7C,IAAI,mBAAmB,EAAE,CAAC;QACxB,aAAa,GAAG,mBAAmB,CAAC;IACtC,CAAC;SAAM,CAAC;QACN,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpC,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,0DAA0D,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAA0C,CAAC;QAE5J,aAAa,GAAG,IAAI,GAAG,EAAwB,CAAC;QAChD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,MAAM,aAAa,GAAG,IAAI,GAAG,EAAiB,CAAC;IAE/C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,GAAG,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,IAAI,SAAS,CAAC;QAC/D,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAChC,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACjC,CAAC;QACD,aAAa,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxC,CAAC;IAED,gDAAgD;IAChD,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;IAErD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QAC/C,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YACpD,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,CAAE,CAAC;YAEnD,6CAA6C;YAC7C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,IAAI;oBAAE,SAAS;gBAEpB,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;oBAC1B,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACxC,IAAI,CAAC,IAAI;wBAAE,SAAS;oBAEpB,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAEhD,yDAAyD;oBACzD,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;wBAC5B,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC;wBAC1D,mBAAmB,EAAE,CAAC;wBACtB,OAAO,CAAC,KAAK,CAAC,kCAAkC,IAAI,CAAC,YAAY,EAAE,KAAK,IAAI,IAAI,CAAC,EAAE,OAAO,IAAI,CAAC,YAAY,EAAE,KAAK,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;oBACnI,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,mBAAmB,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB;IAC/B,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAG,EAAE,CAAC,kCAAkC,EAAE,CAAC;IACzD,OAAO,QAAQ,IAAI,MAAM,CAAC,WAAW,CAAC,iBAAiB,CAAC;AAC1D,CAAC","sourcesContent":["/**\n * Memory Consolidation\n * Algorithm 4 from ReasoningBank paper: Dedup, Contradict, Prune\n */\n\nimport { ulid } from 'ulid';\nimport { loadConfig } from '../utils/config.js';\nimport { cosineSimilarity } from '../utils/mmr.js';\nimport * as db from '../db/queries.js';\n\nexport interface ConsolidationResult {\n  itemsProcessed: number;\n  duplicatesFound: number;\n  contradictionsFound: number;\n  itemsPruned: number;\n  durationMs: number;\n}\n\n/**\n * Run consolidation: deduplicate, detect contradictions, prune old memories\n */\nexport async function consolidate(): Promise<ConsolidationResult> {\n  const config = loadConfig();\n  const startTime = Date.now();\n\n  console.error('[INFO] Starting memory consolidation...');\n\n  const runId = ulid();\n  const memories = db.getAllActiveMemories();\n\n  console.error(`[INFO] Processing ${memories.length} active memories`);\n\n  let duplicatesFound = 0;\n  let contradictionsFound = 0;\n  let itemsPruned = 0;\n\n  // Step 1: Deduplicate similar memories\n  duplicatesFound = await deduplicateMemories(memories, config.consolidate.duplicate_threshold);\n\n  // Step 2: Detect contradictions\n  contradictionsFound = await detectContradictions(memories, config.consolidate.contradiction_threshold);\n\n  // Step 3: Prune old, unused memories\n  itemsPruned = db.pruneOldMemories({\n    maxAgeDays: config.consolidate.prune_age_days,\n    minConfidence: config.consolidate.min_confidence_keep\n  });\n\n  const durationMs = Date.now() - startTime;\n\n  // Store consolidation run\n  db.storeConsolidationRun({\n    run_id: runId,\n    items_processed: memories.length,\n    duplicates_found: duplicatesFound,\n    contradictions_found: contradictionsFound,\n    items_pruned: itemsPruned,\n    duration_ms: durationMs\n  });\n\n  console.error(`[INFO] Consolidation complete: ${duplicatesFound} dupes, ${contradictionsFound} contradictions, ${itemsPruned} pruned in ${durationMs}ms`);\n\n  db.logMetric('rb.consolidate.duration_ms', durationMs);\n  db.logMetric('rb.consolidate.duplicates', duplicatesFound);\n  db.logMetric('rb.consolidate.contradictions', contradictionsFound);\n  db.logMetric('rb.consolidate.pruned', itemsPruned);\n\n  return {\n    itemsProcessed: memories.length,\n    duplicatesFound,\n    contradictionsFound,\n    itemsPruned,\n    durationMs\n  };\n}\n\n/**\n * Deduplicate highly similar memories\n * PERFORMANCE FIX: Use bucketing/blocking to reduce O(n²) to ~O(n·k)\n * by only comparing memories within the same semantic bucket\n */\nasync function deduplicateMemories(\n  memories: any[],\n  threshold: number\n): Promise<number> {\n  let duplicatesFound = 0;\n\n  if (memories.length === 0) return 0;\n\n  // Fetch all embeddings in a single batch query (instead of N queries)\n  const dbConn = db.getDb();\n  const ids = memories.map(m => m.id);\n  const placeholders = ids.map(() => '?').join(',');\n  const rows = dbConn.prepare(`SELECT id, vector FROM pattern_embeddings WHERE id IN (${placeholders})`).all(...ids) as Array<{ id: string; vector: Buffer }>;\n\n  const embeddingsMap = new Map<string, Float32Array>();\n  for (const row of rows) {\n    embeddingsMap.set(row.id, new Float32Array(row.vector));\n  }\n\n  // PERFORMANCE: Use locality-sensitive hashing (LSH) bucketing\n  // Group memories by their dominant embedding dimension to reduce comparisons\n  const buckets = new Map<number, any[]>();\n  const BUCKET_GRANULARITY = 10; // Number of buckets per dimension\n\n  for (const mem of memories) {\n    const emb = embeddingsMap.get(mem.id);\n    if (!emb) continue;\n\n    // Find dominant dimension and bucket\n    let maxDim = 0;\n    let maxVal = -Infinity;\n    for (let i = 0; i < Math.min(emb.length, 32); i++) { // Check first 32 dims\n      if (Math.abs(emb[i]) > maxVal) {\n        maxVal = Math.abs(emb[i]);\n        maxDim = i;\n      }\n    }\n    const bucketKey = maxDim * BUCKET_GRANULARITY + Math.floor((emb[maxDim] + 1) * BUCKET_GRANULARITY / 2);\n\n    if (!buckets.has(bucketKey)) {\n      buckets.set(bucketKey, []);\n    }\n    buckets.get(bucketKey)!.push(mem);\n  }\n\n  // Compare only within buckets (and neighboring buckets for safety)\n  const deletedIds = new Set<string>();\n\n  for (const [bucketKey, bucketMemories] of buckets) {\n    // Compare within bucket\n    for (let i = 0; i < bucketMemories.length; i++) {\n      const mem1 = bucketMemories[i];\n      if (deletedIds.has(mem1.id)) continue;\n\n      const emb1 = embeddingsMap.get(mem1.id);\n      if (!emb1) continue;\n\n      for (let j = i + 1; j < bucketMemories.length; j++) {\n        const mem2 = bucketMemories[j];\n        if (deletedIds.has(mem2.id)) continue;\n\n        const emb2 = embeddingsMap.get(mem2.id);\n        if (!emb2) continue;\n\n        const similarity = cosineSimilarity(emb1, emb2);\n\n        if (similarity >= threshold) {\n          // Mark as duplicate\n          db.storeLink(mem1.id, mem2.id, 'duplicate_of', similarity);\n          duplicatesFound++;\n\n          // Merge: keep the one with higher usage\n          if (mem1.usage_count < mem2.usage_count) {\n            deletedIds.add(mem1.id);\n            console.error(`[INFO] Merged duplicate: ${mem1.pattern_data?.title || mem1.id} → ${mem2.pattern_data?.title || mem2.id}`);\n          } else {\n            deletedIds.add(mem2.id);\n          }\n        }\n      }\n    }\n  }\n\n  // Batch delete all duplicates in a single transaction\n  if (deletedIds.size > 0) {\n    const deleteIds = Array.from(deletedIds);\n    const deletePlaceholders = deleteIds.map(() => '?').join(',');\n    dbConn.prepare(`DELETE FROM patterns WHERE id IN (${deletePlaceholders})`).run(...deleteIds);\n  }\n\n  return duplicatesFound;\n}\n\n/**\n * Detect contradicting memories\n * Uses embedding similarity + semantic analysis\n * PERFORMANCE FIX: Reuses embeddings from deduplication phase and uses bucketing\n */\nasync function detectContradictions(\n  memories: any[],\n  threshold: number,\n  preloadedEmbeddings?: Map<string, Float32Array>\n): Promise<number> {\n  let contradictionsFound = 0;\n\n  if (memories.length === 0) return 0;\n\n  // Use preloaded embeddings if available, otherwise fetch in batch\n  let embeddingsMap: Map<string, Float32Array>;\n\n  if (preloadedEmbeddings) {\n    embeddingsMap = preloadedEmbeddings;\n  } else {\n    const dbConn = db.getDb();\n    const ids = memories.map(m => m.id);\n    const placeholders = ids.map(() => '?').join(',');\n    const rows = dbConn.prepare(`SELECT id, vector FROM pattern_embeddings WHERE id IN (${placeholders})`).all(...ids) as Array<{ id: string; vector: Buffer }>;\n\n    embeddingsMap = new Map<string, Float32Array>();\n    for (const row of rows) {\n      embeddingsMap.set(row.id, new Float32Array(row.vector));\n    }\n  }\n\n  // PERFORMANCE: Group by outcome first, only compare across different outcomes\n  const outcomeGroups = new Map<string, any[]>();\n\n  for (const mem of memories) {\n    const outcome = mem.pattern_data?.source?.outcome ?? 'unknown';\n    if (!outcomeGroups.has(outcome)) {\n      outcomeGroups.set(outcome, []);\n    }\n    outcomeGroups.get(outcome)!.push(mem);\n  }\n\n  // Only compare memories with different outcomes\n  const outcomeKeys = Array.from(outcomeGroups.keys());\n\n  for (let o1 = 0; o1 < outcomeKeys.length; o1++) {\n    for (let o2 = o1 + 1; o2 < outcomeKeys.length; o2++) {\n      const group1 = outcomeGroups.get(outcomeKeys[o1])!;\n      const group2 = outcomeGroups.get(outcomeKeys[o2])!;\n\n      // Compare across groups (different outcomes)\n      for (const mem1 of group1) {\n        const emb1 = embeddingsMap.get(mem1.id);\n        if (!emb1) continue;\n\n        for (const mem2 of group2) {\n          const emb2 = embeddingsMap.get(mem2.id);\n          if (!emb2) continue;\n\n          const similarity = cosineSimilarity(emb1, emb2);\n\n          // High similarity but different outcomes = contradiction\n          if (similarity >= threshold) {\n            db.storeLink(mem1.id, mem2.id, 'contradicts', similarity);\n            contradictionsFound++;\n            console.error(`[WARN] Contradiction detected: ${mem1.pattern_data?.title || mem1.id} vs ${mem2.pattern_data?.title || mem2.id}`);\n          }\n        }\n      }\n    }\n  }\n\n  return contradictionsFound;\n}\n\n/**\n * Check if consolidation should run\n * Returns true if threshold of new memories is reached\n */\nexport function shouldConsolidate(): boolean {\n  const config = loadConfig();\n  const newCount = db.countNewMemoriesSinceConsolidation();\n  return newCount >= config.consolidate.trigger_threshold;\n}\n"]}

package/dist/reasoningbank/core/distill.js

@@ -27,7 +27,7 @@ function getRouter() {
 export async function distillMemories(trajectory, verdict, query, options = {}) {
     const config = loadConfig();
     const startTime = Date.now();
-    console.log(`[INFO] Distilling memories from ${verdict.label} trajectory`);
+    console.error(`[INFO] Distilling memories from ${verdict.label} trajectory`);
     // Select appropriate prompt template
     const templateName = verdict.label === 'Success' ? 'distill-success.json' : 'distill-failure.json';
     const promptPath = join(__dirname, '../prompts', templateName);
@@ -75,7 +75,7 @@ export async function distillMemories(trajectory, verdict, query, options = {})
         // Store memories in database
         const memoryIds = await storeMemories(distilled, confidencePrior, verdict, options);
         const duration = Date.now() - startTime;
-        console.log(`[INFO] Distilled ${memoryIds.length} memories in ${duration}ms`);
+        console.error(`[INFO] Distilled ${memoryIds.length} memories in ${duration}ms`);
         db.logMetric('rb.distill.latency_ms', duration);
         db.logMetric('rb.distill.yield', memoryIds.length);
         return memoryIds;
@@ -145,7 +145,7 @@ async function storeMemories(memories, confidencePrior, verdict, options) {
             created_at: new Date().toISOString()
         });
         memoryIds.push(id);
-        console.log(`[INFO] Stored memory: ${scrubbed.title}`);
+        console.error(`[INFO] Stored memory: ${scrubbed.title}`);
     }
     return memoryIds;
 }
@@ -154,7 +154,7 @@ async function storeMemories(memories, confidencePrior, verdict, options) {
  * Simple extraction without LLM
  */
 function templateBasedDistill(trajectory, verdict, query, options) {
-    console.log('[INFO] Using template-based distillation (no API key)');
+    console.error('[INFO] Using template-based distillation (no API key)');
     // Create a single generic memory from the trajectory
     const memory = {
         title: `${verdict.label}: ${query.substring(0, 50)}`,

package/dist/reasoningbank/core/distill.js.map

@@ -1 +1 @@
-{"version":3,"file":"distill.js","sourceRoot":"","sources":["../../../src/reasoningbank/core/distill.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAClC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAC;AACpC,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAIvC,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAClD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;AAEtC,8BAA8B;AAC9B,IAAI,cAAc,GAAuB,IAAI,CAAC;AAC9C,SAAS,SAAS;IAChB,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,IAAI,WAAW,EAAE,CAAC;IACrC,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC;AAUD;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,UAAsB,EACtB,OAAgB,EAChB,KAAa,EACb,UAAkE,EAAE;IAEpE,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,OAAO,CAAC,GAAG,CAAC,mCAAmC,OAAO,CAAC,KAAK,aAAa,CAAC,CAAC;IAE3E,qCAAqC;IACrC,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,sBAAsB,CAAC;IACnG,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;IAC/D,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;IAErE,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS;QAC1C,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,iBAAiB;QAClC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,iBAAiB,CAAC;IAErC,MAAM,eAAe,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS;QACjD,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,wBAAwB;QACzC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,wBAAwB,CAAC;IAE5C,0CAA0C;IAC1C,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,kBAAkB;QAC9B,OAAO,CAAC,GAAG,CAAC,iBAAiB;QAC7B,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC;IAEpD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,4HAA4H,CAAC,CAAC;QAC3I,OAAO,oBAAoB,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACnE,CAAC;IAED,IAAI,CAAC;QACH,oBAAoB;QACpB,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAEvE,eAAe;QACf,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ;aACnC,OAAO,CAAC,gBAAgB,EAAE,KAAK,CAAC;aAChC,OAAO,CAAC,gBAAgB,EAAE,cAAc,CAAC;aACzC,OAAO,CAAC,eAAe,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAE9C,6CAA6C;QAC7C,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC;YACjC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK;YACjD,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,cAAc,CAAC,MAAM,EAAE;gBAClD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE;aAClC;YACD,WAAW,EAAE,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,GAAG;YAC9C,SAAS,EAAE,MAAM,CAAC,OAAO,CAAC,UAAU,IAAI,IAAI;SAC7C,EAAE,uBAAuB,CAAC,CAAC;QAE5B,uCAAuC;QACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO;aAC7B,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC;aACtC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aACxB,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,+BAA+B;QAC/B,MAAM,SAAS,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAElD,6BAA6B;QAC7B,MAAM,SAAS,GAAG,MAAM,aAAa,CACnC,SAAS,EACT,eAAe,EACf,OAAO,EACP,OAAO,CACR,CAAC;QAEF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,oBAAoB,SAAS,CAAC,MAAM,gBAAgB,QAAQ,IAAI,CAAC,CAAC;QAC9E,EAAE,CAAC,SAAS,CAAC,uBAAuB,EAAE,QAAQ,CAAC,CAAC;QAChD,EAAE,CAAC,SAAS,CAAC,kBAAkB,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QAEnD,OAAO,SAAS,CAAC;IACnB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,KAAK,CAAC,8BAA8B,EAAE,KAAK,CAAC,CAAC;QACrD,OAAO,oBAAoB,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACnE,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,sBAAsB,CAAC,OAAe;IAC7C,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC/C,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,OAAO,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;IACjE,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,aAAa,CAC1B,QAA2B,EAC3B,eAAuB,EACvB,OAAgB,EAChB,OAA+D;IAE/D,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,YAAY;QACZ,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAElC,qBAAqB;QACrB,MAAM,SAAS,GAAG,MAAM,gBAAgB,CACtC,GAAG,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,WAAW,IAAI,QAAQ,CAAC,OAAO,EAAE,CAChE,CAAC;QAEF,mBAAmB;QACnB,MAAM,EAAE,GAAG,IAAI,EAAE,CAAC;QAElB,eAAe;QACf,EAAE,CAAC,YAAY,CAAC;YACd,EAAE;YACF,IAAI,EAAE,kBAAkB;YACxB,YAAY,EAAE;gBACZ,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,WAAW,EAAE,QAAQ,CAAC,WAAW;gBACjC,OAAO,EAAE,QAAQ,CAAC,OAAO;gBACzB,MAAM,EAAE;oBACN,OAAO,EAAE,OAAO,CAAC,MAAM,IAAI,SAAS;oBACpC,QAAQ,EAAE,OAAO,CAAC,OAAO,IAAI,SAAS;oBACtC,OAAO,EAAE,OAAO,CAAC,KAAK;oBACtB,QAAQ,EAAE,EAAE;iBACb;gBACD,IAAI,EAAE,QAAQ,CAAC,IAAI;gBACnB,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM;gBACzC,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACpC,UAAU,EAAE,eAAe;gBAC3B,MAAM,EAAE,CAAC;aACV;YACD,UAAU,EAAE,eAAe;YAC3B,WAAW,EAAE,CAAC;SACf,CAAC,CAAC;QAEH,kBAAkB;QAClB,EAAE,CAAC,eAAe,CAAC;YACjB,EAAE;YACF,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE;YAC/C,IAAI,EAAE,SAAS,CAAC,MAAM;YACtB,MAAM,EAAE,SAAS;YACjB,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC,CAAC;QAEH,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,OAAO,CAAC,GAAG,CAAC,yBAAyB,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IACzD,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAC3B,UAAsB,EACtB,OAAgB,EAChB,KAAa,EACb,OAAY;IAEZ,OAAO,CAAC,GAAG,CAAC,uDAAuD,CAAC,CAAC;IAErE,qDAAqD;IACrD,MAAM,MAAM,GAAoB;QAC9B,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;QACpD,WAAW,EAAE,iBAAiB,OAAO,CAAC,KAAK,EAAE;QAC7C,OAAO,EAAE,UAAU,KAAK,cAAc,UAAU,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC,gBAAgB,OAAO,CAAC,KAAK,EAAE;QAClG,IAAI,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,UAAU,CAAC;QAC/C,MAAM,EAAE,OAAO,CAAC,MAAM;KACvB,CAAC;IAEF,qDAAqD;IACrD,OAAO,EAAE,CAAC,CAAC,kEAAkE;AAC/E,CAAC","sourcesContent":["/**\n * Memory Distillation from trajectories\n * Algorithm 3 from ReasoningBank paper\n */\n\nimport { readFileSync } from 'fs';\nimport { join, dirname } from 'path';\nimport { fileURLToPath } from 'url';\nimport { ulid } from 'ulid';\nimport { loadConfig } from '../utils/config.js';\nimport { scrubMemory } from '../utils/pii-scrubber.js';\nimport { computeEmbedding } from '../utils/embeddings.js';\nimport { ModelRouter } from '../../router/router.js';\nimport * as db from '../db/queries.js';\nimport type { Trajectory } from '../db/schema.js';\nimport type { Verdict } from './judge.js';\n\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\n\n// Initialize ModelRouter once\nlet routerInstance: ModelRouter | null = null;\nfunction getRouter(): ModelRouter {\n  if (!routerInstance) {\n    routerInstance = new ModelRouter();\n  }\n  return routerInstance;\n}\n\nexport interface DistilledMemory {\n  title: string;\n  description: string;\n  content: string;\n  tags: string[];\n  domain?: string;\n}\n\n/**\n * Distill memories from a trajectory\n */\nexport async function distillMemories(\n  trajectory: Trajectory,\n  verdict: Verdict,\n  query: string,\n  options: { taskId?: string; agentId?: string; domain?: string } = {}\n): Promise<string[]> {\n  const config = loadConfig();\n  const startTime = Date.now();\n\n  console.log(`[INFO] Distilling memories from ${verdict.label} trajectory`);\n\n  // Select appropriate prompt template\n  const templateName = verdict.label === 'Success' ? 'distill-success.json' : 'distill-failure.json';\n  const promptPath = join(__dirname, '../prompts', templateName);\n  const promptTemplate = JSON.parse(readFileSync(promptPath, 'utf-8'));\n\n  const maxItems = verdict.label === 'Success'\n    ? config.distill.max_items_success\n    : config.distill.max_items_failure;\n\n  const confidencePrior = verdict.label === 'Success'\n    ? config.distill.confidence_prior_success\n    : config.distill.confidence_prior_failure;\n\n  // Check if we have any API key configured\n  const hasApiKey = process.env.OPENROUTER_API_KEY ||\n                    process.env.ANTHROPIC_API_KEY ||\n                    process.env.GOOGLE_GEMINI_API_KEY;\n\n  if (!hasApiKey) {\n    console.warn('[WARN] No API key set (OPENROUTER_API_KEY, ANTHROPIC_API_KEY, or GOOGLE_GEMINI_API_KEY), using template-based distillation');\n    return templateBasedDistill(trajectory, verdict, query, options);\n  }\n\n  try {\n    // Format trajectory\n    const trajectoryText = JSON.stringify(trajectory.steps || [], null, 2);\n\n    // Build prompt\n    const prompt = promptTemplate.template\n      .replace('{{task_query}}', query)\n      .replace('{{trajectory}}', trajectoryText)\n      .replace('{{max_items}}', String(maxItems));\n\n    // Use ModelRouter for multi-provider support\n    const router = getRouter();\n    const response = await router.chat({\n      model: config.distill.model || config.judge.model,\n      messages: [\n        { role: 'system', content: promptTemplate.system },\n        { role: 'user', content: prompt }\n      ],\n      temperature: config.distill.temperature || 0.3,\n      maxTokens: config.distill.max_tokens || 2048\n    }, 'reasoningbank-distill');\n\n    // Extract content from router response\n    const content = response.content\n      .filter(block => block.type === 'text')\n      .map(block => block.text)\n      .join('\\n');\n\n    // Parse memories from response\n    const distilled = parseDistilledMemories(content);\n\n    // Store memories in database\n    const memoryIds = await storeMemories(\n      distilled,\n      confidencePrior,\n      verdict,\n      options\n    );\n\n    const duration = Date.now() - startTime;\n    console.log(`[INFO] Distilled ${memoryIds.length} memories in ${duration}ms`);\n    db.logMetric('rb.distill.latency_ms', duration);\n    db.logMetric('rb.distill.yield', memoryIds.length);\n\n    return memoryIds;\n  } catch (error) {\n    console.error('[ERROR] Distillation failed:', error);\n    return templateBasedDistill(trajectory, verdict, query, options);\n  }\n}\n\n/**\n * Parse distilled memories from LLM response\n */\nfunction parseDistilledMemories(content: string): DistilledMemory[] {\n  try {\n    const jsonMatch = content.match(/\\{[\\s\\S]*\\}/);\n    if (jsonMatch) {\n      const parsed = JSON.parse(jsonMatch[0]);\n      return parsed.memories || [];\n    }\n  } catch (error) {\n    console.warn('[WARN] Failed to parse distilled memories JSON');\n  }\n\n  return [];\n}\n\n/**\n * Store memories in database\n */\nasync function storeMemories(\n  memories: DistilledMemory[],\n  confidencePrior: number,\n  verdict: Verdict,\n  options: { taskId?: string; agentId?: string; domain?: string }\n): Promise<string[]> {\n  const memoryIds: string[] = [];\n\n  for (const mem of memories) {\n    // Scrub PII\n    const scrubbed = scrubMemory(mem);\n\n    // Generate embedding\n    const embedding = await computeEmbedding(\n      `${scrubbed.title} ${scrubbed.description} ${scrubbed.content}`\n    );\n\n    // Create memory ID\n    const id = ulid();\n\n    // Store memory\n    db.upsertMemory({\n      id,\n      type: 'reasoning_memory',\n      pattern_data: {\n        title: scrubbed.title,\n        description: scrubbed.description,\n        content: scrubbed.content,\n        source: {\n          task_id: options.taskId || 'unknown',\n          agent_id: options.agentId || 'unknown',\n          outcome: verdict.label,\n          evidence: []\n        },\n        tags: scrubbed.tags,\n        domain: options.domain || scrubbed.domain,\n        created_at: new Date().toISOString(),\n        confidence: confidencePrior,\n        n_uses: 0\n      },\n      confidence: confidencePrior,\n      usage_count: 0\n    });\n\n    // Store embedding\n    db.upsertEmbedding({\n      id,\n      model: 'distill-' + verdict.label.toLowerCase(),\n      dims: embedding.length,\n      vector: embedding,\n      created_at: new Date().toISOString()\n    });\n\n    memoryIds.push(id);\n    console.log(`[INFO] Stored memory: ${scrubbed.title}`);\n  }\n\n  return memoryIds;\n}\n\n/**\n * Template-based distillation (fallback)\n * Simple extraction without LLM\n */\nfunction templateBasedDistill(\n  trajectory: Trajectory,\n  verdict: Verdict,\n  query: string,\n  options: any\n): string[] {\n  console.log('[INFO] Using template-based distillation (no API key)');\n\n  // Create a single generic memory from the trajectory\n  const memory: DistilledMemory = {\n    title: `${verdict.label}: ${query.substring(0, 50)}`,\n    description: `Task outcome: ${verdict.label}`,\n    content: `Query: ${query}\\n\\nSteps: ${trajectory.steps?.length || 0}\\n\\nOutcome: ${verdict.label}`,\n    tags: [verdict.label.toLowerCase(), 'template'],\n    domain: options.domain\n  };\n\n  // Store synchronously (no async needed for template)\n  return []; // Skip storage for template-based (would need to make this async)\n}\n"]}
+{"version":3,"file":"distill.js","sourceRoot":"","sources":["../../../src/reasoningbank/core/distill.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAClC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAC;AACpC,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAIvC,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAClD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;AAEtC,8BAA8B;AAC9B,IAAI,cAAc,GAAuB,IAAI,CAAC;AAC9C,SAAS,SAAS;IAChB,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,IAAI,WAAW,EAAE,CAAC;IACrC,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC;AAUD;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,UAAsB,EACtB,OAAgB,EAChB,KAAa,EACb,UAAkE,EAAE;IAEpE,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,OAAO,CAAC,KAAK,CAAC,mCAAmC,OAAO,CAAC,KAAK,aAAa,CAAC,CAAC;IAE7E,qCAAqC;IACrC,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,sBAAsB,CAAC;IACnG,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;IAC/D,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;IAErE,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS;QAC1C,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,iBAAiB;QAClC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,iBAAiB,CAAC;IAErC,MAAM,eAAe,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS;QACjD,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,wBAAwB;QACzC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,wBAAwB,CAAC;IAE5C,0CAA0C;IAC1C,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,kBAAkB;QAC9B,OAAO,CAAC,GAAG,CAAC,iBAAiB;QAC7B,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC;IAEpD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,4HAA4H,CAAC,CAAC;QAC3I,OAAO,oBAAoB,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACnE,CAAC;IAED,IAAI,CAAC;QACH,oBAAoB;QACpB,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAEvE,eAAe;QACf,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ;aACnC,OAAO,CAAC,gBAAgB,EAAE,KAAK,CAAC;aAChC,OAAO,CAAC,gBAAgB,EAAE,cAAc,CAAC;aACzC,OAAO,CAAC,eAAe,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAE9C,6CAA6C;QAC7C,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC;YACjC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK;YACjD,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,cAAc,CAAC,MAAM,EAAE;gBAClD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE;aAClC;YACD,WAAW,EAAE,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,GAAG;YAC9C,SAAS,EAAE,MAAM,CAAC,OAAO,CAAC,UAAU,IAAI,IAAI;SAC7C,EAAE,uBAAuB,CAAC,CAAC;QAE5B,uCAAuC;QACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO;aAC7B,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC;aACtC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aACxB,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,+BAA+B;QAC/B,MAAM,SAAS,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAElD,6BAA6B;QAC7B,MAAM,SAAS,GAAG,MAAM,aAAa,CACnC,SAAS,EACT,eAAe,EACf,OAAO,EACP,OAAO,CACR,CAAC;QAEF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,OAAO,CAAC,KAAK,CAAC,oBAAoB,SAAS,CAAC,MAAM,gBAAgB,QAAQ,IAAI,CAAC,CAAC;QAChF,EAAE,CAAC,SAAS,CAAC,uBAAuB,EAAE,QAAQ,CAAC,CAAC;QAChD,EAAE,CAAC,SAAS,CAAC,kBAAkB,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QAEnD,OAAO,SAAS,CAAC;IACnB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,KAAK,CAAC,8BAA8B,EAAE,KAAK,CAAC,CAAC;QACrD,OAAO,oBAAoB,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACnE,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,sBAAsB,CAAC,OAAe;IAC7C,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC/C,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,OAAO,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;IACjE,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,aAAa,CAC1B,QAA2B,EAC3B,eAAuB,EACvB,OAAgB,EAChB,OAA+D;IAE/D,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,YAAY;QACZ,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAElC,qBAAqB;QACrB,MAAM,SAAS,GAAG,MAAM,gBAAgB,CACtC,GAAG,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,WAAW,IAAI,QAAQ,CAAC,OAAO,EAAE,CAChE,CAAC;QAEF,mBAAmB;QACnB,MAAM,EAAE,GAAG,IAAI,EAAE,CAAC;QAElB,eAAe;QACf,EAAE,CAAC,YAAY,CAAC;YACd,EAAE;YACF,IAAI,EAAE,kBAAkB;YACxB,YAAY,EAAE;gBACZ,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,WAAW,EAAE,QAAQ,CAAC,WAAW;gBACjC,OAAO,EAAE,QAAQ,CAAC,OAAO;gBACzB,MAAM,EAAE;oBACN,OAAO,EAAE,OAAO,CAAC,MAAM,IAAI,SAAS;oBACpC,QAAQ,EAAE,OAAO,CAAC,OAAO,IAAI,SAAS;oBACtC,OAAO,EAAE,OAAO,CAAC,KAAK;oBACtB,QAAQ,EAAE,EAAE;iBACb;gBACD,IAAI,EAAE,QAAQ,CAAC,IAAI;gBACnB,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM;gBACzC,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACpC,UAAU,EAAE,eAAe;gBAC3B,MAAM,EAAE,CAAC;aACV;YACD,UAAU,EAAE,eAAe;YAC3B,WAAW,EAAE,CAAC;SACf,CAAC,CAAC;QAEH,kBAAkB;QAClB,EAAE,CAAC,eAAe,CAAC;YACjB,EAAE;YACF,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE;YAC/C,IAAI,EAAE,SAAS,CAAC,MAAM;YACtB,MAAM,EAAE,SAAS;YACjB,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC,CAAC;QAEH,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,OAAO,CAAC,KAAK,CAAC,yBAAyB,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAC3D,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAC3B,UAAsB,EACtB,OAAgB,EAChB,KAAa,EACb,OAAY;IAEZ,OAAO,CAAC,KAAK,CAAC,uDAAuD,CAAC,CAAC;IAEvE,qDAAqD;IACrD,MAAM,MAAM,GAAoB;QAC9B,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;QACpD,WAAW,EAAE,iBAAiB,OAAO,CAAC,KAAK,EAAE;QAC7C,OAAO,EAAE,UAAU,KAAK,cAAc,UAAU,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC,gBAAgB,OAAO,CAAC,KAAK,EAAE;QAClG,IAAI,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,UAAU,CAAC;QAC/C,MAAM,EAAE,OAAO,CAAC,MAAM;KACvB,CAAC;IAEF,qDAAqD;IACrD,OAAO,EAAE,CAAC,CAAC,kEAAkE;AAC/E,CAAC","sourcesContent":["/**\n * Memory Distillation from trajectories\n * Algorithm 3 from ReasoningBank paper\n */\n\nimport { readFileSync } from 'fs';\nimport { join, dirname } from 'path';\nimport { fileURLToPath } from 'url';\nimport { ulid } from 'ulid';\nimport { loadConfig } from '../utils/config.js';\nimport { scrubMemory } from '../utils/pii-scrubber.js';\nimport { computeEmbedding } from '../utils/embeddings.js';\nimport { ModelRouter } from '../../router/router.js';\nimport * as db from '../db/queries.js';\nimport type { Trajectory } from '../db/schema.js';\nimport type { Verdict } from './judge.js';\n\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\n\n// Initialize ModelRouter once\nlet routerInstance: ModelRouter | null = null;\nfunction getRouter(): ModelRouter {\n  if (!routerInstance) {\n    routerInstance = new ModelRouter();\n  }\n  return routerInstance;\n}\n\nexport interface DistilledMemory {\n  title: string;\n  description: string;\n  content: string;\n  tags: string[];\n  domain?: string;\n}\n\n/**\n * Distill memories from a trajectory\n */\nexport async function distillMemories(\n  trajectory: Trajectory,\n  verdict: Verdict,\n  query: string,\n  options: { taskId?: string; agentId?: string; domain?: string } = {}\n): Promise<string[]> {\n  const config = loadConfig();\n  const startTime = Date.now();\n\n  console.error(`[INFO] Distilling memories from ${verdict.label} trajectory`);\n\n  // Select appropriate prompt template\n  const templateName = verdict.label === 'Success' ? 'distill-success.json' : 'distill-failure.json';\n  const promptPath = join(__dirname, '../prompts', templateName);\n  const promptTemplate = JSON.parse(readFileSync(promptPath, 'utf-8'));\n\n  const maxItems = verdict.label === 'Success'\n    ? config.distill.max_items_success\n    : config.distill.max_items_failure;\n\n  const confidencePrior = verdict.label === 'Success'\n    ? config.distill.confidence_prior_success\n    : config.distill.confidence_prior_failure;\n\n  // Check if we have any API key configured\n  const hasApiKey = process.env.OPENROUTER_API_KEY ||\n                    process.env.ANTHROPIC_API_KEY ||\n                    process.env.GOOGLE_GEMINI_API_KEY;\n\n  if (!hasApiKey) {\n    console.warn('[WARN] No API key set (OPENROUTER_API_KEY, ANTHROPIC_API_KEY, or GOOGLE_GEMINI_API_KEY), using template-based distillation');\n    return templateBasedDistill(trajectory, verdict, query, options);\n  }\n\n  try {\n    // Format trajectory\n    const trajectoryText = JSON.stringify(trajectory.steps || [], null, 2);\n\n    // Build prompt\n    const prompt = promptTemplate.template\n      .replace('{{task_query}}', query)\n      .replace('{{trajectory}}', trajectoryText)\n      .replace('{{max_items}}', String(maxItems));\n\n    // Use ModelRouter for multi-provider support\n    const router = getRouter();\n    const response = await router.chat({\n      model: config.distill.model || config.judge.model,\n      messages: [\n        { role: 'system', content: promptTemplate.system },\n        { role: 'user', content: prompt }\n      ],\n      temperature: config.distill.temperature || 0.3,\n      maxTokens: config.distill.max_tokens || 2048\n    }, 'reasoningbank-distill');\n\n    // Extract content from router response\n    const content = response.content\n      .filter(block => block.type === 'text')\n      .map(block => block.text)\n      .join('\\n');\n\n    // Parse memories from response\n    const distilled = parseDistilledMemories(content);\n\n    // Store memories in database\n    const memoryIds = await storeMemories(\n      distilled,\n      confidencePrior,\n      verdict,\n      options\n    );\n\n    const duration = Date.now() - startTime;\n    console.error(`[INFO] Distilled ${memoryIds.length} memories in ${duration}ms`);\n    db.logMetric('rb.distill.latency_ms', duration);\n    db.logMetric('rb.distill.yield', memoryIds.length);\n\n    return memoryIds;\n  } catch (error) {\n    console.error('[ERROR] Distillation failed:', error);\n    return templateBasedDistill(trajectory, verdict, query, options);\n  }\n}\n\n/**\n * Parse distilled memories from LLM response\n */\nfunction parseDistilledMemories(content: string): DistilledMemory[] {\n  try {\n    const jsonMatch = content.match(/\\{[\\s\\S]*\\}/);\n    if (jsonMatch) {\n      const parsed = JSON.parse(jsonMatch[0]);\n      return parsed.memories || [];\n    }\n  } catch (error) {\n    console.warn('[WARN] Failed to parse distilled memories JSON');\n  }\n\n  return [];\n}\n\n/**\n * Store memories in database\n */\nasync function storeMemories(\n  memories: DistilledMemory[],\n  confidencePrior: number,\n  verdict: Verdict,\n  options: { taskId?: string; agentId?: string; domain?: string }\n): Promise<string[]> {\n  const memoryIds: string[] = [];\n\n  for (const mem of memories) {\n    // Scrub PII\n    const scrubbed = scrubMemory(mem);\n\n    // Generate embedding\n    const embedding = await computeEmbedding(\n      `${scrubbed.title} ${scrubbed.description} ${scrubbed.content}`\n    );\n\n    // Create memory ID\n    const id = ulid();\n\n    // Store memory\n    db.upsertMemory({\n      id,\n      type: 'reasoning_memory',\n      pattern_data: {\n        title: scrubbed.title,\n        description: scrubbed.description,\n        content: scrubbed.content,\n        source: {\n          task_id: options.taskId || 'unknown',\n          agent_id: options.agentId || 'unknown',\n          outcome: verdict.label,\n          evidence: []\n        },\n        tags: scrubbed.tags,\n        domain: options.domain || scrubbed.domain,\n        created_at: new Date().toISOString(),\n        confidence: confidencePrior,\n        n_uses: 0\n      },\n      confidence: confidencePrior,\n      usage_count: 0\n    });\n\n    // Store embedding\n    db.upsertEmbedding({\n      id,\n      model: 'distill-' + verdict.label.toLowerCase(),\n      dims: embedding.length,\n      vector: embedding,\n      created_at: new Date().toISOString()\n    });\n\n    memoryIds.push(id);\n    console.error(`[INFO] Stored memory: ${scrubbed.title}`);\n  }\n\n  return memoryIds;\n}\n\n/**\n * Template-based distillation (fallback)\n * Simple extraction without LLM\n */\nfunction templateBasedDistill(\n  trajectory: Trajectory,\n  verdict: Verdict,\n  query: string,\n  options: any\n): string[] {\n  console.error('[INFO] Using template-based distillation (no API key)');\n\n  // Create a single generic memory from the trajectory\n  const memory: DistilledMemory = {\n    title: `${verdict.label}: ${query.substring(0, 50)}`,\n    description: `Task outcome: ${verdict.label}`,\n    content: `Query: ${query}\\n\\nSteps: ${trajectory.steps?.length || 0}\\n\\nOutcome: ${verdict.label}`,\n    tags: [verdict.label.toLowerCase(), 'template'],\n    domain: options.domain\n  };\n\n  // Store synchronously (no async needed for template)\n  return []; // Skip storage for template-based (would need to make this async)\n}\n"]}

package/dist/reasoningbank/core/judge.js

@@ -23,7 +23,7 @@ function getRouter() {
 export async function judgeTrajectory(trajectory, query, options = {}) {
     const config = loadConfig();
     const startTime = Date.now();
-    console.log(`[INFO] Judging trajectory for query: ${query.substring(0, 100)}...`);
+    console.error(`[INFO] Judging trajectory for query: ${query.substring(0, 100)}...`);
     // Load judge prompt template (relative to this file)
     const promptPath = join(__dirname, '../prompts/judge.json');
     const promptTemplate = JSON.parse(readFileSync(promptPath, 'utf-8'));
@@ -60,7 +60,7 @@ export async function judgeTrajectory(trajectory, query, options = {}) {
         // Parse JSON response
         const verdict = parseVerdict(content);
         const duration = Date.now() - startTime;
-        console.log(`[INFO] Judgment complete: ${verdict.label} (${verdict.confidence}) in ${duration}ms`);
+        console.error(`[INFO] Judgment complete: ${verdict.label} (${verdict.confidence}) in ${duration}ms`);
         db.logMetric('rb.judge.latency_ms', duration);
         db.logMetric('rb.judge.success_rate', verdict.label === 'Success' ? 1 : 0);
         return verdict;

package/dist/reasoningbank/core/judge.js.map

@@ -1 +1 @@
-{"version":3,"file":"judge.js","sourceRoot":"","sources":["../../../src/reasoningbank/core/judge.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAClC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAC;AACpC,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAGrD,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAClD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;AAEtC,8BAA8B;AAC9B,IAAI,cAAc,GAAuB,IAAI,CAAC;AAC9C,SAAS,SAAS;IAChB,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,IAAI,WAAW,EAAE,CAAC;IACrC,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC;AAQD;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,UAAsB,EACtB,KAAa,EACb,UAAkC,EAAE;IAEpC,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,OAAO,CAAC,GAAG,CAAC,wCAAwC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;IAElF,qDAAqD;IACrD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,uBAAuB,CAAC,CAAC;IAC5D,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;IAErE,iCAAiC;IACjC,MAAM,cAAc,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAEpD,0CAA0C;IAC1C,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,kBAAkB;QAC9B,OAAO,CAAC,GAAG,CAAC,iBAAiB;QAC7B,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC;IAEpD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,mHAAmH,CAAC,CAAC;QAClI,OAAO,cAAc,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED,IAAI,CAAC;QACH,mDAAmD;QACnD,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ;aACnC,OAAO,CAAC,gBAAgB,EAAE,KAAK,CAAC;aAChC,OAAO,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;QAE7C,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC;YACjC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK;YACzB,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,cAAc,CAAC,MAAM,EAAE;gBAClD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE;aAClC;YACD,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC,WAAW;YACrC,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,UAAU;SACnC,EAAE,qBAAqB,CAAC,CAAC;QAE1B,uCAAuC;QACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO;aAC7B,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC;aACtC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aACxB,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,sBAAsB;QACtB,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QAEtC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,6BAA6B,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,UAAU,QAAQ,QAAQ,IAAI,CAAC,CAAC;QACnG,EAAE,CAAC,SAAS,CAAC,qBAAqB,EAAE,QAAQ,CAAC,CAAC;QAC9C,EAAE,CAAC,SAAS,CAAC,uBAAuB,EAAE,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3E,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,KAAK,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC;QAC9C,OAAO,CAAC,IAAI,CAAC,2CAA2C,CAAC,CAAC;QAC1D,OAAO,cAAc,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,UAAsB;IAC9C,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;IACrC,IAAI,SAAS,GAAG,EAAE,CAAC;IAEnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,SAAS,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;IACzE,CAAC;IAED,OAAO,SAAS,IAAI,mBAAmB,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,OAAe;IACnC,IAAI,CAAC;QACH,oCAAoC;QACpC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC/C,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,OAAO;gBACL,KAAK,EAAE,MAAM,CAAC,OAAO,EAAE,KAAK,IAAI,MAAM,CAAC,KAAK,IAAI,SAAS;gBACzD,UAAU,EAAE,MAAM,CAAC,OAAO,EAAE,UAAU,IAAI,MAAM,CAAC,UAAU,IAAI,GAAG;gBAClE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,OAAO,IAAI,MAAM,CAAC,OAAO,IAAI,EAAE;aACzD,CAAC;QACJ,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;IAC3E,CAAC;IAED,iCAAiC;IACjC,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAE1E,OAAO;QACL,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;QACxC,UAAU,EAAE,GAAG;QACf,OAAO,EAAE,CAAC,sCAAsC,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,UAAsB,EAAE,KAAa;IAC3D,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;IAErC,6BAA6B;IAC7B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAClC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CACrD,CAAC;IAEF,kCAAkC;IAClC,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACtC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CACxD,CAAC;IAEF,oEAAoE;IACpE,MAAM,SAAS,GAAG,CAAC,SAAS,IAAI,aAAa,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAElE,OAAO;QACL,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;QACxC,UAAU,EAAE,GAAG,EAAE,+BAA+B;QAChD,OAAO,EAAE;YACP,iCAAiC;YACjC,UAAU,KAAK,CAAC,MAAM,EAAE;YACxB,WAAW,SAAS,EAAE;YACtB,uBAAuB,aAAa,EAAE;SACvC;KACF,CAAC;AACJ,CAAC;AAED,8CAA8C;AAC9C,OAAO,KAAK,EAAE,MAAM,kBAAkB,CAAC","sourcesContent":["/**\n * LLM-as-Judge for trajectory evaluation\n * Algorithm 2 from ReasoningBank paper\n */\n\nimport { readFileSync } from 'fs';\nimport { join, dirname } from 'path';\nimport { fileURLToPath } from 'url';\nimport { loadConfig } from '../utils/config.js';\nimport { ModelRouter } from '../../router/router.js';\nimport type { Trajectory } from '../db/schema.js';\n\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\n\n// Initialize ModelRouter once\nlet routerInstance: ModelRouter | null = null;\nfunction getRouter(): ModelRouter {\n  if (!routerInstance) {\n    routerInstance = new ModelRouter();\n  }\n  return routerInstance;\n}\n\nexport interface Verdict {\n  label: 'Success' | 'Failure';\n  confidence: number;\n  reasons: string[];\n}\n\n/**\n * Judge a task trajectory using LLM evaluation\n */\nexport async function judgeTrajectory(\n  trajectory: Trajectory,\n  query: string,\n  options: { useCache?: boolean } = {}\n): Promise<Verdict> {\n  const config = loadConfig();\n  const startTime = Date.now();\n\n  console.log(`[INFO] Judging trajectory for query: ${query.substring(0, 100)}...`);\n\n  // Load judge prompt template (relative to this file)\n  const promptPath = join(__dirname, '../prompts/judge.json');\n  const promptTemplate = JSON.parse(readFileSync(promptPath, 'utf-8'));\n\n  // Format trajectory for judgment\n  const trajectoryText = formatTrajectory(trajectory);\n\n  // Check if we have any API key configured\n  const hasApiKey = process.env.OPENROUTER_API_KEY ||\n                    process.env.ANTHROPIC_API_KEY ||\n                    process.env.GOOGLE_GEMINI_API_KEY;\n\n  if (!hasApiKey) {\n    console.warn('[WARN] No API key set (OPENROUTER_API_KEY, ANTHROPIC_API_KEY, or GOOGLE_GEMINI_API_KEY), using heuristic judgment');\n    return heuristicJudge(trajectory, query);\n  }\n\n  try {\n    // Call LLM API with judge prompt using ModelRouter\n    const prompt = promptTemplate.template\n      .replace('{{task_query}}', query)\n      .replace('{{trajectory}}', trajectoryText);\n\n    const router = getRouter();\n    const response = await router.chat({\n      model: config.judge.model,\n      messages: [\n        { role: 'system', content: promptTemplate.system },\n        { role: 'user', content: prompt }\n      ],\n      temperature: config.judge.temperature,\n      maxTokens: config.judge.max_tokens\n    }, 'reasoningbank-judge');\n\n    // Extract content from router response\n    const content = response.content\n      .filter(block => block.type === 'text')\n      .map(block => block.text)\n      .join('\\n');\n\n    // Parse JSON response\n    const verdict = parseVerdict(content);\n\n    const duration = Date.now() - startTime;\n    console.log(`[INFO] Judgment complete: ${verdict.label} (${verdict.confidence}) in ${duration}ms`);\n    db.logMetric('rb.judge.latency_ms', duration);\n    db.logMetric('rb.judge.success_rate', verdict.label === 'Success' ? 1 : 0);\n\n    return verdict;\n  } catch (error) {\n    console.error('[ERROR] Judge failed:', error);\n    console.warn('[WARN] Falling back to heuristic judgment');\n    return heuristicJudge(trajectory, query);\n  }\n}\n\n/**\n * Format trajectory for LLM consumption\n */\nfunction formatTrajectory(trajectory: Trajectory): string {\n  const steps = trajectory.steps || [];\n  let formatted = '';\n\n  for (let i = 0; i < steps.length; i++) {\n    formatted += `Step ${i + 1}: ${JSON.stringify(steps[i], null, 2)}\\n\\n`;\n  }\n\n  return formatted || 'No steps recorded';\n}\n\n/**\n * Parse verdict from LLM response\n */\nfunction parseVerdict(content: string): Verdict {\n  try {\n    // Try to extract JSON from response\n    const jsonMatch = content.match(/\\{[\\s\\S]*\\}/);\n    if (jsonMatch) {\n      const parsed = JSON.parse(jsonMatch[0]);\n      return {\n        label: parsed.verdict?.label || parsed.label || 'Failure',\n        confidence: parsed.verdict?.confidence || parsed.confidence || 0.5,\n        reasons: parsed.verdict?.reasons || parsed.reasons || []\n      };\n    }\n  } catch (error) {\n    console.warn('[WARN] Failed to parse verdict JSON, using text analysis');\n  }\n\n  // Fallback: text-based detection\n  const lower = content.toLowerCase();\n  const isSuccess = lower.includes('success') && !lower.includes('failure');\n\n  return {\n    label: isSuccess ? 'Success' : 'Failure',\n    confidence: 0.6,\n    reasons: ['Parsed from text (JSON parse failed)']\n  };\n}\n\n/**\n * Heuristic judgment when LLM is unavailable\n * Simple rule-based classification\n */\nfunction heuristicJudge(trajectory: Trajectory, query: string): Verdict {\n  const steps = trajectory.steps || [];\n\n  // Check for error indicators\n  const hasErrors = steps.some(step =>\n    JSON.stringify(step).toLowerCase().includes('error')\n  );\n\n  // Check for completion indicators\n  const hasCompletion = steps.some(step =>\n    JSON.stringify(step).toLowerCase().includes('complete')\n  );\n\n  // Simple heuristic: success if no errors and has completion markers\n  const isSuccess = !hasErrors && hasCompletion && steps.length > 0;\n\n  return {\n    label: isSuccess ? 'Success' : 'Failure',\n    confidence: 0.5, // Low confidence for heuristic\n    reasons: [\n      `Heuristic judgment (no API key)`,\n      `Steps: ${steps.length}`,\n      `Errors: ${hasErrors}`,\n      `Completion markers: ${hasCompletion}`\n    ]\n  };\n}\n\n// Import db late to avoid circular dependency\nimport * as db from '../db/queries.js';\n"]}
+{"version":3,"file":"judge.js","sourceRoot":"","sources":["../../../src/reasoningbank/core/judge.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAClC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAC;AACpC,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAGrD,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAClD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;AAEtC,8BAA8B;AAC9B,IAAI,cAAc,GAAuB,IAAI,CAAC;AAC9C,SAAS,SAAS;IAChB,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,IAAI,WAAW,EAAE,CAAC;IACrC,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC;AAQD;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,UAAsB,EACtB,KAAa,EACb,UAAkC,EAAE;IAEpC,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,OAAO,CAAC,KAAK,CAAC,wCAAwC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;IAEpF,qDAAqD;IACrD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,uBAAuB,CAAC,CAAC;IAC5D,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;IAErE,iCAAiC;IACjC,MAAM,cAAc,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAEpD,0CAA0C;IAC1C,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,kBAAkB;QAC9B,OAAO,CAAC,GAAG,CAAC,iBAAiB;QAC7B,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC;IAEpD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,mHAAmH,CAAC,CAAC;QAClI,OAAO,cAAc,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED,IAAI,CAAC;QACH,mDAAmD;QACnD,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ;aACnC,OAAO,CAAC,gBAAgB,EAAE,KAAK,CAAC;aAChC,OAAO,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;QAE7C,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC;YACjC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK;YACzB,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,cAAc,CAAC,MAAM,EAAE;gBAClD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE;aAClC;YACD,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC,WAAW;YACrC,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,UAAU;SACnC,EAAE,qBAAqB,CAAC,CAAC;QAE1B,uCAAuC;QACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO;aAC7B,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC;aACtC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aACxB,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,sBAAsB;QACtB,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QAEtC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,OAAO,CAAC,KAAK,CAAC,6BAA6B,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,UAAU,QAAQ,QAAQ,IAAI,CAAC,CAAC;QACrG,EAAE,CAAC,SAAS,CAAC,qBAAqB,EAAE,QAAQ,CAAC,CAAC;QAC9C,EAAE,CAAC,SAAS,CAAC,uBAAuB,EAAE,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3E,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,KAAK,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC;QAC9C,OAAO,CAAC,IAAI,CAAC,2CAA2C,CAAC,CAAC;QAC1D,OAAO,cAAc,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,UAAsB;IAC9C,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;IACrC,IAAI,SAAS,GAAG,EAAE,CAAC;IAEnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,SAAS,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;IACzE,CAAC;IAED,OAAO,SAAS,IAAI,mBAAmB,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,OAAe;IACnC,IAAI,CAAC;QACH,oCAAoC;QACpC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC/C,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,OAAO;gBACL,KAAK,EAAE,MAAM,CAAC,OAAO,EAAE,KAAK,IAAI,MAAM,CAAC,KAAK,IAAI,SAAS;gBACzD,UAAU,EAAE,MAAM,CAAC,OAAO,EAAE,UAAU,IAAI,MAAM,CAAC,UAAU,IAAI,GAAG;gBAClE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,OAAO,IAAI,MAAM,CAAC,OAAO,IAAI,EAAE;aACzD,CAAC;QACJ,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;IAC3E,CAAC;IAED,iCAAiC;IACjC,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAE1E,OAAO;QACL,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;QACxC,UAAU,EAAE,GAAG;QACf,OAAO,EAAE,CAAC,sCAAsC,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,UAAsB,EAAE,KAAa;IAC3D,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;IAErC,6BAA6B;IAC7B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAClC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CACrD,CAAC;IAEF,kCAAkC;IAClC,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACtC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CACxD,CAAC;IAEF,oEAAoE;IACpE,MAAM,SAAS,GAAG,CAAC,SAAS,IAAI,aAAa,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAElE,OAAO;QACL,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;QACxC,UAAU,EAAE,GAAG,EAAE,+BAA+B;QAChD,OAAO,EAAE;YACP,iCAAiC;YACjC,UAAU,KAAK,CAAC,MAAM,EAAE;YACxB,WAAW,SAAS,EAAE;YACtB,uBAAuB,aAAa,EAAE;SACvC;KACF,CAAC;AACJ,CAAC;AAED,8CAA8C;AAC9C,OAAO,KAAK,EAAE,MAAM,kBAAkB,CAAC","sourcesContent":["/**\n * LLM-as-Judge for trajectory evaluation\n * Algorithm 2 from ReasoningBank paper\n */\n\nimport { readFileSync } from 'fs';\nimport { join, dirname } from 'path';\nimport { fileURLToPath } from 'url';\nimport { loadConfig } from '../utils/config.js';\nimport { ModelRouter } from '../../router/router.js';\nimport type { Trajectory } from '../db/schema.js';\n\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\n\n// Initialize ModelRouter once\nlet routerInstance: ModelRouter | null = null;\nfunction getRouter(): ModelRouter {\n  if (!routerInstance) {\n    routerInstance = new ModelRouter();\n  }\n  return routerInstance;\n}\n\nexport interface Verdict {\n  label: 'Success' | 'Failure';\n  confidence: number;\n  reasons: string[];\n}\n\n/**\n * Judge a task trajectory using LLM evaluation\n */\nexport async function judgeTrajectory(\n  trajectory: Trajectory,\n  query: string,\n  options: { useCache?: boolean } = {}\n): Promise<Verdict> {\n  const config = loadConfig();\n  const startTime = Date.now();\n\n  console.error(`[INFO] Judging trajectory for query: ${query.substring(0, 100)}...`);\n\n  // Load judge prompt template (relative to this file)\n  const promptPath = join(__dirname, '../prompts/judge.json');\n  const promptTemplate = JSON.parse(readFileSync(promptPath, 'utf-8'));\n\n  // Format trajectory for judgment\n  const trajectoryText = formatTrajectory(trajectory);\n\n  // Check if we have any API key configured\n  const hasApiKey = process.env.OPENROUTER_API_KEY ||\n                    process.env.ANTHROPIC_API_KEY ||\n                    process.env.GOOGLE_GEMINI_API_KEY;\n\n  if (!hasApiKey) {\n    console.warn('[WARN] No API key set (OPENROUTER_API_KEY, ANTHROPIC_API_KEY, or GOOGLE_GEMINI_API_KEY), using heuristic judgment');\n    return heuristicJudge(trajectory, query);\n  }\n\n  try {\n    // Call LLM API with judge prompt using ModelRouter\n    const prompt = promptTemplate.template\n      .replace('{{task_query}}', query)\n      .replace('{{trajectory}}', trajectoryText);\n\n    const router = getRouter();\n    const response = await router.chat({\n      model: config.judge.model,\n      messages: [\n        { role: 'system', content: promptTemplate.system },\n        { role: 'user', content: prompt }\n      ],\n      temperature: config.judge.temperature,\n      maxTokens: config.judge.max_tokens\n    }, 'reasoningbank-judge');\n\n    // Extract content from router response\n    const content = response.content\n      .filter(block => block.type === 'text')\n      .map(block => block.text)\n      .join('\\n');\n\n    // Parse JSON response\n    const verdict = parseVerdict(content);\n\n    const duration = Date.now() - startTime;\n    console.error(`[INFO] Judgment complete: ${verdict.label} (${verdict.confidence}) in ${duration}ms`);\n    db.logMetric('rb.judge.latency_ms', duration);\n    db.logMetric('rb.judge.success_rate', verdict.label === 'Success' ? 1 : 0);\n\n    return verdict;\n  } catch (error) {\n    console.error('[ERROR] Judge failed:', error);\n    console.warn('[WARN] Falling back to heuristic judgment');\n    return heuristicJudge(trajectory, query);\n  }\n}\n\n/**\n * Format trajectory for LLM consumption\n */\nfunction formatTrajectory(trajectory: Trajectory): string {\n  const steps = trajectory.steps || [];\n  let formatted = '';\n\n  for (let i = 0; i < steps.length; i++) {\n    formatted += `Step ${i + 1}: ${JSON.stringify(steps[i], null, 2)}\\n\\n`;\n  }\n\n  return formatted || 'No steps recorded';\n}\n\n/**\n * Parse verdict from LLM response\n */\nfunction parseVerdict(content: string): Verdict {\n  try {\n    // Try to extract JSON from response\n    const jsonMatch = content.match(/\\{[\\s\\S]*\\}/);\n    if (jsonMatch) {\n      const parsed = JSON.parse(jsonMatch[0]);\n      return {\n        label: parsed.verdict?.label || parsed.label || 'Failure',\n        confidence: parsed.verdict?.confidence || parsed.confidence || 0.5,\n        reasons: parsed.verdict?.reasons || parsed.reasons || []\n      };\n    }\n  } catch (error) {\n    console.warn('[WARN] Failed to parse verdict JSON, using text analysis');\n  }\n\n  // Fallback: text-based detection\n  const lower = content.toLowerCase();\n  const isSuccess = lower.includes('success') && !lower.includes('failure');\n\n  return {\n    label: isSuccess ? 'Success' : 'Failure',\n    confidence: 0.6,\n    reasons: ['Parsed from text (JSON parse failed)']\n  };\n}\n\n/**\n * Heuristic judgment when LLM is unavailable\n * Simple rule-based classification\n */\nfunction heuristicJudge(trajectory: Trajectory, query: string): Verdict {\n  const steps = trajectory.steps || [];\n\n  // Check for error indicators\n  const hasErrors = steps.some(step =>\n    JSON.stringify(step).toLowerCase().includes('error')\n  );\n\n  // Check for completion indicators\n  const hasCompletion = steps.some(step =>\n    JSON.stringify(step).toLowerCase().includes('complete')\n  );\n\n  // Simple heuristic: success if no errors and has completion markers\n  const isSuccess = !hasErrors && hasCompletion && steps.length > 0;\n\n  return {\n    label: isSuccess ? 'Success' : 'Failure',\n    confidence: 0.5, // Low confidence for heuristic\n    reasons: [\n      `Heuristic judgment (no API key)`,\n      `Steps: ${steps.length}`,\n      `Errors: ${hasErrors}`,\n      `Completion markers: ${hasCompletion}`\n    ]\n  };\n}\n\n// Import db late to avoid circular dependency\nimport * as db from '../db/queries.js';\n"]}

package/dist/reasoningbank/core/matts.js

@@ -35,7 +35,7 @@ export async function mattsParallel(taskFn, query, options = {}) {
     const k = options.k || config.matts.parallel_k;
     const runId = ulid();
     const startTime = Date.now();
-    console.log(`[INFO] Starting MaTTS parallel mode with k=${k}`);
+    console.error(`[INFO] Starting MaTTS parallel mode with k=${k}`);
     // Store MaTTS run
     db.storeMattsRun({
         run_id: runId,
@@ -48,7 +48,7 @@ export async function mattsParallel(taskFn, query, options = {}) {
     const trajectories = [];
     // Execute k independent rollouts
     for (let i = 0; i < k; i++) {
-        console.log(`[INFO] MaTTS parallel rollout ${i + 1}/${k}`);
+        console.error(`[INFO] MaTTS parallel rollout ${i + 1}/${k}`);
         try {
             const trajectory = await taskFn();
             const verdict = await judgeTrajectory(trajectory, query);
@@ -79,7 +79,7 @@ export async function mattsParallel(taskFn, query, options = {}) {
     const aggregatedMemories = await aggregateMemories(trajectories, query, options);
     const successRate = trajectories.filter(t => t.verdict.label === 'Success').length / trajectories.length;
     const duration = Date.now() - startTime;
-    console.log(`[INFO] MaTTS parallel complete: ${trajectories.length} trajectories, ${successRate * 100}% success in ${duration}ms`);
+    console.error(`[INFO] MaTTS parallel complete: ${trajectories.length} trajectories, ${successRate * 100}% success in ${duration}ms`);
     db.logMetric('rb.matts.parallel.duration_ms', duration);
     db.logMetric('rb.matts.parallel.success_rate', successRate);
     db.logMetric('rb.matts.parallel.memories', aggregatedMemories.length);
@@ -102,7 +102,7 @@ export async function mattsSequential(taskFn, query, options = {}) {
     const r = options.r || config.matts.sequential_r || config.matts.sequential_k;
     const runId = ulid();
     const startTime = Date.now();
-    console.log(`[INFO] Starting MaTTS sequential mode with r=${r}`);
+    console.error(`[INFO] Starting MaTTS sequential mode with r=${r}`);
     db.storeMattsRun({
         run_id: runId,
         task_id: options.taskId || 'matts-seq-' + runId,
@@ -115,7 +115,7 @@ export async function mattsSequential(taskFn, query, options = {}) {
     let previousMemories = [];
     // Iterative refinement
     for (let i = 0; i < r; i++) {
-        console.log(`[INFO] MaTTS sequential iteration ${i + 1}/${r}`);
+        console.error(`[INFO] MaTTS sequential iteration ${i + 1}/${r}`);
         try {
             // Retrieve relevant memories (including from previous iterations)
             const memories = await retrieveMemories(query, {
@@ -131,7 +131,7 @@ export async function mattsSequential(taskFn, query, options = {}) {
             });
             // If success and stop_on_success is true, break early
             if (verdict.label === 'Success' && (config.matts.sequential_stop_on_success ?? true)) {
-                console.log(`[INFO] Success achieved at iteration ${i + 1}, stopping early`);
+                console.error(`[INFO] Success achieved at iteration ${i + 1}, stopping early`);
                 break;
             }
             // Distill memories from this iteration
@@ -157,7 +157,7 @@ export async function mattsSequential(taskFn, query, options = {}) {
     }
     const successRate = trajectories.filter(t => t.verdict.label === 'Success').length / trajectories.length;
     const duration = Date.now() - startTime;
-    console.log(`[INFO] MaTTS sequential complete: ${trajectories.length} iterations, ${successRate * 100}% success in ${duration}ms`);
+    console.error(`[INFO] MaTTS sequential complete: ${trajectories.length} iterations, ${successRate * 100}% success in ${duration}ms`);
     db.logMetric('rb.matts.sequential.duration_ms', duration);
     db.logMetric('rb.matts.sequential.success_rate', successRate);
     return {
@@ -174,7 +174,7 @@ export async function mattsSequential(taskFn, query, options = {}) {
  * Aggregate memories from multiple trajectories using self-contrast
  */
 async function aggregateMemories(trajectories, query, options) {
-    console.log('[INFO] Aggregating memories via self-contrast');
+    console.error('[INFO] Aggregating memories via self-contrast');
     // Load aggregation prompt
     const promptPath = join(__dirname, '../prompts', 'matts-aggregate.json');
     const promptTemplate = JSON.parse(readFileSync(promptPath, 'utf-8'));

package/dist/reasoningbank/core/matts.js.map

@@ -1 +1 @@
-{"version":3,"file":"matts.js","sourceRoot":"","sources":["../../../src/reasoningbank/core/matts.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAClC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAC;AACpC,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAGvC,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAClD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;AAEtC,8BAA8B;AAC9B,IAAI,cAAc,GAAuB,IAAI,CAAC;AAC9C,SAAS,SAAS;IAChB,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,IAAI,WAAW,EAAE,CAAC;IACrC,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC;AAgBD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,MAAiC,EACjC,KAAa,EACb,UAA8E,EAAE;IAEhF,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,EAAE,CAAC;IACrB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,OAAO,CAAC,GAAG,CAAC,8CAA8C,CAAC,EAAE,CAAC,CAAC;IAE/D,kBAAkB;IAClB,EAAE,CAAC,aAAa,CAAC;QACf,MAAM,EAAE,KAAK;QACb,OAAO,EAAE,OAAO,CAAC,MAAM,IAAI,QAAQ,GAAG,KAAK;QAC3C,IAAI,EAAE,UAAU;QAChB,CAAC;QACD,MAAM,EAAE,SAAS;QACjB,OAAO,EAAE,SAAS;KACnB,CAAC,CAAC;IAEH,MAAM,YAAY,GAAgC,EAAE,CAAC;IAErD,iCAAiC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,iCAAiC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE3D,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,MAAM,MAAM,EAAE,CAAC;YAClC,MAAM,OAAO,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YAEzD,YAAY,CAAC,IAAI,CAAC;gBAChB,EAAE,EAAE,IAAI,EAAE;gBACV,OAAO;gBACP,UAAU;aACX,CAAC,CAAC;YAEH,mBAAmB;YACnB,EAAE,CAAC,eAAe,CAAC;gBACjB,OAAO,EAAE,OAAO,CAAC,MAAM,IAAI,QAAQ,GAAG,KAAK;gBAC3C,QAAQ,EAAE,OAAO,CAAC,OAAO,IAAI,aAAa;gBAC1C,KAAK;gBACL,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC;gBAC3C,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACpC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBAClC,WAAW,EAAE,OAAO,CAAC,KAAK;gBAC1B,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC;gBAC9C,YAAY,EAAE,KAAK;aACpB,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,yBAAyB,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,MAAM,kBAAkB,GAAG,MAAM,iBAAiB,CAAC,YAAY,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAEjF,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;IACzG,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAExC,OAAO,CAAC,GAAG,CAAC,mCAAmC,YAAY,CAAC,MAAM,kBAAkB,WAAW,GAAG,GAAG,gBAAgB,QAAQ,IAAI,CAAC,CAAC;IAEnI,EAAE,CAAC,SAAS,CAAC,+BAA+B,EAAE,QAAQ,CAAC,CAAC;IACxD,EAAE,CAAC,SAAS,CAAC,gCAAgC,EAAE,WAAW,CAAC,CAAC;IAC5D,EAAE,CAAC,SAAS,CAAC,4BAA4B,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAEtE,OAAO;QACL,KAAK;QACL,IAAI,EAAE,UAAU;QAChB,CAAC;QACD,YAAY;QACZ,kBAAkB;QAClB,WAAW;QACX,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,MAAgD,EAChD,KAAa,EACb,UAA8E,EAAE;IAEhF,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,YAAY,IAAI,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC;IAC9E,MAAM,KAAK,GAAG,IAAI,EAAE,CAAC;IACrB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,OAAO,CAAC,GAAG,CAAC,gDAAgD,CAAC,EAAE,CAAC,CAAC;IAEjE,EAAE,CAAC,aAAa,CAAC;QACf,MAAM,EAAE,KAAK;QACb,OAAO,EAAE,OAAO,CAAC,MAAM,IAAI,YAAY,GAAG,KAAK;QAC/C,IAAI,EAAE,YAAY;QAClB,CAAC,EAAE,CAAC;QACJ,MAAM,EAAE,SAAS;QACjB,OAAO,EAAE,SAAS;KACnB,CAAC,CAAC;IAEH,MAAM,YAAY,GAAgC,EAAE,CAAC;IACrD,IAAI,gBAAgB,GAAU,EAAE,CAAC;IAEjC,uBAAuB;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,qCAAqC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE/D,IAAI,CAAC;YACH,kEAAkE;YAClE,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,KAAK,EAAE;gBAC7C,MAAM,EAAE,OAAO,CAAC,MAAM;aACvB,CAAC,CAAC;YAEH,wBAAwB;YACxB,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,CAAC,GAAG,QAAQ,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC;YACpE,MAAM,OAAO,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YAEzD,YAAY,CAAC,IAAI,CAAC;gBAChB,EAAE,EAAE,IAAI,EAAE;gBACV,OAAO;gBACP,UAAU;aACX,CAAC,CAAC;YAEH,sDAAsD;YACtD,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,0BAA0B,IAAI,IAAI,CAAC,EAAE,CAAC;gBACrF,OAAO,CAAC,GAAG,CAAC,wCAAwC,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;gBAC7E,MAAM;YACR,CAAC;YAED,uCAAuC;YACvC,MAAM,WAAW,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC/E,gBAAgB,GAAG,CAAC,GAAG,gBAAgB,EAAE,GAAG,WAAW,CAAC,CAAC;YAEzD,mBAAmB;YACnB,EAAE,CAAC,eAAe,CAAC;gBACjB,OAAO,EAAE,OAAO,CAAC,MAAM,IAAI,YAAY,GAAG,KAAK;gBAC/C,QAAQ,EAAE,OAAO,CAAC,OAAO,IAAI,aAAa;gBAC1C,KAAK;gBACL,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC;gBAC3C,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACpC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBAClC,WAAW,EAAE,OAAO,CAAC,KAAK;gBAC1B,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC;gBAC9C,YAAY,EAAE,KAAK;aACpB,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,2BAA2B,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;IACzG,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAExC,OAAO,CAAC,GAAG,CAAC,qCAAqC,YAAY,CAAC,MAAM,gBAAgB,WAAW,GAAG,GAAG,gBAAgB,QAAQ,IAAI,CAAC,CAAC;IAEnI,EAAE,CAAC,SAAS,CAAC,iCAAiC,EAAE,QAAQ,CAAC,CAAC;IAC1D,EAAE,CAAC,SAAS,CAAC,kCAAkC,EAAE,WAAW,CAAC,CAAC;IAE9D,OAAO;QACL,KAAK;QACL,IAAI,EAAE,YAAY;QAClB,CAAC,EAAE,CAAC;QACJ,YAAY;QACZ,kBAAkB,EAAE,gBAAgB;QACpC,WAAW;QACX,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,iBAAiB,CAC9B,YAAyC,EACzC,KAAa,EACb,OAAY;IAEZ,OAAO,CAAC,GAAG,CAAC,+CAA+C,CAAC,CAAC;IAE7D,0BAA0B;IAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,sBAAsB,CAAC,CAAC;IACzE,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;IAErE,qCAAqC;IACrC,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAClD,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK;QACtB,UAAU,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU;QAChC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;KACzD,CAAC,CAAC,CAAC;IAEJ,0CAA0C;IAC1C,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,kBAAkB;QAC9B,OAAO,CAAC,GAAG,CAAC,iBAAiB;QAC7B,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC;IAEpD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,6CAA6C,CAAC,CAAC;QAC5D,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ;aACnC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;aAC7C,OAAO,CAAC,gBAAgB,EAAE,KAAK,CAAC;aAChC,OAAO,CAAC,kBAAkB,EAAE,IAAI,CAAC,SAAS,CAAC,eAAe,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAEzE,6CAA6C;QAC7C,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC;YACjC,KAAK,EAAE,cAAc,CAAC,KAAK;YAC3B,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,cAAc,CAAC,MAAM,EAAE;gBAClD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE;aAClC;YACD,WAAW,EAAE,cAAc,CAAC,WAAW;YACvC,SAAS,EAAE,cAAc,CAAC,UAAU;SACrC,EAAE,+BAA+B,CAAC,CAAC;QAEpC,uCAAuC;QACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO;aAC7B,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC;aACtC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aACxB,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,sCAAsC;QACtC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC/C,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC;YAEvC,gCAAgC;YAChC,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE,SAAkB,EAAE,UAAU,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;gBAC5E,MAAM,GAAG,GAAG,MAAM,eAAe,CAC/B,EAAE,KAAK,EAAE,EAAE,EAAE,EACb,OAAO,EACP,KAAK,EACL,OAAO,CACR,CAAC;gBACF,SAAS,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;YACzB,CAAC;YAED,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,KAAK,CAAC,oCAAoC,EAAE,KAAK,CAAC,CAAC;IAC7D,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC","sourcesContent":["/**\n * MaTTS: Memory-aware Test-Time Scaling\n * Algorithm 5 from ReasoningBank paper\n *\n * Two modes:\n * - Parallel: k independent rollouts with self-contrast aggregation\n * - Sequential: r iterative refinements with check-and-correct\n */\n\nimport { readFileSync } from 'fs';\nimport { join, dirname } from 'path';\nimport { fileURLToPath } from 'url';\nimport { ulid } from 'ulid';\nimport { loadConfig } from '../utils/config.js';\nimport { retrieveMemories } from './retrieve.js';\nimport { judgeTrajectory } from './judge.js';\nimport { distillMemories } from './distill.js';\nimport { ModelRouter } from '../../router/router.js';\nimport * as db from '../db/queries.js';\nimport type { Trajectory } from '../db/schema.js';\n\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\n\n// Initialize ModelRouter once\nlet routerInstance: ModelRouter | null = null;\nfunction getRouter(): ModelRouter {\n  if (!routerInstance) {\n    routerInstance = new ModelRouter();\n  }\n  return routerInstance;\n}\n\nexport interface MattsResult {\n  runId: string;\n  mode: 'parallel' | 'sequential';\n  k: number;\n  trajectories: Array<{\n    id: string;\n    verdict: { label: string; confidence: number };\n    trajectory: Trajectory;\n  }>;\n  aggregatedMemories: string[];\n  successRate: number;\n  duration: number;\n}\n\n/**\n * Run MaTTS in parallel mode\n * Execute k independent rollouts and aggregate via self-contrast\n */\nexport async function mattsParallel(\n  taskFn: () => Promise<Trajectory>,\n  query: string,\n  options: { k?: number; taskId?: string; agentId?: string; domain?: string } = {}\n): Promise<MattsResult> {\n  const config = loadConfig();\n  const k = options.k || config.matts.parallel_k;\n  const runId = ulid();\n  const startTime = Date.now();\n\n  console.log(`[INFO] Starting MaTTS parallel mode with k=${k}`);\n\n  // Store MaTTS run\n  db.storeMattsRun({\n    run_id: runId,\n    task_id: options.taskId || 'matts-' + runId,\n    mode: 'parallel',\n    k,\n    status: 'running',\n    summary: undefined\n  });\n\n  const trajectories: MattsResult['trajectories'] = [];\n\n  // Execute k independent rollouts\n  for (let i = 0; i < k; i++) {\n    console.log(`[INFO] MaTTS parallel rollout ${i + 1}/${k}`);\n\n    try {\n      const trajectory = await taskFn();\n      const verdict = await judgeTrajectory(trajectory, query);\n\n      trajectories.push({\n        id: ulid(),\n        verdict,\n        trajectory\n      });\n\n      // Store trajectory\n      db.storeTrajectory({\n        task_id: options.taskId || 'matts-' + runId,\n        agent_id: options.agentId || 'matts-agent',\n        query,\n        trajectory_json: JSON.stringify(trajectory),\n        started_at: new Date().toISOString(),\n        ended_at: new Date().toISOString(),\n        judge_label: verdict.label,\n        judge_conf: verdict.confidence,\n        judge_reasons: JSON.stringify(verdict.reasons),\n        matts_run_id: runId\n      });\n    } catch (error) {\n      console.error(`[ERROR] MaTTS rollout ${i + 1} failed:`, error);\n    }\n  }\n\n  // Aggregate memories via self-contrast\n  const aggregatedMemories = await aggregateMemories(trajectories, query, options);\n\n  const successRate = trajectories.filter(t => t.verdict.label === 'Success').length / trajectories.length;\n  const duration = Date.now() - startTime;\n\n  console.log(`[INFO] MaTTS parallel complete: ${trajectories.length} trajectories, ${successRate * 100}% success in ${duration}ms`);\n\n  db.logMetric('rb.matts.parallel.duration_ms', duration);\n  db.logMetric('rb.matts.parallel.success_rate', successRate);\n  db.logMetric('rb.matts.parallel.memories', aggregatedMemories.length);\n\n  return {\n    runId,\n    mode: 'parallel',\n    k,\n    trajectories,\n    aggregatedMemories,\n    successRate,\n    duration\n  };\n}\n\n/**\n * Run MaTTS in sequential mode\n * Iterative refinement with check-and-correct\n */\nexport async function mattsSequential(\n  taskFn: (memories: any[]) => Promise<Trajectory>,\n  query: string,\n  options: { r?: number; taskId?: string; agentId?: string; domain?: string } = {}\n): Promise<MattsResult> {\n  const config = loadConfig();\n  const r = options.r || config.matts.sequential_r || config.matts.sequential_k;\n  const runId = ulid();\n  const startTime = Date.now();\n\n  console.log(`[INFO] Starting MaTTS sequential mode with r=${r}`);\n\n  db.storeMattsRun({\n    run_id: runId,\n    task_id: options.taskId || 'matts-seq-' + runId,\n    mode: 'sequential',\n    k: r,\n    status: 'running',\n    summary: undefined\n  });\n\n  const trajectories: MattsResult['trajectories'] = [];\n  let previousMemories: any[] = [];\n\n  // Iterative refinement\n  for (let i = 0; i < r; i++) {\n    console.log(`[INFO] MaTTS sequential iteration ${i + 1}/${r}`);\n\n    try {\n      // Retrieve relevant memories (including from previous iterations)\n      const memories = await retrieveMemories(query, {\n        domain: options.domain\n      });\n\n      // Execute with memories\n      const trajectory = await taskFn([...memories, ...previousMemories]);\n      const verdict = await judgeTrajectory(trajectory, query);\n\n      trajectories.push({\n        id: ulid(),\n        verdict,\n        trajectory\n      });\n\n      // If success and stop_on_success is true, break early\n      if (verdict.label === 'Success' && (config.matts.sequential_stop_on_success ?? true)) {\n        console.log(`[INFO] Success achieved at iteration ${i + 1}, stopping early`);\n        break;\n      }\n\n      // Distill memories from this iteration\n      const newMemories = await distillMemories(trajectory, verdict, query, options);\n      previousMemories = [...previousMemories, ...newMemories];\n\n      // Store trajectory\n      db.storeTrajectory({\n        task_id: options.taskId || 'matts-seq-' + runId,\n        agent_id: options.agentId || 'matts-agent',\n        query,\n        trajectory_json: JSON.stringify(trajectory),\n        started_at: new Date().toISOString(),\n        ended_at: new Date().toISOString(),\n        judge_label: verdict.label,\n        judge_conf: verdict.confidence,\n        judge_reasons: JSON.stringify(verdict.reasons),\n        matts_run_id: runId\n      });\n    } catch (error) {\n      console.error(`[ERROR] MaTTS iteration ${i + 1} failed:`, error);\n    }\n  }\n\n  const successRate = trajectories.filter(t => t.verdict.label === 'Success').length / trajectories.length;\n  const duration = Date.now() - startTime;\n\n  console.log(`[INFO] MaTTS sequential complete: ${trajectories.length} iterations, ${successRate * 100}% success in ${duration}ms`);\n\n  db.logMetric('rb.matts.sequential.duration_ms', duration);\n  db.logMetric('rb.matts.sequential.success_rate', successRate);\n\n  return {\n    runId,\n    mode: 'sequential',\n    k: r,\n    trajectories,\n    aggregatedMemories: previousMemories,\n    successRate,\n    duration\n  };\n}\n\n/**\n * Aggregate memories from multiple trajectories using self-contrast\n */\nasync function aggregateMemories(\n  trajectories: MattsResult['trajectories'],\n  query: string,\n  options: any\n): Promise<string[]> {\n  console.log('[INFO] Aggregating memories via self-contrast');\n\n  // Load aggregation prompt\n  const promptPath = join(__dirname, '../prompts', 'matts-aggregate.json');\n  const promptTemplate = JSON.parse(readFileSync(promptPath, 'utf-8'));\n\n  // Format trajectories for comparison\n  const trajectoryTexts = trajectories.map((t, i) => ({\n    id: t.id,\n    label: t.verdict.label,\n    confidence: t.verdict.confidence,\n    steps: JSON.stringify(t.trajectory.steps || [], null, 2)\n  }));\n\n  // Check if we have any API key configured\n  const hasApiKey = process.env.OPENROUTER_API_KEY ||\n                    process.env.ANTHROPIC_API_KEY ||\n                    process.env.GOOGLE_GEMINI_API_KEY;\n\n  if (!hasApiKey) {\n    console.warn('[WARN] No API key set, skipping aggregation');\n    return [];\n  }\n\n  try {\n    const prompt = promptTemplate.template\n      .replace('{{k}}', String(trajectories.length))\n      .replace('{{task_query}}', query)\n      .replace('{{trajectories}}', JSON.stringify(trajectoryTexts, null, 2));\n\n    // Use ModelRouter for multi-provider support\n    const router = getRouter();\n    const response = await router.chat({\n      model: promptTemplate.model,\n      messages: [\n        { role: 'system', content: promptTemplate.system },\n        { role: 'user', content: prompt }\n      ],\n      temperature: promptTemplate.temperature,\n      maxTokens: promptTemplate.max_tokens\n    }, 'reasoningbank-matts-aggregate');\n\n    // Extract content from router response\n    const content = response.content\n      .filter(block => block.type === 'text')\n      .map(block => block.text)\n      .join('\\n');\n\n    // Parse and store aggregated memories\n    const jsonMatch = content.match(/\\{[\\s\\S]*\\}/);\n    if (jsonMatch) {\n      const parsed = JSON.parse(jsonMatch[0]);\n      const memories = parsed.memories || [];\n\n      // Store with boosted confidence\n      const memoryIds: string[] = [];\n      for (const mem of memories) {\n        const verdict = { label: 'Success' as const, confidence: 0.9, reasons: [] };\n        const ids = await distillMemories(\n          { steps: [] },\n          verdict,\n          query,\n          options\n        );\n        memoryIds.push(...ids);\n      }\n\n      return memoryIds;\n    }\n  } catch (error) {\n    console.error('[ERROR] Memory aggregation failed:', error);\n  }\n\n  return [];\n}\n"]}
+{"version":3,"file":"matts.js","sourceRoot":"","sources":["../../../src/reasoningbank/core/matts.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAClC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAC;AACpC,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAGvC,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAClD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;AAEtC,8BAA8B;AAC9B,IAAI,cAAc,GAAuB,IAAI,CAAC;AAC9C,SAAS,SAAS;IAChB,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,IAAI,WAAW,EAAE,CAAC;IACrC,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC;AAgBD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,MAAiC,EACjC,KAAa,EACb,UAA8E,EAAE;IAEhF,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,EAAE,CAAC;IACrB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,OAAO,CAAC,KAAK,CAAC,8CAA8C,CAAC,EAAE,CAAC,CAAC;IAEjE,kBAAkB;IAClB,EAAE,CAAC,aAAa,CAAC;QACf,MAAM,EAAE,KAAK;QACb,OAAO,EAAE,OAAO,CAAC,MAAM,IAAI,QAAQ,GAAG,KAAK;QAC3C,IAAI,EAAE,UAAU;QAChB,CAAC;QACD,MAAM,EAAE,SAAS;QACjB,OAAO,EAAE,SAAS;KACnB,CAAC,CAAC;IAEH,MAAM,YAAY,GAAgC,EAAE,CAAC;IAErD,iCAAiC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,OAAO,CAAC,KAAK,CAAC,iCAAiC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE7D,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,MAAM,MAAM,EAAE,CAAC;YAClC,MAAM,OAAO,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YAEzD,YAAY,CAAC,IAAI,CAAC;gBAChB,EAAE,EAAE,IAAI,EAAE;gBACV,OAAO;gBACP,UAAU;aACX,CAAC,CAAC;YAEH,mBAAmB;YACnB,EAAE,CAAC,eAAe,CAAC;gBACjB,OAAO,EAAE,OAAO,CAAC,MAAM,IAAI,QAAQ,GAAG,KAAK;gBAC3C,QAAQ,EAAE,OAAO,CAAC,OAAO,IAAI,aAAa;gBAC1C,KAAK;gBACL,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC;gBAC3C,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACpC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBAClC,WAAW,EAAE,OAAO,CAAC,KAAK;gBAC1B,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC;gBAC9C,YAAY,EAAE,KAAK;aACpB,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,yBAAyB,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,MAAM,kBAAkB,GAAG,MAAM,iBAAiB,CAAC,YAAY,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAEjF,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;IACzG,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAExC,OAAO,CAAC,KAAK,CAAC,mCAAmC,YAAY,CAAC,MAAM,kBAAkB,WAAW,GAAG,GAAG,gBAAgB,QAAQ,IAAI,CAAC,CAAC;IAErI,EAAE,CAAC,SAAS,CAAC,+BAA+B,EAAE,QAAQ,CAAC,CAAC;IACxD,EAAE,CAAC,SAAS,CAAC,gCAAgC,EAAE,WAAW,CAAC,CAAC;IAC5D,EAAE,CAAC,SAAS,CAAC,4BAA4B,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAEtE,OAAO;QACL,KAAK;QACL,IAAI,EAAE,UAAU;QAChB,CAAC;QACD,YAAY;QACZ,kBAAkB;QAClB,WAAW;QACX,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,MAAgD,EAChD,KAAa,EACb,UAA8E,EAAE;IAEhF,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,YAAY,IAAI,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC;IAC9E,MAAM,KAAK,GAAG,IAAI,EAAE,CAAC;IACrB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,OAAO,CAAC,KAAK,CAAC,gDAAgD,CAAC,EAAE,CAAC,CAAC;IAEnE,EAAE,CAAC,aAAa,CAAC;QACf,MAAM,EAAE,KAAK;QACb,OAAO,EAAE,OAAO,CAAC,MAAM,IAAI,YAAY,GAAG,KAAK;QAC/C,IAAI,EAAE,YAAY;QAClB,CAAC,EAAE,CAAC;QACJ,MAAM,EAAE,SAAS;QACjB,OAAO,EAAE,SAAS;KACnB,CAAC,CAAC;IAEH,MAAM,YAAY,GAAgC,EAAE,CAAC;IACrD,IAAI,gBAAgB,GAAU,EAAE,CAAC;IAEjC,uBAAuB;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,OAAO,CAAC,KAAK,CAAC,qCAAqC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEjE,IAAI,CAAC;YACH,kEAAkE;YAClE,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,KAAK,EAAE;gBAC7C,MAAM,EAAE,OAAO,CAAC,MAAM;aACvB,CAAC,CAAC;YAEH,wBAAwB;YACxB,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,CAAC,GAAG,QAAQ,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC;YACpE,MAAM,OAAO,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YAEzD,YAAY,CAAC,IAAI,CAAC;gBAChB,EAAE,EAAE,IAAI,EAAE;gBACV,OAAO;gBACP,UAAU;aACX,CAAC,CAAC;YAEH,sDAAsD;YACtD,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,0BAA0B,IAAI,IAAI,CAAC,EAAE,CAAC;gBACrF,OAAO,CAAC,KAAK,CAAC,wCAAwC,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;gBAC/E,MAAM;YACR,CAAC;YAED,uCAAuC;YACvC,MAAM,WAAW,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC/E,gBAAgB,GAAG,CAAC,GAAG,gBAAgB,EAAE,GAAG,WAAW,CAAC,CAAC;YAEzD,mBAAmB;YACnB,EAAE,CAAC,eAAe,CAAC;gBACjB,OAAO,EAAE,OAAO,CAAC,MAAM,IAAI,YAAY,GAAG,KAAK;gBAC/C,QAAQ,EAAE,OAAO,CAAC,OAAO,IAAI,aAAa;gBAC1C,KAAK;gBACL,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC;gBAC3C,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACpC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBAClC,WAAW,EAAE,OAAO,CAAC,KAAK;gBAC1B,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC;gBAC9C,YAAY,EAAE,KAAK;aACpB,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,2BAA2B,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;IACzG,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAExC,OAAO,CAAC,KAAK,CAAC,qCAAqC,YAAY,CAAC,MAAM,gBAAgB,WAAW,GAAG,GAAG,gBAAgB,QAAQ,IAAI,CAAC,CAAC;IAErI,EAAE,CAAC,SAAS,CAAC,iCAAiC,EAAE,QAAQ,CAAC,CAAC;IAC1D,EAAE,CAAC,SAAS,CAAC,kCAAkC,EAAE,WAAW,CAAC,CAAC;IAE9D,OAAO;QACL,KAAK;QACL,IAAI,EAAE,YAAY;QAClB,CAAC,EAAE,CAAC;QACJ,YAAY;QACZ,kBAAkB,EAAE,gBAAgB;QACpC,WAAW;QACX,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,iBAAiB,CAC9B,YAAyC,EACzC,KAAa,EACb,OAAY;IAEZ,OAAO,CAAC,KAAK,CAAC,+CAA+C,CAAC,CAAC;IAE/D,0BAA0B;IAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,sBAAsB,CAAC,CAAC;IACzE,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;IAErE,qCAAqC;IACrC,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAClD,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK;QACtB,UAAU,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU;QAChC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;KACzD,CAAC,CAAC,CAAC;IAEJ,0CAA0C;IAC1C,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,kBAAkB;QAC9B,OAAO,CAAC,GAAG,CAAC,iBAAiB;QAC7B,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC;IAEpD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,6CAA6C,CAAC,CAAC;QAC5D,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ;aACnC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;aAC7C,OAAO,CAAC,gBAAgB,EAAE,KAAK,CAAC;aAChC,OAAO,CAAC,kBAAkB,EAAE,IAAI,CAAC,SAAS,CAAC,eAAe,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAEzE,6CAA6C;QAC7C,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC;YACjC,KAAK,EAAE,cAAc,CAAC,KAAK;YAC3B,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,cAAc,CAAC,MAAM,EAAE;gBAClD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE;aAClC;YACD,WAAW,EAAE,cAAc,CAAC,WAAW;YACvC,SAAS,EAAE,cAAc,CAAC,UAAU;SACrC,EAAE,+BAA+B,CAAC,CAAC;QAEpC,uCAAuC;QACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO;aAC7B,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC;aACtC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aACxB,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,sCAAsC;QACtC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC/C,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC;YAEvC,gCAAgC;YAChC,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE,SAAkB,EAAE,UAAU,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;gBAC5E,MAAM,GAAG,GAAG,MAAM,eAAe,CAC/B,EAAE,KAAK,EAAE,EAAE,EAAE,EACb,OAAO,EACP,KAAK,EACL,OAAO,CACR,CAAC;gBACF,SAAS,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;YACzB,CAAC;YAED,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,KAAK,CAAC,oCAAoC,EAAE,KAAK,CAAC,CAAC;IAC7D,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC","sourcesContent":["/**\n * MaTTS: Memory-aware Test-Time Scaling\n * Algorithm 5 from ReasoningBank paper\n *\n * Two modes:\n * - Parallel: k independent rollouts with self-contrast aggregation\n * - Sequential: r iterative refinements with check-and-correct\n */\n\nimport { readFileSync } from 'fs';\nimport { join, dirname } from 'path';\nimport { fileURLToPath } from 'url';\nimport { ulid } from 'ulid';\nimport { loadConfig } from '../utils/config.js';\nimport { retrieveMemories } from './retrieve.js';\nimport { judgeTrajectory } from './judge.js';\nimport { distillMemories } from './distill.js';\nimport { ModelRouter } from '../../router/router.js';\nimport * as db from '../db/queries.js';\nimport type { Trajectory } from '../db/schema.js';\n\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\n\n// Initialize ModelRouter once\nlet routerInstance: ModelRouter | null = null;\nfunction getRouter(): ModelRouter {\n  if (!routerInstance) {\n    routerInstance = new ModelRouter();\n  }\n  return routerInstance;\n}\n\nexport interface MattsResult {\n  runId: string;\n  mode: 'parallel' | 'sequential';\n  k: number;\n  trajectories: Array<{\n    id: string;\n    verdict: { label: string; confidence: number };\n    trajectory: Trajectory;\n  }>;\n  aggregatedMemories: string[];\n  successRate: number;\n  duration: number;\n}\n\n/**\n * Run MaTTS in parallel mode\n * Execute k independent rollouts and aggregate via self-contrast\n */\nexport async function mattsParallel(\n  taskFn: () => Promise<Trajectory>,\n  query: string,\n  options: { k?: number; taskId?: string; agentId?: string; domain?: string } = {}\n): Promise<MattsResult> {\n  const config = loadConfig();\n  const k = options.k || config.matts.parallel_k;\n  const runId = ulid();\n  const startTime = Date.now();\n\n  console.error(`[INFO] Starting MaTTS parallel mode with k=${k}`);\n\n  // Store MaTTS run\n  db.storeMattsRun({\n    run_id: runId,\n    task_id: options.taskId || 'matts-' + runId,\n    mode: 'parallel',\n    k,\n    status: 'running',\n    summary: undefined\n  });\n\n  const trajectories: MattsResult['trajectories'] = [];\n\n  // Execute k independent rollouts\n  for (let i = 0; i < k; i++) {\n    console.error(`[INFO] MaTTS parallel rollout ${i + 1}/${k}`);\n\n    try {\n      const trajectory = await taskFn();\n      const verdict = await judgeTrajectory(trajectory, query);\n\n      trajectories.push({\n        id: ulid(),\n        verdict,\n        trajectory\n      });\n\n      // Store trajectory\n      db.storeTrajectory({\n        task_id: options.taskId || 'matts-' + runId,\n        agent_id: options.agentId || 'matts-agent',\n        query,\n        trajectory_json: JSON.stringify(trajectory),\n        started_at: new Date().toISOString(),\n        ended_at: new Date().toISOString(),\n        judge_label: verdict.label,\n        judge_conf: verdict.confidence,\n        judge_reasons: JSON.stringify(verdict.reasons),\n        matts_run_id: runId\n      });\n    } catch (error) {\n      console.error(`[ERROR] MaTTS rollout ${i + 1} failed:`, error);\n    }\n  }\n\n  // Aggregate memories via self-contrast\n  const aggregatedMemories = await aggregateMemories(trajectories, query, options);\n\n  const successRate = trajectories.filter(t => t.verdict.label === 'Success').length / trajectories.length;\n  const duration = Date.now() - startTime;\n\n  console.error(`[INFO] MaTTS parallel complete: ${trajectories.length} trajectories, ${successRate * 100}% success in ${duration}ms`);\n\n  db.logMetric('rb.matts.parallel.duration_ms', duration);\n  db.logMetric('rb.matts.parallel.success_rate', successRate);\n  db.logMetric('rb.matts.parallel.memories', aggregatedMemories.length);\n\n  return {\n    runId,\n    mode: 'parallel',\n    k,\n    trajectories,\n    aggregatedMemories,\n    successRate,\n    duration\n  };\n}\n\n/**\n * Run MaTTS in sequential mode\n * Iterative refinement with check-and-correct\n */\nexport async function mattsSequential(\n  taskFn: (memories: any[]) => Promise<Trajectory>,\n  query: string,\n  options: { r?: number; taskId?: string; agentId?: string; domain?: string } = {}\n): Promise<MattsResult> {\n  const config = loadConfig();\n  const r = options.r || config.matts.sequential_r || config.matts.sequential_k;\n  const runId = ulid();\n  const startTime = Date.now();\n\n  console.error(`[INFO] Starting MaTTS sequential mode with r=${r}`);\n\n  db.storeMattsRun({\n    run_id: runId,\n    task_id: options.taskId || 'matts-seq-' + runId,\n    mode: 'sequential',\n    k: r,\n    status: 'running',\n    summary: undefined\n  });\n\n  const trajectories: MattsResult['trajectories'] = [];\n  let previousMemories: any[] = [];\n\n  // Iterative refinement\n  for (let i = 0; i < r; i++) {\n    console.error(`[INFO] MaTTS sequential iteration ${i + 1}/${r}`);\n\n    try {\n      // Retrieve relevant memories (including from previous iterations)\n      const memories = await retrieveMemories(query, {\n        domain: options.domain\n      });\n\n      // Execute with memories\n      const trajectory = await taskFn([...memories, ...previousMemories]);\n      const verdict = await judgeTrajectory(trajectory, query);\n\n      trajectories.push({\n        id: ulid(),\n        verdict,\n        trajectory\n      });\n\n      // If success and stop_on_success is true, break early\n      if (verdict.label === 'Success' && (config.matts.sequential_stop_on_success ?? true)) {\n        console.error(`[INFO] Success achieved at iteration ${i + 1}, stopping early`);\n        break;\n      }\n\n      // Distill memories from this iteration\n      const newMemories = await distillMemories(trajectory, verdict, query, options);\n      previousMemories = [...previousMemories, ...newMemories];\n\n      // Store trajectory\n      db.storeTrajectory({\n        task_id: options.taskId || 'matts-seq-' + runId,\n        agent_id: options.agentId || 'matts-agent',\n        query,\n        trajectory_json: JSON.stringify(trajectory),\n        started_at: new Date().toISOString(),\n        ended_at: new Date().toISOString(),\n        judge_label: verdict.label,\n        judge_conf: verdict.confidence,\n        judge_reasons: JSON.stringify(verdict.reasons),\n        matts_run_id: runId\n      });\n    } catch (error) {\n      console.error(`[ERROR] MaTTS iteration ${i + 1} failed:`, error);\n    }\n  }\n\n  const successRate = trajectories.filter(t => t.verdict.label === 'Success').length / trajectories.length;\n  const duration = Date.now() - startTime;\n\n  console.error(`[INFO] MaTTS sequential complete: ${trajectories.length} iterations, ${successRate * 100}% success in ${duration}ms`);\n\n  db.logMetric('rb.matts.sequential.duration_ms', duration);\n  db.logMetric('rb.matts.sequential.success_rate', successRate);\n\n  return {\n    runId,\n    mode: 'sequential',\n    k: r,\n    trajectories,\n    aggregatedMemories: previousMemories,\n    successRate,\n    duration\n  };\n}\n\n/**\n * Aggregate memories from multiple trajectories using self-contrast\n */\nasync function aggregateMemories(\n  trajectories: MattsResult['trajectories'],\n  query: string,\n  options: any\n): Promise<string[]> {\n  console.error('[INFO] Aggregating memories via self-contrast');\n\n  // Load aggregation prompt\n  const promptPath = join(__dirname, '../prompts', 'matts-aggregate.json');\n  const promptTemplate = JSON.parse(readFileSync(promptPath, 'utf-8'));\n\n  // Format trajectories for comparison\n  const trajectoryTexts = trajectories.map((t, i) => ({\n    id: t.id,\n    label: t.verdict.label,\n    confidence: t.verdict.confidence,\n    steps: JSON.stringify(t.trajectory.steps || [], null, 2)\n  }));\n\n  // Check if we have any API key configured\n  const hasApiKey = process.env.OPENROUTER_API_KEY ||\n                    process.env.ANTHROPIC_API_KEY ||\n                    process.env.GOOGLE_GEMINI_API_KEY;\n\n  if (!hasApiKey) {\n    console.warn('[WARN] No API key set, skipping aggregation');\n    return [];\n  }\n\n  try {\n    const prompt = promptTemplate.template\n      .replace('{{k}}', String(trajectories.length))\n      .replace('{{task_query}}', query)\n      .replace('{{trajectories}}', JSON.stringify(trajectoryTexts, null, 2));\n\n    // Use ModelRouter for multi-provider support\n    const router = getRouter();\n    const response = await router.chat({\n      model: promptTemplate.model,\n      messages: [\n        { role: 'system', content: promptTemplate.system },\n        { role: 'user', content: prompt }\n      ],\n      temperature: promptTemplate.temperature,\n      maxTokens: promptTemplate.max_tokens\n    }, 'reasoningbank-matts-aggregate');\n\n    // Extract content from router response\n    const content = response.content\n      .filter(block => block.type === 'text')\n      .map(block => block.text)\n      .join('\\n');\n\n    // Parse and store aggregated memories\n    const jsonMatch = content.match(/\\{[\\s\\S]*\\}/);\n    if (jsonMatch) {\n      const parsed = JSON.parse(jsonMatch[0]);\n      const memories = parsed.memories || [];\n\n      // Store with boosted confidence\n      const memoryIds: string[] = [];\n      for (const mem of memories) {\n        const verdict = { label: 'Success' as const, confidence: 0.9, reasons: [] };\n        const ids = await distillMemories(\n          { steps: [] },\n          verdict,\n          query,\n          options\n        );\n        memoryIds.push(...ids);\n      }\n\n      return memoryIds;\n    }\n  } catch (error) {\n    console.error('[ERROR] Memory aggregation failed:', error);\n  }\n\n  return [];\n}\n"]}