wyrm-mcp 3.2.0 → 3.3.0

package/dist/knowledge-graph.js

@@ -0,0 +1,235 @@
+/**
+ * Wyrm Knowledge Graph — Entity & Relationship Management
+ *
+ * @copyright 2026 Ghost Protocol (Pvt) Ltd. All Rights Reserved.
+ * @license Proprietary - See LICENSE file for details.
+ *
+ * Manual-first knowledge graph with provenance tracking:
+ * - Named entities with types and metadata
+ * - Typed, directed relationships between entities
+ * - Aliases for deduplication
+ * - Graph traversal via recursive CTEs (neighborhood, paths)
+ * - FTS5 search on entity names
+ */
+const MAX_DEPTH = 5;
+const MAX_RESULTS = 200;
+/**
+ * Knowledge graph operations backed by SQLite.
+ */
+export class KnowledgeGraph {
+    db;
+    constructor(db) {
+        this.db = db;
+    }
+    // ==================== ENTITIES ====================
+    addEntity(projectId, name, type, metadata, createdBy) {
+        const result = this.db.prepare(`
+      INSERT INTO entities (project_id, name, type, metadata, created_by)
+      VALUES (?, ?, ?, ?, ?)
+    `).run(projectId, name.trim(), type.trim(), metadata ?? null, createdBy ?? 'local');
+        return this.db.prepare('SELECT * FROM entities WHERE id = ?').get(result.lastInsertRowid);
+    }
+    getEntity(id) {
+        return this.db.prepare('SELECT * FROM entities WHERE id = ?').get(id) ?? null;
+    }
+    findEntity(projectId, name, type) {
+        if (type) {
+            return this.db.prepare('SELECT * FROM entities WHERE project_id = ? AND name = ? AND type = ?').get(projectId, name, type) ?? null;
+        }
+        return this.db.prepare('SELECT * FROM entities WHERE project_id = ? AND name = ?').get(projectId, name) ?? null;
+    }
+    updateEntity(id, updates) {
+        const entity = this.getEntity(id);
+        if (!entity)
+            return null;
+        this.db.prepare(`
+      UPDATE entities SET
+        name = COALESCE(?, name),
+        type = COALESCE(?, type),
+        metadata = COALESCE(?, metadata),
+        updated_at = datetime('now')
+      WHERE id = ?
+    `).run(updates.name ?? null, updates.type ?? null, updates.metadata ?? null, id);
+        return this.getEntity(id);
+    }
+    deleteEntity(id) {
+        const result = this.db.prepare('DELETE FROM entities WHERE id = ?').run(id);
+        return result.changes > 0;
+    }
+    listEntities(projectId, options) {
+        let sql = 'SELECT * FROM entities WHERE project_id = ?';
+        const params = [projectId];
+        if (options?.type) {
+            sql += ' AND type = ?';
+            params.push(options.type);
+        }
+        sql += ' ORDER BY name ASC';
+        sql += ` LIMIT ? OFFSET ?`;
+        params.push(options?.limit ?? 50, options?.offset ?? 0);
+        return this.db.prepare(sql).all(...params);
+    }
+    searchEntities(projectId, query, limit = 20) {
+        // Try FTS first, fall back to LIKE
+        try {
+            const ftsResults = this.db.prepare(`
+        SELECT e.* FROM entities e
+        JOIN entities_fts f ON f.rowid = e.id
+        WHERE f.entities_fts MATCH ? AND e.project_id = ?
+        LIMIT ?
+      `).all(query, projectId, limit);
+            if (ftsResults.length > 0)
+                return ftsResults;
+        }
+        catch {
+            // FTS query syntax error — fall back to LIKE
+        }
+        return this.db.prepare(`
+      SELECT * FROM entities WHERE project_id = ? AND (name LIKE ? OR type LIKE ?)
+      ORDER BY name ASC LIMIT ?
+    `).all(projectId, `%${query}%`, `%${query}%`, limit);
+    }
+    // ==================== ALIASES ====================
+    addAlias(entityId, alias) {
+        this.db.prepare('INSERT OR IGNORE INTO entity_aliases (entity_id, alias) VALUES (?, ?)').run(entityId, alias.trim());
+    }
+    getAliases(entityId) {
+        const rows = this.db.prepare('SELECT alias FROM entity_aliases WHERE entity_id = ?').all(entityId);
+        return rows.map(r => r.alias);
+    }
+    findByAlias(projectId, alias) {
+        return this.db.prepare(`
+      SELECT e.* FROM entities e
+      JOIN entity_aliases a ON a.entity_id = e.id
+      WHERE e.project_id = ? AND a.alias = ?
+    `).get(projectId, alias) ?? null;
+    }
+    // ==================== RELATIONSHIPS ====================
+    addRelationship(projectId, sourceId, targetId, type, options) {
+        const result = this.db.prepare(`
+      INSERT INTO relationships (
+        project_id, source_entity_id, target_entity_id, relationship_type,
+        weight, confidence, source_memory, extraction_method, metadata, created_by
+      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
+    `).run(projectId, sourceId, targetId, type.trim(), options?.weight ?? 1.0, options?.confidence ?? 1.0, options?.sourceMemory ?? null, options?.extractionMethod ?? 'manual', options?.metadata ?? null, options?.createdBy ?? 'local');
+        return this.db.prepare('SELECT * FROM relationships WHERE id = ?').get(result.lastInsertRowid);
+    }
+    getRelationships(entityId, direction = 'both') {
+        switch (direction) {
+            case 'outgoing':
+                return this.db.prepare('SELECT * FROM relationships WHERE source_entity_id = ?').all(entityId);
+            case 'incoming':
+                return this.db.prepare('SELECT * FROM relationships WHERE target_entity_id = ?').all(entityId);
+            case 'both':
+                return this.db.prepare('SELECT * FROM relationships WHERE source_entity_id = ? OR target_entity_id = ?').all(entityId, entityId);
+        }
+    }
+    deleteRelationship(id) {
+        return this.db.prepare('DELETE FROM relationships WHERE id = ?').run(id).changes > 0;
+    }
+    // ==================== GRAPH QUERIES ====================
+    /**
+     * Get neighborhood — all nodes within N hops of a given entity.
+     * Uses recursive CTE with cycle detection.
+     */
+    getNeighborhood(entityId, maxDepth = 2) {
+        const depth = Math.min(maxDepth, MAX_DEPTH);
+        const nodes = this.db.prepare(`
+      WITH RECURSIVE neighbors(id, depth, visited) AS (
+        SELECT ?, 0, ',' || ? || ','
+        UNION ALL
+        SELECT
+          CASE WHEN r.source_entity_id = n.id THEN r.target_entity_id ELSE r.source_entity_id END,
+          n.depth + 1,
+          n.visited || CASE WHEN r.source_entity_id = n.id THEN r.target_entity_id ELSE r.source_entity_id END || ','
+        FROM neighbors n
+        JOIN relationships r ON (r.source_entity_id = n.id OR r.target_entity_id = n.id)
+        WHERE n.depth < ?
+          AND n.visited NOT LIKE '%,' || CASE WHEN r.source_entity_id = n.id THEN r.target_entity_id ELSE r.source_entity_id END || ',%'
+      )
+      SELECT DISTINCT e.id, e.name, e.type, e.metadata, MIN(n.depth) as depth
+      FROM neighbors n
+      JOIN entities e ON e.id = n.id
+      GROUP BY e.id
+      ORDER BY depth ASC
+      LIMIT ?
+    `).all(entityId, entityId, depth, MAX_RESULTS);
+        // Get edges between all discovered nodes
+        const nodeIds = nodes.map(n => n.id);
+        if (nodeIds.length === 0)
+            return { nodes: [], edges: [] };
+        const placeholders = nodeIds.map(() => '?').join(',');
+        const edges = this.db.prepare(`
+      SELECT r.source_entity_id as source_id, s.name as source_name,
+             r.target_entity_id as target_id, t.name as target_name,
+             r.relationship_type, r.weight
+      FROM relationships r
+      JOIN entities s ON s.id = r.source_entity_id
+      JOIN entities t ON t.id = r.target_entity_id
+      WHERE r.source_entity_id IN (${placeholders})
+        AND r.target_entity_id IN (${placeholders})
+    `).all(...nodeIds, ...nodeIds);
+        return { nodes, edges };
+    }
+    /**
+     * Find path between two entities using BFS with cycle detection.
+     * Returns the shortest path as a list of entity IDs, or null if no path exists.
+     */
+    findPath(sourceId, targetId, maxDepth = 5) {
+        const depth = Math.min(maxDepth, MAX_DEPTH);
+        const rows = this.db.prepare(`
+      WITH RECURSIVE path_finder(id, path, depth) AS (
+        SELECT ?, CAST(? AS TEXT), 0
+        UNION ALL
+        SELECT
+          CASE WHEN r.source_entity_id = pf.id THEN r.target_entity_id ELSE r.source_entity_id END,
+          pf.path || ',' || CASE WHEN r.source_entity_id = pf.id THEN r.target_entity_id ELSE r.source_entity_id END,
+          pf.depth + 1
+        FROM path_finder pf
+        JOIN relationships r ON (r.source_entity_id = pf.id OR r.target_entity_id = pf.id)
+        WHERE pf.depth < ?
+          AND pf.path NOT LIKE '%,' || CASE WHEN r.source_entity_id = pf.id THEN r.target_entity_id ELSE r.source_entity_id END || ',%'
+          AND INSTR(',' || pf.path || ',', ',' || CASE WHEN r.source_entity_id = pf.id THEN r.target_entity_id ELSE r.source_entity_id END || ',') = 0
+      )
+      SELECT path FROM path_finder WHERE id = ? LIMIT 1
+    `).all(sourceId, sourceId, depth, targetId);
+        if (rows.length === 0)
+            return null;
+        return rows[0].path.split(',').map(Number);
+    }
+    /**
+     * Merge two entities: moves all relationships and aliases from source to target,
+     * adds source name as alias on target, then deletes source.
+     */
+    mergeEntities(sourceId, targetId) {
+        const source = this.getEntity(sourceId);
+        const target = this.getEntity(targetId);
+        if (!source || !target)
+            return null;
+        const merge = this.db.transaction(() => {
+            // Add source name as alias on target
+            this.addAlias(targetId, source.name);
+            // Move source's aliases to target
+            this.db.prepare('UPDATE entity_aliases SET entity_id = ? WHERE entity_id = ?').run(targetId, sourceId);
+            // Redirect relationships from source to target
+            this.db.prepare('UPDATE relationships SET source_entity_id = ? WHERE source_entity_id = ?').run(targetId, sourceId);
+            this.db.prepare('UPDATE relationships SET target_entity_id = ? WHERE target_entity_id = ?').run(targetId, sourceId);
+            // Remove self-loops created by merge
+            this.db.prepare('DELETE FROM relationships WHERE source_entity_id = target_entity_id').run();
+            // Delete source entity
+            this.deleteEntity(sourceId);
+        });
+        merge();
+        return this.getEntity(targetId);
+    }
+    // ==================== STATS ====================
+    getStats(projectId) {
+        const entities = this.db.prepare('SELECT COUNT(*) as c FROM entities WHERE project_id = ?').get(projectId).c;
+        const relationships = this.db.prepare('SELECT COUNT(*) as c FROM relationships WHERE project_id = ?').get(projectId).c;
+        const typeRows = this.db.prepare('SELECT type, COUNT(*) as cnt FROM entities WHERE project_id = ? GROUP BY type').all(projectId);
+        const entityTypes = {};
+        for (const r of typeRows)
+            entityTypes[r.type] = r.cnt;
+        return { entities, relationships, entityTypes };
+    }
+}
+//# sourceMappingURL=knowledge-graph.js.map

