agentic-flow 3.4.3 → 3.5.0

package/dist/integrations/index.d.ts

@@ -6,6 +6,8 @@ export { scanPromptInjection, promptInjectionEngine, getInjectionPolicy } from '
 export type { InjectionScan, InjectionThreat, InjectionPolicy, InjectionSeverity } from './prompt-injection.js';
 export { partitionTaskGraph } from './task-partition.js';
 export type { TaskDependency, TaskPartition } from './task-partition.js';
+export { scheduleTaskGraph } from './task-schedule.js';
+export type { ScheduleTask, ScheduleDependency, TaskSchedule } from './task-schedule.js';
 export { solveLinearSystem, pageRank, loadSublinearCore } from './sublinear.js';
 export type { LinearSolveResult, PageRankResult, PageRankOptions, PageRankEdge, MatrixInput, SparseEntry, SolveMethod, SublinearEngine } from './sublinear.js';
 export { applyAgentBoosterEdit, getAgentBoosterLibrary } from './agent-booster.js';

package/dist/integrations/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/integrations/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACvG,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAChH,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,YAAY,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACzE,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAChF,YAAY,EAAE,iBAAiB,EAAE,cAAc,EAAE,eAAe,EAAE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAC/J,OAAO,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AACnF,YAAY,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAC5D,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAC7H,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/integrations/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACvG,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAChH,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,YAAY,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACzE,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,YAAY,EAAE,YAAY,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACzF,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAChF,YAAY,EAAE,iBAAiB,EAAE,cAAc,EAAE,eAAe,EAAE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAC/J,OAAO,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AACnF,YAAY,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAC5D,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAC7H,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC"}

package/dist/integrations/index.js

@@ -4,6 +4,7 @@
  */
 export { scanPromptInjection, promptInjectionEngine, getInjectionPolicy } from './prompt-injection.js';
 export { partitionTaskGraph } from './task-partition.js';
+export { scheduleTaskGraph } from './task-schedule.js';
 export { solveLinearSystem, pageRank, loadSublinearCore } from './sublinear.js';
 export { applyAgentBoosterEdit, getAgentBoosterLibrary } from './agent-booster.js';
 export { OnnxWasmTextEmbedder, getOnnxWasmEmbedder, loadOnnxWasmModule, onnxWasmModelCached } from './onnx-wasm-embedder.js';

package/dist/integrations/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/integrations/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAEvG,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAEzD,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAEhF,OAAO,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AAEnF,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAC7H,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC","sourcesContent":["/**\n * agentic-flow/integrations — programmatic access to the optional ruvnet\n * package integrations (each with a built-in fallback).\n */\n\nexport { scanPromptInjection, promptInjectionEngine, getInjectionPolicy } from './prompt-injection.js';\nexport type { InjectionScan, InjectionThreat, InjectionPolicy, InjectionSeverity } from './prompt-injection.js';\nexport { partitionTaskGraph } from './task-partition.js';\nexport type { TaskDependency, TaskPartition } from './task-partition.js';\nexport { solveLinearSystem, pageRank, loadSublinearCore } from './sublinear.js';\nexport type { LinearSolveResult, PageRankResult, PageRankOptions, PageRankEdge, MatrixInput, SparseEntry, SolveMethod, SublinearEngine } from './sublinear.js';\nexport { applyAgentBoosterEdit, getAgentBoosterLibrary } from './agent-booster.js';\nexport type { BoosterEditResult } from './agent-booster.js';\nexport { OnnxWasmTextEmbedder, getOnnxWasmEmbedder, loadOnnxWasmModule, onnxWasmModelCached } from './onnx-wasm-embedder.js';\nexport { isOptionalInstalled } from './optional.js';\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/integrations/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAEvG,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAEzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAEvD,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAEhF,OAAO,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AAEnF,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAC7H,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC","sourcesContent":["/**\n * agentic-flow/integrations — programmatic access to the optional ruvnet\n * package integrations (each with a built-in fallback).\n */\n\nexport { scanPromptInjection, promptInjectionEngine, getInjectionPolicy } from './prompt-injection.js';\nexport type { InjectionScan, InjectionThreat, InjectionPolicy, InjectionSeverity } from './prompt-injection.js';\nexport { partitionTaskGraph } from './task-partition.js';\nexport type { TaskDependency, TaskPartition } from './task-partition.js';\nexport { scheduleTaskGraph } from './task-schedule.js';\nexport type { ScheduleTask, ScheduleDependency, TaskSchedule } from './task-schedule.js';\nexport { solveLinearSystem, pageRank, loadSublinearCore } from './sublinear.js';\nexport type { LinearSolveResult, PageRankResult, PageRankOptions, PageRankEdge, MatrixInput, SparseEntry, SolveMethod, SublinearEngine } from './sublinear.js';\nexport { applyAgentBoosterEdit, getAgentBoosterLibrary } from './agent-booster.js';\nexport type { BoosterEditResult } from './agent-booster.js';\nexport { OnnxWasmTextEmbedder, getOnnxWasmEmbedder, loadOnnxWasmModule, onnxWasmModelCached } from './onnx-wasm-embedder.js';\nexport { isOptionalInstalled } from './optional.js';\n"]}

package/dist/integrations/task-schedule.d.ts

@@ -0,0 +1,51 @@
+/**
+ * Schedule a task-dependency graph: what can run now, what runs in parallel,
+ * and which chain of tasks bounds the total time.
+ *
+ * Input is a DAG where `{ from, to }` means `from` must finish before `to`
+ * starts, and each task has a cost (estimated duration, tokens, dollars — any
+ * additive unit). Output:
+ *   - `order`: a dependency-respecting execution order;
+ *   - `waves`: tasks grouped by dependency depth (input order within a wave), so
+ *     every task in a wave can be handed to a separate agent at the same time;
+ *   - `criticalPath`: the most expensive dependency chain. Its cost is the
+ *     makespan with unlimited agents, and speeding up anything off this path
+ *     does not shorten the run.
+ *
+ * Engine: `@ruvector/rudag` (optionalDependency, Rust/WASM topological sort and
+ * critical path) when installed; a built-in Kahn sort + longest-path DP
+ * otherwise. Both reject cycles and agree on the critical-path cost.
+ *
+ * Complements `partitionTaskGraph` (task-partition.ts): partition answers
+ * "where to split work between two teams", scheduling answers "in what order,
+ * how parallel, and what is the bottleneck".
+ */
+export interface ScheduleTask {
+    id: string;
+    /** Additive cost of the task (time, tokens, ...). Default 1. Finite, >= 0. */
+    cost?: number;
+}
+export interface ScheduleDependency {
+    /** Must finish before `to` starts. */
+    from: string;
+    to: string;
+}
+export interface TaskSchedule {
+    order: string[];
+    waves: string[][];
+    criticalPath: {
+        tasks: string[];
+        cost: number;
+    };
+    /** Earliest start per task with unlimited parallel agents. */
+    earliestStart: Record<string, number>;
+    /** Sum of all task costs (the makespan with one agent). */
+    totalCost: number;
+    /** totalCost / criticalPath.cost: the speed-up ceiling from parallel agents. */
+    parallelism: number;
+    engine: 'rudag' | 'builtin';
+}
+export declare function scheduleTaskGraph(tasks: Array<string | ScheduleTask>, dependencies: ScheduleDependency[], options?: {
+    engine?: 'auto' | 'builtin';
+}): Promise<TaskSchedule>;
+//# sourceMappingURL=task-schedule.d.ts.map

package/dist/integrations/task-schedule.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-schedule.d.ts","sourceRoot":"","sources":["../../src/integrations/task-schedule.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAIH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,8EAA8E;IAC9E,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,kBAAkB;IACjC,sCAAsC;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;IAClB,YAAY,EAAE;QAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;IAChD,8DAA8D;IAC9D,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtC,2DAA2D;IAC3D,SAAS,EAAE,MAAM,CAAC;IAClB,gFAAgF;IAChF,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,OAAO,GAAG,SAAS,CAAC;CAC7B;AA8HD,wBAAsB,iBAAiB,CACrC,KAAK,EAAE,KAAK,CAAC,MAAM,GAAG,YAAY,CAAC,EACnC,YAAY,EAAE,kBAAkB,EAAE,EAClC,OAAO,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAAO,GAC5C,OAAO,CAAC,YAAY,CAAC,CAyEvB"}

package/dist/integrations/task-schedule.js

