agentic-flow 3.0.0 → 3.2.0

package/dist/integrations/task-partition.js

@@ -0,0 +1,173 @@
+/**
+ * Split a task-dependency graph into two groups with the least coupling.
+ *
+ * A global minimum cut over the (undirected, weighted) dependency graph finds
+ * the split that severs the fewest/lightest dependencies — the natural seam for
+ * handing work to two agent teams so they block on each other least.
+ *
+ * Engine: `@ruvector/mincut-wasm` (optionalDependency) when installed; a
+ * built-in Stoer-Wagner implementation otherwise (O(n^3), capped at
+ * BUILTIN_MAX_TASKS). Both are exact, so they agree on the cut weight.
+ *
+ * A global min cut can be lopsided (one loosely-attached task vs the rest):
+ * that is the correct answer to "where is the weakest seam", not a balance
+ * guarantee. Tasks with no dependencies have nothing to cut and are reported
+ * in `isolated` rather than forced into a side.
+ */
+import { importOptional } from './optional.js';
+export const BUILTIN_MAX_TASKS = 400;
+function normalize(tasks, deps) {
+    const ids = new Map();
+    const names = [];
+    const add = (t) => {
+        if (!ids.has(t)) {
+            ids.set(t, names.length);
+            names.push(t);
+        }
+        return ids.get(t);
+    };
+    for (const t of tasks)
+        add(String(t));
+    const weights = new Map();
+    for (const d of deps) {
+        const w = d.weight ?? 1;
+        if (!Number.isFinite(w) || w < 0)
+            throw new Error(`invalid dependency weight ${w} (${d.from} -> ${d.to})`);
+        const a = add(String(d.from));
+        const b = add(String(d.to));
+        if (a === b || w === 0)
+            continue;
+        const key = a < b ? `${a},${b}` : `${b},${a}`;
+        weights.set(key, (weights.get(key) ?? 0) + w);
+    }
+    const edges = [];
+    for (const [key, w] of weights) {
+        const [a, b] = key.split(',').map(Number);
+        edges.push([a, b, w]);
+    }
+    return { names, edges };
+}
+/** Exact global min cut (Stoer-Wagner) over vertices that appear in `edges`. */
+function stoerWagner(n, edges) {
+    const W = Array.from({ length: n }, () => new Array(n).fill(0));
+    for (const [a, b, w] of edges) {
+        W[a][b] += w;
+        W[b][a] += w;
+    }
+    const members = Array.from({ length: n }, (_, i) => [i]);
+    let active = Array.from({ length: n }, (_, i) => i);
+    let best = Infinity;
+    let bestSide = [];
+    while (active.length > 1) {
+        const added = new Set();
+        const conn = new Map(active.map((v) => [v, 0]));
+        let prev = -1;
+        let last = -1;
+        for (let step = 0; step < active.length; step++) {
+            let pick = -1;
+            for (const v of active) {
+                if (!added.has(v) && (pick === -1 || conn.get(v) > conn.get(pick)))
+                    pick = v;
+            }
+            added.add(pick);
+            prev = last;
+            last = pick;
+            if (step === active.length - 1) {
+                const cutOfPhase = conn.get(pick);
+                if (cutOfPhase < best) {
+                    best = cutOfPhase;
+                    bestSide = [...members[pick]];
+                }
+            }
+            for (const v of active)
+                if (!added.has(v))
+                    conn.set(v, conn.get(v) + W[pick][v]);
+        }
+        // merge `last` into `prev`
+        for (const v of active) {
+            W[prev][v] += W[last][v];
+            W[v][prev] = W[prev][v];
+        }
+        members[prev].push(...members[last]);
+        active = active.filter((v) => v !== last);
+    }
+    return { cut: best === Infinity ? 0 : best, side: new Set(bestSide) };
+}
+function components(n, edges) {
+    const parent = Array.from({ length: n }, (_, i) => i);
+    const find = (x) => (parent[x] === x ? x : (parent[x] = find(parent[x])));
+    for (const [a, b] of edges)
+        parent[find(a)] = find(b);
+    const groups = new Map();
+    for (let i = 0; i < n; i++) {
+        const r = find(i);
+        if (!groups.has(r))
+            groups.set(r, []);
+        groups.get(r).push(i);
+    }
+    return [...groups.values()];
+}
+export async function partitionTaskGraph(tasks, dependencies, options = {}) {
+    const { names, edges } = normalize(tasks, dependencies);
+    const touched = new Set();
+    for (const [a, b] of edges) {
+        touched.add(a);
+        touched.add(b);
+    }
+    const isolated = names.filter((_, i) => !touched.has(i));
+    const toEdges = (list) => list.map((e) => ({ from: names[e.u], to: names[e.v], weight: e.weight }));
+    if (touched.size < 2) {
+        return { groups: [names.filter((_, i) => touched.has(i)), []], isolated, cutWeight: 0, cutEdges: [], engine: 'builtin' };
+    }
+    if (options.engine !== 'builtin') {
+        const mod = await importOptional('@ruvector/mincut-wasm');
+        if (mod?.WasmMinCut) {
+            const g = mod.WasmMinCut.fromEdges(edges);
+            try {
+                const p = g.partition();
+                return {
+                    groups: [p.s.map((i) => names[i]), p.t.map((i) => names[i])],
+                    isolated,
+                    cutWeight: g.minCutValue(),
+                    cutEdges: toEdges(g.cutEdges()),
+                    engine: 'mincut-wasm',
+                };
+            }
+            finally {
+                g.free?.();
+            }
+        }
+    }
+    // Built-in: disconnected graphs cut at weight 0 between components.
+    const comps = components(names.length, edges).filter((c) => c.some((v) => touched.has(v)));
+    let side;
+    let cut;
+    if (comps.length > 1) {
+        side = new Set(comps[0]);
+        cut = 0;
+    }
+    else {
+        if (touched.size > BUILTIN_MAX_TASKS) {
+            throw new Error(`built-in min cut is limited to ${BUILTIN_MAX_TASKS} connected tasks; install @ruvector/mincut-wasm for larger graphs`);
+        }
+        // Re-index the touched vertices densely for Stoer-Wagner.
+        const order = [...touched];
+        const local = new Map(order.map((v, i) => [v, i]));
+        const r = stoerWagner(order.length, edges.map(([a, b, w]) => [local.get(a), local.get(b), w]));
+        side = new Set([...r.side].map((i) => order[i]));
+        cut = r.cut;
+    }
+    const s = [...touched].filter((v) => side.has(v));
+    const t = [...touched].filter((v) => !side.has(v));
+    const crossing = edges
+        .filter(([a, b]) => side.has(a) !== side.has(b))
+        .map(([u, v, weight]) => ({ u, v, weight }));
+    return {
+        groups: [s.map((i) => names[i]), t.map((i) => names[i])],
+        isolated,
+        cutWeight: cut,
+        cutEdges: toEdges(crossing),
+        engine: 'builtin',
+    };
+}
+//# sourceMappingURL=task-partition.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"task-partition.js","sourceRoot":"","sources":["../../src/integrations/task-partition.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAmB/C,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAarC,SAAS,SAAS,CAAC,KAAe,EAAE,IAAsB;IACxD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE;QACxB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;IACrB,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,KAAK,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3G,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACjC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,MAAM,KAAK,GAAoC,EAAE,CAAC;IAClD,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;QAC/B,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED,gFAAgF;AAChF,SAAS,WAAW,CAAC,CAAS,EAAE,KAAsC;IACpE,MAAM,CAAC,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC9B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACb,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;IACD,MAAM,OAAO,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,IAAI,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACpD,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,QAAQ,GAAa,EAAE,CAAC;IAC5B,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAiB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;QACd,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;QACd,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YAChD,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;oBAAE,IAAI,GAAG,CAAC,CAAC;YACjF,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,IAAI,GAAG,IAAI,CAAC;YACZ,IAAI,GAAG,IAAI,CAAC;YACZ,IAAI,IAAI,KAAK,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;gBACnC,IAAI,UAAU,GAAG,IAAI,EAAE,CAAC;oBACtB,IAAI,GAAG,UAAU,CAAC;oBAClB,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,2BAA2B;QAC3B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;AACxE,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,KAAsC;IACnE,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;AAC9B,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,KAAe,EACf,YAA8B,EAC9B,UAA2C,EAAE;IAE7C,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,OAAO,GAAG,CAAC,IAAqD,EAAE,EAAE,CACxE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAE5E,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,EAAE,MAAM,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IAC3H,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,MAAM,cAAc,CAAe,uBAAuB,CAAC,CAAC;QACxE,IAAI,GAAG,EAAE,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAC1C,IAAI,CAAC;gBACH,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;gBACxB,OAAO;oBACL,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC5D,QAAQ;oBACR,SAAS,EAAE,CAAC,CAAC,WAAW,EAAE;oBAC1B,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;oBAC/B,MAAM,EAAE,aAAa;iBACtB,CAAC;YACJ,CAAC;oBAAS,CAAC;gBACT,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3F,IAAI,IAAiB,CAAC;IACtB,IAAI,GAAW,CAAC;IAChB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,GAAG,GAAG,CAAC,CAAC;IACV,CAAC;SAAM,CAAC;QACN,IAAI,OAAO,CAAC,IAAI,GAAG,iBAAiB,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CACb,kCAAkC,iBAAiB,mEAAmE,CACvH,CAAC;QACJ,CAAC;QACD,0DAA0D;QAC1D,MAAM,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,CAAC,CAA6B,CAAC,CAAC,CAAC;QAC7H,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;IACd,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,MAAM,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,QAAQ,GAAG,KAAK;SACnB,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC/C,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAC/C,OAAO;QACL,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,QAAQ;QACR,SAAS,EAAE,GAAG;QACd,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC;QAC3B,MAAM,EAAE,SAAS;KAClB,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Split a task-dependency graph into two groups with the least coupling.\n *\n * A global minimum cut over the (undirected, weighted) dependency graph finds\n * the split that severs the fewest/lightest dependencies — the natural seam for\n * handing work to two agent teams so they block on each other least.\n *\n * Engine: `@ruvector/mincut-wasm` (optionalDependency) when installed; a\n * built-in Stoer-Wagner implementation otherwise (O(n^3), capped at\n * BUILTIN_MAX_TASKS). Both are exact, so they agree on the cut weight.\n *\n * A global min cut can be lopsided (one loosely-attached task vs the rest):\n * that is the correct answer to \"where is the weakest seam\", not a balance\n * guarantee. Tasks with no dependencies have nothing to cut and are reported\n * in `isolated` rather than forced into a side.\n */\n\nimport { importOptional } from './optional.js';\n\nexport interface TaskDependency {\n  from: string;\n  to: string;\n  /** Coupling strength, default 1. Must be finite and >= 0. */\n  weight?: number;\n}\n\nexport interface TaskPartition {\n  groups: [string[], string[]];\n  /** Tasks that have no dependencies at all. */\n  isolated: string[];\n  /** Sum of weights of the dependencies crossing between the groups. */\n  cutWeight: number;\n  cutEdges: Array<{ from: string; to: string; weight: number }>;\n  engine: 'mincut-wasm' | 'builtin';\n}\n\nexport const BUILTIN_MAX_TASKS = 400;\n\ninterface MinCutModule {\n  WasmMinCut: {\n    fromEdges(edges: Array<[number, number, number]>): {\n      minCutValue(): number;\n      partition(): { s: number[]; t: number[] };\n      cutEdges(): Array<{ u: number; v: number; weight: number }>;\n      free?(): void;\n    };\n  };\n}\n\nfunction normalize(tasks: string[], deps: TaskDependency[]) {\n  const ids = new Map<string, number>();\n  const names: string[] = [];\n  const add = (t: string) => {\n    if (!ids.has(t)) {\n      ids.set(t, names.length);\n      names.push(t);\n    }\n    return ids.get(t)!;\n  };\n  for (const t of tasks) add(String(t));\n  const weights = new Map<string, number>();\n  for (const d of deps) {\n    const w = d.weight ?? 1;\n    if (!Number.isFinite(w) || w < 0) throw new Error(`invalid dependency weight ${w} (${d.from} -> ${d.to})`);\n    const a = add(String(d.from));\n    const b = add(String(d.to));\n    if (a === b || w === 0) continue;\n    const key = a < b ? `${a},${b}` : `${b},${a}`;\n    weights.set(key, (weights.get(key) ?? 0) + w);\n  }\n  const edges: Array<[number, number, number]> = [];\n  for (const [key, w] of weights) {\n    const [a, b] = key.split(',').map(Number);\n    edges.push([a, b, w]);\n  }\n  return { names, edges };\n}\n\n/** Exact global min cut (Stoer-Wagner) over vertices that appear in `edges`. */\nfunction stoerWagner(n: number, edges: Array<[number, number, number]>): { cut: number; side: Set<number> } {\n  const W: number[][] = Array.from({ length: n }, () => new Array(n).fill(0));\n  for (const [a, b, w] of edges) {\n    W[a][b] += w;\n    W[b][a] += w;\n  }\n  const members: number[][] = Array.from({ length: n }, (_, i) => [i]);\n  let active = Array.from({ length: n }, (_, i) => i);\n  let best = Infinity;\n  let bestSide: number[] = [];\n  while (active.length > 1) {\n    const added = new Set<number>();\n    const conn = new Map<number, number>(active.map((v) => [v, 0]));\n    let prev = -1;\n    let last = -1;\n    for (let step = 0; step < active.length; step++) {\n      let pick = -1;\n      for (const v of active) {\n        if (!added.has(v) && (pick === -1 || conn.get(v)! > conn.get(pick)!)) pick = v;\n      }\n      added.add(pick);\n      prev = last;\n      last = pick;\n      if (step === active.length - 1) {\n        const cutOfPhase = conn.get(pick)!;\n        if (cutOfPhase < best) {\n          best = cutOfPhase;\n          bestSide = [...members[pick]];\n        }\n      }\n      for (const v of active) if (!added.has(v)) conn.set(v, conn.get(v)! + W[pick][v]);\n    }\n    // merge `last` into `prev`\n    for (const v of active) {\n      W[prev][v] += W[last][v];\n      W[v][prev] = W[prev][v];\n    }\n    members[prev].push(...members[last]);\n    active = active.filter((v) => v !== last);\n  }\n  return { cut: best === Infinity ? 0 : best, side: new Set(bestSide) };\n}\n\nfunction components(n: number, edges: Array<[number, number, number]>): number[][] {\n  const parent = Array.from({ length: n }, (_, i) => i);\n  const find = (x: number): number => (parent[x] === x ? x : (parent[x] = find(parent[x])));\n  for (const [a, b] of edges) parent[find(a)] = find(b);\n  const groups = new Map<number, number[]>();\n  for (let i = 0; i < n; i++) {\n    const r = find(i);\n    if (!groups.has(r)) groups.set(r, []);\n    groups.get(r)!.push(i);\n  }\n  return [...groups.values()];\n}\n\nexport async function partitionTaskGraph(\n  tasks: string[],\n  dependencies: TaskDependency[],\n  options: { engine?: 'auto' | 'builtin' } = {},\n): Promise<TaskPartition> {\n  const { names, edges } = normalize(tasks, dependencies);\n  const touched = new Set<number>();\n  for (const [a, b] of edges) {\n    touched.add(a);\n    touched.add(b);\n  }\n  const isolated = names.filter((_, i) => !touched.has(i));\n  const toEdges = (list: Array<{ u: number; v: number; weight: number }>) =>\n    list.map((e) => ({ from: names[e.u], to: names[e.v], weight: e.weight }));\n\n  if (touched.size < 2) {\n    return { groups: [names.filter((_, i) => touched.has(i)), []], isolated, cutWeight: 0, cutEdges: [], engine: 'builtin' };\n  }\n\n  if (options.engine !== 'builtin') {\n    const mod = await importOptional<MinCutModule>('@ruvector/mincut-wasm');\n    if (mod?.WasmMinCut) {\n      const g = mod.WasmMinCut.fromEdges(edges);\n      try {\n        const p = g.partition();\n        return {\n          groups: [p.s.map((i) => names[i]), p.t.map((i) => names[i])],\n          isolated,\n          cutWeight: g.minCutValue(),\n          cutEdges: toEdges(g.cutEdges()),\n          engine: 'mincut-wasm',\n        };\n      } finally {\n        g.free?.();\n      }\n    }\n  }\n\n  // Built-in: disconnected graphs cut at weight 0 between components.\n  const comps = components(names.length, edges).filter((c) => c.some((v) => touched.has(v)));\n  let side: Set<number>;\n  let cut: number;\n  if (comps.length > 1) {\n    side = new Set(comps[0]);\n    cut = 0;\n  } else {\n    if (touched.size > BUILTIN_MAX_TASKS) {\n      throw new Error(\n        `built-in min cut is limited to ${BUILTIN_MAX_TASKS} connected tasks; install @ruvector/mincut-wasm for larger graphs`,\n      );\n    }\n    // Re-index the touched vertices densely for Stoer-Wagner.\n    const order = [...touched];\n    const local = new Map(order.map((v, i) => [v, i]));\n    const r = stoerWagner(order.length, edges.map(([a, b, w]) => [local.get(a)!, local.get(b)!, w] as [number, number, number]));\n    side = new Set([...r.side].map((i) => order[i]));\n    cut = r.cut;\n  }\n  const s = [...touched].filter((v) => side.has(v));\n  const t = [...touched].filter((v) => !side.has(v));\n  const crossing = edges\n    .filter(([a, b]) => side.has(a) !== side.has(b))\n    .map(([u, v, weight]) => ({ u, v, weight }));\n  return {\n    groups: [s.map((i) => names[i]), t.map((i) => names[i])],\n    isolated,\n    cutWeight: cut,\n    cutEdges: toEdges(crossing),\n    engine: 'builtin',\n  };\n}\n"]}

