0agent 1.0.0

package/packages/core/dist/engine/InferenceEngine.js

@@ -0,0 +1,242 @@
+/**
+ * InferenceEngine — Phase 4 full inference pipeline.
+ *
+ * Replaces the Phase 2 stub with:
+ *   - Full entity resolution (pipeline or fallback)
+ *   - Graph traversal with TraversalLedger recording
+ *   - SelectionPolicy-based plan selection
+ *   - Credit attribution and weight propagation on outcome
+ *   - Skill metadata decoration
+ *
+ * The Phase 2 resolve() method is preserved for backward compatibility.
+ */
+import { NodeType } from '../graph/GraphNode.js';
+// ─── InferenceEngine ─────────────────────────────────────
+export class InferenceEngine {
+    graph;
+    resolver;
+    policy;
+    resolutionPipeline;
+    attribution;
+    propagation;
+    updater;
+    constructor(graph, resolver, policy, resolutionPipeline, attribution, propagation, updater) {
+        this.graph = graph;
+        this.resolver = resolver;
+        this.policy = policy;
+        this.resolutionPipeline = resolutionPipeline;
+        this.attribution = attribution;
+        this.propagation = propagation;
+        this.updater = updater;
+    }
+    // ─── Phase 2 backward-compatible resolve() ─────────────
+    async resolve(task, _context) {
+        const plan = {
+            task,
+            resolved_entities: [],
+            selected_edge: null,
+            skill: null,
+            confidence: 0,
+            reasoning: '',
+        };
+        // Step 1: Extract and resolve entity mentions from the task
+        const mentions = this.extractMentions(task);
+        for (const mention of mentions) {
+            try {
+                const result = await this.resolver.resolve(mention);
+                plan.resolved_entities.push({
+                    mention,
+                    node_id: result.node_id,
+                    confidence: result.confidence,
+                    match_type: result.match_type,
+                });
+            }
+            catch {
+                // Resolution failure is non-fatal
+            }
+        }
+        // Step 2: Find candidate edges from resolved entities
+        const candidateEdges = [];
+        for (const entity of plan.resolved_entities) {
+            const edges = this.graph.getEdgesFrom(entity.node_id);
+            candidateEdges.push(...edges);
+        }
+        // If no entities resolved, try a structural query for context nodes
+        if (candidateEdges.length === 0) {
+            const contextNodes = this.graph.queryStructural({
+                node_type: NodeType.CONTEXT,
+                limit: 10,
+            });
+            for (const result of contextNodes) {
+                const edges = this.graph.getEdgesFrom(result.node.id);
+                candidateEdges.push(...edges);
+            }
+        }
+        // Step 3: Select best edge via SelectionPolicy
+        if (candidateEdges.length > 0) {
+            const unique = new Map(candidateEdges.map((e) => [e.id, e]));
+            const selection = this.policy.select([...unique.values()]);
+            if (selection) {
+                const fromNode = this.graph.getNode(selection.edge.from_node);
+                const toNode = this.graph.getNode(selection.edge.to_node);
+                plan.selected_edge = {
+                    edge_id: selection.edge.id,
+                    from_label: fromNode?.label ?? selection.edge.from_node,
+                    to_label: toNode?.label ?? selection.edge.to_node,
+                    weight: selection.edge.weight,
+                    mode: selection.mode,
+                };
+                plan.confidence = selection.score;
+                if (toNode?.metadata?.is_skill) {
+                    plan.skill = toNode.label;
+                }
+                plan.reasoning = `Selected ${plan.selected_edge.from_label} → ${plan.selected_edge.to_label} (weight: ${selection.edge.weight.toFixed(2)}, mode: ${selection.mode})`;
+            }
+        }
+        if (!plan.selected_edge) {
+            plan.reasoning = 'No candidate edges found — bootstrap mode may be needed';
+        }
+        return plan;
+    }
+    // ─── Phase 4 full inference pipeline ────────────────────
+    async infer(req) {
+        const trace_id = crypto.randomUUID();
+        const started = Date.now();
+        // Step 1: Entity Resolution
+        let resolvedEntities;
+        if (this.resolutionPipeline) {
+            resolvedEntities = await this.resolutionPipeline.extractAndResolve(req.input, req.context);
+        }
+        else {
+            resolvedEntities = await this.resolveEntitiesFallback(req.input);
+        }
+        // Step 2: Graph query — gather candidate edges from resolved entities
+        const candidateEdges = [];
+        for (const entity of resolvedEntities) {
+            const edges = this.graph.getEdgesFrom(entity.node_id);
+            candidateEdges.push(...edges);
+        }
+        // Fallback to context nodes if nothing resolved
+        if (candidateEdges.length === 0) {
+            const contextNodes = this.graph.queryStructural({
+                node_type: NodeType.CONTEXT,
+                limit: 10,
+            });
+            for (const result of contextNodes) {
+                const edges = this.graph.getEdgesFrom(result.node.id);
+                candidateEdges.push(...edges);
+            }
+        }
+        // Step 3: Plan selection via SelectionPolicy (epsilon-greedy)
+        const unique = new Map(candidateEdges.map((e) => [e.id, e]));
+        const deduped = [...unique.values()];
+        const selection = deduped.length > 0 ? this.policy.select(deduped) : null;
+        const planSelected = [];
+        let skillName = null;
+        // Step 4: Record in TraversalLedger (if available at runtime)
+        if (selection) {
+            planSelected.push(selection.edge.id);
+            const toNode = this.graph.getNode(selection.edge.to_node);
+            if (toNode?.metadata?.is_skill) {
+                skillName = toNode.label;
+            }
+            // Record traversal in a ledger instance if one is passed through context
+            const ledger = req.context?.['_traversal_ledger'];
+            if (ledger) {
+                const siblings = this.graph.getEdgesFrom(selection.edge.from_node);
+                ledger.record(selection.edge, 0, siblings);
+            }
+        }
+        // Step 5: Build output description (no subagent delegation in core)
+        let output;
+        if (selection) {
+            const fromNode = this.graph.getNode(selection.edge.from_node);
+            const toNode = this.graph.getNode(selection.edge.to_node);
+            const fromLabel = fromNode?.label ?? selection.edge.from_node;
+            const toLabel = toNode?.label ?? selection.edge.to_node;
+            output = skillName
+                ? `Skill: ${skillName} (via ${fromLabel} → ${toLabel}, weight: ${selection.edge.weight.toFixed(2)}, mode: ${selection.mode})`
+                : `Plan: ${fromLabel} → ${toLabel} (weight: ${selection.edge.weight.toFixed(2)}, mode: ${selection.mode})`;
+        }
+        else {
+            output = 'No plan selected — bootstrap mode may be needed';
+        }
+        // Step 6: If outcome available, run attribution + weight update
+        const outcomeSignal = req.context?.['outcome_signal'];
+        if (outcomeSignal !== undefined &&
+            this.attribution &&
+            this.propagation) {
+            const ledger = req.context?.['_traversal_ledger'];
+            if (ledger) {
+                await this.attribution.attribute(ledger, outcomeSignal, trace_id);
+                const outcome = {
+                    value: outcomeSignal,
+                    type: 'explicit',
+                    trace_id,
+                    resolved_at: Date.now(),
+                };
+                await this.propagation.propagate(ledger.toStepLedgers(), outcome);
+            }
+        }
+        // Step 7: Decorate with skill metadata if present in context
+        const contextSkillName = req.context?.['skill_name'];
+        const deferred = req.context?.['deferred'] === true;
+        const result = {
+            output,
+            trace_id,
+            entities_resolved: resolvedEntities.map((e) => e.node_id),
+            plan_selected: planSelected,
+            subagent_result: req.context?.['subagent_result'],
+            outcome_signal: outcomeSignal,
+            deferred,
+        };
+        return result;
+    }
+    // ─── Private helpers ────────────────────────────────────
+    /**
+     * Fallback entity resolution using the simple NodeResolutionService.
+     * Used when no EntityResolutionPipeline is provided.
+     */
+    async resolveEntitiesFallback(input) {
+        const mentions = this.extractMentions(input);
+        const resolved = [];
+        for (const mention of mentions) {
+            try {
+                const result = await this.resolver.resolve(mention);
+                resolved.push({
+                    mention,
+                    node_id: result.node_id,
+                    confidence: result.confidence,
+                    match_type: result.match_type,
+                });
+            }
+            catch {
+                // Resolution failure is non-fatal
+            }
+        }
+        return resolved;
+    }
+    /**
+     * Simple mention extraction: split task into potential entity names.
+     * Phase 4 EntityResolutionPipeline provides LLM-based NER as upgrade.
+     */
+    extractMentions(task) {
+        const mentions = [];
+        const words = task.split(/\s+/).filter(Boolean);
+        // Try pairs first (e.g., "Acme Corp")
+        for (let i = 0; i < words.length - 1; i++) {
+            const pair = `${words[i]} ${words[i + 1]}`;
+            if (/^[A-Z]/.test(words[i]) && /^[A-Z]/.test(words[i + 1])) {
+                mentions.push(pair);
+            }
+        }
+        // Then individual capitalized words
+        for (const word of words) {
+            if (/^[A-Z]/.test(word) && word.length > 2) {
+                mentions.push(word);
+            }
+        }
+        return [...new Set(mentions)];
+    }
+}
+//# sourceMappingURL=InferenceEngine.js.map

