vesper-memory 0.3.0

package/dist/consolidation/pipeline.js

@@ -0,0 +1,193 @@
+/**
+ * Consolidation Pipeline - v3.0 Implementation
+ *
+ * Nightly process: working → semantic memory transformation.
+ * Runs at 3 AM, extracts knowledge, applies decay, detects conflicts.
+ */
+export class ConsolidationPipeline {
+    workingMemory;
+    semanticMemory;
+    skillLibrary;
+    db;
+    constructor(workingMemory, semanticMemory, skillLibrary, db) {
+        this.workingMemory = workingMemory;
+        this.semanticMemory = semanticMemory;
+        this.skillLibrary = skillLibrary;
+        this.db = db;
+    }
+    /**
+     * Run full consolidation cycle
+     */
+    async consolidate() {
+        const startTime = Date.now();
+        console.error('[CONSOLIDATION] Starting consolidation cycle...');
+        const stats = {
+            memoriesProcessed: 0,
+            entitiesExtracted: 0,
+            relationshipsCreated: 0,
+            conflictsDetected: 0,
+            memoriesPruned: 0,
+            skillsExtracted: 0,
+            duration: 0,
+        };
+        try {
+            // Step 1: Extract from working memory
+            const recentMemories = await this.workingMemory.getRecent(100);
+            stats.memoriesProcessed = recentMemories.length;
+            for (const memory of recentMemories) {
+                // Extract entities and relationships
+                const extracted = this.extractKnowledge(memory);
+                for (const entity of extracted.entities) {
+                    this.semanticMemory.upsertEntity(entity);
+                    stats.entitiesExtracted++;
+                }
+                for (const rel of extracted.relationships) {
+                    this.semanticMemory.upsertRelationship(rel);
+                    stats.relationshipsCreated++;
+                }
+            }
+            // Step 2: Apply temporal decay
+            this.semanticMemory.applyTemporalDecay();
+            // Step 3: Detect conflicts
+            stats.conflictsDetected = this.detectConflicts();
+            // Step 4: Prune low-value memories
+            stats.memoriesPruned = this.pruneMemories();
+            // Step 5: Extract skills (simplified)
+            stats.skillsExtracted = this.extractSkills(recentMemories);
+            // Step 6: Create backup
+            this.createBackup();
+            stats.duration = Date.now() - startTime;
+            console.error(`[CONSOLIDATION] Complete! Processed ${stats.memoriesProcessed} memories in ${stats.duration}ms`);
+            console.error(`[CONSOLIDATION] Extracted ${stats.entitiesExtracted} entities, ${stats.relationshipsCreated} relationships`);
+            console.error(`[CONSOLIDATION] Detected ${stats.conflictsDetected} conflicts, pruned ${stats.memoriesPruned} memories`);
+            return stats;
+        }
+        catch (error) {
+            console.error('[CONSOLIDATION] Error:', error);
+            throw error;
+        }
+    }
+    /**
+     * Extract entities and relationships from memory
+     * Simple keyword-based extraction (will enhance with LLM later)
+     */
+    extractKnowledge(memory) {
+        const entities = [];
+        const relationships = [];
+        // Use pre-extracted entities if available
+        if (memory.keyEntities && memory.keyEntities.length > 0) {
+            for (const entityName of memory.keyEntities) {
+                entities.push({
+                    name: entityName,
+                    type: 'concept',
+                    confidence: 0.8,
+                });
+            }
+        }
+        // Extract preferences
+        const prefPatterns = [
+            /prefer (\w+)/gi,
+            /like (\w+)/gi,
+            /favorite is (\w+)/gi,
+        ];
+        for (const pattern of prefPatterns) {
+            const matches = memory.fullText.matchAll(pattern);
+            for (const match of matches) {
+                entities.push({
+                    name: match[1],
+                    type: 'preference',
+                    confidence: 0.9,
+                });
+            }
+        }
+        return { entities, relationships };
+    }
+    /**
+     * Detect simple conflicts (temporal impossibilities, contradictions)
+     */
+    detectConflicts() {
+        let detected = 0;
+        // Temporal conflicts: same property, overlapping time ranges, different values
+        const conflicts = this.db.prepare(`
+      SELECT f1.id as id1, f2.id as id2, f1.property, f1.value as val1, f2.value as val2
+      FROM facts f1
+      JOIN facts f2 ON f1.entity_id = f2.entity_id AND f1.property = f2.property
+      WHERE f1.id < f2.id
+        AND f1.value != f2.value
+        AND f1.valid_until IS NULL
+        AND f2.valid_until IS NULL
+    `).all();
+        for (const conflict of conflicts) {
+            // Check if already flagged
+            const existing = this.db.prepare('SELECT * FROM conflicts WHERE fact_id_1 = ? AND fact_id_2 = ?').get(conflict.id1, conflict.id2);
+            if (!existing) {
+                const conflictId = 'conflict_' + Date.now() + '_' + Math.random().toString(36).substr(2, 9);
+                this.db.prepare(`
+          INSERT INTO conflicts (id, fact_id_1, fact_id_2, conflict_type, description, severity, resolution_status)
+          VALUES (?, ?, ?, ?, ?, ?, ?)
+        `).run(conflictId, conflict.id1, conflict.id2, 'contradiction', `Conflicting values for ${conflict.property}: "${conflict.val1}" vs "${conflict.val2}"`, 'medium', 'flagged');
+                // Lower confidence on both facts
+                this.db.prepare('UPDATE facts SET confidence = 0.5 WHERE id = ?').run(conflict.id1);
+                this.db.prepare('UPDATE facts SET confidence = 0.5 WHERE id = ?').run(conflict.id2);
+                detected++;
+            }
+        }
+        return detected;
+    }
+    /**
+     * Prune low-value memories
+     */
+    pruneMemories() {
+        // Find relationships to prune (weak relationships with low-access entities)
+        const toPrune = this.db.prepare(`
+      SELECT r.id
+      FROM relationships r
+      INNER JOIN entities source ON r.source_id = source.id
+      INNER JOIN entities target ON r.target_id = target.id
+      WHERE r.strength < 0.05
+        AND source.access_count < 3
+        AND target.access_count < 3
+    `).all();
+        // Delete them
+        let deleted = 0;
+        for (const row of toPrune) {
+            this.db.prepare('DELETE FROM relationships WHERE id = ?').run(row.id);
+            deleted++;
+        }
+        return deleted;
+    }
+    /**
+     * Extract skills from positive interactions
+     */
+    extractSkills(memories) {
+        let extracted = 0;
+        for (const memory of memories) {
+            // Look for repeated patterns
+            if (memory.topics && memory.topics.includes('analysis')) {
+                // Check if skill already exists
+                const existing = this.skillLibrary.search('data analysis', 1);
+                if (existing.length === 0) {
+                    this.skillLibrary.addSkill({
+                        name: 'Data Analysis',
+                        description: 'Analyze datasets and provide insights',
+                        category: 'analysis',
+                        triggers: ['analyze', 'data', 'insights'],
+                    });
+                    extracted++;
+                }
+            }
+        }
+        return extracted;
+    }
+    /**
+     * Create backup for rollback capability
+     */
+    createBackup() {
+        const backupId = 'backup_' + Date.now() + '_' + Math.random().toString(36).substr(2, 9);
+        this.db.prepare(`
+      INSERT INTO backup_metadata (id, backup_type, backup_path, created_at, expires_at)
+      VALUES (?, ?, ?, ?, ?)
+    `).run(backupId, 'consolidation', './backups/' + backupId + '.db', new Date().toISOString(), new Date(Date.now() + 7 * 24 * 60 * 60 * 1000).toISOString());
+    }
+}
+//# sourceMappingURL=pipeline.js.map

