agentdb 1.0.0

package/dist/reasoning/memory-optimizer.js

@@ -0,0 +1,331 @@
+"use strict";
+/**
+ * MemoryOptimizer - Collapse and compress old memories for efficiency
+ *
+ * Implements memory consolidation strategies:
+ * - Graph-based summarization (similar memories clustered)
+ * - Hierarchical compression (temporal aggregation)
+ * - Quality-based pruning (remove low-value memories)
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MemoryOptimizer = void 0;
+class MemoryOptimizer {
+    constructor(db) {
+        this.memoryNodesTable = 'memory_nodes';
+        this.db = db;
+        this.initializeMemoryNodes();
+    }
+    initializeMemoryNodes() {
+        const rawDb = this.db.getDatabase();
+        rawDb.exec(`
+      CREATE TABLE IF NOT EXISTS ${this.memoryNodesTable} (
+        id TEXT PRIMARY KEY,
+        original_ids TEXT NOT NULL,
+        count INTEGER NOT NULL,
+        quality REAL NOT NULL,
+        domains TEXT NOT NULL,
+        time_range_start INTEGER NOT NULL,
+        time_range_end INTEGER NOT NULL,
+        metadata TEXT,
+        timestamp INTEGER NOT NULL
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_nodes_quality ON ${this.memoryNodesTable}(quality);
+      CREATE INDEX IF NOT EXISTS idx_nodes_time ON ${this.memoryNodesTable}(time_range_end);
+    `);
+    }
+    /**
+     * Collapse old memories into compressed summary nodes
+     *
+     * @param maxAge - Maximum age in milliseconds for memories to collapse
+     * @param strategy - Collapse strategy to use
+     * @returns Number of memories collapsed
+     */
+    async collapseMemories(maxAge = 7 * 24 * 60 * 60 * 1000, // 7 days
+    strategy = {
+        type: 'graph',
+        threshold: 0.9,
+        maxNodes: 100
+    }) {
+        const startTime = Date.now();
+        const cutoffTime = Date.now() - maxAge;
+        // Get old vectors to collapse
+        const oldVectors = this.getOldVectors(cutoffTime, strategy.preserveRecent);
+        if (oldVectors.length === 0) {
+            console.log('[MemoryOptimizer] No memories to collapse');
+            return 0;
+        }
+        let collapsed = 0;
+        switch (strategy.type) {
+            case 'graph':
+                collapsed = await this.graphBasedCollapse(oldVectors, strategy);
+                break;
+            case 'hierarchical':
+                collapsed = await this.hierarchicalCollapse(oldVectors, strategy);
+                break;
+            case 'temporal':
+                collapsed = await this.temporalCollapse(oldVectors, strategy);
+                break;
+        }
+        const duration = Date.now() - startTime;
+        console.log(`[MemoryOptimizer] Collapsed ${collapsed} memories in ${duration}ms using ${strategy.type} strategy`);
+        return collapsed;
+    }
+    /**
+     * Graph-based collapse: cluster similar memories
+     */
+    async graphBasedCollapse(vectors, strategy) {
+        const clusters = this.clusterVectors(vectors, strategy.threshold);
+        let collapsed = 0;
+        for (const cluster of clusters) {
+            if (cluster.length < 2)
+                continue;
+            const node = this.createMemoryNode(cluster);
+            this.storeMemoryNode(node);
+            // Remove original vectors
+            for (const vector of cluster) {
+                this.db.delete(vector.id);
+            }
+            collapsed += cluster.length;
+        }
+        return collapsed;
+    }
+    /**
+     * Hierarchical collapse: aggregate by time periods
+     */
+    async hierarchicalCollapse(vectors, strategy) {
+        // Group by time periods (e.g., daily buckets)
+        const periodSize = 24 * 60 * 60 * 1000; // 1 day
+        const periods = new Map();
+        for (const vector of vectors) {
+            const period = Math.floor(vector.timestamp / periodSize);
+            if (!periods.has(period)) {
+                periods.set(period, []);
+            }
+            periods.get(period).push(vector);
+        }
+        let collapsed = 0;
+        // Collapse each period
+        for (const [period, periodVectors] of periods) {
+            if (periodVectors.length < 2)
+                continue;
+            const node = this.createMemoryNode(periodVectors);
+            this.storeMemoryNode(node);
+            // Remove original vectors
+            for (const vector of periodVectors) {
+                this.db.delete(vector.id);
+            }
+            collapsed += periodVectors.length;
+        }
+        return collapsed;
+    }
+    /**
+     * Temporal collapse: merge sequential memories
+     */
+    async temporalCollapse(vectors, strategy) {
+        // Sort by timestamp
+        vectors.sort((a, b) => a.timestamp - b.timestamp);
+        const sequences = [];
+        let currentSequence = [vectors[0]];
+        for (let i = 1; i < vectors.length; i++) {
+            const timeDiff = vectors[i].timestamp - vectors[i - 1].timestamp;
+            // If within 1 hour, add to sequence
+            if (timeDiff < 60 * 60 * 1000) {
+                currentSequence.push(vectors[i]);
+            }
+            else {
+                if (currentSequence.length >= 2) {
+                    sequences.push(currentSequence);
+                }
+                currentSequence = [vectors[i]];
+            }
+        }
+        if (currentSequence.length >= 2) {
+            sequences.push(currentSequence);
+        }
+        let collapsed = 0;
+        for (const sequence of sequences) {
+            const node = this.createMemoryNode(sequence);
+            this.storeMemoryNode(node);
+            for (const vector of sequence) {
+                this.db.delete(vector.id);
+            }
+            collapsed += sequence.length;
+        }
+        return collapsed;
+    }
+    /**
+     * Cluster vectors based on similarity threshold
+     */
+    clusterVectors(vectors, threshold) {
+        const clusters = [];
+        const assigned = new Set();
+        for (const vector of vectors) {
+            if (assigned.has(vector.id))
+                continue;
+            const cluster = [vector];
+            assigned.add(vector.id);
+            // Find similar vectors
+            const results = this.db.search(vector.embedding, vectors.length, 'cosine', threshold);
+            for (const result of results) {
+                if (result.id !== vector.id && !assigned.has(result.id)) {
+                    const match = vectors.find(v => v.id === result.id);
+                    if (match) {
+                        cluster.push(match);
+                        assigned.add(result.id);
+                    }
+                }
+            }
+            if (cluster.length >= 2) {
+                clusters.push(cluster);
+            }
+        }
+        return clusters;
+    }
+    /**
+     * Create a memory node from a cluster of vectors
+     */
+    createMemoryNode(vectors) {
+        // Calculate centroid (average embedding)
+        const embeddingLength = vectors[0].embedding.length;
+        const centroid = new Array(embeddingLength).fill(0);
+        for (const vector of vectors) {
+            for (let i = 0; i < embeddingLength; i++) {
+                centroid[i] += vector.embedding[i];
+            }
+        }
+        for (let i = 0; i < embeddingLength; i++) {
+            centroid[i] /= vectors.length;
+        }
+        // Extract metadata
+        const originalIds = vectors.map(v => v.id);
+        const domains = [...new Set(vectors.map(v => v.metadata?.domain).filter(Boolean))];
+        const timestamps = vectors.map(v => v.timestamp).sort((a, b) => a - b);
+        // Calculate quality (average of vector qualities)
+        const quality = vectors.reduce((sum, v) => {
+            const q = v.metadata?.quality || 0.5;
+            return sum + q;
+        }, 0) / vectors.length;
+        return {
+            id: this.generateNodeId(),
+            embeddings: vectors.map(v => v.embedding),
+            count: vectors.length,
+            centroid,
+            quality,
+            metadata: {
+                originalIds,
+                domains,
+                timeRange: [timestamps[0], timestamps[timestamps.length - 1]]
+            }
+        };
+    }
+    /**
+     * Store memory node
+     */
+    storeMemoryNode(node) {
+        // Store centroid as searchable vector
+        this.db.insert({
+            id: `node_${node.id}`,
+            embedding: node.centroid,
+            metadata: {
+                type: 'memory_node',
+                nodeId: node.id,
+                count: node.count,
+                quality: node.quality
+            },
+            timestamp: Date.now()
+        });
+        // Store node metadata
+        const rawDb = this.db.getDatabase();
+        const stmt = rawDb.prepare(`
+      INSERT INTO ${this.memoryNodesTable}
+      (id, original_ids, count, quality, domains, time_range_start, time_range_end, metadata, timestamp)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)
+    `);
+        stmt.run(node.id, JSON.stringify(node.metadata.originalIds), node.count, node.quality, JSON.stringify(node.metadata.domains), node.metadata.timeRange[0], node.metadata.timeRange[1], JSON.stringify({ embeddings: node.embeddings }), Date.now());
+    }
+    /**
+     * Query collapsed memory nodes
+     */
+    async queryNodes(queryEmbedding, k = 5) {
+        const results = this.db.search(queryEmbedding, k, 'cosine', 0.7);
+        const nodeResults = results.filter(r => r.metadata?.type === 'memory_node');
+        const nodes = [];
+        const rawDb = this.db.getDatabase();
+        for (const result of nodeResults) {
+            const metadata = result.metadata || {};
+            const nodeId = metadata.nodeId;
+            const stmt = rawDb.prepare(`SELECT * FROM ${this.memoryNodesTable} WHERE id = ?`);
+            const row = stmt.get(nodeId);
+            if (row) {
+                const metadata = JSON.parse(row.metadata);
+                nodes.push({
+                    id: row.id,
+                    embeddings: metadata.embeddings,
+                    count: row.count,
+                    centroid: result.embedding,
+                    quality: row.quality,
+                    metadata: {
+                        originalIds: JSON.parse(row.original_ids),
+                        domains: JSON.parse(row.domains),
+                        timeRange: [row.time_range_start, row.time_range_end]
+                    }
+                });
+            }
+        }
+        return nodes;
+    }
+    /**
+     * Get vectors older than cutoff time
+     */
+    getOldVectors(cutoffTime, preserveRecent) {
+        const rawDb = this.db.getDatabase();
+        let sql = 'SELECT * FROM vectors WHERE timestamp < ?';
+        if (preserveRecent) {
+            // Keep recent 100 vectors regardless of age
+            sql += ` AND id NOT IN (
+        SELECT id FROM vectors
+        ORDER BY timestamp DESC
+        LIMIT 100
+      )`;
+        }
+        const stmt = rawDb.prepare(sql);
+        const rows = stmt.all(cutoffTime);
+        return rows.map(row => ({
+            id: row.id,
+            embedding: this.deserializeEmbedding(row.embedding),
+            metadata: row.metadata ? JSON.parse(row.metadata) : {},
+            timestamp: row.timestamp
+        }));
+    }
+    deserializeEmbedding(buffer) {
+        const view = new Float32Array(buffer.buffer, buffer.byteOffset, buffer.byteLength / 4);
+        return Array.from(view);
+    }
+    /**
+     * Get memory optimization statistics
+     */
+    getStats() {
+        const rawDb = this.db.getDatabase();
+        const countStmt = rawDb.prepare(`SELECT COUNT(*) as count FROM ${this.memoryNodesTable}`);
+        const totalNodes = countStmt.get().count;
+        const sumStmt = rawDb.prepare(`SELECT SUM(count) as sum FROM ${this.memoryNodesTable}`);
+        const totalCollapsed = sumStmt.get().sum || 0;
+        const qualityStmt = rawDb.prepare(`SELECT AVG(quality) as avg FROM ${this.memoryNodesTable}`);
+        const avgQuality = qualityStmt.get().avg || 0;
+        const memoryReduction = totalCollapsed > 0
+            ? ((totalCollapsed - totalNodes) / totalCollapsed) * 100
+            : 0;
+        return {
+            totalNodes,
+            totalCollapsed,
+            avgQuality,
+            memoryReduction
+        };
+    }
+    generateNodeId() {
+        return `node_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`;
+    }
+}
+exports.MemoryOptimizer = MemoryOptimizer;
+//# sourceMappingURL=memory-optimizer.js.map

