swarm-engine 1.3.0 → 1.41.0

package/dist/runtime/graph-causal.js

@@ -0,0 +1,292 @@
+// ─── Engine ──────────────────────────────────────────────────────────
+/**
+ * Causal inference engine that builds structural causal models from execution
+ * traces and estimates causal effects using backdoor adjustment.
+ *
+ * Extracts observations from the execution knowledge graph, computes normalized
+ * mutual information between variables, identifies confounders, and estimates
+ * average treatment effects using a tiered approach (raw → stratified → backdoor).
+ */
+export class CausalGraphEngine {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Extract observations from the execution graph.
+     *
+     * Walks orchestration → phase → agent subgraphs via BFS (depth 3),
+     * mapping each agent to an observation with model, agentType, fileSetSize,
+     * contextQuality, and outcome.
+     */
+    extractObservations(orchestrationId) {
+        const observations = [];
+        let orchNodes;
+        if (orchestrationId) {
+            const node = this.graph.getNode(orchestrationId);
+            orchNodes = node && node.type === 'orchestration' ? [node] : [];
+        }
+        else {
+            orchNodes = this.graph.getNodesByType('orchestration');
+        }
+        for (const orch of orchNodes) {
+            // BFS depth 3: orch(0) → phase(1) → agent(2) → file(3)
+            const { nodes } = this.graph.bfs(orch.id, 3);
+            const agents = nodes.filter((n) => n.type === 'agent');
+            for (const agent of agents) {
+                const model = agent.properties.model || 'unknown';
+                const agentType = agent.label;
+                // Count touched_file edges to classify file set size
+                const touchedEdges = this.graph.getEdges(agent.id, 'outgoing').filter((e) => e.type === 'touched_file');
+                const fileCount = touchedEdges.length;
+                let fileSetSize;
+                if (fileCount < 5)
+                    fileSetSize = 'small';
+                else if (fileCount <= 20)
+                    fileSetSize = 'medium';
+                else
+                    fileSetSize = 'large';
+                // Context quality: default to 'medium' (no reflection confidence stored on phase nodes)
+                const contextQuality = 'medium';
+                // Outcome: agent status 'idle' = success, anything else = failure
+                const status = agent.properties.status;
+                const outcome = status === 'idle' ? 'success' : 'failure';
+                observations.push({
+                    orchestrationId: orch.id,
+                    model,
+                    agentType,
+                    fileSetSize,
+                    contextQuality,
+                    outcome,
+                });
+            }
+        }
+        return observations;
+    }
+    /**
+     * Compute Normalized Mutual Information between two categorical variables.
+     *
+     * NMI = I(X;Y) / sqrt(H(X) * H(Y))
+     * where H(X) = -Σ p(x) log2(p(x))
+     * and I(X;Y) = Σ p(x,y) log2(p(x,y) / (p(x)*p(y)))
+     *
+     * Returns 0 when either variable has zero entropy (constant).
+     * Returns 1.0 when a variable is compared with itself.
+     */
+    computeNMI(observations, var1, var2) {
+        if (observations.length === 0)
+            return 0;
+        const n = observations.length;
+        const freq1 = new Map();
+        const freq2 = new Map();
+        const joint = new Map();
+        for (const obs of observations) {
+            const v1 = obs[var1];
+            const v2 = obs[var2];
+            freq1.set(v1, (freq1.get(v1) ?? 0) + 1);
+            freq2.set(v2, (freq2.get(v2) ?? 0) + 1);
+            const key = `${v1}\0${v2}`; // NUL separator avoids collisions in value strings
+            joint.set(key, (joint.get(key) ?? 0) + 1);
+        }
+        const entropy = (freq) => {
+            let h = 0;
+            for (const count of freq.values()) {
+                const p = count / n;
+                if (p > 0)
+                    h -= p * Math.log2(p);
+            }
+            return h;
+        };
+        const h1 = entropy(freq1);
+        const h2 = entropy(freq2);
+        if (h1 === 0 || h2 === 0)
+            return 0;
+        // Mutual information
+        let mi = 0;
+        for (const [key, count] of joint) {
+            const [v1, v2] = key.split('\0');
+            const pxy = count / n;
+            const px = (freq1.get(v1) ?? 0) / n;
+            const py = (freq2.get(v2) ?? 0) / n;
+            if (pxy > 0 && px > 0 && py > 0) {
+                mi += pxy * Math.log2(pxy / (px * py));
+            }
+        }
+        return mi / Math.sqrt(h1 * h2);
+    }
+    /**
+     * Identify confounders for a treatment → outcome relationship.
+     *
+     * A variable C is a confounder if:
+     *   NMI(C, treatment) > 0.05 AND NMI(C, outcome) > 0.05
+     */
+    identifyConfounders(observations, treatment) {
+        const candidates = ['model', 'agentType', 'fileSetSize', 'contextQuality'].filter((v) => v !== treatment);
+        const confounders = [];
+        for (const candidate of candidates) {
+            const nmiTreatment = this.computeNMI(observations, candidate, treatment);
+            const nmiOutcome = this.computeNMI(observations, candidate, 'outcome');
+            if (nmiTreatment > 0.05 && nmiOutcome > 0.05) {
+                confounders.push(candidate);
+            }
+        }
+        return confounders;
+    }
+    /**
+     * Estimate Average Treatment Effect using a tiered approach:
+     *
+     * - Tier 1 (N < 3): insufficient data → effect=0, low confidence
+     * - Tier 2 (3–9): raw comparison of success rates
+     * - Tier 3 (10–49): stratify by top 1 confounder, weighted average
+     * - Tier 4 (50+): full backdoor adjustment with all confounders
+     *
+     * Effect is always clamped to [-1, 1].
+     */
+    estimateCausalEffect(treatment, treatmentValue, controlValue, orchestrationId) {
+        const obs = this.extractObservations(orchestrationId);
+        const treated = obs.filter((o) => o[treatment] === treatmentValue);
+        const control = obs.filter((o) => o[treatment] === controlValue);
+        const total = treated.length + control.length;
+        // Tier 1: insufficient data
+        if (total < 3) {
+            return { effect: 0, confidence: 'low', sampleCount: total, adjustedFor: [], method: 'raw' };
+        }
+        const confounders = this.identifyConfounders(obs, treatment);
+        const successRate = (group) => {
+            if (group.length === 0)
+                return 0;
+            return group.filter((o) => o.outcome === 'success').length / group.length;
+        };
+        const clamp = (v) => Math.max(-1, Math.min(1, v));
+        // Tier 2: raw comparison (3–9 samples)
+        if (total < 10) {
+            const ate = successRate(treated) - successRate(control);
+            return { effect: clamp(ate), confidence: 'low', sampleCount: total, adjustedFor: [], method: 'raw' };
+        }
+        // Tier 3: stratified by top 1 confounder (10–49 samples)
+        if (total < 50) {
+            if (confounders.length > 0) {
+                const confounder = confounders[0];
+                const ate = this.stratifiedATE(obs, treatment, treatmentValue, controlValue, [confounder], successRate);
+                return {
+                    effect: clamp(ate),
+                    confidence: 'medium',
+                    sampleCount: total,
+                    adjustedFor: [confounder],
+                    method: 'stratified',
+                };
+            }
+            // No confounders: fall back to raw
+            const ate = successRate(treated) - successRate(control);
+            return { effect: clamp(ate), confidence: 'medium', sampleCount: total, adjustedFor: [], method: 'raw' };
+        }
+        // Tier 4: full backdoor adjustment (50+ samples)
+        if (confounders.length > 0) {
+            const ate = this.stratifiedATE(obs, treatment, treatmentValue, controlValue, confounders, successRate);
+            return {
+                effect: clamp(ate),
+                confidence: 'high',
+                sampleCount: total,
+                adjustedFor: confounders,
+                method: 'backdoor',
+            };
+        }
+        const ate = successRate(treated) - successRate(control);
+        return { effect: clamp(ate), confidence: 'high', sampleCount: total, adjustedFor: [], method: 'backdoor' };
+    }
+    /**
+     * Suggest interventions for a failed orchestration by estimating the causal
+     * effect of switching each variable to an alternative value observed in
+     * historical data.
+     *
+     * Returns suggestions ranked by estimated effect (descending), filtered
+     * to only positive effects.
+     */
+    suggestIntervention(failedOrchestrationId) {
+        const obs = this.extractObservations();
+        const failedObs = this.extractObservations(failedOrchestrationId);
+        if (!failedObs.length)
+            return [];
+        const suggestions = [];
+        // Try model changes
+        const currentModel = failedObs[0].model;
+        const allModels = [...new Set(obs.map((o) => o.model))];
+        for (const alt of allModels) {
+            if (alt === currentModel)
+                continue;
+            const est = this.estimateCausalEffect('model', alt, currentModel);
+            if (est.effect > 0) {
+                suggestions.push({
+                    intervention: { variable: 'model', from: currentModel, to: alt },
+                    estimatedEffect: est.effect,
+                    confidence: est.confidence,
+                    reasoning: `Switching model from ${currentModel} to ${alt} has an estimated +${Math.round(est.effect * 100)}% effect on success rate (${est.method}, n=${est.sampleCount})`,
+                });
+            }
+        }
+        // Try agentType changes
+        const currentAgentType = failedObs[0].agentType;
+        const allAgentTypes = [...new Set(obs.map((o) => o.agentType))];
+        for (const alt of allAgentTypes) {
+            if (alt === currentAgentType)
+                continue;
+            const est = this.estimateCausalEffect('agentType', alt, currentAgentType);
+            if (est.effect > 0) {
+                suggestions.push({
+                    intervention: { variable: 'agentType', from: currentAgentType, to: alt },
+                    estimatedEffect: est.effect,
+                    confidence: est.confidence,
+                    reasoning: `Switching agentType from ${currentAgentType} to ${alt} has an estimated +${Math.round(est.effect * 100)}% effect on success rate (${est.method}, n=${est.sampleCount})`,
+                });
+            }
+        }
+        // Try fileSetSize changes
+        const currentFileSetSize = failedObs[0].fileSetSize;
+        const allFileSizes = ['small', 'medium', 'large'];
+        for (const alt of allFileSizes) {
+            if (alt === currentFileSetSize)
+                continue;
+            const est = this.estimateCausalEffect('fileSetSize', alt, currentFileSetSize);
+            if (est.effect > 0) {
+                suggestions.push({
+                    intervention: { variable: 'fileSetSize', from: currentFileSetSize, to: alt },
+                    estimatedEffect: est.effect,
+                    confidence: est.confidence,
+                    reasoning: `Switching fileSetSize from ${currentFileSetSize} to ${alt} has an estimated +${Math.round(est.effect * 100)}% effect on success rate (${est.method}, n=${est.sampleCount})`,
+                });
+            }
+        }
+        return suggestions.sort((a, b) => b.estimatedEffect - a.estimatedEffect);
+    }
+    // ─── Private Helpers ───────────────────────────────────────────────
+    /**
+     * Compute stratified ATE: partition observations by confounder strata,
+     * compute per-stratum ATE, then take a weighted average (weight = stratum size).
+     */
+    stratifiedATE(obs, treatment, treatmentValue, controlValue, confounders, successRate) {
+        const strataKey = (o) => confounders.map((c) => o[c]).join('\0');
+        const strata = new Map();
+        for (const o of obs) {
+            const key = strataKey(o);
+            if (!strata.has(key))
+                strata.set(key, { treated: [], control: [] });
+            const s = strata.get(key);
+            if (o[treatment] === treatmentValue)
+                s.treated.push(o);
+            else if (o[treatment] === controlValue)
+                s.control.push(o);
+        }
+        let weightedAte = 0;
+        let totalWeight = 0;
+        for (const [, s] of strata) {
+            if (s.treated.length > 0 && s.control.length > 0) {
+                const weight = s.treated.length + s.control.length;
+                const stratumAte = successRate(s.treated) - successRate(s.control);
+                weightedAte += stratumAte * weight;
+                totalWeight += weight;
+            }
+        }
+        return totalWeight > 0 ? weightedAte / totalWeight : 0;
+    }
+}
+//# sourceMappingURL=graph-causal.js.map