package/dist/consolidation/pipeline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline.js","sourceRoot":"","sources":["../../src/consolidation/pipeline.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAiBH,MAAM,OAAO,qBAAqB;IACxB,aAAa,CAAqB;IAClC,cAAc,CAAsB;IACpC,YAAY,CAAe;IAC3B,EAAE,CAAoB;IAE9B,YACE,aAAiC,EACjC,cAAmC,EACnC,YAA0B,EAC1B,EAAqB;QAErB,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW;QACf,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,OAAO,CAAC,KAAK,CAAC,iDAAiD,CAAC,CAAC;QAEjE,MAAM,KAAK,GAAuB;YAChC,iBAAiB,EAAE,CAAC;YACpB,iBAAiB,EAAE,CAAC;YACpB,oBAAoB,EAAE,CAAC;YACvB,iBAAiB,EAAE,CAAC;YACpB,cAAc,EAAE,CAAC;YACjB,eAAe,EAAE,CAAC;YAClB,QAAQ,EAAE,CAAC;SACZ,CAAC;QAEF,IAAI,CAAC;YACH,sCAAsC;YACtC,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAC/D,KAAK,CAAC,iBAAiB,GAAG,cAAc,CAAC,MAAM,CAAC;YAEhD,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;gBACpC,qCAAqC;gBACrC,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;gBAEhD,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;oBACxC,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;oBACzC,KAAK,CAAC,iBAAiB,EAAE,CAAC;gBAC5B,CAAC;gBAED,KAAK,MAAM,GAAG,IAAI,SAAS,CAAC,aAAa,EAAE,CAAC;oBAC1C,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;oBAC5C,KAAK,CAAC,oBAAoB,EAAE,CAAC;gBAC/B,CAAC;YACH,CAAC;YAED,+BAA+B;YAC/B,IAAI,CAAC,cAAc,CAAC,kBAAkB,EAAE,CAAC;YAEzC,2BAA2B;YAC3B,KAAK,CAAC,iBAAiB,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YAEjD,mCAAmC;YACnC,KAAK,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YAE5C,sCAAsC;YACtC,KAAK,CAAC,eAAe,GAAG,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;YAE3D,wBAAwB;YACxB,IAAI,CAAC,YAAY,EAAE,CAAC;YAEpB,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAExC,OAAO,CAAC,KAAK,CAAC,uCAAuC,KAAK,CAAC,iBAAiB,gBAAgB,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC;YAChH,OAAO,CAAC,KAAK,CAAC,6BAA6B,KAAK,CAAC,iBAAiB,cAAc,KAAK,CAAC,oBAAoB,gBAAgB,CAAC,CAAC;YAC5H,OAAO,CAAC,KAAK,CAAC,4BAA4B,KAAK,CAAC,iBAAiB,sBAAsB,KAAK,CAAC,cAAc,WAAW,CAAC,CAAC;YAExH,OAAO,KAAK,CAAC;QACf,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,wBAAwB,EAAE,KAAK,CAAC,CAAC;YAC/C,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,gBAAgB,CAAC,MAAW;QAIlC,MAAM,QAAQ,GAAuG,EAAE,CAAC;QACxH,MAAM,aAAa,GAAU,EAAE,CAAC;QAEhC,0CAA0C;QAC1C,IAAI,MAAM,CAAC,WAAW,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;gBAC5C,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,SAAkB;oBACxB,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,sBAAsB;QACtB,MAAM,YAAY,GAAG;YACnB,gBAAgB;YAChB,cAAc;YACd,qBAAqB;SACtB,CAAC;QAEF,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAClD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;oBACd,IAAI,EAAE,YAAqB;oBAC3B,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC;IACrC,CAAC;IAED;;OAEG;IACK,eAAe;QACrB,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,+EAA+E;QAC/E,MAAM,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;KAQjC,CAAC,CAAC,GAAG,EAAW,CAAC;QAElB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,2BAA2B;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC9B,+DAA+D,CAChE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;YAElC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,MAAM,UAAU,GAAG,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAE5F,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;SAGf,CAAC,CAAC,GAAG,CACJ,UAAU,EACV,QAAQ,CAAC,GAAG,EACZ,QAAQ,CAAC,GAAG,EACZ,eAAe,EACf,0BAA0B,QAAQ,CAAC,QAAQ,MAAM,QAAQ,CAAC,IAAI,SAAS,QAAQ,CAAC,IAAI,GAAG,EACvF,QAAQ,EACR,SAAS,CACV,CAAC;gBAEF,iCAAiC;gBACjC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gDAAgD,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACpF,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gDAAgD,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBAEpF,QAAQ,EAAE,CAAC;YACb,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,aAAa;QACnB,4EAA4E;QAC5E,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;KAQ/B,CAAC,CAAC,GAAG,EAAW,CAAC;QAElB,cAAc;QACd,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtE,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,QAAe;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,6BAA6B;YAC7B,IAAI,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACxD,gCAAgC;gBAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;gBAE9D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1B,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;wBACzB,IAAI,EAAE,eAAe;wBACrB,WAAW,EAAE,uCAAuC;wBACpD,QAAQ,EAAE,UAAU;wBACpB,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC;qBAC1C,CAAC,CAAC;oBACH,SAAS,EAAE,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,YAAY;QAClB,MAAM,QAAQ,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAExF,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAGf,CAAC,CAAC,GAAG,CACJ,QAAQ,EACR,eAAe,EACf,YAAY,GAAG,QAAQ,GAAG,KAAK,EAC/B,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EACxB,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,WAAW,EAAE,CAC7D,CAAC;IACJ,CAAC;CACF"}