package/dist/mcp/mcp-policy.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mcp-policy.d.ts","sourceRoot":"","sources":["../../src/mcp/mcp-policy.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG,UAAU,GAAG,OAAO,CAAC;AAWzE,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,UAAU,CAMrE;AAED,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE;IAAE,OAAO,EAAE,UAAU,CAAC;IAAC,oBAAoB,CAAC,EAAE,OAAO,CAAA;CAAE,GAC/D,OAAO,CAQT;AAED,wBAAgB,gBAAgB,CAAC,CAAC,SAAS;IAAE,OAAO,EAAE,CAAC,IAAI,EAAE;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,KAAK,OAAO,CAAA;CAAE,EACzF,MAAM,EAAE,CAAC,EACT,OAAO,EAAE;IAAE,OAAO,EAAE,UAAU,CAAC;IAAC,oBAAoB,CAAC,EAAE,OAAO,CAAA;CAAE,GAC/D,CAAC,CAOH"}
+{"version":3,"file":"mcp-policy.d.ts","sourceRoot":"","sources":["../../src/mcp/mcp-policy.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG,UAAU,GAAG,OAAO,CAAC;AAazE,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,UAAU,CAMrE;AAED,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE;IAAE,OAAO,EAAE,UAAU,CAAC;IAAC,oBAAoB,CAAC,EAAE,OAAO,CAAA;CAAE,GAC/D,OAAO,CAQT;AAED,wBAAgB,gBAAgB,CAAC,CAAC,SAAS;IAAE,OAAO,EAAE,CAAC,IAAI,EAAE;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,KAAK,OAAO,CAAA;CAAE,EACzF,MAAM,EAAE,CAAC,EACT,OAAO,EAAE;IAAE,OAAO,EAAE,UAAU,CAAC;IAAC,oBAAoB,CAAC,EAAE,OAAO,CAAA;CAAE,GAC/D,CAAC,CAOH"}

package/dist/mcp/mcp-policy.js

@@ -3,6 +3,8 @@ const READONLY = [
     /^agentdb_(stats|pattern_search|pattern_stats)$/,
     /^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)$/,
 ];
 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;CAChD,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];\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,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"]}

