cognitive-core 0.2.5 → 0.3.1

package/dist/experimental/knowledge-graph.js

@@ -0,0 +1,270 @@
+import { readFile, writeFile, mkdir } from 'node:fs/promises';
+import { join } from 'node:path';
+import { DEFAULT_GRAPH_CONFIG } from './knowledge-graph-types.js';
+import { SemanticGraphLayer, TemporalGraphLayer, CausalGraphLayer, EntityGraphLayer, } from './graph-layers/index.js';
+/**
+ * KnowledgeGraphManager
+ *
+ * Manages a multi-layer graph overlay over the knowledge note filesystem.
+ * All layers share the same node set. Each layer maintains its own edges.
+ * The graph is a derived index — it can be rebuilt from frontmatter.
+ */
+export class KnowledgeGraphManager {
+    nodes = new Map();
+    layers = new Map();
+    config;
+    constructor(config) {
+        this.config = { ...DEFAULT_GRAPH_CONFIG, ...config };
+        this.initLayers();
+    }
+    initLayers() {
+        const enabled = new Set(this.config.enabledLayers);
+        this.layers.set('semantic', new SemanticGraphLayer(enabled.has('semantic')));
+        this.layers.set('temporal', new TemporalGraphLayer(enabled.has('temporal')));
+        this.layers.set('causal', new CausalGraphLayer(enabled.has('causal')));
+        this.layers.set('entity', new EntityGraphLayer(enabled.has('entity')));
+    }
+    // === Layer Access ===
+    getLayer(name) {
+        const layer = this.layers.get(name);
+        if (!layer || !layer.enabled)
+            return null;
+        return layer;
+    }
+    // === Node Management ===
+    addNode(node) {
+        this.nodes.set(node.id, node);
+    }
+    removeNode(nodeId) {
+        this.nodes.delete(nodeId);
+        // Remove edges from all layers
+        for (const layer of this.layers.values()) {
+            const edges = layer.getEdges(nodeId, 'both');
+            for (const edge of edges) {
+                layer.removeEdge(edge.from, edge.to, edge.relation);
+            }
+        }
+    }
+    getNode(nodeId) {
+        return this.nodes.get(nodeId);
+    }
+    getAllNodes() {
+        return Array.from(this.nodes.values());
+    }
+    // === Cross-Layer Queries ===
+    neighbors(nodeId, options) {
+        const depth = options?.depth ?? 1;
+        const minWeight = options?.minWeight ?? 0;
+        const targetLayers = options?.layers ?? this.config.enabledLayers;
+        const visited = new Set();
+        const queue = [{ id: nodeId, d: 0 }];
+        visited.add(nodeId);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current.d >= depth)
+                continue;
+            for (const layerName of targetLayers) {
+                const layer = this.layers.get(layerName);
+                if (!layer || !layer.enabled)
+                    continue;
+                const edges = layer.getEdges(current.id, 'both');
+                for (const edge of edges) {
+                    if (edge.weight < minWeight)
+                        continue;
+                    const neighborId = edge.from === current.id ? edge.to : edge.from;
+                    if (!visited.has(neighborId)) {
+                        visited.add(neighborId);
+                        queue.push({ id: neighborId, d: current.d + 1 });
+                    }
+                }
+            }
+        }
+        visited.delete(nodeId);
+        // Resolve node IDs to GraphNode objects
+        const result = [];
+        for (const id of visited) {
+            const node = this.nodes.get(id);
+            if (node)
+                result.push(node);
+        }
+        return result;
+    }
+    pathBetween(fromId, toId, options) {
+        if (fromId === toId) {
+            const node = this.nodes.get(fromId);
+            if (!node)
+                return null;
+            return [];
+        }
+        const targetLayers = options?.layers ?? this.config.enabledLayers;
+        const visited = new Set();
+        const parent = new Map();
+        const queue = [fromId];
+        visited.add(fromId);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            for (const layerName of targetLayers) {
+                const layer = this.layers.get(layerName);
+                if (!layer || !layer.enabled)
+                    continue;
+                const edges = layer.getEdges(current, 'both');
+                for (const edge of edges) {
+                    const neighborId = edge.from === current ? edge.to : edge.from;
+                    if (!visited.has(neighborId)) {
+                        visited.add(neighborId);
+                        parent.set(neighborId, {
+                            from: current,
+                            edge,
+                            layer: layerName,
+                        });
+                        if (neighborId === toId) {
+                            // Reconstruct path
+                            const path = [];
+                            let node = toId;
+                            while (parent.has(node)) {
+                                const p = parent.get(node);
+                                const graphNode = this.nodes.get(node);
+                                if (graphNode) {
+                                    path.unshift({
+                                        node: graphNode,
+                                        edge: p.edge,
+                                        layer: p.layer,
+                                    });
+                                }
+                                node = p.from;
+                            }
+                            return path;
+                        }
+                        queue.push(neighborId);
+                    }
+                }
+            }
+        }
+        return null;
+    }
+    filterNodes(filter) {
+        const results = [];
+        for (const node of this.nodes.values()) {
+            if (filter.type && node.type !== filter.type)
+                continue;
+            if (filter.minConfidence !== undefined && node.confidence < filter.minConfidence)
+                continue;
+            if (filter.domains && !filter.domains.some((d) => node.domains.includes(d)))
+                continue;
+            if (filter.entities && !filter.entities.some((e) => node.entities.includes(e)))
+                continue;
+            if (filter.tags && !filter.tags.some((t) => node.tags.includes(t)))
+                continue;
+            results.push(node);
+        }
+        return results;
+    }
+    crossSystemLinks(nodeId) {
+        const result = [];
+        for (const layer of this.layers.values()) {
+            if (!layer.enabled)
+                continue;
+            const edges = layer.getEdges(nodeId, 'both');
+            for (const edge of edges) {
+                if (edge.crossSystem)
+                    result.push(edge);
+            }
+        }
+        return result;
+    }
+    // === Rebuild ===
+    rebuildAll(notes) {
+        // Rebuild node registry
+        this.nodes.clear();
+        for (const note of notes) {
+            this.addNode(this.noteToGraphNode(note));
+        }
+        // Rebuild each enabled layer
+        for (const layer of this.layers.values()) {
+            if (layer.enabled) {
+                layer.rebuild(notes);
+            }
+        }
+    }
+    noteToGraphNode(note) {
+        return {
+            id: note.frontmatter.id,
+            file: note.filePath,
+            type: note.frontmatter.type,
+            domains: note.frontmatter.domain,
+            entities: note.frontmatter.entities,
+            tags: note.frontmatter.tags,
+            confidence: note.frontmatter.confidence,
+            updated: note.frontmatter.updated,
+        };
+    }
+    // === Persistence ===
+    async loadFromDisk(dir) {
+        try {
+            // Load nodes
+            const nodesPath = join(dir, 'nodes.json');
+            const nodesData = await readFile(nodesPath, 'utf-8');
+            const nodesObj = JSON.parse(nodesData);
+            this.nodes.clear();
+            for (const [id, node] of Object.entries(nodesObj)) {
+                this.nodes.set(id, node);
+            }
+            // Load each enabled layer
+            const layersDir = join(dir, 'layers');
+            for (const [name, layer] of this.layers.entries()) {
+                if (!layer.enabled)
+                    continue;
+                try {
+                    const layerPath = join(layersDir, `${name}.json`);
+                    const layerData = await readFile(layerPath, 'utf-8');
+                    const edges = JSON.parse(layerData);
+                    layer.clear();
+                    for (const edge of edges) {
+                        layer.addEdge(edge);
+                    }
+                }
+                catch {
+                    // Layer file doesn't exist yet — that's fine
+                }
+            }
+        }
+        catch {
+            // No graph data on disk yet — start fresh
+        }
+    }
+    async saveToDisk(dir) {
+        await mkdir(dir, { recursive: true });
+        const layersDir = join(dir, 'layers');
+        await mkdir(layersDir, { recursive: true });
+        // Save nodes
+        const nodesObj = {};
+        for (const [id, node] of this.nodes.entries()) {
+            nodesObj[id] = node;
+        }
+        await writeFile(join(dir, 'nodes.json'), JSON.stringify(nodesObj, null, 2));
+        // Save each enabled layer
+        for (const [name, layer] of this.layers.entries()) {
+            if (!layer.enabled)
+                continue;
+            const edges = layer.getAllEdges();
+            await writeFile(join(layersDir, `${name}.json`), JSON.stringify(edges, null, 2));
+        }
+    }
+    // === Stats ===
+    getStats() {
+        const edgeCountByLayer = {};
+        const enabledLayers = [];
+        for (const [name, layer] of this.layers.entries()) {
+            if (layer.enabled) {
+                enabledLayers.push(name);
+                edgeCountByLayer[name] = layer.edgeCount();
+            }
+        }
+        return {
+            nodeCount: this.nodes.size,
+            edgeCountByLayer,
+            enabledLayers,
+        };
+    }
+}
+//# sourceMappingURL=knowledge-graph.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph.js","sourceRoot":"","sources":["../../src/experimental/knowledge-graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAUjC,OAAO,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AAElE,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,yBAAyB,CAAC;AAEjC;;;;;;GAMG;AACH,MAAM,OAAO,qBAAqB;IACxB,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;IACrC,MAAM,GAAG,IAAI,GAAG,EAAwC,CAAC;IACzD,MAAM,CAAc;IAE5B,YAAY,MAA6B;QACvC,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,oBAAoB,EAAE,GAAG,MAAM,EAAE,CAAC;QACrD,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAEO,UAAU;QAChB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QAEnD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,gBAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,gBAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,uBAAuB;IAEvB,QAAQ,CAAC,IAAoB;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,0BAA0B;IAE1B,OAAO,CAAC,IAAe;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,UAAU,CAAC,MAAc;QACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,+BAA+B;QAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,8BAA8B;IAE9B,SAAS,CAAC,MAAc,EAAE,OAAyB;QACjD,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC;QAClC,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,CAAC,CAAC;QAC1C,MAAM,YAAY,GAAG,OAAO,EAAE,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAElE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAqC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACvE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK;gBAAE,SAAS;YAEjC,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACzC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO;oBAAE,SAAS;gBAEvC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;gBACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,IAAI,IAAI,CAAC,MAAM,GAAG,SAAS;wBAAE,SAAS;oBAEtC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;oBAClE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;wBACxB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACnD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAEvB,wCAAwC;QACxC,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,IAAI;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,WAAW,CACT,MAAc,EACd,IAAY,EACZ,OAAuC;QAMvC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;YACvB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,YAAY,GAAG,OAAO,EAAE,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAElE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoE,CAAC;QAC3F,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACzC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO;oBAAE,SAAS;gBAEvC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;oBAC/D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;wBACxB,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE;4BACrB,IAAI,EAAE,OAAO;4BACb,IAAI;4BACJ,KAAK,EAAE,SAAS;yBACjB,CAAC,CAAC;wBAEH,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;4BACxB,mBAAmB;4BACnB,MAAM,IAAI,GAIL,EAAE,CAAC;4BACR,IAAI,IAAI,GAAG,IAAI,CAAC;4BAChB,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gCACxB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;gCAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gCACvC,IAAI,SAAS,EAAE,CAAC;oCACd,IAAI,CAAC,OAAO,CAAC;wCACX,IAAI,EAAE,SAAS;wCACf,IAAI,EAAE,CAAC,CAAC,IAAI;wCACZ,KAAK,EAAE,CAAC,CAAC,KAAK;qCACf,CAAC,CAAC;gCACL,CAAC;gCACD,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;4BAChB,CAAC;4BACD,OAAO,IAAI,CAAC;wBACd,CAAC;wBAED,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,WAAW,CAAC,MAAuB;QACjC,MAAM,OAAO,GAAgB,EAAE,CAAC;QAEhC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI;gBAAE,SAAS;YACvD,IAAI,MAAM,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,aAAa;gBAAE,SAAS;YAC3F,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAAE,SAAS;YACtF,IAAI,MAAM,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAAE,SAAS;YACzF,IAAI,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC7E,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,gBAAgB,CAAC,MAAc;QAC7B,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,OAAO;gBAAE,SAAS;YAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,WAAW;oBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,kBAAkB;IAElB,UAAU,CAAC,KAAsB;QAC/B,wBAAwB;QACxB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,CAAC;QAED,6BAA6B;QAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAEO,eAAe,CAAC,IAAmB;QACzC,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE;YACvB,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI;YAC3B,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM;YAChC,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,QAAQ;YACnC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI;YAC3B,UAAU,EAAE,IAAI,CAAC,WAAW,CAAC,UAAU;YACvC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO;SAClC,CAAC;IACJ,CAAC;IAED,sBAAsB;IAEtB,KAAK,CAAC,YAAY,CAAC,GAAW;QAC5B,IAAI,CAAC;YACH,aAAa;YACb,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;YAC1C,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAA8B,CAAC;YACpE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC3B,CAAC;YAED,0BAA0B;YAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACtC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC,OAAO;oBAAE,SAAS;gBAE7B,IAAI,CAAC;oBACH,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE,GAAG,IAAI,OAAO,CAAC,CAAC;oBAClD,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;oBACrD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAgB,CAAC;oBACnD,KAAK,CAAC,KAAK,EAAE,CAAC;oBACd,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;wBACzB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBACtB,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,6CAA6C;gBAC/C,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,0CAA0C;QAC5C,CAAC;IACH,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,GAAW;QAC1B,MAAM,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtC,MAAM,KAAK,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAE5C,aAAa;QACb,MAAM,QAAQ,GAA8B,EAAE,CAAC;QAC/C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAC9C,QAAQ,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QACtB,CAAC;QACD,MAAM,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAE5E,0BAA0B;QAC1B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,IAAI,CAAC,KAAK,CAAC,OAAO;gBAAE,SAAS;YAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,MAAM,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QACnF,CAAC;IACH,CAAC;IAED,gBAAgB;IAEhB,QAAQ;QAKN,MAAM,gBAAgB,GAA2B,EAAE,CAAC;QACpD,MAAM,aAAa,GAAa,EAAE,CAAC;QAEnC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzB,gBAAgB,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC1B,gBAAgB;YAChB,aAAa;SACd,CAAC;IACJ,CAAC;CACF"}

