@cleocode/core 2026.4.31 → 2026.4.35

package/dist/memory/brain-backfill.js

@@ -0,0 +1,389 @@
+/**
+ * Brain graph back-fill — populates brain_page_nodes and brain_page_edges from
+ * existing typed table rows (decisions, patterns, learnings, observations,
+ * sticky notes).
+ *
+ * Each row in a typed table gets a corresponding node in brain_page_nodes.
+ * Relationship edges are derived from:
+ *   - decision.contextTaskId / contextEpicId  → applies_to edges
+ *   - observation.sourceSessionId             → produced_by edge
+ *   - observation text referencing task IDs   → applies_to edges
+ *   - pattern entries                         → derived_from stubs
+ *
+ * Stub nodes (task:<id>, session:<id>, epic:<id>) are created for referenced
+ * external entities so edges have valid targets.
+ *
+ * Duplicate nodes are silently skipped (INSERT OR IGNORE semantics via
+ * Drizzle onConflictDoNothing).
+ *
+ * @task T530
+ * @epic T523
+ */
+import { createHash } from 'node:crypto';
+import { getBrainAccessor } from '../store/brain-accessor.js';
+import * as brainSchema from '../store/brain-schema.js';
+import { getBrainDb } from '../store/brain-sqlite.js';
+// ============================================================================
+// Helpers
+// ============================================================================
+/**
+ * Return the SHA-256 prefix (first 16 hex chars) of the given content string.
+ * Normalises to lowercase and trims before hashing to improve dedup accuracy.
+ */
+function sha256prefix(content) {
+    return createHash('sha256').update(content.trim().toLowerCase()).digest('hex').substring(0, 16);
+}
+/**
+ * Compute quality score for a decision row.
+ * High confidence → 0.9, medium → 0.7, low → 0.5.
+ */
+function computeDecisionQuality(decision) {
+    switch (decision.confidence) {
+        case 'high':
+            return 0.9;
+        case 'medium':
+            return 0.7;
+        default:
+            return 0.5;
+    }
+}
+/**
+ * Compute quality score for a pattern row.
+ * Composite: base 0.4 + frequency factor + success-rate factor.
+ * Capped at 0.9 to reserve 1.0 for canonical external references.
+ */
+function computePatternQuality(pattern) {
+    const freqFactor = Math.min(0.3, (pattern.frequency ?? 1) * 0.05);
+    const successFactor = (pattern.successRate ?? 0) * 0.3;
+    return Math.min(0.9, 0.4 + freqFactor + successFactor);
+}
+/**
+ * Compute quality score for a learning row.
+ * Maps the stored 0.0–1.0 confidence directly to quality, capped at 0.9.
+ */
+function computeLearningQuality(learning) {
+    return Math.min(0.9, learning.confidence ?? 0.5);
+}
+/**
+ * Compute quality score for an observation row.
+ * Manual entries are highest quality (0.8), agent-generated 0.7, others 0.5.
+ */
+function computeObservationQuality(observation) {
+    switch (observation.sourceType) {
+        case 'manual':
+            return 0.8;
+        case 'agent':
+        case 'session-debrief':
+            return 0.7;
+        default:
+            return 0.5;
+    }
+}
+/**
+ * Extract task IDs referenced in a block of text.
+ * Matches T followed by 3–6 digits (e.g. T530, T5160).
+ */
+function extractTaskRefs(text) {
+    const matches = text.match(/\bT\d{3,6}\b/g);
+    if (!matches)
+        return [];
+    return [...new Set(matches)];
+}
+// ============================================================================
+// Core back-fill function
+// ============================================================================
+/**
+ * Back-fill brain_page_nodes and brain_page_edges from all existing typed rows
+ * in brain.db.
+ *
+ * Safe to run multiple times — duplicate nodes and edges are silently ignored
+ * via INSERT OR IGNORE semantics.
+ *
+ * @param projectRoot - Absolute path to the project root (contains .cleo/).
+ * @returns BackfillResult with before/after counts and insertion stats.
+ */
+export async function backfillBrainGraph(projectRoot) {
+    const db = await getBrainDb(projectRoot);
+    const accessor = await getBrainAccessor(projectRoot);
+    // ── Before counts ────────────────────────────────────────────────────────
+    const [beforeNodes, beforeEdges] = await Promise.all([
+        db.select({ count: brainSchema.brainPageNodes.id }).from(brainSchema.brainPageNodes),
+        db.select({ count: brainSchema.brainPageEdges.fromId }).from(brainSchema.brainPageEdges),
+    ]);
+    const [decisions, patterns, learnings, observations, stickyNotes] = await Promise.all([
+        accessor.findDecisions(),
+        accessor.findPatterns(),
+        accessor.findLearnings(),
+        accessor.findObservations(),
+        accessor.findStickyNotes(),
+    ]);
+    const beforeNodeCount = beforeNodes.length;
+    const beforeEdgeCount = beforeEdges.length;
+    // ── Tracking state ────────────────────────────────────────────────────────
+    let nodesInserted = 0;
+    let edgesInserted = 0;
+    let stubsCreated = 0;
+    // Track stub nodes we've already created to avoid duplicates
+    const createdStubs = new Set();
+    // Accumulate pending inserts for batch efficiency
+    const pendingNodes = [];
+    const pendingEdges = [];
+    const now = new Date().toISOString().replace('T', ' ').slice(0, 19);
+    /** Ensure a stub node exists for an external reference (task, session, epic). */
+    function scheduleStub(nodeId, nodeType, label) {
+        if (createdStubs.has(nodeId))
+            return;
+        createdStubs.add(nodeId);
+        pendingNodes.push({
+            id: nodeId,
+            nodeType,
+            label: label.substring(0, 200),
+            qualityScore: 1.0,
+            contentHash: null,
+            lastActivityAt: now,
+            metadataJson: null,
+            createdAt: now,
+            updatedAt: null,
+        });
+    }
+    /** Schedule an edge insert (deduped by fromId+toId+edgeType within this run). */
+    const edgeSet = new Set();
+    function scheduleEdge(edge) {
+        const key = `${edge.fromId}|${edge.toId}|${edge.edgeType}`;
+        if (edgeSet.has(key))
+            return;
+        edgeSet.add(key);
+        pendingEdges.push(edge);
+    }
+    // ── 1. Decisions ─────────────────────────────────────────────────────────
+    const byType = {};
+    for (const decision of decisions) {
+        const nodeId = `decision:${decision.id}`;
+        pendingNodes.push({
+            id: nodeId,
+            nodeType: 'decision',
+            label: decision.decision.substring(0, 200),
+            qualityScore: computeDecisionQuality(decision),
+            contentHash: sha256prefix(decision.decision + (decision.rationale ?? '')),
+            lastActivityAt: decision.updatedAt ?? decision.createdAt ?? now,
+            metadataJson: JSON.stringify({
+                type: decision.type,
+                confidence: decision.confidence,
+                outcome: decision.outcome,
+            }),
+            createdAt: decision.createdAt ?? now,
+            updatedAt: decision.updatedAt ?? null,
+        });
+        byType['decision'] = (byType['decision'] ?? 0) + 1;
+        // Decision → task applies_to edge
+        if (decision.contextTaskId) {
+            const taskNodeId = `task:${decision.contextTaskId}`;
+            scheduleStub(taskNodeId, 'task', decision.contextTaskId);
+            scheduleEdge({
+                fromId: nodeId,
+                toId: taskNodeId,
+                edgeType: 'applies_to',
+                weight: 1.0,
+                provenance: 'backfill:decision.contextTaskId',
+                createdAt: now,
+            });
+        }
+        // Decision → epic applies_to edge
+        if (decision.contextEpicId) {
+            const epicNodeId = `epic:${decision.contextEpicId}`;
+            scheduleStub(epicNodeId, 'epic', decision.contextEpicId);
+            scheduleEdge({
+                fromId: nodeId,
+                toId: epicNodeId,
+                edgeType: 'applies_to',
+                weight: 0.9,
+                provenance: 'backfill:decision.contextEpicId',
+                createdAt: now,
+            });
+        }
+    }
+    // ── 2. Patterns ───────────────────────────────────────────────────────────
+    for (const pattern of patterns) {
+        const nodeId = `pattern:${pattern.id}`;
+        pendingNodes.push({
+            id: nodeId,
+            nodeType: 'pattern',
+            label: pattern.pattern.substring(0, 200),
+            qualityScore: computePatternQuality(pattern),
+            contentHash: sha256prefix(pattern.pattern),
+            lastActivityAt: pattern.updatedAt ?? pattern.extractedAt ?? now,
+            metadataJson: JSON.stringify({
+                type: pattern.type,
+                frequency: pattern.frequency,
+                impact: pattern.impact,
+            }),
+            createdAt: pattern.extractedAt ?? now,
+            updatedAt: pattern.updatedAt ?? null,
+        });
+        byType['pattern'] = (byType['pattern'] ?? 0) + 1;
+        // Patterns referencing tasks in their context field → derived_from edge
+        if (pattern.context) {
+            const taskRefs = extractTaskRefs(pattern.context);
+            for (const taskId of taskRefs) {
+                const taskNodeId = `task:${taskId}`;
+                scheduleStub(taskNodeId, 'task', taskId);
+                scheduleEdge({
+                    fromId: nodeId,
+                    toId: taskNodeId,
+                    edgeType: 'derived_from',
+                    weight: 0.7,
+                    provenance: 'backfill:pattern.context-task-ref',
+                    createdAt: now,
+                });
+            }
+        }
+    }
+    // ── 3. Learnings ──────────────────────────────────────────────────────────
+    for (const learning of learnings) {
+        const nodeId = `learning:${learning.id}`;
+        pendingNodes.push({
+            id: nodeId,
+            nodeType: 'learning',
+            label: learning.insight.substring(0, 200),
+            qualityScore: computeLearningQuality(learning),
+            contentHash: sha256prefix(learning.insight + (learning.source ?? '')),
+            lastActivityAt: learning.updatedAt ?? learning.createdAt ?? now,
+            metadataJson: JSON.stringify({
+                confidence: learning.confidence,
+                actionable: learning.actionable,
+                source: learning.source,
+            }),
+            createdAt: learning.createdAt ?? now,
+            updatedAt: learning.updatedAt ?? null,
+        });
+        byType['learning'] = (byType['learning'] ?? 0) + 1;
+    }
+    // ── 4. Observations ───────────────────────────────────────────────────────
+    for (const observation of observations) {
+        const nodeId = `observation:${observation.id}`;
+        const labelSource = observation.title || observation.narrative?.substring(0, 200) || 'Untitled observation';
+        pendingNodes.push({
+            id: nodeId,
+            nodeType: 'observation',
+            label: labelSource.substring(0, 200),
+            qualityScore: computeObservationQuality(observation),
+            contentHash: observation.contentHash ?? sha256prefix(observation.narrative ?? observation.title ?? ''),
+            lastActivityAt: observation.updatedAt ?? observation.createdAt ?? now,
+            metadataJson: JSON.stringify({
+                sourceType: observation.sourceType,
+                agent: observation.agent,
+                sessionId: observation.sourceSessionId,
+            }),
+            createdAt: observation.createdAt ?? now,
+            updatedAt: observation.updatedAt ?? null,
+        });
+        byType['observation'] = (byType['observation'] ?? 0) + 1;
+        // Observation → session produced_by edge
+        if (observation.sourceSessionId) {
+            const sessionNodeId = `session:${observation.sourceSessionId}`;
+            scheduleStub(sessionNodeId, 'session', `Session ${observation.sourceSessionId.substring(0, 30)}`);
+            scheduleEdge({
+                fromId: nodeId,
+                toId: sessionNodeId,
+                edgeType: 'produced_by',
+                weight: 1.0,
+                provenance: 'backfill:observation.sourceSessionId',
+                createdAt: now,
+            });
+        }
+        // Observation text → task applies_to edges
+        const fullText = [observation.title, observation.subtitle, observation.narrative]
+            .filter(Boolean)
+            .join(' ');
+        const taskRefs = extractTaskRefs(fullText);
+        for (const taskId of taskRefs) {
+            const taskNodeId = `task:${taskId}`;
+            scheduleStub(taskNodeId, 'task', taskId);
+            scheduleEdge({
+                fromId: nodeId,
+                toId: taskNodeId,
+                edgeType: 'applies_to',
+                weight: 0.8,
+                provenance: 'backfill:observation.text-task-ref',
+                createdAt: now,
+            });
+        }
+    }
+    // ── 5. Sticky Notes ───────────────────────────────────────────────────────
+    for (const sticky of stickyNotes) {
+        const nodeId = `sticky:${sticky.id}`;
+        const labelSource = sticky.content?.substring(0, 200) ?? 'Untitled sticky';
+        pendingNodes.push({
+            id: nodeId,
+            nodeType: 'sticky',
+            label: labelSource.substring(0, 200),
+            qualityScore: 0.6,
+            contentHash: sha256prefix(sticky.content ?? ''),
+            lastActivityAt: sticky.updatedAt ?? sticky.createdAt ?? now,
+            metadataJson: JSON.stringify({
+                status: sticky.status,
+                priority: sticky.priority,
+                color: sticky.color,
+            }),
+            createdAt: sticky.createdAt ?? now,
+            updatedAt: sticky.updatedAt ?? null,
+        });
+        byType['sticky'] = (byType['sticky'] ?? 0) + 1;
+        // Sticky notes with task refs → applies_to edges
+        if (sticky.content) {
+            const taskRefs = extractTaskRefs(sticky.content);
+            for (const taskId of taskRefs) {
+                const taskNodeId = `task:${taskId}`;
+                scheduleStub(taskNodeId, 'task', taskId);
+                scheduleEdge({
+                    fromId: nodeId,
+                    toId: taskNodeId,
+                    edgeType: 'applies_to',
+                    weight: 0.7,
+                    provenance: 'backfill:sticky.content-task-ref',
+                    createdAt: now,
+                });
+            }
+        }
+    }
+    // ── Flush nodes (INSERT OR IGNORE) ─────────────────────────────────────────
+    const BATCH_SIZE = 50;
+    for (let i = 0; i < pendingNodes.length; i += BATCH_SIZE) {
+        const batch = pendingNodes.slice(i, i + BATCH_SIZE);
+        await db.insert(brainSchema.brainPageNodes).values(batch).onConflictDoNothing();
+        nodesInserted += batch.length;
+    }
+    // Stub nodes count
+    stubsCreated = createdStubs.size;
+    // ── Flush edges (INSERT OR IGNORE) ─────────────────────────────────────────
+    for (let i = 0; i < pendingEdges.length; i += BATCH_SIZE) {
+        const batch = pendingEdges.slice(i, i + BATCH_SIZE);
+        await db.insert(brainSchema.brainPageEdges).values(batch).onConflictDoNothing();
+        edgesInserted += batch.length;
+    }
+    // ── After counts ──────────────────────────────────────────────────────────
+    const [afterNodes, afterEdges] = await Promise.all([
+        db.select({ id: brainSchema.brainPageNodes.id }).from(brainSchema.brainPageNodes),
+        db.select({ fromId: brainSchema.brainPageEdges.fromId }).from(brainSchema.brainPageEdges),
+    ]);
+    return {
+        before: {
+            nodes: beforeNodeCount,
+            edges: beforeEdgeCount,
+            decisions: decisions.length,
+            patterns: patterns.length,
+            learnings: learnings.length,
+            observations: observations.length,
+            stickyNotes: stickyNotes.length,
+        },
+        after: {
+            nodes: afterNodes.length,
+            edges: afterEdges.length,
+        },
+        nodesInserted,
+        edgesInserted,
+        stubsCreated,
+        byType,
+    };
+}
+//# sourceMappingURL=brain-backfill.js.map

