agentic-flow 1.4.5 → 1.4.7

package/dist/reasoningbank/core/matts.js

@@ -0,0 +1,225 @@
+/**
+ * MaTTS: Memory-aware Test-Time Scaling
+ * Algorithm 5 from ReasoningBank paper
+ *
+ * Two modes:
+ * - Parallel: k independent rollouts with self-contrast aggregation
+ * - Sequential: r iterative refinements with check-and-correct
+ */
+import { readFileSync } from 'fs';
+import { join } from 'path';
+import { ulid } from 'ulid';
+import { loadConfig } from '../utils/config.js';
+import { retrieveMemories } from './retrieve.js';
+import { judgeTrajectory } from './judge.js';
+import { distillMemories } from './distill.js';
+import * as db from '../db/queries.js';
+/**
+ * Run MaTTS in parallel mode
+ * Execute k independent rollouts and aggregate via self-contrast
+ */
+export async function mattsParallel(taskFn, query, options = {}) {
+    const config = loadConfig();
+    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}`);
+    // Store MaTTS run
+    db.storeMattsRun({
+        run_id: runId,
+        task_id: options.taskId || 'matts-' + runId,
+        mode: 'parallel',
+        k,
+        status: 'running',
+        summary: undefined
+    });
+    const trajectories = [];
+    // Execute k independent rollouts
+    for (let i = 0; i < k; i++) {
+        console.log(`[INFO] MaTTS parallel rollout ${i + 1}/${k}`);
+        try {
+            const trajectory = await taskFn();
+            const verdict = await judgeTrajectory(trajectory, query);
+            trajectories.push({
+                id: ulid(),
+                verdict,
+                trajectory
+            });
+            // Store trajectory
+            db.storeTrajectory({
+                task_id: options.taskId || 'matts-' + runId,
+                agent_id: options.agentId || 'matts-agent',
+                query,
+                trajectory_json: JSON.stringify(trajectory),
+                started_at: new Date().toISOString(),
+                ended_at: new Date().toISOString(),
+                judge_label: verdict.label,
+                judge_conf: verdict.confidence,
+                judge_reasons: JSON.stringify(verdict.reasons),
+                matts_run_id: runId
+            });
+        }
+        catch (error) {
+            console.error(`[ERROR] MaTTS rollout ${i + 1} failed:`, error);
+        }
+    }
+    // Aggregate memories via self-contrast
+    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`);
+    db.logMetric('rb.matts.parallel.duration_ms', duration);
+    db.logMetric('rb.matts.parallel.success_rate', successRate);
+    db.logMetric('rb.matts.parallel.memories', aggregatedMemories.length);
+    return {
+        runId,
+        mode: 'parallel',
+        k,
+        trajectories,
+        aggregatedMemories,
+        successRate,
+        duration
+    };
+}
+/**
+ * Run MaTTS in sequential mode
+ * Iterative refinement with check-and-correct
+ */
+export async function mattsSequential(taskFn, query, options = {}) {
+    const config = loadConfig();
+    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}`);
+    db.storeMattsRun({
+        run_id: runId,
+        task_id: options.taskId || 'matts-seq-' + runId,
+        mode: 'sequential',
+        k: r,
+        status: 'running',
+        summary: undefined
+    });
+    const trajectories = [];
+    let previousMemories = [];
+    // Iterative refinement
+    for (let i = 0; i < r; i++) {
+        console.log(`[INFO] MaTTS sequential iteration ${i + 1}/${r}`);
+        try {
+            // Retrieve relevant memories (including from previous iterations)
+            const memories = await retrieveMemories(query, {
+                domain: options.domain
+            });
+            // Execute with memories
+            const trajectory = await taskFn([...memories, ...previousMemories]);
+            const verdict = await judgeTrajectory(trajectory, query);
+            trajectories.push({
+                id: ulid(),
+                verdict,
+                trajectory
+            });
+            // 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`);
+                break;
+            }
+            // Distill memories from this iteration
+            const newMemories = await distillMemories(trajectory, verdict, query, options);
+            previousMemories = [...previousMemories, ...newMemories];
+            // Store trajectory
+            db.storeTrajectory({
+                task_id: options.taskId || 'matts-seq-' + runId,
+                agent_id: options.agentId || 'matts-agent',
+                query,
+                trajectory_json: JSON.stringify(trajectory),
+                started_at: new Date().toISOString(),
+                ended_at: new Date().toISOString(),
+                judge_label: verdict.label,
+                judge_conf: verdict.confidence,
+                judge_reasons: JSON.stringify(verdict.reasons),
+                matts_run_id: runId
+            });
+        }
+        catch (error) {
+            console.error(`[ERROR] MaTTS iteration ${i + 1} failed:`, error);
+        }
+    }
+    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`);
+    db.logMetric('rb.matts.sequential.duration_ms', duration);
+    db.logMetric('rb.matts.sequential.success_rate', successRate);
+    return {
+        runId,
+        mode: 'sequential',
+        k: r,
+        trajectories,
+        aggregatedMemories: previousMemories,
+        successRate,
+        duration
+    };
+}
+/**
+ * Aggregate memories from multiple trajectories using self-contrast
+ */
+async function aggregateMemories(trajectories, query, options) {
+    console.log('[INFO] Aggregating memories via self-contrast');
+    // Load aggregation prompt
+    const promptPath = join(process.cwd(), 'src', 'reasoningbank', 'prompts', 'matts-aggregate.json');
+    const promptTemplate = JSON.parse(readFileSync(promptPath, 'utf-8'));
+    // Format trajectories for comparison
+    const trajectoryTexts = trajectories.map((t, i) => ({
+        id: t.id,
+        label: t.verdict.label,
+        confidence: t.verdict.confidence,
+        steps: JSON.stringify(t.trajectory.steps || [], null, 2)
+    }));
+    const apiKey = process.env.ANTHROPIC_API_KEY;
+    if (!apiKey) {
+        console.warn('[WARN] No API key, skipping aggregation');
+        return [];
+    }
+    try {
+        const prompt = promptTemplate.template
+            .replace('{{k}}', String(trajectories.length))
+            .replace('{{task_query}}', query)
+            .replace('{{trajectories}}', JSON.stringify(trajectoryTexts, null, 2));
+        const response = await fetch('https://api.anthropic.com/v1/messages', {
+            method: 'POST',
+            headers: {
+                'x-api-key': apiKey,
+                'anthropic-version': '2023-06-01',
+                'content-type': 'application/json'
+            },
+            body: JSON.stringify({
+                model: promptTemplate.model,
+                max_tokens: promptTemplate.max_tokens,
+                temperature: promptTemplate.temperature,
+                system: promptTemplate.system,
+                messages: [{ role: 'user', content: prompt }]
+            })
+        });
+        if (!response.ok) {
+            throw new Error(`Anthropic API error: ${response.status}`);
+        }
+        const result = await response.json();
+        const content = result.content[0].text;
+        // Parse and store aggregated memories
+        const jsonMatch = content.match(/\{[\s\S]*\}/);
+        if (jsonMatch) {
+            const parsed = JSON.parse(jsonMatch[0]);
+            const memories = parsed.memories || [];
+            // Store with boosted confidence
+            const memoryIds = [];
+            for (const mem of memories) {
+                const verdict = { label: 'Success', confidence: 0.9, reasons: [] };
+                const ids = await distillMemories({ steps: [] }, verdict, query, options);
+                memoryIds.push(...ids);
+            }
+            return memoryIds;
+        }
+    }
+    catch (error) {
+        console.error('[ERROR] Memory aggregation failed:', error);
+    }
+    return [];
+}

package/dist/reasoningbank/core/memory-engine.js

@@ -0,0 +1,335 @@
+/**
+ * ReasoningBank Memory Engine
+ * Implements the 4-phase learning loop: RETRIEVE → JUDGE → DISTILL → CONSOLIDATE
+ */
+import { ReasoningBankDB } from './database.js';
+import { createEmbeddingProvider, cosineSimilarity } from '../utils/embeddings.js';
+import { piiScrubber } from '../utils/pii-scrubber.js';
+export class ReasoningBankEngine {
+    db;
+    embeddings;
+    piiEnabled;
+    weights;
+    defaultK;
+    minConfidence;
+    consolidationThreshold;
+    memoriesSinceConsolidation = 0;
+    constructor(config) {
+        this.db = new ReasoningBankDB(config.dbPath);
+        this.embeddings = createEmbeddingProvider(config.embeddings?.provider || 'hash', {
+            apiKey: process.env.OPENAI_API_KEY || process.env.ANTHROPIC_API_KEY,
+            model: config.embeddings?.model
+        });
+        this.piiEnabled = config.piiScrub?.enabled !== false;
+        this.weights = {
+            alpha: config.retrieval?.weights?.alpha || 0.65, // Similarity
+            beta: config.retrieval?.weights?.beta || 0.15, // Recency
+            gamma: config.retrieval?.weights?.gamma || 0.20, // Reliability
+            delta: config.retrieval?.weights?.delta || 0.10 // Diversity penalty
+        };
+        this.defaultK = config.retrieval?.k || 3;
+        this.minConfidence = config.retrieval?.minConfidence || 0.3;
+        this.consolidationThreshold = config.consolidation?.scheduleEvery || 20;
+    }
+    /**
+     * Phase 1: RETRIEVE - Get relevant memories using 4-factor scoring
+     */
+    async retrieve(options) {
+        const k = options.k || this.defaultK;
+        const lambda = options.lambda || 0.9;
+        // Generate query embedding
+        const queryEmbedding = await this.embeddings.generate(options.query);
+        // Get all memories
+        const allMemories = this.db.getAllMemories();
+        const embeddings = this.db.getAllEmbeddings();
+        // Filter by domain if specified
+        let candidates = allMemories;
+        if (options.domain) {
+            candidates = candidates.filter(m => m.pattern_data.domain === options.domain ||
+                m.pattern_data.domain?.startsWith(options.domain + '.'));
+        }
+        // Calculate scores for each candidate
+        const scoredCandidates = [];
+        for (const memory of candidates) {
+            const embedding = embeddings.get(memory.id);
+            if (!embedding)
+                continue;
+            // 1. Similarity score (cosine similarity)
+            const similarity = cosineSimilarity(queryEmbedding, embedding);
+            // 2. Recency score (exponential decay, 30-day half-life)
+            const ageDays = (Date.now() - new Date(memory.created_at).getTime()) / (1000 * 60 * 60 * 24);
+            const recency = Math.exp(-ageDays / 30);
+            // 3. Reliability score (confidence × sqrt(usage/10))
+            const reliability = Math.min(memory.confidence * Math.sqrt(memory.usage_count / 10), 1.0);
+            // Combined score (before diversity penalty)
+            const score = this.weights.alpha * similarity +
+                this.weights.beta * recency +
+                this.weights.gamma * reliability;
+            scoredCandidates.push({
+                ...memory,
+                score,
+                similarity,
+                recency,
+                reliability,
+                diversityPenalty: 0 // Will be calculated in MMR
+            });
+        }
+        // Sort by score
+        scoredCandidates.sort((a, b) => b.score - a.score);
+        // Apply MMR for diversity
+        const selected = this.selectWithMMR(scoredCandidates, queryEmbedding, k, lambda);
+        // Update usage counts
+        for (const memory of selected) {
+            this.db.updateMemoryUsage(memory.id);
+        }
+        // Filter by minimum confidence
+        return selected.filter(m => m.confidence >= this.minConfidence);
+    }
+    /**
+     * MMR (Maximal Marginal Relevance) Selection
+     * Balances relevance and diversity
+     */
+    selectWithMMR(candidates, queryEmbedding, k, lambda) {
+        const selected = [];
+        const remaining = [...candidates];
+        const embeddings = this.db.getAllEmbeddings();
+        while (selected.length < k && remaining.length > 0) {
+            let bestScore = -Infinity;
+            let bestIndex = -1;
+            for (let i = 0; i < remaining.length; i++) {
+                const candidate = remaining[i];
+                const candidateEmbedding = embeddings.get(candidate.id);
+                if (!candidateEmbedding)
+                    continue;
+                // Relevance to query
+                const relevance = candidate.score;
+                // Maximum similarity to already selected
+                let maxSimilarity = 0;
+                if (selected.length > 0) {
+                    for (const selectedMemory of selected) {
+                        const selectedEmbedding = embeddings.get(selectedMemory.id);
+                        if (selectedEmbedding) {
+                            const sim = cosineSimilarity(candidateEmbedding, selectedEmbedding);
+                            maxSimilarity = Math.max(maxSimilarity, sim);
+                        }
+                    }
+                }
+                // MMR score
+                const mmrScore = lambda * relevance - (1 - lambda) * maxSimilarity;
+                if (mmrScore > bestScore) {
+                    bestScore = mmrScore;
+                    bestIndex = i;
+                }
+            }
+            if (bestIndex >= 0) {
+                selected.push(remaining[bestIndex]);
+                remaining.splice(bestIndex, 1);
+            }
+            else {
+                break;
+            }
+        }
+        return selected;
+    }
+    /**
+     * Phase 2: JUDGE - Evaluate task outcome
+     */
+    async judge(trajectory) {
+        // Simple heuristic judge (can be upgraded to LLM)
+        const scrubbed = this.piiEnabled ? piiScrubber.scrub(trajectory) : trajectory;
+        // Heuristics for success/failure
+        const errorKeywords = ['error', 'failed', 'exception', 'timeout', 'unauthorized', 'forbidden'];
+        const successKeywords = ['success', 'completed', 'ok', '200', 'done'];
+        const lowerTrajectory = scrubbed.toLowerCase();
+        const hasError = errorKeywords.some(kw => lowerTrajectory.includes(kw));
+        const hasSuccess = successKeywords.some(kw => lowerTrajectory.includes(kw));
+        if (hasSuccess && !hasError) {
+            return { label: 'Success', confidence: 0.8, rationale: 'Success keywords found' };
+        }
+        else if (hasError && !hasSuccess) {
+            return { label: 'Failure', confidence: 0.8, rationale: 'Error keywords found' };
+        }
+        else if (hasSuccess && hasError) {
+            return { label: 'Success', confidence: 0.5, rationale: 'Mixed signals' };
+        }
+        else {
+            return { label: 'Failure', confidence: 0.5, rationale: 'No clear indicators' };
+        }
+    }
+    /**
+     * Phase 3: DISTILL - Extract patterns from trajectory
+     */
+    async distill(taskId, trajectory, verdict, domain) {
+        const scrubbed = this.piiEnabled ? piiScrubber.scrub(trajectory) : trajectory;
+        // Store trajectory
+        this.db.insertTrajectory({
+            task_id: taskId,
+            trajectory: scrubbed,
+            verdict: verdict.label,
+            confidence: verdict.confidence
+        });
+        // Extract pattern based on verdict
+        const pattern = verdict.label === 'Success'
+            ? this.extractSuccessPattern(scrubbed, domain)
+            : this.extractFailureGuardrail(scrubbed, domain);
+        // Store as memory
+        const memoryId = this.db.insertMemory({
+            title: pattern.title,
+            description: pattern.description,
+            content: pattern.content,
+            confidence: verdict.confidence,
+            usage_count: 0,
+            pattern_data: {
+                domain,
+                success_pattern: verdict.label === 'Success',
+                failure_guardrail: verdict.label === 'Failure'
+            }
+        });
+        // Generate and store embedding
+        const embedding = await this.embeddings.generate(pattern.content);
+        this.db.insertEmbedding(memoryId, embedding);
+        this.memoriesSinceConsolidation++;
+        return memoryId;
+    }
+    extractSuccessPattern(trajectory, domain) {
+        // Extract key steps from successful execution
+        const lines = trajectory.split('\n').filter(l => l.trim());
+        const keySteps = lines.slice(0, 5).join('\n');
+        return {
+            title: `Success pattern for ${domain}`,
+            description: `Successful execution strategy`,
+            content: `Successful approach:\n${keySteps}`
+        };
+    }
+    extractFailureGuardrail(trajectory, domain) {
+        // Extract error information
+        const lines = trajectory.split('\n').filter(l => l.trim());
+        const errorInfo = lines.find(l => l.toLowerCase().includes('error') ||
+            l.toLowerCase().includes('failed')) || 'Unknown error';
+        return {
+            title: `Failure guardrail for ${domain}`,
+            description: `Prevention strategy for common failures`,
+            content: `Avoid: ${errorInfo}\nRecommend: Check prerequisites and retry with backoff`
+        };
+    }
+    /**
+     * Phase 4: CONSOLIDATE - Deduplicate and prune
+     */
+    async consolidate(options) {
+        const startTime = Date.now();
+        const dedupeThreshold = options?.dedupeThreshold || 0.95;
+        const maxAgeDays = options?.prune?.maxAgeDays || 90;
+        const minConfidence = options?.prune?.minConfidence || 0.3;
+        const unusedDays = options?.prune?.unusedDays || 30;
+        // Find and merge duplicates
+        const duplicates = this.db.findDuplicates(dedupeThreshold);
+        for (const [id1, id2] of duplicates) {
+            const mem1 = this.db.getMemory(id1);
+            const mem2 = this.db.getMemory(id2);
+            if (mem1 && mem2) {
+                // Keep the one with higher confidence and usage
+                const keepId = mem1.confidence > mem2.confidence ||
+                    (mem1.confidence === mem2.confidence && mem1.usage_count > mem2.usage_count)
+                    ? id1 : id2;
+                const deleteId = keepId === id1 ? id2 : id1;
+                this.db.deleteMemory(deleteId);
+            }
+        }
+        // Prune old or low-quality memories
+        const allMemories = this.db.getAllMemories();
+        let pruned = 0;
+        for (const memory of allMemories) {
+            const ageDays = (Date.now() - new Date(memory.created_at).getTime()) / (1000 * 60 * 60 * 24);
+            const lastUsedDays = ageDays; // Simplified: assume last used = created
+            const shouldPrune = ageDays > maxAgeDays ||
+                memory.confidence < minConfidence ||
+                (memory.usage_count === 0 && lastUsedDays > unusedDays);
+            if (shouldPrune) {
+                this.db.deleteMemory(memory.id);
+                pruned++;
+            }
+        }
+        // Detect contradictions (simplified)
+        const contradictions = 0; // TODO: Implement semantic contradiction detection
+        this.memoriesSinceConsolidation = 0;
+        return {
+            processed: allMemories.length,
+            duplicates: duplicates.length,
+            contradictions,
+            pruned,
+            durationMs: Date.now() - startTime
+        };
+    }
+    /**
+     * High-level task execution with full learning loop
+     */
+    async runTask(options) {
+        // Phase 1: RETRIEVE
+        const memories = await this.retrieve({
+            query: options.query,
+            domain: options.domain
+        });
+        // EXECUTE
+        const result = await options.executeFn(memories);
+        // Phase 2: JUDGE
+        const verdict = await this.judge(result.log);
+        // Phase 3: DISTILL
+        await this.distill(options.taskId, result.log, verdict, options.domain);
+        // Phase 4: CONSOLIDATE (if threshold reached)
+        if (this.memoriesSinceConsolidation >= this.consolidationThreshold) {
+            await this.consolidate();
+        }
+        return {
+            success: result.success,
+            summary: `Task ${options.taskId}: ${verdict.label} (confidence: ${verdict.confidence})`,
+            memories,
+            verdict
+        };
+    }
+    /**
+     * MaTTS: Memory-aware Test-Time Scaling (Parallel)
+     */
+    async mattsParallel(options) {
+        const runs = await Promise.all(Array.from({ length: options.k }, async (_, i) => {
+            const memories = await this.retrieve({
+                query: options.query,
+                domain: options.domain
+            });
+            const result = await options.executeFn(memories);
+            const verdict = await this.judge(result.log);
+            this.db.insertMattsRun({
+                task_id: options.taskId,
+                run_index: i,
+                result: result.log,
+                verdict: verdict.label,
+                confidence: verdict.confidence
+            });
+            return { result, verdict };
+        }));
+        // Calculate consensus
+        const successes = runs.filter(r => r.verdict.label === 'Success').length;
+        const avgConfidence = runs.reduce((sum, r) => sum + r.verdict.confidence, 0) / runs.length;
+        const consensusVerdict = {
+            label: successes > runs.length / 2 ? 'Success' : 'Failure',
+            confidence: avgConfidence
+        };
+        return {
+            success: consensusVerdict.label === 'Success',
+            summary: `MaTTS Parallel: ${successes}/${runs.length} successes, consensus: ${consensusVerdict.label}`,
+            memories: [],
+            verdict: consensusVerdict
+        };
+    }
+    /**
+     * Get statistics
+     */
+    getStats() {
+        return this.db.getStats();
+    }
+    /**
+     * Close database connection
+     */
+    close() {
+        this.db.close();
+    }
+}

package/dist/reasoningbank/core/retrieve.js

@@ -0,0 +1,86 @@
+/**
+ * Memory Retrieval with MMR diversity
+ * Algorithm 1 from ReasoningBank paper
+ */
+import { computeEmbedding } from '../utils/embeddings.js';
+import { mmrSelection, cosineSimilarity } from '../utils/mmr.js';
+import * as db from '../db/queries.js';
+import { loadConfig } from '../utils/config.js';
+/**
+ * Retrieve top-k memories with MMR diversity
+ *
+ * Scoring formula: score = α·sim + β·recency + γ·reliability
+ * Where:
+ * - sim: cosine similarity to query
+ * - recency: exp(-age_days / half_life)
+ * - reliability: min(confidence, 1.0)
+ */
+export async function retrieveMemories(query, options = {}) {
+    const config = loadConfig();
+    const k = options.k || config.retrieve.k;
+    const startTime = Date.now();
+    console.log(`[INFO] Retrieving memories for query: ${query.substring(0, 100)}...`);
+    // 1. Embed query
+    const queryEmbed = await computeEmbedding(query);
+    // 2. Fetch candidates from database
+    const candidates = db.fetchMemoryCandidates({
+        domain: options.domain,
+        agent: options.agent,
+        minConfidence: config.retrieve.min_score
+    });
+    if (candidates.length === 0) {
+        console.log('[INFO] No memory candidates found');
+        return [];
+    }
+    console.log(`[INFO] Found ${candidates.length} candidates`);
+    // 3. Score each candidate with 4-factor model
+    const scored = candidates.map(item => {
+        const similarity = cosineSimilarity(queryEmbed, item.embedding);
+        const recency = Math.exp(-item.age_days / config.retrieve.recency_half_life_days);
+        const reliability = Math.min(item.confidence, 1.0);
+        const baseScore = config.retrieve.alpha * similarity +
+            config.retrieve.beta * recency +
+            config.retrieve.gamma * reliability;
+        return {
+            ...item,
+            score: baseScore,
+            components: { similarity, recency, reliability }
+        };
+    });
+    // 4. MMR selection for diversity
+    const selected = mmrSelection(scored, queryEmbed, k, config.retrieve.delta);
+    // 5. Record usage for selected memories
+    for (const mem of selected) {
+        db.incrementUsage(mem.id);
+    }
+    const duration = Date.now() - startTime;
+    console.log(`[INFO] Retrieval complete: ${selected.length} memories in ${duration}ms`);
+    db.logMetric('rb.retrieve.latency_ms', duration);
+    return selected.map(item => ({
+        id: item.id,
+        title: item.pattern_data.title,
+        description: item.pattern_data.description,
+        content: item.pattern_data.content,
+        score: item.score,
+        components: item.components
+    }));
+}
+/**
+ * Format memories for injection into system prompt
+ */
+export function formatMemoriesForPrompt(memories) {
+    if (memories.length === 0) {
+        return '';
+    }
+    let formatted = '\n## Relevant Memories from Past Experience\n\n';
+    for (let i = 0; i < memories.length; i++) {
+        const mem = memories[i];
+        formatted += `### Memory ${i + 1}: ${mem.title}\n\n`;
+        formatted += `${mem.description}\n\n`;
+        formatted += `**Strategy:**\n${mem.content}\n\n`;
+        formatted += `*Confidence: ${(mem.score * 100).toFixed(1)}% | `;
+        formatted += `Similarity: ${(mem.components.similarity * 100).toFixed(1)}%*\n\n`;
+        formatted += '---\n\n';
+    }
+    return formatted;
+}