package/dist/experimental/meta-reflection.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Meta-Reflection Template
+ *
+ * Replaces MetaLearner.generateReflection() with workspace-based
+ * semantic reflection that analyzes what worked and why.
+ *
+ * - Clear success with high confidence routing → heuristic fallback
+ * - Failures or uncertain outcomes → agent reflects on execution
+ */
+import type { Trajectory } from '../types/index.js';
+import type { PlaybookMatch } from '../memory/playbook.js';
+import type { AgenticTaskTemplate } from '../workspace/types.js';
+export interface MetaReflectionInput {
+    trajectory: Trajectory;
+    routingDecision: {
+        strategy: string;
+        confidence: number;
+        estimatedBudget: number;
+        reasoning: string;
+    };
+    playbooksUsed: PlaybookMatch[];
+}
+/**
+ * Simplified meta-reflection output.
+ * The full MetaObservation is constructed by the MetaLearner after
+ * receiving this output, so we only need the core reflection data.
+ */
+export interface MetaReflectionOutput {
+    /** Was the retrieval helpful, neutral, or misleading? */
+    retrievalQuality: 'helpful' | 'neutral' | 'misleading';
+    /** Overall outcome quality */
+    outcomeQuality: 'excellent' | 'good' | 'acceptable' | 'poor';
+    /** What worked well */
+    whatWorked: string[];
+    /** What failed or was suboptimal */
+    whatFailed: string[];
+    /** Suggestions for improvement */
+    suggestions: string[];
+    /** Whether decomposition was used */
+    decompositionUsed: boolean;
+    /** Whether backtracking occurred */
+    backtrackingOccurred: boolean;
+    /** Estimated refinement iterations */
+    refinementIterations: number;
+}
+export declare const metaReflectionTemplate: AgenticTaskTemplate<MetaReflectionInput, MetaReflectionOutput>;
+//# sourceMappingURL=meta-reflection.d.ts.map

