network-ai 5.2.2 → 5.3.0

package/dist/lib/partition-planner.js

@@ -0,0 +1,246 @@
+"use strict";
+/**
+ * Partition Planner — Logical Work Partitioning for Network-AI
+ *
+ * Prevents parallel agents from performing redundant research or analysis by
+ * running a "meta-step" before DAG execution that generates a Scope Assignment
+ * Map (PartitionSchema). Each agent receives a boundary constraint injected
+ * into its parameters, declaring what it SHOULD focus on and what it should
+ * EXCLUDE.
+ *
+ * The planner also performs an overlap check — verifying that no two
+ * `focus_area` strings overlap semantically (or lexically, when using the
+ * built-in heuristic check).
+ *
+ * Zero external dependencies — the overlap checker and the planner function
+ * are pluggable so callers can use any LLM or rule-based strategy.
+ *
+ * @module PartitionPlanner
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PartitionPlanner = void 0;
+exports.createLexicalOverlapChecker = createLexicalOverlapChecker;
+exports.createLLMPartitionPlanner = createLLMPartitionPlanner;
+exports.parsePartitionJSON = parsePartitionJSON;
+// ============================================================================
+// BUILT-IN OVERLAP CHECKER (lexical heuristic — zero model cost)
+// ============================================================================
+/**
+ * Lexical overlap checker: considers two focus areas to overlap when they
+ * share significant word stems (ignoring common stop words).
+ *
+ * This is the built-in default. For true semantic overlap detection, inject
+ * an LLM-based `OverlapCheckFunction` via `PartitionPlannerOptions.overlapChecker`.
+ */
+function createLexicalOverlapChecker() {
+    const STOP_WORDS = new Set([
+        'a', 'an', 'the', 'and', 'or', 'but', 'in', 'on', 'at', 'to', 'for',
+        'of', 'with', 'by', 'from', 'is', 'are', 'was', 'were', 'be', 'been',
+        'as', 'its', 'it', 'this', 'that', 'all', 'any', 'each', 'every',
+    ]);
+    function tokenize(text) {
+        return new Set(text
+            .toLowerCase()
+            .replace(/[^a-z0-9\s]/g, ' ')
+            .split(/\s+/)
+            .filter((w) => w.length > 2 && !STOP_WORDS.has(w)));
+    }
+    return async (schema) => {
+        const overlaps = [];
+        for (let i = 0; i < schema.length; i++) {
+            for (let j = i + 1; j < schema.length; j++) {
+                const tokensA = tokenize(schema[i].focus_area);
+                const tokensB = tokenize(schema[j].focus_area);
+                const shared = [];
+                for (const token of tokensA) {
+                    if (tokensB.has(token))
+                        shared.push(token);
+                }
+                // Flag as overlap when ≥ 2 shared significant words or overlap ratio > 0.4
+                const unionSize = new Set([...tokensA, ...tokensB]).size;
+                const ratio = unionSize > 0 ? shared.length / unionSize : 0;
+                if (shared.length >= 2 || ratio > 0.4) {
+                    overlaps.push(`Overlap between "${schema[i].agent_type}" (focus: "${schema[i].focus_area}") and "${schema[j].agent_type}" (focus: "${schema[j].focus_area}") — shared terms: ${shared.join(', ')}`);
+                }
+            }
+        }
+        return overlaps;
+    };
+}
+/**
+ * Build a partition planner backed by an LLM.
+ *
+ * The LLM is asked to generate a PartitionSchema JSON array given the goal
+ * and the available agents. Use this for rich semantic partitioning.
+ *
+ * @param executor - Network-AI executor function
+ * @param plannerAgentId - Agent ID for the LLM that does partitioning
+ */
+function createLLMPartitionPlanner(executor, plannerAgentId) {
+    return async (goal, agents, context) => {
+        const agentList = agents.map((a) => `- ${a.id}: ${a.role}`).join('\n');
+        const prompt = [
+            'You are a work-partitioning planner for a multi-agent AI system.',
+            'Generate a scope assignment for each agent to prevent redundant research.',
+            '',
+            `GOAL: ${goal}`,
+            '',
+            'AGENTS:',
+            agentList,
+            '',
+            context ? `CONTEXT: ${JSON.stringify(context)}` : '',
+            '',
+            'Respond with ONLY a JSON array where each element has:',
+            '- "agent_type": agent ID from the list above',
+            '- "focus_area": a short phrase describing what ONLY this agent researches',
+            '- "excluded_topics": array of topic strings this agent must NOT cover',
+            '',
+            'Ensure no two focus_area values overlap semantically.',
+            '',
+            'Example:',
+            '[{"agent_type":"researcher","focus_area":"market trends and competitive landscape","excluded_topics":["financial projections","legal compliance"]},',
+            ' {"agent_type":"analyst","focus_area":"financial projections and ROI analysis","excluded_topics":["market research","legal compliance"]}]',
+        ].filter(Boolean).join('\n');
+        const result = await executor(plannerAgentId, { action: 'partition', params: { prompt } }, { agentId: plannerAgentId, taskId: `partition-${Date.now()}`, metadata: { type: 'partition-planning', ...(context ?? {}) } });
+        if (!result.success || !result.data) {
+            throw new Error(`Partition planner failed: ${result.error?.message ?? 'no data returned'}`);
+        }
+        return parsePartitionJSON(typeof result.data === 'string' ? result.data : JSON.stringify(result.data));
+    };
+}
+/**
+ * Parse a PartitionSchema from an LLM response string.
+ * Handles markdown fences and leading/trailing text.
+ */
+function parsePartitionJSON(text) {
+    let cleaned = text.trim();
+    // Strip markdown fences
+    const fenceOpen = cleaned.indexOf('```');
+    if (fenceOpen !== -1) {
+        const afterOpen = cleaned.indexOf('\n', fenceOpen);
+        const fenceClose = cleaned.indexOf('```', afterOpen !== -1 ? afterOpen : fenceOpen + 3);
+        if (afterOpen !== -1 && fenceClose > afterOpen) {
+            cleaned = cleaned.substring(afterOpen + 1, fenceClose).trim();
+        }
+    }
+    // Find JSON array
+    const arrayStart = cleaned.indexOf('[');
+    const arrayEnd = cleaned.lastIndexOf(']');
+    if (arrayStart !== -1 && arrayEnd > arrayStart) {
+        cleaned = cleaned.substring(arrayStart, arrayEnd + 1);
+    }
+    let parsed;
+    try {
+        parsed = JSON.parse(cleaned);
+    }
+    catch (err) {
+        throw new Error(`Failed to parse partition schema JSON: ${err.message}`);
+    }
+    if (!Array.isArray(parsed)) {
+        throw new Error('Partition schema must be a JSON array');
+    }
+    // Validate each entry
+    const schema = [];
+    for (const entry of parsed) {
+        if (typeof entry !== 'object' || entry === null) {
+            throw new Error('Each partition entry must be a JSON object');
+        }
+        const e = entry;
+        if (!e.agent_type || typeof e.agent_type !== 'string') {
+            throw new Error('Each partition entry must have a string "agent_type"');
+        }
+        if (!e.focus_area || typeof e.focus_area !== 'string') {
+            throw new Error(`Partition entry for "${e.agent_type}" must have a string "focus_area"`);
+        }
+        if (!Array.isArray(e.excluded_topics)) {
+            e.excluded_topics = [];
+        }
+        schema.push({
+            agent_type: e.agent_type,
+            focus_area: e.focus_area,
+            excluded_topics: e.excluded_topics.map(String),
+        });
+    }
+    return schema;
+}
+// ============================================================================
+// PARTITION PLANNER (OOP interface)
+// ============================================================================
+/**
+ * PartitionPlanner generates a PartitionSchema (scope assignment map) for a
+ * set of agents before the DAG is executed, preventing redundant research.
+ *
+ * @example
+ * ```typescript
+ * const planner = new PartitionPlanner(myLLMPartitionPlannerFn);
+ * const result = await planner.plan('Analyse Q3 financial results', agents);
+ * // result.schema[0] = { agent_type: 'researcher', focus_area: '...', excluded_topics: [...] }
+ * // Inject result.schema[i] as boundary constraint into each agent's params
+ * ```
+ */
+class PartitionPlanner {
+    plannerFn;
+    overlapChecker;
+    strictOverlap;
+    constructor(plannerFn, options = {}) {
+        this.plannerFn = plannerFn;
+        this.overlapChecker = options.overlapChecker ?? createLexicalOverlapChecker();
+        this.strictOverlap = options.strictOverlap ?? false;
+    }
+    /**
+     * Generate a PartitionSchema for a goal and agent list.
+     *
+     * Runs the planner then validates for overlaps. If `strictOverlap` is true
+     * and overlaps are found, throws an error. Otherwise overlaps are reported
+     * in the result.
+     *
+     * @param goal - Natural language goal
+     * @param agents - Available team agents
+     * @param context - Optional context to feed to the planner
+     */
+    async plan(goal, agents, context) {
+        if (!goal || typeof goal !== 'string') {
+            throw new Error('Goal must be a non-empty string');
+        }
+        if (!agents || agents.length === 0) {
+            throw new Error('At least one agent is required');
+        }
+        const schema = await this.plannerFn(goal, agents, context);
+        const overlaps = await this.overlapChecker(schema);
+        const hasOverlaps = overlaps.length > 0;
+        if (hasOverlaps && this.strictOverlap) {
+            throw new Error(`Partition schema has semantic overlaps:\n${overlaps.join('\n')}`);
+        }
+        return {
+            schema,
+            overlaps,
+            hasOverlaps,
+            createdAt: Date.now(),
+        };
+    }
+    /**
+     * Inject partition boundary constraints into agent params.
+     *
+     * Given a PartitionSchema and an existing params object for an agent,
+     * returns a new params object with `_partitionConstraint` added.
+     *
+     * @param agentId - Agent ID to look up in the schema
+     * @param params - Existing task params
+     * @param schema - The partition schema
+     */
+    static injectConstraint(agentId, params, schema) {
+        const entry = schema.find((e) => e.agent_type === agentId);
+        if (!entry)
+            return params;
+        return {
+            ...params,
+            _partitionConstraint: {
+                focus_area: entry.focus_area,
+                excluded_topics: entry.excluded_topics,
+            },
+        };
+    }
+}
+exports.PartitionPlanner = PartitionPlanner;
+//# sourceMappingURL=partition-planner.js.map

