helixmind 0.5.4

package/dist/spiral/engine.d.ts

@@ -0,0 +1,98 @@
+import type { ContextType, NodeMetadata, RelationType, SpiralLevel, SpiralConfig, SpiralQueryResult, SpiralStoreResult, SpiralStatusResult, SpiralCompactResult, Edge } from '../types.js';
+import { type EvolutionResult } from './compression.js';
+/**
+ * Core engine that orchestrates all spiral operations.
+ */
+export declare class SpiralEngine {
+    private db;
+    private nodes;
+    private edges;
+    private vectors;
+    private embeddings;
+    private injection;
+    private compression;
+    private config;
+    constructor(config: SpiralConfig);
+    /**
+     * Start the engine. Loads embedding model eagerly.
+     */
+    initialize(): Promise<void>;
+    /**
+     * Query context across spiral levels.
+     */
+    query(queryText: string, maxTokens?: number, levels?: number[]): Promise<SpiralQueryResult>;
+    /**
+     * Store new context in the spiral.
+     * Deduplicates by content hash — identical content is refreshed, not duplicated.
+     */
+    store(content: string, type: ContextType, metadata?: NodeMetadata, relations?: string[]): Promise<SpiralStoreResult>;
+    /**
+     * Get spiral status metrics.
+     */
+    status(): SpiralStatusResult;
+    /** Count web knowledge nodes (virtual L6) */
+    webKnowledgeCount(): number;
+    /**
+     * Run compaction.
+     */
+    compact(aggressive: boolean): SpiralCompactResult;
+    /**
+     * Create a manual relation between two nodes.
+     */
+    relate(sourceId: string, targetId: string, type: RelationType, weight?: number): Edge;
+    /**
+     * Export all data for visualization.
+     */
+    exportForVisualization(): {
+        nodes: Array<{
+            id: string;
+            label: string;
+            content: string;
+            type: string;
+            level: SpiralLevel;
+            relevanceScore: number;
+            createdAt: string;
+            lastAccessed: string;
+        }>;
+        edges: Array<{
+            source: string;
+            target: string;
+            type: string;
+            weight: number;
+        }>;
+    };
+    /**
+     * Run evolution: promote/demote nodes based on relevance scores.
+     * Preserves all nodes — nothing is deleted.
+     */
+    evolve(): EvolutionResult;
+    /**
+     * Save state: persist conversation context and trigger evolution if needed.
+     * Called on graceful shutdown.
+     */
+    saveState(conversationMessages?: Array<{
+        role: string;
+        content: string;
+    }>): Promise<void>;
+    /**
+     * Import a node directly (for ZIP import). Returns store result.
+     * Uses content hash for deduplication.
+     */
+    importNode(input: {
+        type: ContextType;
+        content: string;
+        level?: SpiralLevel;
+        relevanceScore?: number;
+        metadata?: NodeMetadata;
+    }): Promise<SpiralStoreResult>;
+    /**
+     * Clear all nodes and edges (for ZIP replace import).
+     * Handles both sqlite-vec (vec_nodes) and JS fallback (embeddings) tables.
+     */
+    clearAll(): void;
+    /**
+     * Shutdown: dispose embedding model and close database.
+     */
+    close(): Promise<void>;
+}
+//# sourceMappingURL=engine.d.ts.map