package/dist/knowledge-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph.js","sourceRoot":"","sources":["../src/knowledge-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAoDH,MAAM,SAAS,GAAG,CAAC,CAAC;AACpB,MAAM,WAAW,GAAG,GAAG,CAAC;AAExB;;GAEG;AACH,MAAM,OAAO,cAAc;IACjB,EAAE,CAAoB;IAE9B,YAAY,EAAqB;QAC/B,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IAED,qDAAqD;IAErD,SAAS,CAAC,SAAiB,EAAE,IAAY,EAAE,IAAY,EAAE,QAAiB,EAAE,SAAkB;QAC5F,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAG9B,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,IAAI,IAAI,EAAE,SAAS,IAAI,OAAO,CAAC,CAAC;QAEpF,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,eAAe,CAAW,CAAC;IACtG,CAAC;IAED,SAAS,CAAC,EAAU;QAClB,OAAQ,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAY,IAAI,IAAI,CAAC;IAC5F,CAAC;IAED,UAAU,CAAC,SAAiB,EAAE,IAAY,EAAE,IAAa;QACvD,IAAI,IAAI,EAAE,CAAC;YACT,OAAQ,IAAI,CAAC,EAAE,CAAC,OAAO,CACrB,uEAAuE,CACxE,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAY,IAAI,IAAI,CAAC;QAClD,CAAC;QACD,OAAQ,IAAI,CAAC,EAAE,CAAC,OAAO,CACrB,0DAA0D,CAC3D,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAY,IAAI,IAAI,CAAC;IAC5C,CAAC;IAED,YAAY,CAAC,EAAU,EAAE,OAA4D;QACnF,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAEzB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;KAOf,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,EAAE,OAAO,CAAC,IAAI,IAAI,IAAI,EAAE,OAAO,CAAC,QAAQ,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC;QAEjF,OAAO,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,YAAY,CAAC,EAAU;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5E,OAAO,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,YAAY,CAAC,SAAiB,EAAE,OAA4D;QAC1F,IAAI,GAAG,GAAG,6CAA6C,CAAC;QACxD,MAAM,MAAM,GAAwB,CAAC,SAAS,CAAC,CAAC;QAEhD,IAAI,OAAO,EAAE,IAAI,EAAE,CAAC;YAClB,GAAG,IAAI,eAAe,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QACD,GAAG,IAAI,oBAAoB,CAAC;QAC5B,GAAG,IAAI,mBAAmB,CAAC;QAC3B,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;QAExD,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAa,CAAC;IACzD,CAAC;IAED,cAAc,CAAC,SAAiB,EAAE,KAAa,EAAE,QAAgB,EAAE;QACjE,mCAAmC;QACnC,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;OAKlC,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,CAAa,CAAC;YAC5C,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,UAAU,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC;YACP,6CAA6C;QAC/C,CAAC;QAED,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAGtB,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE,KAAK,CAAa,CAAC;IACnE,CAAC;IAED,oDAAoD;IAEpD,QAAQ,CAAC,QAAgB,EAAE,KAAa;QACtC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,uEAAuE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvH,CAAC;IAED,UAAU,CAAC,QAAgB;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,sDAAsD,CAAC,CAAC,GAAG,CAAC,QAAQ,CAA6B,CAAC;QAC/H,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,WAAW,CAAC,SAAiB,EAAE,KAAa;QAC1C,OAAQ,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAIvB,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAY,IAAI,IAAI,CAAC;IAC9C,CAAC;IAED,0DAA0D;IAE1D,eAAe,CACb,SAAiB,EACjB,QAAgB,EAChB,QAAgB,EAChB,IAAY,EACZ,OAOC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;KAK9B,CAAC,CAAC,GAAG,CACJ,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,EAC1C,OAAO,EAAE,MAAM,IAAI,GAAG,EACtB,OAAO,EAAE,UAAU,IAAI,GAAG,EAC1B,OAAO,EAAE,YAAY,IAAI,IAAI,EAC7B,OAAO,EAAE,gBAAgB,IAAI,QAAQ,EACrC,OAAO,EAAE,QAAQ,IAAI,IAAI,EACzB,OAAO,EAAE,SAAS,IAAI,OAAO,CAC9B,CAAC;QAEF,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,eAAe,CAAiB,CAAC;IACjH,CAAC;IAED,gBAAgB,CAAC,QAAgB,EAAE,YAA8C,MAAM;QACrF,QAAQ,SAAS,EAAE,CAAC;YAClB,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wDAAwD,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAmB,CAAC;YACnH,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wDAAwD,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAmB,CAAC;YACnH,KAAK,MAAM;gBACT,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,CACpB,gFAAgF,CACjF,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAmB,CAAC;QAChD,CAAC;IACH,CAAC;IAED,kBAAkB,CAAC,EAAU;QAC3B,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC;IACvF,CAAC;IAED,0DAA0D;IAE1D;;;OAGG;IACH,eAAe,CAAC,QAAgB,EAAE,WAAmB,CAAC;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAE5C,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;;;;;;;KAmB7B,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,CAAgB,CAAC;QAE9D,yCAAyC;QACzC,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAE1D,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;qCAOG,YAAY;qCACZ,YAAY;KAC5C,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,CAAgB,CAAC;QAE9C,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,QAAgB,EAAE,QAAgB,EAAE,WAAmB,CAAC;QAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAE5C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;;;KAe5B,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,CAA4B,CAAC;QAEvE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACnC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,QAAgB,EAAE,QAAgB;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAEpC,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACrC,qCAAqC;YACrC,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;YAErC,kCAAkC;YAClC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,6DAA6D,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAEvG,+CAA+C;YAC/C,IAAI,CAAC,EAAE,CAAC,OAAO,CACb,0EAA0E,CAC3E,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC1B,IAAI,CAAC,EAAE,CAAC,OAAO,CACb,0EAA0E,CAC3E,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAE1B,qCAAqC;YACrC,IAAI,CAAC,EAAE,CAAC,OAAO,CACb,qEAAqE,CACtE,CAAC,GAAG,EAAE,CAAC;YAER,uBAAuB;YACvB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QACH,KAAK,EAAE,CAAC;QAER,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAClC,CAAC;IAED,kDAAkD;IAElD,QAAQ,CAAC,SAAiB;QACxB,MAAM,QAAQ,GAAI,IAAI,CAAC,EAAE,CAAC,OAAO,CAC/B,yDAAyD,CAC1D,CAAC,GAAG,CAAC,SAAS,CAAmB,CAAC,CAAC,CAAC;QAErC,MAAM,aAAa,GAAI,IAAI,CAAC,EAAE,CAAC,OAAO,CACpC,8DAA8D,CAC/D,CAAC,GAAG,CAAC,SAAS,CAAmB,CAAC,CAAC,CAAC;QAErC,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC9B,+EAA+E,CAChF,CAAC,GAAG,CAAC,SAAS,CAAyC,CAAC;QAEzD,MAAM,WAAW,GAA2B,EAAE,CAAC;QAC/C,KAAK,MAAM,CAAC,IAAI,QAAQ;YAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;QAEtD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,WAAW,EAAE,CAAC;IAClD,CAAC;CACF"}