package/packages/core/dist/engine/InferenceEngine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InferenceEngine.js","sourceRoot":"","sources":["../../src/engine/InferenceEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAUH,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AA6EjD,4DAA4D;AAE5D,MAAM,OAAO,eAAe;IAEhB;IACA;IACA;IACA;IACA;IACA;IACA;IAPV,YACU,KAAqB,EACrB,QAA+B,EAC/B,MAAuB,EACvB,kBAA6C,EAC7C,WAA+B,EAC/B,WAA+B,EAC/B,OAA2B;QAN3B,UAAK,GAAL,KAAK,CAAgB;QACrB,aAAQ,GAAR,QAAQ,CAAuB;QAC/B,WAAM,GAAN,MAAM,CAAiB;QACvB,uBAAkB,GAAlB,kBAAkB,CAA2B;QAC7C,gBAAW,GAAX,WAAW,CAAoB;QAC/B,gBAAW,GAAX,WAAW,CAAoB;QAC/B,YAAO,GAAP,OAAO,CAAoB;IAClC,CAAC;IAEJ,0DAA0D;IAE1D,KAAK,CAAC,OAAO,CACX,IAAY,EACZ,QAAkC;QAElC,MAAM,IAAI,GAAkB;YAC1B,IAAI;YACJ,iBAAiB,EAAE,EAAE;YACrB,aAAa,EAAE,IAAI;YACnB,KAAK,EAAE,IAAI;YACX,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,EAAE;SACd,CAAC;QAEF,4DAA4D;QAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAC5C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBACpD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;oBAC1B,OAAO;oBACP,OAAO,EAAE,MAAM,CAAC,OAAO;oBACvB,UAAU,EAAE,MAAM,CAAC,UAAU;oBAC7B,UAAU,EAAE,MAAM,CAAC,UAAU;iBAC9B,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC;gBACP,kCAAkC;YACpC,CAAC;QACH,CAAC;QAED,sDAAsD;QACtD,MAAM,cAAc,GAAgB,EAAE,CAAC;QACvC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACtD,cAAc,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;QAChC,CAAC;QAED,oEAAoE;QACpE,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC;gBAC9C,SAAS,EAAE,QAAQ,CAAC,OAAO;gBAC3B,KAAK,EAAE,EAAE;aACV,CAAC,CAAC;YACH,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;gBAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtD,cAAc,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,+CAA+C;QAC/C,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAE3D,IAAI,SAAS,EAAE,CAAC;gBACd,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAE1D,IAAI,CAAC,aAAa,GAAG;oBACnB,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE;oBAC1B,UAAU,EAAE,QAAQ,EAAE,KAAK,IAAI,SAAS,CAAC,IAAI,CAAC,SAAS;oBACvD,QAAQ,EAAE,MAAM,EAAE,KAAK,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO;oBACjD,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,MAAM;oBAC7B,IAAI,EAAE,SAAS,CAAC,IAAI;iBACrB,CAAC;gBAEF,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC;gBAElC,IAAI,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;oBAC/B,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;gBAC5B,CAAC;gBAED,IAAI,CAAC,SAAS,GAAG,YAAY,IAAI,CAAC,aAAa,CAAC,UAAU,MAAM,IAAI,CAAC,aAAa,CAAC,QAAQ,aAAa,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,SAAS,CAAC,IAAI,GAAG,CAAC;YACvK,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,GAAG,yDAAyD,CAAC;QAC7E,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2DAA2D;IAE3D,KAAK,CAAC,KAAK,CAAC,GAAqB;QAC/B,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE3B,4BAA4B;QAC5B,IAAI,gBAAkC,CAAC;QACvC,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC5B,gBAAgB,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAChE,GAAG,CAAC,KAAK,EACT,GAAG,CAAC,OAAO,CACZ,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,gBAAgB,GAAG,MAAM,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnE,CAAC;QAED,sEAAsE;QACtE,MAAM,cAAc,GAAgB,EAAE,CAAC;QACvC,KAAK,MAAM,MAAM,IAAI,gBAAgB,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACtD,cAAc,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;QAChC,CAAC;QAED,gDAAgD;QAChD,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC;gBAC9C,SAAS,EAAE,QAAQ,CAAC,OAAO;gBAC3B,KAAK,EAAE,EAAE;aACV,CAAC,CAAC;YACH,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;gBAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtD,cAAc,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QACrC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAE1E,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,IAAI,SAAS,GAAkB,IAAI,CAAC;QAEpC,8DAA8D;QAC9D,IAAI,SAAS,EAAE,CAAC;YACd,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAErC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1D,IAAI,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;gBAC/B,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC;YAC3B,CAAC;YAED,yEAAyE;YACzE,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,mBAAmB,CAAgC,CAAC;YACjF,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACnE,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,oEAAoE;QACpE,IAAI,MAAc,CAAC;QACnB,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1D,MAAM,SAAS,GAAG,QAAQ,EAAE,KAAK,IAAI,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC;YAC9D,MAAM,OAAO,GAAG,MAAM,EAAE,KAAK,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC;YACxD,MAAM,GAAG,SAAS;gBAChB,CAAC,CAAC,UAAU,SAAS,SAAS,SAAS,MAAM,OAAO,aAAa,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,SAAS,CAAC,IAAI,GAAG;gBAC7H,CAAC,CAAC,SAAS,SAAS,MAAM,OAAO,aAAa,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,SAAS,CAAC,IAAI,GAAG,CAAC;QAC/G,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,iDAAiD,CAAC;QAC7D,CAAC;QAED,gEAAgE;QAChE,MAAM,aAAa,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,gBAAgB,CAAuB,CAAC;QAC5E,IACE,aAAa,KAAK,SAAS;YAC3B,IAAI,CAAC,WAAW;YAChB,IAAI,CAAC,WAAW,EAChB,CAAC;YACD,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,mBAAmB,CAAgC,CAAC;YACjF,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;gBAElE,MAAM,OAAO,GAAkB;oBAC7B,KAAK,EAAE,aAAa;oBACpB,IAAI,EAAE,UAAU;oBAChB,QAAQ;oBACR,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;iBACxB,CAAC;gBACF,MAAM,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE,OAAO,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QAED,6DAA6D;QAC7D,MAAM,gBAAgB,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,YAAY,CAAuB,CAAC;QAC3E,MAAM,QAAQ,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,KAAK,IAAI,CAAC;QAEpD,MAAM,MAAM,GAAoB;YAC9B,MAAM;YACN,QAAQ;YACR,iBAAiB,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YACzD,aAAa,EAAE,YAAY;YAC3B,eAAe,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,iBAAiB,CAAC;YACjD,cAAc,EAAE,aAAa;YAC7B,QAAQ;SACT,CAAC;QAEF,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,2DAA2D;IAE3D;;;OAGG;IACK,KAAK,CAAC,uBAAuB,CAAC,KAAa;QACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,QAAQ,GAAqB,EAAE,CAAC;QAEtC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBACpD,QAAQ,CAAC,IAAI,CAAC;oBACZ,OAAO;oBACP,OAAO,EAAE,MAAM,CAAC,OAAO;oBACvB,UAAU,EAAE,MAAM,CAAC,UAAU;oBAC7B,UAAU,EAAE,MAAM,CAAC,UAAU;iBAC9B,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC;gBACP,kCAAkC;YACpC,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACK,eAAe,CAAC,IAAY;QAClC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAEhD,sCAAsC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC3C,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC3D,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3C,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;IAChC,CAAC;CACF"}