package/dist/spiral/engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.d.ts","sourceRoot":"","sources":["../../src/spiral/engine.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,WAAW,EACX,YAAY,EACZ,iBAAiB,EACjB,iBAAiB,EACjB,kBAAkB,EAClB,mBAAmB,EACnB,IAAI,EACL,MAAM,aAAa,CAAC;AAOrB,OAAO,EAAsB,KAAK,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAM5E;;GAEG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,EAAE,CAAW;IACrB,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,OAAO,CAAc;IAC7B,OAAO,CAAC,UAAU,CAAmB;IACrC,OAAO,CAAC,SAAS,CAAkB;IACnC,OAAO,CAAC,WAAW,CAAqB;IACxC,OAAO,CAAC,MAAM,CAAe;gBAEjB,MAAM,EAAE,YAAY;IAsBhC;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAKjC;;OAEG;IACG,KAAK,CACT,SAAS,EAAE,MAAM,EACjB,SAAS,CAAC,EAAE,MAAM,EAClB,MAAM,CAAC,EAAE,MAAM,EAAE,GAChB,OAAO,CAAC,iBAAiB,CAAC;IAW7B;;;OAGG;IACG,KAAK,CACT,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,WAAW,EACjB,QAAQ,CAAC,EAAE,YAAY,EACvB,SAAS,CAAC,EAAE,MAAM,EAAE,GACnB,OAAO,CAAC,iBAAiB,CAAC;IA2F7B;;OAEG;IACH,MAAM,IAAI,kBAAkB;IAyB5B,6CAA6C;IAC7C,iBAAiB,IAAI,MAAM;IAI3B;;OAEG;IACH,OAAO,CAAC,UAAU,EAAE,OAAO,GAAG,mBAAmB;IAIjD;;OAEG;IACH,MAAM,CACJ,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,IAAI,EAAE,YAAY,EAClB,MAAM,CAAC,EAAE,MAAM,GACd,IAAI;IASP;;OAEG;IACH,sBAAsB,IAAI;QACxB,KAAK,EAAE,KAAK,CAAC;YACX,EAAE,EAAE,MAAM,CAAC;YACX,KAAK,EAAE,MAAM,CAAC;YACd,OAAO,EAAE,MAAM,CAAC;YAChB,IAAI,EAAE,MAAM,CAAC;YACb,KAAK,EAAE,WAAW,CAAC;YACnB,cAAc,EAAE,MAAM,CAAC;YACvB,SAAS,EAAE,MAAM,CAAC;YAClB,YAAY,EAAE,MAAM,CAAC;SACtB,CAAC,CAAC;QACH,KAAK,EAAE,KAAK,CAAC;YACX,MAAM,EAAE,MAAM,CAAC;YACf,MAAM,EAAE,MAAM,CAAC;YACf,IAAI,EAAE,MAAM,CAAC;YACb,MAAM,EAAE,MAAM,CAAC;SAChB,CAAC,CAAC;KACJ;IAsCD;;;OAGG;IACH,MAAM,IAAI,eAAe;IAIzB;;;OAGG;IACG,SAAS,CAAC,oBAAoB,CAAC,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IA4B/F;;;OAGG;IACG,UAAU,CAAC,KAAK,EAAE;QACtB,IAAI,EAAE,WAAW,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;QAChB,KAAK,CAAC,EAAE,WAAW,CAAC;QACpB,cAAc,CAAC,EAAE,MAAM,CAAC;QACxB,QAAQ,CAAC,EAAE,YAAY,CAAC;KACzB,GAAG,OAAO,CAAC,iBAAiB,CAAC;IAsC9B;;;OAGG;IACH,QAAQ,IAAI,IAAI;IAUhB;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAI7B"}

package/dist/spiral/engine.js

