swarm-engine 1.3.0 → 1.38.0

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

@@ -0,0 +1,86 @@
+import { EventBus } from '../core/event-bus.js';
+import type { GraphNode, GraphEdge, GraphNodeType, GraphEdgeType, ConfidenceTier } from '../core/types.js';
+/**
+ * Persistent execution knowledge graph backed by SQLite. Records orchestration
+ * topology (phases, agents, files, patterns) as nodes and edges, enabling
+ * cross-run learning, graph-routed context assembly, and failure prediction.
+ */
+export declare class ExecutionGraph {
+    private db;
+    private ownDb;
+    private bus;
+    private listeners;
+    private currentPhaseMap;
+    constructor(dbPath?: string);
+    private initSchema;
+    addNode(node: {
+        id: string;
+        type: GraphNodeType;
+        label: string;
+        properties?: Record<string, unknown>;
+    }): void;
+    addEdge(edge: {
+        source: string;
+        target: string;
+        type: GraphEdgeType;
+        weight?: number;
+        confidence?: ConfidenceTier;
+        properties?: Record<string, unknown>;
+    }): void;
+    getNode(id: string): GraphNode | null;
+    getEdges(nodeId: string, direction?: 'outgoing' | 'incoming' | 'both'): GraphEdge[];
+    getNeighbors(nodeId: string, edgeType?: GraphEdgeType): GraphNode[];
+    bfs(startId: string, maxDepth?: number): {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    };
+    dfs(startId: string, maxDepth?: number): {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    };
+    shortestPath(fromId: string, toId: string, maxHops?: number): {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    } | null;
+    /**
+     * INSERT OR UPDATE an edge. If an edge with the same source+target+type
+     * already exists, increment its weight and merge properties. Otherwise INSERT.
+     */
+    upsertEdge(edge: {
+        source: string;
+        target: string;
+        type: GraphEdgeType;
+        weight?: number;
+        confidence?: ConfidenceTier;
+        properties?: Record<string, unknown>;
+    }): void;
+    /**
+     * Adjust weight on existing edges matching source+target+type by delta.
+     * Returns the number of rows updated.
+     */
+    updateEdgeWeight(source: string, target: string, type: GraphEdgeType, delta: number): number;
+    /**
+     * Delete edges older than N days, then delete orphan nodes
+     * (nodes with no remaining edges).
+     */
+    pruneOlderThan(days: number): {
+        nodesDeleted: number;
+        edgesDeleted: number;
+    };
+    /**
+     * Return the age of a node in days, or null if the node doesn't exist.
+     */
+    getNodeAge(nodeId: string): number | null;
+    getNodesByType(type: GraphNodeType): GraphNode[];
+    getEdgesByType(type: GraphEdgeType): GraphEdge[];
+    stats(): {
+        nodeCount: number;
+        edgeCount: number;
+        nodesByType: Record<string, number>;
+        edgesByType: Record<string, number>;
+    };
+    attachToEventBus(bus: EventBus): void;
+    detachFromEventBus(bus: EventBus): void;
+    close(): void;
+}
+//# sourceMappingURL=execution-graph.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"execution-graph.d.ts","sourceRoot":"","sources":["../../src/runtime/execution-graph.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAChD,OAAO,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,EAAc,MAAM,kBAAkB,CAAC;AAEvH;;;;GAIG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,EAAE,CAAoB;IAC9B,OAAO,CAAC,KAAK,CAAU;IACvB,OAAO,CAAC,GAAG,CAAyB;IACpC,OAAO,CAAC,SAAS,CAAmD;IACpE,OAAO,CAAC,eAAe,CAA6B;gBAExC,MAAM,CAAC,EAAE,MAAM;IAe3B,OAAO,CAAC,UAAU;IA4BlB,OAAO,CAAC,IAAI,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,aAAa,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;KAAE,GAAG,IAAI;IAS7G,OAAO,CAAC,IAAI,EAAE;QACZ,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,EAAE,aAAa,CAAC;QACpB,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,UAAU,CAAC,EAAE,cAAc,CAAC;QAC5B,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACtC,GAAG,IAAI;IAgBR,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI;IAQrC,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,GAAE,UAAU,GAAG,UAAU,GAAG,MAAe,GAAG,SAAS,EAAE;IAuB3F,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,aAAa,GAAG,SAAS,EAAE;IAyBnE,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,SAAI,GAAG;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE;IA8B9E,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,SAAI,GAAG;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE;IA8B9E,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,SAAI,GAAG;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,GAAG,IAAI;IA0C1G;;;OAGG;IACH,UAAU,CAAC,IAAI,EAAE;QACf,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,EAAE,aAAa,CAAC;QACpB,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,UAAU,CAAC,EAAE,cAAc,CAAC;QAC5B,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACtC,GAAG,IAAI;IAsBR;;;OAGG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IAO5F;;;OAGG;IACH,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG;QAAE,YAAY,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAA;KAAE;IAkB5E;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IASzC,cAAc,CAAC,IAAI,EAAE,aAAa,GAAG,SAAS,EAAE;IAWhD,cAAc,CAAC,IAAI,EAAE,aAAa,GAAG,SAAS,EAAE;IAehD,KAAK,IAAI;QACP,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACpC,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KACrC;IAuBD,gBAAgB,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI;IAsLrC,kBAAkB,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI;IASvC,KAAK,IAAI,IAAI;CAId"}