package/dist/runtime/graph-causal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-causal.js","sourceRoot":"","sources":["../../src/runtime/graph-causal.ts"],"names":[],"mappings":"AA8BA,wEAAwE;AAExE;;;;;;;GAOG;AACH,MAAM,OAAO,iBAAiB;IACR;IAApB,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAG,CAAC;IAE7C;;;;;;OAMG;IACH,mBAAmB,CAAC,eAAwB;QAC1C,MAAM,YAAY,GAAkB,EAAE,CAAC;QAEvC,IAAI,SAAS,CAAC;QACd,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;YACjD,SAAS,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC;QACzD,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,uDAAuD;YACvD,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;YAEvD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAI,KAAK,CAAC,UAAU,CAAC,KAAgB,IAAI,SAAS,CAAC;gBAC9D,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC;gBAE9B,qDAAqD;gBACrD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;gBACxG,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC;gBAEtC,IAAI,WAAyC,CAAC;gBAC9C,IAAI,SAAS,GAAG,CAAC;oBAAE,WAAW,GAAG,OAAO,CAAC;qBACpC,IAAI,SAAS,IAAI,EAAE;oBAAE,WAAW,GAAG,QAAQ,CAAC;;oBAC5C,WAAW,GAAG,OAAO,CAAC;gBAE3B,wFAAwF;gBACxF,MAAM,cAAc,GAA8B,QAAQ,CAAC;gBAE3D,kEAAkE;gBAClE,MAAM,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC,MAA4B,CAAC;gBAC7D,MAAM,OAAO,GAA0B,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;gBAEjF,YAAY,CAAC,IAAI,CAAC;oBAChB,eAAe,EAAE,IAAI,CAAC,EAAE;oBACxB,KAAK;oBACL,SAAS;oBACT,WAAW;oBACX,cAAc;oBACd,OAAO;iBACR,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;;;;;;;OASG;IACH,UAAU,CAAC,YAA2B,EAAE,IAAe,EAAE,IAAe;QACtE,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAExC,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QAExC,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxC,MAAM,GAAG,GAAG,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,mDAAmD;YAC/E,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,CAAC;QAED,MAAM,OAAO,GAAG,CAAC,IAAyB,EAAU,EAAE;YACpD,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClC,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;gBACpB,IAAI,CAAC,GAAG,CAAC;oBAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QAEF,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEnC,qBAAqB;QACrB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;YACjC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;YACtB,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACpC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;gBAChC,EAAE,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAED,OAAO,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACjC,CAAC;IAED;;;;;OAKG;IACH,mBAAmB,CAAC,YAA2B,EAAE,SAAoB;QACnE,MAAM,UAAU,GAAiB,CAAC,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,gBAAgB,CAAiB,CAAC,MAAM,CAC7G,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CACvB,CAAC;QACF,MAAM,WAAW,GAAgB,EAAE,CAAC;QAEpC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACzE,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACvE,IAAI,YAAY,GAAG,IAAI,IAAI,UAAU,GAAG,IAAI,EAAE,CAAC;gBAC7C,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;;;;;;OASG;IACH,oBAAoB,CAClB,SAAoB,EACpB,cAAsB,EACtB,YAAoB,EACpB,eAAwB;QAExB,MAAM,GAAG,GAAG,IAAI,CAAC,mBAAmB,CAAC,eAAe,CAAC,CAAC;QACtD,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,cAAc,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,YAAY,CAAC,CAAC;QACjE,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAE9C,4BAA4B;QAC5B,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;QAC9F,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAE7D,MAAM,WAAW,GAAG,CAAC,KAAoB,EAAU,EAAE;YACnD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACjC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5E,CAAC,CAAC;QAEF,MAAM,KAAK,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAElE,uCAAuC;QACvC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;YACxD,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;QACvG,CAAC;QAED,yDAAyD;QACzD,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACf,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3B,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,SAAS,EAAE,cAAc,EAAE,YAAY,EAAE,CAAC,UAAU,CAAC,EAAE,WAAW,CAAC,CAAC;gBACxG,OAAO;oBACL,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC;oBAClB,UAAU,EAAE,QAAQ;oBACpB,WAAW,EAAE,KAAK;oBAClB,WAAW,EAAE,CAAC,UAAU,CAAC;oBACzB,MAAM,EAAE,YAAY;iBACrB,CAAC;YACJ,CAAC;YACD,mCAAmC;YACnC,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;YACxD,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;QAC1G,CAAC;QAED,iDAAiD;QACjD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,SAAS,EAAE,cAAc,EAAE,YAAY,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;YACvG,OAAO;gBACL,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC;gBAClB,UAAU,EAAE,MAAM;gBAClB,WAAW,EAAE,KAAK;gBAClB,WAAW,EAAE,WAAW;gBACxB,MAAM,EAAE,UAAU;aACnB,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;QACxD,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;IAC7G,CAAC;IAED;;;;;;;OAOG;IACH,mBAAmB,CAAC,qBAA6B;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,CAAC,mBAAmB,CAAC,qBAAqB,CAAC,CAAC;QAClE,IAAI,CAAC,SAAS,CAAC,MAAM;YAAE,OAAO,EAAE,CAAC;QAEjC,MAAM,WAAW,GAA6B,EAAE,CAAC;QAEjD,oBAAoB;QACpB,MAAM,YAAY,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACxC,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxD,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,IAAI,GAAG,KAAK,YAAY;gBAAE,SAAS;YACnC,MAAM,GAAG,GAAG,IAAI,CAAC,oBAAoB,CAAC,OAAO,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC;YAClE,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,WAAW,CAAC,IAAI,CAAC;oBACf,YAAY,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,GAAG,EAAE;oBAChE,eAAe,EAAE,GAAG,CAAC,MAAM;oBAC3B,UAAU,EAAE,GAAG,CAAC,UAAU;oBAC1B,SAAS,EAAE,wBAAwB,YAAY,OAAO,GAAG,sBAAsB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,6BAA6B,GAAG,CAAC,MAAM,OAAO,GAAG,CAAC,WAAW,GAAG;iBAC5K,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,MAAM,gBAAgB,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChD,MAAM,aAAa,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAChE,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,IAAI,GAAG,KAAK,gBAAgB;gBAAE,SAAS;YACvC,MAAM,GAAG,GAAG,IAAI,CAAC,oBAAoB,CAAC,WAAW,EAAE,GAAG,EAAE,gBAAgB,CAAC,CAAC;YAC1E,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,WAAW,CAAC,IAAI,CAAC;oBACf,YAAY,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,GAAG,EAAE;oBACxE,eAAe,EAAE,GAAG,CAAC,MAAM;oBAC3B,UAAU,EAAE,GAAG,CAAC,UAAU;oBAC1B,SAAS,EAAE,4BAA4B,gBAAgB,OAAO,GAAG,sBAAsB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,6BAA6B,GAAG,CAAC,MAAM,OAAO,GAAG,CAAC,WAAW,GAAG;iBACpL,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,MAAM,kBAAkB,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QACpD,MAAM,YAAY,GAAwC,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACvF,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,IAAI,GAAG,KAAK,kBAAkB;gBAAE,SAAS;YACzC,MAAM,GAAG,GAAG,IAAI,CAAC,oBAAoB,CAAC,aAAa,EAAE,GAAG,EAAE,kBAAkB,CAAC,CAAC;YAC9E,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,WAAW,CAAC,IAAI,CAAC;oBACf,YAAY,EAAE,EAAE,QAAQ,EAAE,aAAa,EAAE,IAAI,EAAE,kBAAkB,EAAE,EAAE,EAAE,GAAG,EAAE;oBAC5E,eAAe,EAAE,GAAG,CAAC,MAAM;oBAC3B,UAAU,EAAE,GAAG,CAAC,UAAU;oBAC1B,SAAS,EAAE,8BAA8B,kBAAkB,OAAO,GAAG,sBAAsB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,6BAA6B,GAAG,CAAC,MAAM,OAAO,GAAG,CAAC,WAAW,GAAG;iBACxL,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC;IAC3E,CAAC;IAED,sEAAsE;IAEtE;;;OAGG;IACK,aAAa,CACnB,GAAkB,EAClB,SAAoB,EACpB,cAAsB,EACtB,YAAoB,EACpB,WAAwB,EACxB,WAA6C;QAE7C,MAAM,SAAS,GAAG,CAAC,CAAc,EAAU,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtF,MAAM,MAAM,GAAG,IAAI,GAAG,EAA8D,CAAC;QAErF,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;YACpE,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YAC3B,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,cAAc;gBAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBAClD,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,YAAY;gBAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACjD,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;gBACnD,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBACnE,WAAW,IAAI,UAAU,GAAG,MAAM,CAAC;gBACnC,WAAW,IAAI,MAAM,CAAC;YACxB,CAAC;QACH,CAAC;QAED,OAAO,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;CACF"}

