agentic-flow 1.10.1 → 2.0.0-alpha

package/agentic-flow/dist/hooks/swarm-learning-optimizer.js

@@ -0,0 +1,351 @@
+/**
+ * Swarm Learning Optimizer
+ *
+ * Enhances parallel execution with adaptive learning, pattern recognition,
+ * and automated topology selection using ReasoningBank intelligence.
+ */
+export class SwarmLearningOptimizer {
+    reasoningBank;
+    NAMESPACE = 'swarm/optimization';
+    constructor(reasoningBank) {
+        this.reasoningBank = reasoningBank;
+    }
+    /**
+     * Store swarm execution metrics for learning
+     */
+    async storeExecutionPattern(taskDescription, metrics, success) {
+        const sessionId = `${this.NAMESPACE}/${metrics.topology}/${Date.now()}`;
+        await this.reasoningBank.storePattern({
+            sessionId,
+            task: taskDescription,
+            input: JSON.stringify({ taskComplexity: metrics.taskComplexity, agentCount: metrics.agentCount }),
+            output: JSON.stringify(metrics),
+            reward: this.calculateReward(metrics, success),
+            success,
+            latencyMs: metrics.totalTimeMs,
+            tokensUsed: 0, // Not tracking tokens for swarm ops
+            critique: this.generateCritique(metrics, success)
+        });
+    }
+    /**
+     * Calculate reward score for swarm execution (0-1)
+     */
+    calculateReward(metrics, success) {
+        if (!success)
+            return 0.0;
+        let reward = 0.5; // Base reward for success
+        // Reward for high success rate (+0.2)
+        if (metrics.successRate >= 90) {
+            reward += 0.2;
+        }
+        else if (metrics.successRate >= 75) {
+            reward += 0.1;
+        }
+        // Reward for speedup (+0.2)
+        if (metrics.speedup) {
+            if (metrics.speedup >= 3.0) {
+                reward += 0.2;
+            }
+            else if (metrics.speedup >= 2.0) {
+                reward += 0.15;
+            }
+            else if (metrics.speedup >= 1.5) {
+                reward += 0.1;
+            }
+        }
+        // Reward for efficiency (operations/time) (+0.1)
+        const opsPerSecond = (metrics.operations / metrics.totalTimeMs) * 1000;
+        if (opsPerSecond > 0.1) {
+            reward += 0.1;
+        }
+        return Math.min(1.0, reward);
+    }
+    /**
+     * Generate critique for learning
+     */
+    generateCritique(metrics, success) {
+        const critiques = [];
+        if (!success) {
+            critiques.push('Swarm execution failed - investigate error handling');
+        }
+        if (metrics.successRate < 80) {
+            critiques.push(`Low success rate (${metrics.successRate}%) - review agent reliability`);
+        }
+        if (metrics.speedup && metrics.speedup < 1.2) {
+            critiques.push(`Minimal speedup (${metrics.speedup}x) - consider different topology or larger batches`);
+        }
+        if (metrics.batchSize < 3) {
+            critiques.push('Small batch size - may not fully utilize parallel capabilities');
+        }
+        if (metrics.topology === 'mesh' && metrics.agentCount > 10) {
+            critiques.push('Mesh topology with many agents (O(n²) coordination) - consider hierarchical');
+        }
+        if (critiques.length === 0) {
+            if (metrics.speedup && metrics.speedup >= 3.0) {
+                return 'Excellent parallel execution - pattern worth reusing';
+            }
+            return 'Good swarm execution - successful pattern';
+        }
+        return critiques.join('. ');
+    }
+    /**
+     * Get optimization recommendations based on learned patterns
+     */
+    async getOptimization(taskDescription, taskComplexity, estimatedAgentCount) {
+        // Search for similar successful patterns
+        const similarPatterns = await this.reasoningBank.searchPatterns(taskDescription, {
+            k: 10,
+            minReward: 0.7,
+            onlySuccesses: true
+        });
+        if (similarPatterns.length === 0) {
+            // No learned patterns - return default recommendations
+            return this.getDefaultRecommendation(taskComplexity, estimatedAgentCount);
+        }
+        // Analyze patterns to find optimal configuration
+        const topologyScores = new Map();
+        for (const pattern of similarPatterns) {
+            try {
+                const metrics = JSON.parse(pattern.output);
+                const topology = metrics.topology;
+                if (!topologyScores.has(topology)) {
+                    topologyScores.set(topology, { totalReward: 0, count: 0, avgSpeedup: 0 });
+                }
+                const score = topologyScores.get(topology);
+                score.totalReward += pattern.reward;
+                score.count += 1;
+                score.avgSpeedup += metrics.speedup || 1.0;
+            }
+            catch (e) {
+                // Skip invalid pattern data
+                continue;
+            }
+        }
+        // Find best topology based on average reward and speedup
+        let bestTopology = 'hierarchical';
+        let bestScore = 0;
+        let bestSpeedup = 1.0;
+        const alternatives = [];
+        for (const [topology, data] of topologyScores.entries()) {
+            const avgReward = data.totalReward / data.count;
+            const avgSpeedup = data.avgSpeedup / data.count;
+            const score = avgReward * 0.6 + (avgSpeedup / 5.0) * 0.4; // Weighted score
+            if (score > bestScore) {
+                if (bestScore > 0) {
+                    // Previous best becomes alternative
+                    alternatives.push({
+                        topology: bestTopology,
+                        confidence: Math.round(bestScore * 100) / 100,
+                        reasoning: `Average speedup: ${bestSpeedup.toFixed(2)}x from ${topologyScores.get(bestTopology).count} executions`
+                    });
+                }
+                bestScore = score;
+                bestTopology = topology;
+                bestSpeedup = avgSpeedup;
+            }
+            else {
+                alternatives.push({
+                    topology,
+                    confidence: Math.round(score * 100) / 100,
+                    reasoning: `Average speedup: ${avgSpeedup.toFixed(2)}x from ${data.count} executions`
+                });
+            }
+        }
+        // Determine optimal batch size based on task complexity and learned patterns
+        const optimalBatchSize = this.determineOptimalBatchSize(taskComplexity, estimatedAgentCount, similarPatterns);
+        return {
+            recommendedTopology: bestTopology,
+            recommendedBatchSize: optimalBatchSize,
+            recommendedAgentCount: Math.min(estimatedAgentCount, this.getMaxAgentsForTopology(bestTopology)),
+            expectedSpeedup: bestSpeedup,
+            confidence: Math.round(bestScore * 100) / 100,
+            reasoning: `Based on ${similarPatterns.length} similar successful executions. ` +
+                `${bestTopology} topology achieved ${bestSpeedup.toFixed(2)}x average speedup.`,
+            alternatives: alternatives.sort((a, b) => b.confidence - a.confidence).slice(0, 2)
+        };
+    }
+    /**
+     * Get default recommendations when no learned patterns exist
+     */
+    getDefaultRecommendation(taskComplexity, estimatedAgentCount) {
+        // Default topology selection based on agent count and complexity
+        let topology;
+        let expectedSpeedup;
+        let reasoning;
+        if (estimatedAgentCount <= 5) {
+            topology = 'mesh';
+            expectedSpeedup = 2.5;
+            reasoning = 'Mesh topology optimal for small swarms (≤5 agents) - full peer-to-peer coordination';
+        }
+        else if (estimatedAgentCount <= 10) {
+            topology = 'hierarchical';
+            expectedSpeedup = 3.5;
+            reasoning = 'Hierarchical topology optimal for medium swarms (6-10 agents) - efficient delegation';
+        }
+        else {
+            topology = 'hierarchical';
+            expectedSpeedup = 4.0;
+            reasoning = 'Hierarchical topology required for large swarms (>10 agents) - avoids O(n²) coordination overhead';
+        }
+        // Adjust for task complexity
+        if (taskComplexity === 'critical' || taskComplexity === 'high') {
+            expectedSpeedup *= 1.2; // Higher complexity benefits more from parallelization
+        }
+        const batchSize = this.determineOptimalBatchSize(taskComplexity, estimatedAgentCount, []);
+        return {
+            recommendedTopology: topology,
+            recommendedBatchSize: batchSize,
+            recommendedAgentCount: Math.min(estimatedAgentCount, this.getMaxAgentsForTopology(topology)),
+            expectedSpeedup,
+            confidence: 0.6, // Lower confidence without learned patterns
+            reasoning: `${reasoning} (default recommendation - no learned patterns yet)`,
+            alternatives: [
+                {
+                    topology: topology === 'mesh' ? 'hierarchical' : 'mesh',
+                    confidence: 0.5,
+                    reasoning: 'Alternative topology if default does not perform well'
+                }
+            ]
+        };
+    }
+    /**
+     * Determine optimal batch size based on complexity and learned patterns
+     */
+    determineOptimalBatchSize(taskComplexity, estimatedAgentCount, learnedPatterns) {
+        // Analyze learned patterns for optimal batch size
+        if (learnedPatterns.length > 0) {
+            const batchSizes = learnedPatterns
+                .map(p => {
+                try {
+                    const metrics = JSON.parse(p.output);
+                    return { batchSize: metrics.batchSize, reward: p.reward };
+                }
+                catch (e) {
+                    return null;
+                }
+            })
+                .filter(x => x !== null);
+            if (batchSizes.length > 0) {
+                // Find batch size with highest average reward
+                const batchMap = new Map();
+                for (const { batchSize, reward } of batchSizes) {
+                    if (!batchMap.has(batchSize)) {
+                        batchMap.set(batchSize, { totalReward: 0, count: 0 });
+                    }
+                    const entry = batchMap.get(batchSize);
+                    entry.totalReward += reward;
+                    entry.count += 1;
+                }
+                let bestBatchSize = 3;
+                let bestAvgReward = 0;
+                for (const [batchSize, { totalReward, count }] of batchMap.entries()) {
+                    const avgReward = totalReward / count;
+                    if (avgReward > bestAvgReward) {
+                        bestAvgReward = avgReward;
+                        bestBatchSize = batchSize;
+                    }
+                }
+                return bestBatchSize;
+            }
+        }
+        // Default batch size based on complexity
+        switch (taskComplexity) {
+            case 'low':
+                return Math.min(3, estimatedAgentCount);
+            case 'medium':
+                return Math.min(5, estimatedAgentCount);
+            case 'high':
+                return Math.min(7, estimatedAgentCount);
+            case 'critical':
+                return Math.min(10, estimatedAgentCount);
+        }
+    }
+    /**
+     * Get maximum agents for topology (to avoid coordination overhead)
+     */
+    getMaxAgentsForTopology(topology) {
+        switch (topology) {
+            case 'mesh':
+                return 10; // O(n²) coordination overhead beyond this
+            case 'hierarchical':
+                return 50; // Scales well with delegation
+            case 'ring':
+                return 20; // Sequential token passing limits scale
+            case 'star':
+                return 30; // Central coordinator bottleneck
+            default:
+                return 10;
+        }
+    }
+    /**
+     * Generate statistics report on learned patterns
+     */
+    async getOptimizationStats() {
+        const allPatterns = await this.reasoningBank.searchPatterns(this.NAMESPACE, {
+            k: 1000,
+            onlySuccesses: true
+        });
+        const stats = {
+            totalPatterns: allPatterns.length,
+            topologiesUsed: {},
+            speedupByTopology: {},
+            successRates: [],
+            avgSpeedupByTopology: {},
+            avgSuccessRate: 0,
+            bestPerformingTopology: 'hierarchical'
+        };
+        for (const pattern of allPatterns) {
+            try {
+                const metrics = JSON.parse(pattern.output);
+                // Count topology usage
+                stats.topologiesUsed[metrics.topology] = (stats.topologiesUsed[metrics.topology] || 0) + 1;
+                // Track speedup
+                if (!stats.speedupByTopology[metrics.topology]) {
+                    stats.speedupByTopology[metrics.topology] = [];
+                }
+                if (metrics.speedup) {
+                    stats.speedupByTopology[metrics.topology].push(metrics.speedup);
+                }
+                // Track success rate
+                stats.successRates.push(metrics.successRate);
+            }
+            catch (e) {
+                continue;
+            }
+        }
+        // Calculate averages
+        for (const [topology, speedups] of Object.entries(stats.speedupByTopology)) {
+            if (speedups.length > 0) {
+                stats.avgSpeedupByTopology[topology] = speedups.reduce((a, b) => a + b, 0) / speedups.length;
+            }
+        }
+        stats.avgSuccessRate = stats.successRates.length > 0
+            ? stats.successRates.reduce((a, b) => a + b, 0) / stats.successRates.length
+            : 0;
+        // Find best performing topology
+        let bestSpeedup = 0;
+        for (const [topology, avgSpeedup] of Object.entries(stats.avgSpeedupByTopology)) {
+            if (avgSpeedup > bestSpeedup) {
+                bestSpeedup = avgSpeedup;
+                stats.bestPerformingTopology = topology;
+            }
+        }
+        return {
+            totalPatterns: stats.totalPatterns,
+            topologiesUsed: stats.topologiesUsed,
+            avgSpeedupByTopology: stats.avgSpeedupByTopology,
+            avgSuccessRate: Math.round(stats.avgSuccessRate * 10) / 10,
+            bestPerformingTopology: stats.bestPerformingTopology
+        };
+    }
+}
+/**
+ * Auto-select optimal swarm configuration
+ */
+export async function autoSelectSwarmConfig(reasoningBank, taskDescription, options = {}) {
+    const optimizer = new SwarmLearningOptimizer(reasoningBank);
+    const complexity = options.taskComplexity || 'medium';
+    const agentCount = options.estimatedAgentCount || 5;
+    return await optimizer.getOptimization(taskDescription, complexity, agentCount);
+}
+//# sourceMappingURL=swarm-learning-optimizer.js.map

