stellar-memory 0.5.0

package/dist/engine/constellation.js

@@ -0,0 +1,382 @@
+/**
+ * constellation.ts — Knowledge Graph engine module
+ *
+ * Memories form a "constellation" — a graph where edges represent semantic
+ * and structural relationships between memory planets.
+ *
+ * Relationships are inferred using fast, local keyword heuristics:
+ *   - Type-based rules (error → decision = caused_by, etc.)
+ *   - Contradiction detection (negation/replacement keywords near shared terms)
+ *   - Content reference detection (one memory's text mentions another's keywords)
+ *   - Shared tag overlap (same domain/topic)
+ *   - Default fallback: related_to
+ *
+ * All functions are synchronous except extractRelationships, which is async
+ * because it may use vector similarity as the primary similarity signal.
+ */
+import { randomUUID } from 'node:crypto';
+import { createEdge, getEdges, getConstellation, deleteEdge, getMemoryByIds, searchMemories, } from '../storage/queries.js';
+import { getDatabase } from '../storage/database.js';
+import { generateEmbedding } from './embedding.js';
+import { searchByVector } from '../storage/vec.js';
+import { createLogger } from '../utils/logger.js';
+const log = createLogger('constellation');
+/** Minimum similarity weight required to create an edge. */
+const WEIGHT_THRESHOLD = 0.3;
+/** Maximum number of similar memories to evaluate per new memory. */
+const TOP_K = 5;
+// ---------------------------------------------------------------------------
+// Relationship inference
+// ---------------------------------------------------------------------------
+/**
+ * Negation and replacement signal words. If both memories share a significant
+ * keyword AND one of them contains these signals near that keyword, the
+ * relationship is likely a contradiction.
+ */
+const CONTRADICTION_SIGNALS = [
+    'instead', 'replaced', 'switched', 'no longer', 'not ', "don't", "doesn't",
+    'removed', 'deprecated', 'reverted', 'cancelled', 'abandoned',
+    '대신', '변경', '제거', '취소', '중단', '아님',
+];
+/** Keywords that suggest one memory uses/depends-on another. */
+const DEPENDENCY_SIGNALS = [
+    'uses', 'using', 'depends on', 'requires', 'needs', 'via', 'through',
+    'built on', 'extends', 'imports', 'calls', 'powered by',
+    '사용', '의존', '필요', '통해', '기반',
+];
+/**
+ * Extract significant keywords from text — words longer than 3 characters,
+ * lowercased, de-duplicated, with common stop-words removed.
+ */
+function extractKeywords(text) {
+    const STOP_WORDS = new Set([
+        'the', 'and', 'for', 'that', 'with', 'this', 'from', 'have', 'will',
+        'been', 'when', 'then', 'than', 'into', 'also', 'some', 'more', 'each',
+        'they', 'were', 'their', 'what', 'which', 'about',
+    ]);
+    const words = text
+        .toLowerCase()
+        .replace(/[^a-z0-9가-힣\s]/g, ' ')
+        .split(/\s+/)
+        .filter(w => w.length > 3 && !STOP_WORDS.has(w));
+    return new Set(words);
+}
+/**
+ * Compute the Jaccard-like overlap ratio between two keyword sets.
+ * Returns 0.0–1.0.
+ */
+function keywordOverlap(a, b) {
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let shared = 0;
+    for (const w of a) {
+        if (b.has(w))
+            shared++;
+    }
+    const union = a.size + b.size - shared;
+    return union === 0 ? 0 : shared / union;
+}
+/**
+ * Return true if one content string contains contradiction signals near a
+ * keyword that the other string also contains.
+ */
+function hasContradictionSignals(a, b) {
+    const aLow = a.toLowerCase();
+    const bLow = b.toLowerCase();
+    const keywordsA = extractKeywords(a);
+    const keywordsB = extractKeywords(b);
+    // Find shared keywords
+    const shared = [];
+    for (const w of keywordsA) {
+        if (keywordsB.has(w))
+            shared.push(w);
+    }
+    if (shared.length === 0)
+        return false;
+    // For each shared keyword, check if a contradiction signal appears nearby
+    // in either string (within a 60-character window around the keyword).
+    for (const keyword of shared) {
+        for (const text of [aLow, bLow]) {
+            const idx = text.indexOf(keyword);
+            if (idx === -1)
+                continue;
+            const window = text.slice(Math.max(0, idx - 60), idx + keyword.length + 60);
+            for (const signal of CONTRADICTION_SIGNALS) {
+                if (window.includes(signal))
+                    return true;
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Return true if `sourceContent` references key terms from `targetSummary`.
+ * This indicates a "uses" or "depends_on" relationship.
+ */
+function contentReferences(sourceContent, targetSummary) {
+    const srcLow = sourceContent.toLowerCase();
+    const targetKeywords = extractKeywords(targetSummary);
+    // Must share at least 2 keywords AND have a dependency signal
+    const sharedCount = [...targetKeywords].filter(w => srcLow.includes(w)).length;
+    if (sharedCount < 2)
+        return false;
+    for (const signal of DEPENDENCY_SIGNALS) {
+        if (srcLow.includes(signal))
+            return true;
+    }
+    return false;
+}
+/**
+ * Return true if source and target have meaningful tag overlap (≥ 1 shared tag).
+ */
+function hasSharedTags(source, target) {
+    if (source.tags.length === 0 || target.tags.length === 0)
+        return false;
+    const targetTags = new Set(target.tags.map(t => t.toLowerCase()));
+    return source.tags.some(t => targetTags.has(t.toLowerCase()));
+}
+/**
+ * Infer the most appropriate RelationType between a source and a target memory
+ * using type-based rules and keyword heuristics.
+ */
+function inferRelationType(source, target) {
+    // ── Type-based structural rules ───────────────────────────────────────────
+    if (source.type === 'error' && target.type === 'decision')
+        return 'caused_by';
+    if (source.type === 'decision' && target.type === 'error')
+        return 'caused_by';
+    if (source.type === 'milestone' && target.type === 'task')
+        return 'derived_from';
+    if (source.type === 'task' && target.type === 'milestone')
+        return 'part_of';
+    if (source.type === 'decision' && target.type === 'decision') {
+        if (hasContradictionSignals(source.content, target.content))
+            return 'contradicts';
+        return 'related_to';
+    }
+    if (source.type === 'context' && target.type === 'decision')
+        return 'part_of';
+    // ── Content-based heuristics ──────────────────────────────────────────────
+    if (contentReferences(source.content, target.summary))
+        return 'uses';
+    if (contentReferences(target.content, source.summary))
+        return 'depends_on';
+    if (hasContradictionSignals(source.content, target.content))
+        return 'contradicts';
+    return 'related_to';
+}
+// ---------------------------------------------------------------------------
+// extractRelationships — primary public function
+// ---------------------------------------------------------------------------
+/**
+ * Auto-extract relationships for a newly stored memory.
+ *
+ * Algorithm:
+ *   1. Find the top-K most similar existing memories using vector KNN if
+ *      available, falling back to FTS5 keyword search.
+ *   2. For each candidate, compute a weight (cosine similarity or keyword
+ *      overlap ratio).
+ *   3. Filter candidates below WEIGHT_THRESHOLD.
+ *   4. Infer the relationship type using keyword heuristics.
+ *   5. Persist edges via queries.createEdge().
+ *
+ * Returns the list of edges that were created.
+ */
+export async function extractRelationships(newMemory, project) {
+    const created = [];
+    // ── 1. Candidate retrieval ────────────────────────────────────────────────
+    let candidates = [];
+    try {
+        const db = getDatabase();
+        const queryText = newMemory.content + ' ' + newMemory.summary;
+        const embedding = await generateEmbedding(queryText);
+        const vecResults = searchByVector(db, embedding, TOP_K + 1); // +1 to exclude self
+        const ids = vecResults
+            .map(r => r.memoryId)
+            .filter(id => id !== newMemory.id)
+            .slice(0, TOP_K);
+        if (ids.length > 0) {
+            const memories = getMemoryByIds(ids);
+            const idToDistance = new Map(vecResults.map(r => [r.memoryId, r.distance]));
+            for (const mem of memories) {
+                if (mem.id === newMemory.id)
+                    continue;
+                // sqlite-vec returns L2 distance — convert to a 0–1 similarity score.
+                // L2 distance for unit vectors ranges 0–2; we rescale to [0,1].
+                const l2 = idToDistance.get(mem.id) ?? 2;
+                const similarity = Math.max(0, 1 - l2 / 2);
+                candidates.push({ memory: mem, weight: similarity });
+            }
+        }
+    }
+    catch {
+        // Vector search unavailable — fall back to FTS5
+        log.debug('Vector search unavailable, falling back to FTS5', { memoryId: newMemory.id });
+    }
+    // FTS5 fallback (or supplement when vector returns too few results)
+    if (candidates.length < TOP_K) {
+        const ftsQuery = newMemory.summary || newMemory.content.slice(0, 100);
+        const ftsResults = searchMemories(project, ftsQuery, TOP_K + 1);
+        const existingIds = new Set([newMemory.id, ...candidates.map(c => c.memory.id)]);
+        for (const mem of ftsResults) {
+            if (existingIds.has(mem.id))
+                continue;
+            const srcKw = extractKeywords(newMemory.content);
+            const tgtKw = extractKeywords(mem.content);
+            const weight = keywordOverlap(srcKw, tgtKw);
+            candidates.push({ memory: mem, weight });
+            existingIds.add(mem.id);
+            if (candidates.length >= TOP_K)
+                break;
+        }
+    }
+    // ── 2. Filter + deduplicate ───────────────────────────────────────────────
+    candidates = candidates
+        .filter(c => c.weight >= WEIGHT_THRESHOLD)
+        .sort((a, b) => b.weight - a.weight)
+        .slice(0, TOP_K);
+    // ── 3. Infer & persist edges ──────────────────────────────────────────────
+    const now = new Date().toISOString();
+    for (const { memory: target, weight } of candidates) {
+        const relation = inferRelationType(newMemory, target);
+        const edge = {
+            id: randomUUID(),
+            source_id: newMemory.id,
+            target_id: target.id,
+            relation,
+            weight: Math.round(weight * 1000) / 1000, // round to 3 decimal places
+            project,
+            created_at: now,
+            metadata: {},
+        };
+        try {
+            createEdge(edge);
+            created.push(edge);
+            log.debug('Constellation edge created', {
+                source: newMemory.id,
+                target: target.id,
+                relation,
+                weight: edge.weight,
+            });
+        }
+        catch (err) {
+            log.warn('Failed to create constellation edge', { err, source: newMemory.id, target: target.id });
+        }
+    }
+    return created;
+}
+// ---------------------------------------------------------------------------
+// getConstellationGraph
+// ---------------------------------------------------------------------------
+/**
+ * Return the full constellation graph (nodes + edges) centred on a memory.
+ *
+ * Uses queries.getConstellation() which handles multi-depth BFS traversal
+ * and deduplication internally. Depth defaults to 1 (immediate neighbours).
+ */
+export function getConstellationGraph(memoryId, project, depth = 1) {
+    return getConstellation(memoryId, project, depth);
+}
+// ---------------------------------------------------------------------------
+// findRelatedMemories
+// ---------------------------------------------------------------------------
+/**
+ * Return the top N memories most strongly connected to the given memory,
+ * sorted by edge weight (descending).
+ *
+ * Useful for augmenting recall results with graph-traversal neighbours.
+ */
+export function findRelatedMemories(memoryId, project, limit = 10) {
+    const edges = getEdges(memoryId, project);
+    if (edges.length === 0)
+        return [];
+    // Collect the IDs of connected memories (excluding memoryId itself)
+    const weightById = new Map();
+    for (const edge of edges) {
+        const connectedId = edge.source_id === memoryId ? edge.target_id : edge.source_id;
+        // Keep the highest weight if the same memory appears in multiple edges
+        const existing = weightById.get(connectedId) ?? 0;
+        if (edge.weight > existing) {
+            weightById.set(connectedId, edge.weight);
+        }
+    }
+    // Sort by weight descending, take top N
+    const sortedIds = [...weightById.entries()]
+        .sort((a, b) => b[1] - a[1])
+        .slice(0, limit)
+        .map(([id]) => id);
+    if (sortedIds.length === 0)
+        return [];
+    const memories = getMemoryByIds(sortedIds);
+    // Preserve the weight-sorted order
+    const idOrder = new Map(sortedIds.map((id, i) => [id, i]));
+    return memories.sort((a, b) => (idOrder.get(a.id) ?? 0) - (idOrder.get(b.id) ?? 0));
+}
+// ---------------------------------------------------------------------------
+// suggestRelationships
+// ---------------------------------------------------------------------------
+/**
+ * Suggest potential relationships for an existing memory without persisting them.
+ * Useful for a "review" UI where a user can approve/reject suggestions.
+ *
+ * Returns candidates sorted by confidence (descending).
+ */
+export function suggestRelationships(memoryId, project) {
+    // Get the source memory from the constellation graph (depth 0 = just the node)
+    const { nodes } = getConstellation(memoryId, project, 0);
+    const source = nodes.find(n => n.id === memoryId);
+    if (!source)
+        return [];
+    // Use FTS5 to find candidate memories to evaluate
+    const ftsQuery = source.summary || source.content.slice(0, 100);
+    const candidates = searchMemories(project, ftsQuery, 20);
+    // Get already-existing edge targets so we can exclude them
+    const existingEdges = getEdges(memoryId, project);
+    const alreadyLinked = new Set([
+        memoryId,
+        ...existingEdges.map(e => (e.source_id === memoryId ? e.target_id : e.source_id)),
+    ]);
+    const suggestions = [];
+    const srcKw = extractKeywords(source.content);
+    for (const candidate of candidates) {
+        if (alreadyLinked.has(candidate.id))
+            continue;
+        const tgtKw = extractKeywords(candidate.content);
+        const confidence = keywordOverlap(srcKw, tgtKw);
+        if (confidence < WEIGHT_THRESHOLD)
+            continue;
+        const suggestedRelation = inferRelationType(source, candidate);
+        suggestions.push({ target: candidate, suggestedRelation, confidence });
+    }
+    return suggestions
+        .sort((a, b) => b.confidence - a.confidence)
+        .slice(0, 10);
+}
+// ---------------------------------------------------------------------------
+// cleanupEdges
+// ---------------------------------------------------------------------------
+/**
+ * Remove all constellation edges that reference the given memory ID.
+ * Should be called when a memory is deleted to prevent orphan edges.
+ */
+export function cleanupEdges(memoryId) {
+    // getEdges returns all edges where memoryId is source OR target
+    // We need the project, but edges carry it — we can fetch edges without project filter.
+    // Since deleteEdge only needs the edge ID, we get all edges for this memory first.
+    // We don't have a project in scope here, so we query directly.
+    const db = getDatabase();
+    const rows = db.prepare(`
+    SELECT id FROM constellation_edges
+    WHERE source_id = ? OR target_id = ?
+  `).all(memoryId, memoryId);
+    for (const row of rows) {
+        try {
+            deleteEdge(row.id);
+        }
+        catch (err) {
+            log.warn('Failed to delete constellation edge during cleanup', { edgeId: row.id, err });
+        }
+    }
+    log.debug('Cleaned up constellation edges', { memoryId, count: rows.length });
+}
+//# sourceMappingURL=constellation.js.map

package/dist/engine/constellation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constellation.js","sourceRoot":"","sources":["../../src/engine/constellation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EACL,UAAU,EACV,QAAQ,EACR,gBAAgB,EAChB,UAAU,EACV,cAAc,EACd,cAAc,GACf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,MAAM,GAAG,GAAG,YAAY,CAAC,eAAe,CAAC,CAAC;AAE1C,4DAA4D;AAC5D,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAE7B,qEAAqE;AACrE,MAAM,KAAK,GAAG,CAAC,CAAC;AAEhB,8EAA8E;AAC9E,yBAAyB;AACzB,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,qBAAqB,GAAG;IAC5B,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS;IAC1E,SAAS,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW;IAC7D,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;CACnC,CAAC;AAEF,gEAAgE;AAChE,MAAM,kBAAkB,GAAG;IACzB,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS;IACpE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY;IACvD,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;CAC7B,CAAC;AAEF;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAY;IACnC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;QACzB,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;QACnE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;QACtE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;KAClD,CAAC,CAAC;IAEH,MAAM,KAAK,GAAG,IAAI;SACf,WAAW,EAAE;SACb,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;SAC/B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;AACxB,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,CAAc,EAAE,CAAc;IACpD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,EAAE,CAAC;IACzB,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC;IACvC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,SAAS,uBAAuB,CAAC,CAAS,EAAE,CAAS;IACnD,MAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,SAAS,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAErC,uBAAuB;IACvB,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEtC,0EAA0E;IAC1E,sEAAsE;IACtE,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YAChC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAClC,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,SAAS;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;YAC5E,KAAK,MAAM,MAAM,IAAI,qBAAqB,EAAE,CAAC;gBAC3C,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;oBAAE,OAAO,IAAI,CAAC;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,aAAqB,EAAE,aAAqB;IACrE,MAAM,MAAM,GAAG,aAAa,CAAC,WAAW,EAAE,CAAC;IAC3C,MAAM,cAAc,GAAG,eAAe,CAAC,aAAa,CAAC,CAAC;IAEtD,8DAA8D;IAC9D,MAAM,WAAW,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC/E,IAAI,WAAW,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAElC,KAAK,MAAM,MAAM,IAAI,kBAAkB,EAAE,CAAC;QACxC,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;IAC3C,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,MAAc,EAAE,MAAc;IACnD,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACvE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAClE,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,MAAc,EAAE,MAAc;IACvD,6EAA6E;IAC7E,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,WAAW,CAAC;IAC9E,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,WAAW,CAAC;IAE9E,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,cAAc,CAAC;IACjF,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW;QAAE,OAAO,SAAS,CAAC;IAE5E,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC7D,IAAI,uBAAuB,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC;YAAE,OAAO,aAAa,CAAC;QAClF,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,SAAS,CAAC;IAE9E,6EAA6E;IAC7E,IAAI,iBAAiB,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC;QAAE,OAAO,MAAM,CAAC;IACrE,IAAI,iBAAiB,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC;QAAE,OAAO,YAAY,CAAC;IAE3E,IAAI,uBAAuB,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC;QAAE,OAAO,aAAa,CAAC;IAElF,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,8EAA8E;AAC9E,iDAAiD;AACjD,8EAA8E;AAE9E;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,SAAiB,EACjB,OAAe;IAEf,MAAM,OAAO,GAAwB,EAAE,CAAC;IAExC,6EAA6E;IAC7E,IAAI,UAAU,GAA8C,EAAE,CAAC;IAE/D,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,MAAM,SAAS,GAAG,SAAS,CAAC,OAAO,GAAG,GAAG,GAAG,SAAS,CAAC,OAAO,CAAC;QAC9D,MAAM,SAAS,GAAG,MAAM,iBAAiB,CAAC,SAAS,CAAC,CAAC;QACrD,MAAM,UAAU,GAAG,cAAc,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,qBAAqB;QAElF,MAAM,GAAG,GAAG,UAAU;aACnB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;aACpB,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAEnB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;YACrC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAE5E,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,IAAI,GAAG,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE;oBAAE,SAAS;gBACtC,sEAAsE;gBACtE,gEAAgE;gBAChE,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBACzC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC3C,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,gDAAgD;QAChD,GAAG,CAAC,KAAK,CAAC,iDAAiD,EAAE,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC;IAC3F,CAAC;IAED,oEAAoE;IACpE,IAAI,UAAU,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACtE,MAAM,UAAU,GAAG,cAAc,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAChE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEjF,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YACtC,MAAM,KAAK,GAAI,eAAe,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAClD,MAAM,KAAK,GAAI,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC5C,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;YACzC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACxB,IAAI,UAAU,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QACxC,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,UAAU,GAAG,UAAU;SACpB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,gBAAgB,CAAC;SACzC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;SACnC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAEnB,6EAA6E;IAC7E,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAErC,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QACpD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAEtD,MAAM,IAAI,GAAsB;YAC9B,EAAE,EAAU,UAAU,EAAE;YACxB,SAAS,EAAG,SAAS,CAAC,EAAE;YACxB,SAAS,EAAG,MAAM,CAAC,EAAE;YACrB,QAAQ;YACR,MAAM,EAAM,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,EAAE,4BAA4B;YAC1E,OAAO;YACP,UAAU,EAAE,GAAG;YACf,QAAQ,EAAI,EAAE;SACf,CAAC;QAEF,IAAI,CAAC;YACH,UAAU,CAAC,IAAI,CAAC,CAAC;YACjB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,GAAG,CAAC,KAAK,CAAC,4BAA4B,EAAE;gBACtC,MAAM,EAAE,SAAS,CAAC,EAAE;gBACpB,MAAM,EAAE,MAAM,CAAC,EAAE;gBACjB,QAAQ;gBACR,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,GAAG,CAAC,IAAI,CAAC,qCAAqC,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;QACpG,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACnC,QAAgB,EAChB,OAAe,EACf,KAAK,GAAG,CAAC;IAET,OAAO,gBAAgB,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;AACpD,CAAC;AAED,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,QAAgB,EAChB,OAAe,EACf,KAAK,GAAG,EAAE;IAEV,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAE1C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,oEAAoE;IACpE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;QAClF,uEAAuE;QACvE,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;YAC3B,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,wCAAwC;IACxC,MAAM,SAAS,GAAG,CAAC,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC;SACxC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;SACf,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAErB,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEtC,MAAM,QAAQ,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;IAE3C,mCAAmC;IACnC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACtF,CAAC;AAED,8EAA8E;AAC9E,uBAAuB;AACvB,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAAgB,EAChB,OAAe;IAEf,+EAA+E;IAC/E,MAAM,EAAE,KAAK,EAAE,GAAG,gBAAgB,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACzD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAEvB,kDAAkD;IAClD,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAChE,MAAM,UAAU,GAAG,cAAc,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC;IAEzD,2DAA2D;IAC3D,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAClD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;QAC5B,QAAQ;QACR,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;KAClF,CAAC,CAAC;IAEH,MAAM,WAAW,GAAmF,EAAE,CAAC;IACvG,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAE9C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAAE,SAAS;QAE9C,MAAM,KAAK,GAAG,eAAe,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAEhD,IAAI,UAAU,GAAG,gBAAgB;YAAE,SAAS;QAE5C,MAAM,iBAAiB,GAAG,iBAAiB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC/D,WAAW,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,iBAAiB,EAAE,UAAU,EAAE,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,WAAW;SACf,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;SAC3C,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAClB,CAAC;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB;IAC3C,gEAAgE;IAChE,uFAAuF;IACvF,mFAAmF;IACnF,+DAA+D;IAC/D,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;GAGvB,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAA0B,CAAC;IAEpD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC;YACH,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,GAAG,CAAC,IAAI,CAAC,oDAAoD,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1F,CAAC;IACH,CAAC;IAED,GAAG,CAAC,KAAK,CAAC,gCAAgC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAChF,CAAC"}

package/dist/engine/corona.d.ts

@@ -0,0 +1,53 @@
+/**
+ * corona.ts — In-memory cache layer (the Sun's corona)
+ *
+ * The corona is an in-memory cache of core + near zone memories that enables
+ * sub-millisecond recall for the most important memories — mimicking how
+ * humans instantly access their name, age, and profession (System 1).
+ *
+ * Architecture:
+ *   - Holds up to MAX_CORONA_SIZE memories (sorted by distance ASC).
+ *   - Maintains a reverse token index for O(1) keyword matching.
+ *   - Warmed up on startup and after orbit recalculations.
+ *   - Invalidated and re-warmed on project switch.
+ *
+ * The corona turns orbital distance from a visual metaphor into a real
+ * performance differentiator: closer memories are literally faster to find.
+ */
+import type { Memory } from './types.js';
+declare class Corona {
+    private cache;
+    private tokenIndex;
+    private project;
+    /** Load core + near zone memories from DB into the cache. */
+    warmup(project: string): void;
+    /** Invalidate cache and reload for a different project. */
+    switchProject(project: string): void;
+    /** Return memories in the core zone (distance < 1.0 AU). */
+    getCoreMemories(): Memory[];
+    /** Return memories in the near zone (1.0 <= distance < 5.0 AU). */
+    getNearMemories(): Memory[];
+    /** Token-based search across cached memories. Returns scored results. */
+    search(query: string, limit: number): Memory[];
+    /** Check if a memory is in the corona cache. */
+    has(id: string): boolean;
+    /** Add or update a memory in the cache (if it qualifies by distance). */
+    upsert(memory: Memory): void;
+    /** Remove a memory from the corona cache. */
+    evict(id: string): void;
+    /** Return the current project. */
+    getProject(): string;
+    /** Return cache statistics. */
+    stats(): {
+        total: number;
+        core: number;
+        near: number;
+        project: string;
+    };
+    private indexTokens;
+    private removeTokens;
+}
+/** Singleton corona instance. */
+export declare const corona: Corona;
+export {};
+//# sourceMappingURL=corona.d.ts.map

package/dist/engine/corona.js

@@ -0,0 +1,181 @@
+/**
+ * corona.ts — In-memory cache layer (the Sun's corona)
+ *
+ * The corona is an in-memory cache of core + near zone memories that enables
+ * sub-millisecond recall for the most important memories — mimicking how
+ * humans instantly access their name, age, and profession (System 1).
+ *
+ * Architecture:
+ *   - Holds up to MAX_CORONA_SIZE memories (sorted by distance ASC).
+ *   - Maintains a reverse token index for O(1) keyword matching.
+ *   - Warmed up on startup and after orbit recalculations.
+ *   - Invalidated and re-warmed on project switch.
+ *
+ * The corona turns orbital distance from a visual metaphor into a real
+ * performance differentiator: closer memories are literally faster to find.
+ */
+import { tokenize } from './gravity.js';
+import { getMemoriesByProject } from '../storage/queries.js';
+import { createLogger } from '../utils/logger.js';
+const log = createLogger('corona');
+const MAX_CORONA_SIZE = 200;
+const CORE_THRESHOLD = 1.0; // distance < 1.0 AU
+const NEAR_THRESHOLD = 5.0; // distance < 5.0 AU
+class Corona {
+    cache = new Map();
+    tokenIndex = new Map();
+    project = '';
+    /** Load core + near zone memories from DB into the cache. */
+    warmup(project) {
+        this.project = project;
+        this.cache.clear();
+        this.tokenIndex.clear();
+        const memories = getMemoriesByProject(project);
+        // memories are already sorted by distance ASC from the query
+        // Filter out expired memories (valid_until in the past)
+        const now = new Date().toISOString();
+        const validMemories = memories.filter(m => !m.valid_until || m.valid_until > now);
+        const toCache = validMemories.slice(0, MAX_CORONA_SIZE);
+        for (const mem of toCache) {
+            this.cache.set(mem.id, mem);
+            this.indexTokens(mem);
+        }
+        log.debug('Corona warmed up', {
+            project,
+            total: toCache.length,
+            core: this.getCoreMemories().length,
+            near: this.getNearMemories().length,
+        });
+    }
+    /** Invalidate cache and reload for a different project. */
+    switchProject(project) {
+        this.warmup(project);
+    }
+    /** Return memories in the core zone (distance < 1.0 AU). */
+    getCoreMemories() {
+        const result = [];
+        for (const mem of this.cache.values()) {
+            if (mem.distance < CORE_THRESHOLD) {
+                result.push(mem);
+            }
+        }
+        return result.sort((a, b) => a.distance - b.distance);
+    }
+    /** Return memories in the near zone (1.0 <= distance < 5.0 AU). */
+    getNearMemories() {
+        const result = [];
+        for (const mem of this.cache.values()) {
+            if (mem.distance >= CORE_THRESHOLD && mem.distance < NEAR_THRESHOLD) {
+                result.push(mem);
+            }
+        }
+        return result.sort((a, b) => a.distance - b.distance);
+    }
+    /** Token-based search across cached memories. Returns scored results. */
+    search(query, limit) {
+        const queryTokens = tokenize(query);
+        if (queryTokens.length === 0 || this.cache.size === 0)
+            return [];
+        // Score each memory by counting matching tokens
+        const scores = new Map();
+        for (const token of queryTokens) {
+            const matchingIds = this.tokenIndex.get(token);
+            if (!matchingIds)
+                continue;
+            for (const id of matchingIds) {
+                scores.set(id, (scores.get(id) ?? 0) + 1);
+            }
+        }
+        if (scores.size === 0)
+            return [];
+        // Sort by score DESC, then by distance ASC for ties
+        return [...scores.entries()]
+            .sort((a, b) => {
+            if (b[1] !== a[1])
+                return b[1] - a[1];
+            const memA = this.cache.get(a[0]);
+            const memB = this.cache.get(b[0]);
+            return memA.distance - memB.distance;
+        })
+            .slice(0, limit)
+            .map(([id]) => this.cache.get(id))
+            .filter(Boolean);
+    }
+    /** Check if a memory is in the corona cache. */
+    has(id) {
+        return this.cache.has(id);
+    }
+    /** Add or update a memory in the cache (if it qualifies by distance). */
+    upsert(memory) {
+        if (memory.project !== this.project)
+            return;
+        // Remove old token entries if updating
+        if (this.cache.has(memory.id)) {
+            this.removeTokens(memory.id);
+        }
+        // Only cache if within corona range or if we have room
+        if (this.cache.size < MAX_CORONA_SIZE || this.cache.has(memory.id)) {
+            this.cache.set(memory.id, memory);
+            this.indexTokens(memory);
+        }
+        else {
+            // Check if this memory is closer than the farthest cached memory
+            let farthestId = '';
+            let farthestDist = 0;
+            for (const [id, m] of this.cache) {
+                if (m.distance > farthestDist) {
+                    farthestDist = m.distance;
+                    farthestId = id;
+                }
+            }
+            if (memory.distance < farthestDist) {
+                this.evict(farthestId);
+                this.cache.set(memory.id, memory);
+                this.indexTokens(memory);
+            }
+        }
+    }
+    /** Remove a memory from the corona cache. */
+    evict(id) {
+        this.removeTokens(id);
+        this.cache.delete(id);
+    }
+    /** Return the current project. */
+    getProject() {
+        return this.project;
+    }
+    /** Return cache statistics. */
+    stats() {
+        return {
+            total: this.cache.size,
+            core: this.getCoreMemories().length,
+            near: this.getNearMemories().length,
+            project: this.project,
+        };
+    }
+    // ── Private helpers ─────────────────────────────────────────────────────
+    indexTokens(memory) {
+        const text = [memory.content, memory.summary, ...memory.tags].join(' ');
+        const tokens = tokenize(text);
+        for (const token of tokens) {
+            let ids = this.tokenIndex.get(token);
+            if (!ids) {
+                ids = new Set();
+                this.tokenIndex.set(token, ids);
+            }
+            ids.add(memory.id);
+        }
+    }
+    removeTokens(id) {
+        // Remove id from all token sets
+        for (const [token, ids] of this.tokenIndex) {
+            ids.delete(id);
+            if (ids.size === 0) {
+                this.tokenIndex.delete(token);
+            }
+        }
+    }
+}
+/** Singleton corona instance. */
+export const corona = new Corona();
+//# sourceMappingURL=corona.js.map

package/dist/engine/corona.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"corona.js","sourceRoot":"","sources":["../../src/engine/corona.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;AAEnC,MAAM,eAAe,GAAG,GAAG,CAAC;AAC5B,MAAM,cAAc,GAAG,GAAG,CAAC,CAAG,oBAAoB;AAClD,MAAM,cAAc,GAAG,GAAG,CAAC,CAAG,oBAAoB;AAElD,MAAM,MAAM;IACF,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClC,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,OAAO,GAAW,EAAE,CAAC;IAE7B,6DAA6D;IAC7D,MAAM,CAAC,OAAe;QACpB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAExB,MAAM,QAAQ,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;QAC/C,6DAA6D;QAC7D,wDAAwD;QACxD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACxC,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,GAAG,GAAG,CACtC,CAAC;QACF,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;QAExD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;QAED,GAAG,CAAC,KAAK,CAAC,kBAAkB,EAAE;YAC5B,OAAO;YACP,KAAK,EAAE,OAAO,CAAC,MAAM;YACrB,IAAI,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,MAAM;YACnC,IAAI,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,MAAM;SACpC,CAAC,CAAC;IACL,CAAC;IAED,2DAA2D;IAC3D,aAAa,CAAC,OAAe;QAC3B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACvB,CAAC;IAED,4DAA4D;IAC5D,eAAe;QACb,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,GAAG,CAAC,QAAQ,GAAG,cAAc,EAAE,CAAC;gBAClC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IACxD,CAAC;IAED,mEAAmE;IACnE,eAAe;QACb,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,GAAG,CAAC,QAAQ,IAAI,cAAc,IAAI,GAAG,CAAC,QAAQ,GAAG,cAAc,EAAE,CAAC;gBACpE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IACxD,CAAC;IAED,yEAAyE;IACzE,MAAM,CAAC,KAAa,EAAE,KAAa;QACjC,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEjE,gDAAgD;QAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEzC,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC/C,IAAI,CAAC,WAAW;gBAAE,SAAS;YAC3B,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QAED,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEjC,oDAAoD;QACpD,OAAO,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;aACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACb,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;YACnC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;YACnC,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QACvC,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;aACf,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;aAClC,MAAM,CAAC,OAAO,CAAC,CAAC;IACrB,CAAC;IAED,gDAAgD;IAChD,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,yEAAyE;IACzE,MAAM,CAAC,MAAc;QACnB,IAAI,MAAM,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO;YAAE,OAAO;QAE5C,uCAAuC;QACvC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC;QAED,uDAAuD;QACvD,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,eAAe,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YACnE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAClC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;aAAM,CAAC;YACN,iEAAiE;YACjE,IAAI,UAAU,GAAG,EAAE,CAAC;YACpB,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACjC,IAAI,CAAC,CAAC,QAAQ,GAAG,YAAY,EAAE,CAAC;oBAC9B,YAAY,GAAG,CAAC,CAAC,QAAQ,CAAC;oBAC1B,UAAU,GAAG,EAAE,CAAC;gBAClB,CAAC;YACH,CAAC;YACD,IAAI,MAAM,CAAC,QAAQ,GAAG,YAAY,EAAE,CAAC;gBACnC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;gBAClC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED,6CAA6C;IAC7C,KAAK,CAAC,EAAU;QACd,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IAED,kCAAkC;IAClC,UAAU;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,+BAA+B;IAC/B,KAAK;QACH,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACtB,IAAI,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,MAAM;YACnC,IAAI,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,MAAM;YACnC,OAAO,EAAE,IAAI,CAAC,OAAO;SACtB,CAAC;IACJ,CAAC;IAED,2EAA2E;IAEnE,WAAW,CAAC,MAAc;QAChC,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxE,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;gBAChB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAClC,CAAC;YACD,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAEO,YAAY,CAAC,EAAU;QAC7B,gCAAgC;QAChC,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3C,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACf,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED,iCAAiC;AACjC,MAAM,CAAC,MAAM,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC"}