package/packages/core/dist/engine/SelectionPolicy.d.ts

@@ -0,0 +1,29 @@
+import type { GraphEdge } from '../graph/GraphEdge.js';
+export interface SelectionConfig {
+    epsilon: number;
+    temperature: number;
+}
+export interface SelectionResult {
+    edge: GraphEdge;
+    mode: 'exploit' | 'explore';
+    score: number;
+}
+export declare class SelectionPolicy {
+    private config;
+    private rng;
+    constructor(config?: Partial<SelectionConfig>, rng?: () => number);
+    /**
+     * Select an edge from candidates using epsilon-greedy.
+     * - With probability epsilon: random selection (explore)
+     * - Otherwise: temperature-softmax weighted by edge weight (exploit)
+     * Returns null if no candidates.
+     */
+    select(candidates: GraphEdge[]): SelectionResult | null;
+    /**
+     * Softmax selection weighted by edge weight / temperature.
+     * Higher temperature = more uniform. Lower = more greedy.
+     */
+    private softmaxSelect;
+    getConfig(): SelectionConfig;
+}
+//# sourceMappingURL=SelectionPolicy.d.ts.map

package/packages/core/dist/engine/SelectionPolicy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SelectionPolicy.d.ts","sourceRoot":"","sources":["../../src/engine/SelectionPolicy.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAEvD,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,SAAS,CAAC;IAChB,IAAI,EAAE,SAAS,GAAG,SAAS,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC;CACf;AAED,qBAAa,eAAe;IAC1B,OAAO,CAAC,MAAM,CAAkB;IAChC,OAAO,CAAC,GAAG,CAAe;gBAEd,MAAM,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,MAAM;IAQjE;;;;;OAKG;IACH,MAAM,CAAC,UAAU,EAAE,SAAS,EAAE,GAAG,eAAe,GAAG,IAAI;IAkBvD;;;OAGG;IACH,OAAO,CAAC,aAAa;IAqBrB,SAAS,IAAI,eAAe;CAG7B"}