package/dist/runtime/graph-context-router.d.ts

@@ -0,0 +1,73 @@
+import type { GraphNode, GraphEdge, GraphNodeType, GraphEdgeType } from '../core/types.js';
+/**
+ * Minimal read interface for the ExecutionGraph.
+ * Decouples the router from the concrete graph implementation,
+ * allowing independent compilation and testing.
+ */
+export interface ExecutionGraphReader {
+    stats(): {
+        nodeCount: number;
+        edgeCount: number;
+    };
+    getNodesByType(type: GraphNodeType): GraphNode[];
+    getNeighbors(nodeId: string, edgeType?: GraphEdgeType): GraphNode[];
+    getEdgesByType(type: GraphEdgeType): GraphEdge[];
+}
+export interface ContextRouterOptions {
+    /** Max characters for assembled context (default: 80000 ≈ 20k tokens) */
+    tokenBudget?: number;
+    /** Max prior phases to include (default: 5) */
+    maxSources?: number;
+    /** Fallback to dump-all if graph unavailable (default: 'graph') */
+    strategy?: 'graph' | 'all';
+}
+/**
+ * Graph-traversal-based context selection for agents.
+ *
+ * Instead of dumping all prior phase outputs into every agent's prompt,
+ * this router scores phases by relevance using the execution graph:
+ *   1. Extract file references from the agent's task description
+ *   2. Find which prior agents touched those same files (via graph edges)
+ *   3. Rank phase outputs by file overlap, then by dependency signals
+ *   4. Truncate to a token budget
+ *
+ * Falls back to including all outputs (existing behavior) when the graph
+ * is unavailable or empty.
+ */
+export declare class GraphContextRouter {
+    private graph;
+    constructor(graph: ExecutionGraphReader | null);
+    /**
+     * Build context for an agent based on graph topology.
+     */
+    buildContext(agentId: string, agentTask: string, phaseOutputs: Map<string, string[]>, options?: ContextRouterOptions): string;
+    /**
+     * Build context with intra-phase outputs merged in. Called mid-phase when
+     * agents within the same phase have produced partial outputs that should
+     * be visible to sibling agents for live re-routing.
+     */
+    buildContextWithIntraPhase(agentId: string, agentTask: string, phaseOutputs: Map<string, string[]>, intraPhaseOutputs: Map<string, string[]>, options?: ContextRouterOptions): string;
+    /**
+     * Score each phase's relevance to the current agent's task.
+     *
+     * Scoring weights:
+     *   - File overlap with task: +10 per shared file (strongest signal)
+     *   - Phase has downstream consumers: +2 (indicates reusable output)
+     *   - Base: +1 (preserves chronological fallback ordering)
+     */
+    private scorePhaseRelevance;
+    /**
+     * Extract file-like references from a task description.
+     * Matches patterns like "src/runtime/foo.ts", "test/bar.spec.js", "file.ext".
+     */
+    private extractFileReferences;
+    /**
+     * Render ranked phases into a context string, respecting the character budget.
+     */
+    private renderContext;
+    /**
+     * Fallback: include all phase outputs within budget (mirrors existing behavior).
+     */
+    private buildAllContext;
+}
+//# sourceMappingURL=graph-context-router.d.ts.map