package/dist/consolidation 2/pipeline.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Consolidation Pipeline - v3.0 Implementation
+ *
+ * Nightly process: working → semantic memory transformation.
+ * Runs at 3 AM, extracts knowledge, applies decay, detects conflicts.
+ */
+import { WorkingMemoryLayer } from '../memory-layers/working-memory.js';
+import { SemanticMemoryLayer } from '../memory-layers/semantic-memory.js';
+import { SkillLibrary } from '../memory-layers/skill-library.js';
+import Database from 'better-sqlite3';
+export interface ConsolidationStats {
+    memoriesProcessed: number;
+    entitiesExtracted: number;
+    relationshipsCreated: number;
+    conflictsDetected: number;
+    memoriesPruned: number;
+    skillsExtracted: number;
+    duration: number;
+}
+export declare class ConsolidationPipeline {
+    private workingMemory;
+    private semanticMemory;
+    private skillLibrary;
+    private db;
+    constructor(workingMemory: WorkingMemoryLayer, semanticMemory: SemanticMemoryLayer, skillLibrary: SkillLibrary, db: Database.Database);
+    /**
+     * Run full consolidation cycle
+     */
+    consolidate(): Promise<ConsolidationStats>;
+    /**
+     * Extract entities and relationships from memory
+     * Simple keyword-based extraction (will enhance with LLM later)
+     */
+    private extractKnowledge;
+    /**
+     * Detect simple conflicts (temporal impossibilities, contradictions)
+     */
+    private detectConflicts;
+    /**
+     * Prune low-value memories
+     */
+    private pruneMemories;
+    /**
+     * Extract skills from positive interactions
+     */
+    private extractSkills;
+    /**
+     * Create backup for rollback capability
+     */
+    private createBackup;
+}
+//# sourceMappingURL=pipeline.d.ts.map