package/dist/experimental/meta-reflection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"meta-reflection.d.ts","sourceRoot":"","sources":["../../src/experimental/meta-reflection.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,KAAK,EAAE,mBAAmB,EAAsB,MAAM,uBAAuB,CAAC;AAMrF,MAAM,WAAW,mBAAmB;IAClC,UAAU,EAAE,UAAU,CAAC;IACvB,eAAe,EAAE;QACf,QAAQ,EAAE,MAAM,CAAC;QACjB,UAAU,EAAE,MAAM,CAAC;QACnB,eAAe,EAAE,MAAM,CAAC;QACxB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC;IACF,aAAa,EAAE,aAAa,EAAE,CAAC;CAChC;AAED;;;;GAIG;AACH,MAAM,WAAW,oBAAoB;IACnC,yDAAyD;IACzD,gBAAgB,EAAE,SAAS,GAAG,SAAS,GAAG,YAAY,CAAC;IACvD,8BAA8B;IAC9B,cAAc,EAAE,WAAW,GAAG,MAAM,GAAG,YAAY,GAAG,MAAM,CAAC;IAC7D,uBAAuB;IACvB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,oCAAoC;IACpC,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,kCAAkC;IAClC,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,qCAAqC;IACrC,iBAAiB,EAAE,OAAO,CAAC;IAC3B,oCAAoC;IACpC,oBAAoB,EAAE,OAAO,CAAC;IAC9B,sCAAsC;IACtC,oBAAoB,EAAE,MAAM,CAAC;CAC9B;AAMD,eAAO,MAAM,sBAAsB,EAAE,mBAAmB,CACtD,mBAAmB,EACnB,oBAAoB,CAyJrB,CAAC"}

