@miller-tech/uap 1.0.0

package/dist/memory/knowledge-graph.js

@@ -0,0 +1,275 @@
+import Database from 'better-sqlite3';
+import { existsSync, mkdirSync } from 'fs';
+import { dirname } from 'path';
+import { ensureKnowledgeSchema } from './short-term/schema.js';
+export class KnowledgeGraph {
+    db;
+    constructor(dbPath) {
+        const dir = dirname(dbPath);
+        if (!existsSync(dir)) {
+            mkdirSync(dir, { recursive: true });
+        }
+        this.db = new Database(dbPath);
+        ensureKnowledgeSchema(this.db);
+        // Optimize for read-heavy graph queries
+        this.db.pragma('journal_mode = WAL');
+        this.db.pragma('synchronous = NORMAL');
+    }
+    // ============================================================
+    // ENTITY OPERATIONS
+    // ============================================================
+    /**
+     * Upsert an entity. If (type, name) already exists, updates last_seen
+     * and increments mention_count.
+     */
+    upsertEntity(type, name, description) {
+        const now = new Date().toISOString();
+        const existing = this.db
+            .prepare('SELECT * FROM entities WHERE type = ? AND name = ?')
+            .get(type, name);
+        if (existing) {
+            this.db
+                .prepare(`
+        UPDATE entities
+        SET last_seen = ?, mention_count = mention_count + 1,
+            description = COALESCE(?, description)
+        WHERE id = ?
+      `)
+                .run(now, description ?? null, existing.id);
+            return {
+                id: existing.id,
+                type: existing.type,
+                name: existing.name,
+                description: (description ?? existing.description),
+                firstSeen: existing.first_seen,
+                lastSeen: now,
+                mentionCount: existing.mention_count + 1,
+            };
+        }
+        const result = this.db
+            .prepare(`
+      INSERT INTO entities (type, name, description, first_seen, last_seen, mention_count)
+      VALUES (?, ?, ?, ?, ?, 1)
+    `)
+            .run(type, name, description ?? null, now, now);
+        return {
+            id: Number(result.lastInsertRowid),
+            type,
+            name,
+            description,
+            firstSeen: now,
+            lastSeen: now,
+            mentionCount: 1,
+        };
+    }
+    /**
+     * Get an entity by type and name.
+     */
+    getEntity(type, name) {
+        const row = this.db
+            .prepare('SELECT * FROM entities WHERE type = ? AND name = ?')
+            .get(type, name);
+        if (!row)
+            return null;
+        return this.rowToEntity(row);
+    }
+    /**
+     * Get an entity by ID.
+     */
+    getEntityById(id) {
+        const row = this.db.prepare('SELECT * FROM entities WHERE id = ?').get(id);
+        if (!row)
+            return null;
+        return this.rowToEntity(row);
+    }
+    /**
+     * Search entities by type.
+     */
+    getEntitiesByType(type, limit = 50) {
+        const rows = this.db
+            .prepare('SELECT * FROM entities WHERE type = ? ORDER BY mention_count DESC LIMIT ?')
+            .all(type, limit);
+        return rows.map((r) => this.rowToEntity(r));
+    }
+    /**
+     * Search entities by name pattern (LIKE search).
+     */
+    searchEntities(query, limit = 20) {
+        const rows = this.db
+            .prepare('SELECT * FROM entities WHERE name LIKE ? ORDER BY mention_count DESC LIMIT ?')
+            .all(`%${query}%`, limit);
+        return rows.map((r) => this.rowToEntity(r));
+    }
+    /**
+     * Delete an entity and all its relationships.
+     */
+    deleteEntity(id) {
+        const deleteRels = this.db.prepare('DELETE FROM relationships WHERE source_id = ? OR target_id = ?');
+        const deleteEntity = this.db.prepare('DELETE FROM entities WHERE id = ?');
+        const txn = this.db.transaction(() => {
+            deleteRels.run(id, id);
+            const result = deleteEntity.run(id);
+            return result.changes > 0;
+        });
+        return txn();
+    }
+    // ============================================================
+    // RELATIONSHIP OPERATIONS
+    // ============================================================
+    /**
+     * Add or strengthen a relationship between two entities.
+     * If the relationship already exists, increases strength.
+     */
+    addRelationship(sourceId, targetId, relation, strength = 1.0) {
+        const now = new Date().toISOString();
+        const existing = this.db
+            .prepare('SELECT * FROM relationships WHERE source_id = ? AND target_id = ? AND relation = ?')
+            .get(sourceId, targetId, relation);
+        if (existing) {
+            const newStrength = Math.min(existing.strength + strength, 10.0);
+            this.db
+                .prepare(`
+        UPDATE relationships SET strength = ?, timestamp = ? WHERE id = ?
+      `)
+                .run(newStrength, now, existing.id);
+            return {
+                id: existing.id,
+                sourceId,
+                targetId,
+                relation,
+                strength: newStrength,
+                timestamp: now,
+            };
+        }
+        const result = this.db
+            .prepare(`
+      INSERT INTO relationships (source_id, target_id, relation, strength, timestamp)
+      VALUES (?, ?, ?, ?, ?)
+    `)
+            .run(sourceId, targetId, relation, strength, now);
+        return {
+            id: Number(result.lastInsertRowid),
+            sourceId,
+            targetId,
+            relation,
+            strength,
+            timestamp: now,
+        };
+    }
+    /**
+     * Get all relationships for an entity (both directions).
+     */
+    getRelationships(entityId) {
+        const rows = this.db
+            .prepare(`
+      SELECT * FROM relationships
+      WHERE source_id = ? OR target_id = ?
+      ORDER BY strength DESC
+    `)
+            .all(entityId, entityId);
+        return rows.map((r) => this.rowToRelationship(r));
+    }
+    /**
+     * Delete a specific relationship.
+     */
+    deleteRelationship(id) {
+        const result = this.db.prepare('DELETE FROM relationships WHERE id = ?').run(id);
+        return result.changes > 0;
+    }
+    // ============================================================
+    // GRAPH QUERIES
+    // ============================================================
+    /**
+     * Get an entity with all its relationships and related entities.
+     * This is the primary graph query for L4 knowledge access.
+     */
+    queryEntityGraph(type, name) {
+        const entity = this.getEntity(type, name);
+        if (!entity || !entity.id)
+            return null;
+        const rels = this.getRelationships(entity.id);
+        const relationships = [];
+        for (const rel of rels) {
+            const isOutgoing = rel.sourceId === entity.id;
+            const relatedId = isOutgoing ? rel.targetId : rel.sourceId;
+            const relatedEntity = this.getEntityById(relatedId);
+            if (relatedEntity) {
+                relationships.push({
+                    relation: rel.relation,
+                    direction: isOutgoing ? 'outgoing' : 'incoming',
+                    relatedEntity,
+                    strength: rel.strength,
+                });
+            }
+        }
+        return { entity, relationships };
+    }
+    /**
+     * Find entities connected to a given entity within N hops.
+     */
+    traverseGraph(entityId, maxDepth = 2) {
+        const visited = new Set();
+        const result = [];
+        const traverse = (id, depth) => {
+            if (depth > maxDepth || visited.has(id))
+                return;
+            visited.add(id);
+            const entity = this.getEntityById(id);
+            if (entity)
+                result.push(entity);
+            const rels = this.getRelationships(id);
+            for (const rel of rels) {
+                const nextId = rel.sourceId === id ? rel.targetId : rel.sourceId;
+                traverse(nextId, depth + 1);
+            }
+        };
+        traverse(entityId, 0);
+        return result;
+    }
+    /**
+     * Get graph statistics.
+     */
+    getStats() {
+        const entityCount = this.db.prepare('SELECT COUNT(*) as c FROM entities').get().c;
+        const relationshipCount = this.db.prepare('SELECT COUNT(*) as c FROM relationships').get().c;
+        const typeRows = this.db
+            .prepare('SELECT DISTINCT type FROM entities ORDER BY type')
+            .all();
+        return {
+            entityCount,
+            relationshipCount,
+            entityTypes: typeRows.map((r) => r.type),
+        };
+    }
+    /**
+     * Close the database connection.
+     */
+    close() {
+        this.db.close();
+    }
+    // ============================================================
+    // PRIVATE HELPERS
+    // ============================================================
+    rowToEntity(row) {
+        return {
+            id: row.id,
+            type: row.type,
+            name: row.name,
+            description: row.description,
+            firstSeen: row.first_seen,
+            lastSeen: row.last_seen,
+            mentionCount: row.mention_count,
+        };
+    }
+    rowToRelationship(row) {
+        return {
+            id: row.id,
+            sourceId: row.source_id,
+            targetId: row.target_id,
+            relation: row.relation,
+            strength: row.strength,
+            timestamp: row.timestamp,
+        };
+    }
+}
+//# sourceMappingURL=knowledge-graph.js.map