package/dist/memory-artifacts.d.ts

@@ -0,0 +1,106 @@
+/**
+ * Wyrm Memory Artifacts — Distilled knowledge for AI intelligence amplification.
+ *
+ * Stores problem-solution records, lessons, patterns, and anti-patterns that
+ * help AI models recall what worked in the past and apply it to new tasks.
+ *
+ * @copyright 2026 Ghost Protocol (Pvt) Ltd. All Rights Reserved.
+ * @license Proprietary - See LICENSE file for details.
+ */
+import type Database from 'better-sqlite3';
+export type ArtifactKind = 'reasoning_trace' | 'lesson' | 'pattern' | 'anti_pattern' | 'heuristic';
+export type ArtifactOutcome = 'positive' | 'negative' | 'neutral';
+export interface MemoryArtifact {
+    id: number;
+    project_id: number;
+    kind: ArtifactKind;
+    problem: string;
+    constraints: string | null;
+    validated_fix: string | null;
+    why_it_worked: string | null;
+    outcome: ArtifactOutcome;
+    source_session_id: number | null;
+    tags: string | null;
+    confidence: number;
+    last_validated_at: string;
+    supersedes_id: number | null;
+    needs_review: number;
+    reuse_count: number;
+    reuse_success_count: number;
+    reuse_failure_count: number;
+    created_by: string;
+    created_at: string;
+    updated_at: string;
+}
+export interface AddArtifactOptions {
+    kind: ArtifactKind;
+    problem: string;
+    constraints?: string;
+    validatedFix?: string;
+    whyItWorked?: string;
+    outcome?: ArtifactOutcome;
+    sourceSessionId?: number;
+    tags?: string[];
+    confidence?: number;
+    createdBy?: string;
+    needsReview?: number;
+}
+export interface RecallResult {
+    artifact: MemoryArtifact;
+    relevance_score: number;
+    match_type: 'fts' | 'tag' | 'both';
+}
+export interface ContextBriefSection {
+    heading: string;
+    items: string[];
+    source: string;
+}
+export declare class MemoryArtifacts {
+    private db;
+    constructor(db: Database.Database);
+    add(projectId: number, opts: AddArtifactOptions): MemoryArtifact;
+    get(id: number): MemoryArtifact | null;
+    update(id: number, updates: Partial<Pick<MemoryArtifact, 'confidence' | 'validated_fix' | 'why_it_worked' | 'last_validated_at' | 'needs_review'>>): MemoryArtifact | null;
+    /** Mark an artifact as superseded by a newer/better one. */
+    markSuperseded(oldId: number, newId: number): void;
+    /** Record that an artifact was used and whether it helped. */
+    recordFeedback(id: number, success: boolean): void;
+    /**
+     * 2-stage retrieval: FTS candidates → sort by weighted relevance.
+     * Excludes superseded artifacts and those below minConfidence.
+     */
+    recall(projectId: number, query: string, opts?: {
+        kind?: ArtifactKind;
+        limit?: number;
+        minConfidence?: number;
+    }): RecallResult[];
+    private searchByFts;
+    private searchByTags;
+    listRecent(projectId: number, limit?: number, kind?: ArtifactKind): MemoryArtifact[];
+    /**
+     * Assemble an optimized memory brief for injection into an AI model's context.
+     * Excludes credentials/sensitive content. Groups by kind. Deduplicates.
+     * Returns sections with headings + items, plus raw text for direct injection.
+     */
+    buildContextBrief(projectId: number, task: string, opts?: {
+        maxItems?: number;
+        kinds?: ArtifactKind[];
+        minConfidence?: number;
+    }): {
+        sections: ContextBriefSection[];
+        text: string;
+        sourceIds: number[];
+    };
+    getStats(projectId: number): {
+        total: number;
+        byKind: Record<string, number>;
+        avgConfidence: number;
+        supersededCount: number;
+    };
+    listAll(projectId: number, opts?: {
+        kind?: ArtifactKind;
+        includeSuperseded?: boolean;
+        limit?: number;
+    }): MemoryArtifact[];
+}
+//# sourceMappingURL=memory-artifacts.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-artifacts.d.ts","sourceRoot":"","sources":["../src/memory-artifacts.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAC;AAE3C,MAAM,MAAM,YAAY,GAAG,iBAAiB,GAAG,QAAQ,GAAG,SAAS,GAAG,cAAc,GAAG,WAAW,CAAC;AACnG,MAAM,MAAM,eAAe,GAAG,UAAU,GAAG,UAAU,GAAG,SAAS,CAAC;AAElE,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,YAAY,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,OAAO,EAAE,eAAe,CAAC;IACzB,iBAAiB,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,YAAY,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,eAAe,CAAC;IAC1B,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,cAAc,CAAC;IACzB,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC;CACpC;AAED,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB;AASD,qBAAa,eAAe;IACd,OAAO,CAAC,EAAE;gBAAF,EAAE,EAAE,QAAQ,CAAC,QAAQ;IAIzC,GAAG,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,kBAAkB,GAAG,cAAc;IAwBhE,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI;IAItC,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,cAAc,EAAE,YAAY,GAAG,eAAe,GAAG,eAAe,GAAG,mBAAmB,GAAG,cAAc,CAAC,CAAC,GAAG,cAAc,GAAG,IAAI;IAqB1K,4DAA4D;IAC5D,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAMlD,8DAA8D;IAC9D,cAAc,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI;IAiBlD;;;OAGG;IACH,MAAM,CACJ,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE;QAAE,IAAI,CAAC,EAAE,YAAY,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,aAAa,CAAC,EAAE,MAAM,CAAA;KAAO,GACzE,YAAY,EAAE;IA2DjB,OAAO,CAAC,WAAW;IAiCnB,OAAO,CAAC,YAAY;IA8BpB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,SAAK,EAAE,IAAI,CAAC,EAAE,YAAY,GAAG,cAAc,EAAE;IAiBhF;;;;OAIG;IACH,iBAAiB,CACf,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,EACZ,IAAI,GAAE;QACJ,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC;QACvB,aAAa,CAAC,EAAE,MAAM,CAAC;KACnB,GACL;QAAE,QAAQ,EAAE,mBAAmB,EAAE,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE;IA6EzE,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG;QAC3B,KAAK,EAAE,MAAM,CAAC;QACd,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC/B,aAAa,EAAE,MAAM,CAAC;QACtB,eAAe,EAAE,MAAM,CAAC;KACzB;IAuBD,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,GAAE;QAAE,IAAI,CAAC,EAAE,YAAY,CAAC;QAAC,iBAAiB,CAAC,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAO,GAAG,cAAc,EAAE;CAc9H"}