package/dist/reasoning/memory-optimizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-optimizer.js","sourceRoot":"","sources":["../../src/reasoning/memory-optimizer.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAKH,MAAa,eAAe;IAI1B,YAAY,EAAkB;QAFtB,qBAAgB,GAAG,cAAc,CAAC;QAGxC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,qBAAqB,EAAE,CAAC;IAC/B,CAAC;IAEO,qBAAqB;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QAEpC,KAAK,CAAC,IAAI,CAAC;mCACoB,IAAI,CAAC,gBAAgB;;;;;;;;;;;;wDAYA,IAAI,CAAC,gBAAgB;qDACxB,IAAI,CAAC,gBAAgB;KACrE,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,gBAAgB,CACpB,SAAiB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,SAAS;IACnD,WAA6B;QAC3B,IAAI,EAAE,OAAO;QACb,SAAS,EAAE,GAAG;QACd,QAAQ,EAAE,GAAG;KACd;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC;QAEvC,8BAA8B;QAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,cAAc,CAAC,CAAC;QAE3E,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,2CAA2C,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;YACtB,KAAK,OAAO;gBACV,SAAS,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;gBAChE,MAAM;YAER,KAAK,cAAc;gBACjB,SAAS,GAAG,MAAM,IAAI,CAAC,oBAAoB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;gBAClE,MAAM;YAER,KAAK,UAAU;gBACb,SAAS,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;gBAC9D,MAAM;QACV,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,+BAA+B,SAAS,gBAAgB,QAAQ,YAAY,QAAQ,CAAC,IAAI,WAAW,CAAC,CAAC;QAElH,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,kBAAkB,CAC9B,OAAc,EACd,QAA0B;QAE1B,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;QAClE,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAEjC,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAC5C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YAE3B,0BAA0B;YAC1B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;YAED,SAAS,IAAI,OAAO,CAAC,MAAM,CAAC;QAC9B,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,oBAAoB,CAChC,OAAc,EACd,QAA0B;QAE1B,8CAA8C;QAC9C,MAAM,UAAU,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,QAAQ;QAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAC;QAEzC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC;YACzD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAC1B,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,uBAAuB;QACvB,KAAK,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,IAAI,OAAO,EAAE,CAAC;YAC9C,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAEvC,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC;YAClD,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YAE3B,0BAA0B;YAC1B,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;gBACnC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;YAED,SAAS,IAAI,aAAa,CAAC,MAAM,CAAC;QACpC,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,gBAAgB,CAC5B,OAAc,EACd,QAA0B;QAE1B,oBAAoB;QACpB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAElD,MAAM,SAAS,GAAY,EAAE,CAAC;QAC9B,IAAI,eAAe,GAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;YAEjE,oCAAoC;YACpC,IAAI,QAAQ,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;gBAC9B,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACN,IAAI,eAAe,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;oBAChC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBAClC,CAAC;gBACD,eAAe,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,IAAI,eAAe,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAChC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAClC,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;YAC7C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YAE3B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;YAED,SAAS,IAAI,QAAQ,CAAC,MAAM,CAAC;QAC/B,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,OAAc,EAAE,SAAiB;QACtD,MAAM,QAAQ,GAAY,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QAEnC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEtC,MAAM,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;YACzB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAExB,uBAAuB;YACvB,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YAEtF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;oBACxD,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;oBACpD,IAAI,KAAK,EAAE,CAAC;wBACV,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBACpB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;oBAC1B,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACxB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,OAAc;QACrC,yCAAyC;QACzC,MAAM,eAAe,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEpD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,QAAQ,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,QAAQ,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC;QAChC,CAAC;QAED,mBAAmB;QACnB,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACnF,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAEvE,kDAAkD;QAClD,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;YACxC,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,OAAO,IAAI,GAAG,CAAC;YACrC,OAAO,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QAEvB,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,cAAc,EAAE;YACzB,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;YACzC,KAAK,EAAE,OAAO,CAAC,MAAM;YACrB,QAAQ;YACR,OAAO;YACP,QAAQ,EAAE;gBACR,WAAW;gBACX,OAAO;gBACP,SAAS,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;aAC9D;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,IAAgB;QACtC,sCAAsC;QACtC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC;YACb,EAAE,EAAE,QAAQ,IAAI,CAAC,EAAE,EAAE;YACrB,SAAS,EAAE,IAAI,CAAC,QAAQ;YACxB,QAAQ,EAAE;gBACR,IAAI,EAAE,aAAa;gBACnB,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,OAAO,EAAE,IAAI,CAAC,OAAO;aACtB;YACD,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC,CAAC;QAEH,sBAAsB;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC;oBACX,IAAI,CAAC,gBAAgB;;;KAGpC,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CACN,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,EACzC,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EACrC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAC1B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAC1B,IAAI,CAAC,SAAS,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,EAC/C,IAAI,CAAC,GAAG,EAAE,CACX,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CACd,cAAwB,EACxB,IAAY,CAAC;QAEb,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QACjE,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,aAAa,CAAC,CAAC;QAE5E,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QAEpC,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC;YACvC,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,iBAAiB,IAAI,CAAC,gBAAgB,eAAe,CAAC,CAAC;YAClF,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAQ,CAAC;YAEpC,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAE1C,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,KAAK,EAAE,GAAG,CAAC,KAAK;oBAChB,QAAQ,EAAE,MAAM,CAAC,SAAS;oBAC1B,OAAO,EAAE,GAAG,CAAC,OAAO;oBACpB,QAAQ,EAAE;wBACR,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC;wBACzC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC;wBAChC,SAAS,EAAE,CAAC,GAAG,CAAC,gBAAgB,EAAE,GAAG,CAAC,cAAc,CAAC;qBACtD;iBACF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,UAAkB,EAAE,cAAwB;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QAEpC,IAAI,GAAG,GAAG,2CAA2C,CAAC;QAEtD,IAAI,cAAc,EAAE,CAAC;YACnB,4CAA4C;YAC5C,GAAG,IAAI;;;;QAIL,CAAC;QACL,CAAC;QAED,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAU,CAAC;QAE3C,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtB,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,SAAS,EAAE,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC;YACnD,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;YACtD,SAAS,EAAE,GAAG,CAAC,SAAS;SACzB,CAAC,CAAC,CAAC;IACN,CAAC;IAEO,oBAAoB,CAAC,MAAc;QACzC,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QACvF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,QAAQ;QAMN,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QAEpC,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,iCAAiC,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC;QAC1F,MAAM,UAAU,GAAI,SAAS,CAAC,GAAG,EAAU,CAAC,KAAK,CAAC;QAElD,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,iCAAiC,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC;QACxF,MAAM,cAAc,GAAI,OAAO,CAAC,GAAG,EAAU,CAAC,GAAG,IAAI,CAAC,CAAC;QAEvD,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,mCAAmC,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC;QAC9F,MAAM,UAAU,GAAI,WAAW,CAAC,GAAG,EAAU,CAAC,GAAG,IAAI,CAAC,CAAC;QAEvD,MAAM,eAAe,GAAG,cAAc,GAAG,CAAC;YACxC,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,UAAU,CAAC,GAAG,cAAc,CAAC,GAAG,GAAG;YACxD,CAAC,CAAC,CAAC,CAAC;QAEN,OAAO;YACL,UAAU;YACV,cAAc;YACd,UAAU;YACV,eAAe;SAChB,CAAC;IACJ,CAAC;IAEO,cAAc;QACpB,OAAO,QAAQ,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;IACzE,CAAC;CACF;AA9ZD,0CA8ZC"}

