agentic-flow 3.0.0-alpha.2 → 3.1.0

package/dist/coordination/graph-state-manager.js

@@ -1,118 +0,0 @@
-/**
- * Graph-Based Agent State Management
- * Uses @ruvector/graph-node for hypergraph state tracking.
- * Falls back to in-memory maps when the native backend is unavailable.
- */
-export class GraphStateManager {
-    graphDb = null;
-    available = false;
-    nodes = new Map();
-    edges = [];
-    /**
-     * Attempt to load @ruvector/graph-node.
-     * Returns true if the native graph backend is available.
-     */
-    async initialize() {
-        try {
-            const graphModule = await import('@ruvector/graph-node');
-            const GraphDB = graphModule.GraphDB || graphModule.default;
-            if (GraphDB) {
-                this.graphDb = new GraphDB();
-                this.available = true;
-            }
-            return this.available;
-        }
-        catch {
-            this.available = false;
-            return false;
-        }
-    }
-    /**
-     * Add a node to the graph. Persists in the native backend when available.
-     */
-    async addNode(node) {
-        this.nodes.set(node.id, node);
-        if (this.graphDb) {
-            try {
-                await this.graphDb.addNode(node);
-            }
-            catch { /* in-memory fallback already persisted */ }
-        }
-    }
-    /**
-     * Add an edge between two nodes.
-     */
-    async addEdge(edge) {
-        this.edges.push(edge);
-        if (this.graphDb) {
-            try {
-                await this.graphDb.addEdge(edge.from, edge.type, edge.to, edge.properties);
-            }
-            catch { /* in-memory fallback already persisted */ }
-        }
-    }
-    /**
-     * Remove a node and all associated edges.
-     */
-    async removeNode(nodeId) {
-        this.nodes.delete(nodeId);
-        this.edges = this.edges.filter(e => e.from !== nodeId && e.to !== nodeId);
-        if (this.graphDb) {
-            try {
-                await this.graphDb.removeNode(nodeId);
-            }
-            catch { /* in-memory already cleaned */ }
-        }
-    }
-    /**
-     * Query the graph. Falls back to returning all nodes of matching type.
-     */
-    async query(cypher) {
-        if (this.graphDb) {
-            try {
-                return await this.graphDb.query(cypher);
-            }
-            catch { /* fall through to in-memory */ }
-        }
-        // Simple in-memory query: extract type filter from MATCH (:Type) patterns
-        const typeMatch = cypher.match(/:\s*(\w+)/);
-        if (typeMatch) {
-            const filterType = typeMatch[1].toLowerCase();
-            return Array.from(this.nodes.values()).filter(n => n.type.toLowerCase() === filterType);
-        }
-        return Array.from(this.nodes.values());
-    }
-    /**
-     * Get all edges connected to a node.
-     */
-    async getRelationships(nodeId) {
-        return this.edges.filter(e => e.from === nodeId || e.to === nodeId);
-    }
-    /**
-     * Get a specific node by ID.
-     */
-    getNode(nodeId) {
-        return this.nodes.get(nodeId);
-    }
-    /**
-     * Get all nodes of a given type.
-     */
-    getNodesByType(type) {
-        return Array.from(this.nodes.values()).filter(n => n.type === type);
-    }
-    /**
-     * Return current graph statistics.
-     */
-    getStats() {
-        return {
-            nodes: this.nodes.size,
-            edges: this.edges.length,
-            available: this.available,
-        };
-    }
-    isAvailable() {
-        return this.available;
-    }
-}
-export const graphStateManager = new GraphStateManager();
-//# sourceMappingURL=graph-state-manager.js.map