package/packages/core/dist/engine/SelectionPolicy.js

@@ -0,0 +1,58 @@
+export class SelectionPolicy {
+    config;
+    rng; // injectable RNG for testing
+    constructor(config, rng) {
+        this.config = {
+            epsilon: config?.epsilon ?? 0.15,
+            temperature: config?.temperature ?? 0.5,
+        };
+        this.rng = rng ?? Math.random;
+    }
+    /**
+     * Select an edge from candidates using epsilon-greedy.
+     * - With probability epsilon: random selection (explore)
+     * - Otherwise: temperature-softmax weighted by edge weight (exploit)
+     * Returns null if no candidates.
+     */
+    select(candidates) {
+        if (candidates.length === 0)
+            return null;
+        if (candidates.length === 1) {
+            return { edge: candidates[0], mode: 'exploit', score: candidates[0].weight };
+        }
+        const roll = this.rng();
+        if (roll < this.config.epsilon) {
+            // EXPLORE: uniform random
+            const idx = Math.floor(this.rng() * candidates.length);
+            return { edge: candidates[idx], mode: 'explore', score: candidates[idx].weight };
+        }
+        // EXPLOIT: temperature-softmax
+        return this.softmaxSelect(candidates);
+    }
+    /**
+     * Softmax selection weighted by edge weight / temperature.
+     * Higher temperature = more uniform. Lower = more greedy.
+     */
+    softmaxSelect(candidates) {
+        const weights = candidates.map(e => e.weight / this.config.temperature);
+        const maxW = Math.max(...weights);
+        const exps = weights.map(w => Math.exp(w - maxW)); // subtract max for numerical stability
+        const sumExp = exps.reduce((a, b) => a + b, 0);
+        const probs = exps.map(e => e / sumExp);
+        // Weighted random selection
+        let r = this.rng();
+        for (let i = 0; i < probs.length; i++) {
+            r -= probs[i];
+            if (r <= 0) {
+                return { edge: candidates[i], mode: 'exploit', score: candidates[i].weight };
+            }
+        }
+        // Fallback (floating point edge case)
+        const last = candidates[candidates.length - 1];
+        return { edge: last, mode: 'exploit', score: last.weight };
+    }
+    getConfig() {
+        return { ...this.config };
+    }
+}
+//# sourceMappingURL=SelectionPolicy.js.map