package/dist/runtime/graph-context-router.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-context-router.d.ts","sourceRoot":"","sources":["../../src/runtime/graph-context-router.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAE3F;;;;GAIG;AACH,MAAM,WAAW,oBAAoB;IACnC,KAAK,IAAI;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;IAClD,cAAc,CAAC,IAAI,EAAE,aAAa,GAAG,SAAS,EAAE,CAAC;IACjD,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,aAAa,GAAG,SAAS,EAAE,CAAC;IACpE,cAAc,CAAC,IAAI,EAAE,aAAa,GAAG,SAAS,EAAE,CAAC;CAClD;AAED,MAAM,WAAW,oBAAoB;IACnC,yEAAyE;IACzE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,+CAA+C;IAC/C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,mEAAmE;IACnE,QAAQ,CAAC,EAAE,OAAO,GAAG,KAAK,CAAC;CAC5B;AAED;;;;;;;;;;;;GAYG;AACH,qBAAa,kBAAkB;IACjB,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,oBAAoB,GAAG,IAAI;IAEtD;;OAEG;IACH,YAAY,CACV,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EACnC,OAAO,CAAC,EAAE,oBAAoB,GAC7B,MAAM;IAeT;;;;OAIG;IACH,0BAA0B,CACxB,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EACnC,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EACxC,OAAO,CAAC,EAAE,oBAAoB,GAC7B,MAAM;IAUT;;;;;;;OAOG;IACH,OAAO,CAAC,mBAAmB;IA4D3B;;;OAGG;IACH,OAAO,CAAC,qBAAqB;IAgB7B;;OAEG;IACH,OAAO,CAAC,aAAa;IAyBrB;;OAEG;IACH,OAAO,CAAC,eAAe;CAuBxB"}