package/dist/memory/brain-backfill.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"brain-backfill.js","sourceRoot":"","sources":["../../src/memory/brain-backfill.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAS9D,OAAO,KAAK,WAAW,MAAM,0BAA0B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAiCtD,+EAA+E;AAC/E,UAAU;AACV,+EAA+E;AAE/E;;;GAGG;AACH,SAAS,YAAY,CAAC,OAAe;IACnC,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAClG,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAAC,QAA0B;IACxD,QAAQ,QAAQ,CAAC,UAAU,EAAE,CAAC;QAC5B,KAAK,MAAM;YACT,OAAO,GAAG,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC;QACb;YACE,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,OAAwB;IACrD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAClE,MAAM,aAAa,GAAG,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IACvD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,UAAU,GAAG,aAAa,CAAC,CAAC;AACzD,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAAC,QAA0B;IACxD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,UAAU,IAAI,GAAG,CAAC,CAAC;AACnD,CAAC;AAED;;;GAGG;AACH,SAAS,yBAAyB,CAAC,WAAgC;IACjE,QAAQ,WAAW,CAAC,UAAU,EAAE,CAAC;QAC/B,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC;QACb,KAAK,OAAO,CAAC;QACb,KAAK,iBAAiB;YACpB,OAAO,GAAG,CAAC;QACb;YACE,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAY;IACnC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAC5C,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IACxB,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED,+EAA+E;AAC/E,0BAA0B;AAC1B,+EAA+E;AAE/E;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,WAAmB;IAC1D,MAAM,EAAE,GAAG,MAAM,UAAU,CAAC,WAAW,CAAC,CAAC;IACzC,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAErD,4EAA4E;IAC5E,MAAM,CAAC,WAAW,EAAE,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QACnD,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACpF,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;KACzF,CAAC,CAAC;IAEH,MAAM,CAAC,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QACpF,QAAQ,CAAC,aAAa,EAAE;QACxB,QAAQ,CAAC,YAAY,EAAE;QACvB,QAAQ,CAAC,aAAa,EAAE;QACxB,QAAQ,CAAC,gBAAgB,EAAE;QAC3B,QAAQ,CAAC,eAAe,EAAE;KAC3B,CAAC,CAAC;IAEH,MAAM,eAAe,GAAG,WAAW,CAAC,MAAM,CAAC;IAC3C,MAAM,eAAe,GAAG,WAAW,CAAC,MAAM,CAAC;IAE3C,6EAA6E;IAC7E,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,6DAA6D;IAC7D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,kDAAkD;IAClD,MAAM,YAAY,GAA0B,EAAE,CAAC;IAC/C,MAAM,YAAY,GAA0B,EAAE,CAAC;IAE/C,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEpE,iFAAiF;IACjF,SAAS,YAAY,CACnB,MAAc,EACd,QAAqC,EACrC,KAAa;QAEb,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO;QACrC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzB,YAAY,CAAC,IAAI,CAAC;YAChB,EAAE,EAAE,MAAM;YACV,QAAQ;YACR,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC;YAC9B,YAAY,EAAE,GAAG;YACjB,WAAW,EAAE,IAAI;YACjB,cAAc,EAAE,GAAG;YACnB,YAAY,EAAE,IAAI;YAClB,SAAS,EAAE,GAAG;YACd,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;IACL,CAAC;IAED,iFAAiF;IACjF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,SAAS,YAAY,CAAC,IAAyB;QAC7C,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO;QAC7B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,4EAA4E;IAC5E,MAAM,MAAM,GAA2B,EAAE,CAAC;IAE1C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,YAAY,QAAQ,CAAC,EAAE,EAAE,CAAC;QACzC,YAAY,CAAC,IAAI,CAAC;YAChB,EAAE,EAAE,MAAM;YACV,QAAQ,EAAE,UAAU;YACpB,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC;YAC1C,YAAY,EAAE,sBAAsB,CAAC,QAAQ,CAAC;YAC9C,WAAW,EAAE,YAAY,CAAC,QAAQ,CAAC,QAAQ,GAAG,CAAC,QAAQ,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;YACzE,cAAc,EAAE,QAAQ,CAAC,SAAS,IAAI,QAAQ,CAAC,SAAS,IAAI,GAAG;YAC/D,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC;gBAC3B,IAAI,EAAE,QAAQ,CAAC,IAAI;gBACnB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,OAAO,EAAE,QAAQ,CAAC,OAAO;aAC1B,CAAC;YACF,SAAS,EAAE,QAAQ,CAAC,SAAS,IAAI,GAAG;YACpC,SAAS,EAAE,QAAQ,CAAC,SAAS,IAAI,IAAI;SACtC,CAAC,CAAC;QACH,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAEnD,kCAAkC;QAClC,IAAI,QAAQ,CAAC,aAAa,EAAE,CAAC;YAC3B,MAAM,UAAU,GAAG,QAAQ,QAAQ,CAAC,aAAa,EAAE,CAAC;YACpD,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,CAAC,aAAa,CAAC,CAAC;YACzD,YAAY,CAAC;gBACX,MAAM,EAAE,MAAM;gBACd,IAAI,EAAE,UAAU;gBAChB,QAAQ,EAAE,YAAY;gBACtB,MAAM,EAAE,GAAG;gBACX,UAAU,EAAE,iCAAiC;gBAC7C,SAAS,EAAE,GAAG;aACf,CAAC,CAAC;QACL,CAAC;QAED,kCAAkC;QAClC,IAAI,QAAQ,CAAC,aAAa,EAAE,CAAC;YAC3B,MAAM,UAAU,GAAG,QAAQ,QAAQ,CAAC,aAAa,EAAE,CAAC;YACpD,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,CAAC,aAAa,CAAC,CAAC;YACzD,YAAY,CAAC;gBACX,MAAM,EAAE,MAAM;gBACd,IAAI,EAAE,UAAU;gBAChB,QAAQ,EAAE,YAAY;gBACtB,MAAM,EAAE,GAAG;gBACX,UAAU,EAAE,iCAAiC;gBAC7C,SAAS,EAAE,GAAG;aACf,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,WAAW,OAAO,CAAC,EAAE,EAAE,CAAC;QACvC,YAAY,CAAC,IAAI,CAAC;YAChB,EAAE,EAAE,MAAM;YACV,QAAQ,EAAE,SAAS;YACnB,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC;YACxC,YAAY,EAAE,qBAAqB,CAAC,OAAO,CAAC;YAC5C,WAAW,EAAE,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC;YAC1C,cAAc,EAAE,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,WAAW,IAAI,GAAG;YAC/D,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC;gBAC3B,IAAI,EAAE,OAAO,CAAC,IAAI;gBAClB,SAAS,EAAE,OAAO,CAAC,SAAS;gBAC5B,MAAM,EAAE,OAAO,CAAC,MAAM;aACvB,CAAC;YACF,SAAS,EAAE,OAAO,CAAC,WAAW,IAAI,GAAG;YACrC,SAAS,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI;SACrC,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAEjD,wEAAwE;QACxE,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAClD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,MAAM,UAAU,GAAG,QAAQ,MAAM,EAAE,CAAC;gBACpC,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;gBACzC,YAAY,CAAC;oBACX,MAAM,EAAE,MAAM;oBACd,IAAI,EAAE,UAAU;oBAChB,QAAQ,EAAE,cAAc;oBACxB,MAAM,EAAE,GAAG;oBACX,UAAU,EAAE,mCAAmC;oBAC/C,SAAS,EAAE,GAAG;iBACf,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,YAAY,QAAQ,CAAC,EAAE,EAAE,CAAC;QACzC,YAAY,CAAC,IAAI,CAAC;YAChB,EAAE,EAAE,MAAM;YACV,QAAQ,EAAE,UAAU;YACpB,KAAK,EAAE,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC;YACzC,YAAY,EAAE,sBAAsB,CAAC,QAAQ,CAAC;YAC9C,WAAW,EAAE,YAAY,CAAC,QAAQ,CAAC,OAAO,GAAG,CAAC,QAAQ,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;YACrE,cAAc,EAAE,QAAQ,CAAC,SAAS,IAAI,QAAQ,CAAC,SAAS,IAAI,GAAG;YAC/D,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC;gBAC3B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,MAAM,EAAE,QAAQ,CAAC,MAAM;aACxB,CAAC;YACF,SAAS,EAAE,QAAQ,CAAC,SAAS,IAAI,GAAG;YACpC,SAAS,EAAE,QAAQ,CAAC,SAAS,IAAI,IAAI;SACtC,CAAC,CAAC;QACH,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,6EAA6E;IAC7E,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,eAAe,WAAW,CAAC,EAAE,EAAE,CAAC;QAC/C,MAAM,WAAW,GACf,WAAW,CAAC,KAAK,IAAI,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,sBAAsB,CAAC;QAC1F,YAAY,CAAC,IAAI,CAAC;YAChB,EAAE,EAAE,MAAM;YACV,QAAQ,EAAE,aAAa;YACvB,KAAK,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC;YACpC,YAAY,EAAE,yBAAyB,CAAC,WAAW,CAAC;YACpD,WAAW,EACT,WAAW,CAAC,WAAW,IAAI,YAAY,CAAC,WAAW,CAAC,SAAS,IAAI,WAAW,CAAC,KAAK,IAAI,EAAE,CAAC;YAC3F,cAAc,EAAE,WAAW,CAAC,SAAS,IAAI,WAAW,CAAC,SAAS,IAAI,GAAG;YACrE,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC;gBAC3B,UAAU,EAAE,WAAW,CAAC,UAAU;gBAClC,KAAK,EAAE,WAAW,CAAC,KAAK;gBACxB,SAAS,EAAE,WAAW,CAAC,eAAe;aACvC,CAAC;YACF,SAAS,EAAE,WAAW,CAAC,SAAS,IAAI,GAAG;YACvC,SAAS,EAAE,WAAW,CAAC,SAAS,IAAI,IAAI;SACzC,CAAC,CAAC;QACH,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAEzD,yCAAyC;QACzC,IAAI,WAAW,CAAC,eAAe,EAAE,CAAC;YAChC,MAAM,aAAa,GAAG,WAAW,WAAW,CAAC,eAAe,EAAE,CAAC;YAC/D,YAAY,CACV,aAAa,EACb,SAAS,EACT,WAAW,WAAW,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAC1D,CAAC;YACF,YAAY,CAAC;gBACX,MAAM,EAAE,MAAM;gBACd,IAAI,EAAE,aAAa;gBACnB,QAAQ,EAAE,aAAa;gBACvB,MAAM,EAAE,GAAG;gBACX,UAAU,EAAE,sCAAsC;gBAClD,SAAS,EAAE,GAAG;aACf,CAAC,CAAC;QACL,CAAC;QAED,2CAA2C;QAC3C,MAAM,QAAQ,GAAG,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,QAAQ,EAAE,WAAW,CAAC,SAAS,CAAC;aAC9E,MAAM,CAAC,OAAO,CAAC;aACf,IAAI,CAAC,GAAG,CAAC,CAAC;QACb,MAAM,QAAQ,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;QAC3C,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,MAAM,UAAU,GAAG,QAAQ,MAAM,EAAE,CAAC;YACpC,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACzC,YAAY,CAAC;gBACX,MAAM,EAAE,MAAM;gBACd,IAAI,EAAE,UAAU;gBAChB,QAAQ,EAAE,YAAY;gBACtB,MAAM,EAAE,GAAG;gBACX,UAAU,EAAE,oCAAoC;gBAChD,SAAS,EAAE,GAAG;aACf,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,UAAU,MAAM,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,iBAAiB,CAAC;QAC3E,YAAY,CAAC,IAAI,CAAC;YAChB,EAAE,EAAE,MAAM;YACV,QAAQ,EAAE,QAAQ;YAClB,KAAK,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC;YACpC,YAAY,EAAE,GAAG;YACjB,WAAW,EAAE,YAAY,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;YAC/C,cAAc,EAAE,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,SAAS,IAAI,GAAG;YAC3D,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC;gBAC3B,MAAM,EAAE,MAAM,CAAC,MAAM;gBACrB,QAAQ,EAAE,MAAM,CAAC,QAAQ;gBACzB,KAAK,EAAE,MAAM,CAAC,KAAK;aACpB,CAAC;YACF,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,GAAG;YAClC,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,IAAI;SACpC,CAAC,CAAC;QACH,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAE/C,iDAAiD;QACjD,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACjD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,MAAM,UAAU,GAAG,QAAQ,MAAM,EAAE,CAAC;gBACpC,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;gBACzC,YAAY,CAAC;oBACX,MAAM,EAAE,MAAM;oBACd,IAAI,EAAE,UAAU;oBAChB,QAAQ,EAAE,YAAY;oBACtB,MAAM,EAAE,GAAG;oBACX,UAAU,EAAE,kCAAkC;oBAC9C,SAAS,EAAE,GAAG;iBACf,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,MAAM,UAAU,GAAG,EAAE,CAAC;IAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;QACzD,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;QACpD,MAAM,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,mBAAmB,EAAE,CAAC;QAChF,aAAa,IAAI,KAAK,CAAC,MAAM,CAAC;IAChC,CAAC;IAED,mBAAmB;IACnB,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC;IAEjC,8EAA8E;IAC9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;QACzD,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;QACpD,MAAM,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,mBAAmB,EAAE,CAAC;QAChF,aAAa,IAAI,KAAK,CAAC,MAAM,CAAC;IAChC,CAAC;IAED,6EAA6E;IAC7E,MAAM,CAAC,UAAU,EAAE,UAAU,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QACjD,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,WAAW,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACjF,EAAE,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;KAC1F,CAAC,CAAC;IAEH,OAAO;QACL,MAAM,EAAE;YACN,KAAK,EAAE,eAAe;YACtB,KAAK,EAAE,eAAe;YACtB,SAAS,EAAE,SAAS,CAAC,MAAM;YAC3B,QAAQ,EAAE,QAAQ,CAAC,MAAM;YACzB,SAAS,EAAE,SAAS,CAAC,MAAM;YAC3B,YAAY,EAAE,YAAY,CAAC,MAAM;YACjC,WAAW,EAAE,WAAW,CAAC,MAAM;SAChC;QACD,KAAK,EAAE;YACL,KAAK,EAAE,UAAU,CAAC,MAAM;YACxB,KAAK,EAAE,UAAU,CAAC,MAAM;SACzB;QACD,aAAa;QACb,aAAa;QACb,YAAY;QACZ,MAAM;KACP,CAAC;AACJ,CAAC"}