package/dist/lib/partition-planner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partition-planner.js","sourceRoot":"","sources":["../../lib/partition-planner.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;GAkBG;;;AAgFH,kEA4CC;AAWD,8DA6CC;AAMD,gDAuDC;AA5KD,+EAA+E;AAC/E,iEAAiE;AACjE,+EAA+E;AAE/E;;;;;;GAMG;AACH,SAAgB,2BAA2B;IACzC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;QACzB,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;QACnE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;QACpE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO;KACjE,CAAC,CAAC;IAEH,SAAS,QAAQ,CAAC,IAAY;QAC5B,OAAO,IAAI,GAAG,CACZ,IAAI;aACD,WAAW,EAAE;aACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;aAC5B,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACrD,CAAC;IACJ,CAAC;IAED,OAAO,KAAK,EAAE,MAAuB,EAAqB,EAAE;QAC1D,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAC/C,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAE/C,MAAM,MAAM,GAAa,EAAE,CAAC;gBAC5B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;oBAC5B,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;wBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC7C,CAAC;gBAED,2EAA2E;gBAC3E,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;gBACzD,MAAM,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBAE5D,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;oBACtC,QAAQ,CAAC,IAAI,CACX,oBAAoB,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,cAAc,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,WAAW,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,cAAc,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,sBAAsB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACrL,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,yBAAyB,CACvC,QAI+E,EAC/E,cAAsB;IAEtB,OAAO,KAAK,EAAE,IAAY,EAAE,MAAmB,EAAE,OAAiC,EAA4B,EAAE;QAC9G,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG;YACb,kEAAkE;YAClE,2EAA2E;YAC3E,EAAE;YACF,SAAS,IAAI,EAAE;YACf,EAAE;YACF,SAAS;YACT,SAAS;YACT,EAAE;YACF,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YACpD,EAAE;YACF,wDAAwD;YACxD,8CAA8C;YAC9C,2EAA2E;YAC3E,uEAAuE;YACvE,EAAE;YACF,uDAAuD;YACvD,EAAE;YACF,UAAU;YACV,qJAAqJ;YACrJ,2IAA2I;SAC5I,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE7B,MAAM,MAAM,GAAG,MAAM,QAAQ,CAC3B,cAAc,EACd,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,EAAE,EAC3C,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,aAAa,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,oBAAoB,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,EAAE,CAC7H,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,6BAA6B,MAAM,CAAC,KAAK,EAAE,OAAO,IAAI,kBAAkB,EAAE,CAAC,CAAC;QAC9F,CAAC;QAED,OAAO,kBAAkB,CAAC,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACzG,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAgB,kBAAkB,CAAC,IAAY;IAC7C,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAE1B,wBAAwB;IACxB,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;QACrB,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QACxF,IAAI,SAAS,KAAK,CAAC,CAAC,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;YAC/C,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC,IAAI,EAAE,CAAC;QAChE,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC1C,IAAI,UAAU,KAAK,CAAC,CAAC,IAAI,QAAQ,GAAG,UAAU,EAAE,CAAC;QAC/C,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,UAAU,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CAAC,0CAA2C,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;IACtF,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IAC3D,CAAC;IAED,sBAAsB;IACtB,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAChE,CAAC;QACD,MAAM,CAAC,GAAG,KAAgC,CAAC;QAC3C,IAAI,CAAC,CAAC,CAAC,UAAU,IAAI,OAAO,CAAC,CAAC,UAAU,KAAK,QAAQ,EAAE,CAAC;YACtD,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;QAC1E,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,UAAU,IAAI,OAAO,CAAC,CAAC,UAAU,KAAK,QAAQ,EAAE,CAAC;YACtD,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC,UAAU,mCAAmC,CAAC,CAAC;QAC3F,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC;YACtC,CAAC,CAAC,eAAe,GAAG,EAAE,CAAC;QACzB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;YACV,UAAU,EAAE,CAAC,CAAC,UAAoB;YAClC,UAAU,EAAE,CAAC,CAAC,UAAoB;YAClC,eAAe,EAAG,CAAC,CAAC,eAA6B,CAAC,GAAG,CAAC,MAAM,CAAC;SAC9D,CAAC,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAC/E,oCAAoC;AACpC,+EAA+E;AAE/E;;;;;;;;;;;GAWG;AACH,MAAa,gBAAgB;IACnB,SAAS,CAA2B;IACpC,cAAc,CAAuB;IACrC,aAAa,CAAU;IAE/B,YAAY,SAAmC,EAAE,UAAmC,EAAE;QACpF,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,2BAA2B,EAAE,CAAC;QAC9E,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,KAAK,CAAC;IACtD,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,IAAI,CACR,IAAY,EACZ,MAAmB,EACnB,OAAiC;QAEjC,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QAExC,IAAI,WAAW,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,4CAA4C,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrF,CAAC;QAED,OAAO;YACL,MAAM;YACN,QAAQ;YACR,WAAW;YACX,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,gBAAgB,CACrB,OAAe,EACf,MAA+B,EAC/B,MAAuB;QAEvB,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,OAAO,CAAC,CAAC;QAC3D,IAAI,CAAC,KAAK;YAAE,OAAO,MAAM,CAAC;QAC1B,OAAO;YACL,GAAG,MAAM;YACT,oBAAoB,EAAE;gBACpB,UAAU,EAAE,KAAK,CAAC,UAAU;gBAC5B,eAAe,EAAE,KAAK,CAAC,eAAe;aACvC;SACF,CAAC;IACJ,CAAC;CACF;AA3ED,4CA2EC"}