package/dist/consolidation 2/pipeline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline.d.ts","sourceRoot":"","sources":["../../src/consolidation/pipeline.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,oCAAoC,CAAC;AACxE,OAAO,EAAE,mBAAmB,EAAE,MAAM,qCAAqC,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AACjE,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AAEtC,MAAM,WAAW,kBAAkB;IACjC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,oBAAoB,EAAE,MAAM,CAAC;IAC7B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,qBAAa,qBAAqB;IAChC,OAAO,CAAC,aAAa,CAAqB;IAC1C,OAAO,CAAC,cAAc,CAAsB;IAC5C,OAAO,CAAC,YAAY,CAAe;IACnC,OAAO,CAAC,EAAE,CAAoB;gBAG5B,aAAa,EAAE,kBAAkB,EACjC,cAAc,EAAE,mBAAmB,EACnC,YAAY,EAAE,YAAY,EAC1B,EAAE,EAAE,QAAQ,CAAC,QAAQ;IAQvB;;OAEG;IACG,WAAW,IAAI,OAAO,CAAC,kBAAkB,CAAC;IA8DhD;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IAuCxB;;OAEG;IACH,OAAO,CAAC,eAAe;IA+CvB;;OAEG;IACH,OAAO,CAAC,aAAa;IAsBrB;;OAEG;IACH,OAAO,CAAC,aAAa;IAwBrB;;OAEG;IACH,OAAO,CAAC,YAAY;CAcrB"}

package/dist/consolidation 2/pipeline.js