package/dist/memory/knowledge-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph.js","sourceRoot":"","sources":["../../src/memory/knowledge-graph.ts"],"names":[],"mappings":"AAAA,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAC/B,OAAO,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAsC/D,MAAM,OAAO,cAAc;IACjB,EAAE,CAAoB;IAE9B,YAAY,MAAc;QACxB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,CAAC;QAED,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/B,qBAAqB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE/B,wCAAwC;QACxC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;QACrC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC;IACzC,CAAC;IAED,+DAA+D;IAC/D,oBAAoB;IACpB,+DAA+D;IAE/D;;;OAGG;IACH,YAAY,CAAC,IAAY,EAAE,IAAY,EAAE,WAAoB;QAC3D,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE;aACrB,OAAO,CAAC,oDAAoD,CAAC;aAC7D,GAAG,CAAC,IAAI,EAAE,IAAI,CAAwC,CAAC;QAE1D,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,EAAE;iBACJ,OAAO,CACN;;;;;OAKH,CACE;iBACA,GAAG,CAAC,GAAG,EAAE,WAAW,IAAI,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YAE9C,OAAO;gBACL,EAAE,EAAE,QAAQ,CAAC,EAAY;gBACzB,IAAI,EAAE,QAAQ,CAAC,IAAc;gBAC7B,IAAI,EAAE,QAAQ,CAAC,IAAc;gBAC7B,WAAW,EAAE,CAAC,WAAW,IAAI,QAAQ,CAAC,WAAW,CAAuB;gBACxE,SAAS,EAAE,QAAQ,CAAC,UAAoB;gBACxC,QAAQ,EAAE,GAAG;gBACb,YAAY,EAAG,QAAQ,CAAC,aAAwB,GAAG,CAAC;aACrD,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE;aACnB,OAAO,CACN;;;KAGH,CACE;aACA,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,IAAI,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAElD,OAAO;YACL,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC;YAClC,IAAI;YACJ,IAAI;YACJ,WAAW;YACX,SAAS,EAAE,GAAG;YACd,QAAQ,EAAE,GAAG;YACb,YAAY,EAAE,CAAC;SAChB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,IAAY,EAAE,IAAY;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;aAChB,OAAO,CAAC,oDAAoD,CAAC;aAC7D,GAAG,CAAC,IAAI,EAAE,IAAI,CAAwC,CAAC;QAE1D,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAEtB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,EAAU;QACtB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,CAAC,EAAE,CAE5D,CAAC;QAEd,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAEtB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,iBAAiB,CAAC,IAAY,EAAE,QAAgB,EAAE;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAC,2EAA2E,CAAC;aACpF,GAAG,CAAC,IAAI,EAAE,KAAK,CAAmC,CAAC;QAEtD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,KAAa,EAAE,QAAgB,EAAE;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAC,8EAA8E,CAAC;aACvF,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,KAAK,CAAmC,CAAC;QAE9D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,EAAU;QACrB,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAChC,gEAAgE,CACjE,CAAC;QACF,MAAM,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC;QAE1E,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACnC,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACvB,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACpC,OAAO,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEH,OAAO,GAAG,EAAE,CAAC;IACf,CAAC;IAED,+DAA+D;IAC/D,0BAA0B;IAC1B,+DAA+D;IAE/D;;;OAGG;IACH,eAAe,CACb,QAAgB,EAChB,QAAgB,EAChB,QAAgB,EAChB,WAAmB,GAAG;QAEtB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE;aACrB,OAAO,CAAC,oFAAoF,CAAC;aAC7F,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAwC,CAAC;QAE5E,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAE,QAAQ,CAAC,QAAmB,GAAG,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC7E,IAAI,CAAC,EAAE;iBACJ,OAAO,CACN;;OAEH,CACE;iBACA,GAAG,CAAC,WAAW,EAAE,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YAEtC,OAAO;gBACL,EAAE,EAAE,QAAQ,CAAC,EAAY;gBACzB,QAAQ;gBACR,QAAQ;gBACR,QAAQ;gBACR,QAAQ,EAAE,WAAW;gBACrB,SAAS,EAAE,GAAG;aACf,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE;aACnB,OAAO,CACN;;;KAGH,CACE;aACA,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QAEpD,OAAO;YACL,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC;YAClC,QAAQ;YACR,QAAQ;YACR,QAAQ;YACR,QAAQ;YACR,SAAS,EAAE,GAAG;SACf,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,QAAgB;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CACN;;;;KAIH,CACE;aACA,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAmC,CAAC;QAE7D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,EAAU;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjF,OAAO,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,+DAA+D;IAC/D,gBAAgB;IAChB,+DAA+D;IAE/D;;;OAGG;IACH,gBAAgB,CAAC,IAAY,EAAE,IAAY;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE;YAAE,OAAO,IAAI,CAAC;QAEvC,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC9C,MAAM,aAAa,GAAsC,EAAE,CAAC;QAE5D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,KAAK,MAAM,CAAC,EAAE,CAAC;YAC9C,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC;YAC3D,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YAEpD,IAAI,aAAa,EAAE,CAAC;gBAClB,aAAa,CAAC,IAAI,CAAC;oBACjB,QAAQ,EAAE,GAAG,CAAC,QAAQ;oBACtB,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU;oBAC/C,aAAa;oBACb,QAAQ,EAAE,GAAG,CAAC,QAAQ;iBACvB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,QAAgB,EAAE,WAAmB,CAAC;QAClD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAE,KAAa,EAAE,EAAE;YAC7C,IAAI,KAAK,GAAG,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,OAAO;YAChD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEhB,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YACtC,IAAI,MAAM;gBAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEhC,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;YACvC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC;gBACjE,QAAQ,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,WAAW,GACf,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,oCAAoC,CAAC,CAAC,GAAG,EAC1D,CAAC,CAAC,CAAC;QACJ,MAAM,iBAAiB,GACrB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,EAC/D,CAAC,CAAC,CAAC;QACJ,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE;aACrB,OAAO,CAAC,kDAAkD,CAAC;aAC3D,GAAG,EAA6B,CAAC;QAEpC,OAAO;YACL,WAAW;YACX,iBAAiB;YACjB,WAAW,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;SACzC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC;IAED,+DAA+D;IAC/D,kBAAkB;IAClB,+DAA+D;IAEvD,WAAW,CAAC,GAA4B;QAC9C,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAY;YACpB,IAAI,EAAE,GAAG,CAAC,IAAc;YACxB,IAAI,EAAE,GAAG,CAAC,IAAc;YACxB,WAAW,EAAE,GAAG,CAAC,WAAiC;YAClD,SAAS,EAAE,GAAG,CAAC,UAAoB;YACnC,QAAQ,EAAE,GAAG,CAAC,SAAmB;YACjC,YAAY,EAAE,GAAG,CAAC,aAAuB;SAC1C,CAAC;IACJ,CAAC;IAEO,iBAAiB,CAAC,GAA4B;QACpD,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAY;YACpB,QAAQ,EAAE,GAAG,CAAC,SAAmB;YACjC,QAAQ,EAAE,GAAG,CAAC,SAAmB;YACjC,QAAQ,EAAE,GAAG,CAAC,QAAkB;YAChC,QAAQ,EAAE,GAAG,CAAC,QAAkB;YAChC,SAAS,EAAE,GAAG,CAAC,SAAmB;SACnC,CAAC;IACJ,CAAC;CACF"}