package/dist/coordination/graph-state-manager.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-state-manager.js","sourceRoot":"","sources":["../../src/coordination/graph-state-manager.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAsBH,MAAM,OAAO,iBAAiB;IACpB,OAAO,GAAQ,IAAI,CAAC;IACpB,SAAS,GAAG,KAAK,CAAC;IAClB,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;IACrC,KAAK,GAAgB,EAAE,CAAC;IAEhC;;;OAGG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,CAAC;YACH,MAAM,WAAW,GAAG,MAAM,MAAM,CAAC,sBAAsB,CAAC,CAAC;YACzD,MAAM,OAAO,GAAI,WAAmB,CAAC,OAAO,IAAK,WAAmB,CAAC,OAAO,CAAC;YAC7E,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,CAAC,OAAO,GAAG,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACxB,CAAC;YACD,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,IAAe;QAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC;gBACH,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnC,CAAC;YAAC,MAAM,CAAC,CAAC,0CAA0C,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,IAAe;QAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC;gBACH,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YAC7E,CAAC;YAAC,MAAM,CAAC,CAAC,0CAA0C,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,MAAc;QAC7B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC;gBACH,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YACxC,CAAC;YAAC,MAAM,CAAC,CAAC,+BAA+B,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CAAC,MAAc;QACxB,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC;gBACH,OAAO,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC1C,CAAC;YAAC,MAAM,CAAC,CAAC,+BAA+B,CAAC,CAAC;QAC7C,CAAC;QAED,0EAA0E;QAC1E,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YAC9C,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAC3C,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,UAAU,CACzC,CAAC;QACJ,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CAAC,MAAc;QACnC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IACtE,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,IAAuB;QACpC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACtE,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACtB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;YACxB,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC;IACJ,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;CACF;AAED,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,iBAAiB,EAAE,CAAC","sourcesContent":["/**\n * Graph-Based Agent State Management\n * Uses @ruvector/graph-node for hypergraph state tracking.\n * Falls back to in-memory maps when the native backend is unavailable.\n */\n\ninterface GraphNode {\n  id: string;\n  type: 'agent' | 'task' | 'episode' | 'skill';\n  properties: Record<string, any>;\n}\n\ninterface GraphEdge {\n  from: string;\n  to: string;\n  type: string;\n  properties: Record<string, any>;\n  timestamp: number;\n}\n\ninterface GraphStats {\n  nodes: number;\n  edges: number;\n  available: boolean;\n}\n\nexport class GraphStateManager {\n  private graphDb: any = null;\n  private available = false;\n  private nodes = new Map<string, GraphNode>();\n  private edges: GraphEdge[] = [];\n\n  /**\n   * Attempt to load @ruvector/graph-node.\n   * Returns true if the native graph backend is available.\n   */\n  async initialize(): Promise<boolean> {\n    try {\n      const graphModule = await import('@ruvector/graph-node');\n      const GraphDB = (graphModule as any).GraphDB || (graphModule as any).default;\n      if (GraphDB) {\n        this.graphDb = new GraphDB();\n        this.available = true;\n      }\n      return this.available;\n    } catch {\n      this.available = false;\n      return false;\n    }\n  }\n\n  /**\n   * Add a node to the graph. Persists in the native backend when available.\n   */\n  async addNode(node: GraphNode): Promise<void> {\n    this.nodes.set(node.id, node);\n    if (this.graphDb) {\n      try {\n        await this.graphDb.addNode(node);\n      } catch { /* in-memory fallback already persisted */ }\n    }\n  }\n\n  /**\n   * Add an edge between two nodes.\n   */\n  async addEdge(edge: GraphEdge): Promise<void> {\n    this.edges.push(edge);\n    if (this.graphDb) {\n      try {\n        await this.graphDb.addEdge(edge.from, edge.type, edge.to, edge.properties);\n      } catch { /* in-memory fallback already persisted */ }\n    }\n  }\n\n  /**\n   * Remove a node and all associated edges.\n   */\n  async removeNode(nodeId: string): Promise<void> {\n    this.nodes.delete(nodeId);\n    this.edges = this.edges.filter(e => e.from !== nodeId && e.to !== nodeId);\n    if (this.graphDb) {\n      try {\n        await this.graphDb.removeNode(nodeId);\n      } catch { /* in-memory already cleaned */ }\n    }\n  }\n\n  /**\n   * Query the graph. Falls back to returning all nodes of matching type.\n   */\n  async query(cypher: string): Promise<any[]> {\n    if (this.graphDb) {\n      try {\n        return await this.graphDb.query(cypher);\n      } catch { /* fall through to in-memory */ }\n    }\n\n    // Simple in-memory query: extract type filter from MATCH (:Type) patterns\n    const typeMatch = cypher.match(/:\\s*(\\w+)/);\n    if (typeMatch) {\n      const filterType = typeMatch[1].toLowerCase();\n      return Array.from(this.nodes.values()).filter(\n        n => n.type.toLowerCase() === filterType\n      );\n    }\n    return Array.from(this.nodes.values());\n  }\n\n  /**\n   * Get all edges connected to a node.\n   */\n  async getRelationships(nodeId: string): Promise<GraphEdge[]> {\n    return this.edges.filter(e => e.from === nodeId || e.to === nodeId);\n  }\n\n  /**\n   * Get a specific node by ID.\n   */\n  getNode(nodeId: string): GraphNode | undefined {\n    return this.nodes.get(nodeId);\n  }\n\n  /**\n   * Get all nodes of a given type.\n   */\n  getNodesByType(type: GraphNode['type']): GraphNode[] {\n    return Array.from(this.nodes.values()).filter(n => n.type === type);\n  }\n\n  /**\n   * Return current graph statistics.\n   */\n  getStats(): GraphStats {\n    return {\n      nodes: this.nodes.size,\n      edges: this.edges.length,\n      available: this.available,\n    };\n  }\n\n  isAvailable(): boolean {\n    return this.available;\n  }\n}\n\nexport const graphStateManager = new GraphStateManager();\n"]}

package/dist/coordination/self-improvement-pipeline.d.ts

@@ -1,70 +0,0 @@
-/**
- * Self-Improvement Pipeline
- * Automated continuous improvement using AgentDB NightlyLearner and ExplainableRecall.
- * Falls back to local pattern extraction when AgentDB is unavailable.
- */
-interface ImprovementMetrics {
-    patternsDiscovered: number;
-    routingAccuracyBefore: number;
-    routingAccuracyAfter: number;
-    experimentsRun: number;
-    lastRunTimestamp: number;
-}
-interface DiscoveredPattern {
-    taskType: string;
-    agentType: string;
-    avgReward: number;
-    sampleSize: number;
-}
-interface EpisodeRecord {
-    taskType: string;
-    agentType: string;
-    actions?: string[];
-    outcome?: string;
-    reward: number;
-}
-export declare class SelfImprovementPipeline {
-    private nightlyLearner;
-    private explainableRecall;
-    private available;
-    private metrics;
-    private discoveredPatterns;
-    /**
-     * Attempt to load NightlyLearner and ExplainableRecall from AgentDB.
-     */
-    initialize(): Promise<boolean>;
-    /**
-     * Run a full improvement cycle over recent episodes.
-     * Discovers patterns, updates metrics, and returns the current state.
-     */
-    runImprovementCycle(episodes: EpisodeRecord[]): Promise<ImprovementMetrics>;
-    /**
-     * Extract recurring (taskType, agentType) patterns from successful episodes.
-     * Requires at least 3 observations with avg reward > 0.5 to be considered a pattern.
-     */
-    private extractPatterns;
-    /**
-     * Calculate current routing accuracy as avg reward across all episodes.
-     */
-    private calculateAccuracy;
-    /**
-     * Project improved accuracy assuming discovered patterns are applied.
-     */
-    private projectImprovedAccuracy;
-    /**
-     * Explain a past decision using ExplainableRecall or a fallback message.
-     */
-    explainDecision(decisionId: string): Promise<{
-        explanation: string;
-        proof?: any;
-    }>;
-    /**
-     * Get all discovered patterns from the most recent improvement cycle.
-     */
-    getDiscoveredPatterns(): DiscoveredPattern[];
-    getMetrics(): ImprovementMetrics;
-    isAvailable(): boolean;
-}
-export declare const selfImprovementPipeline: SelfImprovementPipeline;
-export {};
-//# sourceMappingURL=self-improvement-pipeline.d.ts.map

package/dist/coordination/self-improvement-pipeline.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"self-improvement-pipeline.d.ts","sourceRoot":"","sources":["../../src/coordination/self-improvement-pipeline.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,UAAU,kBAAkB;IAC1B,kBAAkB,EAAE,MAAM,CAAC;IAC3B,qBAAqB,EAAE,MAAM,CAAC;IAC9B,oBAAoB,EAAE,MAAM,CAAC;IAC7B,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,UAAU,iBAAiB;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,UAAU,aAAa;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,qBAAa,uBAAuB;IAClC,OAAO,CAAC,cAAc,CAAa;IACnC,OAAO,CAAC,iBAAiB,CAAa;IACtC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,OAAO,CAMb;IACF,OAAO,CAAC,kBAAkB,CAA2B;IAErD;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,OAAO,CAAC;IAiBpC;;;OAGG;IACG,mBAAmB,CAAC,QAAQ,EAAE,aAAa,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAkBjF;;;OAGG;IACH,OAAO,CAAC,eAAe;IA4BvB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAMzB;;OAEG;IACH,OAAO,CAAC,uBAAuB;IAsB/B;;OAEG;IACG,eAAe,CACnB,UAAU,EAAE,MAAM,GACjB,OAAO,CAAC;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,GAAG,CAAA;KAAE,CAAC;IAehD;;OAEG;IACH,qBAAqB,IAAI,iBAAiB,EAAE;IAI5C,UAAU,IAAI,kBAAkB;IAIhC,WAAW,IAAI,OAAO;CAGvB;AAED,eAAO,MAAM,uBAAuB,yBAAgC,CAAC"}

package/dist/coordination/self-improvement-pipeline.js

@@ -1,144 +0,0 @@
-/**
- * Self-Improvement Pipeline
- * Automated continuous improvement using AgentDB NightlyLearner and ExplainableRecall.
- * Falls back to local pattern extraction when AgentDB is unavailable.
- */
-export class SelfImprovementPipeline {
-    nightlyLearner = null;
-    explainableRecall = null;
-    available = false;
-    metrics = {
-        patternsDiscovered: 0,
-        routingAccuracyBefore: 0,
-        routingAccuracyAfter: 0,
-        experimentsRun: 0,
-        lastRunTimestamp: 0,
-    };
-    discoveredPatterns = [];
-    /**
-     * Attempt to load NightlyLearner and ExplainableRecall from AgentDB.
-     */
-    async initialize() {
-        try {
-            const agentdb = await import('agentdb');
-            if (agentdb.NightlyLearner) {
-                this.nightlyLearner = agentdb.NightlyLearner;
-            }
-            if (agentdb.ExplainableRecall) {
-                this.explainableRecall = agentdb.ExplainableRecall;
-            }
-            this.available = true;
-            return true;
-        }
-        catch {
-            this.available = false;
-            return false;
-        }
-    }
-    /**
-     * Run a full improvement cycle over recent episodes.
-     * Discovers patterns, updates metrics, and returns the current state.
-     */
-    async runImprovementCycle(episodes) {
-        this.metrics.lastRunTimestamp = Date.now();
-        // Snapshot accuracy before
-        this.metrics.routingAccuracyBefore = this.calculateAccuracy(episodes);
-        // Extract patterns from episodes
-        const patterns = this.extractPatterns(episodes);
-        this.discoveredPatterns = patterns;
-        this.metrics.patternsDiscovered = patterns.length;
-        // Simulate improvement: high-reward patterns improve future routing
-        this.metrics.routingAccuracyAfter = this.projectImprovedAccuracy(episodes, patterns);
-        this.metrics.experimentsRun++;
-        return { ...this.metrics };
-    }
-    /**
-     * Extract recurring (taskType, agentType) patterns from successful episodes.
-     * Requires at least 3 observations with avg reward > 0.5 to be considered a pattern.
-     */
-    extractPatterns(episodes) {
-        const successEpisodes = episodes.filter(e => e.reward > 0.7);
-        const groups = new Map();
-        for (const ep of successEpisodes) {
-            const key = `${ep.taskType}:${ep.agentType}`;
-            const existing = groups.get(key) || { count: 0, totalReward: 0 };
-            existing.count++;
-            existing.totalReward += ep.reward;
-            groups.set(key, existing);
-        }
-        const patterns = [];
-        for (const [key, data] of groups) {
-            if (data.count >= 3) {
-                const [taskType, agentType] = key.split(':');
-                patterns.push({
-                    taskType,
-                    agentType,
-                    avgReward: data.totalReward / data.count,
-                    sampleSize: data.count,
-                });
-            }
-        }
-        return patterns;
-    }
-    /**
-     * Calculate current routing accuracy as avg reward across all episodes.
-     */
-    calculateAccuracy(episodes) {
-        if (episodes.length === 0)
-            return 0;
-        const total = episodes.reduce((sum, ep) => sum + ep.reward, 0);
-        return total / episodes.length;
-    }
-    /**
-     * Project improved accuracy assuming discovered patterns are applied.
-     */
-    projectImprovedAccuracy(episodes, patterns) {
-        if (episodes.length === 0)
-            return 0;
-        const patternMap = new Map();
-        for (const p of patterns) {
-            patternMap.set(`${p.taskType}:${p.agentType}`, p.avgReward);
-        }
-        let totalReward = 0;
-        for (const ep of episodes) {
-            const key = `${ep.taskType}:${ep.agentType}`;
-            const patternReward = patternMap.get(key);
-            // If a pattern exists, assume the pattern's avg reward; else keep actual
-            totalReward += patternReward !== undefined ? patternReward : ep.reward;
-        }
-        return totalReward / episodes.length;
-    }
-    /**
-     * Explain a past decision using ExplainableRecall or a fallback message.
-     */
-    async explainDecision(decisionId) {
-        if (this.explainableRecall) {
-            try {
-                const instance = typeof this.explainableRecall === 'function'
-                    ? new this.explainableRecall()
-                    : this.explainableRecall;
-                const explanation = await instance.explain?.(decisionId);
-                if (explanation)
-                    return explanation;
-            }
-            catch { /* fall through */ }
-        }
-        return {
-            explanation: `Decision ${decisionId}: Based on historical pattern matching with ${this.discoveredPatterns.length} known patterns.`,
-        };
-    }
-    /**
-     * Get all discovered patterns from the most recent improvement cycle.
-     */
-    getDiscoveredPatterns() {
-        return [...this.discoveredPatterns];
-    }
-    getMetrics() {
-        return { ...this.metrics };
-    }
-    isAvailable() {
-        return this.available;
-    }
-}
-export const selfImprovementPipeline = new SelfImprovementPipeline();
-//# sourceMappingURL=self-improvement-pipeline.js.map

package/dist/coordination/self-improvement-pipeline.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"self-improvement-pipeline.js","sourceRoot":"","sources":["../../src/coordination/self-improvement-pipeline.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAyBH,MAAM,OAAO,uBAAuB;IAC1B,cAAc,GAAQ,IAAI,CAAC;IAC3B,iBAAiB,GAAQ,IAAI,CAAC;IAC9B,SAAS,GAAG,KAAK,CAAC;IAClB,OAAO,GAAuB;QACpC,kBAAkB,EAAE,CAAC;QACrB,qBAAqB,EAAE,CAAC;QACxB,oBAAoB,EAAE,CAAC;QACvB,cAAc,EAAE,CAAC;QACjB,gBAAgB,EAAE,CAAC;KACpB,CAAC;IACM,kBAAkB,GAAwB,EAAE,CAAC;IAErD;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,CAAC;YACxC,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;gBAC3B,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC;YAC/C,CAAC;YACD,IAAI,OAAO,CAAC,iBAAiB,EAAE,CAAC;gBAC9B,IAAI,CAAC,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,CAAC;YACrD,CAAC;YACD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,mBAAmB,CAAC,QAAyB;QACjD,IAAI,CAAC,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE3C,2BAA2B;QAC3B,IAAI,CAAC,OAAO,CAAC,qBAAqB,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QAEtE,iCAAiC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,CAAC,kBAAkB,GAAG,QAAQ,CAAC;QACnC,IAAI,CAAC,OAAO,CAAC,kBAAkB,GAAG,QAAQ,CAAC,MAAM,CAAC;QAElD,oEAAoE;QACpE,IAAI,CAAC,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAErF,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC;QAC9B,OAAO,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACK,eAAe,CAAC,QAAyB;QAC/C,MAAM,eAAe,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkD,CAAC;QAEzE,KAAK,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG,GAAG,EAAE,CAAC,QAAQ,IAAI,EAAE,CAAC,SAAS,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;YACjE,QAAQ,CAAC,KAAK,EAAE,CAAC;YACjB,QAAQ,CAAC,WAAW,IAAI,EAAE,CAAC,MAAM,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC5B,CAAC;QAED,MAAM,QAAQ,GAAwB,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAC7C,QAAQ,CAAC,IAAI,CAAC;oBACZ,QAAQ;oBACR,SAAS;oBACT,SAAS,EAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK;oBACxC,UAAU,EAAE,IAAI,CAAC,KAAK;iBACvB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,QAAyB;QACjD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/D,OAAO,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC;IACjC,CAAC;IAED;;OAEG;IACK,uBAAuB,CAC7B,QAAyB,EACzB,QAA6B;QAE7B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEpC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;QAC9D,CAAC;QAED,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAG,GAAG,EAAE,CAAC,QAAQ,IAAI,EAAE,CAAC,SAAS,EAAE,CAAC;YAC7C,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC1C,yEAAyE;YACzE,WAAW,IAAI,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC;QACzE,CAAC;QAED,OAAO,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CACnB,UAAkB;QAElB,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC3B,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,OAAO,IAAI,CAAC,iBAAiB,KAAK,UAAU;oBAC3D,CAAC,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE;oBAC9B,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC;gBAC3B,MAAM,WAAW,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,CAAC;gBACzD,IAAI,WAAW;oBAAE,OAAO,WAAW,CAAC;YACtC,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QACD,OAAO;YACL,WAAW,EAAE,YAAY,UAAU,+CAA+C,IAAI,CAAC,kBAAkB,CAAC,MAAM,kBAAkB;SACnI,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,qBAAqB;QACnB,OAAO,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC;IACtC,CAAC;IAED,UAAU;QACR,OAAO,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;CACF;AAED,MAAM,CAAC,MAAM,uBAAuB,GAAG,IAAI,uBAAuB,EAAE,CAAC","sourcesContent":["/**\n * Self-Improvement Pipeline\n * Automated continuous improvement using AgentDB NightlyLearner and ExplainableRecall.\n * Falls back to local pattern extraction when AgentDB is unavailable.\n */\n\ninterface ImprovementMetrics {\n  patternsDiscovered: number;\n  routingAccuracyBefore: number;\n  routingAccuracyAfter: number;\n  experimentsRun: number;\n  lastRunTimestamp: number;\n}\n\ninterface DiscoveredPattern {\n  taskType: string;\n  agentType: string;\n  avgReward: number;\n  sampleSize: number;\n}\n\ninterface EpisodeRecord {\n  taskType: string;\n  agentType: string;\n  actions?: string[];\n  outcome?: string;\n  reward: number;\n}\n\nexport class SelfImprovementPipeline {\n  private nightlyLearner: any = null;\n  private explainableRecall: any = null;\n  private available = false;\n  private metrics: ImprovementMetrics = {\n    patternsDiscovered: 0,\n    routingAccuracyBefore: 0,\n    routingAccuracyAfter: 0,\n    experimentsRun: 0,\n    lastRunTimestamp: 0,\n  };\n  private discoveredPatterns: DiscoveredPattern[] = [];\n\n  /**\n   * Attempt to load NightlyLearner and ExplainableRecall from AgentDB.\n   */\n  async initialize(): Promise<boolean> {\n    try {\n      const agentdb = await import('agentdb');\n      if (agentdb.NightlyLearner) {\n        this.nightlyLearner = agentdb.NightlyLearner;\n      }\n      if (agentdb.ExplainableRecall) {\n        this.explainableRecall = agentdb.ExplainableRecall;\n      }\n      this.available = true;\n      return true;\n    } catch {\n      this.available = false;\n      return false;\n    }\n  }\n\n  /**\n   * Run a full improvement cycle over recent episodes.\n   * Discovers patterns, updates metrics, and returns the current state.\n   */\n  async runImprovementCycle(episodes: EpisodeRecord[]): Promise<ImprovementMetrics> {\n    this.metrics.lastRunTimestamp = Date.now();\n\n    // Snapshot accuracy before\n    this.metrics.routingAccuracyBefore = this.calculateAccuracy(episodes);\n\n    // Extract patterns from episodes\n    const patterns = this.extractPatterns(episodes);\n    this.discoveredPatterns = patterns;\n    this.metrics.patternsDiscovered = patterns.length;\n\n    // Simulate improvement: high-reward patterns improve future routing\n    this.metrics.routingAccuracyAfter = this.projectImprovedAccuracy(episodes, patterns);\n\n    this.metrics.experimentsRun++;\n    return { ...this.metrics };\n  }\n\n  /**\n   * Extract recurring (taskType, agentType) patterns from successful episodes.\n   * Requires at least 3 observations with avg reward > 0.5 to be considered a pattern.\n   */\n  private extractPatterns(episodes: EpisodeRecord[]): DiscoveredPattern[] {\n    const successEpisodes = episodes.filter(e => e.reward > 0.7);\n    const groups = new Map<string, { count: number; totalReward: number }>();\n\n    for (const ep of successEpisodes) {\n      const key = `${ep.taskType}:${ep.agentType}`;\n      const existing = groups.get(key) || { count: 0, totalReward: 0 };\n      existing.count++;\n      existing.totalReward += ep.reward;\n      groups.set(key, existing);\n    }\n\n    const patterns: DiscoveredPattern[] = [];\n    for (const [key, data] of groups) {\n      if (data.count >= 3) {\n        const [taskType, agentType] = key.split(':');\n        patterns.push({\n          taskType,\n          agentType,\n          avgReward: data.totalReward / data.count,\n          sampleSize: data.count,\n        });\n      }\n    }\n\n    return patterns;\n  }\n\n  /**\n   * Calculate current routing accuracy as avg reward across all episodes.\n   */\n  private calculateAccuracy(episodes: EpisodeRecord[]): number {\n    if (episodes.length === 0) return 0;\n    const total = episodes.reduce((sum, ep) => sum + ep.reward, 0);\n    return total / episodes.length;\n  }\n\n  /**\n   * Project improved accuracy assuming discovered patterns are applied.\n   */\n  private projectImprovedAccuracy(\n    episodes: EpisodeRecord[],\n    patterns: DiscoveredPattern[]\n  ): number {\n    if (episodes.length === 0) return 0;\n\n    const patternMap = new Map<string, number>();\n    for (const p of patterns) {\n      patternMap.set(`${p.taskType}:${p.agentType}`, p.avgReward);\n    }\n\n    let totalReward = 0;\n    for (const ep of episodes) {\n      const key = `${ep.taskType}:${ep.agentType}`;\n      const patternReward = patternMap.get(key);\n      // If a pattern exists, assume the pattern's avg reward; else keep actual\n      totalReward += patternReward !== undefined ? patternReward : ep.reward;\n    }\n\n    return totalReward / episodes.length;\n  }\n\n  /**\n   * Explain a past decision using ExplainableRecall or a fallback message.\n   */\n  async explainDecision(\n    decisionId: string\n  ): Promise<{ explanation: string; proof?: any }> {\n    if (this.explainableRecall) {\n      try {\n        const instance = typeof this.explainableRecall === 'function'\n          ? new this.explainableRecall()\n          : this.explainableRecall;\n        const explanation = await instance.explain?.(decisionId);\n        if (explanation) return explanation;\n      } catch { /* fall through */ }\n    }\n    return {\n      explanation: `Decision ${decisionId}: Based on historical pattern matching with ${this.discoveredPatterns.length} known patterns.`,\n    };\n  }\n\n  /**\n   * Get all discovered patterns from the most recent improvement cycle.\n   */\n  getDiscoveredPatterns(): DiscoveredPattern[] {\n    return [...this.discoveredPatterns];\n  }\n\n  getMetrics(): ImprovementMetrics {\n    return { ...this.metrics };\n  }\n\n  isAvailable(): boolean {\n    return this.available;\n  }\n}\n\nexport const selfImprovementPipeline = new SelfImprovementPipeline();\n"]}

package/dist/coordination/swarm-completion.d.ts

@@ -1,126 +0,0 @@
-/**
- * Swarm Completion Coordinator (ADR-058)
- *
- * Tracks swarm task completion state and provides programmatic API
- * for the Autopilot persistent completion loop. Integrates with
- * the self-improvement pipeline for learning from completion patterns.
- */
-import { DriftMetrics } from './drift-detector.js';
-export interface SwarmTask {
-    id: string;
-    subject: string;
-    status: 'pending' | 'in_progress' | 'completed' | 'blocked';
-    owner?: string;
-    source?: string;
-    createdAt?: number;
-    completedAt?: number;
-}
-export interface CompletionState {
-    total: number;
-    completed: number;
-    inProgress: number;
-    pending: number;
-    blocked: number;
-    progress: number;
-    isComplete: boolean;
-    iterations: number;
-    elapsedMs: number;
-    remainingTasks: SwarmTask[];
-}
-export interface CompletionConfig {
-    maxIterations: number;
-    timeoutMinutes: number;
-    enabled: boolean;
-}
-export declare class SwarmCompletionCoordinator {
-    private tasks;
-    private iterations;
-    private startTime;
-    private config;
-    private completionHistory;
-    private driftDetector;
-    private sessionId;
-    private lastDriftCheck;
-    private learningInitialized;
-    private learning;
-    constructor(config?: Partial<CompletionConfig>);
-    /**
-     * Register a task for completion tracking.
-     */
-    addTask(task: SwarmTask): void;
-    /**
-     * Bulk register tasks.
-     */
-    addTasks(tasks: SwarmTask[]): void;
-    /**
-     * Update task status with optional agent tracking for drift detection.
-     */
-    updateTask(taskId: string, status: SwarmTask['status'], agentId?: string): void;
-    /**
-     * Remove a task from tracking.
-     */
-    removeTask(taskId: string): void;
-    /**
-     * Increment iteration counter, run drift detection, and return current state.
-     * Called by the Stop hook on each re-engagement cycle.
-     */
-    tick(): CompletionState;
-    /**
-     * Get current completion state without incrementing iterations.
-     */
-    getState(): CompletionState;
-    /**
-     * Check whether the swarm should continue running.
-     * Returns true if there are remaining tasks AND limits are not exceeded.
-     */
-    shouldContinue(): boolean;
-    /**
-     * Get remaining tasks sorted by priority (in_progress first, then pending).
-     * Accepts optional pre-computed state to avoid redundant iteration.
-     */
-    getRemainingTasks(precomputed?: CompletionState): SwarmTask[];
-    /**
-     * Generate a re-engagement prompt for the agent.
-     * Includes drift warnings and learning recommendations when available.
-     */
-    generateReEngagementPrompt(): Promise<string>;
-    /**
-     * Get completion history for learning/analytics.
-     */
-    getCompletionHistory(): typeof this.completionHistory;
-    /**
-     * Get average task completion time.
-     */
-    getAverageCompletionTime(): number;
-    /**
-     * Reset state for a new swarm session.
-     */
-    reset(): void;
-    /**
-     * Get config.
-     */
-    getConfig(): CompletionConfig;
-    /**
-     * Update config.
-     */
-    setConfig(config: Partial<CompletionConfig>): void;
-    /**
-     * Initialize the learning subsystem (AgentDB + SONA).
-     * Returns true if learning became available.
-     */
-    initializeLearning(): Promise<boolean>;
-    /**
-     * Get drift detection metrics.
-     */
-    getDriftMetrics(): DriftMetrics;
-    /**
-     * Get learning subsystem metrics.
-     */
-    getLearningMetrics(): Promise<any>;
-    /**
-     * Apply mitigation strategies for detected drift signals.
-     */
-    private applyMitigation;
-}
-export declare const swarmCompletion: SwarmCompletionCoordinator;
-//# sourceMappingURL=swarm-completion.d.ts.map

package/dist/coordination/swarm-completion.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"swarm-completion.d.ts","sourceRoot":"","sources":["../../src/coordination/swarm-completion.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAiB,YAAY,EAAe,MAAM,qBAAqB,CAAC;AAE/E,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,SAAS,GAAG,aAAa,GAAG,WAAW,GAAG,SAAS,CAAC;IAC5D,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,OAAO,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,SAAS,EAAE,CAAC;CAC7B;AAED,MAAM,WAAW,gBAAgB;IAC/B,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,OAAO,CAAC;CAClB;AAQD,qBAAa,0BAA0B;IACrC,OAAO,CAAC,KAAK,CAAgC;IAC7C,OAAO,CAAC,UAAU,CAAK;IACvB,OAAO,CAAC,SAAS,CAAc;IAC/B,OAAO,CAAC,MAAM,CAAmB;IACjC,OAAO,CAAC,iBAAiB,CAIjB;IACR,OAAO,CAAC,aAAa,CAAgB;IACrC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,cAAc,CAAK;IAC3B,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAa;gBAEjB,MAAM,GAAE,OAAO,CAAC,gBAAgB,CAAM;IAMlD;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI;IAI9B;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,IAAI;IAMlC;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI;IA6C/E;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAIhC;;;OAGG;IACH,IAAI,IAAI,eAAe;IAwBvB;;OAEG;IACH,QAAQ,IAAI,eAAe;IAgC3B;;;OAGG;IACH,cAAc,IAAI,OAAO;IAazB;;;OAGG;IACH,iBAAiB,CAAC,WAAW,CAAC,EAAE,eAAe,GAAG,SAAS,EAAE;IAQ7D;;;OAGG;IACG,0BAA0B,IAAI,OAAO,CAAC,MAAM,CAAC;IA8DnD;;OAEG;IACH,oBAAoB,IAAI,OAAO,IAAI,CAAC,iBAAiB;IAIrD;;OAEG;IACH,wBAAwB,IAAI,MAAM;IAMlC;;OAEG;IACH,KAAK,IAAI,IAAI;IAUb;;OAEG;IACH,SAAS,IAAI,gBAAgB;IAI7B;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,gBAAgB,CAAC,GAAG,IAAI;IAIlD;;;OAGG;IACG,kBAAkB,IAAI,OAAO,CAAC,OAAO,CAAC;IAgB5C;;OAEG;IACH,eAAe,IAAI,YAAY;IAI/B;;OAEG;IACG,kBAAkB,IAAI,OAAO,CAAC,GAAG,CAAC;IASxC;;OAEG;IACH,OAAO,CAAC,eAAe;CAqCxB;AAED,eAAO,MAAM,eAAe,4BAAmC,CAAC"}