package/dist/experimental/meta-reflection.js

@@ -0,0 +1,143 @@
+/**
+ * Meta-Reflection Template
+ *
+ * Replaces MetaLearner.generateReflection() with workspace-based
+ * semantic reflection that analyzes what worked and why.
+ *
+ * - Clear success with high confidence routing → heuristic fallback
+ * - Failures or uncertain outcomes → agent reflects on execution
+ */
+// ============================================================
+// Template Implementation
+// ============================================================
+export const metaReflectionTemplate = {
+    taskType: 'meta-reflection',
+    domain: 'meta-reflection',
+    description: 'Reflect on task execution to generate meta-learning observations',
+    assessComplexity(input) {
+        // Clear success with high confidence → heuristic
+        if (input.trajectory.outcome.success && input.routingDecision.confidence > 0.8) {
+            return 'heuristic';
+        }
+        return 'lightweight';
+    },
+    async heuristicFallback(input) {
+        const { trajectory, routingDecision, playbooksUsed } = input;
+        const wasSuccessful = trajectory.outcome.success;
+        const actualEffort = trajectory.llmCalls ?? trajectory.steps.length;
+        const effortRatio = actualEffort / routingDecision.estimatedBudget;
+        return {
+            retrievalQuality: playbooksUsed.length === 0 ? 'neutral' : wasSuccessful ? 'helpful' : 'neutral',
+            outcomeQuality: !wasSuccessful
+                ? 'poor'
+                : effortRatio <= 0.5
+                    ? 'excellent'
+                    : effortRatio <= 1.0
+                        ? 'good'
+                        : effortRatio <= 2.0
+                            ? 'acceptable'
+                            : 'poor',
+            whatWorked: wasSuccessful ? [`${routingDecision.strategy} routing led to success`] : [],
+            whatFailed: wasSuccessful
+                ? []
+                : [`${routingDecision.strategy} routing did not lead to success`],
+            suggestions: wasSuccessful ? [] : ['Consider alternative approaches'],
+            decompositionUsed: trajectory.steps.some((s) => s.thought?.includes('break') || s.thought?.includes('step by step')),
+            backtrackingOccurred: false,
+            refinementIterations: 0,
+        };
+    },
+    async prepareWorkspace(input, handle) {
+        const { trajectory, routingDecision, playbooksUsed } = input;
+        await handle.writeJson('input', 'context.json', {
+            routing: routingDecision,
+            outcome: trajectory.outcome,
+            stepCount: trajectory.steps.length,
+            wallTimeSeconds: trajectory.wallTimeSeconds,
+            playbooksInjected: playbooksUsed.map((pm) => ({
+                name: pm.playbook.name,
+                strategy: pm.playbook.guidance.strategy,
+                score: pm.score,
+                matchType: pm.matchType,
+            })),
+        });
+        await handle.writeJsonl('input', 'steps.jsonl', trajectory.steps.map((step, i) => ({
+            index: i,
+            thought: step.thought?.slice(0, 200),
+            action: step.action.slice(0, 200),
+            observation: step.observation?.slice(0, 200),
+        })));
+    },
+    buildTaskPrompt(input) {
+        const outcome = input.trajectory.outcome.success ? 'SUCCESSFUL' : 'FAILED';
+        return [
+            `Reflect on this ${outcome} task execution.`,
+            '',
+            'Read input/context.json for routing decision and outcome.',
+            'Read input/steps.jsonl for the execution trace.',
+            '',
+            'Analyze:',
+            '1. Was the retrieved knowledge helpful, neutral, or misleading?',
+            '2. What outcome quality level (excellent/good/acceptable/poor)?',
+            '3. What worked well? What failed?',
+            '4. What suggestions for future similar tasks?',
+            '5. Was decomposition used? Did backtracking occur?',
+            '',
+            'Write to output/reflection.json with this schema:',
+            '```json',
+            '{',
+            '  "retrievalQuality": "helpful" | "neutral" | "misleading",',
+            '  "outcomeQuality": "excellent" | "good" | "acceptable" | "poor",',
+            '  "whatWorked": ["..."],',
+            '  "whatFailed": ["..."],',
+            '  "suggestions": ["..."],',
+            '  "decompositionUsed": boolean,',
+            '  "backtrackingOccurred": boolean,',
+            '  "refinementIterations": number',
+            '}',
+            '```',
+        ].join('\n');
+    },
+    getSkills() {
+        return [];
+    },
+    getResources() {
+        return [];
+    },
+    outputConfig: {
+        files: [
+            {
+                path: 'reflection.json',
+                format: 'json',
+                required: true,
+                description: 'Meta-reflection on task execution',
+            },
+        ],
+    },
+    async collectOutput(handle) {
+        const raw = (await handle.readJson('output', 'reflection.json'));
+        return {
+            retrievalQuality: (['helpful', 'neutral', 'misleading'].includes(String(raw.retrievalQuality))
+                ? raw.retrievalQuality
+                : 'neutral'),
+            outcomeQuality: (['excellent', 'good', 'acceptable', 'poor'].includes(String(raw.outcomeQuality))
+                ? raw.outcomeQuality
+                : 'poor'),
+            whatWorked: Array.isArray(raw.whatWorked) ? raw.whatWorked.map(String) : [],
+            whatFailed: Array.isArray(raw.whatFailed) ? raw.whatFailed.map(String) : [],
+            suggestions: Array.isArray(raw.suggestions) ? raw.suggestions.map(String) : [],
+            decompositionUsed: Boolean(raw.decompositionUsed),
+            backtrackingOccurred: Boolean(raw.backtrackingOccurred),
+            refinementIterations: typeof raw.refinementIterations === 'number' ? raw.refinementIterations : 0,
+        };
+    },
+    async processOutput() { },
+    agentType: 'claude-code',
+    timeout: 120_000,
+    captureToolCalls: true,
+    computeRequirements: {
+        mode: 'local',
+        complexity: 'lightweight',
+    },
+};
+//# sourceMappingURL=meta-reflection.js.map