@@ -0,0 +1,222 @@
+/**
+ * Schedule a task-dependency graph: what can run now, what runs in parallel,
+ * and which chain of tasks bounds the total time.
+ *
+ * Input is a DAG where `{ from, to }` means `from` must finish before `to`
+ * starts, and each task has a cost (estimated duration, tokens, dollars — any
+ * additive unit). Output:
+ *   - `order`: a dependency-respecting execution order;
+ *   - `waves`: tasks grouped by dependency depth (input order within a wave), so
+ *     every task in a wave can be handed to a separate agent at the same time;
+ *   - `criticalPath`: the most expensive dependency chain. Its cost is the
+ *     makespan with unlimited agents, and speeding up anything off this path
+ *     does not shorten the run.
+ *
+ * Engine: `@ruvector/rudag` (optionalDependency, Rust/WASM topological sort and
+ * critical path) when installed; a built-in Kahn sort + longest-path DP
+ * otherwise. Both reject cycles and agree on the critical-path cost.
+ *
+ * Complements `partitionTaskGraph` (task-partition.ts): partition answers
+ * "where to split work between two teams", scheduling answers "in what order,
+ * how parallel, and what is the bottleneck".
+ */
+import { importOptional } from './optional.js';
+/** rudag's WASM DAG takes integer operator codes; 255 is its user-defined slot. */
+const RUDAG_CUSTOM_OPERATOR = 255;
+function normalize(tasks, deps) {
+    const index = new Map();
+    const names = [];
+    const costs = [];
+    const add = (id, cost) => {
+        const key = String(id);
+        let i = index.get(key);
+        if (i === undefined) {
+            i = names.length;
+            index.set(key, i);
+            names.push(key);
+            costs.push(1);
+        }
+        if (cost !== undefined) {
+            if (!Number.isFinite(cost) || cost < 0)
+                throw new Error(`invalid cost ${cost} for task ${key}`);
+            costs[i] = cost;
+        }
+        return i;
+    };
+    for (const t of tasks) {
+        if (typeof t === 'string')
+            add(t);
+        else
+            add(t.id, t.cost);
+    }
+    const seen = new Set();
+    const edges = [];
+    for (const d of deps) {
+        const a = add(d.from);
+        const b = add(d.to);
+        if (a === b)
+            throw new Error(`dependency cycle: ${names[a]} -> ${names[a]}`);
+        const key = `${a},${b}`;
+        if (seen.has(key))
+            continue;
+        seen.add(key);
+        edges.push([a, b]);
+    }
+    return { names, costs, edges };
+}
+/** Find one cycle among `remaining` vertices (all of which lie on or lead into a cycle). */
+function findCycle(n, edges, remaining) {
+    const out = Array.from({ length: n }, () => []);
+    for (const [a, b] of edges)
+        if (remaining.has(a) && remaining.has(b))
+            out[a].push(b);
+    const state = new Map();
+    const stack = [];
+    const visit = (v) => {
+        state.set(v, 1);
+        stack.push(v);
+        for (const w of out[v]) {
+            if (state.get(w) === 1)
+                return [...stack.slice(stack.indexOf(w)), w];
+            if (!state.has(w)) {
+                const c = visit(w);
+                if (c)
+                    return c;
+            }
+        }
+        stack.pop();
+        state.set(v, 2);
+        return null;
+    };
+    for (const v of remaining) {
+        if (!state.has(v)) {
+            const c = visit(v);
+            if (c)
+                return c;
+        }
+    }
+    return [];
+}
+function builtinOrder(n, edges) {
+    const indeg = new Array(n).fill(0);
+    const out = Array.from({ length: n }, () => []);
+    for (const [a, b] of edges) {
+        out[a].push(b);
+        indeg[b]++;
+    }
+    const queue = [];
+    for (let i = 0; i < n; i++)
+        if (indeg[i] === 0)
+            queue.push(i);
+    const order = [];
+    for (let h = 0; h < queue.length; h++) {
+        const v = queue[h];
+        order.push(v);
+        for (const w of out[v])
+            if (--indeg[w] === 0)
+                queue.push(w);
+    }
+    return order;
+}
+/** Longest (most expensive) path over a topological order; path cost counts node costs. */
+function longestPath(order, costs, edges) {
+    const preds = costs.map(() => []);
+    for (const [a, b] of edges)
+        preds[b].push(a);
+    const finish = new Array(costs.length).fill(0);
+    const via = new Array(costs.length).fill(-1);
+    for (const v of order) {
+        let best = 0;
+        let bestU = -1;
+        for (const u of preds[v]) {
+            if (bestU === -1 || finish[u] > best) {
+                best = finish[u];
+                bestU = u;
+            }
+        }
+        via[v] = bestU;
+        finish[v] = best + costs[v];
+    }
+    let end = -1;
+    for (const v of order)
+        if (end === -1 || finish[v] > finish[end])
+            end = v;
+    const path = [];
+    for (let v = end; v !== -1; v = via[v])
+        path.unshift(v);
+    return { path, cost: end === -1 ? 0 : finish[end] };
+}
+export async function scheduleTaskGraph(tasks, dependencies, options = {}) {
+    const { names, costs, edges } = normalize(tasks, dependencies);
+    const n = names.length;
+    let order = null;
+    let critical = null;
+    let engine = 'builtin';
+    if (n > 0 && options.engine !== 'builtin') {
+        const mod = await importOptional('@ruvector/rudag');
+        if (mod?.RuDag) {
+            // storage: null keeps rudag off IndexedDB/the filesystem; one instance per call.
+            const dag = await new mod.RuDag({ storage: null, autoSave: false }).init();
+            try {
+                const ids = costs.map((c) => dag.addNode(RUDAG_CUSTOM_OPERATOR, c));
+                let acyclic = true;
+                for (const [a, b] of edges) {
+                    // rudag refuses an edge that would close a cycle.
+                    if (!dag.addEdge(ids[a], ids[b])) {
+                        acyclic = false;
+                        break;
+                    }
+                }
+                if (acyclic) {
+                    const back = new Map(ids.map((id, i) => [id, i]));
+                    order = dag.topoSort().map((id) => back.get(id));
+                    const cp = dag.criticalPath();
+                    critical = { path: cp.path.map((id) => back.get(id)), cost: cp.cost };
+                    engine = 'rudag';
+                }
+            }
+            finally {
+                dag.dispose();
+            }
+        }
+    }
+    if (!order) {
+        order = builtinOrder(n, edges);
+        if (order.length < n) {
+            const placed = new Set(order);
+            const remaining = new Set(names.map((_, i) => i).filter((i) => !placed.has(i)));
+            const cycle = findCycle(n, edges, remaining);
+            throw new Error(`dependency cycle: ${cycle.map((i) => names[i]).join(' -> ')}`);
+        }
+        critical = longestPath(order, costs, edges);
+        engine = 'builtin';
+    }
+    // Earliest start and waves: the same for either engine, given a valid order.
+    const preds = names.map(() => []);
+    for (const [a, b] of edges)
+        preds[b].push(a);
+    const start = new Array(n).fill(0);
+    const level = new Array(n).fill(0);
+    for (const v of order) {
+        for (const u of preds[v]) {
+            start[v] = Math.max(start[v], start[u] + costs[u]);
+            level[v] = Math.max(level[v], level[u] + 1);
+        }
+    }
+    // Within a wave, tasks keep their input order, so both engines return identical waves.
+    const waves = [];
+    for (let v = 0; v < n; v++)
+        (waves[level[v]] ??= []).push(names[v]);
+    const totalCost = costs.reduce((s, c) => s + c, 0);
+    const cpCost = critical.cost;
+    return {
+        order: order.map((i) => names[i]),
+        waves,
+        criticalPath: { tasks: critical.path.map((i) => names[i]), cost: cpCost },
+        earliestStart: Object.fromEntries(order.map((i) => [names[i], start[i]])),
+        totalCost,
+        parallelism: cpCost > 0 ? totalCost / cpCost : n > 0 ? n : 0,
+        engine,
+    };
+}
+//# sourceMappingURL=task-schedule.js.map