package/dist/memory-artifacts.js

@@ -0,0 +1,291 @@
+/**
+ * Wyrm Memory Artifacts — Distilled knowledge for AI intelligence amplification.
+ *
+ * Stores problem-solution records, lessons, patterns, and anti-patterns that
+ * help AI models recall what worked in the past and apply it to new tasks.
+ *
+ * @copyright 2026 Ghost Protocol (Pvt) Ltd. All Rights Reserved.
+ * @license Proprietary - See LICENSE file for details.
+ */
+/** Maximum artifacts returned from a recall query (before reranking) */
+const MAX_CANDIDATES = 40;
+/** Maximum artifacts included in a context brief */
+const MAX_BRIEF_ITEMS = 10;
+/** Minimum confidence to include in auto-generated briefs */
+const MIN_BRIEF_CONFIDENCE = 0.3;
+export class MemoryArtifacts {
+    db;
+    constructor(db) {
+        this.db = db;
+    }
+    // ==================== CRUD ====================
+    add(projectId, opts) {
+        const tags = opts.tags?.length ? opts.tags.join(',') : null;
+        const result = this.db.prepare(`
+      INSERT INTO memory_artifacts
+        (project_id, kind, problem, constraints, validated_fix, why_it_worked,
+         outcome, source_session_id, tags, confidence, needs_review, created_by)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
+    `).run(projectId, opts.kind, opts.problem.trim(), opts.constraints?.trim() ?? null, opts.validatedFix?.trim() ?? null, opts.whyItWorked?.trim() ?? null, opts.outcome ?? 'neutral', opts.sourceSessionId ?? null, tags, opts.confidence ?? 1.0, opts.needsReview ?? 0, opts.createdBy ?? 'local');
+        return this.get(result.lastInsertRowid);
+    }
+    get(id) {
+        return this.db.prepare('SELECT * FROM memory_artifacts WHERE id = ?').get(id) ?? null;
+    }
+    update(id, updates) {
+        this.db.prepare(`
+      UPDATE memory_artifacts SET
+        confidence = COALESCE(?, confidence),
+        validated_fix = COALESCE(?, validated_fix),
+        why_it_worked = COALESCE(?, why_it_worked),
+        last_validated_at = COALESCE(?, last_validated_at),
+        needs_review = COALESCE(?, needs_review),
+        updated_at = datetime('now')
+      WHERE id = ?
+    `).run(updates.confidence ?? null, updates.validated_fix ?? null, updates.why_it_worked ?? null, updates.last_validated_at ?? null, updates.needs_review ?? null, id);
+        return this.get(id);
+    }
+    /** Mark an artifact as superseded by a newer/better one. */
+    markSuperseded(oldId, newId) {
+        this.db.prepare('UPDATE memory_artifacts SET supersedes_id = ?, updated_at = datetime(\'now\') WHERE id = ?').run(newId, oldId);
+    }
+    /** Record that an artifact was used and whether it helped. */
+    recordFeedback(id, success) {
+        const col = success ? 'reuse_success_count' : 'reuse_failure_count';
+        this.db.prepare(`
+      UPDATE memory_artifacts SET
+        reuse_count = reuse_count + 1,
+        ${col} = ${col} + 1,
+        confidence = CASE
+          WHEN ? THEN MIN(1.0, confidence + 0.05)
+          ELSE MAX(0.0, confidence - 0.1)
+        END,
+        updated_at = datetime('now')
+      WHERE id = ?
+    `).run(success ? 1 : 0, id);
+    }
+    // ==================== RETRIEVAL ====================
+    /**
+     * 2-stage retrieval: FTS candidates → sort by weighted relevance.
+     * Excludes superseded artifacts and those below minConfidence.
+     */
+    recall(projectId, query, opts = {}) {
+        const limit = opts.limit ?? 10;
+        const minConf = opts.minConfidence ?? 0.0;
+        // Stage 1: FTS candidates
+        const ftsCandidates = this.searchByFts(projectId, query, MAX_CANDIDATES, opts.kind, minConf);
+        // Stage 2: Tag candidates (exact tag matches not covered by FTS)
+        const tagCandidates = this.searchByTags(projectId, query, MAX_CANDIDATES, opts.kind, minConf);
+        // Merge and dedupe by id
+        const seen = new Set();
+        const merged = [];
+        for (const a of ftsCandidates) {
+            seen.add(a.id);
+            merged.push({ artifact: a, inFts: true, inTag: false });
+        }
+        for (const a of tagCandidates) {
+            if (!seen.has(a.id)) {
+                seen.add(a.id);
+                merged.push({ artifact: a, inFts: false, inTag: true });
+            }
+            else {
+                const existing = merged.find(m => m.artifact.id === a.id);
+                if (existing)
+                    existing.inTag = true;
+            }
+        }
+        // Score and rerank — also enforce minConf as a safety net
+        const results = merged
+            .filter(({ artifact }) => artifact.confidence >= minConf)
+            .map(({ artifact, inFts, inTag }) => {
+            // Base relevance from FTS match
+            let relevance = 0;
+            if (inFts && inTag)
+                relevance = 1.0;
+            else if (inFts)
+                relevance = 0.7;
+            else
+                relevance = 0.4;
+            // Boost by confidence
+            relevance *= artifact.confidence;
+            // Boost positive outcomes slightly
+            if (artifact.outcome === 'positive')
+                relevance *= 1.1;
+            // Freshness: decay slowly over 180 days
+            const daysSinceValidated = (Date.now() - new Date(artifact.last_validated_at).getTime()) / (1000 * 60 * 60 * 24);
+            const freshnessScore = Math.max(0.5, 1.0 - daysSinceValidated / 180);
+            relevance *= freshnessScore;
+            return {
+                artifact,
+                relevance_score: Math.min(1.0, relevance),
+                match_type: (inFts && inTag ? 'both' : inFts ? 'fts' : 'tag'),
+            };
+        });
+        return results.sort((a, b) => b.relevance_score - a.relevance_score).slice(0, limit);
+    }
+    searchByFts(projectId, query, limit, kind, minConf = 0.0) {
+        const sanitized = query.replace(/['"*]/g, ' ').trim();
+        if (!sanitized)
+            return this.listRecent(projectId, limit, kind);
+        const kindClause = kind ? 'AND a.kind = ?' : '';
+        const params = [sanitized, projectId, minConf];
+        if (kind)
+            params.push(kind);
+        params.push(limit);
+        try {
+            return this.db.prepare(`
+        SELECT a.* FROM memory_artifacts a
+        JOIN memory_artifacts_fts fts ON a.id = fts.rowid
+        WHERE fts MATCH ?
+          AND a.project_id = ?
+          AND a.confidence >= ?
+          AND a.supersedes_id IS NULL
+          AND a.needs_review = 0
+          ${kindClause}
+        ORDER BY rank, a.confidence DESC
+        LIMIT ?
+      `).all(...params);
+        }
+        catch {
+            return this.listRecent(projectId, limit, kind);
+        }
+    }
+    searchByTags(projectId, query, limit, kind, minConf = 0.0) {
+        // Match any word in the query against tags
+        const words = query.toLowerCase().split(/\s+/).filter(w => w.length > 2);
+        if (!words.length)
+            return [];
+        const likeClause = words.map(() => 'LOWER(tags) LIKE ?').join(' OR ');
+        const likeParams = words.map(w => `%${w}%`);
+        const kindClause = kind ? 'AND kind = ?' : '';
+        const params = [projectId, minConf, ...likeParams];
+        if (kind)
+            params.push(kind);
+        params.push(limit);
+        return this.db.prepare(`
+      SELECT * FROM memory_artifacts
+      WHERE project_id = ? AND confidence >= ? AND supersedes_id IS NULL
+        AND needs_review = 0
+        AND (${likeClause})
+        ${kindClause}
+      ORDER BY confidence DESC, reuse_success_count DESC
+      LIMIT ?
+    `).all(...params);
+    }
+    listRecent(projectId, limit = 20, kind) {
+        const kindClause = kind ? 'AND kind = ?' : '';
+        const params = [projectId];
+        if (kind)
+            params.push(kind);
+        params.push(limit);
+        return this.db.prepare(`
+      SELECT * FROM memory_artifacts
+      WHERE project_id = ? AND supersedes_id IS NULL AND needs_review = 0
+        ${kindClause}
+      ORDER BY confidence DESC, created_at DESC
+      LIMIT ?
+    `).all(...params);
+    }
+    // ==================== CONTEXT BRIEF ====================
+    /**
+     * Assemble an optimized memory brief for injection into an AI model's context.
+     * Excludes credentials/sensitive content. Groups by kind. Deduplicates.
+     * Returns sections with headings + items, plus raw text for direct injection.
+     */
+    buildContextBrief(projectId, task, opts = {}) {
+        const kinds = opts.kinds ?? ['pattern', 'heuristic', 'reasoning_trace', 'lesson', 'anti_pattern'];
+        const maxItems = opts.maxItems ?? MAX_BRIEF_ITEMS;
+        const minConf = opts.minConfidence ?? MIN_BRIEF_CONFIDENCE;
+        // Recall relevant artifacts
+        const recalled = this.recall(projectId, task, { limit: maxItems * 2, minConfidence: minConf });
+        // Group by kind, pick top items per kind
+        const byKind = new Map();
+        for (const r of recalled) {
+            if (!kinds.includes(r.artifact.kind))
+                continue;
+            const existing = byKind.get(r.artifact.kind) ?? [];
+            existing.push(r);
+            byKind.set(r.artifact.kind, existing);
+        }
+        const KIND_LABELS = {
+            pattern: '✅ Proven Patterns',
+            heuristic: '💡 Heuristics',
+            reasoning_trace: '🧠 Past Reasoning',
+            lesson: '📚 Lessons Learned',
+            anti_pattern: '⚠️ Anti-Patterns to Avoid',
+        };
+        // Prioritize: patterns > heuristics > reasoning_traces > lessons > anti_patterns
+        const kindOrder = ['pattern', 'heuristic', 'reasoning_trace', 'lesson', 'anti_pattern'];
+        const sections = [];
+        const sourceIds = [];
+        let totalItems = 0;
+        for (const kind of kindOrder) {
+            if (!kinds.includes(kind))
+                continue;
+            const items = byKind.get(kind) ?? [];
+            if (!items.length)
+                continue;
+            const sectionItems = [];
+            for (const r of items) {
+                if (totalItems >= maxItems)
+                    break;
+                const a = r.artifact;
+                let line = `**Problem:** ${a.problem}`;
+                if (a.constraints)
+                    line += `\n  _Constraints:_ ${a.constraints}`;
+                if (a.validated_fix)
+                    line += `\n  _Solution:_ ${a.validated_fix}`;
+                if (a.why_it_worked)
+                    line += `\n  _Why it worked:_ ${a.why_it_worked}`;
+                if (a.outcome === 'negative')
+                    line += `\n  _Note: This approach failed — avoid it_`;
+                sectionItems.push(line);
+                sourceIds.push(a.id);
+                totalItems++;
+            }
+            if (sectionItems.length) {
+                sections.push({ heading: KIND_LABELS[kind], items: sectionItems, source: kind });
+            }
+        }
+        // Build formatted text
+        let text = '';
+        if (sections.length > 0) {
+            text += '---\n## 🐉 Memory Brief\n_Relevant past knowledge from Wyrm:_\n\n';
+            for (const section of sections) {
+                text += `### ${section.heading}\n`;
+                for (const item of section.items) {
+                    text += `- ${item}\n`;
+                }
+                text += '\n';
+            }
+            text += '---\n';
+        }
+        return { sections, text, sourceIds };
+    }
+    // ==================== STATS ====================
+    getStats(projectId) {
+        const total = this.db.prepare('SELECT COUNT(*) as n FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NULL').get(projectId).n;
+        const supersededCount = this.db.prepare('SELECT COUNT(*) as n FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NOT NULL').get(projectId).n;
+        const avgConfidence = this.db.prepare('SELECT AVG(confidence) as v FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NULL').get(projectId).v ?? 0;
+        const kindRows = this.db.prepare('SELECT kind, COUNT(*) as cnt FROM memory_artifacts WHERE project_id = ? AND supersedes_id IS NULL GROUP BY kind').all(projectId);
+        const byKind = {};
+        for (const r of kindRows)
+            byKind[r.kind] = r.cnt;
+        return { total, byKind, avgConfidence: Math.round(avgConfidence * 100) / 100, supersededCount };
+    }
+    listAll(projectId, opts = {}) {
+        const kindClause = opts.kind ? 'AND kind = ?' : '';
+        const supersededClause = opts.includeSuperseded ? '' : 'AND supersedes_id IS NULL';
+        const params = [projectId];
+        if (opts.kind)
+            params.push(opts.kind);
+        params.push(opts.limit ?? 50);
+        return this.db.prepare(`
+      SELECT * FROM memory_artifacts
+      WHERE project_id = ? ${kindClause} ${supersededClause}
+      ORDER BY confidence DESC, created_at DESC
+      LIMIT ?
+    `).all(...params);
+    }
+}
+//# sourceMappingURL=memory-artifacts.js.map