package/dist/runtime/graph-context-router.js

@@ -0,0 +1,162 @@
+/**
+ * Graph-traversal-based context selection for agents.
+ *
+ * Instead of dumping all prior phase outputs into every agent's prompt,
+ * this router scores phases by relevance using the execution graph:
+ *   1. Extract file references from the agent's task description
+ *   2. Find which prior agents touched those same files (via graph edges)
+ *   3. Rank phase outputs by file overlap, then by dependency signals
+ *   4. Truncate to a token budget
+ *
+ * Falls back to including all outputs (existing behavior) when the graph
+ * is unavailable or empty.
+ */
+export class GraphContextRouter {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Build context for an agent based on graph topology.
+     */
+    buildContext(agentId, agentTask, phaseOutputs, options) {
+        const budget = options?.tokenBudget ?? 80000;
+        const maxSources = options?.maxSources ?? 5;
+        if (!this.graph || this.graph.stats().nodeCount === 0 || options?.strategy === 'all') {
+            return this.buildAllContext(phaseOutputs, budget);
+        }
+        const scores = this.scorePhaseRelevance(agentId, agentTask, phaseOutputs);
+        const ranked = [...scores.entries()].sort((a, b) => b[1] - a[1]).slice(0, maxSources);
+        return this.renderContext(ranked, phaseOutputs, budget);
+    }
+    /**
+     * Build context with intra-phase outputs merged in. Called mid-phase when
+     * agents within the same phase have produced partial outputs that should
+     * be visible to sibling agents for live re-routing.
+     */
+    buildContextWithIntraPhase(agentId, agentTask, phaseOutputs, intraPhaseOutputs, options) {
+        // Merge intraPhaseOutputs into a copy of phaseOutputs
+        const merged = new Map(phaseOutputs);
+        for (const [key, outputs] of intraPhaseOutputs) {
+            const existing = merged.get(key) ?? [];
+            merged.set(key, [...existing, ...outputs]);
+        }
+        return this.buildContext(agentId, agentTask, merged, options);
+    }
+    /**
+     * Score each phase's relevance to the current agent's task.
+     *
+     * Scoring weights:
+     *   - File overlap with task: +10 per shared file (strongest signal)
+     *   - Phase has downstream consumers: +2 (indicates reusable output)
+     *   - Base: +1 (preserves chronological fallback ordering)
+     */
+    scorePhaseRelevance(_agentId, agentTask, phaseOutputs) {
+        const scores = new Map();
+        const taskFiles = this.extractFileReferences(agentTask);
+        const consumedEdges = this.graph.getEdgesByType('consumed');
+        for (const [phaseName] of phaseOutputs) {
+            let totalScore = 1; // base score
+            // Find phase nodes matching this name
+            const phaseNodes = this.graph.getNodesByType('phase').filter((n) => n.label === phaseName || n.properties.name === phaseName);
+            for (const phaseNode of phaseNodes) {
+                // Accumulate per-node sub-score independently
+                let nodeScore = 0;
+                // Get agents spawned by this phase
+                const agents = this.graph.getNeighbors(phaseNode.id, 'spawned');
+                for (const agent of agents) {
+                    // Get files this agent touched
+                    const files = this.graph.getNeighbors(agent.id, 'touched_file');
+                    for (const file of files) {
+                        const filePath = file.label || file.properties.path || '';
+                        if (taskFiles.some((tf) => filePath.includes(tf) || tf.includes(filePath))) {
+                            nodeScore += 10; // strong signal: shared file
+                        }
+                    }
+                }
+                // Bonus if this phase's output was consumed by other agents
+                if (consumedEdges.some((e) => e.source === phaseNode.id)) {
+                    nodeScore += 2;
+                }
+                // Time-decay: exponential decay based on phase node age (λ=0.05, half-life ~14 days)
+                if (phaseNode.created_at) {
+                    const ageMs = Date.now() - new Date(phaseNode.created_at).getTime();
+                    const ageDays = ageMs / (1000 * 60 * 60 * 24);
+                    if (ageDays > 0) {
+                        const decayFactor = Math.exp(-0.05 * ageDays);
+                        nodeScore *= Math.max(decayFactor, 0.1); // floor at 10% to never fully zero out
+                    }
+                }
+                totalScore += nodeScore;
+            }
+            scores.set(phaseName, totalScore);
+        }
+        return scores;
+    }
+    /**
+     * Extract file-like references from a task description.
+     * Matches patterns like "src/runtime/foo.ts", "test/bar.spec.js", "file.ext".
+     */
+    extractFileReferences(text) {
+        const patterns = [
+            /[\w\-./]+\.\w{1,4}/g, // file.ext or path/to/file.ext
+            /src\/[\w\-./]+/g, // src/path/to/thing
+            /tests?\/[\w\-./]+/g, // test/path or tests/path
+        ];
+        const refs = new Set();
+        for (const pattern of patterns) {
+            const matches = text.match(pattern);
+            if (matches) {
+                for (const m of matches)
+                    refs.add(m);
+            }
+        }
+        return [...refs];
+    }
+    /**
+     * Render ranked phases into a context string, respecting the character budget.
+     */
+    renderContext(ranked, phaseOutputs, budget) {
+        const parts = [];
+        let totalChars = 0;
+        for (const [phaseName, score] of ranked) {
+            const outputs = phaseOutputs.get(phaseName);
+            if (!outputs || outputs.length === 0)
+                continue;
+            const section = `## Context from ${phaseName} (relevance: ${score.toFixed(0)}):\n${outputs.join('\n\n')}`;
+            if (totalChars + section.length > budget) {
+                const remaining = budget - totalChars;
+                if (remaining > 200) {
+                    parts.push(section.slice(0, remaining) + '\n[...truncated]');
+                }
+                break;
+            }
+            parts.push(section);
+            totalChars += section.length;
+        }
+        return parts.join('\n\n');
+    }
+    /**
+     * Fallback: include all phase outputs within budget (mirrors existing behavior).
+     */
+    buildAllContext(phaseOutputs, budget) {
+        const parts = [];
+        let totalChars = 0;
+        for (const [phaseName, outputs] of phaseOutputs) {
+            if (outputs.length === 0)
+                continue;
+            const section = `## Context from ${phaseName}:\n${outputs.join('\n\n')}`;
+            if (totalChars + section.length > budget) {
+                const remaining = budget - totalChars;
+                if (remaining > 200) {
+                    parts.push(section.slice(0, remaining) + '\n[...truncated]');
+                }
+                break;
+            }
+            parts.push(section);
+            totalChars += section.length;
+        }
+        return parts.join('\n\n');
+    }
+}
+//# sourceMappingURL=graph-context-router.js.map