package/dist/integrations/task-schedule.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-schedule.js","sourceRoot":"","sources":["../../src/integrations/task-schedule.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AA2B/C,mFAAmF;AACnF,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAclC,SAAS,SAAS,CAAC,KAAmC,EAAE,IAA0B;IAChF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,GAAG,GAAG,CAAC,EAAU,EAAE,IAAa,EAAE,EAAE;QACxC,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;YACjB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,IAAI,aAAa,GAAG,EAAE,CAAC,CAAC;YAChG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,GAAG,CAAC,CAAC,CAAC,CAAC;;YAC7B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAA4B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7E,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACjC,CAAC;AAED,4FAA4F;AAC5F,SAAS,SAAS,CAAC,CAAS,EAAE,KAA8B,EAAE,SAAsB;IAClF,MAAM,GAAG,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC5D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiB,CAAC;IACvC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,CAAC,CAAS,EAAmB,EAAE;QAC3C,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACvB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,CAAC;oBAAE,OAAO,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QACD,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC;gBAAE,OAAO,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,YAAY,CAAC,CAAS,EAAE,KAA8B;IAC7D,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,GAAG,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC5D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACb,CAAC;IACD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,2FAA2F;AAC3F,SAAS,WAAW,CAAC,KAAe,EAAE,KAAe,EAAE,KAA8B;IACnF,MAAM,KAAK,GAAe,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACzB,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;gBACrC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjB,KAAK,GAAG,CAAC,CAAC;YACZ,CAAC;QACH,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACf,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;IACb,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC;YAAE,GAAG,GAAG,CAAC,CAAC;IAC1E,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;AACtD,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,KAAmC,EACnC,YAAkC,EAClC,UAA2C,EAAE;IAE7C,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IAC/D,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,KAAK,GAAoB,IAAI,CAAC;IAClC,IAAI,QAAQ,GAA4C,IAAI,CAAC;IAC7D,IAAI,MAAM,GAA2B,SAAS,CAAC;IAE/C,IAAI,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC1C,MAAM,GAAG,GAAG,MAAM,cAAc,CAAc,iBAAiB,CAAC,CAAC;QACjE,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC;YACf,iFAAiF;YACjF,MAAM,GAAG,GAAG,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YAC3E,IAAI,CAAC;gBACH,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpE,IAAI,OAAO,GAAG,IAAI,CAAC;gBACnB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;oBAC3B,kDAAkD;oBAClD,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBACjC,OAAO,GAAG,KAAK,CAAC;wBAChB,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;oBAClD,MAAM,EAAE,GAAG,GAAG,CAAC,YAAY,EAAE,CAAC;oBAC9B,QAAQ,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;oBACvE,MAAM,GAAG,OAAO,CAAC;gBACnB,CAAC;YACH,CAAC;oBAAS,CAAC;gBACT,GAAG,CAAC,OAAO,EAAE,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;YAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC7C,MAAM,IAAI,KAAK,CAAC,qBAAqB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC;QACD,QAAQ,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC5C,MAAM,GAAG,SAAS,CAAC;IACrB,CAAC;IAED,6EAA6E;IAC7E,MAAM,KAAK,GAAe,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACzB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IACD,uFAAuF;IACvF,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,MAAM,GAAG,QAAS,CAAC,IAAI,CAAC;IAC9B,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACjC,KAAK;QACL,YAAY,EAAE,EAAE,KAAK,EAAE,QAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE;QAC1E,aAAa,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,SAAS;QACT,WAAW,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM;KACP,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Schedule a task-dependency graph: what can run now, what runs in parallel,\n * and which chain of tasks bounds the total time.\n *\n * Input is a DAG where `{ from, to }` means `from` must finish before `to`\n * starts, and each task has a cost (estimated duration, tokens, dollars — any\n * additive unit). Output:\n *   - `order`: a dependency-respecting execution order;\n *   - `waves`: tasks grouped by dependency depth (input order within a wave), so\n *     every task in a wave can be handed to a separate agent at the same time;\n *   - `criticalPath`: the most expensive dependency chain. Its cost is the\n *     makespan with unlimited agents, and speeding up anything off this path\n *     does not shorten the run.\n *\n * Engine: `@ruvector/rudag` (optionalDependency, Rust/WASM topological sort and\n * critical path) when installed; a built-in Kahn sort + longest-path DP\n * otherwise. Both reject cycles and agree on the critical-path cost.\n *\n * Complements `partitionTaskGraph` (task-partition.ts): partition answers\n * \"where to split work between two teams\", scheduling answers \"in what order,\n * how parallel, and what is the bottleneck\".\n */\n\nimport { importOptional } from './optional.js';\n\nexport interface ScheduleTask {\n  id: string;\n  /** Additive cost of the task (time, tokens, ...). Default 1. Finite, >= 0. */\n  cost?: number;\n}\n\nexport interface ScheduleDependency {\n  /** Must finish before `to` starts. */\n  from: string;\n  to: string;\n}\n\nexport interface TaskSchedule {\n  order: string[];\n  waves: string[][];\n  criticalPath: { tasks: string[]; cost: number };\n  /** Earliest start per task with unlimited parallel agents. */\n  earliestStart: Record<string, number>;\n  /** Sum of all task costs (the makespan with one agent). */\n  totalCost: number;\n  /** totalCost / criticalPath.cost: the speed-up ceiling from parallel agents. */\n  parallelism: number;\n  engine: 'rudag' | 'builtin';\n}\n\n/** rudag's WASM DAG takes integer operator codes; 255 is its user-defined slot. */\nconst RUDAG_CUSTOM_OPERATOR = 255;\n\ninterface RuDagInstance {\n  init(): Promise<RuDagInstance>;\n  addNode(operator: number, cost: number): number;\n  addEdge(from: number, to: number): boolean;\n  topoSort(): number[];\n  criticalPath(): { path: number[]; cost: number };\n  dispose(): void;\n}\ninterface RuDagModule {\n  RuDag: new (options: { storage: null; autoSave: false }) => RuDagInstance;\n}\n\nfunction normalize(tasks: Array<string | ScheduleTask>, deps: ScheduleDependency[]) {\n  const index = new Map<string, number>();\n  const names: string[] = [];\n  const costs: number[] = [];\n  const add = (id: string, cost?: number) => {\n    const key = String(id);\n    let i = index.get(key);\n    if (i === undefined) {\n      i = names.length;\n      index.set(key, i);\n      names.push(key);\n      costs.push(1);\n    }\n    if (cost !== undefined) {\n      if (!Number.isFinite(cost) || cost < 0) throw new Error(`invalid cost ${cost} for task ${key}`);\n      costs[i] = cost;\n    }\n    return i;\n  };\n  for (const t of tasks) {\n    if (typeof t === 'string') add(t);\n    else add(t.id, t.cost);\n  }\n  const seen = new Set<string>();\n  const edges: Array<[number, number]> = [];\n  for (const d of deps) {\n    const a = add(d.from);\n    const b = add(d.to);\n    if (a === b) throw new Error(`dependency cycle: ${names[a]} -> ${names[a]}`);\n    const key = `${a},${b}`;\n    if (seen.has(key)) continue;\n    seen.add(key);\n    edges.push([a, b]);\n  }\n  return { names, costs, edges };\n}\n\n/** Find one cycle among `remaining` vertices (all of which lie on or lead into a cycle). */\nfunction findCycle(n: number, edges: Array<[number, number]>, remaining: Set<number>): number[] {\n  const out: number[][] = Array.from({ length: n }, () => []);\n  for (const [a, b] of edges) if (remaining.has(a) && remaining.has(b)) out[a].push(b);\n  const state = new Map<number, 1 | 2>();\n  const stack: number[] = [];\n  const visit = (v: number): number[] | null => {\n    state.set(v, 1);\n    stack.push(v);\n    for (const w of out[v]) {\n      if (state.get(w) === 1) return [...stack.slice(stack.indexOf(w)), w];\n      if (!state.has(w)) {\n        const c = visit(w);\n        if (c) return c;\n      }\n    }\n    stack.pop();\n    state.set(v, 2);\n    return null;\n  };\n  for (const v of remaining) {\n    if (!state.has(v)) {\n      const c = visit(v);\n      if (c) return c;\n    }\n  }\n  return [];\n}\n\nfunction builtinOrder(n: number, edges: Array<[number, number]>): number[] {\n  const indeg = new Array(n).fill(0);\n  const out: number[][] = Array.from({ length: n }, () => []);\n  for (const [a, b] of edges) {\n    out[a].push(b);\n    indeg[b]++;\n  }\n  const queue: number[] = [];\n  for (let i = 0; i < n; i++) if (indeg[i] === 0) queue.push(i);\n  const order: number[] = [];\n  for (let h = 0; h < queue.length; h++) {\n    const v = queue[h];\n    order.push(v);\n    for (const w of out[v]) if (--indeg[w] === 0) queue.push(w);\n  }\n  return order;\n}\n\n/** Longest (most expensive) path over a topological order; path cost counts node costs. */\nfunction longestPath(order: number[], costs: number[], edges: Array<[number, number]>) {\n  const preds: number[][] = costs.map(() => []);\n  for (const [a, b] of edges) preds[b].push(a);\n  const finish = new Array(costs.length).fill(0);\n  const via = new Array(costs.length).fill(-1);\n  for (const v of order) {\n    let best = 0;\n    let bestU = -1;\n    for (const u of preds[v]) {\n      if (bestU === -1 || finish[u] > best) {\n        best = finish[u];\n        bestU = u;\n      }\n    }\n    via[v] = bestU;\n    finish[v] = best + costs[v];\n  }\n  let end = -1;\n  for (const v of order) if (end === -1 || finish[v] > finish[end]) end = v;\n  const path: number[] = [];\n  for (let v = end; v !== -1; v = via[v]) path.unshift(v);\n  return { path, cost: end === -1 ? 0 : finish[end] };\n}\n\nexport async function scheduleTaskGraph(\n  tasks: Array<string | ScheduleTask>,\n  dependencies: ScheduleDependency[],\n  options: { engine?: 'auto' | 'builtin' } = {},\n): Promise<TaskSchedule> {\n  const { names, costs, edges } = normalize(tasks, dependencies);\n  const n = names.length;\n  let order: number[] | null = null;\n  let critical: { path: number[]; cost: number } | null = null;\n  let engine: TaskSchedule['engine'] = 'builtin';\n\n  if (n > 0 && options.engine !== 'builtin') {\n    const mod = await importOptional<RuDagModule>('@ruvector/rudag');\n    if (mod?.RuDag) {\n      // storage: null keeps rudag off IndexedDB/the filesystem; one instance per call.\n      const dag = await new mod.RuDag({ storage: null, autoSave: false }).init();\n      try {\n        const ids = costs.map((c) => dag.addNode(RUDAG_CUSTOM_OPERATOR, c));\n        let acyclic = true;\n        for (const [a, b] of edges) {\n          // rudag refuses an edge that would close a cycle.\n          if (!dag.addEdge(ids[a], ids[b])) {\n            acyclic = false;\n            break;\n          }\n        }\n        if (acyclic) {\n          const back = new Map(ids.map((id, i) => [id, i]));\n          order = dag.topoSort().map((id) => back.get(id)!);\n          const cp = dag.criticalPath();\n          critical = { path: cp.path.map((id) => back.get(id)!), cost: cp.cost };\n          engine = 'rudag';\n        }\n      } finally {\n        dag.dispose();\n      }\n    }\n  }\n\n  if (!order) {\n    order = builtinOrder(n, edges);\n    if (order.length < n) {\n      const placed = new Set(order);\n      const remaining = new Set(names.map((_, i) => i).filter((i) => !placed.has(i)));\n      const cycle = findCycle(n, edges, remaining);\n      throw new Error(`dependency cycle: ${cycle.map((i) => names[i]).join(' -> ')}`);\n    }\n    critical = longestPath(order, costs, edges);\n    engine = 'builtin';\n  }\n\n  // Earliest start and waves: the same for either engine, given a valid order.\n  const preds: number[][] = names.map(() => []);\n  for (const [a, b] of edges) preds[b].push(a);\n  const start = new Array(n).fill(0);\n  const level = new Array(n).fill(0);\n  for (const v of order) {\n    for (const u of preds[v]) {\n      start[v] = Math.max(start[v], start[u] + costs[u]);\n      level[v] = Math.max(level[v], level[u] + 1);\n    }\n  }\n  // Within a wave, tasks keep their input order, so both engines return identical waves.\n  const waves: string[][] = [];\n  for (let v = 0; v < n; v++) (waves[level[v]] ??= []).push(names[v]);\n\n  const totalCost = costs.reduce((s, c) => s + c, 0);\n  const cpCost = critical!.cost;\n  return {\n    order: order.map((i) => names[i]),\n    waves,\n    criticalPath: { tasks: critical!.path.map((i) => names[i]), cost: cpCost },\n    earliestStart: Object.fromEntries(order.map((i) => [names[i], start[i]])),\n    totalCost,\n    parallelism: cpCost > 0 ? totalCost / cpCost : n > 0 ? n : 0,\n    engine,\n  };\n}\n"]}

package/dist/mcp/mcp-policy.js

@@ -4,7 +4,7 @@ const READONLY = [
     /^harness_(capabilities|manifest|verify)$/,
     /_(stats|get_profile|list_profiles|benchmark)$/,
     // Ecosystem tools: pure computations over their arguments, no side effects.
-    /^(ecosystem_status|swarm_partition_tasks|sublinear_solve|sublinear_pagerank|prompt_injection_scan)$/,
+    /^(ecosystem_status|swarm_partition_tasks|swarm_schedule_tasks|sublinear_solve|sublinear_pagerank|prompt_injection_scan)$/,
 ];
 const RETRIEVAL = [...READONLY, /search$/, /context$/];
 const LEARNING = [...RETRIEVAL, /^agentic_flow_agent$/, /^agentdb_pattern_store$/, /^sona_/];

package/dist/mcp/mcp-policy.js.map

