stellar-memory 0.5.0

package/dist/engine/conflict.js

@@ -0,0 +1,322 @@
+/**
+ * conflict.ts — Conflict Detection engine
+ *
+ * Finds contradictions between memories. When a new memory is stored,
+ * this module checks existing memories for semantic conflicts and creates
+ * MemoryConflict records for any detected issues.
+ *
+ * Detection is purely local — no LLM required. Heuristics use keyword
+ * overlap, negation patterns, and opposing action verbs.
+ *
+ * All functions are pure (no classes), following the project style.
+ */
+import { randomUUID } from 'node:crypto';
+import { searchMemories, createConflict as queriesCreateConflict, getConflicts, resolveConflict as queriesResolveConflict, } from '../storage/queries.js';
+import { getDatabase } from '../storage/database.js';
+import { supersedeMemory, extractKeyTerms } from './temporal.js';
+import { createLogger } from '../utils/logger.js';
+const log = createLogger('conflict');
+// ---------------------------------------------------------------------------
+// detectConflicts
+// ---------------------------------------------------------------------------
+/**
+ * Check for conflicts when storing a new memory.
+ *
+ * Searches for up to 5 similar existing memories via FTS5, then analyzes
+ * each pair for semantic contradictions. Detected conflicts are persisted
+ * and returned to the caller.
+ */
+export async function detectConflicts(newMemory, project) {
+    // Build a representative search query from the new memory's content + tags
+    const queryTerms = [
+        newMemory.summary,
+        ...newMemory.tags,
+    ].join(' ').trim() || newMemory.content.slice(0, 100);
+    const candidates = searchMemories(project, queryTerms, 5);
+    const conflicts = [];
+    for (const candidate of candidates) {
+        // Skip self-comparison and already-superseded memories
+        if (candidate.id === newMemory.id)
+            continue;
+        if (candidate.superseded_by)
+            continue;
+        if (candidate.deleted_at)
+            continue;
+        const analysis = analyzeConflict(newMemory.content, candidate.content);
+        if (!analysis.isConflict)
+            continue;
+        // Further boost to high severity when both are 'decision' type
+        const severity = newMemory.type === 'decision' && candidate.type === 'decision'
+            ? 'high'
+            : analysis.severity;
+        const conflict = {
+            id: randomUUID(),
+            memory_id: newMemory.id,
+            conflicting_memory_id: candidate.id,
+            severity,
+            description: analysis.reason,
+            status: 'open',
+            project,
+            created_at: new Date().toISOString(),
+        };
+        queriesCreateConflict(conflict);
+        conflicts.push(conflict);
+        log.debug('Conflict detected', {
+            newId: newMemory.id,
+            existingId: candidate.id,
+            severity,
+            reason: analysis.reason,
+        });
+    }
+    return conflicts;
+}
+// ---------------------------------------------------------------------------
+// analyzeConflict — local heuristics, no LLM
+// ---------------------------------------------------------------------------
+/**
+ * Analyze whether two memory contents contradict each other.
+ *
+ * Checks:
+ *   1. Shared key terms (minimum overlap threshold)
+ *   2. Negation of action verbs around shared terms
+ *   3. Opposing choice signals ("chose X" vs "chose Y" for same topic)
+ *   4. "Switched from X to Y" patterns (X = existing tech)
+ */
+function analyzeConflict(newContent, existingContent) {
+    const newLower = newContent.toLowerCase();
+    const existingLower = existingContent.toLowerCase();
+    const newTerms = extractKeyTerms(newLower);
+    const existingTerms = extractKeyTerms(existingLower);
+    const sharedTerms = intersection(newTerms, existingTerms);
+    // Not enough shared context to conflict
+    if (sharedTerms.size === 0) {
+        return { isConflict: false, severity: 'low', reason: '' };
+    }
+    const overlapRatio = sharedTerms.size / Math.min(newTerms.size, existingTerms.size);
+    if (overlapRatio < 0.2) {
+        return { isConflict: false, severity: 'low', reason: '' };
+    }
+    // Check "switched from X" — X appears in existing
+    const switchMatch = newLower.match(/switched?\s+from\s+(\w+)/i)
+        ?? newLower.match(/migrat\w+\s+from\s+(\w+)/i)
+        ?? newLower.match(/replac\w+\s+(\w+)/i)
+        ?? newLower.match(/no\s+longer\s+using?\s+(\w+)/i);
+    if (switchMatch) {
+        const switchedFrom = switchMatch[1].toLowerCase();
+        if (existingLower.includes(switchedFrom)) {
+            return {
+                isConflict: true,
+                severity: 'high',
+                reason: `New memory indicates switching away from "${switchedFrom}" which appears in existing memory`,
+            };
+        }
+    }
+    // Check opposing action verbs around shared terms
+    const negationResult = checkNegationConflict(newLower, existingLower, sharedTerms);
+    if (negationResult.isConflict)
+        return negationResult;
+    // Check opposing choice signals ("chose X" / "selected X" vs "chose Y")
+    const choiceResult = checkChoiceConflict(newLower, existingLower);
+    if (choiceResult.isConflict)
+        return choiceResult;
+    // Check enable/disable toggles
+    const toggleResult = checkToggleConflict(newLower, existingLower, sharedTerms);
+    if (toggleResult.isConflict)
+        return toggleResult;
+    return { isConflict: false, severity: 'low', reason: '' };
+}
+/**
+ * Check if one text negates an action verb that appears with a shared term in the other.
+ * E.g., "use Redis" (existing) vs "not use Redis" (new).
+ */
+function checkNegationConflict(newLower, existingLower, sharedTerms) {
+    const POSITIVE_VERBS = ['use', 'enable', 'add', 'adopt', 'choose', 'select', 'implement', 'deploy'];
+    const NEGATION_PREFIXES = ['not ', "don't ", "do not ", 'avoid ', 'stop ', 'remove ', 'disable ', 'never '];
+    for (const term of sharedTerms) {
+        for (const verb of POSITIVE_VERBS) {
+            const positivePattern = `${verb} ${term}`;
+            const existingPositive = existingLower.includes(positivePattern);
+            const newNegative = NEGATION_PREFIXES.some(neg => newLower.includes(neg + verb + ' ' + term));
+            if (existingPositive && newNegative) {
+                return {
+                    isConflict: true,
+                    severity: 'medium',
+                    reason: `Existing memory says "${positivePattern}", new memory negates this`,
+                };
+            }
+            const newPositive = newLower.includes(positivePattern);
+            const existingNegative = NEGATION_PREFIXES.some(neg => existingLower.includes(neg + verb + ' ' + term));
+            if (newPositive && existingNegative) {
+                return {
+                    isConflict: true,
+                    severity: 'medium',
+                    reason: `New memory says "${positivePattern}", but existing memory negates this`,
+                };
+            }
+        }
+    }
+    return { isConflict: false, severity: 'low', reason: '' };
+}
+/**
+ * Check for opposing choice signals.
+ * Detects: "chose/selected/decided on X" in one vs "chose/selected/decided on Y" in other.
+ */
+function checkChoiceConflict(newLower, existingLower) {
+    const CHOICE_VERBS = ['chose', 'selected', 'decided on', 'picked', 'went with'];
+    const extractChoiceTarget = (text) => {
+        for (const verb of CHOICE_VERBS) {
+            const idx = text.indexOf(verb);
+            if (idx === -1)
+                continue;
+            const after = text.slice(idx + verb.length).trim();
+            const token = after.match(/^(\w+)/)?.[1];
+            if (token && token.length >= 3)
+                return token;
+        }
+        return null;
+    };
+    const newChoice = extractChoiceTarget(newLower);
+    const existingChoice = extractChoiceTarget(existingLower);
+    if (newChoice && existingChoice && newChoice !== existingChoice) {
+        return {
+            isConflict: true,
+            severity: 'high',
+            reason: `Conflicting decisions: existing chose "${existingChoice}", new chose "${newChoice}"`,
+        };
+    }
+    return { isConflict: false, severity: 'low', reason: '' };
+}
+/**
+ * Check for enable/disable or add/remove toggle conflicts on shared terms.
+ */
+function checkToggleConflict(newLower, existingLower, sharedTerms) {
+    const TOGGLE_PAIRS = [
+        ['enabled', 'disabled'],
+        ['enable', 'disable'],
+        ['activated', 'deactivated'],
+        ['on', 'off'],
+    ];
+    for (const term of sharedTerms) {
+        for (const [pos, neg] of TOGGLE_PAIRS) {
+            const existingPos = existingLower.includes(`${pos} ${term}`) || existingLower.includes(`${term} ${pos}`);
+            const newNeg = newLower.includes(`${neg} ${term}`) || newLower.includes(`${term} ${neg}`);
+            if (existingPos && newNeg) {
+                return {
+                    isConflict: true,
+                    severity: 'medium',
+                    reason: `Toggle conflict on "${term}": existing has "${pos}", new has "${neg}"`,
+                };
+            }
+            const newPos = newLower.includes(`${pos} ${term}`) || newLower.includes(`${term} ${pos}`);
+            const existingNeg = existingLower.includes(`${neg} ${term}`) || existingLower.includes(`${term} ${neg}`);
+            if (newPos && existingNeg) {
+                return {
+                    isConflict: true,
+                    severity: 'medium',
+                    reason: `Toggle conflict on "${term}": new has "${pos}", existing has "${neg}"`,
+                };
+            }
+        }
+    }
+    return { isConflict: false, severity: 'low', reason: '' };
+}
+// ---------------------------------------------------------------------------
+// autoResolveConflict
+// ---------------------------------------------------------------------------
+/**
+ * Attempt to auto-resolve a conflict without user intervention.
+ *
+ * Auto-resolves when the newer memory clearly supersedes the older one:
+ *   - The conflict memory was created after the conflicting memory
+ *   - Severity is high (strong signal of supersession)
+ *
+ * Returns true if resolved (and calls temporal.supersedeMemory),
+ * or false if user decision is needed.
+ */
+export function autoResolveConflict(conflict) {
+    if (conflict.severity !== 'high')
+        return false;
+    // We auto-resolve only when the conflict description contains a switch signal
+    const switchSignals = ['switching away from', 'switched away from', 'conflicting decisions'];
+    const hasSwitch = switchSignals.some(s => conflict.description.toLowerCase().includes(s));
+    if (!hasSwitch)
+        return false;
+    // newMemory (memory_id) supersedes the existing (conflicting_memory_id)
+    supersedeMemory(conflict.conflicting_memory_id, conflict.memory_id);
+    queriesResolveConflict(conflict.id, `Auto-resolved: memory ${conflict.memory_id} supersedes ${conflict.conflicting_memory_id}`);
+    log.debug('Conflict auto-resolved', { conflictId: conflict.id });
+    return true;
+}
+// ---------------------------------------------------------------------------
+// formatConflictWarnings
+// ---------------------------------------------------------------------------
+/**
+ * Format conflict warnings as human-readable text.
+ *
+ * Returns a warning string listing each conflict with memory summaries.
+ * Designed to be returned to the user as part of a remember tool response.
+ */
+export function formatConflictWarnings(conflicts) {
+    if (conflicts.length === 0)
+        return '';
+    const lines = ['Warning: potential memory conflicts detected:'];
+    for (const conflict of conflicts) {
+        const severityLabel = conflict.severity.toUpperCase();
+        lines.push(`  [${severityLabel}] Memory ${conflict.memory_id.slice(0, 8)} conflicts with ` +
+            `${conflict.conflicting_memory_id.slice(0, 8)}: ${conflict.description}`);
+    }
+    lines.push('Use resolveConflict() to dismiss or supersede the older memory.');
+    return lines.join('\n');
+}
+// ---------------------------------------------------------------------------
+// getUnresolvedConflicts
+// ---------------------------------------------------------------------------
+/**
+ * Return all open (unresolved) conflicts for a project.
+ */
+export function getUnresolvedConflicts(project) {
+    return getConflicts(project, 'open');
+}
+// ---------------------------------------------------------------------------
+// resolveConflict
+// ---------------------------------------------------------------------------
+/**
+ * Resolve a conflict manually.
+ *
+ * Actions:
+ *   - 'supersede': mark resolved and call temporal.supersedeMemory()
+ *                  (conflicting_memory_id superseded by memory_id)
+ *   - 'dismiss':   mark resolved without any memory changes
+ *   - 'keep_both': mark resolved with a note that both are intentionally kept
+ */
+export function resolveConflict(conflictId, resolution, action = 'dismiss') {
+    // We need the conflict details to call supersedeMemory if needed.
+    // Fetch it via getConflicts (no direct getConflictById, but we can filter).
+    // Since we only need it for supersede, we'll proceed directly.
+    if (action === 'supersede') {
+        const db = getDatabase();
+        const row = db.prepare(`SELECT memory_id, conflicting_memory_id FROM memory_conflicts WHERE id = ?`).get(conflictId);
+        if (row) {
+            supersedeMemory(row.conflicting_memory_id, row.memory_id);
+        }
+    }
+    const resolutionNote = action === 'keep_both'
+        ? `[keep_both] ${resolution}`
+        : action === 'dismiss'
+            ? `[dismissed] ${resolution}`
+            : `[superseded] ${resolution}`;
+    queriesResolveConflict(conflictId, resolutionNote);
+    log.debug('Conflict resolved', { conflictId, action, resolution });
+}
+// ---------------------------------------------------------------------------
+// Internal utilities
+// ---------------------------------------------------------------------------
+function intersection(a, b) {
+    const result = new Set();
+    for (const item of a) {
+        if (b.has(item))
+            result.add(item);
+    }
+    return result;
+}
+//# sourceMappingURL=conflict.js.map

