@cleocode/core 2026.4.42 → 2026.4.44

package/dist/memory/brain-retrieval.js

@@ -1,1044 +0,0 @@
-/**
- * BRAIN Retrieval Operations — 3-layer pattern (search -> timeline -> fetch).
- *
- * Provides token-efficient memory access modeled after claude-mem's
- * search/timeline/get_observations workflow:
- *
- * 1. searchBrainCompact — lightweight index (IDs + titles, ~50 tokens/hit)
- * 2. timelineBrain      — chronological context around an anchor entry
- * 3. fetchBrainEntries  — full details for a filtered set of IDs
- * 4. observeBrain       — unified save (observations table)
- *
- * Wave 2A provides the core implementations; Wave 2B wires them through
- * the dispatch layer (engine-compat -> domain handler -> CLI gateway).
- *
- * @task T5131 T5132 T5133 T5134 T5135
- * @epic T5149
- */
-import { createHash } from 'node:crypto';
-import { memoryFindHitNext } from '../mvi-helpers.js';
-import { getBrainAccessor } from '../store/brain-accessor.js';
-import { sessionExistsInTasksDb } from '../store/cross-db-cleanup.js';
-import { getDb } from '../store/sqlite.js';
-import { typedAll } from '../store/typed-query.js';
-import { embedText, isEmbeddingAvailable } from './brain-embedding.js';
-import { hybridSearch, searchBrain } from './brain-search.js';
-import { searchSimilar } from './brain-similarity.js';
-import { addGraphEdge, upsertGraphNode } from './graph-auto-populate.js';
-import { computeObservationQuality } from './quality-scoring.js';
-// ============================================================================
-// Layer 1: Compact Search
-// ============================================================================
-/**
- * Token-efficient compact search across BRAIN tables.
- * Returns index-level hits (~50 tokens per result).
- *
- * Delegates to searchBrain() from brain-search.ts for FTS5/LIKE search,
- * then projects results to a compact format with optional date filtering.
- *
- * @param projectRoot - Project root directory
- * @param params - Search parameters
- * @returns Compact search results with token estimate
- */
-export async function searchBrainCompact(projectRoot, params) {
-    const { query, limit, tables, dateStart, dateEnd, agent, useRRF = true } = params;
-    if (!query?.trim()) {
-        return { results: [], total: 0, tokensEstimated: 0 };
-    }
-    const effectiveLimit = limit ?? 10;
-    // T418: agent filter always forces FTS-only on observations table
-    const agentFilter = agent !== undefined && agent !== null;
-    // ----- RRF path (default) -----
-    if (useRRF && !agentFilter) {
-        // Run FTS (for dates + table-level data) and RRF fusion in parallel.
-        // FTS gives us row-level dates; RRF gives us the fused ranking order.
-        const [ftsResult, rrfResults] = await Promise.all([
-            searchBrain(projectRoot, query, { limit: effectiveLimit * 3, tables }).catch(() => ({
-                decisions: [],
-                patterns: [],
-                learnings: [],
-                observations: [],
-            })),
-            hybridSearch(query, projectRoot, { limit: effectiveLimit * 2 }),
-        ]);
-        // Build a date map from FTS rows (id -> date string)
-        const dateMap = new Map();
-        for (const d of ftsResult.decisions) {
-            const raw = d;
-            dateMap.set(d.id, (d.createdAt ?? raw['created_at']) || '');
-        }
-        for (const p of ftsResult.patterns) {
-            const raw = p;
-            dateMap.set(p.id, (p.extractedAt ?? raw['extracted_at']) || '');
-        }
-        for (const l of ftsResult.learnings) {
-            const raw = l;
-            dateMap.set(l.id, (l.createdAt ?? raw['created_at']) || '');
-        }
-        for (const o of ftsResult.observations) {
-            const raw = o;
-            dateMap.set(o.id, (o.createdAt ?? raw['created_at']) || '');
-        }
-        // Apply table filter when specified (map singular type names to plural table names)
-        const singularToTable = {
-            decision: 'decisions',
-            pattern: 'patterns',
-            learning: 'learnings',
-            observation: 'observations',
-        };
-        let results = rrfResults
-            .map((r) => ({
-            id: r.id,
-            type: r.type,
-            title: r.title.slice(0, 80),
-            date: dateMap.get(r.id) ?? '',
-            relevance: r.score,
-        }))
-            .filter((r) => {
-            // Only include items that the FTS scan returned (ensures quality gating is respected)
-            return dateMap.has(r.id);
-        });
-        if (tables && tables.length > 0) {
-            results = results.filter((r) => tables.includes(singularToTable[r.type]));
-        }
-        // Apply date filters client-side
-        if (dateStart)
-            results = results.filter((r) => !r.date || r.date >= dateStart);
-        if (dateEnd)
-            results = results.filter((r) => !r.date || r.date <= dateEnd);
-        results = results.slice(0, effectiveLimit);
-        for (const hit of results) {
-            hit._next = memoryFindHitNext(hit.id);
-        }
-        if (results.length > 0) {
-            const returnedIds = results.map((r) => r.id);
-            setImmediate(() => {
-                incrementCitationCounts(projectRoot, returnedIds).catch(() => { });
-                logRetrieval(projectRoot, query, returnedIds, 'find-rrf', results.length * 50).catch(() => { });
-            });
-        }
-        return { results, total: results.length, tokensEstimated: results.length * 50 };
-    }
-    // ----- FTS-only path (useRRF=false or agent filter) -----
-    const effectiveTables = agentFilter
-        ? ['observations']
-        : tables;
-    const searchResult = await searchBrain(projectRoot, query, {
-        limit: effectiveLimit,
-        tables: effectiveTables,
-    });
-    // Project full results to compact format.
-    // Note: searchBrain() returns rows from raw SQL (nativeDb) which use
-    // snake_case column names, but the TypeScript types are camelCase.
-    // We handle both naming conventions for robustness.
-    let results = [];
-    if (!agentFilter) {
-        for (const d of searchResult.decisions) {
-            const raw = d;
-            results.push({
-                id: d.id,
-                type: 'decision',
-                title: d.decision.slice(0, 80),
-                date: (d.createdAt ?? raw['created_at']) || '',
-            });
-        }
-        for (const p of searchResult.patterns) {
-            const raw = p;
-            results.push({
-                id: p.id,
-                type: 'pattern',
-                title: p.pattern.slice(0, 80),
-                date: (p.extractedAt ?? raw['extracted_at']) || '',
-            });
-        }
-        for (const l of searchResult.learnings) {
-            const raw = l;
-            results.push({
-                id: l.id,
-                type: 'learning',
-                title: l.insight.slice(0, 80),
-                date: (l.createdAt ?? raw['created_at']) || '',
-            });
-        }
-    }
-    for (const o of searchResult.observations) {
-        const raw = o;
-        // T418: apply agent post-filter when specified
-        if (agentFilter) {
-            const rowAgent = o.agent ?? raw['agent'] ?? null;
-            if (rowAgent !== agent)
-                continue;
-        }
-        results.push({
-            id: o.id,
-            type: 'observation',
-            title: o.title.slice(0, 80),
-            date: (o.createdAt ?? raw['created_at']) || '',
-        });
-    }
-    // Apply date filters client-side if provided
-    if (dateStart)
-        results = results.filter((r) => r.date >= dateStart);
-    if (dateEnd)
-        results = results.filter((r) => r.date <= dateEnd);
-    // Enrich each hit with _next progressive disclosure directives
-    for (const hit of results) {
-        hit._next = memoryFindHitNext(hit.id);
-    }
-    // Citation tracking + retrieval logging (non-blocking)
-    if (results.length > 0) {
-        const returnedIds = results.map((r) => r.id);
-        setImmediate(() => {
-            incrementCitationCounts(projectRoot, returnedIds).catch(() => { });
-            logRetrieval(projectRoot, query, returnedIds, 'find', results.length * 50).catch(() => { });
-        });
-    }
-    return {
-        results,
-        total: results.length,
-        tokensEstimated: results.length * 50,
-    };
-}
-// ============================================================================
-// Layer 2: Timeline
-// ============================================================================
-/**
- * Determine the entry type from its ID prefix.
- *
- * Conventions:
- * - D... -> decision (D001, D-xxx)
- * - P... -> pattern  (P001, P-xxx)
- * - L... -> learning (L001, L-xxx)
- * - O... or CM-... -> observation (O-xxx, CM-xxx)
- */
-function parseIdPrefix(id) {
-    if (id.startsWith('D-') || /^D\d/.test(id))
-        return 'decision';
-    if (id.startsWith('P-') || /^P\d/.test(id))
-        return 'pattern';
-    if (id.startsWith('L-') || /^L\d/.test(id))
-        return 'learning';
-    if (id.startsWith('O-') || id.startsWith('O') || id.startsWith('CM-'))
-        return 'observation';
-    return null;
-}
-/**
- * Get chronological context around an anchor entry.
- * Fetches the anchor's full data, then queries all 4 BRAIN tables
- * via UNION ALL to find chronological neighbors.
- *
- * @param projectRoot - Project root directory
- * @param params - Timeline parameters with anchor ID and depth
- * @returns Anchor entry data with surrounding chronological entries
- */
-export async function timelineBrain(projectRoot, params) {
-    const { anchor: anchorId, depthBefore = 3, depthAfter = 3 } = params;
-    // Ensure DB is initialized
-    const { getBrainDb, getBrainNativeDb } = await import('../store/brain-sqlite.js');
-    await getBrainDb(projectRoot);
-    const nativeDb = getBrainNativeDb();
-    if (!nativeDb) {
-        return { anchor: null, before: [], after: [] };
-    }
-    // Determine anchor type and fetch it via accessor
-    const anchorType = parseIdPrefix(anchorId);
-    if (!anchorType) {
-        return { anchor: null, before: [], after: [] };
-    }
-    const accessor = await getBrainAccessor(projectRoot);
-    let anchorData = null;
-    let anchorDate = null;
-    switch (anchorType) {
-        case 'decision': {
-            const row = await accessor.getDecision(anchorId);
-            if (row) {
-                anchorData = row;
-                anchorDate = row.createdAt;
-            }
-            break;
-        }
-        case 'pattern': {
-            const row = await accessor.getPattern(anchorId);
-            if (row) {
-                anchorData = row;
-                anchorDate = row.extractedAt;
-            }
-            break;
-        }
-        case 'learning': {
-            const row = await accessor.getLearning(anchorId);
-            if (row) {
-                anchorData = row;
-                anchorDate = row.createdAt;
-            }
-            break;
-        }
-        case 'observation': {
-            const row = await accessor.getObservation(anchorId);
-            if (row) {
-                anchorData = row;
-                anchorDate = row.createdAt;
-            }
-            break;
-        }
-    }
-    if (!anchorData || !anchorDate) {
-        return { anchor: null, before: [], after: [] };
-    }
-    // UNION ALL across all 4 tables to get chronological neighbors.
-    // Excludes the anchor itself.
-    const beforeRows = typedAll(nativeDb.prepare(`
-    SELECT id, 'decision' AS type, created_at AS date FROM brain_decisions WHERE created_at < ? AND id != ?
-    UNION ALL
-    SELECT id, 'pattern' AS type, extracted_at AS date FROM brain_patterns WHERE extracted_at < ? AND id != ?
-    UNION ALL
-    SELECT id, 'learning' AS type, created_at AS date FROM brain_learnings WHERE created_at < ? AND id != ?
-    UNION ALL
-    SELECT id, 'observation' AS type, created_at AS date FROM brain_observations WHERE created_at < ? AND id != ?
-    ORDER BY date DESC
-    LIMIT ?
-  `), anchorDate, anchorId, anchorDate, anchorId, anchorDate, anchorId, anchorDate, anchorId, depthBefore);
-    const afterRows = typedAll(nativeDb.prepare(`
-    SELECT id, 'decision' AS type, created_at AS date FROM brain_decisions WHERE created_at > ? AND id != ?
-    UNION ALL
-    SELECT id, 'pattern' AS type, extracted_at AS date FROM brain_patterns WHERE extracted_at > ? AND id != ?
-    UNION ALL
-    SELECT id, 'learning' AS type, created_at AS date FROM brain_learnings WHERE created_at > ? AND id != ?
-    UNION ALL
-    SELECT id, 'observation' AS type, created_at AS date FROM brain_observations WHERE created_at > ? AND id != ?
-    ORDER BY date ASC
-    LIMIT ?
-  `), anchorDate, anchorId, anchorDate, anchorId, anchorDate, anchorId, anchorDate, anchorId, depthAfter);
-    return {
-        anchor: { id: anchorId, type: anchorType, data: anchorData },
-        before: beforeRows.map((r) => ({ id: r.id, type: r.type, date: r.date })),
-        after: afterRows.map((r) => ({ id: r.id, type: r.type, date: r.date })),
-    };
-}
-// ============================================================================
-// Layer 3: Batch Fetch
-// ============================================================================
-/**
- * Batch-fetch full details by IDs.
- * Groups IDs by prefix to query the correct tables via BrainDataAccessor.
- *
- * @param projectRoot - Project root directory
- * @param params - Fetch parameters with IDs
- * @returns Full entry data for each found ID, plus not-found list
- */
-export async function fetchBrainEntries(projectRoot, params) {
-    const { ids } = params;
-    if (!ids || ids.length === 0) {
-        return { results: [], notFound: [], tokensEstimated: 0 };
-    }
-    const accessor = await getBrainAccessor(projectRoot);
-    // Group IDs by type prefix
-    const decisionIds = [];
-    const patternIds = [];
-    const learningIds = [];
-    const observationIds = [];
-    const unknownIds = [];
-    for (const id of ids) {
-        const type = parseIdPrefix(id);
-        switch (type) {
-            case 'decision':
-                decisionIds.push(id);
-                break;
-            case 'pattern':
-                patternIds.push(id);
-                break;
-            case 'learning':
-                learningIds.push(id);
-                break;
-            case 'observation':
-                observationIds.push(id);
-                break;
-            default:
-                unknownIds.push(id);
-        }
-    }
-    const results = [];
-    const notFound = [...unknownIds];
-    // Fetch decisions
-    for (const id of decisionIds) {
-        const row = await accessor.getDecision(id);
-        if (row) {
-            results.push({ id, type: 'decision', data: row });
-        }
-        else {
-            notFound.push(id);
-        }
-    }
-    // Fetch patterns
-    for (const id of patternIds) {
-        const row = await accessor.getPattern(id);
-        if (row) {
-            results.push({ id, type: 'pattern', data: row });
-        }
-        else {
-            notFound.push(id);
-        }
-    }
-    // Fetch learnings
-    for (const id of learningIds) {
-        const row = await accessor.getLearning(id);
-        if (row) {
-            results.push({ id, type: 'learning', data: row });
-        }
-        else {
-            notFound.push(id);
-        }
-    }
-    // Fetch observations
-    for (const id of observationIds) {
-        const row = await accessor.getObservation(id);
-        if (row) {
-            results.push({ id, type: 'observation', data: row });
-        }
-        else {
-            notFound.push(id);
-        }
-    }
-    // Citation tracking + retrieval logging (non-blocking)
-    if (results.length > 0) {
-        const fetchedIds = results.map((r) => r.id);
-        setImmediate(() => {
-            incrementCitationCounts(projectRoot, fetchedIds).catch(() => { });
-            logRetrieval(projectRoot, fetchedIds.join(','), fetchedIds, 'fetch', results.length * 500).catch(() => { });
-        });
-    }
-    return {
-        results,
-        notFound,
-        tokensEstimated: results.length * 500,
-    };
-}
-// ============================================================================
-// Observe (Unified Save)
-// ============================================================================
-/**
- * Keyword patterns for auto-classifying observation type from text.
- */
-const TYPE_KEYWORDS = [
-    { keywords: ['bug', 'fix', 'error', 'crash'], type: 'bugfix' },
-    { keywords: ['refactor', 'rename', 'extract', 'move'], type: 'refactor' },
-    { keywords: ['add', 'create', 'implement', 'new'], type: 'feature' },
-    { keywords: ['decide', 'chose', 'pick', 'instead'], type: 'decision' },
-    { keywords: ['update', 'change', 'modify', 'upgrade'], type: 'change' },
-];
-/**
- * Auto-classify observation type from text using keyword matching.
- */
-function classifyObservationType(text) {
-    const lower = text.toLowerCase();
-    for (const { keywords, type } of TYPE_KEYWORDS) {
-        for (const keyword of keywords) {
-            if (lower.includes(keyword)) {
-                return type;
-            }
-        }
-    }
-    return 'discovery';
-}
-/** Monotonic counter to prevent ID collisions within the same millisecond. */
-let observeSeq = 0;
-/**
- * Save an observation to the BRAIN observations table.
- * Replaces the external claude-mem save_observation pattern.
- *
- * Auto-classifies type from text if not provided. Generates a
- * unique ID with O- prefix + base36 timestamp.
- *
- * @param projectRoot - Project root directory
- * @param params - Observation data
- * @returns Created observation ID, type, and timestamp
- */
-export async function observeBrain(projectRoot, params) {
-    const { text, title: titleParam, type: typeParam, project, sourceSessionId, sourceType, agent, sourceConfidence: sourceConfidenceParam, } = params;
-    if (!text?.trim()) {
-        throw new Error('Observation text is required');
-    }
-    const type = typeParam ?? classifyObservationType(text);
-    const title = titleParam ?? text.slice(0, 120);
-    const now = new Date().toISOString().replace('T', ' ').slice(0, 19);
-    // T549 Wave 1-A: Tier routing for observations.
-    // Observations always start as short-term episodic entries.
-    // sourceConfidence routing (spec §4.1 Decision Tree):
-    //   - sourceType 'manual' → 'owner' (owner-stated facts skip short-term in consolidator)
-    //   - sourceType 'session-debrief' → 'task-outcome' (synthesized summaries)
-    //   - otherwise → 'agent' (default for all hook/agent writes)
-    // Source confidence routing (spec §4.1 Decision Tree):
-    //   - sourceType 'manual' → 'owner' (owner-stated facts are ground truth)
-    //   - sourceType 'session-debrief' → 'task-outcome' (verified by completion)
-    //   - otherwise → 'agent' (default for all hook/agent writes)
-    // Owner and task-outcome sources are auto-verified as ground truth.
-    // Agent-inferred entries start unverified — consolidator promotes via corroboration.
-    const resolvedSourceConfidence = sourceConfidenceParam ??
-        (sourceType === 'manual'
-            ? 'owner'
-            : sourceType === 'session-debrief'
-                ? 'task-outcome'
-                : 'agent');
-    const memoryTier = 'short';
-    const memoryType = 'episodic';
-    const verified = resolvedSourceConfidence === 'owner' || resolvedSourceConfidence === 'task-outcome';
-    // Content-hash dedup: SHA-256 prefix of title+text
-    const contentHash = createHash('sha256')
-        .update(title + text)
-        .digest('hex')
-        .slice(0, 16);
-    // Check for recent duplicate (same content within last 30 seconds)
-    const { getBrainNativeDb } = await import('../store/brain-sqlite.js');
-    const nativeDb = getBrainNativeDb();
-    if (nativeDb) {
-        const cutoff = new Date(Date.now() - 30000).toISOString().replace('T', ' ').slice(0, 19);
-        const existing = typedAll(nativeDb.prepare('SELECT id, type, created_at FROM brain_observations WHERE content_hash = ? AND created_at > ?'), contentHash, cutoff);
-        if (existing.length > 0) {
-            return {
-                id: existing[0].id,
-                type: existing[0].type,
-                createdAt: existing[0].created_at,
-            };
-        }
-    }
-    // Write-guard: validate cross-db session reference before inserting
-    let validSessionId = sourceSessionId ?? null;
-    if (validSessionId) {
-        try {
-            const tasksDb = await getDb(projectRoot);
-            if (!(await sessionExistsInTasksDb(validSessionId, tasksDb))) {
-                validSessionId = null;
-            }
-        }
-        catch {
-            // Best-effort: if tasks.db unavailable, null out the reference
-            validSessionId = null;
-        }
-    }
-    // Compute quality score from text richness, title length, and T549 source multiplier.
-    const qualityScore = computeObservationQuality({
-        text,
-        title,
-        sourceConfidence: resolvedSourceConfidence,
-        memoryTier,
-    });
-    const id = `O-${Date.now().toString(36)}-${(observeSeq++ % 1000).toString(36)}`;
-    const accessor = await getBrainAccessor(projectRoot);
-    const row = await accessor.addObservation({
-        id,
-        type,
-        title,
-        narrative: text,
-        contentHash,
-        project: project ?? null,
-        sourceSessionId: validSessionId,
-        sourceType: sourceType ?? 'agent',
-        agent: agent ?? null,
-        qualityScore,
-        createdAt: now,
-        // T549 Wave 1-A: tier/type/confidence assigned at write time
-        memoryTier,
-        memoryType,
-        sourceConfidence: resolvedSourceConfidence,
-        verified,
-    });
-    // Populate embedding if provider is available (T5387).
-    // Fire-and-forget: embedding runs in the background so it never blocks the CLI.
-    // The observation is already saved above — if embedding fails, the observation
-    // still exists, just without vector similarity search capability. (T027)
-    if (isEmbeddingAvailable()) {
-        setImmediate(() => {
-            embedText(text)
-                .then((vector) => {
-                if (vector && nativeDb) {
-                    nativeDb
-                        .prepare('INSERT OR REPLACE INTO brain_embeddings (id, embedding) VALUES (?, ?)')
-                        .run(id, Buffer.from(vector.buffer));
-                }
-            })
-                .catch(() => {
-                // Silently skip embedding failures — observation is already persisted
-            });
-        });
-    }
-    // Regenerate memory bridge for high-value observation types (T5240).
-    // Only learning and decision types trigger bridge refresh to avoid excessive writes.
-    if (type === 'decision') {
-        import('./memory-bridge.js')
-            .then(({ refreshMemoryBridge }) => refreshMemoryBridge(projectRoot))
-            .catch(() => {
-            /* Memory bridge refresh is best-effort */
-        });
-    }
-    // Auto-link observation to the currently focused task when a session is active. (T141)
-    // This is a fire-and-forget side effect — linking failure MUST NOT block the return.
-    if (validSessionId) {
-        autoLinkObservationToTask(projectRoot, row.id, accessor).catch(() => {
-            /* Auto-linking is best-effort */
-        });
-    }
-    // Auto-populate graph node + edges for this observation (best-effort, T537).
-    try {
-        await upsertGraphNode(projectRoot, `observation:${row.id}`, 'observation', row.title.substring(0, 200), row.qualityScore ?? 0.5, row.narrative ?? row.title, { sourceType: row.sourceType, agent: row.agent ?? undefined });
-        // Link observation → session when the observation has a session context.
-        if (validSessionId) {
-            await upsertGraphNode(projectRoot, `session:${validSessionId}`, 'session', validSessionId, 0.8, '');
-            await addGraphEdge(projectRoot, `observation:${row.id}`, `session:${validSessionId}`, 'produced_by', 1.0, 'auto:observe');
-        }
-    }
-    catch {
-        /* Graph population is best-effort — never block the primary return */
-    }
-    return {
-        id: row.id,
-        type: row.type,
-        createdAt: row.createdAt,
-    };
-}
-/**
- * Auto-link a newly created observation to the currently focused task.
- *
- * Queries the active session via sessionStatus() and reads taskWork.taskId.
- * If a task is focused, inserts a brain_memory_links row linking the
- * observation to that task with linkType 'produced_by'.
- *
- * All failures are silently swallowed — this is a best-effort side effect.
- *
- * @param projectRoot - Project root directory
- * @param observationId - ID of the newly created observation
- * @param accessor - BrainDataAccessor to use for the link insert
- */
-async function autoLinkObservationToTask(projectRoot, observationId, accessor) {
-    const { sessionStatus } = await import('../sessions/index.js');
-    const session = await sessionStatus(projectRoot);
-    if (!session)
-        return;
-    const taskId = session.taskWork?.taskId;
-    if (!taskId)
-        return;
-    await accessor.addLink({
-        memoryType: 'observation',
-        memoryId: observationId,
-        taskId,
-        linkType: 'produced_by',
-    });
-}
-/**
- * Backfill embeddings for existing observations that lack them.
- *
- * Iterates through observations not yet in brain_embeddings and
- * generates vectors using the registered embedding provider.
- * Processes in batches to avoid memory pressure.
- *
- * An optional {@link PopulateEmbeddingsOptions.onProgress} callback is called
- * after each observation is attempted, enabling callers to report progress.
- *
- * @param projectRoot - Project root directory
- * @param options - Optional batch size and progress callback
- * @returns Count of processed, skipped, and errored observations
- *
- * @epic T134
- * @task T142
- */
-export async function populateEmbeddings(projectRoot, options) {
-    if (!isEmbeddingAvailable()) {
-        return { processed: 0, skipped: 0, errors: 0 };
-    }
-    const { getBrainDb, getBrainNativeDb } = await import('../store/brain-sqlite.js');
-    await getBrainDb(projectRoot);
-    const nativeDb = getBrainNativeDb();
-    if (!nativeDb) {
-        return { processed: 0, skipped: 0, errors: 0 };
-    }
-    const batchSize = options?.batchSize ?? 50;
-    const { onProgress } = options ?? {};
-    let processed = 0;
-    let skipped = 0;
-    let errors = 0;
-    // Find observations without embeddings
-    const rows = typedAll(nativeDb.prepare(`
-    SELECT o.id, o.narrative, o.title
-    FROM brain_observations o
-    LEFT JOIN brain_embeddings e ON o.id = e.id
-    WHERE e.id IS NULL AND o.narrative IS NOT NULL
-    ORDER BY o.created_at DESC
-  `));
-    const total = rows.length;
-    let attempted = 0;
-    for (let i = 0; i < rows.length; i += batchSize) {
-        const batch = rows.slice(i, i + batchSize);
-        for (const row of batch) {
-            try {
-                const vector = await embedText(row.narrative || row.title);
-                if (vector) {
-                    nativeDb
-                        .prepare('INSERT OR REPLACE INTO brain_embeddings (id, embedding) VALUES (?, ?)')
-                        .run(row.id, Buffer.from(vector.buffer));
-                    processed++;
-                }
-                else {
-                    skipped++;
-                }
-            }
-            catch {
-                errors++;
-            }
-            attempted++;
-            onProgress?.(attempted, total);
-        }
-    }
-    return { processed, skipped, errors };
-}
-/**
- * Budget-aware hybrid retrieval combining FTS5, vector KNN, and graph neighbor scores.
- *
- * Strategy (parallel where possible):
- *   A. FTS5 BM25 search (always)  — keyword precision (50% weight)
- *   B. Vector KNN search (optional) — semantic recall (40% weight, skipped if no embeddings)
- *   C. Graph neighbors (optional) — associative context (10% weight, skipped if graph empty)
- *
- * Score fusion: final = (fts*0.50 + vec*0.40 + graph*0.10) × qualityScore
- * Recency boost: +0.05 for entries updated in last 7 days.
- * Type priority: procedural entries get +0.10 (always-useful rules).
- *
- * Budget enforcement:
- *   - Rank top-50 candidates by fused score.
- *   - Walk list, accumulate token cost (≈ textLen/4), stop at budget.
- *   - Episodic entries dropped first when budget is tight.
- *
- * Citation tracking: increments citationCount for returned entries in background (setImmediate).
- *
- * @param projectRoot - Project root directory
- * @param query - Text to search for
- * @param tokenBudget - Maximum tokens to spend on results (default 500)
- * @param options - Optional filters (types, tiers, verified)
- * @returns Retrieved entries within budget with token accounting
- */
-export async function retrieveWithBudget(projectRoot, query, tokenBudget = 500, options) {
-    if (!query?.trim()) {
-        return { entries: [], tokensUsed: 0, tokensRemaining: tokenBudget, excluded: 0 };
-    }
-    // -------------------------------------------------------------------------
-    // Run search strategies in parallel
-    // -------------------------------------------------------------------------
-    const [ftsResult, vecResults, graphNeighbors] = await Promise.all([
-        // A. FTS5
-        searchBrain(projectRoot, query, { limit: 30 }).catch(() => ({
-            decisions: [],
-            patterns: [],
-            learnings: [],
-            observations: [],
-        })),
-        // B. Vector KNN (degrades gracefully when unavailable)
-        searchSimilar(query, projectRoot, 20).catch(() => []),
-        // C. Graph neighbors from top FTS hit
-        Promise.resolve([]),
-    ]);
-    const candidateMap = new Map();
-    // FTS results (normalized score 0.5 starting point — BM25 doesn't give 0..1)
-    const FTS_BASE = 0.5;
-    for (const d of ftsResult.decisions) {
-        const raw = d;
-        const id = d.id;
-        const tier = (d.memoryTier ?? raw['memory_tier']) || undefined;
-        const mtype = (d.memoryType ?? raw['memory_type']) || undefined;
-        const updatedAt = (d.updatedAt ?? raw['updated_at']) || undefined;
-        candidateMap.set(id, {
-            id,
-            type: 'decision',
-            title: d.decision.slice(0, 120),
-            text: `${d.decision} — ${d.rationale}`,
-            ftsScore: FTS_BASE,
-            vecScore: 0,
-            graphScore: 0,
-            qualityScore: d.qualityScore ?? 0.5,
-            memoryTier: tier,
-            memoryType: mtype,
-            updatedAt,
-        });
-    }
-    for (const p of ftsResult.patterns) {
-        const raw = p;
-        const id = p.id;
-        const tier = (p.memoryTier ?? raw['memory_tier']) || undefined;
-        const mtype = (p.memoryType ?? raw['memory_type']) || undefined;
-        const updatedAt = (p.updatedAt ?? raw['updated_at']) || undefined;
-        candidateMap.set(id, {
-            id,
-            type: 'pattern',
-            title: p.pattern.slice(0, 120),
-            text: `${p.pattern} — ${p.context}`,
-            ftsScore: FTS_BASE,
-            vecScore: 0,
-            graphScore: 0,
-            qualityScore: p.qualityScore ?? 0.5,
-            memoryTier: tier,
-            memoryType: mtype,
-            updatedAt,
-        });
-    }
-    for (const l of ftsResult.learnings) {
-        const raw = l;
-        const id = l.id;
-        const tier = (l.memoryTier ?? raw['memory_tier']) || undefined;
-        const mtype = (l.memoryType ?? raw['memory_type']) || undefined;
-        const updatedAt = (l.updatedAt ?? raw['updated_at']) || undefined;
-        candidateMap.set(id, {
-            id,
-            type: 'learning',
-            title: l.insight.slice(0, 120),
-            text: `${l.insight} (source: ${l.source})`,
-            ftsScore: FTS_BASE,
-            vecScore: 0,
-            graphScore: 0,
-            qualityScore: l.qualityScore ?? 0.5,
-            memoryTier: tier,
-            memoryType: mtype,
-            updatedAt,
-        });
-    }
-    for (const o of ftsResult.observations) {
-        const raw = o;
-        const id = o.id;
-        const tier = (o.memoryTier ?? raw['memory_tier']) || undefined;
-        const mtype = (o.memoryType ?? raw['memory_type']) || undefined;
-        const updatedAt = (o.updatedAt ?? raw['updated_at']) || undefined;
-        candidateMap.set(id, {
-            id,
-            type: 'observation',
-            title: o.title.slice(0, 120),
-            text: o.narrative ?? o.title,
-            ftsScore: FTS_BASE,
-            vecScore: 0,
-            graphScore: 0,
-            qualityScore: o.qualityScore ?? 0.5,
-            memoryTier: tier,
-            memoryType: mtype,
-            updatedAt,
-        });
-    }
-    // B. Merge vector scores (distance → similarity: similarity = 1 - distance)
-    for (const v of vecResults) {
-        const simScore = Math.max(0, 1 - v.distance);
-        const existing = candidateMap.get(v.id);
-        if (existing) {
-            existing.vecScore = simScore;
-        }
-        else {
-            candidateMap.set(v.id, {
-                id: v.id,
-                type: v.type,
-                title: v.title.slice(0, 120),
-                text: v.text,
-                ftsScore: 0,
-                vecScore: simScore,
-                graphScore: 0,
-                qualityScore: 0.5,
-                memoryTier: undefined,
-                memoryType: undefined,
-            });
-        }
-    }
-    // C. Merge graph scores
-    for (const g of graphNeighbors) {
-        const existing = candidateMap.get(g.id);
-        if (existing) {
-            existing.graphScore = g.graphScore;
-        }
-    }
-    // -------------------------------------------------------------------------
-    // Score fusion + ranking
-    // -------------------------------------------------------------------------
-    const sevenDaysAgo = new Date(Date.now() - 7 * 24 * 60 * 60 * 1000)
-        .toISOString()
-        .replace('T', ' ')
-        .slice(0, 19);
-    const candidates = Array.from(candidateMap.values()).map((c) => {
-        // Fused score
-        let score = c.ftsScore * 0.5 + c.vecScore * 0.4 + c.graphScore * 0.1;
-        // Quality multiplier
-        score *= c.qualityScore;
-        // Recency boost for recently-updated entries
-        if (c.updatedAt && c.updatedAt >= sevenDaysAgo) {
-            score += 0.05;
-        }
-        // Type priority boost for procedural entries (always-useful rules)
-        if (c.memoryType === 'procedural' || c.type === 'pattern') {
-            score += 0.1;
-        }
-        return { ...c, score };
-    });
-    // -------------------------------------------------------------------------
-    // Apply option filters (types, tiers, verified)
-    // -------------------------------------------------------------------------
-    // We'll apply verified filter by checking the DB if requested
-    let filtered = candidates;
-    if (options?.types && options.types.length > 0) {
-        const allowedTypes = new Set(options.types);
-        filtered = filtered.filter((c) => {
-            if (!c.memoryType)
-                return true; // unknown type — include
-            return allowedTypes.has(c.memoryType);
-        });
-    }
-    if (options?.tiers && options.tiers.length > 0) {
-        const allowedTiers = new Set(options.tiers);
-        filtered = filtered.filter((c) => {
-            if (!c.memoryTier)
-                return true; // unknown tier — include
-            return allowedTiers.has(c.memoryTier);
-        });
-    }
-    // -------------------------------------------------------------------------
-    // Sort: procedural first, then by score descending
-    // -------------------------------------------------------------------------
-    filtered.sort((a, b) => {
-        const aProcedural = a.memoryType === 'procedural' || a.type === 'pattern' ? 1 : 0;
-        const bProcedural = b.memoryType === 'procedural' || b.type === 'pattern' ? 1 : 0;
-        if (aProcedural !== bProcedural)
-            return bProcedural - aProcedural;
-        return b.score - a.score;
-    });
-    // Cap candidate list at top 50
-    const topCandidates = filtered.slice(0, 50);
-    // -------------------------------------------------------------------------
-    // Budget enforcement — episodic entries are dropped first when budget tight
-    // -------------------------------------------------------------------------
-    // Sort for budget walk: procedural first, semantic second, episodic last
-    const typeOrder = (c) => {
-        if (c.memoryType === 'procedural' || c.type === 'pattern')
-            return 0;
-        if (c.memoryType === 'semantic' || c.type === 'decision' || c.type === 'learning')
-            return 1;
-        return 2; // episodic
-    };
-    const budgetOrdered = [...topCandidates].sort((a, b) => {
-        const orderDiff = typeOrder(a) - typeOrder(b);
-        if (orderDiff !== 0)
-            return orderDiff;
-        return b.score - a.score;
-    });
-    const result = [];
-    let tokensUsed = 0;
-    let excluded = 0;
-    for (const candidate of budgetOrdered) {
-        const entryTokens = Math.ceil(candidate.text.length / 4);
-        if (tokensUsed + entryTokens > tokenBudget) {
-            excluded++;
-            continue;
-        }
-        result.push({
-            id: candidate.id,
-            type: candidate.type,
-            title: candidate.title,
-            text: candidate.text,
-            score: candidate.score,
-            tokensEstimated: entryTokens,
-            memoryTier: candidate.memoryTier,
-            memoryType: candidate.memoryType,
-        });
-        tokensUsed += entryTokens;
-    }
-    // -------------------------------------------------------------------------
-    // Citation tracking — non-blocking background increment
-    // -------------------------------------------------------------------------
-    if (result.length > 0) {
-        const returnedIds = result.map((e) => e.id);
-        setImmediate(() => {
-            incrementCitationCounts(projectRoot, returnedIds).catch(() => {
-                /* best-effort */
-            });
-        });
-    }
-    return {
-        entries: result,
-        tokensUsed,
-        tokensRemaining: tokenBudget - tokensUsed,
-        excluded,
-    };
-}
-// ============================================================================
-// Citation Count Increment (non-blocking helper)
-// ============================================================================
-/**
- * Increment citationCount for a list of entry IDs.
- *
- * Routes each ID to the correct table based on its ID prefix. All updates
- * are best-effort — errors are silently swallowed.
- *
- * @param projectRoot - Project root for brain.db resolution
- * @param ids - Entry IDs whose citation counts should be incremented
- */
-async function incrementCitationCounts(projectRoot, ids) {
-    if (ids.length === 0)
-        return;
-    const { getBrainDb, getBrainNativeDb } = await import('../store/brain-sqlite.js');
-    await getBrainDb(projectRoot);
-    const nativeDb = getBrainNativeDb();
-    if (!nativeDb)
-        return;
-    const now = new Date().toISOString().replace('T', ' ').slice(0, 19);
-    for (const id of ids) {
-        let table;
-        if (id.startsWith('D-') || /^D\d/.test(id)) {
-            table = 'brain_decisions';
-        }
-        else if (id.startsWith('P-') || /^P\d/.test(id)) {
-            table = 'brain_patterns';
-        }
-        else if (id.startsWith('L-') || /^L\d/.test(id)) {
-            table = 'brain_learnings';
-        }
-        else {
-            table = 'brain_observations';
-        }
-        try {
-            nativeDb
-                .prepare(`UPDATE ${table} SET citation_count = citation_count + 1, updated_at = ? WHERE id = ?`)
-                .run(now, id);
-        }
-        catch {
-            /* best-effort — column may not exist in older schemas */
-        }
-    }
-}
-/**
- * Log a retrieval event to brain_retrieval_log for co-retrieval analysis.
- *
- * Creates the table on first use if it doesn't exist (self-healing).
- * Best-effort: errors are silently swallowed.
- */
-async function logRetrieval(projectRoot, query, entryIds, source, tokensUsed) {
-    if (entryIds.length === 0)
-        return;
-    const { getBrainDb, getBrainNativeDb } = await import('../store/brain-sqlite.js');
-    await getBrainDb(projectRoot);
-    const nativeDb = getBrainNativeDb();
-    if (!nativeDb)
-        return;
-    // Self-healing: create table if not exists
-    const createSql = 'CREATE TABLE IF NOT EXISTS brain_retrieval_log (' +
-        'id INTEGER PRIMARY KEY AUTOINCREMENT,' +
-        'query TEXT NOT NULL,' +
-        'entry_ids TEXT NOT NULL,' +
-        'entry_count INTEGER NOT NULL,' +
-        'source TEXT NOT NULL,' +
-        'tokens_used INTEGER,' +
-        "created_at TEXT NOT NULL DEFAULT (datetime('now'))" +
-        ')';
-    try {
-        nativeDb.prepare(createSql).run();
-    }
-    catch {
-        return;
-    }
-    try {
-        nativeDb
-            .prepare('INSERT INTO brain_retrieval_log (query, entry_ids, entry_count, source, tokens_used) VALUES (?, ?, ?, ?, ?)')
-            .run(query, entryIds.join(','), entryIds.length, source, tokensUsed ?? null);
-    }
-    catch {
-        /* best-effort */
-    }
-}
-//# sourceMappingURL=brain-retrieval.js.map