package/dist/runtime/execution-graph.js

@@ -0,0 +1,441 @@
+import Database from 'better-sqlite3';
+import { existsSync, mkdirSync } from 'fs';
+import { dirname } from 'path';
+import { getDatabase } from './database.js';
+/**
+ * Persistent execution knowledge graph backed by SQLite. Records orchestration
+ * topology (phases, agents, files, patterns) as nodes and edges, enabling
+ * cross-run learning, graph-routed context assembly, and failure prediction.
+ */
+export class ExecutionGraph {
+    db;
+    ownDb;
+    bus = null;
+    listeners = [];
+    currentPhaseMap = new Map(); // orchestrationId → current phase nodeId
+    constructor(dbPath) {
+        if (dbPath) {
+            const dir = dirname(dbPath);
+            if (!existsSync(dir))
+                mkdirSync(dir, { recursive: true, mode: 0o700 });
+            this.db = new Database(dbPath);
+            this.db.pragma('journal_mode = WAL');
+            this.db.pragma('busy_timeout = 5000');
+            this.ownDb = true;
+        }
+        else {
+            this.db = getDatabase();
+            this.ownDb = false;
+        }
+        this.initSchema();
+    }
+    initSchema() {
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS graph_nodes (
+        id TEXT PRIMARY KEY,
+        type TEXT NOT NULL,
+        label TEXT NOT NULL,
+        properties TEXT DEFAULT '{}',
+        created_at TEXT NOT NULL DEFAULT (datetime('now'))
+      );
+      CREATE TABLE IF NOT EXISTS graph_edges (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        source TEXT NOT NULL,
+        target TEXT NOT NULL,
+        type TEXT NOT NULL,
+        weight REAL DEFAULT 1.0,
+        confidence TEXT DEFAULT 'EXTRACTED',
+        properties TEXT DEFAULT '{}',
+        created_at TEXT NOT NULL DEFAULT (datetime('now'))
+      );
+      CREATE INDEX IF NOT EXISTS idx_graph_edges_source ON graph_edges(source, type);
+      CREATE INDEX IF NOT EXISTS idx_graph_edges_target ON graph_edges(target, type);
+      CREATE INDEX IF NOT EXISTS idx_graph_nodes_type ON graph_nodes(type);
+      CREATE INDEX IF NOT EXISTS idx_graph_edges_confidence ON graph_edges(confidence);
+    `);
+    }
+    // ─── CRUD ───────────────────────────────────────────────────────
+    addNode(node) {
+        this.db
+            .prepare(`INSERT OR REPLACE INTO graph_nodes (id, type, label, properties)
+         VALUES (?, ?, ?, ?)`)
+            .run(node.id, node.type, node.label, JSON.stringify(node.properties ?? {}));
+    }
+    addEdge(edge) {
+        this.db
+            .prepare(`INSERT INTO graph_edges (source, target, type, weight, confidence, properties)
+         VALUES (?, ?, ?, ?, ?, ?)`)
+            .run(edge.source, edge.target, edge.type, edge.weight ?? 1.0, edge.confidence ?? 'EXTRACTED', JSON.stringify(edge.properties ?? {}));
+    }
+    getNode(id) {
+        const row = this.db.prepare('SELECT * FROM graph_nodes WHERE id = ?').get(id);
+        if (!row)
+            return null;
+        return { ...row, properties: JSON.parse(row.properties) };
+    }
+    getEdges(nodeId, direction = 'both') {
+        let sql;
+        if (direction === 'outgoing') {
+            sql = 'SELECT * FROM graph_edges WHERE source = ?';
+        }
+        else if (direction === 'incoming') {
+            sql = 'SELECT * FROM graph_edges WHERE target = ?';
+        }
+        else {
+            sql = 'SELECT * FROM graph_edges WHERE source = ? OR target = ?';
+        }
+        const rows = (direction === 'both' ? this.db.prepare(sql).all(nodeId, nodeId) : this.db.prepare(sql).all(nodeId));
+        return rows.map((r) => ({ ...r, properties: JSON.parse(r.properties) }));
+    }
+    getNeighbors(nodeId, edgeType) {
+        let sql;
+        let params;
+        if (edgeType) {
+            sql = `SELECT DISTINCT n.* FROM graph_nodes n
+             JOIN graph_edges e ON (e.target = n.id AND e.source = ?) OR (e.source = n.id AND e.target = ?)
+             WHERE e.type = ?`;
+            params = [nodeId, nodeId, edgeType];
+        }
+        else {
+            sql = `SELECT DISTINCT n.* FROM graph_nodes n
+             JOIN graph_edges e ON (e.target = n.id AND e.source = ?) OR (e.source = n.id AND e.target = ?)`;
+            params = [nodeId, nodeId];
+        }
+        const rows = this.db.prepare(sql).all(...params);
+        return rows.map((r) => ({ ...r, properties: JSON.parse(r.properties) }));
+    }
+    // ─── Traversal ──────────────────────────────────────────────────
+    bfs(startId, maxDepth = 3) {
+        const visited = new Set();
+        const resultNodes = [];
+        const resultEdges = [];
+        const queue = [{ id: startId, depth: 0 }];
+        while (queue.length > 0) {
+            const { id, depth } = queue.shift();
+            if (visited.has(id))
+                continue;
+            visited.add(id);
+            const node = this.getNode(id);
+            if (node)
+                resultNodes.push(node);
+            if (depth >= maxDepth)
+                continue;
+            const edges = this.getEdges(id);
+            for (const edge of edges) {
+                resultEdges.push(edge);
+                const neighborId = edge.source === id ? edge.target : edge.source;
+                if (!visited.has(neighborId)) {
+                    queue.push({ id: neighborId, depth: depth + 1 });
+                }
+            }
+        }
+        // Deduplicate edges by source-type-target key
+        const uniqueEdges = [...new Map(resultEdges.map((e) => [`${e.source}-${e.type}-${e.target}`, e])).values()];
+        return { nodes: resultNodes, edges: uniqueEdges };
+    }
+    dfs(startId, maxDepth = 6) {
+        const visited = new Set();
+        const resultNodes = [];
+        const resultEdges = [];
+        const stack = [{ id: startId, depth: 0 }];
+        while (stack.length > 0) {
+            const { id, depth } = stack.pop();
+            if (visited.has(id))
+                continue;
+            visited.add(id);
+            const node = this.getNode(id);
+            if (node)
+                resultNodes.push(node);
+            if (depth >= maxDepth)
+                continue;
+            const edges = this.getEdges(id);
+            for (const edge of edges) {
+                resultEdges.push(edge);
+                const neighborId = edge.source === id ? edge.target : edge.source;
+                if (!visited.has(neighborId)) {
+                    stack.push({ id: neighborId, depth: depth + 1 });
+                }
+            }
+        }
+        // Deduplicate edges by source-type-target key
+        const uniqueEdges = [...new Map(resultEdges.map((e) => [`${e.source}-${e.type}-${e.target}`, e])).values()];
+        return { nodes: resultNodes, edges: uniqueEdges };
+    }
+    shortestPath(fromId, toId, maxHops = 8) {
+        const visited = new Set();
+        const parent = new Map();
+        const queue = [{ id: fromId, depth: 0 }];
+        visited.add(fromId);
+        while (queue.length > 0) {
+            const { id, depth } = queue.shift();
+            if (id === toId) {
+                // Reconstruct path
+                const pathNodes = [];
+                const pathEdges = [];
+                let current = toId;
+                while (current !== fromId) {
+                    const node = this.getNode(current);
+                    if (node)
+                        pathNodes.unshift(node);
+                    const p = parent.get(current);
+                    pathEdges.unshift(p.edge);
+                    current = p.nodeId;
+                }
+                const startNode = this.getNode(fromId);
+                if (startNode)
+                    pathNodes.unshift(startNode);
+                return { nodes: pathNodes, edges: pathEdges };
+            }
+            if (depth >= maxHops)
+                continue;
+            const edges = this.getEdges(id);
+            for (const edge of edges) {
+                const neighborId = edge.source === id ? edge.target : edge.source;
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    parent.set(neighborId, { nodeId: id, edge });
+                    queue.push({ id: neighborId, depth: depth + 1 });
+                }
+            }
+        }
+        return null;
+    }
+    // ─── Upsert / Update / Prune ─────────────────────────────────────
+    /**
+     * INSERT OR UPDATE an edge. If an edge with the same source+target+type
+     * already exists, increment its weight and merge properties. Otherwise INSERT.
+     */
+    upsertEdge(edge) {
+        const existing = this.db
+            .prepare('SELECT id, weight, properties FROM graph_edges WHERE source = ? AND target = ? AND type = ?')
+            .get(edge.source, edge.target, edge.type);
+        if (existing) {
+            const mergedProps = { ...JSON.parse(existing.properties), ...(edge.properties ?? {}) };
+            this.db
+                .prepare('UPDATE graph_edges SET weight = ?, properties = ?, confidence = COALESCE(?, confidence) WHERE id = ?')
+                .run(existing.weight + (edge.weight ?? 1.0), JSON.stringify(mergedProps), edge.confidence ?? null, existing.id);
+        }
+        else {
+            this.addEdge(edge);
+        }
+    }
+    /**
+     * Adjust weight on existing edges matching source+target+type by delta.
+     * Returns the number of rows updated.
+     */
+    updateEdgeWeight(source, target, type, delta) {
+        const result = this.db
+            .prepare('UPDATE graph_edges SET weight = MAX(weight + ?, 0) WHERE source = ? AND target = ? AND type = ?')
+            .run(delta, source, target, type);
+        return result.changes;
+    }
+    /**
+     * Delete edges older than N days, then delete orphan nodes
+     * (nodes with no remaining edges).
+     */
+    pruneOlderThan(days) {
+        const edgeResult = this.db
+            .prepare("DELETE FROM graph_edges WHERE (julianday('now') - julianday(created_at)) > ?")
+            .run(days);
+        const edgesDeleted = edgeResult.changes;
+        const nodeResult = this.db
+            .prepare(`DELETE FROM graph_nodes WHERE id NOT IN (
+          SELECT source FROM graph_edges UNION SELECT target FROM graph_edges
+        )`)
+            .run();
+        const nodesDeleted = nodeResult.changes;
+        return { nodesDeleted, edgesDeleted };
+    }
+    /**
+     * Return the age of a node in days, or null if the node doesn't exist.
+     */
+    getNodeAge(nodeId) {
+        const row = this.db
+            .prepare("SELECT (julianday('now') - julianday(created_at)) as age FROM graph_nodes WHERE id = ?")
+            .get(nodeId);
+        return row?.age ?? null;
+    }
+    // ─── Query ──────────────────────────────────────────────────────
+    getNodesByType(type) {
+        const rows = this.db.prepare('SELECT * FROM graph_nodes WHERE type = ?').all(type);
+        return rows.map((r) => ({ ...r, properties: JSON.parse(r.properties) }));
+    }
+    getEdgesByType(type) {
+        const rows = this.db.prepare('SELECT * FROM graph_edges WHERE type = ?').all(type);
+        return rows.map((r) => ({ ...r, properties: JSON.parse(r.properties) }));
+    }
+    // ─── Stats ──────────────────────────────────────────────────────
+    stats() {
+        const nodeCount = this.db.prepare('SELECT COUNT(*) as count FROM graph_nodes').get().count;
+        const edgeCount = this.db.prepare('SELECT COUNT(*) as count FROM graph_edges').get().count;
+        const nodesByType = {};
+        const nodeRows = this.db.prepare('SELECT type, COUNT(*) as count FROM graph_nodes GROUP BY type').all();
+        for (const row of nodeRows)
+            nodesByType[row.type] = row.count;
+        const edgesByType = {};
+        const edgeRows = this.db.prepare('SELECT type, COUNT(*) as count FROM graph_edges GROUP BY type').all();
+        for (const row of edgeRows)
+            edgesByType[row.type] = row.count;
+        return { nodeCount, edgeCount, nodesByType, edgesByType };
+    }
+    // ─── EventBus Integration ───────────────────────────────────────
+    attachToEventBus(bus) {
+        this.bus = bus;
+        const onOrchStart = (event) => {
+            const d = event.data;
+            this.addNode({
+                id: d.id,
+                type: 'orchestration',
+                label: d.name,
+                properties: { pattern: d.pattern, phaseCount: d.phaseCount },
+            });
+            // Add pattern node (idempotent via INSERT OR REPLACE)
+            const patternId = `pattern:${d.pattern}`;
+            this.addNode({
+                id: patternId,
+                type: 'pattern',
+                label: d.pattern,
+                properties: {},
+            });
+            this.addEdge({
+                source: d.id,
+                target: patternId,
+                type: 'used_pattern',
+                confidence: 'EXTRACTED',
+            });
+        };
+        bus.on('orchestration:start', onOrchStart);
+        this.listeners.push({ event: 'orchestration:start', handler: onOrchStart });
+        const onPhaseStart = (event) => {
+            const d = event.data;
+            const phaseId = `${d.orchestrationId}:phase:${d.phase}`;
+            this.addNode({
+                id: phaseId,
+                type: 'phase',
+                label: d.phase,
+                properties: { agentCount: d.agentCount, parallel: d.parallel },
+            });
+            this.addEdge({
+                source: d.orchestrationId,
+                target: phaseId,
+                type: 'contains',
+                confidence: 'EXTRACTED',
+            });
+            this.currentPhaseMap.set(d.orchestrationId, phaseId);
+        };
+        bus.on('orchestration:phase-start', onPhaseStart);
+        this.listeners.push({ event: 'orchestration:phase-start', handler: onPhaseStart });
+        const onAgentSpawning = (event) => {
+            const d = event.data;
+            this.addNode({
+                id: d.agentId,
+                type: 'agent',
+                label: d.agentType,
+                properties: { model: d.model },
+            });
+            // NOTE: agent:spawning doesn't carry orchestrationId so we can't do a precise
+            // lookup. This assumes single-orchestration-at-a-time; for concurrent orchestrations
+            // the event schema would need to be extended. Use the most recently added phase
+            // (last entry in Map) as the best approximation.
+            let currentPhaseId;
+            for (const [, phaseId] of this.currentPhaseMap) {
+                currentPhaseId = phaseId; // keep overwriting — last one wins
+            }
+            if (currentPhaseId) {
+                this.addEdge({
+                    source: currentPhaseId,
+                    target: d.agentId,
+                    type: 'spawned',
+                    confidence: 'EXTRACTED',
+                });
+            }
+        };
+        bus.on('agent:spawning', onAgentSpawning);
+        this.listeners.push({ event: 'agent:spawning', handler: onAgentSpawning });
+        const onAgentIdle = (event) => {
+            const d = event.data;
+            // Update agent node with result
+            this.addNode({
+                id: d.agentId,
+                type: 'agent',
+                label: d.agentType,
+                properties: {
+                    model: d.model,
+                    backend: d.backend,
+                    usage: d.usage,
+                    status: 'idle',
+                },
+            });
+            // Add file nodes + edges if filesTouched exists
+            if (d.result?.filesTouched) {
+                for (const file of d.result.filesTouched) {
+                    const fileId = `file:${file}`;
+                    this.addNode({
+                        id: fileId,
+                        type: 'file',
+                        label: file,
+                        properties: {},
+                    });
+                    this.addEdge({
+                        source: d.agentId,
+                        target: fileId,
+                        type: 'touched_file',
+                        confidence: 'EXTRACTED',
+                    });
+                }
+            }
+        };
+        bus.on('agent:idle', onAgentIdle);
+        this.listeners.push({ event: 'agent:idle', handler: onAgentIdle });
+        const onPhaseComplete = (event) => {
+            const d = event.data;
+            const phaseId = `${d.orchestrationId}:phase:${d.phase}`;
+            this.addNode({
+                id: phaseId,
+                type: 'phase',
+                label: d.phase,
+                properties: { status: d.status, usage: d.usage },
+            });
+        };
+        bus.on('orchestration:phase-complete', onPhaseComplete);
+        this.listeners.push({ event: 'orchestration:phase-complete', handler: onPhaseComplete });
+        const onOrchComplete = (event) => {
+            const d = event.data;
+            this.addNode({
+                id: d.id,
+                type: 'orchestration',
+                label: d.name,
+                properties: { status: d.status, usage: d.usage, durationMs: d.durationMs },
+            });
+            this.currentPhaseMap.delete(d.id);
+        };
+        bus.on('orchestration:complete', onOrchComplete);
+        this.listeners.push({ event: 'orchestration:complete', handler: onOrchComplete });
+        const onOrchFailed = (event) => {
+            const d = event.data;
+            this.addNode({
+                id: d.id,
+                type: 'orchestration',
+                label: d.name,
+                properties: { status: d.status, usage: d.usage, durationMs: d.durationMs },
+            });
+            this.currentPhaseMap.delete(d.id);
+        };
+        bus.on('orchestration:failed', onOrchFailed);
+        this.listeners.push({ event: 'orchestration:failed', handler: onOrchFailed });
+    }
+    detachFromEventBus(bus) {
+        for (const { event, handler } of this.listeners) {
+            bus.off(event, handler);
+        }
+        this.listeners = [];
+    }
+    // ─── Lifecycle ──────────────────────────────────────────────────
+    close() {
+        if (this.bus)
+            this.detachFromEventBus(this.bus);
+        if (this.ownDb)
+            this.db.close();
+    }
+}
+//# sourceMappingURL=execution-graph.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"execution-graph.js","sourceRoot":"","sources":["../../src/runtime/execution-graph.ts"],"names":[],"mappings":"AAAA,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAC/B,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAI5C;;;;GAIG;AACH,MAAM,OAAO,cAAc;IACjB,EAAE,CAAoB;IACtB,KAAK,CAAU;IACf,GAAG,GAAoB,IAAI,CAAC;IAC5B,SAAS,GAAgD,EAAE,CAAC;IAC5D,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,yCAAyC;IAE9F,YAAY,MAAe;QACzB,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;YAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YACvE,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC/B,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;YACrC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,EAAE,GAAG,WAAW,EAAE,CAAC;YACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;QACD,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAEO,UAAU;QAChB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;;KAsBZ,CAAC,CAAC;IACL,CAAC;IAED,mEAAmE;IAEnE,OAAO,CAAC,IAA8F;QACpG,IAAI,CAAC,EAAE;aACJ,OAAO,CACN;6BACqB,CACtB;aACA,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,CAAC;IAChF,CAAC;IAED,OAAO,CAAC,IAOP;QACC,IAAI,CAAC,EAAE;aACJ,OAAO,CACN;mCAC2B,CAC5B;aACA,GAAG,CACF,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,MAAM,IAAI,GAAG,EAClB,IAAI,CAAC,UAAU,IAAI,WAAW,EAC9B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CACtC,CAAC;IACN,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,CAAC,EAAE,CAE/D,CAAC;QACd,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QACtB,OAAO,EAAE,GAAG,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;IAC5D,CAAC;IAED,QAAQ,CAAC,MAAc,EAAE,YAA8C,MAAM;QAC3E,IAAI,GAAW,CAAC;QAChB,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;YAC7B,GAAG,GAAG,4CAA4C,CAAC;QACrD,CAAC;aAAM,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;YACpC,GAAG,GAAG,4CAA4C,CAAC;QACrD,CAAC;aAAM,CAAC;YACN,GAAG,GAAG,0DAA0D,CAAC;QACnE,CAAC;QACD,MAAM,IAAI,GAAG,CACX,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CASlG,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,YAAY,CAAC,MAAc,EAAE,QAAwB;QACnD,IAAI,GAAW,CAAC;QAChB,IAAI,MAAiB,CAAC;QACtB,IAAI,QAAQ,EAAE,CAAC;YACb,GAAG,GAAG;;8BAEkB,CAAC;YACzB,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,GAAG,GAAG;4GACgG,CAAC;YACvG,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAM7C,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,mEAAmE;IAEnE,GAAG,CAAC,OAAe,EAAE,QAAQ,GAAG,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAEhF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YACrC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC9B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEhB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC9B,IAAI,IAAI;gBAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,KAAK,IAAI,QAAQ;gBAAE,SAAS;YAEhC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAC5G,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;IACpD,CAAC;IAED,GAAG,CAAC,OAAe,EAAE,QAAQ,GAAG,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAEhF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACnC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC9B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEhB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC9B,IAAI,IAAI;gBAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,KAAK,IAAI,QAAQ;gBAAE,SAAS;YAEhC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAC5G,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;IACpD,CAAC;IAED,YAAY,CAAC,MAAc,EAAE,IAAY,EAAE,OAAO,GAAG,CAAC;QACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAA+C,CAAC;QACtE,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YACrC,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAChB,mBAAmB;gBACnB,MAAM,SAAS,GAAgB,EAAE,CAAC;gBAClC,MAAM,SAAS,GAAgB,EAAE,CAAC;gBAClC,IAAI,OAAO,GAAG,IAAI,CAAC;gBACnB,OAAO,OAAO,KAAK,MAAM,EAAE,CAAC;oBAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBACnC,IAAI,IAAI;wBAAE,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAClC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;oBAC/B,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAC1B,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC;gBACrB,CAAC;gBACD,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACvC,IAAI,SAAS;oBAAE,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC5C,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;YAChD,CAAC;YACD,IAAI,KAAK,IAAI,OAAO;gBAAE,SAAS;YAE/B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;oBAC7C,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oEAAoE;IAEpE;;;OAGG;IACH,UAAU,CAAC,IAOV;QACC,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE;aACrB,OAAO,CAAC,6FAA6F,CAAC;aACtG,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAE7B,CAAC;QAEd,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,WAAW,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,EAAE,CAAC;YACvF,IAAI,CAAC,EAAE;iBACJ,OAAO,CAAC,sGAAsG,CAAC;iBAC/G,GAAG,CACF,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,EACtC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAC3B,IAAI,CAAC,UAAU,IAAI,IAAI,EACvB,QAAQ,CAAC,EAAE,CACZ,CAAC;QACN,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,MAAc,EAAE,MAAc,EAAE,IAAmB,EAAE,KAAa;QACjF,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE;aACnB,OAAO,CAAC,iGAAiG,CAAC;aAC1G,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACpC,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,IAAY;QACzB,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE;aACvB,OAAO,CAAC,8EAA8E,CAAC;aACvF,GAAG,CAAC,IAAI,CAAC,CAAC;QACb,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,CAAC;QAExC,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE;aACvB,OAAO,CACN;;UAEE,CACH;aACA,GAAG,EAAE,CAAC;QACT,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,CAAC;QAExC,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,MAAc;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;aAChB,OAAO,CAAC,wFAAwF,CAAC;aACjG,GAAG,CAAC,MAAM,CAAgC,CAAC;QAC9C,OAAO,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC;IAC1B,CAAC;IAED,mEAAmE;IAEnE,cAAc,CAAC,IAAmB;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC,GAAG,CAAC,IAAI,CAM/E,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,cAAc,CAAC,IAAmB;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC,GAAG,CAAC,IAAI,CAQ/E,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,mEAAmE;IAEnE,KAAK;QAMH,MAAM,SAAS,GAAI,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC,GAAG,EAAwB,CAAC,KAAK,CAAC;QAClH,MAAM,SAAS,GAAI,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC,GAAG,EAAwB,CAAC,KAAK,CAAC;QAElH,MAAM,WAAW,GAA2B,EAAE,CAAC;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,+DAA+D,CAAC,CAAC,GAAG,EAGnG,CAAC;QACH,KAAK,MAAM,GAAG,IAAI,QAAQ;YAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;QAE9D,MAAM,WAAW,GAA2B,EAAE,CAAC;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,+DAA+D,CAAC,CAAC,GAAG,EAGnG,CAAC;QACH,KAAK,MAAM,GAAG,IAAI,QAAQ;YAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;QAE9D,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,WAAW,EAAE,CAAC;IAC5D,CAAC;IAED,mEAAmE;IAEnE,gBAAgB,CAAC,GAAa;QAC5B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QAEf,MAAM,WAAW,GAAG,CAAC,KAAiB,EAAE,EAAE;YACxC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAyE,CAAC;YAC1F,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,eAAe;gBACrB,KAAK,EAAE,CAAC,CAAC,IAAI;gBACb,UAAU,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE;aAC7D,CAAC,CAAC;YACH,sDAAsD;YACtD,MAAM,SAAS,GAAG,WAAW,CAAC,CAAC,OAAO,EAAE,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,SAAS;gBACb,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,CAAC,CAAC,OAAO;gBAChB,UAAU,EAAE,EAAE;aACf,CAAC,CAAC;YACH,IAAI,CAAC,OAAO,CAAC;gBACX,MAAM,EAAE,CAAC,CAAC,EAAE;gBACZ,MAAM,EAAE,SAAS;gBACjB,IAAI,EAAE,cAAc;gBACpB,UAAU,EAAE,WAAW;aACxB,CAAC,CAAC;QACL,CAAC,CAAC;QACF,GAAG,CAAC,EAAE,CAAC,qBAAqB,EAAE,WAAW,CAAC,CAAC;QAC3C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,qBAAqB,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;QAE5E,MAAM,YAAY,GAAG,CAAC,KAAiB,EAAE,EAAE;YACzC,MAAM,CAAC,GAAG,KAAK,CAAC,IAKf,CAAC;YACF,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,eAAe,UAAU,CAAC,CAAC,KAAK,EAAE,CAAC;YACxD,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,OAAO;gBACX,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,UAAU,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE;aAC/D,CAAC,CAAC;YACH,IAAI,CAAC,OAAO,CAAC;gBACX,MAAM,EAAE,CAAC,CAAC,eAAe;gBACzB,MAAM,EAAE,OAAO;gBACf,IAAI,EAAE,UAAU;gBAChB,UAAU,EAAE,WAAW;aACxB,CAAC,CAAC;YACH,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC;QACF,GAAG,CAAC,EAAE,CAAC,2BAA2B,EAAE,YAAY,CAAC,CAAC;QAClD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,2BAA2B,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,CAAC;QAEnF,MAAM,eAAe,GAAG,CAAC,KAAiB,EAAE,EAAE;YAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,IAA6D,CAAC;YAC9E,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,CAAC,CAAC,OAAO;gBACb,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,CAAC,CAAC,SAAS;gBAClB,UAAU,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;aAC/B,CAAC,CAAC;YACH,8EAA8E;YAC9E,qFAAqF;YACrF,gFAAgF;YAChF,iDAAiD;YACjD,IAAI,cAAkC,CAAC;YACvC,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;gBAC/C,cAAc,GAAG,OAAO,CAAC,CAAC,mCAAmC;YAC/D,CAAC;YACD,IAAI,cAAc,EAAE,CAAC;gBACnB,IAAI,CAAC,OAAO,CAAC;oBACX,MAAM,EAAE,cAAc;oBACtB,MAAM,EAAE,CAAC,CAAC,OAAO;oBACjB,IAAI,EAAE,SAAS;oBACf,UAAU,EAAE,WAAW;iBACxB,CAAC,CAAC;YACL,CAAC;QACH,CAAC,CAAC;QACF,GAAG,CAAC,EAAE,CAAC,gBAAgB,EAAE,eAAe,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,gBAAgB,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,CAAC;QAE3E,MAAM,WAAW,GAAG,CAAC,KAAiB,EAAE,EAAE;YACxC,MAAM,CAAC,GAAG,KAAK,CAAC,IAOf,CAAC;YACF,gCAAgC;YAChC,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,CAAC,CAAC,OAAO;gBACb,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,CAAC,CAAC,SAAS;gBAClB,UAAU,EAAE;oBACV,KAAK,EAAE,CAAC,CAAC,KAAK;oBACd,OAAO,EAAE,CAAC,CAAC,OAAO;oBAClB,KAAK,EAAE,CAAC,CAAC,KAAK;oBACd,MAAM,EAAE,MAAM;iBACf;aACF,CAAC,CAAC;YACH,gDAAgD;YAChD,IAAI,CAAC,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC;gBAC3B,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;oBACzC,MAAM,MAAM,GAAG,QAAQ,IAAI,EAAE,CAAC;oBAC9B,IAAI,CAAC,OAAO,CAAC;wBACX,EAAE,EAAE,MAAM;wBACV,IAAI,EAAE,MAAM;wBACZ,KAAK,EAAE,IAAI;wBACX,UAAU,EAAE,EAAE;qBACf,CAAC,CAAC;oBACH,IAAI,CAAC,OAAO,CAAC;wBACX,MAAM,EAAE,CAAC,CAAC,OAAO;wBACjB,MAAM,EAAE,MAAM;wBACd,IAAI,EAAE,cAAc;wBACpB,UAAU,EAAE,WAAW;qBACxB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QACF,GAAG,CAAC,EAAE,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;QAClC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;QAEnE,MAAM,eAAe,GAAG,CAAC,KAAiB,EAAE,EAAE;YAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,IAKf,CAAC;YACF,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,eAAe,UAAU,CAAC,CAAC,KAAK,EAAE,CAAC;YACxD,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,OAAO;gBACX,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,UAAU,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;aACjD,CAAC,CAAC;QACL,CAAC,CAAC;QACF,GAAG,CAAC,EAAE,CAAC,8BAA8B,EAAE,eAAe,CAAC,CAAC;QACxD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,8BAA8B,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,CAAC;QAEzF,MAAM,cAAc,GAAG,CAAC,KAAiB,EAAE,EAAE;YAC3C,MAAM,CAAC,GAAG,KAAK,CAAC,IAMf,CAAC;YACF,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,eAAe;gBACrB,KAAK,EAAE,CAAC,CAAC,IAAI;gBACb,UAAU,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE;aAC3E,CAAC,CAAC;YACH,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC;QACF,GAAG,CAAC,EAAE,CAAC,wBAAwB,EAAE,cAAc,CAAC,CAAC;QACjD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,wBAAwB,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,CAAC;QAElF,MAAM,YAAY,GAAG,CAAC,KAAiB,EAAE,EAAE;YACzC,MAAM,CAAC,GAAG,KAAK,CAAC,IAMf,CAAC;YACF,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,eAAe;gBACrB,KAAK,EAAE,CAAC,CAAC,IAAI;gBACb,UAAU,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE;aAC3E,CAAC,CAAC;YACH,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC;QACF,GAAG,CAAC,EAAE,CAAC,sBAAsB,EAAE,YAAY,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,sBAAsB,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,CAAC;IAChF,CAAC;IAED,kBAAkB,CAAC,GAAa;QAC9B,KAAK,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAChD,GAAG,CAAC,GAAG,CAAC,KAAY,EAAE,OAAc,CAAC,CAAC;QACxC,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IAED,mEAAmE;IAEnE,KAAK;QACH,IAAI,IAAI,CAAC,GAAG;YAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChD,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IAClC,CAAC;CACF"}

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

@@ -0,0 +1,88 @@
+import type { ExecutionGraph } from './execution-graph.js';
+export type AttackCategory = 'injection' | 'auth_bypass' | 'data_exposure' | 'race_condition' | 'resource_exhaustion' | 'input_validation' | 'error_handling' | 'crypto_weakness';
+export declare const ALL_ATTACK_CATEGORIES: AttackCategory[];
+export interface CategoryArm {
+    category: AttackCategory;
+    alpha: number;
+    beta_: number;
+    roundsApplied: number;
+    recentlyPatched: number;
+    lastPatchedRound: number;
+}
+export interface AttackStrategy {
+    categories: AttackCategory[];
+    reasoning: string;
+    regressionTargets: AttackCategory[];
+}
+export interface DefenseStrategy {
+    priorities: Array<{
+        file: string;
+        riskScore: number;
+        topCategory: AttackCategory;
+    }>;
+    proactiveChecks: AttackCategory[];
+}
+export interface VulnerabilityHeat {
+    file: string;
+    riskScore: number;
+    topCategory: AttackCategory;
+    unresolvedCount: number;
+    totalAttacks: number;
+}
+export interface RoundResult {
+    category: AttackCategory;
+    vulnerabilitiesFound: number;
+    vulnerabilitiesPatched: number;
+    files: string[];
+    roundNumber: number;
+}
+/**
+ * Co-evolutionary adversarial learning using Thompson Sampling over attack
+ * categories. Maintains Beta-distributed arms per category and persists
+ * state to the execution knowledge graph for cross-run learning.
+ */
+export declare class AdversarialEvolver {
+    private graph;
+    private arms;
+    private history;
+    constructor(graph: ExecutionGraph);
+    /**
+     * Thompson Sampling to select next attack categories.
+     * Unvisited categories are always prioritized. Recently-patched categories
+     * get a +0.2 regression bonus within 5 rounds of patching.
+     */
+    evolveAttackStrategy(targetFiles: string[], previousRounds: RoundResult[]): AttackStrategy;
+    /**
+     * Generate defense priorities from historical attack data. Files are scored
+     * using a blend of overall success rate and recency-weighted rate (λ=0.14,
+     * half-life ~5 rounds). Categories with >50% historical attack success
+     * are flagged for proactive checking.
+     */
+    evolveDefenseStrategy(previousAttacks: RoundResult[]): DefenseStrategy;
+    /**
+     * Record a round's results. Updates the Beta distribution parameters for
+     * the attacked category and persists state to the graph.
+     */
+    recordRound(result: RoundResult): void;
+    /**
+     * Compute a vulnerability heatmap across all files in history.
+     * Files with more unresolved vulnerabilities and recent attack success
+     * rank higher.
+     */
+    getVulnerabilityHeatmap(): VulnerabilityHeat[];
+    private saveToGraph;
+    private loadFromGraph;
+    /**
+     * Sample from Beta(α, β) distribution using the ratio of two Gamma samples.
+     */
+    static sampleBeta(alpha: number, beta_: number, rng?: () => number): number;
+    /**
+     * Sample from Gamma(shape) distribution via Marsaglia-Tsang method.
+     */
+    static sampleGamma(shape: number, rng?: () => number): number;
+    /**
+     * Sample from standard Normal distribution via Box-Muller transform.
+     */
+    static sampleNormal(rng?: () => number): number;
+}
+//# sourceMappingURL=graph-adversarial.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-adversarial.d.ts","sourceRoot":"","sources":["../../src/runtime/graph-adversarial.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAI3D,MAAM,MAAM,cAAc,GACtB,WAAW,GACX,aAAa,GACb,eAAe,GACf,gBAAgB,GAChB,qBAAqB,GACrB,kBAAkB,GAClB,gBAAgB,GAChB,iBAAiB,CAAC;AAEtB,eAAO,MAAM,qBAAqB,EAAE,cAAc,EASjD,CAAC;AAEF,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,cAAc,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;IACxB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,cAAc;IAC7B,UAAU,EAAE,cAAc,EAAE,CAAC;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,iBAAiB,EAAE,cAAc,EAAE,CAAC;CACrC;AAED,MAAM,WAAW,eAAe;IAC9B,UAAU,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,cAAc,CAAA;KAAE,CAAC,CAAC;IACpF,eAAe,EAAE,cAAc,EAAE,CAAC;CACnC;AAED,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,cAAc,CAAC;IAC5B,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,cAAc,CAAC;IACzB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,sBAAsB,EAAE,MAAM,CAAC;IAC/B,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;CACrB;AAID;;;;GAIG;AACH,qBAAa,kBAAkB;IAIjB,OAAO,CAAC,KAAK;IAHzB,OAAO,CAAC,IAAI,CAAmC;IAC/C,OAAO,CAAC,OAAO,CAAgB;gBAEX,KAAK,EAAE,cAAc;IAgBzC;;;;OAIG;IACH,oBAAoB,CAAC,WAAW,EAAE,MAAM,EAAE,EAAE,cAAc,EAAE,WAAW,EAAE,GAAG,cAAc;IA8C1F;;;;;OAKG;IACH,qBAAqB,CAAC,eAAe,EAAE,WAAW,EAAE,GAAG,eAAe;IAiGtE;;;OAGG;IACH,WAAW,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI;IAsDtC;;;;OAIG;IACH,uBAAuB,IAAI,iBAAiB,EAAE;IAkE9C,OAAO,CAAC,WAAW;IAiBnB,OAAO,CAAC,aAAa;IAsCrB;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,GAAE,MAAM,MAAoB,GAAG,MAAM;IAOxF;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,GAAE,MAAM,MAAoB,GAAG,MAAM;IAyB1E;;OAEG;IACH,MAAM,CAAC,YAAY,CAAC,GAAG,GAAE,MAAM,MAAoB,GAAG,MAAM;CAQ7D"}