package/packages/core/dist/engine/SelectionPolicy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SelectionPolicy.js","sourceRoot":"","sources":["../../src/engine/SelectionPolicy.ts"],"names":[],"mappings":"AAaA,MAAM,OAAO,eAAe;IAClB,MAAM,CAAkB;IACxB,GAAG,CAAe,CAAE,6BAA6B;IAEzD,YAAY,MAAiC,EAAE,GAAkB;QAC/D,IAAI,CAAC,MAAM,GAAG;YACZ,OAAO,EAAE,MAAM,EAAE,OAAO,IAAI,IAAI;YAChC,WAAW,EAAE,MAAM,EAAE,WAAW,IAAI,GAAG;SACxC,CAAC;QACF,IAAI,CAAC,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC;IAChC,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,UAAuB;QAC5B,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACzC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;QAC/E,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAExB,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YAC/B,0BAA0B;YAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;YACvD,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACnF,CAAC;QAED,+BAA+B;QAC/B,OAAO,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACK,aAAa,CAAC,UAAuB;QAC3C,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACxE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,uCAAuC;QAC3F,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;QAExC,4BAA4B;QAC5B,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;YAC/E,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC/C,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;IAC7D,CAAC;IAED,SAAS;QACP,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;CACF"}

package/packages/core/dist/engine/SelfImprovementEngine.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Self-Improvement Engine
+ *
+ * Runs the 5 analyses (skill gaps, workflow optimization, graph health,
+ * tool utilization, skill prompt refinement) against the live graph and
+ * trace store, producing an ImprovementPlan.
+ *
+ * This is executed by the main agent (Level 0) directly — never delegated
+ * to a subagent. It has full read access to the graph and trace store.
+ *
+ * The engine itself does NOT apply changes. It produces a plan. The daemon's
+ * SelfImprovementApplicator reads the plan + auto_apply config and decides
+ * what to apply automatically vs. what to queue for user approval.
+ */
+import type { KnowledgeGraph } from "../graph/KnowledgeGraph.js";
+import type { ILLMClient } from "../bootstrap/GraphConstructor.js";
+import type { ImprovementPlan, SelfImprovementConfig } from "../types/SelfImprovement.js";
+export interface SelfImprovementContext {
+    evaluation_period_start: number;
+    evaluation_period_end: number;
+    skill_definitions: Array<{
+        name: string;
+        role_prompt: string;
+    }>;
+    mcp_tools: Array<{
+        name: string;
+        server: string;
+    }>;
+}
+export declare class SelfImprovementEngine {
+    private graph;
+    private llm;
+    private config;
+    constructor(graph: KnowledgeGraph, llm: ILLMClient, config: SelfImprovementConfig);
+    /**
+     * Run the full 5-analysis improvement cycle.
+     *
+     * In Phase 1-2, this runs the analyses as pure graph queries.
+     * In Phase 4+, this uses the LLM with SELF_IMPROVEMENT_PROMPT to
+     * generate more nuanced recommendations.
+     */
+    analyze(ctx: SelfImprovementContext): Promise<ImprovementPlan>;
+    private analyzeSkillGaps;
+    private analyzeWorkflow;
+    private analyzeGraphHealth;
+    private findContradictions;
+    private findDeadZones;
+    private findOrphans;
+    private analyzeToolUtilization;
+    private analyzeSkillPrompts;
+    private rankActions;
+    /**
+     * Get the system prompt for LLM-powered analysis (Phase 4+).
+     * The prompt is injected with actual graph/trace data as context.
+     */
+    getPrompt(): string;
+}
+//# sourceMappingURL=SelfImprovementEngine.d.ts.map