package/dist/engine/conflict.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict.js","sourceRoot":"","sources":["../../src/engine/conflict.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EACL,cAAc,EACd,cAAc,IAAI,qBAAqB,EACvC,YAAY,EACZ,eAAe,IAAI,sBAAsB,GAC1C,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAEjE,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,MAAM,GAAG,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;AAYrC,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,SAAiB,EACjB,OAAe;IAEf,2EAA2E;IAC3E,MAAM,UAAU,GAAG;QACjB,SAAS,CAAC,OAAO;QACjB,GAAG,SAAS,CAAC,IAAI;KAClB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAEtD,MAAM,UAAU,GAAG,cAAc,CAAC,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,SAAS,GAAqB,EAAE,CAAC;IAEvC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,uDAAuD;QACvD,IAAI,SAAS,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE;YAAE,SAAS;QAC5C,IAAI,SAAS,CAAC,aAAa;YAAE,SAAS;QACtC,IAAI,SAAS,CAAC,UAAU;YAAE,SAAS;QAEnC,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC;QACvE,IAAI,CAAC,QAAQ,CAAC,UAAU;YAAE,SAAS;QAEnC,+DAA+D;QAC/D,MAAM,QAAQ,GACZ,SAAS,CAAC,IAAI,KAAK,UAAU,IAAI,SAAS,CAAC,IAAI,KAAK,UAAU;YAC5D,CAAC,CAAC,MAAM;YACR,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAExB,MAAM,QAAQ,GAAmB;YAC/B,EAAE,EAAE,UAAU,EAAE;YAChB,SAAS,EAAE,SAAS,CAAC,EAAE;YACvB,qBAAqB,EAAE,SAAS,CAAC,EAAE;YACnC,QAAQ;YACR,WAAW,EAAE,QAAQ,CAAC,MAAM;YAC5B,MAAM,EAAE,MAAM;YACd,OAAO;YACP,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;QAEF,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAChC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEzB,GAAG,CAAC,KAAK,CAAC,mBAAmB,EAAE;YAC7B,KAAK,EAAE,SAAS,CAAC,EAAE;YACnB,UAAU,EAAE,SAAS,CAAC,EAAE;YACxB,QAAQ;YACR,MAAM,EAAE,QAAQ,CAAC,MAAM;SACxB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,8EAA8E;AAC9E,6CAA6C;AAC7C,8EAA8E;AAE9E;;;;;;;;GAQG;AACH,SAAS,eAAe,CAAC,UAAkB,EAAE,eAAuB;IAClE,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;IAC1C,MAAM,aAAa,GAAG,eAAe,CAAC,WAAW,EAAE,CAAC;IAEpD,MAAM,QAAQ,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC3C,MAAM,aAAa,GAAG,eAAe,CAAC,aAAa,CAAC,CAAC;IAErD,MAAM,WAAW,GAAG,YAAY,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAE1D,wCAAwC;IACxC,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAC5D,CAAC;IAED,MAAM,YAAY,GAAG,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;IACpF,IAAI,YAAY,GAAG,GAAG,EAAE,CAAC;QACvB,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAC5D,CAAC;IAED,kDAAkD;IAClD,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,2BAA2B,CAAC;WAC1D,QAAQ,CAAC,KAAK,CAAC,2BAA2B,CAAC;WAC3C,QAAQ,CAAC,KAAK,CAAC,oBAAoB,CAAC;WACpC,QAAQ,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;IAErD,IAAI,WAAW,EAAE,CAAC;QAChB,MAAM,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QAClD,IAAI,aAAa,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;YACzC,OAAO;gBACL,UAAU,EAAE,IAAI;gBAChB,QAAQ,EAAE,MAAM;gBAChB,MAAM,EAAE,6CAA6C,YAAY,oCAAoC;aACtG,CAAC;QACJ,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,MAAM,cAAc,GAAG,qBAAqB,CAAC,QAAQ,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;IACnF,IAAI,cAAc,CAAC,UAAU;QAAE,OAAO,cAAc,CAAC;IAErD,wEAAwE;IACxE,MAAM,YAAY,GAAG,mBAAmB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAClE,IAAI,YAAY,CAAC,UAAU;QAAE,OAAO,YAAY,CAAC;IAEjD,+BAA+B;IAC/B,MAAM,YAAY,GAAG,mBAAmB,CAAC,QAAQ,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;IAC/E,IAAI,YAAY,CAAC,UAAU;QAAE,OAAO,YAAY,CAAC;IAEjD,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAC5D,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAC5B,QAAgB,EAChB,aAAqB,EACrB,WAAwB;IAExB,MAAM,cAAc,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;IACpG,MAAM,iBAAiB,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;IAE5G,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;YAClC,MAAM,eAAe,GAAG,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC;YAE1C,MAAM,gBAAgB,GAAG,aAAa,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YACjE,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC;YAE9F,IAAI,gBAAgB,IAAI,WAAW,EAAE,CAAC;gBACpC,OAAO;oBACL,UAAU,EAAE,IAAI;oBAChB,QAAQ,EAAE,QAAQ;oBAClB,MAAM,EAAE,yBAAyB,eAAe,4BAA4B;iBAC7E,CAAC;YACJ,CAAC;YAED,MAAM,WAAW,GAAG,QAAQ,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YACvD,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC;YAExG,IAAI,WAAW,IAAI,gBAAgB,EAAE,CAAC;gBACpC,OAAO;oBACL,UAAU,EAAE,IAAI;oBAChB,QAAQ,EAAE,QAAQ;oBAClB,MAAM,EAAE,oBAAoB,eAAe,qCAAqC;iBACjF,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAC5D,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAAC,QAAgB,EAAE,aAAqB;IAClE,MAAM,YAAY,GAAG,CAAC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;IAEhF,MAAM,mBAAmB,GAAG,CAAC,IAAY,EAAiB,EAAE;QAC1D,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,SAAS;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;YACnD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC/C,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC;IAChD,MAAM,cAAc,GAAG,mBAAmB,CAAC,aAAa,CAAC,CAAC;IAE1D,IAAI,SAAS,IAAI,cAAc,IAAI,SAAS,KAAK,cAAc,EAAE,CAAC;QAChE,OAAO;YACL,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,MAAM;YAChB,MAAM,EAAE,0CAA0C,cAAc,iBAAiB,SAAS,GAAG;SAC9F,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAC5D,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAC1B,QAAgB,EAChB,aAAqB,EACrB,WAAwB;IAExB,MAAM,YAAY,GAA4B;QAC5C,CAAC,SAAS,EAAE,UAAU,CAAC;QACvB,CAAC,QAAQ,EAAE,SAAS,CAAC;QACrB,CAAC,WAAW,EAAE,aAAa,CAAC;QAC5B,CAAC,IAAI,EAAE,KAAK,CAAC;KACd,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,YAAY,EAAE,CAAC;YACtC,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,IAAI,aAAa,CAAC,QAAQ,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC;YACzG,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC;YAE1F,IAAI,WAAW,IAAI,MAAM,EAAE,CAAC;gBAC1B,OAAO;oBACL,UAAU,EAAE,IAAI;oBAChB,QAAQ,EAAE,QAAQ;oBAClB,MAAM,EAAE,uBAAuB,IAAI,oBAAoB,GAAG,eAAe,GAAG,GAAG;iBAChF,CAAC;YACJ,CAAC;YAED,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC;YAC1F,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,IAAI,aAAa,CAAC,QAAQ,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC;YAEzG,IAAI,MAAM,IAAI,WAAW,EAAE,CAAC;gBAC1B,OAAO;oBACL,UAAU,EAAE,IAAI;oBAChB,QAAQ,EAAE,QAAQ;oBAClB,MAAM,EAAE,uBAAuB,IAAI,eAAe,GAAG,oBAAoB,GAAG,GAAG;iBAChF,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAC5D,CAAC;AAED,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAAwB;IAC1D,IAAI,QAAQ,CAAC,QAAQ,KAAK,MAAM;QAAE,OAAO,KAAK,CAAC;IAE/C,8EAA8E;IAC9E,MAAM,aAAa,GAAG,CAAC,qBAAqB,EAAE,oBAAoB,EAAE,uBAAuB,CAAC,CAAC;IAC7F,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,IAAI,CAAC,SAAS;QAAE,OAAO,KAAK,CAAC;IAE7B,wEAAwE;IACxE,eAAe,CAAC,QAAQ,CAAC,qBAAqB,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;IAEpE,sBAAsB,CACpB,QAAQ,CAAC,EAAE,EACX,yBAAyB,QAAQ,CAAC,SAAS,eAAe,QAAQ,CAAC,qBAAqB,EAAE,CAC3F,CAAC;IAEF,GAAG,CAAC,KAAK,CAAC,wBAAwB,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;IACjE,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8EAA8E;AAC9E,yBAAyB;AACzB,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CAAC,SAA2B;IAChE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEtC,MAAM,KAAK,GAAa,CAAC,+CAA+C,CAAC,CAAC;IAE1E,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;QACtD,KAAK,CAAC,IAAI,CACR,MAAM,aAAa,YAAY,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,kBAAkB;YAC/E,GAAG,QAAQ,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,WAAW,EAAE,CACzE,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,iEAAiE,CAAC,CAAC;IAC9E,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,8EAA8E;AAC9E,yBAAyB;AACzB,8EAA8E;AAE9E;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAe;IACpD,OAAO,YAAY,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;AACvC,CAAC;AAED,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAC7B,UAAkB,EAClB,UAAkB,EAClB,SAAgD,SAAS;IAEzD,kEAAkE;IAClE,4EAA4E;IAC5E,+DAA+D;IAC/D,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CACpB,4EAA4E,CAC7E,CAAC,GAAG,CAAC,UAAU,CAAqE,CAAC;QAEtF,IAAI,GAAG,EAAE,CAAC;YACR,eAAe,CAAC,GAAG,CAAC,qBAAqB,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,MAAM,cAAc,GAClB,MAAM,KAAK,WAAW;QACpB,CAAC,CAAC,eAAe,UAAU,EAAE;QAC7B,CAAC,CAAC,MAAM,KAAK,SAAS;YACtB,CAAC,CAAC,eAAe,UAAU,EAAE;YAC7B,CAAC,CAAC,gBAAgB,UAAU,EAAE,CAAC;IAEnC,sBAAsB,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;IACnD,GAAG,CAAC,KAAK,CAAC,mBAAmB,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;AACrE,CAAC;AAED,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E,SAAS,YAAY,CAAC,CAAc,EAAE,CAAc;IAClD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/engine/consolidation.d.ts