package/dist/experimental/meta-reflection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"meta-reflection.js","sourceRoot":"","sources":["../../src/experimental/meta-reflection.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AA8CH,+DAA+D;AAC/D,0BAA0B;AAC1B,+DAA+D;AAE/D,MAAM,CAAC,MAAM,sBAAsB,GAG/B;IACF,QAAQ,EAAE,iBAAiB;IAC3B,MAAM,EAAE,iBAAiB;IACzB,WAAW,EAAE,kEAAkE;IAE/E,gBAAgB,CAAC,KAA0B;QACzC,iDAAiD;QACjD,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,OAAO,IAAI,KAAK,CAAC,eAAe,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;YAC/E,OAAO,WAAW,CAAC;QACrB,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,KAAK,CAAC,iBAAiB,CAAC,KAA0B;QAChD,MAAM,EAAE,UAAU,EAAE,eAAe,EAAE,aAAa,EAAE,GAAG,KAAK,CAAC;QAC7D,MAAM,aAAa,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC;QACjD,MAAM,YAAY,GAAG,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC;QACpE,MAAM,WAAW,GAAG,YAAY,GAAG,eAAe,CAAC,eAAe,CAAC;QAEnE,OAAO;YACL,gBAAgB,EACd,aAAa,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;YAChF,cAAc,EAAE,CAAC,aAAa;gBAC5B,CAAC,CAAC,MAAM;gBACR,CAAC,CAAC,WAAW,IAAI,GAAG;oBAClB,CAAC,CAAC,WAAW;oBACb,CAAC,CAAC,WAAW,IAAI,GAAG;wBAClB,CAAC,CAAC,MAAM;wBACR,CAAC,CAAC,WAAW,IAAI,GAAG;4BAClB,CAAC,CAAC,YAAY;4BACd,CAAC,CAAC,MAAM;YAChB,UAAU,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,QAAQ,yBAAyB,CAAC,CAAC,CAAC,CAAC,EAAE;YACvF,UAAU,EAAE,aAAa;gBACvB,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,QAAQ,kCAAkC,CAAC;YACnE,WAAW,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,iCAAiC,CAAC;YACrE,iBAAiB,EAAE,UAAU,CAAC,KAAK,CAAC,IAAI,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,cAAc,CAAC,CAC3E;YACD,oBAAoB,EAAE,KAAK;YAC3B,oBAAoB,EAAE,CAAC;SACxB,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,gBAAgB,CAAC,KAA0B,EAAE,MAAuB;QACxE,MAAM,EAAE,UAAU,EAAE,eAAe,EAAE,aAAa,EAAE,GAAG,KAAK,CAAC;QAE7D,MAAM,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,cAAc,EAAE;YAC9C,OAAO,EAAE,eAAe;YACxB,OAAO,EAAE,UAAU,CAAC,OAAO;YAC3B,SAAS,EAAE,UAAU,CAAC,KAAK,CAAC,MAAM;YAClC,eAAe,EAAE,UAAU,CAAC,eAAe;YAC3C,iBAAiB,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC5C,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI;gBACtB,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ;gBACvC,KAAK,EAAE,EAAE,CAAC,KAAK;gBACf,SAAS,EAAE,EAAE,CAAC,SAAS;aACxB,CAAC,CAAC;SACJ,CAAC,CAAC;QAEH,MAAM,MAAM,CAAC,UAAU,CACrB,OAAO,EACP,aAAa,EACb,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACjC,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;YACpC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;YACjC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;SAC7C,CAAC,CAAC,CACJ,CAAC;IACJ,CAAC;IAED,eAAe,CAAC,KAA0B;QACxC,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC3E,OAAO;YACL,mBAAmB,OAAO,kBAAkB;YAC5C,EAAE;YACF,2DAA2D;YAC3D,iDAAiD;YACjD,EAAE;YACF,UAAU;YACV,iEAAiE;YACjE,iEAAiE;YACjE,mCAAmC;YACnC,+CAA+C;YAC/C,oDAAoD;YACpD,EAAE;YACF,mDAAmD;YACnD,SAAS;YACT,GAAG;YACH,6DAA6D;YAC7D,mEAAmE;YACnE,0BAA0B;YAC1B,0BAA0B;YAC1B,2BAA2B;YAC3B,iCAAiC;YACjC,oCAAoC;YACpC,kCAAkC;YAClC,GAAG;YACH,KAAK;SACN,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;IAED,SAAS;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,YAAY;QACV,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,YAAY,EAAE;QACZ,KAAK,EAAE;YACL;gBACE,IAAI,EAAE,iBAAiB;gBACvB,MAAM,EAAE,MAAe;gBACvB,QAAQ,EAAE,IAAI;gBACd,WAAW,EAAE,mCAAmC;aACjD;SACF;KACF;IAED,KAAK,CAAC,aAAa,CAAC,MAAuB;QACzC,MAAM,GAAG,GAAG,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAA4B,CAAC;QAC5F,OAAO;YACL,gBAAgB,EAAE,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;gBAC5F,CAAC,CAAC,GAAG,CAAC,gBAAgB;gBACtB,CAAC,CAAC,SAAS,CAA6C;YAC1D,cAAc,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC,QAAQ,CACnE,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAC3B;gBACC,CAAC,CAAC,GAAG,CAAC,cAAc;gBACpB,CAAC,CAAC,MAAM,CAA2C;YACrD,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;YAC3E,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;YAC3E,WAAW,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;YAC9E,iBAAiB,EAAE,OAAO,CAAC,GAAG,CAAC,iBAAiB,CAAC;YACjD,oBAAoB,EAAE,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC;YACvD,oBAAoB,EAClB,OAAO,GAAG,CAAC,oBAAoB,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;SAC9E,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,aAAa,KAAmB,CAAC;IAEvC,SAAS,EAAE,aAAa;IACxB,OAAO,EAAE,OAAO;IAChB,gBAAgB,EAAE,IAAI;IAEtB,mBAAmB,EAAE;QACnB,IAAI,EAAE,OAAO;QACb,UAAU,EAAE,aAAa;KAC1B;CACF,CAAC"}