package/agentic-flow/dist/hooks/swarm-learning-optimizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"swarm-learning-optimizer.js","sourceRoot":"","sources":["../../src/hooks/swarm-learning-optimizer.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAsCH,MAAM,OAAO,sBAAsB;IACzB,aAAa,CAAgB;IACpB,SAAS,GAAG,oBAAoB,CAAC;IAElD,YAAY,aAA4B;QACtC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,qBAAqB,CACzB,eAAuB,EACvB,OAAqB,EACrB,OAAgB;QAEhB,MAAM,SAAS,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QAExE,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC;YACpC,SAAS;YACT,IAAI,EAAE,eAAe;YACrB,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,cAAc,EAAE,OAAO,CAAC,cAAc,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC;YACjG,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;YAC/B,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC;YAC9C,OAAO;YACP,SAAS,EAAE,OAAO,CAAC,WAAW;YAC9B,UAAU,EAAE,CAAC,EAAE,oCAAoC;YACnD,QAAQ,EAAE,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC;SAClD,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,OAAqB,EAAE,OAAgB;QAC7D,IAAI,CAAC,OAAO;YAAE,OAAO,GAAG,CAAC;QAEzB,IAAI,MAAM,GAAG,GAAG,CAAC,CAAC,0BAA0B;QAE5C,sCAAsC;QACtC,IAAI,OAAO,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;aAAM,IAAI,OAAO,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;QAED,4BAA4B;QAC5B,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,CAAC;YAChB,CAAC;iBAAM,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAClC,MAAM,IAAI,IAAI,CAAC;YACjB,CAAC;iBAAM,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAClC,MAAM,IAAI,GAAG,CAAC;YAChB,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,MAAM,YAAY,GAAG,CAAC,OAAO,CAAC,UAAU,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;QACvE,IAAI,YAAY,GAAG,GAAG,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,OAAqB,EAAE,OAAgB;QAC9D,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,SAAS,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;QACxE,CAAC;QAED,IAAI,OAAO,CAAC,WAAW,GAAG,EAAE,EAAE,CAAC;YAC7B,SAAS,CAAC,IAAI,CAAC,qBAAqB,OAAO,CAAC,WAAW,+BAA+B,CAAC,CAAC;QAC1F,CAAC;QAED,IAAI,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC;YAC7C,SAAS,CAAC,IAAI,CAAC,oBAAoB,OAAO,CAAC,OAAO,oDAAoD,CAAC,CAAC;QAC1G,CAAC;QAED,IAAI,OAAO,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YAC1B,SAAS,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;QACnF,CAAC;QAED,IAAI,OAAO,CAAC,QAAQ,KAAK,MAAM,IAAI,OAAO,CAAC,UAAU,GAAG,EAAE,EAAE,CAAC;YAC3D,SAAS,CAAC,IAAI,CAAC,6EAA6E,CAAC,CAAC;QAChG,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAC9C,OAAO,sDAAsD,CAAC;YAChE,CAAC;YACD,OAAO,2CAA2C,CAAC;QACrD,CAAC;QAED,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CACnB,eAAuB,EACvB,cAAsD,EACtD,mBAA2B;QAE3B,yCAAyC;QACzC,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,eAAe,EAAE;YAC/E,CAAC,EAAE,EAAE;YACL,SAAS,EAAE,GAAG;YACd,aAAa,EAAE,IAAI;SACpB,CAAC,CAAC;QAEH,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,uDAAuD;YACvD,OAAO,IAAI,CAAC,wBAAwB,CAAC,cAAc,EAAE,mBAAmB,CAAC,CAAC;QAC5E,CAAC;QAED,iDAAiD;QACjD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAsE,CAAC;QAErG,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;YACtC,IAAI,CAAC;gBACH,MAAM,OAAO,GAAiB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACzD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;gBAElC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAClC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC5E,CAAC;gBAED,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;gBAC5C,KAAK,CAAC,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC;gBACpC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;gBACjB,KAAK,CAAC,UAAU,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,CAAC;YAC7C,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,4BAA4B;gBAC5B,SAAS;YACX,CAAC;QACH,CAAC;QAED,yDAAyD;QACzD,IAAI,YAAY,GAAG,cAAc,CAAC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAG,GAAG,CAAC;QACtB,MAAM,YAAY,GAAuE,EAAE,CAAC;QAE5F,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;YACxD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC;YAChD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC;YAChD,MAAM,KAAK,GAAG,SAAS,GAAG,GAAG,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,iBAAiB;YAE3E,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACtB,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;oBAClB,oCAAoC;oBACpC,YAAY,CAAC,IAAI,CAAC;wBAChB,QAAQ,EAAE,YAAY;wBACtB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG;wBAC7C,SAAS,EAAE,oBAAoB,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,cAAc,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,KAAK,aAAa;qBACpH,CAAC,CAAC;gBACL,CAAC;gBACD,SAAS,GAAG,KAAK,CAAC;gBAClB,YAAY,GAAG,QAAQ,CAAC;gBACxB,WAAW,GAAG,UAAU,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,IAAI,CAAC;oBAChB,QAAQ;oBACR,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG;oBACzC,SAAS,EAAE,oBAAoB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,KAAK,aAAa;iBACtF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,6EAA6E;QAC7E,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CAAC,cAAc,EAAE,mBAAmB,EAAE,eAAe,CAAC,CAAC;QAE9G,OAAO;YACL,mBAAmB,EAAE,YAAmB;YACxC,oBAAoB,EAAE,gBAAgB;YACtC,qBAAqB,EAAE,IAAI,CAAC,GAAG,CAAC,mBAAmB,EAAE,IAAI,CAAC,uBAAuB,CAAC,YAAY,CAAC,CAAC;YAChG,eAAe,EAAE,WAAW;YAC5B,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG;YAC7C,SAAS,EAAE,YAAY,eAAe,CAAC,MAAM,kCAAkC;gBACrE,GAAG,YAAY,sBAAsB,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,oBAAoB;YACzF,YAAY,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACnF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,wBAAwB,CAC9B,cAAsD,EACtD,mBAA2B;QAE3B,iEAAiE;QACjE,IAAI,QAAmD,CAAC;QACxD,IAAI,eAAuB,CAAC;QAC5B,IAAI,SAAiB,CAAC;QAEtB,IAAI,mBAAmB,IAAI,CAAC,EAAE,CAAC;YAC7B,QAAQ,GAAG,MAAM,CAAC;YAClB,eAAe,GAAG,GAAG,CAAC;YACtB,SAAS,GAAG,qFAAqF,CAAC;QACpG,CAAC;aAAM,IAAI,mBAAmB,IAAI,EAAE,EAAE,CAAC;YACrC,QAAQ,GAAG,cAAc,CAAC;YAC1B,eAAe,GAAG,GAAG,CAAC;YACtB,SAAS,GAAG,sFAAsF,CAAC;QACrG,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,cAAc,CAAC;YAC1B,eAAe,GAAG,GAAG,CAAC;YACtB,SAAS,GAAG,mGAAmG,CAAC;QAClH,CAAC;QAED,6BAA6B;QAC7B,IAAI,cAAc,KAAK,UAAU,IAAI,cAAc,KAAK,MAAM,EAAE,CAAC;YAC/D,eAAe,IAAI,GAAG,CAAC,CAAC,uDAAuD;QACjF,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,cAAc,EAAE,mBAAmB,EAAE,EAAE,CAAC,CAAC;QAE1F,OAAO;YACL,mBAAmB,EAAE,QAAQ;YAC7B,oBAAoB,EAAE,SAAS;YAC/B,qBAAqB,EAAE,IAAI,CAAC,GAAG,CAAC,mBAAmB,EAAE,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YAC5F,eAAe;YACf,UAAU,EAAE,GAAG,EAAE,4CAA4C;YAC7D,SAAS,EAAE,GAAG,SAAS,qDAAqD;YAC5E,YAAY,EAAE;gBACZ;oBACE,QAAQ,EAAE,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM;oBACvD,UAAU,EAAE,GAAG;oBACf,SAAS,EAAE,uDAAuD;iBACnE;aACF;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,yBAAyB,CAC/B,cAAsD,EACtD,mBAA2B,EAC3B,eAAsB;QAEtB,kDAAkD;QAClD,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,eAAe;iBAC/B,GAAG,CAAC,CAAC,CAAC,EAAE;gBACP,IAAI,CAAC;oBACH,MAAM,OAAO,GAAiB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBACnD,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC5D,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC,CAAC;iBACD,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAiD,CAAC;YAE3E,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,8CAA8C;gBAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkD,CAAC;gBAC3E,KAAK,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;oBAC/C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC7B,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;oBACxD,CAAC;oBACD,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;oBACvC,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC;oBAC5B,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;gBACnB,CAAC;gBAED,IAAI,aAAa,GAAG,CAAC,CAAC;gBACtB,IAAI,aAAa,GAAG,CAAC,CAAC;gBACtB,KAAK,MAAM,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;oBACrE,MAAM,SAAS,GAAG,WAAW,GAAG,KAAK,CAAC;oBACtC,IAAI,SAAS,GAAG,aAAa,EAAE,CAAC;wBAC9B,aAAa,GAAG,SAAS,CAAC;wBAC1B,aAAa,GAAG,SAAS,CAAC;oBAC5B,CAAC;gBACH,CAAC;gBAED,OAAO,aAAa,CAAC;YACvB,CAAC;QACH,CAAC;QAED,yCAAyC;QACzC,QAAQ,cAAc,EAAE,CAAC;YACvB,KAAK,KAAK;gBACR,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC1C,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC1C,KAAK,MAAM;gBACT,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC1C,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,mBAAmB,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,QAAgB;QAC9C,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,MAAM;gBACT,OAAO,EAAE,CAAC,CAAC,0CAA0C;YACvD,KAAK,cAAc;gBACjB,OAAO,EAAE,CAAC,CAAC,8BAA8B;YAC3C,KAAK,MAAM;gBACT,OAAO,EAAE,CAAC,CAAC,wCAAwC;YACrD,KAAK,MAAM;gBACT,OAAO,EAAE,CAAC,CAAC,iCAAiC;YAC9C;gBACE,OAAO,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,oBAAoB;QAOxB,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE;YAC1E,CAAC,EAAE,IAAI;YACP,aAAa,EAAE,IAAI;SACpB,CAAC,CAAC;QAEH,MAAM,KAAK,GAAG;YACZ,aAAa,EAAE,WAAW,CAAC,MAAM;YACjC,cAAc,EAAE,EAA4B;YAC5C,iBAAiB,EAAE,EAA8B;YACjD,YAAY,EAAE,EAAc;YAC5B,oBAAoB,EAAE,EAA4B;YAClD,cAAc,EAAE,CAAC;YACjB,sBAAsB,EAAE,cAAc;SACvC,CAAC;QAEF,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;YAClC,IAAI,CAAC;gBACH,MAAM,OAAO,GAAiB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAEzD,uBAAuB;gBACvB,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAE3F,gBAAgB;gBAChB,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC/C,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;gBACjD,CAAC;gBACD,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;oBACpB,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBAClE,CAAC;gBAED,qBAAqB;gBACrB,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YAC/C,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,SAAS;YACX,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,CAAC;YAC3E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,oBAAoB,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/F,CAAC;QACH,CAAC;QAED,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;YAClD,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM;YAC3E,CAAC,CAAC,CAAC,CAAC;QAEN,gCAAgC;QAChC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,oBAAoB,CAAC,EAAE,CAAC;YAChF,IAAI,UAAU,GAAG,WAAW,EAAE,CAAC;gBAC7B,WAAW,GAAG,UAAU,CAAC;gBACzB,KAAK,CAAC,sBAAsB,GAAG,QAAQ,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,OAAO;YACL,aAAa,EAAE,KAAK,CAAC,aAAa;YAClC,cAAc,EAAE,KAAK,CAAC,cAAc;YACpC,oBAAoB,EAAE,KAAK,CAAC,oBAAoB;YAChD,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,cAAc,GAAG,EAAE,CAAC,GAAG,EAAE;YAC1D,sBAAsB,EAAE,KAAK,CAAC,sBAAsB;SACrD,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,aAA4B,EAC5B,eAAuB,EACvB,UAGI,EAAE;IAEN,MAAM,SAAS,GAAG,IAAI,sBAAsB,CAAC,aAAa,CAAC,CAAC;IAE5D,MAAM,UAAU,GAAG,OAAO,CAAC,cAAc,IAAI,QAAQ,CAAC;IACtD,MAAM,UAAU,GAAG,OAAO,CAAC,mBAAmB,IAAI,CAAC,CAAC;IAEpD,OAAO,MAAM,SAAS,CAAC,eAAe,CAAC,eAAe,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAClF,CAAC","sourcesContent":["/**\n * Swarm Learning Optimizer\n *\n * Enhances parallel execution with adaptive learning, pattern recognition,\n * and automated topology selection using ReasoningBank intelligence.\n */\n\nimport { ReasoningBank } from '../reasoningbank';\n\nexport interface SwarmMetrics {\n  topology: 'mesh' | 'hierarchical' | 'ring' | 'star';\n  agentCount: number;\n  batchSize: number;\n  totalTimeMs: number;\n  successRate: number;\n  speedup?: number;\n  taskComplexity: 'low' | 'medium' | 'high' | 'critical';\n  operations: number;\n}\n\nexport interface LearningPattern {\n  taskType: string;\n  optimalTopology: string;\n  optimalBatchSize: number;\n  expectedSpeedup: number;\n  successRate: number;\n  timestamp: string;\n}\n\nexport interface OptimizationRecommendation {\n  recommendedTopology: 'mesh' | 'hierarchical' | 'ring' | 'star';\n  recommendedBatchSize: number;\n  recommendedAgentCount: number;\n  expectedSpeedup: number;\n  confidence: number;\n  reasoning: string;\n  alternatives: Array<{\n    topology: string;\n    confidence: number;\n    reasoning: string;\n  }>;\n}\n\nexport class SwarmLearningOptimizer {\n  private reasoningBank: ReasoningBank;\n  private readonly NAMESPACE = 'swarm/optimization';\n\n  constructor(reasoningBank: ReasoningBank) {\n    this.reasoningBank = reasoningBank;\n  }\n\n  /**\n   * Store swarm execution metrics for learning\n   */\n  async storeExecutionPattern(\n    taskDescription: string,\n    metrics: SwarmMetrics,\n    success: boolean\n  ): Promise<void> {\n    const sessionId = `${this.NAMESPACE}/${metrics.topology}/${Date.now()}`;\n\n    await this.reasoningBank.storePattern({\n      sessionId,\n      task: taskDescription,\n      input: JSON.stringify({ taskComplexity: metrics.taskComplexity, agentCount: metrics.agentCount }),\n      output: JSON.stringify(metrics),\n      reward: this.calculateReward(metrics, success),\n      success,\n      latencyMs: metrics.totalTimeMs,\n      tokensUsed: 0, // Not tracking tokens for swarm ops\n      critique: this.generateCritique(metrics, success)\n    });\n  }\n\n  /**\n   * Calculate reward score for swarm execution (0-1)\n   */\n  private calculateReward(metrics: SwarmMetrics, success: boolean): number {\n    if (!success) return 0.0;\n\n    let reward = 0.5; // Base reward for success\n\n    // Reward for high success rate (+0.2)\n    if (metrics.successRate >= 90) {\n      reward += 0.2;\n    } else if (metrics.successRate >= 75) {\n      reward += 0.1;\n    }\n\n    // Reward for speedup (+0.2)\n    if (metrics.speedup) {\n      if (metrics.speedup >= 3.0) {\n        reward += 0.2;\n      } else if (metrics.speedup >= 2.0) {\n        reward += 0.15;\n      } else if (metrics.speedup >= 1.5) {\n        reward += 0.1;\n      }\n    }\n\n    // Reward for efficiency (operations/time) (+0.1)\n    const opsPerSecond = (metrics.operations / metrics.totalTimeMs) * 1000;\n    if (opsPerSecond > 0.1) {\n      reward += 0.1;\n    }\n\n    return Math.min(1.0, reward);\n  }\n\n  /**\n   * Generate critique for learning\n   */\n  private generateCritique(metrics: SwarmMetrics, success: boolean): string {\n    const critiques: string[] = [];\n\n    if (!success) {\n      critiques.push('Swarm execution failed - investigate error handling');\n    }\n\n    if (metrics.successRate < 80) {\n      critiques.push(`Low success rate (${metrics.successRate}%) - review agent reliability`);\n    }\n\n    if (metrics.speedup && metrics.speedup < 1.2) {\n      critiques.push(`Minimal speedup (${metrics.speedup}x) - consider different topology or larger batches`);\n    }\n\n    if (metrics.batchSize < 3) {\n      critiques.push('Small batch size - may not fully utilize parallel capabilities');\n    }\n\n    if (metrics.topology === 'mesh' && metrics.agentCount > 10) {\n      critiques.push('Mesh topology with many agents (O(n²) coordination) - consider hierarchical');\n    }\n\n    if (critiques.length === 0) {\n      if (metrics.speedup && metrics.speedup >= 3.0) {\n        return 'Excellent parallel execution - pattern worth reusing';\n      }\n      return 'Good swarm execution - successful pattern';\n    }\n\n    return critiques.join('. ');\n  }\n\n  /**\n   * Get optimization recommendations based on learned patterns\n   */\n  async getOptimization(\n    taskDescription: string,\n    taskComplexity: 'low' | 'medium' | 'high' | 'critical',\n    estimatedAgentCount: number\n  ): Promise<OptimizationRecommendation> {\n    // Search for similar successful patterns\n    const similarPatterns = await this.reasoningBank.searchPatterns(taskDescription, {\n      k: 10,\n      minReward: 0.7,\n      onlySuccesses: true\n    });\n\n    if (similarPatterns.length === 0) {\n      // No learned patterns - return default recommendations\n      return this.getDefaultRecommendation(taskComplexity, estimatedAgentCount);\n    }\n\n    // Analyze patterns to find optimal configuration\n    const topologyScores = new Map<string, { totalReward: number; count: number; avgSpeedup: number }>();\n\n    for (const pattern of similarPatterns) {\n      try {\n        const metrics: SwarmMetrics = JSON.parse(pattern.output);\n        const topology = metrics.topology;\n\n        if (!topologyScores.has(topology)) {\n          topologyScores.set(topology, { totalReward: 0, count: 0, avgSpeedup: 0 });\n        }\n\n        const score = topologyScores.get(topology)!;\n        score.totalReward += pattern.reward;\n        score.count += 1;\n        score.avgSpeedup += metrics.speedup || 1.0;\n      } catch (e) {\n        // Skip invalid pattern data\n        continue;\n      }\n    }\n\n    // Find best topology based on average reward and speedup\n    let bestTopology = 'hierarchical';\n    let bestScore = 0;\n    let bestSpeedup = 1.0;\n    const alternatives: Array<{ topology: string; confidence: number; reasoning: string }> = [];\n\n    for (const [topology, data] of topologyScores.entries()) {\n      const avgReward = data.totalReward / data.count;\n      const avgSpeedup = data.avgSpeedup / data.count;\n      const score = avgReward * 0.6 + (avgSpeedup / 5.0) * 0.4; // Weighted score\n\n      if (score > bestScore) {\n        if (bestScore > 0) {\n          // Previous best becomes alternative\n          alternatives.push({\n            topology: bestTopology,\n            confidence: Math.round(bestScore * 100) / 100,\n            reasoning: `Average speedup: ${bestSpeedup.toFixed(2)}x from ${topologyScores.get(bestTopology)!.count} executions`\n          });\n        }\n        bestScore = score;\n        bestTopology = topology;\n        bestSpeedup = avgSpeedup;\n      } else {\n        alternatives.push({\n          topology,\n          confidence: Math.round(score * 100) / 100,\n          reasoning: `Average speedup: ${avgSpeedup.toFixed(2)}x from ${data.count} executions`\n        });\n      }\n    }\n\n    // Determine optimal batch size based on task complexity and learned patterns\n    const optimalBatchSize = this.determineOptimalBatchSize(taskComplexity, estimatedAgentCount, similarPatterns);\n\n    return {\n      recommendedTopology: bestTopology as any,\n      recommendedBatchSize: optimalBatchSize,\n      recommendedAgentCount: Math.min(estimatedAgentCount, this.getMaxAgentsForTopology(bestTopology)),\n      expectedSpeedup: bestSpeedup,\n      confidence: Math.round(bestScore * 100) / 100,\n      reasoning: `Based on ${similarPatterns.length} similar successful executions. ` +\n                `${bestTopology} topology achieved ${bestSpeedup.toFixed(2)}x average speedup.`,\n      alternatives: alternatives.sort((a, b) => b.confidence - a.confidence).slice(0, 2)\n    };\n  }\n\n  /**\n   * Get default recommendations when no learned patterns exist\n   */\n  private getDefaultRecommendation(\n    taskComplexity: 'low' | 'medium' | 'high' | 'critical',\n    estimatedAgentCount: number\n  ): OptimizationRecommendation {\n    // Default topology selection based on agent count and complexity\n    let topology: 'mesh' | 'hierarchical' | 'ring' | 'star';\n    let expectedSpeedup: number;\n    let reasoning: string;\n\n    if (estimatedAgentCount <= 5) {\n      topology = 'mesh';\n      expectedSpeedup = 2.5;\n      reasoning = 'Mesh topology optimal for small swarms (≤5 agents) - full peer-to-peer coordination';\n    } else if (estimatedAgentCount <= 10) {\n      topology = 'hierarchical';\n      expectedSpeedup = 3.5;\n      reasoning = 'Hierarchical topology optimal for medium swarms (6-10 agents) - efficient delegation';\n    } else {\n      topology = 'hierarchical';\n      expectedSpeedup = 4.0;\n      reasoning = 'Hierarchical topology required for large swarms (>10 agents) - avoids O(n²) coordination overhead';\n    }\n\n    // Adjust for task complexity\n    if (taskComplexity === 'critical' || taskComplexity === 'high') {\n      expectedSpeedup *= 1.2; // Higher complexity benefits more from parallelization\n    }\n\n    const batchSize = this.determineOptimalBatchSize(taskComplexity, estimatedAgentCount, []);\n\n    return {\n      recommendedTopology: topology,\n      recommendedBatchSize: batchSize,\n      recommendedAgentCount: Math.min(estimatedAgentCount, this.getMaxAgentsForTopology(topology)),\n      expectedSpeedup,\n      confidence: 0.6, // Lower confidence without learned patterns\n      reasoning: `${reasoning} (default recommendation - no learned patterns yet)`,\n      alternatives: [\n        {\n          topology: topology === 'mesh' ? 'hierarchical' : 'mesh',\n          confidence: 0.5,\n          reasoning: 'Alternative topology if default does not perform well'\n        }\n      ]\n    };\n  }\n\n  /**\n   * Determine optimal batch size based on complexity and learned patterns\n   */\n  private determineOptimalBatchSize(\n    taskComplexity: 'low' | 'medium' | 'high' | 'critical',\n    estimatedAgentCount: number,\n    learnedPatterns: any[]\n  ): number {\n    // Analyze learned patterns for optimal batch size\n    if (learnedPatterns.length > 0) {\n      const batchSizes = learnedPatterns\n        .map(p => {\n          try {\n            const metrics: SwarmMetrics = JSON.parse(p.output);\n            return { batchSize: metrics.batchSize, reward: p.reward };\n          } catch (e) {\n            return null;\n          }\n        })\n        .filter(x => x !== null) as Array<{ batchSize: number; reward: number }>;\n\n      if (batchSizes.length > 0) {\n        // Find batch size with highest average reward\n        const batchMap = new Map<number, { totalReward: number; count: number }>();\n        for (const { batchSize, reward } of batchSizes) {\n          if (!batchMap.has(batchSize)) {\n            batchMap.set(batchSize, { totalReward: 0, count: 0 });\n          }\n          const entry = batchMap.get(batchSize)!;\n          entry.totalReward += reward;\n          entry.count += 1;\n        }\n\n        let bestBatchSize = 3;\n        let bestAvgReward = 0;\n        for (const [batchSize, { totalReward, count }] of batchMap.entries()) {\n          const avgReward = totalReward / count;\n          if (avgReward > bestAvgReward) {\n            bestAvgReward = avgReward;\n            bestBatchSize = batchSize;\n          }\n        }\n\n        return bestBatchSize;\n      }\n    }\n\n    // Default batch size based on complexity\n    switch (taskComplexity) {\n      case 'low':\n        return Math.min(3, estimatedAgentCount);\n      case 'medium':\n        return Math.min(5, estimatedAgentCount);\n      case 'high':\n        return Math.min(7, estimatedAgentCount);\n      case 'critical':\n        return Math.min(10, estimatedAgentCount);\n    }\n  }\n\n  /**\n   * Get maximum agents for topology (to avoid coordination overhead)\n   */\n  private getMaxAgentsForTopology(topology: string): number {\n    switch (topology) {\n      case 'mesh':\n        return 10; // O(n²) coordination overhead beyond this\n      case 'hierarchical':\n        return 50; // Scales well with delegation\n      case 'ring':\n        return 20; // Sequential token passing limits scale\n      case 'star':\n        return 30; // Central coordinator bottleneck\n      default:\n        return 10;\n    }\n  }\n\n  /**\n   * Generate statistics report on learned patterns\n   */\n  async getOptimizationStats(): Promise<{\n    totalPatterns: number;\n    topologiesUsed: Record<string, number>;\n    avgSpeedupByTopology: Record<string, number>;\n    avgSuccessRate: number;\n    bestPerformingTopology: string;\n  }> {\n    const allPatterns = await this.reasoningBank.searchPatterns(this.NAMESPACE, {\n      k: 1000,\n      onlySuccesses: true\n    });\n\n    const stats = {\n      totalPatterns: allPatterns.length,\n      topologiesUsed: {} as Record<string, number>,\n      speedupByTopology: {} as Record<string, number[]>,\n      successRates: [] as number[],\n      avgSpeedupByTopology: {} as Record<string, number>,\n      avgSuccessRate: 0,\n      bestPerformingTopology: 'hierarchical'\n    };\n\n    for (const pattern of allPatterns) {\n      try {\n        const metrics: SwarmMetrics = JSON.parse(pattern.output);\n\n        // Count topology usage\n        stats.topologiesUsed[metrics.topology] = (stats.topologiesUsed[metrics.topology] || 0) + 1;\n\n        // Track speedup\n        if (!stats.speedupByTopology[metrics.topology]) {\n          stats.speedupByTopology[metrics.topology] = [];\n        }\n        if (metrics.speedup) {\n          stats.speedupByTopology[metrics.topology].push(metrics.speedup);\n        }\n\n        // Track success rate\n        stats.successRates.push(metrics.successRate);\n      } catch (e) {\n        continue;\n      }\n    }\n\n    // Calculate averages\n    for (const [topology, speedups] of Object.entries(stats.speedupByTopology)) {\n      if (speedups.length > 0) {\n        stats.avgSpeedupByTopology[topology] = speedups.reduce((a, b) => a + b, 0) / speedups.length;\n      }\n    }\n\n    stats.avgSuccessRate = stats.successRates.length > 0\n      ? stats.successRates.reduce((a, b) => a + b, 0) / stats.successRates.length\n      : 0;\n\n    // Find best performing topology\n    let bestSpeedup = 0;\n    for (const [topology, avgSpeedup] of Object.entries(stats.avgSpeedupByTopology)) {\n      if (avgSpeedup > bestSpeedup) {\n        bestSpeedup = avgSpeedup;\n        stats.bestPerformingTopology = topology;\n      }\n    }\n\n    return {\n      totalPatterns: stats.totalPatterns,\n      topologiesUsed: stats.topologiesUsed,\n      avgSpeedupByTopology: stats.avgSpeedupByTopology,\n      avgSuccessRate: Math.round(stats.avgSuccessRate * 10) / 10,\n      bestPerformingTopology: stats.bestPerformingTopology\n    };\n  }\n}\n\n/**\n * Auto-select optimal swarm configuration\n */\nexport async function autoSelectSwarmConfig(\n  reasoningBank: ReasoningBank,\n  taskDescription: string,\n  options: {\n    taskComplexity?: 'low' | 'medium' | 'high' | 'critical';\n    estimatedAgentCount?: number;\n  } = {}\n): Promise<OptimizationRecommendation> {\n  const optimizer = new SwarmLearningOptimizer(reasoningBank);\n\n  const complexity = options.taskComplexity || 'medium';\n  const agentCount = options.estimatedAgentCount || 5;\n\n  return await optimizer.getOptimization(taskDescription, complexity, agentCount);\n}\n"]}

