@claude-flow/cli 3.10.46 → 3.12.0

package/dist/src/ruvector/task-embedder.js

@@ -0,0 +1,237 @@
+/**
+ * task-embedder.ts — Shared lazy task embedder + LRU cache (ADR-149 iter 9).
+ *
+ * The cost-optimal neural router (ADR-149) fires only when `route(task, embedding)`
+ * is called with a real embedding. Two call sites in the dispatcher chain need
+ * embeddings: `agent-tools.ts` (initial routing) and `agent-execute-core.ts`
+ * (the fallback chain on 429/5xx). Before this module they each loaded their
+ * own @xenova/transformers MiniLM pipeline and recomputed embeddings on every
+ * call — including for repeated prompts.
+ *
+ * This module:
+ *   1. Loads the pipeline once per process (`loadTaskEmbedder`).
+ *   2. Caches embeddings per task text via an LRU of configurable size
+ *      (default 500 entries ≈ 1.5 MB at 384-dim).
+ *   3. Hashes by FNV-1a-32 + length to keep the key compact and collision-safe
+ *      for typical prompt sizes.
+ *   4. Returns `undefined` on any failure so callers gracefully fall back to
+ *      the heuristic+bandit path.
+ *
+ * @module task-embedder
+ */
+// ============================================================================
+// FNV-1a-32 hash (matches scripts/gen-seed-corpus.mjs + router-trajectory.ts)
+// ============================================================================
+function fnv1a32(s) {
+    let h = 0x811c9dc5 >>> 0;
+    for (let i = 0; i < s.length; i++) {
+        h ^= s.charCodeAt(i);
+        h = (h + ((h << 1) + (h << 4) + (h << 7) + (h << 8) + (h << 24))) >>> 0;
+    }
+    return h.toString(16).padStart(8, '0');
+}
+/** Compact cache key — hash + length so distinct prompts of similar shape collide rarely. */
+function cacheKey(task) {
+    return `${fnv1a32(task)}:${task.length}`;
+}
+// Single shared extractor. Both single-text and array-input modes call this
+// same function (xenova's pipeline returns a callable that accepts either),
+// so we don't pay the ONNX model-load cost twice.
+let _extractorPromise = null;
+function loadExtractor() {
+    if (_extractorPromise !== null)
+        return _extractorPromise;
+    _extractorPromise = (async () => {
+        try {
+            const specifier = '@xenova/transformers';
+            const mod = await import(/* @vite-ignore */ specifier).catch(() => null);
+            if (!mod || typeof mod.pipeline !== 'function')
+                return null;
+            return await mod.pipeline('feature-extraction', 'Xenova/all-MiniLM-L6-v2', { quantized: true });
+        }
+        catch {
+            return null;
+        }
+    })();
+    return _extractorPromise;
+}
+async function loadEmbedder() {
+    const ex = await loadExtractor();
+    if (!ex)
+        return null;
+    return async (text) => {
+        const out = await ex(text, { pooling: 'mean', normalize: true });
+        return Array.from(out.data);
+    };
+}
+/**
+ * Array-input batch embedder — xenova's pipeline accepts `string[]` and
+ * returns a stacked tensor of shape `[N, dim]`. Shares the same loaded
+ * pipeline with `loadEmbedder` so cold-load cost is paid once across
+ * single + batch usage. Measured speedup: ~1.83× on 30-task batches
+ * against the same-pipeline single-call loop.
+ */
+async function loadEmbedderBatch() {
+    const ex = await loadExtractor();
+    if (!ex)
+        return null;
+    return async (texts) => {
+        const out = await ex(texts, { pooling: 'mean', normalize: true });
+        const dims = out.dims ?? [texts.length, 384];
+        const N = dims[0] ?? texts.length;
+        const dim = dims[1] ?? Math.floor(out.data.length / N);
+        const data = out.data;
+        const result = new Array(N);
+        for (let i = 0; i < N; i++) {
+            result[i] = Array.from(data.subarray(i * dim, (i + 1) * dim));
+        }
+        return result;
+    };
+}
+// ============================================================================
+// LRU cache — Map preserves insertion order, so delete+set on hit = O(1) LRU
+// ============================================================================
+const MAX_SIZE = (() => {
+    const v = parseInt(process.env.CLAUDE_FLOW_ROUTER_EMBED_CACHE_SIZE ?? '500', 10);
+    return Number.isFinite(v) && v >= 0 ? v : 500;
+})();
+const _cache = new Map();
+let _hits = 0;
+let _misses = 0;
+function lruGet(key) {
+    const hit = _cache.get(key);
+    if (hit === undefined)
+        return undefined;
+    // Refresh recency: re-insert at the end.
+    _cache.delete(key);
+    _cache.set(key, hit);
+    return hit;
+}
+function lruSet(key, value) {
+    if (MAX_SIZE === 0)
+        return;
+    if (_cache.has(key))
+        _cache.delete(key);
+    _cache.set(key, value);
+    while (_cache.size > MAX_SIZE) {
+        const oldest = _cache.keys().next().value;
+        if (oldest === undefined)
+            break;
+        _cache.delete(oldest);
+    }
+}
+// ============================================================================
+// Public API
+// ============================================================================
+/**
+ * Compute (or fetch from cache) the 384-dim MiniLM embedding for `task`.
+ * Returns `undefined` on any failure (missing @xenova/transformers, ONNX
+ * runtime error, etc.) so callers can gracefully fall back to the
+ * heuristic+bandit path. Best-effort and never throws.
+ *
+ * Cache hit-rate accumulates across the process lifetime and is observable
+ * via `embedderStats()` for diagnostics.
+ */
+export async function embedTaskWithCache(task) {
+    if (typeof task !== 'string' || task.length === 0)
+        return undefined;
+    const key = cacheKey(task);
+    const cached = lruGet(key);
+    if (cached !== undefined) {
+        _hits++;
+        return cached;
+    }
+    try {
+        const embed = await loadEmbedder();
+        if (!embed)
+            return undefined;
+        const v = await embed(task);
+        lruSet(key, v);
+        _misses++;
+        return v;
+    }
+    catch {
+        return undefined;
+    }
+}
+/**
+ * Batch counterpart to `embedTaskWithCache`. For each task, returns the
+ * cached embedding when present, else schedules a fresh inference. The
+ * fresh-inference set is computed in a SINGLE ONNX pass via
+ * @xenova/transformers' array-input mode, amortizing tensor setup +
+ * model-load overhead across the batch. Order of the output array
+ * matches the input order.
+ *
+ * Returns `undefined` for any task that failed to embed (missing dep,
+ * runtime error). Cache state updates as if each task had been called
+ * separately through embedTaskWithCache (hits/misses counters update
+ * accordingly).
+ */
+export async function embedTaskWithCacheBatch(tasks) {
+    const out = new Array(tasks.length).fill(undefined);
+    // Validate + split into (cached-hits) and (missing-needs-inference).
+    const missingIdx = [];
+    const missingTasks = [];
+    const missingKeys = [];
+    for (let i = 0; i < tasks.length; i++) {
+        const t = tasks[i];
+        if (typeof t !== 'string' || t.length === 0)
+            continue;
+        const key = cacheKey(t);
+        const hit = lruGet(key);
+        if (hit !== undefined) {
+            _hits++;
+            out[i] = hit;
+        }
+        else {
+            missingIdx.push(i);
+            missingTasks.push(t);
+            missingKeys.push(key);
+        }
+    }
+    if (missingTasks.length === 0)
+        return out;
+    try {
+        const embedBatch = await loadEmbedderBatch();
+        if (!embedBatch) {
+            for (let j = 0; j < missingIdx.length; j++)
+                _misses++;
+            return out;
+        }
+        // Real array-input batch: xenova returns one stacked tensor we slice
+        // back into N embeddings. Amortizes tensor setup + ONNX overhead
+        // across the batch (measured 1.83× speedup at N=30).
+        const fresh = await embedBatch(missingTasks);
+        for (let j = 0; j < missingIdx.length; j++) {
+            const v = fresh[j];
+            if (v) {
+                lruSet(missingKeys[j], v);
+                out[missingIdx[j]] = v;
+            }
+            _misses++;
+        }
+    }
+    catch {
+        // best-effort — leave undefined entries as is
+    }
+    return out;
+}
+/** Diagnostic surface — hit/miss counters + cache state. */
+export function embedderStats() {
+    const total = _hits + _misses;
+    return {
+        size: _cache.size,
+        maxSize: MAX_SIZE,
+        hits: _hits,
+        misses: _misses,
+        hitRate: total > 0 ? _hits / total : 0,
+    };
+}
+/** Test seam — clear LRU + counters so tests get a fresh baseline. */
+export function __resetTaskEmbedderForTests() {
+    _cache.clear();
+    _hits = 0;
+    _misses = 0;
+    _extractorPromise = null;
+}
+//# sourceMappingURL=task-embedder.js.map