package/dist/memory/brain-consolidator.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Brain Consolidator — contradiction detection for the CLEO BRAIN memory system.
+ *
+ * Implements heuristic contradiction detection based on keyword polarity flip.
+ * No LLM required — uses negation markers to identify entries that assert
+ * opposing claims about the same subject.
+ *
+ * When a contradiction is detected:
+ *   1. A 'contradicts' edge is created in brain_page_edges (both directions).
+ *   2. The lower-quality entry's qualityScore is reduced by 0.15.
+ *
+ * All operations are BEST-EFFORT — failures never crash the consolidator.
+ *
+ * @task T549 Wave 3-C
+ * @epic T549
+ */
+/** A detected contradiction between two memory entries. */
+export interface ContradictionResult {
+    /** ID of the first entry in the contradiction pair. */
+    entryAId: string;
+    /** ID of the second entry in the contradiction pair. */
+    entryBId: string;
+    /** Which entry was considered the "contradicted" one (lower quality). */
+    contradictedId: string;
+    /** Table name where the entries live. */
+    table: string;
+    /** Shared keywords that connected the two entries. */
+    sharedKeywords: string[];
+    /** Negation markers found in one of the entries. */
+    negationMarkers: string[];
+}
+/**
+ * Detect contradiction pairs across all verified memory entries.
+ *
+ * For each verified entry:
+ *   1. Find entries with >= MIN_SHARED_KEYWORDS shared keywords.
+ *   2. Check for negation markers in one but not the other.
+ *   3. If contradiction detected: create 'contradicts' graph edges.
+ *   4. Lower quality score of the contradicted (lower quality) entry by 0.15.
+ *
+ * Only considers entries where invalid_at IS NULL (currently valid).
+ * Short-circuits after 50 contradiction pairs to limit consolidation cost.
+ *
+ * @param projectRoot - Project root directory for brain.db resolution
+ * @returns List of contradiction pairs found
+ */
+export declare function detectContradictions(projectRoot: string): Promise<ContradictionResult[]>;
+//# sourceMappingURL=brain-consolidator.d.ts.map

package/dist/memory/brain-consolidator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"brain-consolidator.d.ts","sourceRoot":"","sources":["../../src/memory/brain-consolidator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AASH,2DAA2D;AAC3D,MAAM,WAAW,mBAAmB;IAClC,uDAAuD;IACvD,QAAQ,EAAE,MAAM,CAAC;IACjB,wDAAwD;IACxD,QAAQ,EAAE,MAAM,CAAC;IACjB,yEAAyE;IACzE,cAAc,EAAE,MAAM,CAAC;IACvB,yCAAyC;IACzC,KAAK,EAAE,MAAM,CAAC;IACd,sDAAsD;IACtD,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,oDAAoD;IACpD,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B;AA+ID;;;;;;;;;;;;;;GAcG;AACH,wBAAsB,oBAAoB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAoI9F"}