package/packages/core/dist/engine/SelfImprovementEngine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SelfImprovementEngine.d.ts","sourceRoot":"","sources":["../../src/engine/SelfImprovementEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAEjE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kCAAkC,CAAC;AACnE,OAAO,KAAK,EACV,eAAe,EACf,qBAAqB,EAWtB,MAAM,6BAA6B,CAAC;AAGrC,MAAM,WAAW,sBAAsB;IACrC,uBAAuB,EAAE,MAAM,CAAC;IAChC,qBAAqB,EAAE,MAAM,CAAC;IAC9B,iBAAiB,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAChE,SAAS,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACpD;AAED,qBAAa,qBAAqB;IAE9B,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,GAAG;IACX,OAAO,CAAC,MAAM;gBAFN,KAAK,EAAE,cAAc,EACrB,GAAG,EAAE,UAAU,EACf,MAAM,EAAE,qBAAqB;IAGvC;;;;;;OAMG;IACG,OAAO,CAAC,GAAG,EAAE,sBAAsB,GAAG,OAAO,CAAC,eAAe,CAAC;YAiCtD,gBAAgB;YAWhB,eAAe;YAmCf,kBAAkB;IAWhC,OAAO,CAAC,kBAAkB;IA6B1B,OAAO,CAAC,aAAa;IA8BrB,OAAO,CAAC,WAAW;YAkCL,sBAAsB;YActB,mBAAmB;IASjC,OAAO,CAAC,WAAW;IAoFnB;;;OAGG;IACH,SAAS,IAAI,MAAM;CAGpB"}