package/dist/lib/route-classifier.d.ts

@@ -0,0 +1,133 @@
+/**
+ * Route Classifier — Short-Circuit Routing for Network-AI
+ *
+ * Classifies an incoming goal into one of three categories before any
+ * DAG planning occurs. Simple factual lookups are routed directly to a
+ * single agent, bypassing the Blackboard/locking layer entirely to save
+ * latency and token cost. Complex synthesis uses the full DAG pipeline.
+ * System failures are surfaced immediately.
+ *
+ * Zero external dependencies — the classifier function is pluggable so
+ * callers can use any model (Haiku, Llama-3-8B, rule-based heuristic, …).
+ *
+ * @module RouteClassifier
+ * @version 1.0.0
+ */
+/** The three routing categories. */
+export type RouteCategory = 'FACTUAL_LOOKUP' | 'COMPLEX_SYNTHESIS' | 'SYSTEM_FAILURE';
+/** Result produced by the classifier. */
+export interface ClassificationResult {
+    /** The routing decision. */
+    category: RouteCategory;
+    /** Human-readable explanation from the classifier. */
+    rationale: string;
+    /** Confidence score 0–1 (optional — classifiers may omit this). */
+    confidence?: number;
+    /** When classification completed (epoch ms). */
+    classifiedAt: number;
+}
+/**
+ * A function that classifies a goal string.
+ *
+ * Implement this with a fast model call, a rule-based heuristic, or a
+ * combination.  Must resolve — never reject — returning SYSTEM_FAILURE
+ * instead of throwing when the input is unclassifiable.
+ */
+export type ClassifierFunction = (goal: string) => Promise<ClassificationResult>;
+/**
+ * Result of a routed execution attempt (FACTUAL_LOOKUP path).
+ * For COMPLEX_SYNTHESIS the caller handles execution via the normal DAG pipeline.
+ */
+export interface RouteResult {
+    /** The classification that drove this route. */
+    classification: ClassificationResult;
+    /** True when the request was short-circuited (FACTUAL_LOOKUP). */
+    shortCircuited: boolean;
+    /** Agent output for the short-circuit path, undefined otherwise. */
+    answer?: unknown;
+    /** Error message for SYSTEM_FAILURE. */
+    error?: string;
+}
+/** Options for {@link RouteClassifier}. */
+export interface RouteClassifierOptions {
+    /**
+     * Agent ID to call for FACTUAL_LOOKUP responses.
+     * Required when `executor` is provided.
+     */
+    lookupAgentId?: string;
+}
+/**
+ * A simple keyword / length heuristic classifier for when you don't want to
+ * spend tokens on a model call for every request.
+ *
+ * Treats goals of ≤ 15 words with question-like phrasing as FACTUAL_LOOKUP
+ * and everything else as COMPLEX_SYNTHESIS.
+ */
+export declare function createHeuristicClassifier(): ClassifierFunction;
+/**
+ * Build a classifier backed by an LLM via the Network-AI executor API.
+ *
+ * @param executor - The executor function from the adapter system
+ * @param classifierAgentId - Agent ID for the fast classification model
+ */
+export declare function createLLMClassifier(executor: (agentId: string, payload: {
+    action: string;
+    params: Record<string, unknown>;
+}, context: {
+    agentId: string;
+    taskId: string;
+    metadata?: Record<string, unknown>;
+}) => Promise<{
+    success: boolean;
+    data?: unknown;
+    error?: {
+        message: string;
+    };
+}>, classifierAgentId: string): ClassifierFunction;
+/**
+ * RouteClassifier evaluates a goal before DAG planning begins and decides
+ * whether to short-circuit to a single agent (FACTUAL_LOOKUP) or proceed
+ * with the full multi-agent pipeline (COMPLEX_SYNTHESIS).
+ *
+ * @example
+ * ```typescript
+ * const classifier = new RouteClassifier(createHeuristicClassifier());
+ * const { category } = await classifier.classify('What is the capital of France?');
+ * // category === 'FACTUAL_LOOKUP'
+ * ```
+ */
+export declare class RouteClassifier {
+    private classifierFn;
+    private options;
+    constructor(classifierFn: ClassifierFunction, options?: RouteClassifierOptions);
+    /**
+     * Classify a goal.
+     */
+    classify(goal: string): Promise<ClassificationResult>;
+    /**
+     * Classify a goal and, if FACTUAL_LOOKUP, short-circuit to a single agent.
+     *
+     * Returns the classification result and, when short-circuited, the agent's
+     * direct answer. The caller should check `result.shortCircuited` — if false,
+     * proceed with the normal DAG pipeline.
+     *
+     * @param goal - Natural language goal
+     * @param executor - Agent executor (required for FACTUAL_LOOKUP short-circuit)
+     * @param fallbackAgentId - Agent to call on FACTUAL_LOOKUP (overrides options.lookupAgentId)
+     */
+    route(goal: string, executor?: (agentId: string, payload: {
+        action: string;
+        params: Record<string, unknown>;
+    }, context: {
+        agentId: string;
+        taskId: string;
+        metadata?: Record<string, unknown>;
+    }) => Promise<{
+        success: boolean;
+        data?: unknown;
+        error?: {
+            message: string;
+        };
+    }>, fallbackAgentId?: string): Promise<RouteResult>;
+}
+//# sourceMappingURL=route-classifier.d.ts.map