@@ -0,0 +1,193 @@
+/**
+ * Consolidation Pipeline - v3.0 Implementation
+ *
+ * Nightly process: working → semantic memory transformation.
+ * Runs at 3 AM, extracts knowledge, applies decay, detects conflicts.
+ */
+export class ConsolidationPipeline {
+    workingMemory;
+    semanticMemory;
+    skillLibrary;
+    db;
+    constructor(workingMemory, semanticMemory, skillLibrary, db) {
+        this.workingMemory = workingMemory;
+        this.semanticMemory = semanticMemory;
+        this.skillLibrary = skillLibrary;
+        this.db = db;
+    }
+    /**
+     * Run full consolidation cycle
+     */
+    async consolidate() {
+        const startTime = Date.now();
+        console.error('[CONSOLIDATION] Starting consolidation cycle...');
+        const stats = {
+            memoriesProcessed: 0,
+            entitiesExtracted: 0,
+            relationshipsCreated: 0,
+            conflictsDetected: 0,
+            memoriesPruned: 0,
+            skillsExtracted: 0,
+            duration: 0,
+        };
+        try {
+            // Step 1: Extract from working memory
+            const recentMemories = await this.workingMemory.getRecent(100);
+            stats.memoriesProcessed = recentMemories.length;
+            for (const memory of recentMemories) {
+                // Extract entities and relationships
+                const extracted = this.extractKnowledge(memory);
+                for (const entity of extracted.entities) {
+                    this.semanticMemory.upsertEntity(entity);
+                    stats.entitiesExtracted++;
+                }
+                for (const rel of extracted.relationships) {
+                    this.semanticMemory.upsertRelationship(rel);
+                    stats.relationshipsCreated++;
+                }
+            }
+            // Step 2: Apply temporal decay
+            this.semanticMemory.applyTemporalDecay();
+            // Step 3: Detect conflicts
+            stats.conflictsDetected = this.detectConflicts();
+            // Step 4: Prune low-value memories
+            stats.memoriesPruned = this.pruneMemories();
+            // Step 5: Extract skills (simplified)
+            stats.skillsExtracted = this.extractSkills(recentMemories);
+            // Step 6: Create backup
+            this.createBackup();
+            stats.duration = Date.now() - startTime;
+            console.error(`[CONSOLIDATION] Complete! Processed ${stats.memoriesProcessed} memories in ${stats.duration}ms`);
+            console.error(`[CONSOLIDATION] Extracted ${stats.entitiesExtracted} entities, ${stats.relationshipsCreated} relationships`);
+            console.error(`[CONSOLIDATION] Detected ${stats.conflictsDetected} conflicts, pruned ${stats.memoriesPruned} memories`);
+            return stats;
+        }
+        catch (error) {
+            console.error('[CONSOLIDATION] Error:', error);
+            throw error;
+        }
+    }
+    /**
+     * Extract entities and relationships from memory
+     * Simple keyword-based extraction (will enhance with LLM later)
+     */
+    extractKnowledge(memory) {
+        const entities = [];
+        const relationships = [];
+        // Use pre-extracted entities if available
+        if (memory.keyEntities && memory.keyEntities.length > 0) {
+            for (const entityName of memory.keyEntities) {
+                entities.push({
+                    name: entityName,
+                    type: 'concept',
+                    confidence: 0.8,
+                });
+            }
+        }
+        // Extract preferences
+        const prefPatterns = [
+            /prefer (\w+)/gi,
+            /like (\w+)/gi,
+            /favorite is (\w+)/gi,
+        ];
+        for (const pattern of prefPatterns) {
+            const matches = memory.fullText.matchAll(pattern);
+            for (const match of matches) {
+                entities.push({
+                    name: match[1],
+                    type: 'preference',
+                    confidence: 0.9,
+                });
+            }
+        }
+        return { entities, relationships };
+    }
+    /**
+     * Detect simple conflicts (temporal impossibilities, contradictions)
+     */
+    detectConflicts() {
+        let detected = 0;
+        // Temporal conflicts: same property, overlapping time ranges, different values
+        const conflicts = this.db.prepare(`
+      SELECT f1.id as id1, f2.id as id2, f1.property, f1.value as val1, f2.value as val2
+      FROM facts f1
+      JOIN facts f2 ON f1.entity_id = f2.entity_id AND f1.property = f2.property
+      WHERE f1.id < f2.id
+        AND f1.value != f2.value
+        AND f1.valid_until IS NULL
+        AND f2.valid_until IS NULL
+    `).all();
+        for (const conflict of conflicts) {
+            // Check if already flagged
+            const existing = this.db.prepare('SELECT * FROM conflicts WHERE fact_id_1 = ? AND fact_id_2 = ?').get(conflict.id1, conflict.id2);
+            if (!existing) {
+                const conflictId = 'conflict_' + Date.now() + '_' + Math.random().toString(36).substr(2, 9);
+                this.db.prepare(`
+          INSERT INTO conflicts (id, fact_id_1, fact_id_2, conflict_type, description, severity, resolution_status)
+          VALUES (?, ?, ?, ?, ?, ?, ?)
+        `).run(conflictId, conflict.id1, conflict.id2, 'contradiction', `Conflicting values for ${conflict.property}: "${conflict.val1}" vs "${conflict.val2}"`, 'medium', 'flagged');
+                // Lower confidence on both facts
+                this.db.prepare('UPDATE facts SET confidence = 0.5 WHERE id = ?').run(conflict.id1);
+                this.db.prepare('UPDATE facts SET confidence = 0.5 WHERE id = ?').run(conflict.id2);
+                detected++;
+            }
+        }
+        return detected;
+    }
+    /**
+     * Prune low-value memories
+     */
+    pruneMemories() {
+        // Find relationships to prune (weak relationships with low-access entities)
+        const toPrune = this.db.prepare(`
+      SELECT r.id
+      FROM relationships r
+      INNER JOIN entities source ON r.source_id = source.id
+      INNER JOIN entities target ON r.target_id = target.id
+      WHERE r.strength < 0.05
+        AND source.access_count < 3
+        AND target.access_count < 3
+    `).all();
+        // Delete them
+        let deleted = 0;
+        for (const row of toPrune) {
+            this.db.prepare('DELETE FROM relationships WHERE id = ?').run(row.id);
+            deleted++;
+        }
+        return deleted;
+    }
+    /**
+     * Extract skills from positive interactions
+     */
+    extractSkills(memories) {
+        let extracted = 0;
+        for (const memory of memories) {
+            // Look for repeated patterns
+            if (memory.topics && memory.topics.includes('analysis')) {
+                // Check if skill already exists
+                const existing = this.skillLibrary.search('data analysis', 1);
+                if (existing.length === 0) {
+                    this.skillLibrary.addSkill({
+                        name: 'Data Analysis',
+                        description: 'Analyze datasets and provide insights',
+                        category: 'analysis',
+                        triggers: ['analyze', 'data', 'insights'],
+                    });
+                    extracted++;
+                }
+            }
+        }
+        return extracted;
+    }
+    /**
+     * Create backup for rollback capability
+     */
+    createBackup() {
+        const backupId = 'backup_' + Date.now() + '_' + Math.random().toString(36).substr(2, 9);
+        this.db.prepare(`
+      INSERT INTO backup_metadata (id, backup_type, backup_path, created_at, expires_at)
+      VALUES (?, ?, ?, ?, ?)
+    `).run(backupId, 'consolidation', './backups/' + backupId + '.db', new Date().toISOString(), new Date(Date.now() + 7 * 24 * 60 * 60 * 1000).toISOString());
+    }
+}
+//# sourceMappingURL=pipeline.js.map