package/dist/runtime/graph-context-router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-context-router.js","sourceRoot":"","sources":["../../src/runtime/graph-context-router.ts"],"names":[],"mappings":"AAuBA;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,kBAAkB;IACT;IAApB,YAAoB,KAAkC;QAAlC,UAAK,GAAL,KAAK,CAA6B;IAAG,CAAC;IAE1D;;OAEG;IACH,YAAY,CACV,OAAe,EACf,SAAiB,EACjB,YAAmC,EACnC,OAA8B;QAE9B,MAAM,MAAM,GAAG,OAAO,EAAE,WAAW,IAAI,KAAK,CAAC;QAC7C,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,CAAC,CAAC;QAE5C,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,OAAO,EAAE,QAAQ,KAAK,KAAK,EAAE,CAAC;YACrF,OAAO,IAAI,CAAC,eAAe,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;QACpD,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QAE1E,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAEtF,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;IAC1D,CAAC;IAED;;;;OAIG;IACH,0BAA0B,CACxB,OAAe,EACf,SAAiB,EACjB,YAAmC,EACnC,iBAAwC,EACxC,OAA8B;QAE9B,sDAAsD;QACtD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAmB,YAAY,CAAC,CAAC;QACvD,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,iBAAiB,EAAE,CAAC;YAC/C,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAChE,CAAC;IAED;;;;;;;OAOG;IACK,mBAAmB,CACzB,QAAgB,EAChB,SAAiB,EACjB,YAAmC;QAEnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;QACxD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAM,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QAE7D,KAAK,MAAM,CAAC,SAAS,CAAC,IAAI,YAAY,EAAE,CAAC;YACvC,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,aAAa;YAEjC,sCAAsC;YACtC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAM,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,MAAM,CAC3D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,KAAK,SAAS,CAChE,CAAC;YAEF,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACnC,8CAA8C;gBAC9C,IAAI,SAAS,GAAG,CAAC,CAAC;gBAElB,mCAAmC;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAM,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;gBAEjE,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,+BAA+B;oBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAM,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC;oBAEjE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;wBACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,IAAK,IAAI,CAAC,UAAU,CAAC,IAAe,IAAI,EAAE,CAAC;wBACtE,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;4BAC3E,SAAS,IAAI,EAAE,CAAC,CAAC,6BAA6B;wBAChD,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,4DAA4D;gBAC5D,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;oBACzD,SAAS,IAAI,CAAC,CAAC;gBACjB,CAAC;gBAED,qFAAqF;gBACrF,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;oBACzB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC;oBACpE,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;oBAC9C,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;wBAChB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC;wBAC9C,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,uCAAuC;oBAClF,CAAC;gBACH,CAAC;gBAED,UAAU,IAAI,SAAS,CAAC;YAC1B,CAAC;YAED,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QACpC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,qBAAqB,CAAC,IAAY;QACxC,MAAM,QAAQ,GAAG;YACf,qBAAqB,EAAE,+BAA+B;YACtD,iBAAiB,EAAE,oBAAoB;YACvC,oBAAoB,EAAE,0BAA0B;SACjD,CAAC;QACF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACpC,IAAI,OAAO,EAAE,CAAC;gBACZ,KAAK,MAAM,CAAC,IAAI,OAAO;oBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,MAA0B,EAAE,YAAmC,EAAE,MAAc;QACnG,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YACxC,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC5C,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAE/C,MAAM,OAAO,GAAG,mBAAmB,SAAS,gBAAgB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAE1G,IAAI,UAAU,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;gBACzC,MAAM,SAAS,GAAG,MAAM,GAAG,UAAU,CAAC;gBACtC,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,kBAAkB,CAAC,CAAC;gBAC/D,CAAC;gBACD,MAAM;YACR,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpB,UAAU,IAAI,OAAO,CAAC,MAAM,CAAC;QAC/B,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,YAAmC,EAAE,MAAc;QACzE,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,YAAY,EAAE,CAAC;YAChD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEnC,MAAM,OAAO,GAAG,mBAAmB,SAAS,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAEzE,IAAI,UAAU,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;gBACzC,MAAM,SAAS,GAAG,MAAM,GAAG,UAAU,CAAC;gBACtC,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,kBAAkB,CAAC,CAAC;gBAC/D,CAAC;gBACD,MAAM;YACR,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpB,UAAU,IAAI,OAAO,CAAC,MAAM,CAAC;QAC/B,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;CACF"}