package/dist/reasoning/memory-optimizer.mjs

@@ -0,0 +1,326 @@
+/**
+ * MemoryOptimizer - Collapse and compress old memories for efficiency
+ *
+ * Implements memory consolidation strategies:
+ * - Graph-based summarization (similar memories clustered)
+ * - Hierarchical compression (temporal aggregation)
+ * - Quality-based pruning (remove low-value memories)
+ */
+export class MemoryOptimizer {
+    constructor(db) {
+        this.memoryNodesTable = 'memory_nodes';
+        this.db = db;
+        this.initializeMemoryNodes();
+    }
+    initializeMemoryNodes() {
+        const rawDb = this.db.getDatabase();
+        rawDb.exec(`
+      CREATE TABLE IF NOT EXISTS ${this.memoryNodesTable} (
+        id TEXT PRIMARY KEY,
+        original_ids TEXT NOT NULL,
+        count INTEGER NOT NULL,
+        quality REAL NOT NULL,
+        domains TEXT NOT NULL,
+        time_range_start INTEGER NOT NULL,
+        time_range_end INTEGER NOT NULL,
+        metadata TEXT,
+        timestamp INTEGER NOT NULL
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_nodes_quality ON ${this.memoryNodesTable}(quality);
+      CREATE INDEX IF NOT EXISTS idx_nodes_time ON ${this.memoryNodesTable}(time_range_end);
+    `);
+    }
+    /**
+     * Collapse old memories into compressed summary nodes
+     *
+     * @param maxAge - Maximum age in milliseconds for memories to collapse
+     * @param strategy - Collapse strategy to use
+     * @returns Number of memories collapsed
+     */
+    async collapseMemories(maxAge = 7 * 24 * 60 * 60 * 1000, // 7 days
+    strategy = {
+        type: 'graph',
+        threshold: 0.9,
+        maxNodes: 100
+    }) {
+        const startTime = Date.now();
+        const cutoffTime = Date.now() - maxAge;
+        // Get old vectors to collapse
+        const oldVectors = this.getOldVectors(cutoffTime, strategy.preserveRecent);
+        if (oldVectors.length === 0) {
+            console.log('[MemoryOptimizer] No memories to collapse');
+            return 0;
+        }
+        let collapsed = 0;
+        switch (strategy.type) {
+            case 'graph':
+                collapsed = await this.graphBasedCollapse(oldVectors, strategy);
+                break;
+            case 'hierarchical':
+                collapsed = await this.hierarchicalCollapse(oldVectors, strategy);
+                break;
+            case 'temporal':
+                collapsed = await this.temporalCollapse(oldVectors, strategy);
+                break;
+        }
+        const duration = Date.now() - startTime;
+        console.log(`[MemoryOptimizer] Collapsed ${collapsed} memories in ${duration}ms using ${strategy.type} strategy`);
+        return collapsed;
+    }
+    /**
+     * Graph-based collapse: cluster similar memories
+     */
+    async graphBasedCollapse(vectors, strategy) {
+        const clusters = this.clusterVectors(vectors, strategy.threshold);
+        let collapsed = 0;
+        for (const cluster of clusters) {
+            if (cluster.length < 2)
+                continue;
+            const node = this.createMemoryNode(cluster);
+            this.storeMemoryNode(node);
+            // Remove original vectors
+            for (const vector of cluster) {
+                this.db.delete(vector.id);
+            }
+            collapsed += cluster.length;
+        }
+        return collapsed;
+    }
+    /**
+     * Hierarchical collapse: aggregate by time periods
+     */
+    async hierarchicalCollapse(vectors, strategy) {
+        // Group by time periods (e.g., daily buckets)
+        const periodSize = 24 * 60 * 60 * 1000; // 1 day
+        const periods = new Map();
+        for (const vector of vectors) {
+            const period = Math.floor(vector.timestamp / periodSize);
+            if (!periods.has(period)) {
+                periods.set(period, []);
+            }
+            periods.get(period).push(vector);
+        }
+        let collapsed = 0;
+        // Collapse each period
+        for (const [period, periodVectors] of periods) {
+            if (periodVectors.length < 2)
+                continue;
+            const node = this.createMemoryNode(periodVectors);
+            this.storeMemoryNode(node);
+            // Remove original vectors
+            for (const vector of periodVectors) {
+                this.db.delete(vector.id);
+            }
+            collapsed += periodVectors.length;
+        }
+        return collapsed;
+    }
+    /**
+     * Temporal collapse: merge sequential memories
+     */
+    async temporalCollapse(vectors, strategy) {
+        // Sort by timestamp
+        vectors.sort((a, b) => a.timestamp - b.timestamp);
+        const sequences = [];
+        let currentSequence = [vectors[0]];
+        for (let i = 1; i < vectors.length; i++) {
+            const timeDiff = vectors[i].timestamp - vectors[i - 1].timestamp;
+            // If within 1 hour, add to sequence
+            if (timeDiff < 60 * 60 * 1000) {
+                currentSequence.push(vectors[i]);
+            }
+            else {
+                if (currentSequence.length >= 2) {
+                    sequences.push(currentSequence);
+                }
+                currentSequence = [vectors[i]];
+            }
+        }
+        if (currentSequence.length >= 2) {
+            sequences.push(currentSequence);
+        }
+        let collapsed = 0;
+        for (const sequence of sequences) {
+            const node = this.createMemoryNode(sequence);
+            this.storeMemoryNode(node);
+            for (const vector of sequence) {
+                this.db.delete(vector.id);
+            }
+            collapsed += sequence.length;
+        }
+        return collapsed;
+    }
+    /**
+     * Cluster vectors based on similarity threshold
+     */
+    clusterVectors(vectors, threshold) {
+        const clusters = [];
+        const assigned = new Set();
+        for (const vector of vectors) {
+            if (assigned.has(vector.id))
+                continue;
+            const cluster = [vector];
+            assigned.add(vector.id);
+            // Find similar vectors
+            const results = this.db.search(vector.embedding, vectors.length, 'cosine', threshold);
+            for (const result of results) {
+                if (result.id !== vector.id && !assigned.has(result.id)) {
+                    const match = vectors.find(v => v.id === result.id);
+                    if (match) {
+                        cluster.push(match);
+                        assigned.add(result.id);
+                    }
+                }
+            }
+            if (cluster.length >= 2) {
+                clusters.push(cluster);
+            }
+        }
+        return clusters;
+    }
+    /**
+     * Create a memory node from a cluster of vectors
+     */
+    createMemoryNode(vectors) {
+        // Calculate centroid (average embedding)
+        const embeddingLength = vectors[0].embedding.length;
+        const centroid = new Array(embeddingLength).fill(0);
+        for (const vector of vectors) {
+            for (let i = 0; i < embeddingLength; i++) {
+                centroid[i] += vector.embedding[i];
+            }
+        }
+        for (let i = 0; i < embeddingLength; i++) {
+            centroid[i] /= vectors.length;
+        }
+        // Extract metadata
+        const originalIds = vectors.map(v => v.id);
+        const domains = [...new Set(vectors.map(v => v.metadata?.domain).filter(Boolean))];
+        const timestamps = vectors.map(v => v.timestamp).sort((a, b) => a - b);
+        // Calculate quality (average of vector qualities)
+        const quality = vectors.reduce((sum, v) => {
+            const q = v.metadata?.quality || 0.5;
+            return sum + q;
+        }, 0) / vectors.length;
+        return {
+            id: this.generateNodeId(),
+            embeddings: vectors.map(v => v.embedding),
+            count: vectors.length,
+            centroid,
+            quality,
+            metadata: {
+                originalIds,
+                domains,
+                timeRange: [timestamps[0], timestamps[timestamps.length - 1]]
+            }
+        };
+    }
+    /**
+     * Store memory node
+     */
+    storeMemoryNode(node) {
+        // Store centroid as searchable vector
+        this.db.insert({
+            id: `node_${node.id}`,
+            embedding: node.centroid,
+            metadata: {
+                type: 'memory_node',
+                nodeId: node.id,
+                count: node.count,
+                quality: node.quality
+            },
+            timestamp: Date.now()
+        });
+        // Store node metadata
+        const rawDb = this.db.getDatabase();
+        const stmt = rawDb.prepare(`
+      INSERT INTO ${this.memoryNodesTable}
+      (id, original_ids, count, quality, domains, time_range_start, time_range_end, metadata, timestamp)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)
+    `);
+        stmt.run(node.id, JSON.stringify(node.metadata.originalIds), node.count, node.quality, JSON.stringify(node.metadata.domains), node.metadata.timeRange[0], node.metadata.timeRange[1], JSON.stringify({ embeddings: node.embeddings }), Date.now());
+    }
+    /**
+     * Query collapsed memory nodes
+     */
+    async queryNodes(queryEmbedding, k = 5) {
+        const results = this.db.search(queryEmbedding, k, 'cosine', 0.7);
+        const nodeResults = results.filter(r => r.metadata?.type === 'memory_node');
+        const nodes = [];
+        const rawDb = this.db.getDatabase();
+        for (const result of nodeResults) {
+            const metadata = result.metadata || {};
+            const nodeId = metadata.nodeId;
+            const stmt = rawDb.prepare(`SELECT * FROM ${this.memoryNodesTable} WHERE id = ?`);
+            const row = stmt.get(nodeId);
+            if (row) {
+                const metadata = JSON.parse(row.metadata);
+                nodes.push({
+                    id: row.id,
+                    embeddings: metadata.embeddings,
+                    count: row.count,
+                    centroid: result.embedding,
+                    quality: row.quality,
+                    metadata: {
+                        originalIds: JSON.parse(row.original_ids),
+                        domains: JSON.parse(row.domains),
+                        timeRange: [row.time_range_start, row.time_range_end]
+                    }
+                });
+            }
+        }
+        return nodes;
+    }
+    /**
+     * Get vectors older than cutoff time
+     */
+    getOldVectors(cutoffTime, preserveRecent) {
+        const rawDb = this.db.getDatabase();
+        let sql = 'SELECT * FROM vectors WHERE timestamp < ?';
+        if (preserveRecent) {
+            // Keep recent 100 vectors regardless of age
+            sql += ` AND id NOT IN (
+        SELECT id FROM vectors
+        ORDER BY timestamp DESC
+        LIMIT 100
+      )`;
+        }
+        const stmt = rawDb.prepare(sql);
+        const rows = stmt.all(cutoffTime);
+        return rows.map(row => ({
+            id: row.id,
+            embedding: this.deserializeEmbedding(row.embedding),
+            metadata: row.metadata ? JSON.parse(row.metadata) : {},
+            timestamp: row.timestamp
+        }));
+    }
+    deserializeEmbedding(buffer) {
+        const view = new Float32Array(buffer.buffer, buffer.byteOffset, buffer.byteLength / 4);
+        return Array.from(view);
+    }
+    /**
+     * Get memory optimization statistics
+     */
+    getStats() {
+        const rawDb = this.db.getDatabase();
+        const countStmt = rawDb.prepare(`SELECT COUNT(*) as count FROM ${this.memoryNodesTable}`);
+        const totalNodes = countStmt.get().count;
+        const sumStmt = rawDb.prepare(`SELECT SUM(count) as sum FROM ${this.memoryNodesTable}`);
+        const totalCollapsed = sumStmt.get().sum || 0;
+        const qualityStmt = rawDb.prepare(`SELECT AVG(quality) as avg FROM ${this.memoryNodesTable}`);
+        const avgQuality = qualityStmt.get().avg || 0;
+        const memoryReduction = totalCollapsed > 0
+            ? ((totalCollapsed - totalNodes) / totalCollapsed) * 100
+            : 0;
+        return {
+            totalNodes,
+            totalCollapsed,
+            avgQuality,
+            memoryReduction
+        };
+    }
+    generateNodeId() {
+        return `node_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`;
+    }
+}