package/dist/src/ruvector/task-embedder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-embedder.js","sourceRoot":"","sources":["../../../src/ruvector/task-embedder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,+EAA+E;AAC/E,8EAA8E;AAC9E,+EAA+E;AAE/E,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,CAAC,GAAG,UAAU,KAAK,CAAC,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACzC,CAAC;AAED,6FAA6F;AAC7F,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;AAC3C,CAAC;AAWD,4EAA4E;AAC5E,4EAA4E;AAC5E,kDAAkD;AAClD,IAAI,iBAAiB,GAAuC,IAAI,CAAC;AAEjE,SAAS,aAAa;IACpB,IAAI,iBAAiB,KAAK,IAAI;QAAE,OAAO,iBAAiB,CAAC;IACzD,iBAAiB,GAAG,CAAC,KAAK,IAAI,EAAE;QAC9B,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,sBAAsB,CAAC;YACzC,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YACzE,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,CAAC,QAAQ,KAAK,UAAU;gBAAE,OAAO,IAAI,CAAC;YAC5D,OAAO,MAAM,GAAG,CAAC,QAAQ,CAAC,oBAAoB,EAAE,yBAAyB,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAClG,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC,CAAC,EAAE,CAAC;IACL,OAAO,iBAAiB,CAAC;AAC3B,CAAC;AAED,KAAK,UAAU,YAAY;IACzB,MAAM,EAAE,GAAG,MAAM,aAAa,EAAE,CAAC;IACjC,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IACrB,OAAO,KAAK,EAAE,IAAY,EAAqB,EAAE;QAC/C,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACjE,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAoB,CAAC,CAAC;IAC9C,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,iBAAiB;IAC9B,MAAM,EAAE,GAAG,MAAM,aAAa,EAAE,CAAC;IACjC,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IACrB,OAAO,KAAK,EAAE,KAAe,EAAuB,EAAE;QACpD,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAClE,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;QACtB,MAAM,MAAM,GAAe,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,6EAA6E;AAC7E,+EAA+E;AAE/E,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE;IACrB,MAAM,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,mCAAmC,IAAI,KAAK,EAAE,EAAE,CAAC,CAAC;IACjF,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAChD,CAAC,CAAC,EAAE,CAAC;AAEL,MAAM,MAAM,GAA0B,IAAI,GAAG,EAAE,CAAC;AAChD,IAAI,KAAK,GAAG,CAAC,CAAC;AACd,IAAI,OAAO,GAAG,CAAC,CAAC;AAEhB,SAAS,MAAM,CAAC,GAAW;IACzB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACxC,yCAAyC;IACzC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACrB,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,MAAM,CAAC,GAAW,EAAE,KAAe;IAC1C,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO;IAC3B,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACvB,OAAO,MAAM,CAAC,IAAI,GAAG,QAAQ,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;QAC1C,IAAI,MAAM,KAAK,SAAS;YAAE,MAAM;QAChC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,aAAa;AACb,+EAA+E;AAE/E;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,IAAY;IACnD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACpE,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,KAAK,EAAE,CAAC;QACR,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,YAAY,EAAE,CAAC;QACnC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAC7B,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACf,OAAO,EAAE,CAAC;QACV,OAAO,CAAC,CAAC;IACX,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAAC,KAAe;IAC3D,MAAM,GAAG,GAAgC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACjF,qEAAqE;IACrE,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,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,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACtD,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,KAAK,EAAE,CAAC;YACR,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACf,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC1C,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,MAAM,iBAAiB,EAAE,CAAC;QAC7C,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,OAAO,EAAE,CAAC;YACtD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,qEAAqE;QACrE,iEAAiE;QACjE,qDAAqD;QACrD,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,YAAY,CAAC,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,EAAE,CAAC;gBACN,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1B,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzB,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,8CAA8C;IAChD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,aAAa;IAC3B,MAAM,KAAK,GAAG,KAAK,GAAG,OAAO,CAAC;IAC9B,OAAO;QACL,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,OAAO,EAAE,QAAQ;QACjB,IAAI,EAAE,KAAK;QACX,MAAM,EAAE,OAAO;QACf,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;KACvC,CAAC;AACJ,CAAC;AAED,sEAAsE;AACtE,MAAM,UAAU,2BAA2B;IACzC,MAAM,CAAC,KAAK,EAAE,CAAC;IACf,KAAK,GAAG,CAAC,CAAC;IACV,OAAO,GAAG,CAAC,CAAC;IACZ,iBAAiB,GAAG,IAAI,CAAC;AAC3B,CAAC"}