@@ -0,0 +1,330 @@
+import { Database } from '../storage/database.js';
+import { NodeStore } from '../storage/nodes.js';
+import { EdgeStore } from '../storage/edges.js';
+import { VectorStore } from '../storage/vectors.js';
+import { EmbeddingService } from './embeddings.js';
+import { InjectionEngine } from './injection.js';
+import { CompressionService } from './compression.js';
+import { logger } from '../utils/logger.js';
+import { statSync } from 'node:fs';
+import { join } from 'node:path';
+import { createHash } from 'node:crypto';
+/**
+ * Core engine that orchestrates all spiral operations.
+ */
+export class SpiralEngine {
+    db;
+    nodes;
+    edges;
+    vectors;
+    embeddings;
+    injection;
+    compression;
+    config;
+    constructor(config) {
+        this.config = config;
+        // Initialize storage
+        this.db = new Database(config.dataDir);
+        this.nodes = new NodeStore(this.db);
+        this.edges = new EdgeStore(this.db);
+        this.vectors = new VectorStore(this.db, config.embeddingDimensions);
+        // Initialize spiral logic
+        this.embeddings = new EmbeddingService(config.model);
+        this.injection = new InjectionEngine(this.nodes, this.edges, this.vectors);
+        this.compression = new CompressionService(this.nodes, this.vectors, config.levelThresholds.l1Min, config.levelThresholds.l2Min, config.levelThresholds.l3Min, config.levelThresholds.l4Min);
+    }
+    /**
+     * Start the engine. Loads embedding model eagerly.
+     */
+    async initialize() {
+        await this.embeddings.initialize();
+        logger.info('SpiralEngine initialized');
+    }
+    /**
+     * Query context across spiral levels.
+     */
+    async query(queryText, maxTokens, levels) {
+        const budget = maxTokens ?? this.config.maxTokens;
+        const activeLevels = levels ?? [1, 2, 3, 4, 5];
+        // Generate embedding for query
+        const queryEmbedding = await this.embeddings.embed(queryText);
+        // Assemble context from all levels
+        return this.injection.assemble(queryEmbedding, queryText, budget, activeLevels);
+    }
+    /**
+     * Store new context in the spiral.
+     * Deduplicates by content hash — identical content is refreshed, not duplicated.
+     */
+    async store(content, type, metadata, relations) {
+        const meta = metadata ?? {};
+        const contentHash = createHash('sha256').update(content).digest('hex');
+        // Dedup check: if identical content already exists, refresh it instead of creating a new node
+        const existing = this.nodes.findByContentHash(contentHash);
+        if (existing) {
+            // Merge tags from new metadata into existing
+            const existingMeta = existing.metadata;
+            if (meta.tags && Array.isArray(meta.tags)) {
+                const existingTags = Array.isArray(existingMeta.tags) ? existingMeta.tags : [];
+                const merged = [...new Set([...existingTags, ...meta.tags])];
+                existingMeta.tags = merged;
+            }
+            // Copy over any new metadata keys (except tags, already merged)
+            for (const [key, val] of Object.entries(meta)) {
+                if (key !== 'tags')
+                    existingMeta[key] = val;
+            }
+            this.nodes.refreshNode(existing.id, content, existingMeta, contentHash);
+            logger.debug(`Dedup: refreshed existing node ${existing.id} (type: ${type})`);
+            return {
+                node_id: existing.id,
+                level: existing.level,
+                connections: 0,
+                token_count: existing.token_count,
+                deduplicated: true,
+            };
+        }
+        // Create the node with content hash
+        const node = this.nodes.create({
+            type,
+            content,
+            metadata: meta,
+            content_hash: contentHash,
+        });
+        // Generate and store embedding
+        const embedding = await this.embeddings.embed(content);
+        if (embedding) {
+            this.vectors.store(node.id, embedding);
+        }
+        // Create explicit relations
+        let connectionCount = 0;
+        if (relations) {
+            for (const targetId of relations) {
+                if (this.nodes.exists(targetId)) {
+                    this.edges.create({
+                        source_id: node.id,
+                        target_id: targetId,
+                        relation_type: 'related_to',
+                    });
+                    connectionCount++;
+                }
+            }
+        }
+        // Auto-detect relations via similarity (if embeddings available)
+        if (embedding) {
+            const similar = this.vectors.search(embedding, 5);
+            for (const result of similar) {
+                if (result.node_id === node.id)
+                    continue;
+                if (result.distance < 0.3) { // Very similar
+                    try {
+                        this.edges.create({
+                            source_id: node.id,
+                            target_id: result.node_id,
+                            relation_type: 'related_to',
+                            weight: 1 - result.distance,
+                        });
+                        connectionCount++;
+                    }
+                    catch {
+                        // Duplicate edge, ignore
+                    }
+                }
+            }
+        }
+        logger.debug(`Stored node ${node.id} (type: ${type}, connections: ${connectionCount})`);
+        return {
+            node_id: node.id,
+            level: node.level,
+            connections: connectionCount,
+            token_count: node.token_count,
+        };
+    }
+    /**
+     * Get spiral status metrics.
+     */
+    status() {
+        const totalNodes = this.nodes.count();
+        const perLevel = this.nodes.countByLevel();
+        const totalEdges = this.edges.count();
+        const { oldest, newest } = this.nodes.getOldestAndNewest();
+        let storageSize = 0;
+        try {
+            const dbPath = join(this.config.dataDir, 'spiral.db');
+            storageSize = statSync(dbPath).size;
+        }
+        catch {
+            // File may not exist yet
+        }
+        return {
+            total_nodes: totalNodes,
+            per_level: perLevel,
+            total_edges: totalEdges,
+            storage_size_bytes: storageSize,
+            oldest_node: oldest ? new Date(oldest).toISOString() : null,
+            newest_node: newest ? new Date(newest).toISOString() : null,
+            embedding_status: this.embeddings.status,
+        };
+    }
+    /** Count web knowledge nodes (virtual L6) */
+    webKnowledgeCount() {
+        return this.nodes.countWebKnowledge();
+    }
+    /**
+     * Run compaction.
+     */
+    compact(aggressive) {
+        return this.compression.compact(aggressive);
+    }
+    /**
+     * Create a manual relation between two nodes.
+     */
+    relate(sourceId, targetId, type, weight) {
+        return this.edges.create({
+            source_id: sourceId,
+            target_id: targetId,
+            relation_type: type,
+            weight,
+        });
+    }
+    /**
+     * Export all data for visualization.
+     */
+    exportForVisualization() {
+        const allNodes = this.nodes.getAll();
+        // Fetch all edges in a single query instead of N+1 per-node queries
+        const allEdgeRows = this.db.raw.prepare('SELECT * FROM edges').all();
+        const allEdges = allEdgeRows.map(row => ({
+            id: row.id,
+            source_id: row.source_id,
+            target_id: row.target_id,
+            relation_type: row.relation_type,
+            weight: row.weight,
+            metadata: JSON.parse(row.metadata || '{}'),
+            created_at: row.created_at,
+        }));
+        return {
+            nodes: allNodes.map(n => ({
+                id: n.id,
+                label: buildNodeLabel(n),
+                content: (n.summary ?? n.content).slice(0, 200),
+                type: n.type,
+                level: n.level,
+                relevanceScore: n.relevance_score,
+                createdAt: new Date(n.created_at).toISOString(),
+                lastAccessed: new Date(n.accessed_at).toISOString(),
+            })),
+            edges: allEdges.map(e => ({
+                source: e.source_id,
+                target: e.target_id,
+                type: e.relation_type,
+                weight: e.weight,
+            })),
+        };
+    }
+    /**
+     * Run evolution: promote/demote nodes based on relevance scores.
+     * Preserves all nodes — nothing is deleted.
+     */
+    evolve() {
+        return this.compression.evolve();
+    }
+    /**
+     * Save state: persist conversation context and trigger evolution if needed.
+     * Called on graceful shutdown.
+     */
+    async saveState(conversationMessages) {
+        // Archive only NEW conversation messages as L1 nodes.
+        // Track the last saved index to avoid duplicates across sessions.
+        if (conversationMessages && conversationMessages.length > 0) {
+            // Only store the last few messages (avoid re-storing entire history)
+            const maxNewMessages = 10;
+            const startIdx = Math.max(0, conversationMessages.length - maxNewMessages);
+            const newMessages = conversationMessages.slice(startIdx);
+            for (const msg of newMessages) {
+                if (msg.role === 'user' || msg.role === 'assistant') {
+                    try {
+                        await this.store(msg.content, 'code', {
+                            tags: ['conversation', msg.role],
+                        });
+                    }
+                    catch {
+                        // Skip on error
+                    }
+                }
+            }
+        }
+        // Trigger evolution
+        this.compression.evolve();
+        logger.info('State saved and evolution triggered');
+    }
+    /**
+     * Import a node directly (for ZIP import). Returns store result.
+     * Uses content hash for deduplication.
+     */
+    async importNode(input) {
+        const contentHash = createHash('sha256').update(input.content).digest('hex');
+        // Dedup: skip if identical content already exists
+        const existing = this.nodes.findByContentHash(contentHash);
+        if (existing) {
+            return {
+                node_id: existing.id,
+                level: existing.level,
+                connections: 0,
+                token_count: existing.token_count,
+                deduplicated: true,
+            };
+        }
+        const node = this.nodes.create({
+            type: input.type,
+            content: input.content,
+            metadata: input.metadata ?? {},
+            level: input.level,
+            relevance_score: input.relevanceScore,
+            content_hash: contentHash,
+        });
+        // Generate and store embedding so imported nodes are findable via semantic search
+        const embedding = await this.embeddings.embed(input.content);
+        if (embedding) {
+            this.vectors.store(node.id, embedding);
+        }
+        return {
+            node_id: node.id,
+            level: node.level,
+            connections: 0,
+            token_count: node.token_count,
+        };
+    }
+    /**
+     * Clear all nodes and edges (for ZIP replace import).
+     * Handles both sqlite-vec (vec_nodes) and JS fallback (embeddings) tables.
+     */
+    clearAll() {
+        // Wrap in transaction to ensure atomicity — partial delete would corrupt the brain
+        this.db.raw.transaction(() => {
+            this.db.raw.exec('DELETE FROM edges');
+            try {
+                this.db.raw.exec('DELETE FROM vec_nodes');
+            }
+            catch { /* sqlite-vec table may not exist */ }
+            try {
+                this.db.raw.exec('DELETE FROM embeddings');
+            }
+            catch { /* fallback table may not exist */ }
+            this.db.raw.exec('DELETE FROM nodes');
+        })();
+    }
+    /**
+     * Shutdown: dispose embedding model and close database.
+     */
+    async close() {
+        await this.embeddings.dispose();
+        this.db.close();
+    }
+}
+function buildNodeLabel(node) {
+    if (node.metadata.file)
+        return node.metadata.file;
+    const firstLine = node.content.split('\n')[0];
+    return firstLine.length > 50 ? firstLine.slice(0, 47) + '...' : firstLine;
+}
+//# sourceMappingURL=engine.js.map