package/dist/runtime/graph-discovery.d.ts

@@ -0,0 +1,71 @@
+import type { ExecutionGraph } from './execution-graph.js';
+export interface DiscoveredTask {
+    title: string;
+    description: string;
+    priority: 'high' | 'medium' | 'low';
+    recommendedPattern: string;
+    estimatedCost: number;
+    evidence: string[];
+    affectedFiles: string[];
+}
+export interface FileRisk {
+    file: string;
+    failureRate: number;
+    errorCount: number;
+    coModifiedWith: string[];
+    lastTouched: string;
+    vulnerabilities: number;
+    totalTouches: number;
+}
+/**
+ * Mines the execution knowledge graph for actionable insights that
+ * suggest new work — high-failure-rate files, recurring errors,
+ * unresolved vulnerabilities, untested co-modification pairs, and
+ * architectural risk from high-centrality low-success files.
+ */
+export declare class TaskDiscovery {
+    private graph;
+    constructor(graph: ExecutionGraph);
+    /**
+     * Mine the graph for all discoverable tasks.
+     * Returns tasks sorted by priority (high first).
+     */
+    discoverTasks(): DiscoveredTask[];
+    /**
+     * Get detailed risk profile for a specific file.
+     */
+    getFileRiskProfile(filePath: string): FileRisk;
+    /**
+     * Generate prioritized backlog from discovered tasks.
+     */
+    generateBacklog(maxItems?: number): DiscoveredTask[];
+    /**
+     * Files where >40% of agents that touched them failed → refactor task.
+     */
+    private findHighFailureRateFiles;
+    /**
+     * Files with 3+ error nodes → recurring error task.
+     */
+    private findRecurringErrors;
+    /**
+     * Error nodes with P0/P1 severity grouped by file.
+     * Clusters of 2+ high-severity errors → urgent task.
+     */
+    private findVulnerabilityClusters;
+    /**
+     * Co-modified file pairs that never appeared together in a test orchestration.
+     * High co-mod count but no joint testing → integration test task.
+     */
+    private findUntestedCoModPairs;
+    /**
+     * Files touched by many agents (high degree) but with low success rate.
+     * These represent architectural risk — central files that cause failures.
+     */
+    private findArchitecturalRisks;
+    /**
+     * Estimate cost for a task based on historical orchestrations with the same pattern.
+     * Falls back to a heuristic if no historical data.
+     */
+    private estimateCost;
+}
+//# sourceMappingURL=graph-discovery.d.ts.map

package/dist/runtime/graph-discovery.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-discovery.d.ts","sourceRoot":"","sources":["../../src/runtime/graph-discovery.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAK3D,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;IACpC,kBAAkB,EAAE,MAAM,CAAC;IAC3B,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;CACtB;AAYD;;;;;GAKG;AACH,qBAAa,aAAa;IACZ,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,cAAc;IAEzC;;;OAGG;IACH,aAAa,IAAI,cAAc,EAAE;IAYjC;;OAEG;IACH,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,QAAQ;IAmE9C;;OAEG;IACH,eAAe,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,cAAc,EAAE;IAMpD;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAoChC;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAqC3B;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IAwCjC;;;OAGG;IACH,OAAO,CAAC,sBAAsB;IAwF9B;;;OAGG;IACH,OAAO,CAAC,sBAAsB;IAuC9B;;;OAGG;IACH,OAAO,CAAC,YAAY;CAkCrB"}