package/dist/memory/memory-consolidator.d.ts

@@ -0,0 +1,124 @@
+/**
+ * Memory Consolidation Service for UAP
+ *
+ * Implements the consolidation rules from CLAUDE.md:
+ * - Trigger: Every 10 working memory entries
+ * - Action: Summarize → session_memories, Extract lessons → semantic memory
+ * - Dedup: Skip if content_hash exists OR similarity > 0.92
+ *
+ * Enhanced with SimpleMem-style recursive consolidation:
+ * - Background async consolidation process
+ * - Hierarchical abstraction (memories → summaries → meta-summaries)
+ * - Quality scoring and automatic pruning
+ */
+export interface ConsolidationConfig {
+    triggerThreshold: number;
+    minImportanceForLongTerm: number;
+    similarityThreshold: number;
+    maxSummaryLength: number;
+    backgroundIntervalMs: number;
+    recursiveDepth: number;
+    qualityDecayRate: number;
+}
+export interface ConsolidationResult {
+    memoriesProcessed: number;
+    summariesCreated: number;
+    lessonsExtracted: number;
+    duplicatesSkipped: number;
+    tokensReduced: number;
+}
+/**
+ * Memory Consolidation Service
+ */
+export declare class MemoryConsolidator {
+    private config;
+    private db;
+    private contentHashes;
+    private lastConsolidationId;
+    private backgroundInterval;
+    private isRunning;
+    private memoryQualityScores;
+    constructor(config?: Partial<ConsolidationConfig>);
+    /**
+     * Initialize with database connection
+     */
+    initialize(dbPath: string): void;
+    /**
+     * Load existing content hashes for deduplication
+     */
+    private loadContentHashes;
+    /**
+     * Hash content for deduplication
+     */
+    private hashContent;
+    /**
+     * Check if consolidation should run
+     */
+    shouldConsolidate(): boolean;
+    /**
+     * Run consolidation process
+     */
+    consolidate(): Promise<ConsolidationResult>;
+    /**
+     * Detect if content contains a lesson/insight
+     */
+    private detectLesson;
+    /**
+     * Check for semantic duplicates using embeddings
+     */
+    private checkSemanticDuplicate;
+    /**
+     * Store session memory
+     */
+    private storeSessionMemory;
+    /**
+     * Store lesson in long-term memory
+     */
+    private storeLesson;
+    /**
+     * Run decay on old memories
+     * Formula: effective_importance = importance × (0.95 ^ days_since_access)
+     */
+    runDecay(): Promise<number>;
+    /**
+     * Get consolidation stats
+     */
+    getStats(): {
+        totalMemories: number;
+        totalSessionMemories: number;
+        totalLessons: number;
+        lastConsolidationId: number;
+        uniqueHashes: number;
+    };
+    /**
+     * Start background consolidation process (SimpleMem-style async)
+     */
+    startBackgroundConsolidation(): void;
+    /**
+     * Stop background consolidation
+     */
+    stopBackgroundConsolidation(): void;
+    /**
+     * Recursive consolidation - merge summaries into meta-summaries
+     * Based on SimpleMem's hierarchical abstraction
+     */
+    recursiveConsolidate(depth?: number): Promise<number>;
+    /**
+     * Apply quality decay to unused memories (Memory-R1 style)
+     */
+    applyQualityDecay(): Promise<number>;
+    /**
+     * Record memory access (for quality scoring)
+     */
+    recordAccess(memoryId: string): void;
+    /**
+     * Get memory quality score
+     */
+    getQualityScore(memoryId: string): number;
+    /**
+     * Close database connection
+     */
+    close(): void;
+}
+export declare function getMemoryConsolidator(config?: Partial<ConsolidationConfig>): MemoryConsolidator;
+//# sourceMappingURL=memory-consolidator.d.ts.map

