swarm-engine 1.3.0 → 1.41.0

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;IA6C1F;;;;;OAKG;IACH,qBAAqB,CAAC,eAAe,EAAE,WAAW,EAAE,GAAG,eAAe;IA8FtE;;;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"}

package/dist/runtime/graph-adversarial.js

@@ -0,0 +1,378 @@
+export const ALL_ATTACK_CATEGORIES = [
+    'injection',
+    'auth_bypass',
+    'data_exposure',
+    'race_condition',
+    'resource_exhaustion',
+    'input_validation',
+    'error_handling',
+    'crypto_weakness',
+];
+// ─── AdversarialEvolver ───────────────────────────────────────────
+/**
+ * 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 class AdversarialEvolver {
+    graph;
+    arms;
+    history;
+    constructor(graph) {
+        this.graph = graph;
+        this.arms = new Map();
+        for (const cat of ALL_ATTACK_CATEGORIES) {
+            this.arms.set(cat, {
+                category: cat,
+                alpha: 1,
+                beta_: 1,
+                roundsApplied: 0,
+                recentlyPatched: 0,
+                lastPatchedRound: 0,
+            });
+        }
+        this.history = [];
+        this.loadFromGraph();
+    }
+    /**
+     * 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, previousRounds) {
+        const currentRound = this.history.length > 0 ? Math.max(...this.history.map((r) => r.roundNumber)) + 1 : 1;
+        const scored = [];
+        for (const [cat, arm] of this.arms) {
+            let score;
+            if (arm.roundsApplied === 0) {
+                // Unvisited arms always selected first
+                score = Infinity;
+            }
+            else {
+                score = AdversarialEvolver.sampleBeta(arm.alpha, arm.beta_);
+            }
+            // Regression bonus for recently-patched categories
+            if (arm.recentlyPatched > 0 && currentRound - arm.lastPatchedRound <= 5) {
+                score += 0.2;
+            }
+            scored.push({ category: cat, score });
+        }
+        scored.sort((a, b) => b.score - a.score);
+        const top3 = scored.slice(0, 3).map((s) => s.category);
+        // Regression targets: recently-patched categories within 5 rounds
+        const regressionTargets = [];
+        for (const [cat, arm] of this.arms) {
+            if (arm.recentlyPatched > 0 && currentRound - arm.lastPatchedRound <= 5) {
+                regressionTargets.push(cat);
+            }
+        }
+        const reasoning = scored
+            .slice(0, 3)
+            .map((s) => `${s.category}: score=${s.score === Infinity ? '∞ (unvisited)' : s.score.toFixed(3)}`)
+            .join(', ');
+        return {
+            categories: top3,
+            reasoning: `Thompson Sampling selected: ${reasoning}. Target files: ${targetFiles.length}`,
+            regressionTargets,
+        };
+    }
+    /**
+     * 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) {
+        // Merge history with any additional rounds, deduplicating
+        const seen = new Set();
+        const allRounds = [];
+        for (const r of this.history) {
+            const key = `${r.roundNumber}:${r.category}`;
+            if (!seen.has(key)) {
+                seen.add(key);
+                allRounds.push(r);
+            }
+        }
+        for (const r of previousAttacks) {
+            const key = `${r.roundNumber}:${r.category}`;
+            if (!seen.has(key)) {
+                seen.add(key);
+                allRounds.push(r);
+            }
+        }
+        if (allRounds.length === 0) {
+            return { priorities: [], proactiveChecks: [] };
+        }
+        const maxRound = Math.max(...allRounds.map((r) => r.roundNumber));
+        // Group attacks by file
+        const fileMap = new Map();
+        for (const round of allRounds) {
+            for (const file of round.files) {
+                if (!fileMap.has(file))
+                    fileMap.set(file, []);
+                fileMap.get(file).push({
+                    found: round.vulnerabilitiesFound,
+                    roundNumber: round.roundNumber,
+                    category: round.category,
+                });
+            }
+        }
+        const priorities = [];
+        for (const [file, attacks] of fileMap) {
+            const totalAttacks = attacks.length;
+            const successCount = attacks.filter((a) => a.found > 0).length;
+            const successRate = totalAttacks > 0 ? successCount / totalAttacks : 0;
+            // Recency-weighted rate (λ=0.14)
+            let weightedSum = 0;
+            let totalWeight = 0;
+            for (const a of attacks) {
+                const weight = Math.exp(-0.14 * (maxRound - a.roundNumber));
+                weightedSum += weight * (a.found > 0 ? 1 : 0);
+                totalWeight += weight;
+            }
+            const recencyWeightedRate = totalWeight > 0 ? weightedSum / totalWeight : 0;
+            const riskScore = Math.min(1, 0.6 * successRate + 0.4 * recencyWeightedRate);
+            // Top category: most vulns found for this file
+            const catCounts = new Map();
+            for (const a of attacks) {
+                catCounts.set(a.category, (catCounts.get(a.category) ?? 0) + a.found);
+            }
+            let topCategory = attacks[0].category;
+            let maxCount = 0;
+            for (const [cat, count] of catCounts) {
+                if (count > maxCount) {
+                    maxCount = count;
+                    topCategory = cat;
+                }
+            }
+            priorities.push({ file, riskScore, topCategory });
+        }
+        priorities.sort((a, b) => b.riskScore - a.riskScore);
+        // Proactive checks: categories with >50% historical attack success
+        const catStats = new Map();
+        for (const round of allRounds) {
+            const stats = catStats.get(round.category) ?? { total: 0, successful: 0 };
+            stats.total++;
+            if (round.vulnerabilitiesFound > 0)
+                stats.successful++;
+            catStats.set(round.category, stats);
+        }
+        const proactiveChecks = [];
+        for (const [cat, stats] of catStats) {
+            if (stats.total > 0 && stats.successful / stats.total > 0.5) {
+                proactiveChecks.push(cat);
+            }
+        }
+        return { priorities, proactiveChecks };
+    }
+    /**
+     * Record a round's results. Updates the Beta distribution parameters for
+     * the attacked category and persists state to the graph.
+     */
+    recordRound(result) {
+        const arm = this.arms.get(result.category);
+        if (!arm)
+            return;
+        // Update Beta params: success → α++, failure → β++
+        if (result.vulnerabilitiesFound > 0) {
+            arm.alpha++;
+        }
+        else {
+            arm.beta_++;
+        }
+        arm.roundsApplied++;
+        if (result.vulnerabilitiesPatched > 0) {
+            arm.recentlyPatched = result.vulnerabilitiesPatched;
+            arm.lastPatchedRound = result.roundNumber;
+        }
+        this.history.push(result);
+        // Persist arm state
+        this.saveToGraph();
+        // Persist round as graph node + edges
+        const roundId = `adversarial:round:${result.roundNumber}:${result.category}`;
+        this.graph.addNode({
+            id: roundId,
+            type: 'heuristic',
+            label: `Attack round ${result.roundNumber}: ${result.category}`,
+            properties: {
+                category: result.category,
+                vulnerabilitiesFound: result.vulnerabilitiesFound,
+                vulnerabilitiesPatched: result.vulnerabilitiesPatched,
+                files: result.files,
+                roundNumber: result.roundNumber,
+            },
+        });
+        this.graph.addEdge({
+            source: roundId,
+            target: `adversarial:arm:${result.category}`,
+            type: 'learned_from',
+            confidence: 'EXTRACTED',
+        });
+        for (const file of result.files) {
+            const fileId = `file:${file}`;
+            this.graph.addNode({ id: fileId, type: 'file', label: file });
+            this.graph.addEdge({
+                source: roundId,
+                target: fileId,
+                type: 'touched_file',
+                confidence: 'EXTRACTED',
+            });
+        }
+    }
+    /**
+     * Compute a vulnerability heatmap across all files in history.
+     * Files with more unresolved vulnerabilities and recent attack success
+     * rank higher.
+     */
+    getVulnerabilityHeatmap() {
+        if (this.history.length === 0)
+            return [];
+        const maxRound = Math.max(...this.history.map((r) => r.roundNumber));
+        // Group by file
+        const fileMap = new Map();
+        for (const round of this.history) {
+            for (const file of round.files) {
+                if (!fileMap.has(file))
+                    fileMap.set(file, []);
+                fileMap.get(file).push({
+                    found: round.vulnerabilitiesFound,
+                    patched: round.vulnerabilitiesPatched,
+                    roundNumber: round.roundNumber,
+                    category: round.category,
+                });
+            }
+        }
+        const heatmap = [];
+        for (const [file, attacks] of fileMap) {
+            const totalAttacks = attacks.length;
+            const totalFound = attacks.reduce((sum, a) => sum + a.found, 0);
+            const totalPatched = attacks.reduce((sum, a) => sum + a.patched, 0);
+            const unresolvedCount = totalFound - totalPatched;
+            const successCount = attacks.filter((a) => a.found > 0).length;
+            const successRate = totalAttacks > 0 ? successCount / totalAttacks : 0;
+            let weightedSum = 0;
+            let totalWeight = 0;
+            for (const a of attacks) {
+                const weight = Math.exp(-0.14 * (maxRound - a.roundNumber));
+                weightedSum += weight * (a.found > 0 ? 1 : 0);
+                totalWeight += weight;
+            }
+            const recencyWeightedRate = totalWeight > 0 ? weightedSum / totalWeight : 0;
+            const riskScore = Math.min(1, 0.6 * successRate + 0.4 * recencyWeightedRate);
+            // Top category by most vulnerabilities found
+            const catCounts = new Map();
+            for (const a of attacks) {
+                catCounts.set(a.category, (catCounts.get(a.category) ?? 0) + a.found);
+            }
+            let topCategory = attacks[0].category;
+            let maxCount = 0;
+            for (const [cat, count] of catCounts) {
+                if (count > maxCount) {
+                    maxCount = count;
+                    topCategory = cat;
+                }
+            }
+            heatmap.push({ file, riskScore, topCategory, unresolvedCount, totalAttacks });
+        }
+        heatmap.sort((a, b) => b.riskScore - a.riskScore);
+        return heatmap;
+    }
+    // ─── Graph Persistence ──────────────────────────────────────────
+    saveToGraph() {
+        for (const [, arm] of this.arms) {
+            this.graph.addNode({
+                id: `adversarial:arm:${arm.category}`,
+                type: 'heuristic',
+                label: `Adversarial arm: ${arm.category}`,
+                properties: {
+                    alpha: arm.alpha,
+                    beta_: arm.beta_,
+                    roundsApplied: arm.roundsApplied,
+                    recentlyPatched: arm.recentlyPatched,
+                    lastPatchedRound: arm.lastPatchedRound,
+                },
+            });
+        }
+    }
+    loadFromGraph() {
+        // Restore arm state from persisted nodes
+        for (const cat of ALL_ATTACK_CATEGORIES) {
+            const node = this.graph.getNode(`adversarial:arm:${cat}`);
+            if (node) {
+                const p = node.properties;
+                this.arms.set(cat, {
+                    category: cat,
+                    alpha: p.alpha ?? 1,
+                    beta_: p.beta_ ?? 1,
+                    roundsApplied: p.roundsApplied ?? 0,
+                    recentlyPatched: p.recentlyPatched ?? 0,
+                    lastPatchedRound: p.lastPatchedRound ?? 0,
+                });
+            }
+        }
+        // Restore round history from persisted nodes
+        const heuristicNodes = this.graph.getNodesByType('heuristic');
+        for (const node of heuristicNodes) {
+            if (node.id.startsWith('adversarial:round:')) {
+                const p = node.properties;
+                if (p.category && p.roundNumber !== undefined) {
+                    this.history.push({
+                        category: p.category,
+                        vulnerabilitiesFound: p.vulnerabilitiesFound ?? 0,
+                        vulnerabilitiesPatched: p.vulnerabilitiesPatched ?? 0,
+                        files: p.files ?? [],
+                        roundNumber: p.roundNumber,
+                    });
+                }
+            }
+        }
+        this.history.sort((a, b) => a.roundNumber - b.roundNumber);
+    }
+    // ─── Statistical Sampling (pure TypeScript, no deps) ────────────
+    /**
+     * Sample from Beta(α, β) distribution using the ratio of two Gamma samples.
+     */
+    static sampleBeta(alpha, beta_, rng = Math.random) {
+        const x = AdversarialEvolver.sampleGamma(alpha, rng);
+        const y = AdversarialEvolver.sampleGamma(beta_, rng);
+        if (x + y === 0)
+            return 0.5;
+        return x / (x + y);
+    }
+    /**
+     * Sample from Gamma(shape) distribution via Marsaglia-Tsang method.
+     */
+    static sampleGamma(shape, rng = Math.random) {
+        if (shape < 1) {
+            return AdversarialEvolver.sampleGamma(shape + 1, rng) * Math.pow(rng(), 1 / shape);
+        }
+        const d = shape - 1 / 3;
+        const c = 1 / Math.sqrt(9 * d);
+        for (;;) {
+            let x;
+            let v;
+            do {
+                x = AdversarialEvolver.sampleNormal(rng);
+                v = Math.pow(1 + c * x, 3);
+            } while (v <= 0);
+            if (rng() < 1 - 0.0331 * Math.pow(x, 4)) {
+                return d * v;
+            }
+            if (Math.log(rng()) < 0.5 * x * x + d * (1 - v + Math.log(v))) {
+                return d * v;
+            }
+        }
+    }
+    /**
+     * Sample from standard Normal distribution via Box-Muller transform.
+     */
+    static sampleNormal(rng = Math.random) {
+        let u1;
+        do {
+            u1 = rng();
+        } while (u1 === 0);
+        const u2 = rng();
+        return Math.sqrt(-2 * Math.log(u1)) * Math.cos(2 * Math.PI * u2);
+    }
+}
+//# sourceMappingURL=graph-adversarial.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-adversarial.js","sourceRoot":"","sources":["../../src/runtime/graph-adversarial.ts"],"names":[],"mappings":"AAcA,MAAM,CAAC,MAAM,qBAAqB,GAAqB;IACrD,WAAW;IACX,aAAa;IACb,eAAe;IACf,gBAAgB;IAChB,qBAAqB;IACrB,kBAAkB;IAClB,gBAAgB;IAChB,iBAAiB;CAClB,CAAC;AAsCF,qEAAqE;AAErE;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IAIT;IAHZ,IAAI,CAAmC;IACvC,OAAO,CAAgB;IAE/B,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;QACvC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,qBAAqB,EAAE,CAAC;YACxC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE;gBACjB,QAAQ,EAAE,GAAG;gBACb,KAAK,EAAE,CAAC;gBACR,KAAK,EAAE,CAAC;gBACR,aAAa,EAAE,CAAC;gBAChB,eAAe,EAAE,CAAC;gBAClB,gBAAgB,EAAE,CAAC;aACpB,CAAC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACH,oBAAoB,CAAC,WAAqB,EAAE,cAA6B;QACvE,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3G,MAAM,MAAM,GAAuD,EAAE,CAAC;QAEtE,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,KAAa,CAAC;YAClB,IAAI,GAAG,CAAC,aAAa,KAAK,CAAC,EAAE,CAAC;gBAC5B,uCAAuC;gBACvC,KAAK,GAAG,QAAQ,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,kBAAkB,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;YAC9D,CAAC;YAED,mDAAmD;YACnD,IAAI,GAAG,CAAC,eAAe,GAAG,CAAC,IAAI,YAAY,GAAG,GAAG,CAAC,gBAAgB,IAAI,CAAC,EAAE,CAAC;gBACxE,KAAK,IAAI,GAAG,CAAC;YACf,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAEvD,kEAAkE;QAClE,MAAM,iBAAiB,GAAqB,EAAE,CAAC;QAC/C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,GAAG,CAAC,eAAe,GAAG,CAAC,IAAI,YAAY,GAAG,GAAG,CAAC,gBAAgB,IAAI,CAAC,EAAE,CAAC;gBACxE,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAG,MAAM;aACrB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,WAAW,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;aACjG,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,OAAO;YACL,UAAU,EAAE,IAAI;YAChB,SAAS,EAAE,+BAA+B,SAAS,mBAAmB,WAAW,CAAC,MAAM,EAAE;YAC1F,iBAAiB;SAClB,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,qBAAqB,CAAC,eAA8B;QAClD,0DAA0D;QAC1D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,SAAS,GAAkB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;YAChC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;QACjD,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QAElE,wBAAwB;QACxB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmF,CAAC;QAC3G,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC9C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC;oBACtB,KAAK,EAAE,KAAK,CAAC,oBAAoB;oBACjC,WAAW,EAAE,KAAK,CAAC,WAAW;oBAC9B,QAAQ,EAAE,KAAK,CAAC,QAAQ;iBACzB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAkC,EAAE,CAAC;QACrD,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,OAAO,EAAE,CAAC;YACtC,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC;YACpC,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAC/D,MAAM,WAAW,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YAEvE,iCAAiC;YACjC,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC5D,WAAW,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9C,WAAW,IAAI,MAAM,CAAC;YACxB,CAAC;YACD,MAAM,mBAAmB,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;YAE5E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,WAAW,GAAG,GAAG,GAAG,mBAAmB,CAAC,CAAC;YAE7E,+CAA+C;YAC/C,MAAM,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC;YACpD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACxE,CAAC;YACD,IAAI,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YACtC,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;gBACrC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACrB,QAAQ,GAAG,KAAK,CAAC;oBACjB,WAAW,GAAG,GAAG,CAAC;gBACpB,CAAC;YACH,CAAC;YAED,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,CAAC;QACpD,CAAC;QAED,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAErD,mEAAmE;QACnE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAyD,CAAC;QAClF,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;YAC1E,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,IAAI,KAAK,CAAC,oBAAoB,GAAG,CAAC;gBAAE,KAAK,CAAC,UAAU,EAAE,CAAC;YACvD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACtC,CAAC;QAED,MAAM,eAAe,GAAqB,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;YACpC,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,KAAK,GAAG,GAAG,EAAE,CAAC;gBAC5D,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,CAAC;IACzC,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,MAAmB;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,CAAC,GAAG;YAAE,OAAO;QAEjB,mDAAmD;QACnD,IAAI,MAAM,CAAC,oBAAoB,GAAG,CAAC,EAAE,CAAC;YACpC,GAAG,CAAC,KAAK,EAAE,CAAC;QACd,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,KAAK,EAAE,CAAC;QACd,CAAC;QACD,GAAG,CAAC,aAAa,EAAE,CAAC;QAEpB,IAAI,MAAM,CAAC,sBAAsB,GAAG,CAAC,EAAE,CAAC;YACtC,GAAG,CAAC,eAAe,GAAG,MAAM,CAAC,sBAAsB,CAAC;YACpD,GAAG,CAAC,gBAAgB,GAAG,MAAM,CAAC,WAAW,CAAC;QAC5C,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE1B,oBAAoB;QACpB,IAAI,CAAC,WAAW,EAAE,CAAC;QAEnB,sCAAsC;QACtC,MAAM,OAAO,GAAG,qBAAqB,MAAM,CAAC,WAAW,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC7E,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;YACjB,EAAE,EAAE,OAAO;YACX,IAAI,EAAE,WAAW;YACjB,KAAK,EAAE,gBAAgB,MAAM,CAAC,WAAW,KAAK,MAAM,CAAC,QAAQ,EAAE;YAC/D,UAAU,EAAE;gBACV,QAAQ,EAAE,MAAM,CAAC,QAAQ;gBACzB,oBAAoB,EAAE,MAAM,CAAC,oBAAoB;gBACjD,sBAAsB,EAAE,MAAM,CAAC,sBAAsB;gBACrD,KAAK,EAAE,MAAM,CAAC,KAAK;gBACnB,WAAW,EAAE,MAAM,CAAC,WAAW;aAChC;SACF,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;YACjB,MAAM,EAAE,OAAO;YACf,MAAM,EAAE,mBAAmB,MAAM,CAAC,QAAQ,EAAE;YAC5C,IAAI,EAAE,cAAc;YACpB,UAAU,EAAE,WAAW;SACxB,CAAC,CAAC;QACH,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,QAAQ,IAAI,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;YAC9D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;gBACjB,MAAM,EAAE,OAAO;gBACf,MAAM,EAAE,MAAM;gBACd,IAAI,EAAE,cAAc;gBACpB,UAAU,EAAE,WAAW;aACxB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,uBAAuB;QACrB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEzC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QAErE,gBAAgB;QAChB,MAAM,OAAO,GAAG,IAAI,GAAG,EAGpB,CAAC;QACJ,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC9C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC;oBACtB,KAAK,EAAE,KAAK,CAAC,oBAAoB;oBACjC,OAAO,EAAE,KAAK,CAAC,sBAAsB;oBACrC,WAAW,EAAE,KAAK,CAAC,WAAW;oBAC9B,QAAQ,EAAE,KAAK,CAAC,QAAQ;iBACzB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAwB,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,OAAO,EAAE,CAAC;YACtC,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC;YACpC,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChE,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YACpE,MAAM,eAAe,GAAG,UAAU,GAAG,YAAY,CAAC;YAElD,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAC/D,MAAM,WAAW,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YAEvE,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC5D,WAAW,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9C,WAAW,IAAI,MAAM,CAAC;YACxB,CAAC;YACD,MAAM,mBAAmB,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;YAE5E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,WAAW,GAAG,GAAG,GAAG,mBAAmB,CAAC,CAAC;YAE7E,6CAA6C;YAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC;YACpD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACxE,CAAC;YACD,IAAI,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YACtC,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;gBACrC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACrB,QAAQ,GAAG,KAAK,CAAC;oBACjB,WAAW,GAAG,GAAG,CAAC;gBACpB,CAAC;YACH,CAAC;YAED,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,eAAe,EAAE,YAAY,EAAE,CAAC,CAAC;QAChF,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAClD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,mEAAmE;IAE3D,WAAW;QACjB,KAAK,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;gBACjB,EAAE,EAAE,mBAAmB,GAAG,CAAC,QAAQ,EAAE;gBACrC,IAAI,EAAE,WAAW;gBACjB,KAAK,EAAE,oBAAoB,GAAG,CAAC,QAAQ,EAAE;gBACzC,UAAU,EAAE;oBACV,KAAK,EAAE,GAAG,CAAC,KAAK;oBAChB,KAAK,EAAE,GAAG,CAAC,KAAK;oBAChB,aAAa,EAAE,GAAG,CAAC,aAAa;oBAChC,eAAe,EAAE,GAAG,CAAC,eAAe;oBACpC,gBAAgB,EAAE,GAAG,CAAC,gBAAgB;iBACvC;aACF,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAEO,aAAa;QACnB,yCAAyC;QACzC,KAAK,MAAM,GAAG,IAAI,qBAAqB,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,mBAAmB,GAAG,EAAE,CAAC,CAAC;YAC1D,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE;oBACjB,QAAQ,EAAE,GAAG;oBACb,KAAK,EAAG,CAAC,CAAC,KAAgB,IAAI,CAAC;oBAC/B,KAAK,EAAG,CAAC,CAAC,KAAgB,IAAI,CAAC;oBAC/B,aAAa,EAAG,CAAC,CAAC,aAAwB,IAAI,CAAC;oBAC/C,eAAe,EAAG,CAAC,CAAC,eAA0B,IAAI,CAAC;oBACnD,gBAAgB,EAAG,CAAC,CAAC,gBAA2B,IAAI,CAAC;iBACtD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,6CAA6C;QAC7C,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;QAC9D,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,oBAAoB,CAAC,EAAE,CAAC;gBAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;gBAC1B,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;oBAC9C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;wBAChB,QAAQ,EAAE,CAAC,CAAC,QAA0B;wBACtC,oBAAoB,EAAG,CAAC,CAAC,oBAA+B,IAAI,CAAC;wBAC7D,sBAAsB,EAAG,CAAC,CAAC,sBAAiC,IAAI,CAAC;wBACjE,KAAK,EAAG,CAAC,CAAC,KAAkB,IAAI,EAAE;wBAClC,WAAW,EAAE,CAAC,CAAC,WAAqB;qBACrC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IAC7D,CAAC;IAED,mEAAmE;IAEnE;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,KAAa,EAAE,KAAa,EAAE,MAAoB,IAAI,CAAC,MAAM;QAC7E,MAAM,CAAC,GAAG,kBAAkB,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,kBAAkB,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAC5B,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,KAAa,EAAE,MAAoB,IAAI,CAAC,MAAM;QAC/D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,OAAO,kBAAkB,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;QACrF,CAAC;QAED,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE/B,SAAS,CAAC;YACR,IAAI,CAAS,CAAC;YACd,IAAI,CAAS,CAAC;YACd,GAAG,CAAC;gBACF,CAAC,GAAG,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;gBACzC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7B,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;YAEjB,IAAI,GAAG,EAAE,GAAG,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACxC,OAAO,CAAC,GAAG,CAAC,CAAC;YACf,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,OAAO,CAAC,GAAG,CAAC,CAAC;YACf,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,YAAY,CAAC,MAAoB,IAAI,CAAC,MAAM;QACjD,IAAI,EAAU,CAAC;QACf,GAAG,CAAC;YACF,EAAE,GAAG,GAAG,EAAE,CAAC;QACb,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE;QACnB,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACnE,CAAC;CACF"}

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