package/dist/experimental/moe-gate.d.ts

@@ -0,0 +1,134 @@
+/**
+ * MoEGate — Mixture-of-Experts inspired gating for task routing.
+ *
+ * Learns per-domain weight vectors over routing strategies from outcome
+ * feedback. Replaces threshold-based strategy selection with a learned
+ * linear gate:
+ *
+ *   gate(features) = softmax(W · features)
+ *
+ * where W is a weight matrix (one row per strategy), and features are
+ * extracted from the task + memory state.
+ *
+ * Online gradient update:
+ *   w[chosen] += learningRate * reward * features
+ *   w[others] -= learningRate * (1 - reward) * features / (numStrategies - 1)
+ *
+ * Cold start: uniform weights → falls back to existing threshold logic.
+ *
+ * QUARANTINED (core-loop walkback, Pass 2): the gate was never trained in
+ * production — `Router.updateGate()`'s only callers were tests — so the
+ * routing-override branch was permanently dead. Moved here out of the core hot
+ * path; retained for reference / possible future revival. The difficulty signal
+ * it consumed (`computeTaskDifficulty`) is a live router feature and stays in
+ * core at `search/task-difficulty.ts`. See docs/DESIGN-core-loop-walkback.md.
+ */
+/**
+ * Serialized gate state for persistence
+ */
+export interface MoEGateState {
+    strategies: string[];
+    featureSize: number;
+    globalWeights: number[][];
+    domainWeights: Record<string, number[][]>;
+    updateCount: number;
+}
+/**
+ * MoE-inspired gating function over routing strategies
+ */
+export declare class MoEGate {
+    private strategies;
+    private featureSize;
+    private globalWeights;
+    private domainWeights;
+    private updateCount;
+    constructor(strategies: string[], featureSize: number);
+    /**
+     * Compute gate weights for a task given its feature vector.
+     * Returns a map of strategy → probability.
+     */
+    gate(features: number[], domain?: string): Map<string, number>;
+    /**
+     * Select the best strategy (argmax of gate output).
+     */
+    selectStrategy(features: number[], domain?: string): string;
+    /**
+     * Update weights from outcome feedback (online gradient).
+     *
+     * Positive reward → increase weight for chosen strategy's features.
+     * Negative reward → decrease weight.
+     */
+    update(features: number[], chosenStrategy: string, reward: number, learningRate?: number, domain?: string): void;
+    /**
+     * Whether the gate has been trained (has seen any updates).
+     */
+    get isTrained(): boolean;
+    /**
+     * Number of updates the gate has seen.
+     */
+    get totalUpdates(): number;
+    /**
+     * Serialize for persistence.
+     */
+    toJSON(): MoEGateState;
+    /**
+     * Deserialize from persisted state.
+     */
+    static fromJSON(data: MoEGateState): MoEGate;
+    /**
+     * Get the weight matrix for a domain (with fallback to global).
+     */
+    private getWeights;
+    /**
+     * Compute logits = W · features for each strategy.
+     */
+    private computeLogits;
+    /**
+     * Softmax with numerical stability (subtract max).
+     */
+    private softmax;
+    /**
+     * Online gradient update on a weight matrix.
+     *
+     * Uses centered reward (reward - 0.5) so that:
+     *   reward=1 → positive update for chosen, negative for others
+     *   reward=0 → negative update for chosen, positive for others
+     */
+    private updateWeightMatrix;
+}
+/**
+ * Extract feature vector from a task and memory context for the MoE gate.
+ *
+ * Features (8 dimensions):
+ * 0: task description length (normalized)
+ * 1: domain familiarity (experience count, normalized)
+ * 2: best experience match score
+ * 3: best playbook match score
+ * 4: best playbook confidence
+ * 5: is bug fix (0/1)
+ * 6: is new feature (0/1)
+ * 7: GENERAL task difficulty score in [0,1] (G6 — replaces the old raw
+ *    word-count proxy with the domain-agnostic structural difficulty signal)
+ *
+ * `tools` (optional) feeds the tool-diversity component of difficulty.
+ */
+export declare function extractTaskFeatures(taskDescription: string, memoryContext: {
+    experiences: Array<{
+        score: number;
+    }>;
+    playbooks: Array<{
+        score: number;
+        playbook: {
+            confidence: number;
+        };
+    }>;
+}, experienceCountInDomain?: number, tools?: string[]): number[];
+/** Default feature size for the MoE gate */
+export declare const MOE_FEATURE_SIZE = 8;
+/** Default strategies for the MoE gate */
+export declare const MOE_STRATEGIES: readonly ["direct", "adapt", "explore", "fallback"];
+/**
+ * Create a MoEGate with default settings
+ */
+export declare function createMoEGate(): MoEGate;
+//# sourceMappingURL=moe-gate.d.ts.map