package/dist/lib/route-classifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"route-classifier.d.ts","sourceRoot":"","sources":["../../lib/route-classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAMH,oCAAoC;AACpC,MAAM,MAAM,aAAa,GACrB,gBAAgB,GAChB,mBAAmB,GACnB,gBAAgB,CAAC;AAErB,yCAAyC;AACzC,MAAM,WAAW,oBAAoB;IACnC,4BAA4B;IAC5B,QAAQ,EAAE,aAAa,CAAC;IACxB,sDAAsD;IACtD,SAAS,EAAE,MAAM,CAAC;IAClB,mEAAmE;IACnE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gDAAgD;IAChD,YAAY,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;GAMG;AACH,MAAM,MAAM,kBAAkB,GAAG,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,oBAAoB,CAAC,CAAC;AAEjF;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,gDAAgD;IAChD,cAAc,EAAE,oBAAoB,CAAC;IACrC,kEAAkE;IAClE,cAAc,EAAE,OAAO,CAAC;IACxB,oEAAoE;IACpE,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,wCAAwC;IACxC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,2CAA2C;AAC3C,MAAM,WAAW,sBAAsB;IACrC;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAMD;;;;;;GAMG;AACH,wBAAgB,yBAAyB,IAAI,kBAAkB,CAwC9D;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,CACR,OAAO,EAAE,MAAM,EACf,OAAO,EAAE;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,EAC5D,OAAO,EAAE;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,KAC7E,OAAO,CAAC;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,CAAC;IAAC,KAAK,CAAC,EAAE;QAAE,OAAO,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,CAAC,EAC/E,iBAAiB,EAAE,MAAM,GACxB,kBAAkB,CAkEpB;AAMD;;;;;;;;;;;GAWG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,YAAY,CAAqB;IACzC,OAAO,CAAC,OAAO,CAAyB;gBAE5B,YAAY,EAAE,kBAAkB,EAAE,OAAO,GAAE,sBAA2B;IAKlF;;OAEG;IACG,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,oBAAoB,CAAC;IAY3D;;;;;;;;;;OAUG;IACG,KAAK,CACT,IAAI,EAAE,MAAM,EACZ,QAAQ,CAAC,EAAE,CACT,OAAO,EAAE,MAAM,EACf,OAAO,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;KAAE,EAC5D,OAAO,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;KAAE,KAC7E,OAAO,CAAC;QAAE,OAAO,EAAE,OAAO,CAAC;QAAC,IAAI,CAAC,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE;YAAE,OAAO,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,CAAC,EAC/E,eAAe,CAAC,EAAE,MAAM,GACvB,OAAO,CAAC,WAAW,CAAC;CA2CxB"}