package/dist/mcp/standalone-stdio.js

@@ -5,6 +5,8 @@ import { FastMCP } from 'fastmcp';
 import { z } from 'zod';
 import { execFileSync } from 'child_process';
 import { registerHarnessTools } from './tools/harness-tools.js';
+import { registerEcosystemTools, ECOSYSTEM_TOOL_NAMES } from './tools/ecosystem-tools.js';
+import { applyAgentBoosterEdit } from '../integrations/agent-booster.js';
 import { installMcpPolicy, parseMcpProfile } from './mcp-policy.js';
 import { assertCategoryPath, resolveInsideCwd } from '../utils/path-safety.js';
 // Security: All shell-outs use execFileSync with argv arrays (shell: false) to
@@ -39,6 +41,9 @@ console.error(`🔐 MCP capability profile: ${mcpProfile}`);
 // ADR-075: harness evolution/repair + provenance tools (harness_repair,
 // harness_manifest, harness_verify).
 registerHarnessTools(server);
+// Ecosystem tools backed by optional ruvnet packages (aidefence, mincut-wasm,
+// sublinear-time-solver); each has a built-in fallback. Pure computations.
+registerEcosystemTools(server);
 // Tool: Run agentic-flow agent
 server.addTool({
     name: 'agentic_flow_agent',
@@ -352,15 +357,9 @@ server.addTool({
                 };
                 language = langMap[ext] || 'javascript';
             }
-            // Apply edit using agent-booster@0.2.2 CLI (automatically installs from npm if not available)
-            const result = execFileSync('npx', ['--yes', 'agent-booster@0.2.2', 'apply', '--language', language], {
-                ...NPX_EXEC_OPTS,
-                encoding: 'utf-8',
-                input: JSON.stringify({ code: originalCode, edit: code_edit }),
-                maxBuffer: 10 * 1024 * 1024,
-                timeout: 30000 // Allow time for npx to download package on first run
-            });
-            const parsed = JSON.parse(result);
+            // Apply edit in-process via the optional agent-booster package; falls back
+            // to the pinned agent-booster@0.2.2 CLI through npx when it is not installed.
+            const parsed = await applyAgentBoosterEdit(originalCode, code_edit, language, { npxTimeoutMs: 30000 });
             if (parsed.success && parsed.confidence >= 0.7) {
                 // High confidence - use Agent Booster result
                 fs.writeFileSync(safePath, parsed.output);
@@ -437,14 +436,7 @@ server.addTool({
                     language = langMap[ext] || 'javascript';
                 }
                 // Apply edit
-                const result = execFileSync('npx', ['--yes', 'agent-booster@0.2.2', 'apply', '--language', language], {
-                    ...NPX_EXEC_OPTS,
-                    encoding: 'utf-8',
-                    input: JSON.stringify({ code: originalCode, edit: edit.code_edit }),
-                    maxBuffer: 10 * 1024 * 1024,
-                    timeout: 5000
-                });
-                const parsed = JSON.parse(result);
+                const parsed = await applyAgentBoosterEdit(originalCode, edit.code_edit, language, { npxTimeoutMs: 5000 });
                 totalLatency += parsed.latency;
                 if (parsed.success && parsed.confidence >= 0.7) {
                     fs.writeFileSync(safePath, parsed.output);
@@ -528,14 +520,7 @@ server.addTool({
                     };
                     language = langMap[ext] || 'javascript';
                 }
-                const result = execFileSync('npx', ['--yes', 'agent-booster@0.2.2', 'apply', '--language', language], {
-                    ...NPX_EXEC_OPTS,
-                    encoding: 'utf-8',
-                    input: JSON.stringify({ code: originalCode, edit: edit.code_edit }),
-                    maxBuffer: 10 * 1024 * 1024,
-                    timeout: 5000
-                });
-                const parsed = JSON.parse(result);
+                const parsed = await applyAgentBoosterEdit(originalCode, edit.code_edit, language, { npxTimeoutMs: 5000 });
                 totalLatency += parsed.latency;
                 if (parsed.success && parsed.confidence >= 0.7) {
                     fs.writeFileSync(safePath, parsed.output);
@@ -761,7 +746,7 @@ server.addTool({
         }
     }
 });
-console.error('✅ Registered 15 tools (7 agentic-flow + 3 agent-booster + 5 agentdb):');
+console.error(`✅ Tools (subject to the ${mcpProfile} profile): 7 agentic-flow + 3 agent-booster + 5 agentdb + harness + ${ECOSYSTEM_TOOL_NAMES.length} ecosystem:`);
 console.error('   • agentic_flow_agent (execute agent with 13 parameters)');
 console.error('   • agentic_flow_list_agents (list 66+ agents)');
 console.error('   • agentic_flow_create_agent (create custom agent)');
@@ -777,6 +762,7 @@ console.error('   • agentdb_pattern_store (store reasoning patterns) 🧠 NEW'
 console.error('   • agentdb_pattern_search (search similar patterns) 🧠 NEW');
 console.error('   • agentdb_pattern_stats (pattern analytics) 🧠 NEW');
 console.error('   • agentdb_clear_cache (clear query cache) 🧠 NEW');
+console.error(`   • ${ECOSYSTEM_TOOL_NAMES.join(', ')}`);
 console.error('🔌 Starting stdio transport...');
 server.start({ transportType: 'stdio' }).then(() => {
     console.error('✅ Agentic-Flow MCP server running on stdio');