claude-flow 3.41.4 → 3.42.0

package/v3/@claude-flow/cli/dist/src/services/policy-runtime.js

@@ -1,4 +1,4 @@
-import { AgenticPolicyEngine, createLegacyCompatibleState, } from '@claude-flow/security';
+import { AgenticPolicyEngine, createLegacyCompatibleState, isMcpCallerAuthEnabled, decodeTokenEnvelope, publicKeyFromHex, verifyInvocationToken, } from '@claude-flow/security';
 import { createHash, createHmac, randomBytes, randomUUID, timingSafeEqual } from 'node:crypto';
 import { execFileSync } from 'node:child_process';
 import { closeSync, existsSync, mkdirSync, openSync, readFileSync, realpathSync, renameSync, statSync, unlinkSync, writeFileSync, } from 'node:fs';
@@ -257,6 +257,67 @@ export async function revokePolicyApproval(id, projectRoot = process.cwd()) {
 export async function verifyPolicyLedger(projectRoot = process.cwd()) {
     return withPolicyTransaction(projectRoot, (engine) => engine.verifyLedger());
 }
+/**
+ * Resolve the caller identity for `authorizeMcpTool`.
+ *
+ * ADR-377 Phase 3 (dream-cycle candidate, 2026-08-26) — off by default. By
+ * default (`isMcpCallerAuthEnabled()` false), this reproduces the exact
+ * pre-existing two-line behavior: the plain, unsigned `CLAUDE_FLOW_PRINCIPAL_ID`
+ * env var is trusted outright. That is the byte-identical-when-disabled
+ * requirement for this candidate — nothing about this branch's shape or
+ * output changes when the flag is off.
+ *
+ * When the flag is on, `CLAUDE_FLOW_PRINCIPAL_ID` alone is no longer
+ * sufficient — any process can set an arbitrary env var with zero proof.
+ * Instead this requires (and verifies) an Ed25519-signed `InvocationToken`
+ * that only a private-key holder (the DualModeOrchestrator that spawned this
+ * worker) could have minted, per `mcp-caller-identity.ts`. Missing, corrupt,
+ * forged, or expired tokens fail closed — this function throws rather than
+ * falling back to the unverified env var, matching the existing fail-closed
+ * pattern already used above in this function (`invalid-worker-capability-envelope`,
+ * `authoritative-worker-policy-root-unavailable`).
+ *
+ * Scope trade-off (deliberate — see mcp-caller-identity.ts's file header and
+ * orchestrator.ts's `workerEnvironment` for the fuller rationale): the token
+ * is minted once per worker spawn with a worker-lifetime TTL and a wildcard
+ * `toolName: '*'`, not the single-tool, 30s-TTL shape `InvocationToken` was
+ * originally designed for — so `opts.toolName` is deliberately not passed to
+ * `verifyInvocationToken` here, and the tool-mismatch check is not exercised
+ * for this use case. What this retains: a process that never received the
+ * signed token cannot forge one, so it cannot impersonate `agent:<workerId>`.
+ * What it does NOT retain: a compromised worker process can still use its
+ * own valid token for every MCP call for the rest of its lifetime — the
+ * token does not limit blast radius to a single call.
+ */
+function resolveMcpCallerIdentity() {
+    if (!isMcpCallerAuthEnabled()) {
+        return {
+            id: process.env.CLAUDE_FLOW_PRINCIPAL_ID ?? 'legacy-cli',
+            type: process.env.CLAUDE_FLOW_PRINCIPAL_ID ? 'agent' : 'legacy',
+        };
+    }
+    const encodedToken = process.env.CLAUDE_FLOW_MCP_INVOCATION_TOKEN;
+    const publicKeyHex = process.env.CLAUDE_FLOW_MCP_CALLER_PUBKEY;
+    if (!encodedToken || !publicKeyHex) {
+        throw new Error('mcp-caller-auth-enabled-but-no-token');
+    }
+    const token = decodeTokenEnvelope(encodedToken);
+    if (!token) {
+        throw new Error('mcp-caller-auth-enabled-but-no-token');
+    }
+    let publicKey;
+    try {
+        publicKey = publicKeyFromHex(publicKeyHex);
+    }
+    catch {
+        throw new Error('mcp-caller-auth-enabled-but-no-token');
+    }
+    const result = verifyInvocationToken(token, publicKey, {});
+    if (!result.valid) {
+        throw new Error(`mcp-caller-auth-verification-failed:${result.reason}`);
+    }
+    return { id: token.callerId, type: 'agent' };
+}
 export async function authorizeMcpTool(toolName, input, context = {}, attributes = {}) {
     let projectRoot = typeof context.projectRoot === 'string' ? context.projectRoot : process.cwd();
     let processEnvelope;
@@ -284,10 +345,7 @@ export async function authorizeMcpTool(toolName, input, context = {}, attributes
         }
     }
     return evaluatePolicyRequest({
-        identity: {
-            id: process.env.CLAUDE_FLOW_PRINCIPAL_ID ?? 'legacy-cli',
-            type: process.env.CLAUDE_FLOW_PRINCIPAL_ID ? 'agent' : 'legacy',
-        },
+        identity: resolveMcpCallerIdentity(),
         action: {
             type: attributes.actionType ?? 'mcp.tool.call',
             resource: toolName,

package/v3/@claude-flow/cli/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@claude-flow/cli",
-  "version": "3.41.4",
+  "version": "3.42.0",
   "type": "module",
   "description": "Ruflo CLI - Enterprise AI agent orchestration with 60+ specialized agents, swarm coordination, MCP server, self-learning hooks, and vector memory for Claude Code",
   "main": "dist/src/index.js",

package/v3/@claude-flow/cli/dist/src/ruvector/diskann-backend.d.ts

@@ -1,78 +0,0 @@
-/**
- * DiskANN Vector Search Backend
- *
- * SSD-friendly approximate nearest neighbor search using Vamana graph.
- * Falls back gracefully to HNSW (@ruvector/router VectorDb) or
- * pure-JS cosine similarity when DiskANN is unavailable.
- *
- * @module v3/cli/ruvector/diskann-backend
- */
-export interface DiskAnnConfig {
-    dim: number;
-    maxDegree?: number;
-    buildBeam?: number;
-    searchBeam?: number;
-    alpha?: number;
-    pqSubspaces?: number;
-    storagePath?: string;
-}
-export interface SearchResult {
-    id: string;
-    distance: number;
-    score: number;
-}
-export type VectorBackend = 'diskann' | 'hnsw' | 'cosine-js';
-/**
- * Check if @ruvector/diskann is available
- */
-export declare function isDiskAnnAvailable(): Promise<boolean>;
-/**
- * Create or get a DiskANN index instance
- */
-export declare function getDiskAnnIndex(config: DiskAnnConfig): Promise<{
-    index: any;
-    backend: VectorBackend;
-}>;
-/**
- * Get the active backend name
- */
-export declare function getActiveBackend(): VectorBackend;
-/**
- * Reset the index (for testing)
- */
-export declare function resetIndex(): void;
-/**
- * Insert a vector into the active backend
- */
-export declare function insertVector(id: string, vector: Float32Array, config?: DiskAnnConfig): Promise<{
-    backend: VectorBackend;
-}>;
-/**
- * Build the index (required for DiskANN before search)
- */
-export declare function buildIndex(config?: DiskAnnConfig): Promise<void>;
-/**
- * Search for k nearest neighbors
- */
-export declare function searchVectors(query: Float32Array, k: number, config?: DiskAnnConfig): Promise<SearchResult[]>;
-export interface BenchmarkResult {
-    backend: VectorBackend;
-    dim: number;
-    vectorCount: number;
-    insertTimeMs: number;
-    buildTimeMs: number;
-    searchTimeMs: number;
-    searchesPerSecond: number;
-    recall: number;
-    memoryMB: number;
-}
-/**
- * Run a benchmark comparing available backends
- */
-export declare function benchmark(opts?: {
-    dim?: number;
-    vectorCount?: number;
-    k?: number;
-    queries?: number;
-}): Promise<BenchmarkResult[]>;
-//# sourceMappingURL=diskann-backend.d.ts.map

package/v3/@claude-flow/cli/dist/src/ruvector/diskann-backend.js

@@ -1,310 +0,0 @@
-/**
- * DiskANN Vector Search Backend
- *
- * SSD-friendly approximate nearest neighbor search using Vamana graph.
- * Falls back gracefully to HNSW (@ruvector/router VectorDb) or
- * pure-JS cosine similarity when DiskANN is unavailable.
- *
- * @module v3/cli/ruvector/diskann-backend
- */
-// ===== Lazy loading =====
-let diskannInstance = null;
-let diskannAvailable = null;
-let activeBackend = 'cosine-js';
-/**
- * Check if @ruvector/diskann is available
- */
-export async function isDiskAnnAvailable() {
-    if (diskannAvailable !== null)
-        return diskannAvailable;
-    try {
-        const { createRequire } = await import('module');
-        const require2 = createRequire(import.meta.url);
-        const mod = require2('@ruvector/diskann');
-        diskannAvailable = typeof mod.DiskAnn === 'function';
-        return diskannAvailable;
-    }
-    catch {
-        diskannAvailable = false;
-        return false;
-    }
-}
-/**
- * Create or get a DiskANN index instance
- */
-export async function getDiskAnnIndex(config) {
-    if (diskannInstance)
-        return { index: diskannInstance, backend: activeBackend };
-    // Try DiskANN first
-    if (await isDiskAnnAvailable()) {
-        try {
-            const { createRequire } = await import('module');
-            const require2 = createRequire(import.meta.url);
-            const { DiskAnn } = require2('@ruvector/diskann');
-            const index = new DiskAnn({
-                dim: config.dim,
-                maxDegree: config.maxDegree ?? 64,
-                buildBeam: config.buildBeam ?? 128,
-                searchBeam: config.searchBeam ?? 64,
-                alpha: config.alpha ?? 1.2,
-                pqSubspaces: config.pqSubspaces ?? 0,
-                storagePath: config.storagePath,
-            });
-            diskannInstance = index;
-            activeBackend = 'diskann';
-            return { index, backend: 'diskann' };
-        }
-        catch {
-            // Fall through
-        }
-    }
-    // Try HNSW (@ruvector/router VectorDb) as fallback
-    try {
-        const { createRequire } = await import('module');
-        const require2 = createRequire(import.meta.url);
-        const router = require2('@ruvector/router');
-        if (router.VectorDb && router.DistanceMetric) {
-            const index = new router.VectorDb({
-                dimensions: config.dim,
-                distanceMetric: router.DistanceMetric.Cosine,
-                hnswM: 16,
-                hnswEfConstruction: 200,
-                hnswEfSearch: 100,
-            });
-            diskannInstance = index;
-            activeBackend = 'hnsw';
-            return { index, backend: 'hnsw' };
-        }
-    }
-    catch {
-        // Fall through
-    }
-    // Pure JS fallback
-    const jsIndex = createJsFallbackIndex(config.dim);
-    diskannInstance = jsIndex;
-    activeBackend = 'cosine-js';
-    return { index: jsIndex, backend: 'cosine-js' };
-}
-/**
- * Get the active backend name
- */
-export function getActiveBackend() {
-    return activeBackend;
-}
-/**
- * Reset the index (for testing)
- */
-export function resetIndex() {
-    diskannInstance = null;
-    diskannAvailable = null;
-    activeBackend = 'cosine-js';
-}
-// ===== Unified search interface =====
-/**
- * Insert a vector into the active backend
- */
-export async function insertVector(id, vector, config = { dim: 384 }) {
-    const { index, backend } = await getDiskAnnIndex(config);
-    if (backend === 'diskann') {
-        index.insert(id, vector);
-    }
-    else if (backend === 'hnsw') {
-        index.insert(id, vector);
-    }
-    else {
-        index.insert(id, vector);
-    }
-    return { backend };
-}
-/**
- * Build the index (required for DiskANN before search)
- */
-export async function buildIndex(config = { dim: 384 }) {
-    const { index, backend } = await getDiskAnnIndex(config);
-    if (backend === 'diskann' && typeof index.build === 'function') {
-        index.build();
-    }
-    // HNSW and JS fallback don't need explicit build
-}
-/**
- * Search for k nearest neighbors
- */
-export async function searchVectors(query, k, config = { dim: 384 }) {
-    const { index, backend } = await getDiskAnnIndex(config);
-    if (backend === 'diskann') {
-        const results = index.search(query, k);
-        return results.map((r) => ({
-            id: r.id,
-            distance: r.distance,
-            score: 1 / (1 + r.distance), // Convert L2 distance to similarity
-        }));
-    }
-    if (backend === 'hnsw') {
-        const results = index.search(query, k);
-        return results.map((r) => ({
-            id: r.id,
-            distance: r.score, // VectorDb returns distance as 'score'
-            score: 1 / (1 + r.score),
-        }));
-    }
-    // JS fallback
-    return index.search(query, k);
-}
-// ===== Pure JS fallback =====
-function createJsFallbackIndex(dim) {
-    const vectors = new Map();
-    return {
-        insert(id, vector) {
-            vectors.set(id, new Float32Array(vector));
-        },
-        search(query, k) {
-            const results = [];
-            for (const [id, vec] of vectors) {
-                let dot = 0, normQ = 0, normV = 0;
-                for (let i = 0; i < dim; i++) {
-                    dot += query[i] * vec[i];
-                    normQ += query[i] * query[i];
-                    normV += vec[i] * vec[i];
-                }
-                const cosine = dot / (Math.sqrt(normQ) * Math.sqrt(normV) || 1);
-                const distance = 1 - cosine;
-                results.push({ id, distance, score: cosine });
-            }
-            return results.sort((a, b) => a.distance - b.distance).slice(0, k);
-        },
-        count() { return vectors.size; },
-        delete(id) { return vectors.delete(id); },
-        build() { },
-    };
-}
-/**
- * Run a benchmark comparing available backends
- */
-export async function benchmark(opts = {}) {
-    const dim = opts.dim ?? 384;
-    const n = opts.vectorCount ?? 1000;
-    const k = opts.k ?? 10;
-    const queryCount = opts.queries ?? 100;
-    const results = [];
-    // Generate random vectors
-    const vectors = [];
-    for (let i = 0; i < n; i++) {
-        const v = new Float32Array(dim);
-        for (let j = 0; j < dim; j++)
-            v[j] = Math.random() * 2 - 1;
-        // Normalize
-        let norm = 0;
-        for (let j = 0; j < dim; j++)
-            norm += v[j] * v[j];
-        norm = Math.sqrt(norm);
-        for (let j = 0; j < dim; j++)
-            v[j] /= norm;
-        vectors.push([`vec-${i}`, v]);
-    }
-    // Generate query vectors
-    const queries = [];
-    for (let i = 0; i < queryCount; i++) {
-        const q = new Float32Array(dim);
-        for (let j = 0; j < dim; j++)
-            q[j] = Math.random() * 2 - 1;
-        let norm = 0;
-        for (let j = 0; j < dim; j++)
-            norm += q[j] * q[j];
-        norm = Math.sqrt(norm);
-        for (let j = 0; j < dim; j++)
-            q[j] /= norm;
-        queries.push(q);
-    }
-    // Brute force ground truth
-    function bruteForceSearch(query) {
-        const scores = [];
-        for (const [id, vec] of vectors) {
-            let dist = 0;
-            for (let j = 0; j < dim; j++) {
-                const d = query[j] - vec[j];
-                dist += d * d;
-            }
-            scores.push({ id, dist });
-        }
-        scores.sort((a, b) => a.dist - b.dist);
-        return scores.slice(0, k).map(s => s.id);
-    }
-    const groundTruth = queries.map(q => bruteForceSearch(q));
-    // Test each available backend
-    for (const backendName of ['diskann', 'hnsw', 'cosine-js']) {
-        resetIndex();
-        try {
-            let index;
-            const memBefore = process.memoryUsage().heapUsed;
-            if (backendName === 'diskann') {
-                if (!(await isDiskAnnAvailable()))
-                    continue;
-                const { createRequire } = await import('module');
-                const require2 = createRequire(import.meta.url);
-                const { DiskAnn } = require2('@ruvector/diskann');
-                index = new DiskAnn({ dim, maxDegree: 64, buildBeam: 128, searchBeam: 64 });
-            }
-            else if (backendName === 'hnsw') {
-                try {
-                    const { createRequire } = await import('module');
-                    const require2 = createRequire(import.meta.url);
-                    const router = require2('@ruvector/router');
-                    if (!router.VectorDb)
-                        continue;
-                    index = new router.VectorDb({ dimensions: dim, distanceMetric: router.DistanceMetric.Cosine });
-                }
-                catch {
-                    continue;
-                }
-            }
-            else {
-                index = createJsFallbackIndex(dim);
-            }
-            // Insert
-            const insertStart = performance.now();
-            for (const [id, vec] of vectors) {
-                index.insert(id, vec);
-            }
-            const insertTime = performance.now() - insertStart;
-            // Build
-            const buildStart = performance.now();
-            if (typeof index.build === 'function')
-                index.build();
-            const buildTime = performance.now() - buildStart;
-            // Search
-            const searchStart = performance.now();
-            const searchResults = [];
-            for (const q of queries) {
-                const r = index.search(q, k);
-                searchResults.push(r.map((x) => x.id));
-            }
-            const searchTime = performance.now() - searchStart;
-            // Recall vs ground truth
-            let totalRecall = 0;
-            for (let i = 0; i < queryCount; i++) {
-                const truth = new Set(groundTruth[i]);
-                const found = searchResults[i].filter(id => truth.has(id)).length;
-                totalRecall += found / k;
-            }
-            const recall = totalRecall / queryCount;
-            const memAfter = process.memoryUsage().heapUsed;
-            results.push({
-                backend: backendName,
-                dim,
-                vectorCount: n,
-                insertTimeMs: Math.round(insertTime * 100) / 100,
-                buildTimeMs: Math.round(buildTime * 100) / 100,
-                searchTimeMs: Math.round(searchTime * 100) / 100,
-                searchesPerSecond: Math.round(queryCount / (searchTime / 1000)),
-                recall: Math.round(recall * 1000) / 1000,
-                memoryMB: Math.round((memAfter - memBefore) / 1024 / 1024 * 100) / 100,
-            });
-        }
-        catch {
-            // Backend failed, skip
-        }
-    }
-    resetIndex();
-    return results;
-}
-//# sourceMappingURL=diskann-backend.js.map