package/dist/lib/route-classifier.js

@@ -0,0 +1,217 @@
+"use strict";
+/**
+ * Route Classifier — Short-Circuit Routing for Network-AI
+ *
+ * Classifies an incoming goal into one of three categories before any
+ * DAG planning occurs. Simple factual lookups are routed directly to a
+ * single agent, bypassing the Blackboard/locking layer entirely to save
+ * latency and token cost. Complex synthesis uses the full DAG pipeline.
+ * System failures are surfaced immediately.
+ *
+ * Zero external dependencies — the classifier function is pluggable so
+ * callers can use any model (Haiku, Llama-3-8B, rule-based heuristic, …).
+ *
+ * @module RouteClassifier
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RouteClassifier = void 0;
+exports.createHeuristicClassifier = createHeuristicClassifier;
+exports.createLLMClassifier = createLLMClassifier;
+// ============================================================================
+// RULE-BASED HEURISTIC CLASSIFIER (built-in, zero model cost)
+// ============================================================================
+/**
+ * A simple keyword / length heuristic classifier for when you don't want to
+ * spend tokens on a model call for every request.
+ *
+ * Treats goals of ≤ 15 words with question-like phrasing as FACTUAL_LOOKUP
+ * and everything else as COMPLEX_SYNTHESIS.
+ */
+function createHeuristicClassifier() {
+    const LOOKUP_STARTERS = [
+        'what is', 'what are', 'who is', 'who are', 'when is', 'when was',
+        'where is', 'where was', 'how many', 'how much', 'define ', 'list ',
+        'name ', 'tell me', 'give me', 'show me',
+    ];
+    return async (goal) => {
+        const normalized = goal.trim().toLowerCase();
+        if (!normalized) {
+            return {
+                category: 'SYSTEM_FAILURE',
+                rationale: 'Goal is empty',
+                confidence: 1,
+                classifiedAt: Date.now(),
+            };
+        }
+        const wordCount = normalized.split(/\s+/).length;
+        const isShort = wordCount <= 15;
+        const startsLikeQuestion = LOOKUP_STARTERS.some((s) => normalized.startsWith(s));
+        const endsWithQuestion = normalized.endsWith('?');
+        if (isShort && (startsLikeQuestion || endsWithQuestion)) {
+            return {
+                category: 'FACTUAL_LOOKUP',
+                rationale: `Short goal (${wordCount} words) with question-like phrasing.`,
+                confidence: 0.8,
+                classifiedAt: Date.now(),
+            };
+        }
+        return {
+            category: 'COMPLEX_SYNTHESIS',
+            rationale: `Goal requires multi-step reasoning (${wordCount} words).`,
+            confidence: 0.75,
+            classifiedAt: Date.now(),
+        };
+    };
+}
+/**
+ * Build a classifier backed by an LLM via the Network-AI executor API.
+ *
+ * @param executor - The executor function from the adapter system
+ * @param classifierAgentId - Agent ID for the fast classification model
+ */
+function createLLMClassifier(executor, classifierAgentId) {
+    return async (goal) => {
+        const prompt = [
+            'Classify the following goal into exactly one category:',
+            '  FACTUAL_LOOKUP    — simple factual question answerable in one step',
+            '  COMPLEX_SYNTHESIS — requires multi-step research/reasoning/execution',
+            '  SYSTEM_FAILURE    — invalid, malformed, or unclassifiable input',
+            '',
+            `GOAL: ${goal}`,
+            '',
+            'Respond with ONLY valid JSON matching this schema:',
+            '{"category":"FACTUAL_LOOKUP|COMPLEX_SYNTHESIS|SYSTEM_FAILURE","rationale":"...","confidence":0.0-1.0}',
+        ].join('\n');
+        try {
+            const result = await executor(classifierAgentId, { action: 'classify', params: { prompt } }, { agentId: classifierAgentId, taskId: `classify-${Date.now()}`, metadata: { type: 'route-classification' } });
+            if (!result.success || !result.data) {
+                return {
+                    category: 'COMPLEX_SYNTHESIS',
+                    rationale: 'Classifier returned no data — defaulting to COMPLEX_SYNTHESIS',
+                    confidence: 0.5,
+                    classifiedAt: Date.now(),
+                };
+            }
+            // Parse response
+            let parsed;
+            const raw = typeof result.data === 'string' ? result.data : JSON.stringify(result.data);
+            try {
+                // Strip markdown fences
+                const cleaned = raw.replace(/```[a-z]*\n?/g, '').replace(/```/g, '').trim();
+                const start = cleaned.indexOf('{');
+                const end = cleaned.lastIndexOf('}');
+                parsed = JSON.parse(cleaned.substring(start, end + 1));
+            }
+            catch {
+                return {
+                    category: 'COMPLEX_SYNTHESIS',
+                    rationale: 'Classifier response parse failed — defaulting to COMPLEX_SYNTHESIS',
+                    confidence: 0.4,
+                    classifiedAt: Date.now(),
+                };
+            }
+            const validCategories = ['FACTUAL_LOOKUP', 'COMPLEX_SYNTHESIS', 'SYSTEM_FAILURE'];
+            const category = validCategories.includes(parsed.category) ? parsed.category : 'COMPLEX_SYNTHESIS';
+            return {
+                category,
+                rationale: parsed.rationale ?? '',
+                confidence: typeof parsed.confidence === 'number' ? Math.min(1, Math.max(0, parsed.confidence)) : undefined,
+                classifiedAt: Date.now(),
+            };
+        }
+        catch (err) {
+            return {
+                category: 'COMPLEX_SYNTHESIS',
+                rationale: `Classifier error (${err.message}) — defaulting to COMPLEX_SYNTHESIS`,
+                confidence: 0.3,
+                classifiedAt: Date.now(),
+            };
+        }
+    };
+}
+// ============================================================================
+// ROUTE CLASSIFIER
+// ============================================================================
+/**
+ * RouteClassifier evaluates a goal before DAG planning begins and decides
+ * whether to short-circuit to a single agent (FACTUAL_LOOKUP) or proceed
+ * with the full multi-agent pipeline (COMPLEX_SYNTHESIS).
+ *
+ * @example
+ * ```typescript
+ * const classifier = new RouteClassifier(createHeuristicClassifier());
+ * const { category } = await classifier.classify('What is the capital of France?');
+ * // category === 'FACTUAL_LOOKUP'
+ * ```
+ */
+class RouteClassifier {
+    classifierFn;
+    options;
+    constructor(classifierFn, options = {}) {
+        this.classifierFn = classifierFn;
+        this.options = options;
+    }
+    /**
+     * Classify a goal.
+     */
+    async classify(goal) {
+        if (!goal || typeof goal !== 'string') {
+            return {
+                category: 'SYSTEM_FAILURE',
+                rationale: 'Goal must be a non-empty string',
+                confidence: 1,
+                classifiedAt: Date.now(),
+            };
+        }
+        return this.classifierFn(goal);
+    }
+    /**
+     * Classify a goal and, if FACTUAL_LOOKUP, short-circuit to a single agent.
+     *
+     * Returns the classification result and, when short-circuited, the agent's
+     * direct answer. The caller should check `result.shortCircuited` — if false,
+     * proceed with the normal DAG pipeline.
+     *
+     * @param goal - Natural language goal
+     * @param executor - Agent executor (required for FACTUAL_LOOKUP short-circuit)
+     * @param fallbackAgentId - Agent to call on FACTUAL_LOOKUP (overrides options.lookupAgentId)
+     */
+    async route(goal, executor, fallbackAgentId) {
+        const classification = await this.classify(goal);
+        if (classification.category === 'SYSTEM_FAILURE') {
+            return {
+                classification,
+                shortCircuited: true,
+                error: `System failure: ${classification.rationale}`,
+            };
+        }
+        if (classification.category === 'FACTUAL_LOOKUP') {
+            const agentId = fallbackAgentId ?? this.options.lookupAgentId;
+            if (!executor || !agentId) {
+                // No executor configured — fall through to DAG pipeline
+                return { classification, shortCircuited: false };
+            }
+            try {
+                const result = await executor(agentId, { action: 'answer', params: { goal } }, { agentId, taskId: `lookup-${Date.now()}`, metadata: { type: 'factual-lookup' } });
+                return {
+                    classification,
+                    shortCircuited: true,
+                    answer: result.data,
+                    error: result.success ? undefined : result.error?.message,
+                };
+            }
+            catch (err) {
+                return {
+                    classification,
+                    shortCircuited: true,
+                    error: err.message,
+                };
+            }
+        }
+        // COMPLEX_SYNTHESIS — proceed with DAG
+        return { classification, shortCircuited: false };
+    }
+}
+exports.RouteClassifier = RouteClassifier;
+//# sourceMappingURL=route-classifier.js.map