package/dist/consolidation 2/pipeline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline.js","sourceRoot":"","sources":["../../src/consolidation/pipeline.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAiBH,MAAM,OAAO,qBAAqB;IACxB,aAAa,CAAqB;IAClC,cAAc,CAAsB;IACpC,YAAY,CAAe;IAC3B,EAAE,CAAoB;IAE9B,YACE,aAAiC,EACjC,cAAmC,EACnC,YAA0B,EAC1B,EAAqB;QAErB,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW;QACf,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,OAAO,CAAC,KAAK,CAAC,iDAAiD,CAAC,CAAC;QAEjE,MAAM,KAAK,GAAuB;YAChC,iBAAiB,EAAE,CAAC;YACpB,iBAAiB,EAAE,CAAC;YACpB,oBAAoB,EAAE,CAAC;YACvB,iBAAiB,EAAE,CAAC;YACpB,cAAc,EAAE,CAAC;YACjB,eAAe,EAAE,CAAC;YAClB,QAAQ,EAAE,CAAC;SACZ,CAAC;QAEF,IAAI,CAAC;YACH,sCAAsC;YACtC,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAC/D,KAAK,CAAC,iBAAiB,GAAG,cAAc,CAAC,MAAM,CAAC;YAEhD,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;gBACpC,qCAAqC;gBACrC,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;gBAEhD,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;oBACxC,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;oBACzC,KAAK,CAAC,iBAAiB,EAAE,CAAC;gBAC5B,CAAC;gBAED,KAAK,MAAM,GAAG,IAAI,SAAS,CAAC,aAAa,EAAE,CAAC;oBAC1C,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;oBAC5C,KAAK,CAAC,oBAAoB,EAAE,CAAC;gBAC/B,CAAC;YACH,CAAC;YAED,+BAA+B;YAC/B,IAAI,CAAC,cAAc,CAAC,kBAAkB,EAAE,CAAC;YAEzC,2BAA2B;YAC3B,KAAK,CAAC,iBAAiB,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YAEjD,mCAAmC;YACnC,KAAK,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YAE5C,sCAAsC;YACtC,KAAK,CAAC,eAAe,GAAG,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;YAE3D,wBAAwB;YACxB,IAAI,CAAC,YAAY,EAAE,CAAC;YAEpB,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAExC,OAAO,CAAC,KAAK,CAAC,uCAAuC,KAAK,CAAC,iBAAiB,gBAAgB,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC;YAChH,OAAO,CAAC,KAAK,CAAC,6BAA6B,KAAK,CAAC,iBAAiB,cAAc,KAAK,CAAC,oBAAoB,gBAAgB,CAAC,CAAC;YAC5H,OAAO,CAAC,KAAK,CAAC,4BAA4B,KAAK,CAAC,iBAAiB,sBAAsB,KAAK,CAAC,cAAc,WAAW,CAAC,CAAC;YAExH,OAAO,KAAK,CAAC;QACf,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,wBAAwB,EAAE,KAAK,CAAC,CAAC;YAC/C,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,gBAAgB,CAAC,MAAW;QAIlC,MAAM,QAAQ,GAAuG,EAAE,CAAC;QACxH,MAAM,aAAa,GAAU,EAAE,CAAC;QAEhC,0CAA0C;QAC1C,IAAI,MAAM,CAAC,WAAW,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;gBAC5C,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,SAAkB;oBACxB,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,sBAAsB;QACtB,MAAM,YAAY,GAAG;YACnB,gBAAgB;YAChB,cAAc;YACd,qBAAqB;SACtB,CAAC;QAEF,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAClD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;oBACd,IAAI,EAAE,YAAqB;oBAC3B,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC;IACrC,CAAC;IAED;;OAEG;IACK,eAAe;QACrB,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,+EAA+E;QAC/E,MAAM,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;KAQjC,CAAC,CAAC,GAAG,EAAW,CAAC;QAElB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,2BAA2B;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC9B,+DAA+D,CAChE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;YAElC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,MAAM,UAAU,GAAG,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAE5F,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;SAGf,CAAC,CAAC,GAAG,CACJ,UAAU,EACV,QAAQ,CAAC,GAAG,EACZ,QAAQ,CAAC,GAAG,EACZ,eAAe,EACf,0BAA0B,QAAQ,CAAC,QAAQ,MAAM,QAAQ,CAAC,IAAI,SAAS,QAAQ,CAAC,IAAI,GAAG,EACvF,QAAQ,EACR,SAAS,CACV,CAAC;gBAEF,iCAAiC;gBACjC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gDAAgD,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACpF,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gDAAgD,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBAEpF,QAAQ,EAAE,CAAC;YACb,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,aAAa;QACnB,4EAA4E;QAC5E,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;KAQ/B,CAAC,CAAC,GAAG,EAAW,CAAC;QAElB,cAAc;QACd,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtE,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,QAAe;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,6BAA6B;YAC7B,IAAI,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACxD,gCAAgC;gBAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;gBAE9D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1B,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;wBACzB,IAAI,EAAE,eAAe;wBACrB,WAAW,EAAE,uCAAuC;wBACpD,QAAQ,EAAE,UAAU;wBACpB,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC;qBAC1C,CAAC,CAAC;oBACH,SAAS,EAAE,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,YAAY;QAClB,MAAM,QAAQ,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAExF,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAGf,CAAC,CAAC,GAAG,CACJ,QAAQ,EACR,eAAe,EACf,YAAY,GAAG,QAAQ,GAAG,KAAK,EAC/B,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EACxB,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,WAAW,EAAE,CAC7D,CAAC;IACJ,CAAC;CACF"}