package/dist/src/services/headless-worker-executor.js

@@ -75,18 +75,18 @@ export const HEADLESS_WORKER_CONFIGS = {
         description: 'AI-powered security analysis',
         enabled: true,
         headless: {
-            promptTemplate: `Analyze this codebase for security vulnerabilities:
-- Check for hardcoded secrets (API keys, passwords)
-- Identify SQL injection risks
-- Find XSS vulnerabilities
-- Check for insecure dependencies
-- Identify authentication/authorization issues
-
-Provide a JSON report with:
-{
-  "vulnerabilities": [{ "severity": "high|medium|low", "file": "...", "line": N, "description": "..." }],
-  "riskScore": 0-100,
-  "recommendations": ["..."]
+            promptTemplate: `Analyze this codebase for security vulnerabilities:
+- Check for hardcoded secrets (API keys, passwords)
+- Identify SQL injection risks
+- Find XSS vulnerabilities
+- Check for insecure dependencies
+- Identify authentication/authorization issues
+
+Provide a JSON report with:
+{
+  "vulnerabilities": [{ "severity": "high|medium|low", "file": "...", "line": N, "description": "..." }],
+  "riskScore": 0-100,
+  "recommendations": ["..."]
 }`,
             sandbox: 'strict',
             model: 'haiku',
@@ -103,13 +103,13 @@ Provide a JSON report with:
         description: 'AI optimization suggestions',
         enabled: true,
         headless: {
-            promptTemplate: `Analyze this codebase for performance optimizations:
-- Identify N+1 query patterns
-- Find unnecessary re-renders in React
-- Suggest caching opportunities
-- Identify memory leaks
-- Find redundant computations
-
+            promptTemplate: `Analyze this codebase for performance optimizations:
+- Identify N+1 query patterns
+- Find unnecessary re-renders in React
+- Suggest caching opportunities
+- Identify memory leaks
+- Find redundant computations
+
 Provide actionable suggestions with code examples.`,
             sandbox: 'permissive',
             model: 'sonnet',
@@ -126,13 +126,13 @@ Provide actionable suggestions with code examples.`,
         description: 'AI test gap analysis',
         enabled: true,
         headless: {
-            promptTemplate: `Analyze test coverage and identify gaps:
-- Find untested functions and classes
-- Identify edge cases not covered
-- Suggest new test scenarios
-- Check for missing error handling tests
-- Identify integration test gaps
-
+            promptTemplate: `Analyze test coverage and identify gaps:
+- Find untested functions and classes
+- Identify edge cases not covered
+- Suggest new test scenarios
+- Check for missing error handling tests
+- Identify integration test gaps
+
 For each gap, provide a test skeleton.`,
             sandbox: 'permissive',
             model: 'sonnet',
@@ -149,13 +149,13 @@ For each gap, provide a test skeleton.`,
         description: 'AI documentation generation',
         enabled: false,
         headless: {
-            promptTemplate: `Generate documentation for undocumented code:
-- Add JSDoc comments to functions
-- Create README sections for modules
-- Document API endpoints
-- Add inline comments for complex logic
-- Generate usage examples
-
+            promptTemplate: `Generate documentation for undocumented code:
+- Add JSDoc comments to functions
+- Create README sections for modules
+- Document API endpoints
+- Add inline comments for complex logic
+- Generate usage examples
+
 Focus on public APIs and exported functions.`,
             sandbox: 'permissive',
             model: 'haiku',
@@ -172,19 +172,19 @@ Focus on public APIs and exported functions.`,
         description: 'Deep knowledge acquisition',
         enabled: false,
         headless: {
-            promptTemplate: `Deeply analyze this codebase to learn:
-- Architectural patterns used
-- Coding conventions
-- Domain-specific terminology
-- Common patterns and idioms
-- Team preferences
-
-Provide insights as JSON:
-{
-  "architecture": { "patterns": [...], "style": "..." },
-  "conventions": { "naming": "...", "formatting": "..." },
-  "domains": ["..."],
-  "insights": ["..."]
+            promptTemplate: `Deeply analyze this codebase to learn:
+- Architectural patterns used
+- Coding conventions
+- Domain-specific terminology
+- Common patterns and idioms
+- Team preferences
+
+Provide insights as JSON:
+{
+  "architecture": { "patterns": [...], "style": "..." },
+  "conventions": { "naming": "...", "formatting": "..." },
+  "domains": ["..."],
+  "insights": ["..."]
 }`,
             sandbox: 'strict',
             model: 'opus',
@@ -201,13 +201,13 @@ Provide insights as JSON:
         description: 'AI refactoring suggestions',
         enabled: false,
         headless: {
-            promptTemplate: `Suggest refactoring opportunities:
-- Identify code duplication
-- Suggest better abstractions
-- Find opportunities for design patterns
-- Identify overly complex functions
-- Suggest module reorganization
-
+            promptTemplate: `Suggest refactoring opportunities:
+- Identify code duplication
+- Suggest better abstractions
+- Find opportunities for design patterns
+- Identify overly complex functions
+- Suggest module reorganization
+
 Provide before/after code examples.`,
             sandbox: 'permissive',
             model: 'sonnet',
@@ -224,13 +224,13 @@ Provide before/after code examples.`,
         description: 'Deep code analysis',
         enabled: false,
         headless: {
-            promptTemplate: `Perform deep analysis of this codebase:
-- Understand data flow
-- Map dependencies
-- Identify architectural issues
-- Find potential bugs
-- Analyze error handling
-
+            promptTemplate: `Perform deep analysis of this codebase:
+- Understand data flow
+- Map dependencies
+- Identify architectural issues
+- Find potential bugs
+- Analyze error handling
+
 Provide comprehensive report.`,
             sandbox: 'strict',
             model: 'opus',
@@ -247,18 +247,18 @@ Provide comprehensive report.`,
         description: 'Predictive preloading',
         enabled: false,
         headless: {
-            promptTemplate: `Based on recent activity, predict what the developer needs:
-- Files likely to be edited next
-- Tests that should be run
-- Documentation to reference
-- Dependencies to check
-
-Provide preload suggestions as JSON:
-{
-  "filesToPreload": ["..."],
-  "testsToRun": ["..."],
-  "docsToReference": ["..."],
-  "confidence": 0.0-1.0
+            promptTemplate: `Based on recent activity, predict what the developer needs:
+- Files likely to be edited next
+- Tests that should be run
+- Documentation to reference
+- Dependencies to check
+
+Provide preload suggestions as JSON:
+{
+  "filesToPreload": ["..."],
+  "testsToRun": ["..."],
+  "docsToReference": ["..."],
+  "confidence": 0.0-1.0
 }`,
             sandbox: 'strict',
             model: 'haiku',
@@ -829,20 +829,20 @@ export class HeadlessWorkerExecutor extends EventEmitter {
      */
     buildPrompt(template, context) {
         if (!context) {
-            return `${template}
-
-## Instructions
-
+            return `${template}
+
+## Instructions
+
 Analyze the codebase and provide your response following the format specified in the task.`;
         }
-        return `${template}
-
-## Codebase Context
-
-${context}
-
-## Instructions
-
+        return `${template}
+
+## Codebase Context
+
+${context}
+
+## Instructions
+
 Analyze the above codebase context and provide your response following the format specified in the task.`;
     }
     /**

package/dist/src/transfer/deploy-seraphine.js

@@ -71,29 +71,29 @@ function parseArgs() {
  * Print help message
  */
 function printHelp() {
-    console.log(`
-Seraphine Genesis Deployer
-==========================
-
-Deploy the foundational Claude Flow pattern model.
-
-Usage:
-  npx ts-node deploy-seraphine.ts [options]
-
-Options:
-  --output, -o <path>     Output file path
-  --to-ipfs, --ipfs       Upload to IPFS
-  --anonymize, -a <level> Anonymization level (minimal|standard|strict|paranoid)
-  --gateway, -g <url>     IPFS gateway URL
-  --no-pin                Don't pin to pinning service
-  --no-validate           Skip validation
-  --verbose, -v           Verbose output
-  --help, -h              Show this help
-
-Examples:
-  npx ts-node deploy-seraphine.ts --output ./seraphine-genesis.cfp.json
-  npx ts-node deploy-seraphine.ts --to-ipfs --anonymize strict
-  npx ts-node deploy-seraphine.ts --to-ipfs --gateway https://dweb.link
+    console.log(`
+Seraphine Genesis Deployer
+==========================
+
+Deploy the foundational Claude Flow pattern model.
+
+Usage:
+  npx ts-node deploy-seraphine.ts [options]
+
+Options:
+  --output, -o <path>     Output file path
+  --to-ipfs, --ipfs       Upload to IPFS
+  --anonymize, -a <level> Anonymization level (minimal|standard|strict|paranoid)
+  --gateway, -g <url>     IPFS gateway URL
+  --no-pin                Don't pin to pinning service
+  --no-validate           Skip validation
+  --verbose, -v           Verbose output
+  --help, -h              Show this help
+
+Examples:
+  npx ts-node deploy-seraphine.ts --output ./seraphine-genesis.cfp.json
+  npx ts-node deploy-seraphine.ts --to-ipfs --anonymize strict
+  npx ts-node deploy-seraphine.ts --to-ipfs --gateway https://dweb.link
 `);
 }
 /**