package/dist/memory/memory-consolidator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-consolidator.d.ts","sourceRoot":"","sources":["../../src/memory/memory-consolidator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AASH,MAAM,WAAW,mBAAmB;IAClC,gBAAgB,EAAE,MAAM,CAAC;IACzB,wBAAwB,EAAE,MAAM,CAAC;IACjC,mBAAmB,EAAE,MAAM,CAAC;IAC5B,gBAAgB,EAAE,MAAM,CAAC;IACzB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAYD,MAAM,WAAW,mBAAmB;IAClC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,gBAAgB,EAAE,MAAM,CAAC;IACzB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,MAAM,CAAsB;IACpC,OAAO,CAAC,EAAE,CAAkC;IAC5C,OAAO,CAAC,aAAa,CAA0B;IAC/C,OAAO,CAAC,mBAAmB,CAAa;IACxC,OAAO,CAAC,kBAAkB,CAA+B;IACzD,OAAO,CAAC,SAAS,CAAkB;IACnC,OAAO,CAAC,mBAAmB,CAGb;gBAEF,MAAM,GAAE,OAAO,CAAC,mBAAmB,CAAM;IAIrD;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAQhC;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAmBzB;;OAEG;IACH,OAAO,CAAC,WAAW;IAInB;;OAEG;IACH,iBAAiB,IAAI,OAAO;IAiB5B;;OAEG;IACG,WAAW,IAAI,OAAO,CAAC,mBAAmB,CAAC;IAqGjD;;OAEG;IACH,OAAO,CAAC,YAAY;IAmBpB;;OAEG;YACW,sBAAsB;IAwCpC;;OAEG;YACW,kBAAkB;IAehC;;OAEG;YACW,WAAW;IAWzB;;;OAGG;IACG,QAAQ,IAAI,OAAO,CAAC,MAAM,CAAC;IAwCjC;;OAEG;IACH,QAAQ,IAAI;QACV,aAAa,EAAE,MAAM,CAAC;QACtB,oBAAoB,EAAE,MAAM,CAAC;QAC7B,YAAY,EAAE,MAAM,CAAC;QACrB,mBAAmB,EAAE,MAAM,CAAC;QAC5B,YAAY,EAAE,MAAM,CAAC;KACtB;IAwCD;;OAEG;IACH,4BAA4B,IAAI,IAAI;IA4BpC;;OAEG;IACH,2BAA2B,IAAI,IAAI;IAQnC;;;OAGG;IACG,oBAAoB,CAAC,KAAK,GAAE,MAAU,GAAG,OAAO,CAAC,MAAM,CAAC;IA2E9D;;OAEG;IACG,iBAAiB,IAAI,OAAO,CAAC,MAAM,CAAC;IA+C1C;;OAEG;IACH,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI;IASpC;;OAEG;IACH,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAIzC;;OAEG;IACH,KAAK,IAAI,IAAI;CAOd;AAKD,wBAAgB,qBAAqB,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,mBAAmB,CAAC,GAAG,kBAAkB,CAK/F"}