package/dist/spiral/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../../src/spiral/engine.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,kBAAkB,EAAwB,MAAM,kBAAkB,CAAC;AAC5E,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC;;GAEG;AACH,MAAM,OAAO,YAAY;IACf,EAAE,CAAW;IACb,KAAK,CAAY;IACjB,KAAK,CAAY;IACjB,OAAO,CAAc;IACrB,UAAU,CAAmB;IAC7B,SAAS,CAAkB;IAC3B,WAAW,CAAqB;IAChC,MAAM,CAAe;IAE7B,YAAY,MAAoB;QAC9B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QAErB,qBAAqB;QACrB,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,mBAAmB,CAAC,CAAC;QAEpE,0BAA0B;QAC1B,IAAI,CAAC,UAAU,GAAG,IAAI,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrD,IAAI,CAAC,SAAS,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3E,IAAI,CAAC,WAAW,GAAG,IAAI,kBAAkB,CACvC,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,OAAO,EACZ,MAAM,CAAC,eAAe,CAAC,KAAK,EAC5B,MAAM,CAAC,eAAe,CAAC,KAAK,EAC5B,MAAM,CAAC,eAAe,CAAC,KAAK,EAC5B,MAAM,CAAC,eAAe,CAAC,KAAK,CAC7B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CACT,SAAiB,EACjB,SAAkB,EAClB,MAAiB;QAEjB,MAAM,MAAM,GAAG,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;QAClD,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAE/C,+BAA+B;QAC/B,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAE9D,mCAAmC;QACnC,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;IAClF,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAK,CACT,OAAe,EACf,IAAiB,EACjB,QAAuB,EACvB,SAAoB;QAEpB,MAAM,IAAI,GAAG,QAAQ,IAAI,EAAE,CAAC;QAC5B,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEvE,8FAA8F;QAC9F,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC3D,IAAI,QAAQ,EAAE,CAAC;YACb,6CAA6C;YAC7C,MAAM,YAAY,GAAG,QAAQ,CAAC,QAAQ,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1C,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC3F,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,IAAI,CAAC,IAAgB,CAAC,CAAC,CAAC,CAAC;gBACzE,YAAY,CAAC,IAAI,GAAG,MAAM,CAAC;YAC7B,CAAC;YACD,gEAAgE;YAChE,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9C,IAAI,GAAG,KAAK,MAAM;oBAAE,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;YAC9C,CAAC;YAED,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YACxE,MAAM,CAAC,KAAK,CAAC,kCAAkC,QAAQ,CAAC,EAAE,WAAW,IAAI,GAAG,CAAC,CAAC;YAE9E,OAAO;gBACL,OAAO,EAAE,QAAQ,CAAC,EAAE;gBACpB,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,WAAW,EAAE,CAAC;gBACd,WAAW,EAAE,QAAQ,CAAC,WAAW;gBACjC,YAAY,EAAE,IAAI;aACnB,CAAC;QACJ,CAAC;QAED,oCAAoC;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAC7B,IAAI;YACJ,OAAO;YACP,QAAQ,EAAE,IAAI;YACd,YAAY,EAAE,WAAW;SAC1B,CAAC,CAAC;QAEH,+BAA+B;QAC/B,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QACzC,CAAC;QAED,4BAA4B;QAC5B,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,SAAS,EAAE,CAAC;YACd,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAChC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;wBAChB,SAAS,EAAE,IAAI,CAAC,EAAE;wBAClB,SAAS,EAAE,QAAQ;wBACnB,aAAa,EAAE,YAAY;qBAC5B,CAAC,CAAC;oBACH,eAAe,EAAE,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YAClD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,MAAM,CAAC,OAAO,KAAK,IAAI,CAAC,EAAE;oBAAE,SAAS;gBACzC,IAAI,MAAM,CAAC,QAAQ,GAAG,GAAG,EAAE,CAAC,CAAC,eAAe;oBAC1C,IAAI,CAAC;wBACH,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;4BAChB,SAAS,EAAE,IAAI,CAAC,EAAE;4BAClB,SAAS,EAAE,MAAM,CAAC,OAAO;4BACzB,aAAa,EAAE,YAAY;4BAC3B,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ;yBAC5B,CAAC,CAAC;wBACH,eAAe,EAAE,CAAC;oBACpB,CAAC;oBAAC,MAAM,CAAC;wBACP,yBAAyB;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,eAAe,IAAI,CAAC,EAAE,WAAW,IAAI,kBAAkB,eAAe,GAAG,CAAC,CAAC;QAExF,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,EAAE;YAChB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,WAAW,EAAE,eAAe;YAC5B,WAAW,EAAE,IAAI,CAAC,WAAW;SAC9B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACtC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC;QAE3D,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YACtD,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;QACtC,CAAC;QAAC,MAAM,CAAC;YACP,yBAAyB;QAC3B,CAAC;QAED,OAAO;YACL,WAAW,EAAE,UAAU;YACvB,SAAS,EAAE,QAAQ;YACnB,WAAW,EAAE,UAAU;YACvB,kBAAkB,EAAE,WAAW;YAC/B,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI;YAC3D,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI;YAC3D,gBAAgB,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM;SACzC,CAAC;IACJ,CAAC;IAED,6CAA6C;IAC7C,iBAAiB;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,UAAmB;QACzB,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,MAAM,CACJ,QAAgB,EAChB,QAAgB,EAChB,IAAkB,EAClB,MAAe;QAEf,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YACvB,SAAS,EAAE,QAAQ;YACnB,SAAS,EAAE,QAAQ;YACnB,aAAa,EAAE,IAAI;YACnB,MAAM;SACP,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,sBAAsB;QAkBpB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAErC,oEAAoE;QACpE,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,GAAG,EAGhE,CAAC;QACH,MAAM,QAAQ,GAAW,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/C,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,aAAa,EAAE,GAAG,CAAC,aAAsC;YACzD,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,IAAI,IAAI,CAAC;YAC1C,UAAU,EAAE,GAAG,CAAC,UAAU;SAC3B,CAAC,CAAC,CAAC;QAEJ,OAAO;YACL,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACxB,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC;gBACxB,OAAO,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;gBAC/C,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,cAAc,EAAE,CAAC,CAAC,eAAe;gBACjC,SAAS,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,WAAW,EAAE;gBAC/C,YAAY,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,WAAW,EAAE;aACpD,CAAC,CAAC;YACH,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACxB,MAAM,EAAE,CAAC,CAAC,SAAS;gBACnB,MAAM,EAAE,CAAC,CAAC,SAAS;gBACnB,IAAI,EAAE,CAAC,CAAC,aAAa;gBACrB,MAAM,EAAE,CAAC,CAAC,MAAM;aACjB,CAAC,CAAC;SACJ,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,MAAM;QACJ,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS,CAAC,oBAA+D;QAC7E,sDAAsD;QACtD,kEAAkE;QAClE,IAAI,oBAAoB,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5D,qEAAqE;YACrE,MAAM,cAAc,GAAG,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,oBAAoB,CAAC,MAAM,GAAG,cAAc,CAAC,CAAC;YAC3E,MAAM,WAAW,GAAG,oBAAoB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAEzD,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;gBAC9B,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;oBACpD,IAAI,CAAC;wBACH,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE;4BACpC,IAAI,EAAE,CAAC,cAAc,EAAE,GAAG,CAAC,IAAI,CAAC;yBACjC,CAAC,CAAC;oBACL,CAAC;oBAAC,MAAM,CAAC;wBACP,gBAAgB;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;QAE1B,MAAM,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;IACrD,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,UAAU,CAAC,KAMhB;QACC,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAE7E,kDAAkD;QAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC3D,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO;gBACL,OAAO,EAAE,QAAQ,CAAC,EAAE;gBACpB,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,WAAW,EAAE,CAAC;gBACd,WAAW,EAAE,QAAQ,CAAC,WAAW;gBACjC,YAAY,EAAE,IAAI;aACnB,CAAC;QACJ,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAC7B,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,EAAE;YAC9B,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,eAAe,EAAE,KAAK,CAAC,cAAc;YACrC,YAAY,EAAE,WAAW;SAC1B,CAAC,CAAC;QAEH,kFAAkF;QAClF,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC7D,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QACzC,CAAC;QAED,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,EAAE;YAChB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,IAAI,CAAC,WAAW;SAC9B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,mFAAmF;QACnF,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE;YAC3B,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;YACtC,IAAI,CAAC;gBAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;YAAC,CAAC;YAAC,MAAM,CAAC,CAAC,oCAAoC,CAAC,CAAC;YACjG,IAAI,CAAC;gBAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;YAAC,CAAC;YAAC,MAAM,CAAC,CAAC,kCAAkC,CAAC,CAAC;YAChG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QACxC,CAAC,CAAC,EAAE,CAAC;IACP,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;QAChC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC;CACF;AAED,SAAS,cAAc,CAAC,IAAuC;IAC7D,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAc,CAAC;IAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,OAAO,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5E,CAAC"}