@@ -0,0 +1,106 @@
+import type { GraphNode, GraphEdge, GraphNodeType, GraphEdgeType, PhaseGateResult, PhaseGateConfig } from '../core/types.js';
+/**
+ * Read-only interface for ExecutionGraph methods used by the analyzer.
+ * Decouples from the concrete SQLite-backed implementation for testability,
+ * following the same pattern as GraphContextRouter's ExecutionGraphReader.
+ */
+export interface GraphAnalyzable {
+    getNode(id: string): GraphNode | null;
+    getNodesByType(type: GraphNodeType): GraphNode[];
+    getEdgesByType(type: GraphEdgeType): GraphEdge[];
+    getEdges(nodeId: string, direction?: 'outgoing' | 'incoming' | 'both'): GraphEdge[];
+    getNeighbors(nodeId: string, edgeType?: GraphEdgeType): GraphNode[];
+    bfs(startId: string, maxDepth?: number): {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    };
+    shortestPath(fromId: string, toId: string, maxHops?: number): {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    } | null;
+}
+export interface GodNode {
+    node: GraphNode;
+    degree: number;
+    inDegree: number;
+    outDegree: number;
+    fanOut: number;
+}
+export interface FailurePrediction {
+    nodeId: string;
+    label: string;
+    riskScore: number;
+    reasons: string[];
+    historicalFailRate: number;
+}
+export interface TopologySuggestion {
+    type: 'isolated_output' | 'bottleneck' | 'thin_cluster' | 'ambiguous_dependency' | 'high_centrality';
+    message: string;
+    nodeIds: string[];
+    severity: 'info' | 'warning' | 'critical';
+}
+/**
+ * Pre-execution analysis (centrality, failure prediction) and post-execution
+ * insights (topology-driven suggestions) over the execution knowledge graph.
+ *
+ * All analysis is purely structural — no LLM calls, just graph topology.
+ */
+export declare class GraphAnalyzer {
+    private graph;
+    constructor(graph: GraphAnalyzable);
+    /**
+     * Find "god nodes" — nodes with highest degree, excluding orchestration
+     * hubs (which are structurally central by definition, not interesting).
+     */
+    findGodNodes(options?: {
+        type?: GraphNodeType;
+        limit?: number;
+    }): GodNode[];
+    /**
+     * Sampling-based betweenness centrality approximation.
+     *
+     * Samples random node pairs, finds shortest paths between them, and counts
+     * how often each intermediate node appears on those paths. Nodes that
+     * frequently appear as bridges score highest.
+     *
+     * O(samples × avgPathLength) vs O(V×E) for exact Brandes algorithm.
+     * Normalizes by valid paths found (not total samples) for meaningful scores.
+     */
+    computeCentrality(sampleSize?: number): Map<string, number>;
+    /**
+     * Predict which agents are most likely to fail based on graph signals:
+     *
+     * - Historical fail rate for the agent type (min 3 samples)
+     * - Files with prior error associations (caused_by edges)
+     * - Ambiguous inbound dependencies
+     * - High fan-in (more dependencies = more that can go wrong)
+     */
+    predictFailures(orchestrationId?: string, files?: string[]): FailurePrediction[];
+    /**
+     * Post-execution topology-driven suggestions.
+     *
+     * Detects structural issues without any LLM:
+     * 1. Isolated outputs — agents whose work was never consumed
+     * 2. High-centrality bottlenecks — single points of failure
+     * 3. Ambiguous dependencies — edges that need verification
+     */
+    suggestImprovements(orchestrationId?: string): TopologySuggestion[];
+    /**
+     * Evaluate whether a phase should proceed, warn, or halt based on
+     * reflection confidence and historical pattern success rates.
+     */
+    evaluatePhaseConfidence(phase: {
+        kind: string;
+        agentCount: number;
+        outputs: string[];
+        usage?: {
+            totalTokens: number;
+        };
+    }, reflection: {
+        confidence: 'high' | 'medium' | 'low';
+    }, patternStats?: {
+        successRate: number;
+        avgDurationMs: number;
+    }, config?: PhaseGateConfig): PhaseGateResult;
+}
+//# sourceMappingURL=graph-analyzer.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-analyzer.d.ts","sourceRoot":"","sources":["../../src/runtime/graph-analyzer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,SAAS,EACT,SAAS,EACT,aAAa,EACb,aAAa,EAEb,eAAe,EACf,eAAe,EAChB,MAAM,kBAAkB,CAAC;AAI1B;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAAC;IACtC,cAAc,CAAC,IAAI,EAAE,aAAa,GAAG,SAAS,EAAE,CAAC;IACjD,cAAc,CAAC,IAAI,EAAE,aAAa,GAAG,SAAS,EAAE,CAAC;IACjD,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,UAAU,GAAG,UAAU,GAAG,MAAM,GAAG,SAAS,EAAE,CAAC;IACpF,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,aAAa,GAAG,SAAS,EAAE,CAAC;IACpE,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,CAAC;IACpF,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,GAAG,IAAI,CAAC;CACjH;AAID,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,SAAS,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,iBAAiB,GAAG,YAAY,GAAG,cAAc,GAAG,sBAAsB,GAAG,iBAAiB,CAAC;IACrG,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,QAAQ,EAAE,MAAM,GAAG,SAAS,GAAG,UAAU,CAAC;CAC3C;AAID;;;;;GAKG;AACH,qBAAa,aAAa;IACZ,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,eAAe;IAE1C;;;OAGG;IACH,YAAY,CAAC,OAAO,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,aAAa,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,EAAE;IAsC3E;;;;;;;;;OASG;IACH,iBAAiB,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAuC3D;;;;;;;OAOG;IACH,eAAe,CAAC,eAAe,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,iBAAiB,EAAE;IA2FhF;;;;;;;OAOG;IACH,mBAAmB,CAAC,eAAe,CAAC,EAAE,MAAM,GAAG,kBAAkB,EAAE;IAiGnE;;;OAGG;IACH,uBAAuB,CACrB,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,EAAE,CAAC;QAAC,KAAK,CAAC,EAAE;YAAE,WAAW,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,EAC/F,UAAU,EAAE;QAAE,UAAU,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAA;KAAE,EACrD,YAAY,CAAC,EAAE;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,EAC7D,MAAM,CAAC,EAAE,eAAe,GACvB,eAAe;CAwCnB"}