package/agentic-flow/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA,OAAO,kCAAkC,CAAC;AAE1C,OAAO,eAAe,CAAC;AAavB,OAAO,KAAK,aAAa,MAAM,0BAA0B,CAAC"}

package/agentic-flow/dist/index.js

@@ -0,0 +1,210 @@
+// Apply AgentDB runtime patch before any imports
+import "./utils/agentdb-runtime-patch.js";
+import "dotenv/config";
+import { webResearchAgent } from "./agents/webResearchAgent.js";
+import { codeReviewAgent } from "./agents/codeReviewAgent.js";
+import { dataAgent } from "./agents/dataAgent.js";
+import { claudeAgent } from "./agents/claudeAgent.js";
+import { logger } from "./utils/logger.js";
+import { startHealthServer } from "./health.js";
+import { parseArgs, printHelp, validateOptions } from "./utils/cli.js";
+import { getAgent, listAgents } from "./utils/agentLoader.js";
+import { handleMCPCommand } from "./utils/mcpCommands.js";
+import { handleReasoningBankCommand } from "./utils/reasoningbankCommands.js";
+// Re-export ReasoningBank plugin for npm package users
+export * as reasoningbank from "./reasoningbank/index.js";
+async function runParallelMode() {
+    const topic = process.env.TOPIC ?? "migrate payments service";
+    const codeDiff = process.env.DIFF ?? "feat: add payments router and mandate checks";
+    const datasetHint = process.env.DATASET ?? "monthly tx volume, refunds, chargebacks";
+    logger.info('Starting parallel agent execution', {
+        topic,
+        diff: codeDiff.substring(0, 50),
+        dataset: datasetHint
+    });
+    // Stream handler for real-time output
+    const streamHandler = (agent) => (chunk) => {
+        if (process.env.ENABLE_STREAMING === 'true') {
+            process.stdout.write(`[${agent}] ${chunk}`);
+        }
+    };
+    // Each agent runs with its own context. Fan out in parallel.
+    const startTime = Date.now();
+    const [researchOut, reviewOut, dataOut] = await Promise.all([
+        webResearchAgent(`Give me context and risks about: ${topic}`, streamHandler('RESEARCH')),
+        codeReviewAgent(`Review this diff at a high level and propose tests:\n${codeDiff}`, streamHandler('CODE_REVIEW')),
+        dataAgent(`Analyze ${datasetHint} and report key stats.`, streamHandler('DATA'))
+    ]);
+    const totalDuration = Date.now() - startTime;
+    logger.info('All agents completed', {
+        totalDuration,
+        agentCount: 3,
+        avgDuration: Math.round(totalDuration / 3)
+    });
+    // Basic reconcile step
+    const summary = [
+        "=== RESEARCH ===",
+        researchOut.output?.trim() ?? "",
+        "=== CODE REVIEW ===",
+        reviewOut.output?.trim() ?? "",
+        "=== DATA ===",
+        dataOut.output?.trim() ?? ""
+    ].join("\n");
+    console.log(summary);
+}
+async function runAgentMode(agentName, task, stream, modelOverride) {
+    logger.info('Running agent mode', { agent: agentName, task: task.substring(0, 100), model: modelOverride || 'default' });
+    // Load the specified agent
+    const agent = getAgent(agentName);
+    if (!agent) {
+        const availableAgents = listAgents();
+        logger.error('Agent not found', { agent: agentName });
+        console.error(`\n❌ Agent '${agentName}' not found.\n`);
+        console.error('Available agents:');
+        availableAgents.slice(0, 20).forEach(a => {
+            console.error(`  • ${a.name}: ${a.description.substring(0, 80)}...`);
+        });
+        if (availableAgents.length > 20) {
+            console.error(`  ... and ${availableAgents.length - 20} more (use --list to see all)`);
+        }
+        process.exit(1);
+    }
+    console.log(`\n🤖 Agent: ${agent.name}`);
+    console.log(`📝 Description: ${agent.description}\n`);
+    console.log(`🎯 Task: ${task}\n`);
+    if (modelOverride) {
+        console.log(`🔧 Model: ${modelOverride}\n`);
+    }
+    console.log('⏳ Running...\n');
+    // Enhanced stream handler that writes to stderr for progress and stdout for content
+    const streamHandler = stream ? (chunk) => {
+        // Write progress indicators (timestamps, tool calls) to stderr
+        if (chunk.startsWith('\n[') || chunk.startsWith('[') || chunk.includes('🔍') || chunk.includes('✅') || chunk.includes('❌')) {
+            process.stderr.write(chunk);
+        }
+        else {
+            // Write text content to stdout
+            process.stdout.write(chunk);
+        }
+        // Force flush to ensure immediate visibility
+        if (process.stdout.uncork) {
+            process.stdout.uncork();
+        }
+        if (process.stderr.uncork) {
+            process.stderr.uncork();
+        }
+    } : undefined;
+    // Use Claude Agent SDK with in-SDK MCP server and optional model override
+    logger.info('Using Claude Agent SDK with in-SDK MCP server', { modelOverride });
+    const result = await claudeAgent(agent, task, streamHandler, modelOverride);
+    if (!stream) {
+        console.log('\n✅ Completed!\n');
+        console.log('═══════════════════════════════════════\n');
+        console.log(result.output);
+        console.log('\n═══════════════════════════════════════\n');
+    }
+    logger.info('Agent mode completed', { agent: agentName, outputLength: result.output.length, model: modelOverride || 'default' });
+}
+function runListMode() {
+    const agents = listAgents();
+    console.log(`\n📦 Available Agents (${agents.length} total)\n`);
+    // Group by category (based on directory structure)
+    const grouped = new Map();
+    agents.forEach(agent => {
+        const parts = agent.filePath.split('/');
+        const category = parts[parts.length - 2] || 'other';
+        if (!grouped.has(category)) {
+            grouped.set(category, []);
+        }
+        grouped.get(category).push(agent);
+    });
+    // Print grouped
+    Array.from(grouped.entries())
+        .sort(([a], [b]) => a.localeCompare(b))
+        .forEach(([category, categoryAgents]) => {
+        console.log(`\n${category.toUpperCase()}:`);
+        categoryAgents.forEach(agent => {
+            console.log(`  ${agent.name.padEnd(30)} ${agent.description.substring(0, 80)}`);
+        });
+    });
+    console.log(`\nTo use an agent:`);
+    console.log(`  docker run --env-file .env claude-agents --agent <name> --task "Your task"\n`);
+}
+async function main() {
+    logger.setContext({ service: 'claude-agents', version: '1.0.0' });
+    // Parse CLI arguments
+    const options = parseArgs();
+    // Handle help
+    if (options.help) {
+        printHelp();
+        process.exit(0);
+    }
+    // Handle list mode
+    if (options.mode === 'list') {
+        runListMode();
+        process.exit(0);
+    }
+    // Handle MCP mode
+    if (options.mode === 'mcp') {
+        await handleMCPCommand(options.mcpCommand || 'start', options.mcpServer || 'all');
+        process.exit(0);
+    }
+    // Handle ReasoningBank mode
+    if (options.mode === 'reasoningbank') {
+        const subcommand = process.argv[3] || 'help';
+        await handleReasoningBankCommand(subcommand);
+        process.exit(0);
+    }
+    // Validate options
+    const validationError = validateOptions(options);
+    if (validationError) {
+        console.error(`\n❌ ${validationError}\n`);
+        printHelp();
+        process.exit(1);
+    }
+    logger.info('Starting Claude Agent SDK', { mode: options.mode });
+    // Propagate CLI options to environment variables for agent execution
+    if (options.provider) {
+        process.env.PROVIDER = options.provider;
+        logger.info('Provider set from CLI', { provider: options.provider });
+    }
+    if (options.anthropicApiKey) {
+        process.env.ANTHROPIC_API_KEY = options.anthropicApiKey;
+    }
+    if (options.openrouterApiKey) {
+        process.env.OPENROUTER_API_KEY = options.openrouterApiKey;
+    }
+    if (options.model) {
+        process.env.COMPLETION_MODEL = options.model;
+    }
+    // Start health check server
+    const healthPort = parseInt(process.env.HEALTH_PORT || '8080');
+    const healthServer = startHealthServer(healthPort);
+    try {
+        if (options.mode === 'agent') {
+            const task = options.task || process.env.TASK || '';
+            const agent = options.agent || process.env.AGENT || '';
+            const model = options.model || process.env.MODEL;
+            await runAgentMode(agent, task, options.stream || false, model);
+        }
+        else {
+            await runParallelMode();
+        }
+        logger.info('Execution completed successfully');
+    }
+    catch (err) {
+        logger.error('Execution failed', { error: err });
+        throw err;
+    }
+    finally {
+        // Keep health server running for container health checks
+        if (process.env.KEEP_ALIVE !== 'true') {
+            healthServer.close();
+        }
+    }
+}
+main().catch(err => {
+    console.error(err);
+    process.exit(1);
+});
+//# sourceMappingURL=index.js.map