package/dist/spiral/injection.d.ts

@@ -0,0 +1,29 @@
+import type { SpiralResultNode } from '../types.js';
+import { NodeStore } from '../storage/nodes.js';
+import { EdgeStore } from '../storage/edges.js';
+import { VectorStore } from '../storage/vectors.js';
+interface InjectionResult {
+    level_1: SpiralResultNode[];
+    level_2: SpiralResultNode[];
+    level_3: SpiralResultNode[];
+    level_4: SpiralResultNode[];
+    level_5: SpiralResultNode[];
+    total_tokens: number;
+    node_count: number;
+}
+/**
+ * Proactive context injection engine.
+ * Assembles the most relevant context across all 5 spiral levels.
+ */
+export declare class InjectionEngine {
+    private nodes;
+    private edges;
+    private vectors;
+    constructor(nodes: NodeStore, edges: EdgeStore, vectors: VectorStore);
+    /**
+     * Build context for a query across all spiral levels.
+     */
+    assemble(queryEmbedding: Float32Array | null, query: string, maxTokens: number, levels: number[]): Promise<InjectionResult>;
+}
+export {};
+//# sourceMappingURL=injection.d.ts.map

package/dist/spiral/injection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"injection.d.ts","sourceRoot":"","sources":["../../src/spiral/injection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAe,gBAAgB,EAAE,MAAM,aAAa,CAAC;AACjE,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAKpD,UAAU,eAAe;IACvB,OAAO,EAAE,gBAAgB,EAAE,CAAC;IAC5B,OAAO,EAAE,gBAAgB,EAAE,CAAC;IAC5B,OAAO,EAAE,gBAAgB,EAAE,CAAC;IAC5B,OAAO,EAAE,gBAAgB,EAAE,CAAC;IAC5B,OAAO,EAAE,gBAAgB,EAAE,CAAC;IAC5B,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,OAAO,CAAc;gBAEjB,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW;IAMpE;;OAEG;IACG,QAAQ,CACZ,cAAc,EAAE,YAAY,GAAG,IAAI,EACnC,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EAAE,GACf,OAAO,CAAC,eAAe,CAAC;CAkL5B"}