@@ -1 +1 @@
-{"version":3,"file":"mcp-policy.js","sourceRoot":"","sources":["../../src/mcp/mcp-policy.ts"],"names":[],"mappings":"AAEA,MAAM,QAAQ,GAAG;IACf,0DAA0D;IAC1D,gDAAgD;IAChD,0CAA0C;IAC1C,+CAA+C;IAC/C,4EAA4E;IAC5E,qGAAqG;CACtG,CAAC;AACF,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;AACvD,MAAM,QAAQ,GAAG,CAAC,GAAG,SAAS,EAAE,sBAAsB,EAAE,yBAAyB,EAAE,QAAQ,CAAC,CAAC;AAE7F,MAAM,UAAU,eAAe,CAAC,KAAyB;IACvD,MAAM,OAAO,GAAG,KAAK,IAAI,UAAU,CAAC;IACpC,IAAI,CAAC,CAAC,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QACtE,MAAM,IAAI,KAAK,CAAC,wBAAwB,OAAO,EAAE,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,OAAqB,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,IAAY,EACZ,OAAgE;IAEhE,IAAI,IAAI,KAAK,gBAAgB,EAAE,CAAC;QAC9B,OAAO,OAAO,CAAC,OAAO,KAAK,OAAO,IAAI,OAAO,CAAC,oBAAoB,KAAK,IAAI,CAAC;IAC9E,CAAC;IACD,IAAI,OAAO,CAAC,OAAO,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAC7C,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACvD,OAAO,CAAC,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;IACzD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,MAAS,EACT,OAAgE;IAEhE,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5C,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,IAAsB,EAAE,EAAE;QAC3C,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;QAC/D,OAAO,SAAS,CAAC;IACnB,CAAC,CAAiB,CAAC;IACnB,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["export type McpProfile = 'readonly' | 'retrieval' | 'learning' | 'admin';\n\nconst READONLY = [\n  /^agentic_flow_(list|list_all|agent_info|check_conflicts)/,\n  /^agentdb_(stats|pattern_search|pattern_stats)$/,\n  /^harness_(capabilities|manifest|verify)$/,\n  /_(stats|get_profile|list_profiles|benchmark)$/,\n  // Ecosystem tools: pure computations over their arguments, no side effects.\n  /^(ecosystem_status|swarm_partition_tasks|sublinear_solve|sublinear_pagerank|prompt_injection_scan)$/,\n];\nconst RETRIEVAL = [...READONLY, /search$/, /context$/];\nconst LEARNING = [...RETRIEVAL, /^agentic_flow_agent$/, /^agentdb_pattern_store$/, /^sona_/];\n\nexport function parseMcpProfile(value: string | undefined): McpProfile {\n  const profile = value ?? 'readonly';\n  if (!['readonly', 'retrieval', 'learning', 'admin'].includes(profile)) {\n    throw new Error(`invalid MCP profile: ${profile}`);\n  }\n  return profile as McpProfile;\n}\n\nexport function isMcpToolAllowed(\n  name: string,\n  options: { profile: McpProfile; allowDarwinExecution?: boolean },\n): boolean {\n  if (name === 'harness_repair') {\n    return options.profile === 'admin' && options.allowDarwinExecution === true;\n  }\n  if (options.profile === 'admin') return true;\n  const rules = options.profile === 'learning' ? LEARNING :\n    options.profile === 'retrieval' ? RETRIEVAL : READONLY;\n  return rules.some((rule) => rule.test(name));\n}\n\nexport function installMcpPolicy<T extends { addTool: (tool: { name: string }) => unknown }>(\n  server: T,\n  options: { profile: McpProfile; allowDarwinExecution?: boolean },\n): T {\n  const addTool = server.addTool.bind(server);\n  server.addTool = ((tool: { name: string }) => {\n    if (isMcpToolAllowed(tool.name, options)) return addTool(tool);\n    return undefined;\n  }) as T['addTool'];\n  return server;\n}\n"]}
+{"version":3,"file":"mcp-policy.js","sourceRoot":"","sources":["../../src/mcp/mcp-policy.ts"],"names":[],"mappings":"AAEA,MAAM,QAAQ,GAAG;IACf,0DAA0D;IAC1D,gDAAgD;IAChD,0CAA0C;IAC1C,+CAA+C;IAC/C,4EAA4E;IAC5E,0HAA0H;CAC3H,CAAC;AACF,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;AACvD,MAAM,QAAQ,GAAG,CAAC,GAAG,SAAS,EAAE,sBAAsB,EAAE,yBAAyB,EAAE,QAAQ,CAAC,CAAC;AAE7F,MAAM,UAAU,eAAe,CAAC,KAAyB;IACvD,MAAM,OAAO,GAAG,KAAK,IAAI,UAAU,CAAC;IACpC,IAAI,CAAC,CAAC,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QACtE,MAAM,IAAI,KAAK,CAAC,wBAAwB,OAAO,EAAE,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,OAAqB,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,IAAY,EACZ,OAAgE;IAEhE,IAAI,IAAI,KAAK,gBAAgB,EAAE,CAAC;QAC9B,OAAO,OAAO,CAAC,OAAO,KAAK,OAAO,IAAI,OAAO,CAAC,oBAAoB,KAAK,IAAI,CAAC;IAC9E,CAAC;IACD,IAAI,OAAO,CAAC,OAAO,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAC7C,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACvD,OAAO,CAAC,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;IACzD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,MAAS,EACT,OAAgE;IAEhE,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5C,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,IAAsB,EAAE,EAAE;QAC3C,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;QAC/D,OAAO,SAAS,CAAC;IACnB,CAAC,CAAiB,CAAC;IACnB,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["export type McpProfile = 'readonly' | 'retrieval' | 'learning' | 'admin';\n\nconst READONLY = [\n  /^agentic_flow_(list|list_all|agent_info|check_conflicts)/,\n  /^agentdb_(stats|pattern_search|pattern_stats)$/,\n  /^harness_(capabilities|manifest|verify)$/,\n  /_(stats|get_profile|list_profiles|benchmark)$/,\n  // Ecosystem tools: pure computations over their arguments, no side effects.\n  /^(ecosystem_status|swarm_partition_tasks|swarm_schedule_tasks|sublinear_solve|sublinear_pagerank|prompt_injection_scan)$/,\n];\nconst RETRIEVAL = [...READONLY, /search$/, /context$/];\nconst LEARNING = [...RETRIEVAL, /^agentic_flow_agent$/, /^agentdb_pattern_store$/, /^sona_/];\n\nexport function parseMcpProfile(value: string | undefined): McpProfile {\n  const profile = value ?? 'readonly';\n  if (!['readonly', 'retrieval', 'learning', 'admin'].includes(profile)) {\n    throw new Error(`invalid MCP profile: ${profile}`);\n  }\n  return profile as McpProfile;\n}\n\nexport function isMcpToolAllowed(\n  name: string,\n  options: { profile: McpProfile; allowDarwinExecution?: boolean },\n): boolean {\n  if (name === 'harness_repair') {\n    return options.profile === 'admin' && options.allowDarwinExecution === true;\n  }\n  if (options.profile === 'admin') return true;\n  const rules = options.profile === 'learning' ? LEARNING :\n    options.profile === 'retrieval' ? RETRIEVAL : READONLY;\n  return rules.some((rule) => rule.test(name));\n}\n\nexport function installMcpPolicy<T extends { addTool: (tool: { name: string }) => unknown }>(\n  server: T,\n  options: { profile: McpProfile; allowDarwinExecution?: boolean },\n): T {\n  const addTool = server.addTool.bind(server);\n  server.addTool = ((tool: { name: string }) => {\n    if (isMcpToolAllowed(tool.name, options)) return addTool(tool);\n    return undefined;\n  }) as T['addTool'];\n  return server;\n}\n"]}

package/dist/mcp/tools/ecosystem-tools.d.ts

@@ -1,6 +1,6 @@
 /**
  * Ecosystem MCP tools: in-process access to the optional ruvnet packages
- * agentic-flow integrates (aidefence, @ruvector/mincut-wasm,
+ * agentic-flow integrates (aidefence, @ruvector/mincut-wasm, @ruvector/rudag,
  * @ruvnet/sublinear-core, agent-booster, @ruvector/router,
  * ruvector-onnx-embeddings-wasm).
  *
@@ -32,6 +32,10 @@ export declare const ECOSYSTEM_PACKAGES: readonly [{
     readonly pkg: "@ruvector/mincut-wasm";
     readonly probe: "@ruvector/mincut-wasm";
     readonly powers: "task-graph partitioning (swarm_partition_tasks)";
+}, {
+    readonly pkg: "@ruvector/rudag";
+    readonly probe: "@ruvector/rudag";
+    readonly powers: "task-graph scheduling: execution waves and critical path (swarm_schedule_tasks)";
 }, {
     readonly pkg: "@ruvnet/sublinear-core";
     readonly probe: "@ruvnet/sublinear-core";

package/dist/mcp/tools/ecosystem-tools.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ecosystem-tools.d.ts","sourceRoot":"","sources":["../../../src/mcp/tools/ecosystem-tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAOxB,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC;IACzB,OAAO,EAAE,CAAC,IAAI,EAAE,OAAO,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;CAC7C;AAED,oFAAoF;AACpF,eAAO,MAAM,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;EAOrB,CAAC;AA8DX,eAAO,MAAM,eAAe,EAAE,aAAa,EA0D1C,CAAC;AAEF,eAAO,MAAM,oBAAoB,UAAqC,CAAC;AAEvE,wBAAgB,sBAAsB,CAAC,MAAM,EAAE;IAAE,OAAO,EAAE,CAAC,IAAI,EAAE,aAAa,KAAK,IAAI,CAAA;CAAE,GAAG,IAAI,CAE/F"}
+{"version":3,"file":"ecosystem-tools.d.ts","sourceRoot":"","sources":["../../../src/mcp/tools/ecosystem-tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAQxB,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC;IACzB,OAAO,EAAE,CAAC,IAAI,EAAE,OAAO,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;CAC7C;AAED,oFAAoF;AACpF,eAAO,MAAM,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAQrB,CAAC;AAgFX,eAAO,MAAM,eAAe,EAAE,aAAa,EAmE1C,CAAC;AAEF,eAAO,MAAM,oBAAoB,UAAqC,CAAC;AAEvE,wBAAgB,sBAAsB,CAAC,MAAM,EAAE;IAAE,OAAO,EAAE,CAAC,IAAI,EAAE,aAAa,KAAK,IAAI,CAAA;CAAE,GAAG,IAAI,CAE/F"}

package/dist/mcp/tools/ecosystem-tools.js

@@ -1,6 +1,6 @@
 /**
  * Ecosystem MCP tools: in-process access to the optional ruvnet packages
- * agentic-flow integrates (aidefence, @ruvector/mincut-wasm,
+ * agentic-flow integrates (aidefence, @ruvector/mincut-wasm, @ruvector/rudag,
  * @ruvnet/sublinear-core, agent-booster, @ruvector/router,
  * ruvector-onnx-embeddings-wasm).
  *
@@ -12,6 +12,7 @@ import { z } from 'zod';
 import { isOptionalInstalled } from '../../integrations/optional.js';
 import { scanPromptInjection, promptInjectionEngine, getInjectionPolicy } from '../../integrations/prompt-injection.js';
 import { partitionTaskGraph } from '../../integrations/task-partition.js';
+import { scheduleTaskGraph } from '../../integrations/task-schedule.js';
 import { solveLinearSystem, pageRank } from '../../integrations/sublinear.js';
 import { onnxWasmModelCached, onnxWasmDownloadAllowed } from '../../integrations/onnx-wasm-embedder.js';
 /** Optional packages and what they power. `probe` is checked without loading it. */
@@ -20,6 +21,7 @@ export const ECOSYSTEM_PACKAGES = [
     { pkg: 'agent-booster', probe: 'agent-booster', powers: 'in-process code edits (agent_booster_* tools)' },
     { pkg: '@ruvector/router', probe: '@ruvector/router', powers: 'native HNSW index for SemanticRouter' },
     { pkg: '@ruvector/mincut-wasm', probe: '@ruvector/mincut-wasm', powers: 'task-graph partitioning (swarm_partition_tasks)' },
+    { pkg: '@ruvector/rudag', probe: '@ruvector/rudag', powers: 'task-graph scheduling: execution waves and critical path (swarm_schedule_tasks)' },
     { pkg: '@ruvnet/sublinear-core', probe: '@ruvnet/sublinear-core', powers: 'linear solves, PageRank and personalized PageRank (sublinear_solve, sublinear_pagerank)' },
     { pkg: 'ruvector-onnx-embeddings-wasm', probe: 'ruvector-onnx-embeddings-wasm', powers: 'all-MiniLM-L6-v2 embeddings (AgentDBFast, EmbeddingService onnx-wasm)' },
 ];
@@ -37,6 +39,24 @@ const partitionParams = z.object({
     }))
         .max(50000),
 });
+const scheduleParams = z.object({
+    tasks: z
+        .array(z.union([
+        z.string().min(1).max(200),
+        z.object({
+            id: z.string().min(1).max(200),
+            cost: z.number().nonnegative().finite().optional().describe('Additive cost (minutes, tokens, dollars), default 1'),
+        }),
+    ]))
+        .max(5000)
+        .describe('Task ids or {id, cost}; tasks only named in dependencies get cost 1'),
+    dependencies: z
+        .array(z.object({
+        from: z.string().min(1).max(200).describe('Runs first'),
+        to: z.string().min(1).max(200).describe('Starts after from finishes'),
+    }))
+        .max(50000),
+});
 const solveParams = z.object({
     matrix: z
         .union([
@@ -105,6 +125,15 @@ export const ECOSYSTEM_TOOLS = [
             return json(await partitionTaskGraph(a.tasks, a.dependencies));
         },
     },
+    {
+        name: 'swarm_schedule_tasks',
+        description: 'Schedule a task-dependency DAG for a swarm: execution order, parallel waves (tasks that can go to separate agents at once), earliest start per task, and the critical path (the cost-weighted chain that bounds the run). Rejects cycles. Uses @ruvector/rudag, built-in Kahn sort + longest path otherwise.',
+        parameters: scheduleParams,
+        execute: async (raw) => {
+            const a = scheduleParams.parse(raw);
+            return json(await scheduleTaskGraph(a.tasks, a.dependencies));
+        },
+    },
     {
         name: 'sublinear_solve',
         description: 'Solve Mx = b for a diagonally dominant or symmetric positive definite matrix. Uses @ruvnet/sublinear-core (Gauss-Seidel / conjugate gradient), verifies the residual max|Mx-b|, and falls back to a built-in Gauss-Seidel. Returns solution, residual, iterations, method and engine.',

package/dist/mcp/tools/ecosystem-tools.js.map

@@ -1 +1 @@
-{"version":3,"file":"ecosystem-tools.js","sourceRoot":"","sources":["../../../src/mcp/tools/ecosystem-tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,mBAAmB,EAAE,MAAM,gCAAgC,CAAC;AACrE,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,wCAAwC,CAAC;AACxH,OAAO,EAAE,kBAAkB,EAAuB,MAAM,sCAAsC,CAAC;AAC/F,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAuC,MAAM,iCAAiC,CAAC;AACnH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,0CAA0C,CAAC;AASxG,oFAAoF;AACpF,MAAM,CAAC,MAAM,kBAAkB,GAAG;IAChC,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,0BAA0B,EAAE,MAAM,EAAE,oEAAoE,EAAE;IACrI,EAAE,GAAG,EAAE,eAAe,EAAE,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,+CAA+C,EAAE;IACzG,EAAE,GAAG,EAAE,kBAAkB,EAAE,KAAK,EAAE,kBAAkB,EAAE,MAAM,EAAE,sCAAsC,EAAE;IACtG,EAAE,GAAG,EAAE,uBAAuB,EAAE,KAAK,EAAE,uBAAuB,EAAE,MAAM,EAAE,iDAAiD,EAAE;IAC3H,EAAE,GAAG,EAAE,wBAAwB,EAAE,KAAK,EAAE,wBAAwB,EAAE,MAAM,EAAE,yFAAyF,EAAE;IACrK,EAAE,GAAG,EAAE,+BAA+B,EAAE,KAAK,EAAE,+BAA+B,EAAE,MAAM,EAAE,uEAAuE,EAAE;CACzJ,CAAC;AAEX,0EAA0E;AAC1E,wEAAwE;AACxE,MAAM,IAAI,GAAG,CAAC,CAAU,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AAExD,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;AAC3C,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/B,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,sDAAsD,CAAC;IACrH,YAAY,EAAE,CAAC;SACZ,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QACd,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAChC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAC9B,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,8BAA8B,CAAC;KAC9F,CAAC,CAAC;SACF,GAAG,CAAC,KAAK,CAAC;CACd,CAAC,CAAC;AACH,MAAM,WAAW,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3B,MAAM,EAAE,CAAC;SACN,KAAK,CAAC;QACL,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;QACtD,CAAC,CAAC,MAAM,CAAC;YACP,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC;YAChD,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;SACxH,CAAC;KACH,CAAC;SACD,QAAQ,CAAC,iHAAiH,CAAC;IAC9H,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,mBAAmB,CAAC;IACzE,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE;IAClD,aAAa,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE;IACpE,MAAM,EAAE,CAAC;SACN,IAAI,CAAC,CAAC,MAAM,EAAE,cAAc,EAAE,oBAAoB,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;SACzE,QAAQ,EAAE;SACV,QAAQ,CAAC,qGAAqG,CAAC;CACnH,CAAC,CAAC;AACH,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC;IAC9B,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QACtB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAChC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAC9B,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;KACrD,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;IACf,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,2BAA2B,CAAC;IACvG,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,0EAA0E,CAAC;IAC/H,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,qCAAqC,CAAC;IACtG,KAAK,EAAE,CAAC;SACL,KAAK,CAAC;QACL,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;QACtD,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE,CAAC;KACxE,CAAC;SACD,QAAQ,EAAE;SACV,QAAQ,CAAC,iFAAiF,CAAC;IAC9F,WAAW,EAAE,CAAC;SACX,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CAAC,+IAA+I,CAAC;IAC5J,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,yEAAyE,CAAC;CACvI,CAAC,CAAC;AACH,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1B,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC;IAC5B,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,sDAAsD,CAAC;CACxH,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,eAAe,GAAoB;IAC9C;QACE,IAAI,EAAE,kBAAkB;QACxB,WAAW,EAAE,sJAAsJ;QACnK,UAAU,EAAE,YAAY;QACxB,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,YAAY,CAAC,KAAK,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;YAC9B,OAAO,IAAI,CAAC;gBACV,QAAQ,EAAE,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,mBAAmB,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC/H,eAAe,EAAE,EAAE,MAAM,EAAE,qBAAqB,EAAE,EAAE,MAAM,EAAE,kBAAkB,EAAE,EAAE;gBAClF,UAAU,EAAE,EAAE,WAAW,EAAE,mBAAmB,EAAE,EAAE,eAAe,EAAE,uBAAuB,EAAE,EAAE;gBAC9F,OAAO,EAAE,6FAA6F;aACvG,CAAC,CAAC;QACL,CAAC;KACF;IACD;QACE,IAAI,EAAE,uBAAuB;QAC7B,WAAW,EAAE,2MAA2M;QACxN,UAAU,EAAE,eAAe;QAC3B,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACrC,OAAO,IAAI,CAAC,MAAM,kBAAkB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,YAAgC,CAAC,CAAC,CAAC;QACrF,CAAC;KACF;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,WAAW,EAAE,uRAAuR;QACpS,UAAU,EAAE,WAAW;QACvB,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACjC,OAAO,IAAI,CAAC,MAAM,iBAAiB,CAAC,CAAC,CAAC,MAAqB,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC,aAAa,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACxJ,CAAC;KACF;IACD;QACE,IAAI,EAAE,oBAAoB;QAC1B,WAAW,EAAE,wTAAwT;QACrU,UAAU,EAAE,cAAc;QAC1B,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACpC,OAAO,IAAI,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC,KAAuB,EAAE;gBACpD,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,KAAK,EAAE,CAAC,CAAC,KAAsD;gBAC/D,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,GAAG,EAAE,CAAC,CAAC,GAAG;aACX,CAAC,CAAC,CAAC;QACN,CAAC;KACF;IACD;QACE,IAAI,EAAE,uBAAuB;QAC7B,WAAW,EAAE,0NAA0N;QACvO,UAAU,EAAE,UAAU;QACtB,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChC,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACrD,CAAC;KACF;CACF,CAAC;AAEF,MAAM,CAAC,MAAM,oBAAoB,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAEvE,MAAM,UAAU,sBAAsB,CAAC,MAAkD;IACvF,KAAK,MAAM,IAAI,IAAI,eAAe;QAAE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AAC3D,CAAC","sourcesContent":["/**\n * Ecosystem MCP tools: in-process access to the optional ruvnet packages\n * agentic-flow integrates (aidefence, @ruvector/mincut-wasm,\n * @ruvnet/sublinear-core, agent-booster, @ruvector/router,\n * ruvector-onnx-embeddings-wasm).\n *\n * Every tool works without its optional package (built-in fallback) and says\n * which engine answered. All are pure computations with no side effects, so\n * the MCP policy admits them under the default `readonly` profile.\n */\n\nimport { z } from 'zod';\nimport { isOptionalInstalled } from '../../integrations/optional.js';\nimport { scanPromptInjection, promptInjectionEngine, getInjectionPolicy } from '../../integrations/prompt-injection.js';\nimport { partitionTaskGraph, type TaskDependency } from '../../integrations/task-partition.js';\nimport { solveLinearSystem, pageRank, type MatrixInput, type PageRankEdge } from '../../integrations/sublinear.js';\nimport { onnxWasmModelCached, onnxWasmDownloadAllowed } from '../../integrations/onnx-wasm-embedder.js';\n\nexport interface EcosystemTool {\n  name: string;\n  description: string;\n  parameters: z.ZodTypeAny;\n  execute: (args: unknown) => Promise<string>;\n}\n\n/** Optional packages and what they power. `probe` is checked without loading it. */\nexport const ECOSYSTEM_PACKAGES = [\n  { pkg: 'aidefence', probe: 'aidefence/dist/detection', powers: 'prompt-injection screening (InputValidator, prompt_injection_scan)' },\n  { pkg: 'agent-booster', probe: 'agent-booster', powers: 'in-process code edits (agent_booster_* tools)' },\n  { pkg: '@ruvector/router', probe: '@ruvector/router', powers: 'native HNSW index for SemanticRouter' },\n  { pkg: '@ruvector/mincut-wasm', probe: '@ruvector/mincut-wasm', powers: 'task-graph partitioning (swarm_partition_tasks)' },\n  { pkg: '@ruvnet/sublinear-core', probe: '@ruvnet/sublinear-core', powers: 'linear solves, PageRank and personalized PageRank (sublinear_solve, sublinear_pagerank)' },\n  { pkg: 'ruvector-onnx-embeddings-wasm', probe: 'ruvector-onnx-embeddings-wasm', powers: 'all-MiniLM-L6-v2 embeddings (AgentDBFast, EmbeddingService onnx-wasm)' },\n] as const;\n\n// The project compiles with strict: false, so zod infers object fields as\n// optional; the schemas themselves require them, hence the casts below.\nconst json = (v: unknown) => JSON.stringify(v, null, 2);\n\nconst statusParams = z.object({}).strict();\nconst partitionParams = z.object({\n  tasks: z.array(z.string().min(1).max(200)).max(5000).describe('Task ids; tasks only named in dependencies are added'),\n  dependencies: z\n    .array(z.object({\n      from: z.string().min(1).max(200),\n      to: z.string().min(1).max(200),\n      weight: z.number().nonnegative().finite().optional().describe('Coupling strength, default 1'),\n    }))\n    .max(50000),\n});\nconst solveParams = z.object({\n  matrix: z\n    .union([\n      z.array(z.array(z.number().finite())).min(1).max(2000),\n      z.object({\n        size: z.number().int().positive().max(1_000_000),\n        entries: z.array(z.object({ row: z.number().int(), col: z.number().int(), value: z.number().finite() })).max(5_000_000),\n      }),\n    ])\n    .describe('Square matrix: dense rows, or {size, entries:[{row,col,value}]}; diagonally dominant for guaranteed convergence'),\n  vector: z.array(z.number().finite()).min(1).describe('Right-hand side b'),\n  tolerance: z.number().positive().max(1).optional(),\n  maxIterations: z.number().int().positive().max(1_000_000).optional(),\n  method: z\n    .enum(['auto', 'gauss-seidel', 'conjugate-gradient', 'jacobi', 'neumann'])\n    .optional()\n    .describe('Default auto: conjugate-gradient for symmetric matrices with a positive diagonal, else gauss-seidel'),\n});\nconst pagerankParams = z.object({\n  edges: z.array(z.object({\n    from: z.string().min(1).max(200),\n    to: z.string().min(1).max(200),\n    weight: z.number().nonnegative().finite().optional(),\n  })).max(500000),\n  nodes: z.array(z.string().min(1).max(200)).max(100000).optional().describe('Extra nodes with no edges'),\n  damping: z.number().gt(0).lt(1).optional().describe('Probability of following an edge (1 - restart probability), default 0.85'),\n  top: z.number().int().positive().max(10000).optional().describe('Return only the top N (default all)'),\n  seeds: z\n    .union([\n      z.array(z.string().min(1).max(200)).min(1).max(100000),\n      z.record(z.string().min(1).max(200), z.number().nonnegative().finite()),\n    ])\n    .optional()\n    .describe('Personalized PageRank: restart at these nodes (equal weight), or {node: weight}'),\n  approximate: z\n    .boolean()\n    .optional()\n    .describe('With seeds: local forward push. Work depends on epsilon, not graph size; best with top on large graphs. Returns residualMass (L1 error bound)'),\n  epsilon: z.number().positive().max(0.1).optional().describe('Forward-push residual threshold, default 1e-6 (smaller = more accurate)'),\n});\nconst scanParams = z.object({\n  text: z.string().max(100000),\n  policy: z.enum(['block', 'strict', 'warn']).optional().describe('Override AGENTIC_FLOW_PROMPT_INJECTION for this scan'),\n});\n\nexport const ECOSYSTEM_TOOLS: EcosystemTool[] = [\n  {\n    name: 'ecosystem_status',\n    description: 'List the optional ruvnet packages agentic-flow integrates, whether each is installed, and what it powers. Every integration has a built-in fallback.',\n    parameters: statusParams,\n    execute: async (raw) => {\n      statusParams.parse(raw ?? {});\n      return json({\n        packages: ECOSYSTEM_PACKAGES.map(({ pkg, probe, powers }) => ({ package: pkg, installed: isOptionalInstalled(probe), powers })),\n        promptInjection: { engine: promptInjectionEngine(), policy: getInjectionPolicy() },\n        embeddings: { modelCached: onnxWasmModelCached(), downloadAllowed: onnxWasmDownloadAllowed() },\n        install: 'npm install agentic-flow (optional packages install by default; --omit=optional skips them)',\n      });\n    },\n  },\n  {\n    name: 'swarm_partition_tasks',\n    description: 'Split a task-dependency graph into two groups with the least coupling (exact global minimum cut) — the seam to hand work to two agent teams. Uses @ruvector/mincut-wasm, built-in Stoer-Wagner otherwise.',\n    parameters: partitionParams,\n    execute: async (raw) => {\n      const a = partitionParams.parse(raw);\n      return json(await partitionTaskGraph(a.tasks, a.dependencies as TaskDependency[]));\n    },\n  },\n  {\n    name: 'sublinear_solve',\n    description: 'Solve Mx = b for a diagonally dominant or symmetric positive definite matrix. Uses @ruvnet/sublinear-core (Gauss-Seidel / conjugate gradient), verifies the residual max|Mx-b|, and falls back to a built-in Gauss-Seidel. Returns solution, residual, iterations, method and engine.',\n    parameters: solveParams,\n    execute: async (raw) => {\n      const a = solveParams.parse(raw);\n      return json(await solveLinearSystem(a.matrix as MatrixInput, a.vector, { tolerance: a.tolerance, maxIterations: a.maxIterations, method: a.method }));\n    },\n  },\n  {\n    name: 'sublinear_pagerank',\n    description: 'PageRank over a directed graph (agents, files, tasks), or personalized PageRank around seeds (what matters to these nodes). Uses @ruvnet/sublinear-core power iteration, or local forward push with approximate: true; results are verified, built-in Gauss-Seidel fallback. Returns scores, a ranking and the engine.',\n    parameters: pagerankParams,\n    execute: async (raw) => {\n      const a = pagerankParams.parse(raw);\n      return json(await pageRank(a.edges as PageRankEdge[], {\n        damping: a.damping,\n        nodes: a.nodes,\n        seeds: a.seeds as string[] | Record<string, number> | undefined,\n        approximate: a.approximate,\n        epsilon: a.epsilon,\n        top: a.top,\n      }));\n    },\n  },\n  {\n    name: 'prompt_injection_scan',\n    description: 'Scan text for prompt-injection attempts (instruction override, role switching, prompt exfiltration, jailbreaks) with aidefence, built-in patterns otherwise. Returns threats and the policy decision (allow/warn/block).',\n    parameters: scanParams,\n    execute: async (raw) => {\n      const a = scanParams.parse(raw);\n      return json(scanPromptInjection(a.text, a.policy));\n    },\n  },\n];\n\nexport const ECOSYSTEM_TOOL_NAMES = ECOSYSTEM_TOOLS.map((t) => t.name);\n\nexport function registerEcosystemTools(server: { addTool: (tool: EcosystemTool) => void }): void {\n  for (const tool of ECOSYSTEM_TOOLS) server.addTool(tool);\n}\n"]}
+{"version":3,"file":"ecosystem-tools.js","sourceRoot":"","sources":["../../../src/mcp/tools/ecosystem-tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,mBAAmB,EAAE,MAAM,gCAAgC,CAAC;AACrE,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,wCAAwC,CAAC;AACxH,OAAO,EAAE,kBAAkB,EAAuB,MAAM,sCAAsC,CAAC;AAC/F,OAAO,EAAE,iBAAiB,EAA8C,MAAM,qCAAqC,CAAC;AACpH,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAuC,MAAM,iCAAiC,CAAC;AACnH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,0CAA0C,CAAC;AASxG,oFAAoF;AACpF,MAAM,CAAC,MAAM,kBAAkB,GAAG;IAChC,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,0BAA0B,EAAE,MAAM,EAAE,oEAAoE,EAAE;IACrI,EAAE,GAAG,EAAE,eAAe,EAAE,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,+CAA+C,EAAE;IACzG,EAAE,GAAG,EAAE,kBAAkB,EAAE,KAAK,EAAE,kBAAkB,EAAE,MAAM,EAAE,sCAAsC,EAAE;IACtG,EAAE,GAAG,EAAE,uBAAuB,EAAE,KAAK,EAAE,uBAAuB,EAAE,MAAM,EAAE,iDAAiD,EAAE;IAC3H,EAAE,GAAG,EAAE,iBAAiB,EAAE,KAAK,EAAE,iBAAiB,EAAE,MAAM,EAAE,iFAAiF,EAAE;IAC/I,EAAE,GAAG,EAAE,wBAAwB,EAAE,KAAK,EAAE,wBAAwB,EAAE,MAAM,EAAE,yFAAyF,EAAE;IACrK,EAAE,GAAG,EAAE,+BAA+B,EAAE,KAAK,EAAE,+BAA+B,EAAE,MAAM,EAAE,uEAAuE,EAAE;CACzJ,CAAC;AAEX,0EAA0E;AAC1E,wEAAwE;AACxE,MAAM,IAAI,GAAG,CAAC,CAAU,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AAExD,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;AAC3C,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/B,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,sDAAsD,CAAC;IACrH,YAAY,EAAE,CAAC;SACZ,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QACd,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAChC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAC9B,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,8BAA8B,CAAC;KAC9F,CAAC,CAAC;SACF,GAAG,CAAC,KAAK,CAAC;CACd,CAAC,CAAC;AACH,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC;IAC9B,KAAK,EAAE,CAAC;SACL,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QACb,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAC1B,CAAC,CAAC,MAAM,CAAC;YACP,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YAC9B,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,qDAAqD,CAAC;SACnH,CAAC;KACH,CAAC,CAAC;SACF,GAAG,CAAC,IAAI,CAAC;SACT,QAAQ,CAAC,qEAAqE,CAAC;IAClF,YAAY,EAAE,CAAC;SACZ,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QACd,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC;QACvD,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,4BAA4B,CAAC;KACtE,CAAC,CAAC;SACF,GAAG,CAAC,KAAK,CAAC;CACd,CAAC,CAAC;AACH,MAAM,WAAW,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3B,MAAM,EAAE,CAAC;SACN,KAAK,CAAC;QACL,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;QACtD,CAAC,CAAC,MAAM,CAAC;YACP,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC;YAChD,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;SACxH,CAAC;KACH,CAAC;SACD,QAAQ,CAAC,iHAAiH,CAAC;IAC9H,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,mBAAmB,CAAC;IACzE,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE;IAClD,aAAa,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE;IACpE,MAAM,EAAE,CAAC;SACN,IAAI,CAAC,CAAC,MAAM,EAAE,cAAc,EAAE,oBAAoB,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;SACzE,QAAQ,EAAE;SACV,QAAQ,CAAC,qGAAqG,CAAC;CACnH,CAAC,CAAC;AACH,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC;IAC9B,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QACtB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAChC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAC9B,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;KACrD,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;IACf,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,2BAA2B,CAAC;IACvG,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,0EAA0E,CAAC;IAC/H,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,qCAAqC,CAAC;IACtG,KAAK,EAAE,CAAC;SACL,KAAK,CAAC;QACL,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;QACtD,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE,CAAC;KACxE,CAAC;SACD,QAAQ,EAAE;SACV,QAAQ,CAAC,iFAAiF,CAAC;IAC9F,WAAW,EAAE,CAAC;SACX,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CAAC,+IAA+I,CAAC;IAC5J,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,yEAAyE,CAAC;CACvI,CAAC,CAAC;AACH,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1B,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC;IAC5B,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,sDAAsD,CAAC;CACxH,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,eAAe,GAAoB;IAC9C;QACE,IAAI,EAAE,kBAAkB;QACxB,WAAW,EAAE,sJAAsJ;QACnK,UAAU,EAAE,YAAY;QACxB,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,YAAY,CAAC,KAAK,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;YAC9B,OAAO,IAAI,CAAC;gBACV,QAAQ,EAAE,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,mBAAmB,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC/H,eAAe,EAAE,EAAE,MAAM,EAAE,qBAAqB,EAAE,EAAE,MAAM,EAAE,kBAAkB,EAAE,EAAE;gBAClF,UAAU,EAAE,EAAE,WAAW,EAAE,mBAAmB,EAAE,EAAE,eAAe,EAAE,uBAAuB,EAAE,EAAE;gBAC9F,OAAO,EAAE,6FAA6F;aACvG,CAAC,CAAC;QACL,CAAC;KACF;IACD;QACE,IAAI,EAAE,uBAAuB;QAC7B,WAAW,EAAE,2MAA2M;QACxN,UAAU,EAAE,eAAe;QAC3B,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACrC,OAAO,IAAI,CAAC,MAAM,kBAAkB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,YAAgC,CAAC,CAAC,CAAC;QACrF,CAAC;KACF;IACD;QACE,IAAI,EAAE,sBAAsB;QAC5B,WAAW,EAAE,8SAA8S;QAC3T,UAAU,EAAE,cAAc;QAC1B,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACpC,OAAO,IAAI,CAAC,MAAM,iBAAiB,CAAC,CAAC,CAAC,KAAqC,EAAE,CAAC,CAAC,YAAoC,CAAC,CAAC,CAAC;QACxH,CAAC;KACF;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,WAAW,EAAE,uRAAuR;QACpS,UAAU,EAAE,WAAW;QACvB,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACjC,OAAO,IAAI,CAAC,MAAM,iBAAiB,CAAC,CAAC,CAAC,MAAqB,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC,aAAa,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACxJ,CAAC;KACF;IACD;QACE,IAAI,EAAE,oBAAoB;QAC1B,WAAW,EAAE,wTAAwT;QACrU,UAAU,EAAE,cAAc;QAC1B,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACpC,OAAO,IAAI,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC,KAAuB,EAAE;gBACpD,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,KAAK,EAAE,CAAC,CAAC,KAAsD;gBAC/D,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,GAAG,EAAE,CAAC,CAAC,GAAG;aACX,CAAC,CAAC,CAAC;QACN,CAAC;KACF;IACD;QACE,IAAI,EAAE,uBAAuB;QAC7B,WAAW,EAAE,0NAA0N;QACvO,UAAU,EAAE,UAAU;QACtB,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChC,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACrD,CAAC;KACF;CACF,CAAC;AAEF,MAAM,CAAC,MAAM,oBAAoB,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAEvE,MAAM,UAAU,sBAAsB,CAAC,MAAkD;IACvF,KAAK,MAAM,IAAI,IAAI,eAAe;QAAE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AAC3D,CAAC","sourcesContent":["/**\n * Ecosystem MCP tools: in-process access to the optional ruvnet packages\n * agentic-flow integrates (aidefence, @ruvector/mincut-wasm, @ruvector/rudag,\n * @ruvnet/sublinear-core, agent-booster, @ruvector/router,\n * ruvector-onnx-embeddings-wasm).\n *\n * Every tool works without its optional package (built-in fallback) and says\n * which engine answered. All are pure computations with no side effects, so\n * the MCP policy admits them under the default `readonly` profile.\n */\n\nimport { z } from 'zod';\nimport { isOptionalInstalled } from '../../integrations/optional.js';\nimport { scanPromptInjection, promptInjectionEngine, getInjectionPolicy } from '../../integrations/prompt-injection.js';\nimport { partitionTaskGraph, type TaskDependency } from '../../integrations/task-partition.js';\nimport { scheduleTaskGraph, type ScheduleTask, type ScheduleDependency } from '../../integrations/task-schedule.js';\nimport { solveLinearSystem, pageRank, type MatrixInput, type PageRankEdge } from '../../integrations/sublinear.js';\nimport { onnxWasmModelCached, onnxWasmDownloadAllowed } from '../../integrations/onnx-wasm-embedder.js';\n\nexport interface EcosystemTool {\n  name: string;\n  description: string;\n  parameters: z.ZodTypeAny;\n  execute: (args: unknown) => Promise<string>;\n}\n\n/** Optional packages and what they power. `probe` is checked without loading it. */\nexport const ECOSYSTEM_PACKAGES = [\n  { pkg: 'aidefence', probe: 'aidefence/dist/detection', powers: 'prompt-injection screening (InputValidator, prompt_injection_scan)' },\n  { pkg: 'agent-booster', probe: 'agent-booster', powers: 'in-process code edits (agent_booster_* tools)' },\n  { pkg: '@ruvector/router', probe: '@ruvector/router', powers: 'native HNSW index for SemanticRouter' },\n  { pkg: '@ruvector/mincut-wasm', probe: '@ruvector/mincut-wasm', powers: 'task-graph partitioning (swarm_partition_tasks)' },\n  { pkg: '@ruvector/rudag', probe: '@ruvector/rudag', powers: 'task-graph scheduling: execution waves and critical path (swarm_schedule_tasks)' },\n  { pkg: '@ruvnet/sublinear-core', probe: '@ruvnet/sublinear-core', powers: 'linear solves, PageRank and personalized PageRank (sublinear_solve, sublinear_pagerank)' },\n  { pkg: 'ruvector-onnx-embeddings-wasm', probe: 'ruvector-onnx-embeddings-wasm', powers: 'all-MiniLM-L6-v2 embeddings (AgentDBFast, EmbeddingService onnx-wasm)' },\n] as const;\n\n// The project compiles with strict: false, so zod infers object fields as\n// optional; the schemas themselves require them, hence the casts below.\nconst json = (v: unknown) => JSON.stringify(v, null, 2);\n\nconst statusParams = z.object({}).strict();\nconst partitionParams = z.object({\n  tasks: z.array(z.string().min(1).max(200)).max(5000).describe('Task ids; tasks only named in dependencies are added'),\n  dependencies: z\n    .array(z.object({\n      from: z.string().min(1).max(200),\n      to: z.string().min(1).max(200),\n      weight: z.number().nonnegative().finite().optional().describe('Coupling strength, default 1'),\n    }))\n    .max(50000),\n});\nconst scheduleParams = z.object({\n  tasks: z\n    .array(z.union([\n      z.string().min(1).max(200),\n      z.object({\n        id: z.string().min(1).max(200),\n        cost: z.number().nonnegative().finite().optional().describe('Additive cost (minutes, tokens, dollars), default 1'),\n      }),\n    ]))\n    .max(5000)\n    .describe('Task ids or {id, cost}; tasks only named in dependencies get cost 1'),\n  dependencies: z\n    .array(z.object({\n      from: z.string().min(1).max(200).describe('Runs first'),\n      to: z.string().min(1).max(200).describe('Starts after from finishes'),\n    }))\n    .max(50000),\n});\nconst solveParams = z.object({\n  matrix: z\n    .union([\n      z.array(z.array(z.number().finite())).min(1).max(2000),\n      z.object({\n        size: z.number().int().positive().max(1_000_000),\n        entries: z.array(z.object({ row: z.number().int(), col: z.number().int(), value: z.number().finite() })).max(5_000_000),\n      }),\n    ])\n    .describe('Square matrix: dense rows, or {size, entries:[{row,col,value}]}; diagonally dominant for guaranteed convergence'),\n  vector: z.array(z.number().finite()).min(1).describe('Right-hand side b'),\n  tolerance: z.number().positive().max(1).optional(),\n  maxIterations: z.number().int().positive().max(1_000_000).optional(),\n  method: z\n    .enum(['auto', 'gauss-seidel', 'conjugate-gradient', 'jacobi', 'neumann'])\n    .optional()\n    .describe('Default auto: conjugate-gradient for symmetric matrices with a positive diagonal, else gauss-seidel'),\n});\nconst pagerankParams = z.object({\n  edges: z.array(z.object({\n    from: z.string().min(1).max(200),\n    to: z.string().min(1).max(200),\n    weight: z.number().nonnegative().finite().optional(),\n  })).max(500000),\n  nodes: z.array(z.string().min(1).max(200)).max(100000).optional().describe('Extra nodes with no edges'),\n  damping: z.number().gt(0).lt(1).optional().describe('Probability of following an edge (1 - restart probability), default 0.85'),\n  top: z.number().int().positive().max(10000).optional().describe('Return only the top N (default all)'),\n  seeds: z\n    .union([\n      z.array(z.string().min(1).max(200)).min(1).max(100000),\n      z.record(z.string().min(1).max(200), z.number().nonnegative().finite()),\n    ])\n    .optional()\n    .describe('Personalized PageRank: restart at these nodes (equal weight), or {node: weight}'),\n  approximate: z\n    .boolean()\n    .optional()\n    .describe('With seeds: local forward push. Work depends on epsilon, not graph size; best with top on large graphs. Returns residualMass (L1 error bound)'),\n  epsilon: z.number().positive().max(0.1).optional().describe('Forward-push residual threshold, default 1e-6 (smaller = more accurate)'),\n});\nconst scanParams = z.object({\n  text: z.string().max(100000),\n  policy: z.enum(['block', 'strict', 'warn']).optional().describe('Override AGENTIC_FLOW_PROMPT_INJECTION for this scan'),\n});\n\nexport const ECOSYSTEM_TOOLS: EcosystemTool[] = [\n  {\n    name: 'ecosystem_status',\n    description: 'List the optional ruvnet packages agentic-flow integrates, whether each is installed, and what it powers. Every integration has a built-in fallback.',\n    parameters: statusParams,\n    execute: async (raw) => {\n      statusParams.parse(raw ?? {});\n      return json({\n        packages: ECOSYSTEM_PACKAGES.map(({ pkg, probe, powers }) => ({ package: pkg, installed: isOptionalInstalled(probe), powers })),\n        promptInjection: { engine: promptInjectionEngine(), policy: getInjectionPolicy() },\n        embeddings: { modelCached: onnxWasmModelCached(), downloadAllowed: onnxWasmDownloadAllowed() },\n        install: 'npm install agentic-flow (optional packages install by default; --omit=optional skips them)',\n      });\n    },\n  },\n  {\n    name: 'swarm_partition_tasks',\n    description: 'Split a task-dependency graph into two groups with the least coupling (exact global minimum cut) — the seam to hand work to two agent teams. Uses @ruvector/mincut-wasm, built-in Stoer-Wagner otherwise.',\n    parameters: partitionParams,\n    execute: async (raw) => {\n      const a = partitionParams.parse(raw);\n      return json(await partitionTaskGraph(a.tasks, a.dependencies as TaskDependency[]));\n    },\n  },\n  {\n    name: 'swarm_schedule_tasks',\n    description: 'Schedule a task-dependency DAG for a swarm: execution order, parallel waves (tasks that can go to separate agents at once), earliest start per task, and the critical path (the cost-weighted chain that bounds the run). Rejects cycles. Uses @ruvector/rudag, built-in Kahn sort + longest path otherwise.',\n    parameters: scheduleParams,\n    execute: async (raw) => {\n      const a = scheduleParams.parse(raw);\n      return json(await scheduleTaskGraph(a.tasks as Array<string | ScheduleTask>, a.dependencies as ScheduleDependency[]));\n    },\n  },\n  {\n    name: 'sublinear_solve',\n    description: 'Solve Mx = b for a diagonally dominant or symmetric positive definite matrix. Uses @ruvnet/sublinear-core (Gauss-Seidel / conjugate gradient), verifies the residual max|Mx-b|, and falls back to a built-in Gauss-Seidel. Returns solution, residual, iterations, method and engine.',\n    parameters: solveParams,\n    execute: async (raw) => {\n      const a = solveParams.parse(raw);\n      return json(await solveLinearSystem(a.matrix as MatrixInput, a.vector, { tolerance: a.tolerance, maxIterations: a.maxIterations, method: a.method }));\n    },\n  },\n  {\n    name: 'sublinear_pagerank',\n    description: 'PageRank over a directed graph (agents, files, tasks), or personalized PageRank around seeds (what matters to these nodes). Uses @ruvnet/sublinear-core power iteration, or local forward push with approximate: true; results are verified, built-in Gauss-Seidel fallback. Returns scores, a ranking and the engine.',\n    parameters: pagerankParams,\n    execute: async (raw) => {\n      const a = pagerankParams.parse(raw);\n      return json(await pageRank(a.edges as PageRankEdge[], {\n        damping: a.damping,\n        nodes: a.nodes,\n        seeds: a.seeds as string[] | Record<string, number> | undefined,\n        approximate: a.approximate,\n        epsilon: a.epsilon,\n        top: a.top,\n      }));\n    },\n  },\n  {\n    name: 'prompt_injection_scan',\n    description: 'Scan text for prompt-injection attempts (instruction override, role switching, prompt exfiltration, jailbreaks) with aidefence, built-in patterns otherwise. Returns threats and the policy decision (allow/warn/block).',\n    parameters: scanParams,\n    execute: async (raw) => {\n      const a = scanParams.parse(raw);\n      return json(scanPromptInjection(a.text, a.policy));\n    },\n  },\n];\n\nexport const ECOSYSTEM_TOOL_NAMES = ECOSYSTEM_TOOLS.map((t) => t.name);\n\nexport function registerEcosystemTools(server: { addTool: (tool: EcosystemTool) => void }): void {\n  for (const tool of ECOSYSTEM_TOOLS) server.addTool(tool);\n}\n"]}

package/dist/transport/index.d.ts

@@ -1,3 +1,3 @@
 export * from './quic.js';
-export { loadQuicTransport, isQuicAvailable, getTransportCapabilities, WebSocketFallbackTransport, DEFAULT_STREAM_ID, type AgentTransport, type AgentMessage, type InboundMessageHandler, type OnMessageOptions, type PoolStatistics, type TransportCapabilities, type QuicTransportConfig as LoaderQuicTransportConfig, type TlsConfig, } from './quic-loader.js';
+export { loadQuicTransport, isQuicAvailable, getQuicStatus, QUIC_UNAVAILABLE_REASON, getTransportCapabilities, WebSocketFallbackTransport, DEFAULT_STREAM_ID, type AgentTransport, type AgentMessage, type InboundMessageHandler, type OnMessageOptions, type PoolStatistics, type TransportCapabilities, type QuicStatus, type QuicTransportConfig as LoaderQuicTransportConfig, type TlsConfig, } from './quic-loader.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/transport/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/transport/index.ts"],"names":[],"mappings":"AACA,cAAc,WAAW,CAAC;AAC1B,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,wBAAwB,EACxB,0BAA0B,EAC1B,iBAAiB,EACjB,KAAK,cAAc,EACnB,KAAK,YAAY,EACjB,KAAK,qBAAqB,EAC1B,KAAK,gBAAgB,EACrB,KAAK,cAAc,EACnB,KAAK,qBAAqB,EAC1B,KAAK,mBAAmB,IAAI,yBAAyB,EACrD,KAAK,SAAS,GACf,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/transport/index.ts"],"names":[],"mappings":"AACA,cAAc,WAAW,CAAC;AAC1B,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,aAAa,EACb,uBAAuB,EACvB,wBAAwB,EACxB,0BAA0B,EAC1B,iBAAiB,EACjB,KAAK,cAAc,EACnB,KAAK,YAAY,EACjB,KAAK,qBAAqB,EAC1B,KAAK,gBAAgB,EACrB,KAAK,cAAc,EACnB,KAAK,qBAAqB,EAC1B,KAAK,UAAU,EACf,KAAK,mBAAmB,IAAI,yBAAyB,EACrD,KAAK,SAAS,GACf,MAAM,kBAAkB,CAAC"}

package/dist/transport/index.js

@@ -1,4 +1,4 @@
 // Transport Layer Exports
 export * from './quic.js';
-export { loadQuicTransport, isQuicAvailable, getTransportCapabilities, WebSocketFallbackTransport, DEFAULT_STREAM_ID, } from './quic-loader.js';
+export { loadQuicTransport, isQuicAvailable, getQuicStatus, QUIC_UNAVAILABLE_REASON, getTransportCapabilities, WebSocketFallbackTransport, DEFAULT_STREAM_ID, } from './quic-loader.js';
 //# sourceMappingURL=index.js.map

package/dist/transport/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/transport/index.ts"],"names":[],"mappings":"AAAA,0BAA0B;AAC1B,cAAc,WAAW,CAAC;AAC1B,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,wBAAwB,EACxB,0BAA0B,EAC1B,iBAAiB,GASlB,MAAM,kBAAkB,CAAC","sourcesContent":["// Transport Layer Exports\nexport * from './quic.js';\nexport {\n  loadQuicTransport,\n  isQuicAvailable,\n  getTransportCapabilities,\n  WebSocketFallbackTransport,\n  DEFAULT_STREAM_ID,\n  type AgentTransport,\n  type AgentMessage,\n  type InboundMessageHandler,\n  type OnMessageOptions,\n  type PoolStatistics,\n  type TransportCapabilities,\n  type QuicTransportConfig as LoaderQuicTransportConfig,\n  type TlsConfig,\n} from './quic-loader.js';\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/transport/index.ts"],"names":[],"mappings":"AAAA,0BAA0B;AAC1B,cAAc,WAAW,CAAC;AAC1B,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,aAAa,EACb,uBAAuB,EACvB,wBAAwB,EACxB,0BAA0B,EAC1B,iBAAiB,GAUlB,MAAM,kBAAkB,CAAC","sourcesContent":["// Transport Layer Exports\nexport * from './quic.js';\nexport {\n  loadQuicTransport,\n  isQuicAvailable,\n  getQuicStatus,\n  QUIC_UNAVAILABLE_REASON,\n  getTransportCapabilities,\n  WebSocketFallbackTransport,\n  DEFAULT_STREAM_ID,\n  type AgentTransport,\n  type AgentMessage,\n  type InboundMessageHandler,\n  type OnMessageOptions,\n  type PoolStatistics,\n  type TransportCapabilities,\n  type QuicStatus,\n  type QuicTransportConfig as LoaderQuicTransportConfig,\n  type TlsConfig,\n} from './quic-loader.js';\n"]}