package/agentic-flow/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,iDAAiD;AACjD,OAAO,kCAAkC,CAAC;AAE1C,OAAO,eAAe,CAAC;AACvB,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACvE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AAC9D,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,0BAA0B,EAAE,MAAM,kCAAkC,CAAC;AAE9E,uDAAuD;AACvD,OAAO,KAAK,aAAa,MAAM,0BAA0B,CAAC;AAE1D,KAAK,UAAU,eAAe;IAC5B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,0BAA0B,CAAC;IAC9D,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,8CAA8C,CAAC;IACpF,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,IAAI,yCAAyC,CAAC;IAErF,MAAM,CAAC,IAAI,CAAC,mCAAmC,EAAE;QAC/C,KAAK;QACL,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC;QAC/B,OAAO,EAAE,WAAW;KACrB,CAAC,CAAC;IAEH,sCAAsC;IACtC,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,CAAC,KAAa,EAAE,EAAE;QACzD,IAAI,OAAO,CAAC,GAAG,CAAC,gBAAgB,KAAK,MAAM,EAAE,CAAC;YAC5C,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC,CAAC;IAEF,6DAA6D;IAC7D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,CAAC,WAAW,EAAE,SAAS,EAAE,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QAC1D,gBAAgB,CAAC,oCAAoC,KAAK,EAAE,EAAE,aAAa,CAAC,UAAU,CAAC,CAAC;QACxF,eAAe,CAAC,wDAAwD,QAAQ,EAAE,EAAE,aAAa,CAAC,aAAa,CAAC,CAAC;QACjH,SAAS,CAAC,WAAW,WAAW,wBAAwB,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;KACjF,CAAC,CAAC;IACH,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAE7C,MAAM,CAAC,IAAI,CAAC,sBAAsB,EAAE;QAClC,aAAa;QACb,UAAU,EAAE,CAAC;QACb,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC;KAC3C,CAAC,CAAC;IAEH,uBAAuB;IACvB,MAAM,OAAO,GAAG;QACd,kBAAkB;QAClB,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE;QAChC,qBAAqB;QACrB,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE;QAC9B,cAAc;QACd,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE;KAC7B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEb,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;AACvB,CAAC;AAED,KAAK,UAAU,YAAY,CAAC,SAAiB,EAAE,IAAY,EAAE,MAAe,EAAE,aAAsB;IAClG,MAAM,CAAC,IAAI,CAAC,oBAAoB,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,aAAa,IAAI,SAAS,EAAE,CAAC,CAAC;IAEzH,2BAA2B;IAC3B,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IAElC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,eAAe,GAAG,UAAU,EAAE,CAAC;QACrC,MAAM,CAAC,KAAK,CAAC,iBAAiB,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;QACtD,OAAO,CAAC,KAAK,CAAC,cAAc,SAAS,gBAAgB,CAAC,CAAC;QACvD,OAAO,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;QACnC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACvC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;QACH,IAAI,eAAe,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YAChC,OAAO,CAAC,KAAK,CAAC,aAAa,eAAe,CAAC,MAAM,GAAG,EAAE,+BAA+B,CAAC,CAAC;QACzF,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,eAAe,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACzC,OAAO,CAAC,GAAG,CAAC,mBAAmB,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;IACtD,OAAO,CAAC,GAAG,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC;IAClC,IAAI,aAAa,EAAE,CAAC;QAClB,OAAO,CAAC,GAAG,CAAC,aAAa,aAAa,IAAI,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;IAE9B,oFAAoF;IACpF,MAAM,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,KAAa,EAAE,EAAE;QAC/C,+DAA+D;QAC/D,IAAI,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3H,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,+BAA+B;YAC/B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QAED,6CAA6C;QAC7C,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YAC1B,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QAC1B,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YAC1B,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QAC1B,CAAC;IACH,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAEd,0EAA0E;IAC1E,MAAM,CAAC,IAAI,CAAC,+CAA+C,EAAE,EAAE,aAAa,EAAE,CAAC,CAAC;IAChF,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;IAE5E,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;QAChC,OAAO,CAAC,GAAG,CAAC,2CAA2C,CAAC,CAAC;QACzD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,6CAA6C,CAAC,CAAC;IAC7D,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,sBAAsB,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,aAAa,IAAI,SAAS,EAAE,CAAC,CAAC;AACnI,CAAC;AAED,SAAS,WAAW;IAClB,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAE5B,OAAO,CAAC,GAAG,CAAC,0BAA0B,MAAM,CAAC,MAAM,WAAW,CAAC,CAAC;IAEhE,mDAAmD;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEjD,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACrB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,OAAO,CAAC;QACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,gBAAgB;IAChB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;SAC1B,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;SACtC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,cAAc,CAAC,EAAE,EAAE;QACtC,OAAO,CAAC,GAAG,CAAC,KAAK,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;QAC5C,cAAc,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YAC7B,OAAO,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEL,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;IAClC,OAAO,CAAC,GAAG,CAAC,gFAAgF,CAAC,CAAC;AAChG,CAAC;AAED,KAAK,UAAU,IAAI;IACjB,MAAM,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;IAElE,sBAAsB;IACtB,MAAM,OAAO,GAAG,SAAS,EAAE,CAAC;IAE5B,cAAc;IACd,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;QACjB,SAAS,EAAE,CAAC;QACZ,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,mBAAmB;IACnB,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC5B,WAAW,EAAE,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,kBAAkB;IAClB,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC3B,MAAM,gBAAgB,CAAC,OAAO,CAAC,UAAU,IAAI,OAAO,EAAE,OAAO,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;QAClF,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,4BAA4B;IAC5B,IAAI,OAAO,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;QACrC,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;QAC7C,MAAM,0BAA0B,CAAC,UAAU,CAAC,CAAC;QAC7C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,mBAAmB;IACnB,MAAM,eAAe,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IACjD,IAAI,eAAe,EAAE,CAAC;QACpB,OAAO,CAAC,KAAK,CAAC,OAAO,eAAe,IAAI,CAAC,CAAC;QAC1C,SAAS,EAAE,CAAC;QACZ,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,2BAA2B,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IAEjE,qEAAqE;IACrE,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACrB,OAAO,CAAC,GAAG,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,uBAAuB,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;IACvE,CAAC;IACD,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;QAC5B,OAAO,CAAC,GAAG,CAAC,iBAAiB,GAAG,OAAO,CAAC,eAAe,CAAC;IAC1D,CAAC;IACD,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC7B,OAAO,CAAC,GAAG,CAAC,kBAAkB,GAAG,OAAO,CAAC,gBAAgB,CAAC;IAC5D,CAAC;IACD,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,OAAO,CAAC,GAAG,CAAC,gBAAgB,GAAG,OAAO,CAAC,KAAK,CAAC;IAC/C,CAAC;IAED,4BAA4B;IAC5B,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,IAAI,MAAM,CAAC,CAAC;IAC/D,MAAM,YAAY,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC;IAEnD,IAAI,CAAC;QACH,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YACpD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;YACvD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;YACjD,MAAM,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,MAAM,IAAI,KAAK,EAAE,KAAK,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACN,MAAM,eAAe,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;IAClD,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,kBAAkB,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QACjD,MAAM,GAAG,CAAC;IACZ,CAAC;YAAS,CAAC;QACT,yDAAyD;QACzD,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;YACtC,YAAY,CAAC,KAAK,EAAE,CAAC;QACvB,CAAC;IACH,CAAC;AACH,CAAC;AAED,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;IACjB,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACnB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC,CAAC","sourcesContent":["// Apply AgentDB runtime patch before any imports\nimport \"./utils/agentdb-runtime-patch.js\";\n\nimport \"dotenv/config\";\nimport { webResearchAgent } from \"./agents/webResearchAgent.js\";\nimport { codeReviewAgent } from \"./agents/codeReviewAgent.js\";\nimport { dataAgent } from \"./agents/dataAgent.js\";\nimport { claudeAgent } from \"./agents/claudeAgent.js\";\nimport { logger } from \"./utils/logger.js\";\nimport { startHealthServer } from \"./health.js\";\nimport { parseArgs, printHelp, validateOptions } from \"./utils/cli.js\";\nimport { getAgent, listAgents } from \"./utils/agentLoader.js\";\nimport { handleMCPCommand } from \"./utils/mcpCommands.js\";\nimport { handleReasoningBankCommand } from \"./utils/reasoningbankCommands.js\";\n\n// Re-export ReasoningBank plugin for npm package users\nexport * as reasoningbank from \"./reasoningbank/index.js\";\n\nasync function runParallelMode() {\n  const topic = process.env.TOPIC ?? \"migrate payments service\";\n  const codeDiff = process.env.DIFF ?? \"feat: add payments router and mandate checks\";\n  const datasetHint = process.env.DATASET ?? \"monthly tx volume, refunds, chargebacks\";\n\n  logger.info('Starting parallel agent execution', {\n    topic,\n    diff: codeDiff.substring(0, 50),\n    dataset: datasetHint\n  });\n\n  // Stream handler for real-time output\n  const streamHandler = (agent: string) => (chunk: string) => {\n    if (process.env.ENABLE_STREAMING === 'true') {\n      process.stdout.write(`[${agent}] ${chunk}`);\n    }\n  };\n\n  // Each agent runs with its own context. Fan out in parallel.\n  const startTime = Date.now();\n  const [researchOut, reviewOut, dataOut] = await Promise.all([\n    webResearchAgent(`Give me context and risks about: ${topic}`, streamHandler('RESEARCH')),\n    codeReviewAgent(`Review this diff at a high level and propose tests:\\n${codeDiff}`, streamHandler('CODE_REVIEW')),\n    dataAgent(`Analyze ${datasetHint} and report key stats.`, streamHandler('DATA'))\n  ]);\n  const totalDuration = Date.now() - startTime;\n\n  logger.info('All agents completed', {\n    totalDuration,\n    agentCount: 3,\n    avgDuration: Math.round(totalDuration / 3)\n  });\n\n  // Basic reconcile step\n  const summary = [\n    \"=== RESEARCH ===\",\n    researchOut.output?.trim() ?? \"\",\n    \"=== CODE REVIEW ===\",\n    reviewOut.output?.trim() ?? \"\",\n    \"=== DATA ===\",\n    dataOut.output?.trim() ?? \"\"\n  ].join(\"\\n\");\n\n  console.log(summary);\n}\n\nasync function runAgentMode(agentName: string, task: string, stream: boolean, modelOverride?: string) {\n  logger.info('Running agent mode', { agent: agentName, task: task.substring(0, 100), model: modelOverride || 'default' });\n\n  // Load the specified agent\n  const agent = getAgent(agentName);\n\n  if (!agent) {\n    const availableAgents = listAgents();\n    logger.error('Agent not found', { agent: agentName });\n    console.error(`\\n❌ Agent '${agentName}' not found.\\n`);\n    console.error('Available agents:');\n    availableAgents.slice(0, 20).forEach(a => {\n      console.error(`  • ${a.name}: ${a.description.substring(0, 80)}...`);\n    });\n    if (availableAgents.length > 20) {\n      console.error(`  ... and ${availableAgents.length - 20} more (use --list to see all)`);\n    }\n    process.exit(1);\n  }\n\n  console.log(`\\n🤖 Agent: ${agent.name}`);\n  console.log(`📝 Description: ${agent.description}\\n`);\n  console.log(`🎯 Task: ${task}\\n`);\n  if (modelOverride) {\n    console.log(`🔧 Model: ${modelOverride}\\n`);\n  }\n  console.log('⏳ Running...\\n');\n\n  // Enhanced stream handler that writes to stderr for progress and stdout for content\n  const streamHandler = stream ? (chunk: string) => {\n    // Write progress indicators (timestamps, tool calls) to stderr\n    if (chunk.startsWith('\\n[') || chunk.startsWith('[') || chunk.includes('🔍') || chunk.includes('✅') || chunk.includes('❌')) {\n      process.stderr.write(chunk);\n    } else {\n      // Write text content to stdout\n      process.stdout.write(chunk);\n    }\n\n    // Force flush to ensure immediate visibility\n    if (process.stdout.uncork) {\n      process.stdout.uncork();\n    }\n    if (process.stderr.uncork) {\n      process.stderr.uncork();\n    }\n  } : undefined;\n\n  // Use Claude Agent SDK with in-SDK MCP server and optional model override\n  logger.info('Using Claude Agent SDK with in-SDK MCP server', { modelOverride });\n  const result = await claudeAgent(agent, task, streamHandler, modelOverride);\n\n  if (!stream) {\n    console.log('\\n✅ Completed!\\n');\n    console.log('═══════════════════════════════════════\\n');\n    console.log(result.output);\n    console.log('\\n═══════════════════════════════════════\\n');\n  }\n\n  logger.info('Agent mode completed', { agent: agentName, outputLength: result.output.length, model: modelOverride || 'default' });\n}\n\nfunction runListMode() {\n  const agents = listAgents();\n\n  console.log(`\\n📦 Available Agents (${agents.length} total)\\n`);\n\n  // Group by category (based on directory structure)\n  const grouped = new Map<string, typeof agents>();\n\n  agents.forEach(agent => {\n    const parts = agent.filePath.split('/');\n    const category = parts[parts.length - 2] || 'other';\n    if (!grouped.has(category)) {\n      grouped.set(category, []);\n    }\n    grouped.get(category)!.push(agent);\n  });\n\n  // Print grouped\n  Array.from(grouped.entries())\n    .sort(([a], [b]) => a.localeCompare(b))\n    .forEach(([category, categoryAgents]) => {\n      console.log(`\\n${category.toUpperCase()}:`);\n      categoryAgents.forEach(agent => {\n        console.log(`  ${agent.name.padEnd(30)} ${agent.description.substring(0, 80)}`);\n      });\n    });\n\n  console.log(`\\nTo use an agent:`);\n  console.log(`  docker run --env-file .env claude-agents --agent <name> --task \"Your task\"\\n`);\n}\n\nasync function main() {\n  logger.setContext({ service: 'claude-agents', version: '1.0.0' });\n\n  // Parse CLI arguments\n  const options = parseArgs();\n\n  // Handle help\n  if (options.help) {\n    printHelp();\n    process.exit(0);\n  }\n\n  // Handle list mode\n  if (options.mode === 'list') {\n    runListMode();\n    process.exit(0);\n  }\n\n  // Handle MCP mode\n  if (options.mode === 'mcp') {\n    await handleMCPCommand(options.mcpCommand || 'start', options.mcpServer || 'all');\n    process.exit(0);\n  }\n\n  // Handle ReasoningBank mode\n  if (options.mode === 'reasoningbank') {\n    const subcommand = process.argv[3] || 'help';\n    await handleReasoningBankCommand(subcommand);\n    process.exit(0);\n  }\n\n  // Validate options\n  const validationError = validateOptions(options);\n  if (validationError) {\n    console.error(`\\n❌ ${validationError}\\n`);\n    printHelp();\n    process.exit(1);\n  }\n\n  logger.info('Starting Claude Agent SDK', { mode: options.mode });\n\n  // Propagate CLI options to environment variables for agent execution\n  if (options.provider) {\n    process.env.PROVIDER = options.provider;\n    logger.info('Provider set from CLI', { provider: options.provider });\n  }\n  if (options.anthropicApiKey) {\n    process.env.ANTHROPIC_API_KEY = options.anthropicApiKey;\n  }\n  if (options.openrouterApiKey) {\n    process.env.OPENROUTER_API_KEY = options.openrouterApiKey;\n  }\n  if (options.model) {\n    process.env.COMPLETION_MODEL = options.model;\n  }\n\n  // Start health check server\n  const healthPort = parseInt(process.env.HEALTH_PORT || '8080');\n  const healthServer = startHealthServer(healthPort);\n\n  try {\n    if (options.mode === 'agent') {\n      const task = options.task || process.env.TASK || '';\n      const agent = options.agent || process.env.AGENT || '';\n      const model = options.model || process.env.MODEL;\n      await runAgentMode(agent, task, options.stream || false, model);\n    } else {\n      await runParallelMode();\n    }\n\n    logger.info('Execution completed successfully');\n  } catch (err: unknown) {\n    logger.error('Execution failed', { error: err });\n    throw err;\n  } finally {\n    // Keep health server running for container health checks\n    if (process.env.KEEP_ALIVE !== 'true') {\n      healthServer.close();\n    }\n  }\n}\n\nmain().catch(err => {\n  console.error(err);\n  process.exit(1);\n});\n"]}