package/dist/embeddings/client.d.ts

@@ -0,0 +1,95 @@
+/**
+ * BGE-large Embedding Client
+ *
+ * TypeScript client for the BGE-large embedding service.
+ * Provides methods for generating 1024-dimensional dense embeddings.
+ */
+/**
+ * Embedding service response
+ */
+export interface EmbeddingResponse {
+    embeddings: number[][];
+    dimensions: number;
+    count: number;
+}
+/**
+ * Health check response
+ */
+export interface HealthResponse {
+    status: string;
+    model: string;
+    dimensions: number;
+}
+/**
+ * BGE-large embedding client configuration
+ */
+export interface EmbeddingClientConfig {
+    /** Embedding service URL (default: http://localhost:8000) */
+    serviceUrl?: string;
+    /** Request timeout in milliseconds (default: 30000) */
+    timeout?: number;
+    /** Maximum retries on failure (default: 3) */
+    maxRetries?: number;
+}
+/**
+ * BGE-large Embedding Client
+ *
+ * Communicates with the Python embedding service to generate
+ * 1024-dimensional dense embeddings using BGE-large-en-v1.5.
+ */
+export declare class EmbeddingClient {
+    private serviceUrl;
+    private timeout;
+    private maxRetries;
+    private embeddingCache;
+    constructor(config?: EmbeddingClientConfig);
+    /**
+     * Check if the embedding service is healthy
+     *
+     * @returns Health status and model information
+     */
+    health(): Promise<HealthResponse>;
+    /**
+     * Generate embedding for a single text
+     *
+     * @param text - Text to embed
+     * @param normalize - Whether to normalize the embedding (default: true)
+     * @returns 1024-dimensional embedding vector
+     */
+    embed(text: string, normalize?: boolean): Promise<number[]>;
+    /**
+     * Generate embeddings for multiple texts
+     *
+     * @param texts - Array of texts to embed
+     * @param normalize - Whether to normalize embeddings (default: true)
+     * @returns Array of 1024-dimensional embedding vectors
+     */
+    embedBatch(texts: string[], normalize?: boolean): Promise<EmbeddingResponse>;
+    /**
+     * Generate embeddings with optimized batching
+     *
+     * Automatically splits large batches to avoid memory issues
+     * and timeouts on the embedding service.
+     *
+     * @param texts - Array of texts to embed
+     * @param batchSize - Number of texts per batch (default: 32)
+     * @returns Array of 1024-dimensional embedding vectors
+     */
+    embedLargeBatch(texts: string[], batchSize?: number): Promise<number[][]>;
+    /**
+     * Fetch with automatic retry on failure
+     *
+     * @param url - URL to fetch
+     * @param options - Fetch options
+     * @returns Response
+     */
+    private fetchWithRetry;
+}
+/**
+ * Factory function to create an embedding client
+ *
+ * @param config - Optional configuration
+ * @returns Embedding client instance
+ */
+export declare function createEmbeddingClient(config?: EmbeddingClientConfig): EmbeddingClient;
+//# sourceMappingURL=client.d.ts.map

package/dist/embeddings/client.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.d.ts","sourceRoot":"","sources":["../../src/embeddings/client.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,6DAA6D;IAC7D,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,uDAAuD;IACvD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,8CAA8C;IAC9C,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;;;GAKG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,cAAc,CAA6B;gBAEvC,MAAM,GAAE,qBAA0B;IAY9C;;;;OAIG;IACG,MAAM,IAAI,OAAO,CAAC,cAAc,CAAC;IAYvC;;;;;;OAMG;IACG,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAoBvE;;;;;;OAMG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO,CAAC,iBAAiB,CAAC;IA4CxF;;;;;;;;;OASG;IACG,eAAe,CACnB,KAAK,EAAE,MAAM,EAAE,EACf,SAAS,GAAE,MAAW,GACrB,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;IAYtB;;;;;;OAMG;YACW,cAAc;CA6B7B;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,CAAC,EAAE,qBAAqB,GAC7B,eAAe,CAEjB"}