@@ -0,0 +1,83 @@
+/**
+ * consolidation.ts — Memory Consolidation ("Orbital Resonance")
+ *
+ * Finds groups of similar memories and merges them into richer, more
+ * comprehensive memories. Similar to how planets form from smaller bodies
+ * (planetesimals) combining in orbital resonance.
+ *
+ * Algorithm:
+ *   1. Load all memories in a project.
+ *   2. Group memories that share the same type and are within ±3 AU of each
+ *      other, with cosine similarity > 0.80 between their embeddings.
+ *      Falls back to Jaccard-based text similarity when embeddings are absent.
+ *   3. For each qualifying group (2+ memories):
+ *      - Merge content by deduplicating sentences.
+ *      - Create a new consolidated memory.
+ *      - Mark sources as consolidated and push them to the Oort cloud.
+ */
+import type { Memory } from './types.js';
+/**
+ * Deduplicate an array of sentences using Jaccard similarity.
+ *
+ * For each new sentence, if it is too similar to one already kept (above
+ * JACCARD_DEDUP_THRESHOLD), keep the longer/more detailed version and discard
+ * the other.
+ *
+ * Returns the deduplicated array of sentences in original order.
+ */
+export declare function deduplicateSentences(sentences: string[]): string[];
+/**
+ * Find groups of memories that are candidates for consolidation.
+ *
+ * Criteria for grouping:
+ *   - Same type
+ *   - Within ±3 AU of each other (distance)
+ *   - Cosine similarity > 0.80 (falls back to Jaccard if no embeddings)
+ *
+ * Returns groups sorted by average similarity (highest first).
+ * Each group contains 2+ memories.
+ */
+export declare function findConsolidationCandidates(project: string): Promise<Array<{
+    memories: Memory[];
+    similarity: number;
+}>>;
+/**
+ * Consolidate a group of memories into a single new memory.
+ *
+ * Merge strategy:
+ *   - Content: Combine unique sentences from all sources (Jaccard dedup).
+ *   - Summary: Join all source summaries, deduplicated and truncated.
+ *   - Tags: Union of all tags.
+ *   - Type: Most important type by TYPE_PRIORITY ranking.
+ *   - Impact: Max of all sources.
+ *   - Distance: Min of all sources (closest orbit).
+ *
+ * After creating the new memory:
+ *   - Source memories are marked as consolidated (consolidated_into set).
+ *   - Source memories are pushed to the Oort cloud (distance = 95).
+ *
+ * Returns the newly created consolidated memory.
+ */
+export declare function consolidateGroup(memories: Memory[], project: string): Memory;
+/**
+ * Run a full consolidation pass for a project.
+ *
+ * Finds all candidate groups, consolidates each one, and returns statistics.
+ */
+export declare function runConsolidation(project: string): Promise<{
+    groupsFound: number;
+    memoriesConsolidated: number;
+    newMemoriesCreated: number;
+}>;
+/**
+ * Return the source memories that were merged into the given memory ID.
+ * Returns an empty array if this memory was not created by consolidation.
+ */
+export declare function getConsolidationSources(memoryId: string): Memory[];
+/**
+ * Generate and compare embeddings for two text strings.
+ * Returns cosine similarity in [0, 1].
+ * Used internally when stored embeddings are unavailable.
+ */
+export declare function computeEmbeddingSimilarity(textA: string, textB: string): Promise<number>;
+//# sourceMappingURL=consolidation.d.ts.map