package/dist/experimental/moe-gate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"moe-gate.d.ts","sourceRoot":"","sources":["../../src/experimental/moe-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAIH;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,EAAE,EAAE,CAAC;IAC1B,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAC1C,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,qBAAa,OAAO;IAClB,OAAO,CAAC,UAAU,CAAW;IAC7B,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,aAAa,CAAa;IAClC,OAAO,CAAC,aAAa,CAAsC;IAC3D,OAAO,CAAC,WAAW,CAAK;gBAEZ,UAAU,EAAE,MAAM,EAAE,EAAE,WAAW,EAAE,MAAM;IAUrD;;;OAGG;IACH,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAY9D;;OAEG;IACH,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM;IAe3D;;;;;OAKG;IACH,MAAM,CACJ,QAAQ,EAAE,MAAM,EAAE,EAClB,cAAc,EAAE,MAAM,EACtB,MAAM,EAAE,MAAM,EACd,YAAY,SAAO,EACnB,MAAM,CAAC,EAAE,MAAM,GACd,IAAI;IAuBP;;OAEG;IACH,IAAI,SAAS,IAAI,OAAO,CAEvB;IAED;;OAEG;IACH,IAAI,YAAY,IAAI,MAAM,CAEzB;IAED;;OAEG;IACH,MAAM,IAAI,YAAY;IAetB;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO;IAc5C;;OAEG;IACH,OAAO,CAAC,UAAU;IAOlB;;OAEG;IACH,OAAO,CAAC,aAAa;IAUrB;;OAEG;IACH,OAAO,CAAC,OAAO;IAOf;;;;;;OAMG;IACH,OAAO,CAAC,kBAAkB;CAsB3B;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,mBAAmB,CACjC,eAAe,EAAE,MAAM,EACvB,aAAa,EAAE;IACb,WAAW,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACtC,SAAS,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE;YAAE,UAAU,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,CAAC,CAAC;CACvE,EACD,uBAAuB,SAAI,EAC3B,KAAK,GAAE,MAAM,EAAO,GACnB,MAAM,EAAE,CAmCV;AAED,4CAA4C;AAC5C,eAAO,MAAM,gBAAgB,IAAI,CAAC;AAElC,0CAA0C;AAC1C,eAAO,MAAM,cAAc,qDAAsD,CAAC;AAElF;;GAEG;AACH,wBAAgB,aAAa,IAAI,OAAO,CAEvC"}