package/dist/lib/route-classifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"route-classifier.js","sourceRoot":"","sources":["../../lib/route-classifier.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;;AAoEH,8DAwCC;AAQD,kDAyEC;AApID,+EAA+E;AAC/E,8DAA8D;AAC9D,+EAA+E;AAE/E;;;;;;GAMG;AACH,SAAgB,yBAAyB;IACvC,MAAM,eAAe,GAAG;QACtB,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU;QACjE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO;QACnE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS;KACzC,CAAC;IAEF,OAAO,KAAK,EAAE,IAAY,EAAiC,EAAE;QAC3D,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAE7C,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO;gBACL,QAAQ,EAAE,gBAAgB;gBAC1B,SAAS,EAAE,eAAe;gBAC1B,UAAU,EAAE,CAAC;gBACb,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;aACzB,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;QACjD,MAAM,OAAO,GAAG,SAAS,IAAI,EAAE,CAAC;QAChC,MAAM,kBAAkB,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,MAAM,gBAAgB,GAAG,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAElD,IAAI,OAAO,IAAI,CAAC,kBAAkB,IAAI,gBAAgB,CAAC,EAAE,CAAC;YACxD,OAAO;gBACL,QAAQ,EAAE,gBAAgB;gBAC1B,SAAS,EAAE,eAAe,SAAS,sCAAsC;gBACzE,UAAU,EAAE,GAAG;gBACf,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;aACzB,CAAC;QACJ,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,mBAAmB;YAC7B,SAAS,EAAE,uCAAuC,SAAS,UAAU;YACrE,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;SACzB,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CACjC,QAI+E,EAC/E,iBAAyB;IAEzB,OAAO,KAAK,EAAE,IAAY,EAAiC,EAAE;QAC3D,MAAM,MAAM,GAAG;YACb,wDAAwD;YACxD,sEAAsE;YACtE,wEAAwE;YACxE,mEAAmE;YACnE,EAAE;YACF,SAAS,IAAI,EAAE;YACf,EAAE;YACF,oDAAoD;YACpD,uGAAuG;SACxG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,QAAQ,CAC3B,iBAAiB,EACjB,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,EAAE,EAC1C,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,EAAE,YAAY,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,sBAAsB,EAAE,EAAE,CAC7G,CAAC;YAEF,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBACpC,OAAO;oBACL,QAAQ,EAAE,mBAAmB;oBAC7B,SAAS,EAAE,+DAA+D;oBAC1E,UAAU,EAAE,GAAG;oBACf,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;iBACzB,CAAC;YACJ,CAAC;YAED,iBAAiB;YACjB,IAAI,MAA2E,CAAC;YAChF,MAAM,GAAG,GAAG,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACxF,IAAI,CAAC;gBACH,wBAAwB;gBACxB,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC5E,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBACnC,MAAM,GAAG,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBACrC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACzD,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO;oBACL,QAAQ,EAAE,mBAAmB;oBAC7B,SAAS,EAAE,oEAAoE;oBAC/E,UAAU,EAAE,GAAG;oBACf,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;iBACzB,CAAC;YACJ,CAAC;YAED,MAAM,eAAe,GAAoB,CAAC,gBAAgB,EAAE,mBAAmB,EAAE,gBAAgB,CAAC,CAAC;YACnG,MAAM,QAAQ,GAAG,eAAe,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,mBAAmB,CAAC;YAEnG,OAAO;gBACL,QAAQ;gBACR,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,EAAE;gBACjC,UAAU,EAAE,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;gBAC3G,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;aACzB,CAAC;QACJ,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO;gBACL,QAAQ,EAAE,mBAAmB;gBAC7B,SAAS,EAAE,qBAAsB,GAAa,CAAC,OAAO,qCAAqC;gBAC3F,UAAU,EAAE,GAAG;gBACf,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;aACzB,CAAC;QACJ,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;;;;;;;;;;GAWG;AACH,MAAa,eAAe;IAClB,YAAY,CAAqB;IACjC,OAAO,CAAyB;IAExC,YAAY,YAAgC,EAAE,UAAkC,EAAE;QAChF,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,IAAY;QACzB,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACtC,OAAO;gBACL,QAAQ,EAAE,gBAAgB;gBAC1B,SAAS,EAAE,iCAAiC;gBAC5C,UAAU,EAAE,CAAC;gBACb,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;aACzB,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,KAAK,CACT,IAAY,EACZ,QAI+E,EAC/E,eAAwB;QAExB,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAEjD,IAAI,cAAc,CAAC,QAAQ,KAAK,gBAAgB,EAAE,CAAC;YACjD,OAAO;gBACL,cAAc;gBACd,cAAc,EAAE,IAAI;gBACpB,KAAK,EAAE,mBAAmB,cAAc,CAAC,SAAS,EAAE;aACrD,CAAC;QACJ,CAAC;QAED,IAAI,cAAc,CAAC,QAAQ,KAAK,gBAAgB,EAAE,CAAC;YACjD,MAAM,OAAO,GAAG,eAAe,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC;YAE9D,IAAI,CAAC,QAAQ,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC1B,wDAAwD;gBACxD,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;YACnD,CAAC;YAED,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,QAAQ,CAC3B,OAAO,EACP,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,EAAE,EACtC,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,CAClF,CAAC;gBACF,OAAO;oBACL,cAAc;oBACd,cAAc,EAAE,IAAI;oBACpB,MAAM,EAAE,MAAM,CAAC,IAAI;oBACnB,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO;iBAC1D,CAAC;YACJ,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,OAAO;oBACL,cAAc;oBACd,cAAc,EAAE,IAAI;oBACpB,KAAK,EAAG,GAAa,CAAC,OAAO;iBAC9B,CAAC;YACJ,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;IACnD,CAAC;CACF;AAtFD,0CAsFC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "network-ai",
-  "version": "5.2.2",
+  "version": "5.3.0",
   "description": "AI agent orchestration framework for TypeScript/Node.js - 29 adapters (LangChain, AutoGen, CrewAI, OpenAI Assistants, LlamaIndex, Semantic Kernel, Haystack, DSPy, Agno, MCP, OpenClaw, A2A, Codex, MiniMax, NemoClaw, APS, Copilot, LangGraph, Anthropic Computer Use, OpenAI Agents SDK, Vertex AI, Pydantic AI, Browser Agent, Hermes, Orchestrator, RLM + streaming variants). Built-in CLI, security, swarm intelligence, real-time streaming, and agentic workflow patterns.",
   "homepage": "https://network-ai.org",
   "main": "dist/index.js",
@@ -40,6 +40,7 @@
     "test:phase9": "npx ts-node test-phase9.ts",
     "test:phase10": "npx ts-node test-phase10.ts",
     "test:topology": "npx ts-node test-topology.ts",
+    "test:phase12": "npx ts-node test-phase12.ts",
     "test:all": "npx ts-node run-tests.ts",
     "setup": "npx ts-node setup.ts",
     "setup:check": "npx ts-node setup.ts --check",
@@ -103,7 +104,7 @@
   "devDependencies": {
     "@types/node": "^25.6.0",
     "dotenv": "^17.4.2",
-    "openai": "^6.34.0",
+    "openai": "^6.36.0",
     "ts-node": "^10.9.2",
     "typescript": "^6.0.3"
   },

package/socket.json

@@ -1,4 +1,4 @@
-{
+            {
   "version": 2,
   "ignore": {
     "evalDynamicCodeExecution": [