package/dist/spiral/injection.js

@@ -0,0 +1,176 @@
+import { computeRelevance } from './relevance.js';
+import { allocateTokenBudget, estimateTokens } from '../utils/tokens.js';
+import { logger } from '../utils/logger.js';
+/**
+ * Proactive context injection engine.
+ * Assembles the most relevant context across all 5 spiral levels.
+ */
+export class InjectionEngine {
+    nodes;
+    edges;
+    vectors;
+    constructor(nodes, edges, vectors) {
+        this.nodes = nodes;
+        this.edges = edges;
+        this.vectors = vectors;
+    }
+    /**
+     * Build context for a query across all spiral levels.
+     */
+    async assemble(queryEmbedding, query, maxTokens, levels) {
+        const budget = allocateTokenBudget(maxTokens);
+        // Step 1: Find direct matches via semantic search (single search, reused for scoring)
+        let candidateIds = [];
+        const simMap = new Map();
+        if (queryEmbedding) {
+            const vecResults = this.vectors.search(queryEmbedding, 50);
+            candidateIds = vecResults.map(r => r.node_id);
+            for (const r of vecResults) {
+                simMap.set(r.node_id, 1 - r.distance);
+            }
+        }
+        // If no embedding results, fall back to loading recent nodes (bounded query)
+        if (candidateIds.length === 0) {
+            candidateIds = this.nodes.getRecentIds(50);
+        }
+        // Step 2: Get full node data
+        const candidates = this.nodes.getByIds(candidateIds);
+        // Step 3: Score each candidate (use Set for O(1) lookup instead of Array.includes)
+        const candidateIdSet = new Set(candidateIds);
+        // Batch-fetch all edge connections in a single SQL query (eliminates N+1)
+        const adjacencyMap = this.edges.getConnectedNodeIdsForMany(candidateIds);
+        const scored = candidates.map(node => {
+            const semanticSim = simMap.get(node.id) ?? (queryEmbedding ? 0 : 0.5);
+            const connectedIds = adjacencyMap.get(node.id) ?? [];
+            const connectedInResult = connectedIds.filter(id => candidateIdSet.has(id)).length;
+            const relevance = computeRelevance(semanticSim, node, connectedInResult, query);
+            return { node, relevance };
+        });
+        // Sort by relevance descending
+        scored.sort((a, b) => b.relevance - a.relevance);
+        // Step 4: Assemble levels with token budgets
+        const level1 = [];
+        const level2 = [];
+        const level3 = [];
+        const level4 = [];
+        const level5 = [];
+        let level1Tokens = 0;
+        let level2Tokens = 0;
+        let level3Tokens = 0;
+        let level4Tokens = 0;
+        let level5Tokens = 0;
+        // Dynamic budget: each level passes unused tokens to the next level.
+        let surplus = 0;
+        // Step 5: Fill Level 1 Focus (direct matches, highest relevance)
+        const l1Budget = budget.level1;
+        for (const { node, relevance } of scored) {
+            if (!levels.includes(1))
+                break;
+            if (relevance < 0.5)
+                break;
+            const content = node.content;
+            const tokens = estimateTokens(content);
+            if (level1Tokens + tokens > l1Budget)
+                continue;
+            level1.push({ id: node.id, type: node.type, content, relevance });
+            level1Tokens += tokens;
+        }
+        surplus = l1Budget - level1Tokens;
+        const usedIds = new Set(level1.map(n => n.id));
+        // Step 6: Fill Level 2 Active (associated context, proactive injection)
+        const l2Budget = budget.level2 + surplus;
+        if (levels.includes(2)) {
+            // Batch-fetch L1 neighbors in a single query
+            const l1Ids = level1.map(n => n.id);
+            const l1AdjMap = l1Ids.length > 0 ? this.edges.getConnectedNodeIdsForMany(l1Ids) : new Map();
+            const neighborIds = new Set();
+            for (const l1Node of level1) {
+                const connected = l1AdjMap.get(l1Node.id) ?? [];
+                for (const id of connected) {
+                    if (!usedIds.has(id))
+                        neighborIds.add(id);
+                }
+            }
+            const l2Candidates = scored
+                .filter(s => !usedIds.has(s.node.id))
+                .map(s => ({ ...s, isNeighbor: neighborIds.has(s.node.id) }));
+            l2Candidates.sort((a, b) => {
+                if (a.isNeighbor && !b.isNeighbor)
+                    return -1;
+                if (!a.isNeighbor && b.isNeighbor)
+                    return 1;
+                return b.relevance - a.relevance;
+            });
+            for (const { node, relevance } of l2Candidates) {
+                if (relevance < 0.2)
+                    break;
+                const content = node.summary ?? node.content;
+                const tokens = estimateTokens(content);
+                if (level2Tokens + tokens > l2Budget)
+                    continue;
+                level2.push({ id: node.id, type: node.type, content, relevance });
+                level2Tokens += tokens;
+                usedIds.add(node.id);
+            }
+        }
+        surplus = l2Budget - level2Tokens;
+        // Step 7: Fill Level 3 Reference (proactively injected context)
+        const l3Budget = budget.level3 + surplus;
+        if (levels.includes(3)) {
+            const l3Candidates = scored.filter(s => !usedIds.has(s.node.id));
+            for (const { node, relevance } of l3Candidates) {
+                if (relevance < 0.1)
+                    break;
+                const content = node.summary ?? node.content.slice(0, 200);
+                const tokens = estimateTokens(content);
+                if (level3Tokens + tokens > l3Budget)
+                    continue;
+                level3.push({ id: node.id, type: node.type, content, relevance });
+                level3Tokens += tokens;
+                usedIds.add(node.id);
+            }
+        }
+        surplus = l3Budget - level3Tokens;
+        // Step 8: Fill Level 4 Archive (compressed background context)
+        const l4Budget = budget.level4 + surplus;
+        if (levels.includes(4)) {
+            const l4Candidates = scored.filter(s => !usedIds.has(s.node.id));
+            for (const { node, relevance } of l4Candidates) {
+                const content = node.summary ?? node.content.slice(0, 100);
+                const tokens = estimateTokens(content);
+                if (level4Tokens + tokens > l4Budget)
+                    continue;
+                level4.push({ id: node.id, type: node.type, content, relevance });
+                level4Tokens += tokens;
+                usedIds.add(node.id);
+            }
+        }
+        surplus = l4Budget - level4Tokens;
+        // Step 9: Fill Level 5 Deep Archive (minimal references)
+        const l5Budget = budget.level5 + surplus;
+        if (levels.includes(5)) {
+            const l5Candidates = scored.filter(s => !usedIds.has(s.node.id));
+            for (const { node, relevance } of l5Candidates) {
+                const content = node.summary ?? node.content.slice(0, 50);
+                const tokens = estimateTokens(content);
+                if (level5Tokens + tokens > l5Budget)
+                    continue;
+                level5.push({ id: node.id, type: node.type, content, relevance });
+                level5Tokens += tokens;
+            }
+        }
+        const totalTokens = level1Tokens + level2Tokens + level3Tokens + level4Tokens + level5Tokens;
+        const nodeCount = level1.length + level2.length + level3.length + level4.length + level5.length;
+        logger.debug(`Injection: L1=${level1.length} L2=${level2.length} L3=${level3.length} L4=${level4.length} L5=${level5.length} tokens=${totalTokens}`);
+        return {
+            level_1: level1,
+            level_2: level2,
+            level_3: level3,
+            level_4: level4,
+            level_5: level5,
+            total_tokens: totalTokens,
+            node_count: nodeCount,
+        };
+    }
+}
+//# sourceMappingURL=injection.js.map