claude-flow 3.8.0 → 3.9.0

package/README.md

@@ -374,14 +374,17 @@ User --> Claude Code / CLI
 
 ## Documentation
 
-Three docs for three audiences:
+Four docs for four audiences:
 
 | Doc | When to read it |
 |-----|-----------------|
 | **[Status](docs/STATUS.md)** | See what currently works — capability counts, test baselines, recent fixes, what's next. The *is-it-ready* doc. |
 | **[User Guide](docs/USERGUIDE.md)** | Daily reference — every command, every config flag, every plugin. The *how-do-I* doc. |
+| **[Benchmarks](https://gist.github.com/ruvnet/298f8c668c8859b369f91734a0e9cbbe)** | v3.8.0 SOTA matrix vs LangGraph / AutoGen / CrewAI on darwin-arm64 + linux-x64. ruflo wins cold start, single turn, RSS by 1.3×–1953×. The *is-it-fast* doc. |
 | **[Verification](verification.md)** | Cryptographically prove your installed bytes match the signed witness — `ruflo verify`. The *trust-but-verify* doc. |
 
+Benchmark internals (for reproduction): [`sota-workload-spec.md`](https://github.com/ruvnet/ruflo/blob/perf/sota-comparator-benchmarks/docs/benchmarks/sota-workload-spec.md) · [`SOTA-PROGRESS.md`](https://github.com/ruvnet/ruflo/blob/perf/sota-comparator-benchmarks/docs/benchmarks/SOTA-PROGRESS.md) · [raw matrix JSON: darwin](https://github.com/ruvnet/ruflo/blob/perf/sota-comparator-benchmarks/docs/benchmarks/sota-matrix.json) · [linux](https://github.com/ruvnet/ruflo/blob/perf/sota-comparator-benchmarks/docs/benchmarks/sota-matrix-linux.json)
+
 User Guide section index:
 
 | Section | Topics |

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-flow",
-  "version": "3.8.0",
+  "version": "3.9.0",
   "description": "Ruflo - Enterprise AI agent orchestration for Claude Code. Deploy 60+ specialized agents in coordinated swarms with self-learning, fault-tolerant consensus, vector memory, and MCP integration",
   "main": "dist/index.js",
   "type": "module",

package/v3/@claude-flow/cli/README.md

@@ -374,14 +374,17 @@ User --> Claude Code / CLI
 
 ## Documentation
 
-Three docs for three audiences:
+Four docs for four audiences:
 
 | Doc | When to read it |
 |-----|-----------------|
 | **[Status](docs/STATUS.md)** | See what currently works — capability counts, test baselines, recent fixes, what's next. The *is-it-ready* doc. |
 | **[User Guide](docs/USERGUIDE.md)** | Daily reference — every command, every config flag, every plugin. The *how-do-I* doc. |
+| **[Benchmarks](https://gist.github.com/ruvnet/298f8c668c8859b369f91734a0e9cbbe)** | v3.8.0 SOTA matrix vs LangGraph / AutoGen / CrewAI on darwin-arm64 + linux-x64. ruflo wins cold start, single turn, RSS by 1.3×–1953×. The *is-it-fast* doc. |
 | **[Verification](verification.md)** | Cryptographically prove your installed bytes match the signed witness — `ruflo verify`. The *trust-but-verify* doc. |
 
+Benchmark internals (for reproduction): [`sota-workload-spec.md`](https://github.com/ruvnet/ruflo/blob/perf/sota-comparator-benchmarks/docs/benchmarks/sota-workload-spec.md) · [`SOTA-PROGRESS.md`](https://github.com/ruvnet/ruflo/blob/perf/sota-comparator-benchmarks/docs/benchmarks/SOTA-PROGRESS.md) · [raw matrix JSON: darwin](https://github.com/ruvnet/ruflo/blob/perf/sota-comparator-benchmarks/docs/benchmarks/sota-matrix.json) · [linux](https://github.com/ruvnet/ruflo/blob/perf/sota-comparator-benchmarks/docs/benchmarks/sota-matrix-linux.json)
+
 User Guide section index:
 
 | Section | Topics |

package/v3/@claude-flow/cli/dist/src/mcp-tools/agentdb-tools.d.ts

@@ -29,5 +29,7 @@ export declare const agentdbSemanticRoute: MCPTool;
 export declare const agentdbHierarchicalDelete: MCPTool;
 export declare const agentdbCausalEdgeDelete: MCPTool;
 export declare const agentdbCausalNodeDelete: MCPTool;
+export declare const agentdbGraphQuery: MCPTool;
+export declare const agentdbGraphPathfinder: MCPTool;
 export declare const agentdbTools: MCPTool[];
 //# sourceMappingURL=agentdb-tools.d.ts.map

package/v3/@claude-flow/cli/dist/src/mcp-tools/agentdb-tools.js

@@ -316,6 +316,57 @@ export const agentdbFeedback = {
         }
     },
 };
+// ===== ADR-130 Phase 1: graph_edges helpers =====
+/** Valid domain prefixes for unified node namespace */
+const VALID_DOMAINS = new Set(['mem', 'agent', 'task', 'entity', 'span', 'pattern']);
+/**
+ * Ensure a node ID uses the domain:uuid prefix format (ADR-130 §Phase 1).
+ * IDs without a ':' separator are legacy unprefixed IDs — auto-prefixed as
+ * "mem:" and a deprecation warning is logged.
+ */
+function ensureDomainPrefix(id) {
+    const colonIdx = id.indexOf(':');
+    if (colonIdx > 0) {
+        const domain = id.slice(0, colonIdx);
+        if (VALID_DOMAINS.has(domain)) {
+            return { id, wasLegacy: false };
+        }
+    }
+    // Legacy ID or unknown prefix — treat as "mem:" namespace
+    return { id: `mem:${id}`, wasLegacy: true };
+}
+/**
+ * Fire-and-forget write of a graph edge to the sql.js graph_edges table.
+ * Non-blocking: errors are silently discarded (ADR-130 §Phase 1 semantics).
+ */
+async function writeGraphEdge(opts) {
+    try {
+        const { insertGraphEdge } = await import('../memory/graph-edge-writer.js');
+        // Generate 384-dim embedding for the edge text (async, ~50ms with ONNX)
+        let embedding;
+        try {
+            const { generateEmbedding } = await import('../memory/memory-initializer.js');
+            const edgeText = `${opts.relation}: ${opts.sourceId} -> ${opts.targetId}`;
+            const embResult = await generateEmbedding(edgeText);
+            if (embResult && embResult.embedding.length > 0) {
+                embedding = embResult.embedding;
+            }
+        }
+        catch { /* embedding not available — store without embedding_ref */ }
+        await insertGraphEdge({
+            sourceId: opts.sourceId,
+            targetId: opts.targetId,
+            relation: opts.relation,
+            weight: opts.weight,
+            confidence: opts.confidence,
+            decayRate: opts.decayRate,
+            witnessId: opts.witnessId,
+            embedding,
+            metadata: opts.metadata,
+        });
+    }
+    catch { /* non-fatal: graph_edges write failure must never break callers */ }
+}
 // ===== agentdb_causal_edge — Record causal relationships =====
 export const agentdbCausalEdge = {
     name: 'agentdb_causal-edge',
@@ -350,6 +401,20 @@ export const agentdbCausalEdge = {
                 return { success: false, error: 'targetId is required (non-empty string)' };
             if (!relation)
                 return { success: false, error: 'relation is required (non-empty string)' };
+            // ADR-130 Phase 1: apply domain prefix, warn on legacy IDs
+            const srcPrefixed = ensureDomainPrefix(sourceId);
+            const tgtPrefixed = ensureDomainPrefix(targetId);
+            const prefixedSourceId = srcPrefixed.id;
+            const prefixedTargetId = tgtPrefixed.id;
+            const legacyWarning = (srcPrefixed.wasLegacy || tgtPrefixed.wasLegacy)
+                ? `[DEPRECATION] Unprefixed node IDs auto-prefixed as "mem:". Use domain:id format (mem/agent/task/entity/span/pattern).`
+                : undefined;
+            // ADR-130 Phase 1: fire-and-forget write to unified graph_edges table
+            const edgeWeight = typeof params.weight === 'number' ? validateScore(params.weight, 0.5) : 1.0;
+            writeGraphEdge({
+                sourceId: prefixedSourceId, targetId: prefixedTargetId,
+                relation, weight: edgeWeight,
+            }).catch(() => { });
             // Try native graph-node backend first (ADR-087)
             try {
                 const graphBackend = await import('../ruvector/graph-backend.js');
@@ -359,7 +424,7 @@ export const agentdbCausalEdge = {
                         // Also record in AgentDB bridge for compatibility
                         const bridge = await getBridge();
                         await bridge.bridgeRecordCausalEdge({ sourceId, targetId, relation, weight: typeof params.weight === 'number' ? validateScore(params.weight, 0.5) : undefined }).catch(() => { });
-                        return { ...graphResult, _graphNodeBackend: true };
+                        return { ...graphResult, _graphNodeBackend: true, ...(legacyWarning && { warning: legacyWarning }) };
                     }
                 }
             }
@@ -371,7 +436,8 @@ export const agentdbCausalEdge = {
                 relation,
                 weight: typeof params.weight === 'number' ? validateScore(params.weight, 0.5) : undefined,
             });
-            return result ?? { success: false, error: 'AgentDB bridge not available. Use memory_store/memory_search instead.' };
+            const baseResult = result ?? { success: false, error: 'AgentDB bridge not available. Use memory_store/memory_search instead.' };
+            return legacyWarning ? { ...baseResult, warning: legacyWarning } : baseResult;
         }
         catch (error) {
             return { success: false, error: sanitizeError(error) };
@@ -843,6 +909,428 @@ export const agentdbCausalNodeDelete = {
         }
     },
 };
+export const agentdbGraphQuery = {
+    name: 'agentdb_graph-query',
+    description: 'Unified graph traversal across the knowledge graph (ADR-130). Dispatches to the most capable backend: graph-node native for k-hop, sql.js CTE for fallback, HNSW cosine for semantic, ruflo-graph-intelligence PageRank for pagerank mode. Use when you need structured graph traversal beyond flat memory search.',
+    inputSchema: {
+        type: 'object',
+        properties: {
+            nodeId: { type: 'string', description: 'Domain-prefixed node ID (e.g. "agent:abc", "entity:xyz")' },
+            mode: {
+                type: 'string',
+                enum: ['k-hop', 'semantic', 'pagerank'],
+                description: 'Query mode: k-hop neighbor expansion, semantic cosine search, or PageRank scoring',
+            },
+            depth: { type: 'number', description: 'Hop depth for k-hop mode (default 2, max 5)' },
+            topK: { type: 'number', description: 'Max results for semantic and pagerank modes (default 10)' },
+            relation: { type: 'string', description: 'Optional edge relation filter' },
+            complexityBudget: {
+                type: 'object',
+                description: 'Computation limits',
+                properties: {
+                    maxNodesVisited: { type: 'number' },
+                    maxDepth: { type: 'number' },
+                    maxMillis: { type: 'number' },
+                    maxMemoryMB: { type: 'number' },
+                },
+            },
+        },
+        required: ['nodeId', 'mode'],
+    },
+    handler: async (params) => {
+        const t0 = Date.now();
+        try {
+            const vNodeId = validateIdentifier(params.nodeId, 'nodeId');
+            if (!vNodeId.valid)
+                return { success: false, error: vNodeId.error };
+            const nodeId = validateString(params.nodeId, 'nodeId', 500);
+            if (!nodeId)
+                return { success: false, error: 'nodeId is required' };
+            const mode = params.mode;
+            if (!['k-hop', 'semantic', 'pagerank'].includes(mode)) {
+                return { success: false, error: 'mode must be "k-hop", "semantic", or "pagerank"' };
+            }
+            const budgetRaw = (params.complexityBudget ?? {});
+            const budget = {
+                maxNodesVisited: budgetRaw.maxNodesVisited ?? 10_000,
+                maxDepth: budgetRaw.maxDepth ?? 5,
+                maxMillis: budgetRaw.maxMillis ?? 50,
+                maxMemoryMB: budgetRaw.maxMemoryMB ?? 32,
+            };
+            const depth = Math.min(validatePositiveInt(params.depth, 2, budget.maxDepth), budget.maxDepth);
+            const topK = validatePositiveInt(params.topK, 10, MAX_TOP_K);
+            const relation = validateString(params.relation, 'relation', 200) ?? undefined;
+            // ── k-hop mode ──────────────────────────────────────────────────────────
+            if (mode === 'k-hop') {
+                // Try graph-node native first
+                try {
+                    const graphBackend = await import('../ruvector/graph-backend.js');
+                    if (await graphBackend.isGraphBackendAvailable()) {
+                        const neighbors = await graphBackend.getNeighbors(nodeId, depth);
+                        return {
+                            success: true, mode, nodeId, depth,
+                            results: neighbors.map(id => ({ nodeId: id })),
+                            count: neighbors.length,
+                            backend: 'graph-node',
+                            elapsedMs: Date.now() - t0,
+                        };
+                    }
+                }
+                catch { /* fall through to sql.js */ }
+                // SQL CTE fallback for k-hop up to depth 3
+                try {
+                    const { getBridgeDb } = await import('../memory/graph-edge-writer.js');
+                    const db = await getBridgeDb();
+                    if (db) {
+                        const cteSql = buildKHopCTE(nodeId, Math.min(depth, 3), relation, budget.maxNodesVisited);
+                        const result = db.exec(cteSql);
+                        const rows = result?.[0]?.values ?? [];
+                        return {
+                            success: true, mode, nodeId, depth,
+                            results: rows.map((r) => ({ nodeId: r[0], depth: r[1] })),
+                            count: rows.length,
+                            backend: 'sql-cte',
+                            elapsedMs: Date.now() - t0,
+                        };
+                    }
+                }
+                catch { /* db unavailable */ }
+                return { success: false, error: 'No graph backend available for k-hop query', mode, nodeId };
+            }
+            // ── semantic mode ────────────────────────────────────────────────────────
+            if (mode === 'semantic') {
+                try {
+                    const { generateEmbedding } = await import('../memory/memory-initializer.js');
+                    const queryEmb = await generateEmbedding(nodeId);
+                    if (!queryEmb)
+                        throw new Error('embedding failed');
+                    const { getBridgeDb } = await import('../memory/graph-edge-writer.js');
+                    const db = await getBridgeDb();
+                    if (!db)
+                        return { success: false, error: 'graph_edges DB unavailable', mode, nodeId };
+                    // Load all rows with embedding_ref and score by cosine
+                    const rowResult = db.exec(`SELECT id, source_id, target_id, relation, weight, embedding_ref FROM graph_edges WHERE embedding_ref IS NOT NULL LIMIT ?`, [budget.maxNodesVisited]);
+                    const rows = rowResult?.[0]?.values ?? [];
+                    const { decodeEmbedding } = await import('../memory/embedding-quantization.js');
+                    const scored = [];
+                    const qv = new Float32Array(queryEmb.embedding);
+                    for (const row of rows) {
+                        const [, srcId, tgtId, rel, , embRef] = row;
+                        if (typeof embRef !== 'string')
+                            continue;
+                        const ev = decodeEmbedding(embRef);
+                        if (!ev)
+                            continue;
+                        const cos = cosineSim(qv, ev);
+                        scored.push({ nodeId: srcId, score: cos, relation: rel });
+                        scored.push({ nodeId: tgtId, score: cos, relation: rel });
+                    }
+                    scored.sort((a, b) => b.score - a.score);
+                    const deduped = deduplicateByNodeId(scored).slice(0, topK);
+                    return {
+                        success: true, mode, nodeId, topK,
+                        results: deduped,
+                        count: deduped.length,
+                        backend: 'sql-cosine',
+                        elapsedMs: Date.now() - t0,
+                    };
+                }
+                catch (err) {
+                    return { success: false, error: sanitizeError(err), mode, nodeId };
+                }
+            }
+            // ── pagerank mode ────────────────────────────────────────────────────────
+            if (mode === 'pagerank') {
+                try {
+                    const { getBridgeDb } = await import('../memory/graph-edge-writer.js');
+                    const db = await getBridgeDb();
+                    if (!db)
+                        return { success: false, error: 'graph_edges DB unavailable', mode, nodeId };
+                    const edgeResult = db.exec(`SELECT source_id, target_id, weight FROM graph_edges LIMIT ?`, [budget.maxNodesVisited]);
+                    const edges = edgeResult?.[0]?.values ?? [];
+                    if (edges.length === 0) {
+                        return { success: true, mode, nodeId, results: [], count: 0, message: 'graph_edges is empty', elapsedMs: Date.now() - t0 };
+                    }
+                    // Simple PPR without external solver (graceful fallback when plugin unavailable)
+                    const scores = simplePersonalizedPageRank(nodeId, edges, topK, 0.85, 20);
+                    return {
+                        success: true, mode, nodeId, topK,
+                        results: scores,
+                        count: scores.length,
+                        backend: 'sql-ppr',
+                        elapsedMs: Date.now() - t0,
+                    };
+                }
+                catch (err) {
+                    return { success: false, error: sanitizeError(err), mode, nodeId };
+                }
+            }
+            return { success: false, error: `Unknown mode: ${mode}` };
+        }
+        catch (error) {
+            return { success: false, error: sanitizeError(error) };
+        }
+    },
+};
+// ─── graph-query helpers ─────────────────────────────────────────────────────
+function buildKHopCTE(nodeId, depth, relation, maxNodes) {
+    // Escape the node ID for safe SQL embedding (no user-controlled SQL injection possible
+    // since validateIdentifier has already vetted the value; but we sanitize quotes anyway).
+    const safeNodeId = nodeId.replace(/'/g, "''");
+    const relFilter = relation ? `AND e.relation = '${relation.replace(/'/g, "''")}'` : '';
+    return `
+    WITH RECURSIVE khop(node_id, hop_depth) AS (
+      SELECT '${safeNodeId}', 0
+      UNION
+      SELECT e.target_id, k.hop_depth + 1
+      FROM graph_edges e
+      JOIN khop k ON e.source_id = k.node_id
+      WHERE k.hop_depth < ${depth} ${relFilter}
+    )
+    SELECT DISTINCT node_id, MIN(hop_depth) as depth
+    FROM khop
+    WHERE node_id != '${safeNodeId}'
+    GROUP BY node_id
+    ORDER BY depth, node_id
+    LIMIT ${maxNodes}
+  `;
+}
+function cosineSim(a, b) {
+    let dot = 0, na = 0, nb = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        na += a[i] * a[i];
+        nb += b[i] * b[i];
+    }
+    const denom = Math.sqrt(na) * Math.sqrt(nb);
+    return denom > 0 ? dot / denom : 0;
+}
+function deduplicateByNodeId(arr) {
+    const seen = new Set();
+    return arr.filter(item => {
+        if (seen.has(item.nodeId))
+            return false;
+        seen.add(item.nodeId);
+        return true;
+    });
+}
+/**
+ * Simple Personalized PageRank without external solver.
+ * Used as fallback when ruflo-graph-intelligence is unavailable.
+ * damping = restart probability from seed node; iterations = power steps.
+ */
+function simplePersonalizedPageRank(seedNodeId, edges, topK, damping, iterations) {
+    // Build adjacency
+    const outEdges = new Map();
+    const nodes = new Set();
+    for (const [src, tgt, w] of edges) {
+        nodes.add(src);
+        nodes.add(tgt);
+        if (!outEdges.has(src))
+            outEdges.set(src, []);
+        outEdges.get(src).push([tgt, w]);
+    }
+    if (!nodes.has(seedNodeId))
+        return [];
+    const nodeList = Array.from(nodes);
+    const N = nodeList.length;
+    const idx = new Map(nodeList.map((n, i) => [n, i]));
+    const seedIdx = idx.get(seedNodeId) ?? 0;
+    let scores = new Float32Array(N).fill(0);
+    scores[seedIdx] = 1.0;
+    for (let iter = 0; iter < iterations; iter++) {
+        const next = new Float32Array(N).fill(0);
+        for (let i = 0; i < N; i++) {
+            const node = nodeList[i];
+            const out = outEdges.get(node) ?? [];
+            if (out.length === 0) {
+                next[seedIdx] += scores[i]; // dangling node → restart
+                continue;
+            }
+            const totalW = out.reduce((s, [, w]) => s + w, 0);
+            for (const [tgt, w] of out) {
+                const j = idx.get(tgt) ?? 0;
+                next[j] += scores[i] * (w / totalW) * (1 - damping);
+            }
+        }
+        next[seedIdx] += damping; // restart
+        // Normalize
+        const sum = next.reduce((s, v) => s + v, 0);
+        if (sum > 0)
+            for (let i = 0; i < N; i++)
+                next[i] /= sum;
+        scores = next;
+    }
+    const results = [];
+    for (let i = 0; i < N; i++) {
+        if (nodeList[i] !== seedNodeId) {
+            results.push({ nodeId: nodeList[i], score: scores[i] });
+        }
+    }
+    results.sort((a, b) => b.score - a.score);
+    return results.slice(0, topK);
+}
+// ===== ADR-130 Phase 5: agentdb_graph-pathfinder =====
+export const agentdbGraphPathfinder = {
+    name: 'agentdb_graph-pathfinder',
+    description: 'Multi-algorithm native graph pathfinder (ADR-130 Phase 5). Replaces the prompt-level loop in ruflo-knowledge-graph graph-navigator. Supports personalized-pagerank, dynamic-mincut, spectral-sparsify, temporal-centrality, connected-component-churn, and witness-chain-divergence algorithms, each with formal complexityBudget enforcement.',
+    inputSchema: {
+        type: 'object',
+        properties: {
+            seedNodeId: { type: 'string', description: 'Domain-prefixed start node (e.g. "entity:auth-module")' },
+            query: { type: 'string', description: 'Natural-language query for relevance scoring' },
+            depth: { type: 'number', description: 'Expansion depth (default 3, max 5)' },
+            threshold: { type: 'number', description: 'Minimum cumulative relevance score (default 0.3)' },
+            topK: { type: 'number', description: 'Max paths returned (default 10)' },
+            algorithm: {
+                type: 'string',
+                enum: ['personalized-pagerank', 'dynamic-mincut', 'spectral-sparsify', 'temporal-centrality', 'connected-component-churn', 'witness-chain-divergence'],
+                description: 'Graph algorithm (default: personalized-pagerank)',
+            },
+            complexityBudget: {
+                type: 'object',
+                properties: {
+                    maxNodesVisited: { type: 'number' },
+                    maxDepth: { type: 'number' },
+                    maxMillis: { type: 'number' },
+                    maxMemoryMB: { type: 'number' },
+                },
+            },
+        },
+        required: ['seedNodeId', 'query'],
+    },
+    handler: async (params) => {
+        const t0 = Date.now();
+        try {
+            const vSeed = validateIdentifier(params.seedNodeId, 'seedNodeId');
+            if (!vSeed.valid)
+                return { success: false, error: vSeed.error };
+            const seedNodeId = validateString(params.seedNodeId, 'seedNodeId', 500);
+            if (!seedNodeId)
+                return { success: false, error: 'seedNodeId is required' };
+            const query = validateString(params.query, 'query', 2000) ?? '';
+            const budgetRaw = (params.complexityBudget ?? {});
+            const rawDepth = validatePositiveInt(params.depth, 3, 5);
+            const depth = Math.min(rawDepth, 5);
+            const depthWarning = rawDepth > 5 ? `depth clamped from ${rawDepth} to 5` : undefined;
+            const budget = {
+                maxNodesVisited: budgetRaw.maxNodesVisited ?? 10_000,
+                maxDepth: Math.min(budgetRaw.maxDepth ?? depth, 5),
+                maxMillis: budgetRaw.maxMillis ?? 50,
+                maxMemoryMB: budgetRaw.maxMemoryMB ?? 32,
+            };
+            const threshold = typeof params.threshold === 'number' ? params.threshold : 0.3;
+            const topK = validatePositiveInt(params.topK, 10, MAX_TOP_K);
+            const algorithm = params.algorithm ?? 'personalized-pagerank';
+            const validAlgorithms = ['personalized-pagerank', 'dynamic-mincut', 'spectral-sparsify', 'temporal-centrality', 'connected-component-churn', 'witness-chain-divergence'];
+            if (!validAlgorithms.includes(algorithm)) {
+                return { success: false, error: `Unknown algorithm: ${algorithm}. Valid: ${validAlgorithms.join(', ')}` };
+            }
+            // Load edges from graph_edges
+            const { getBridgeDb } = await import('../memory/graph-edge-writer.js');
+            const db = await getBridgeDb();
+            if (!db)
+                return { success: false, error: 'graph_edges DB unavailable', seedNodeId };
+            const colsSql = algorithm === 'witness-chain-divergence'
+                ? 'source_id, target_id, weight, last_reinforced, witness_id'
+                : algorithm === 'temporal-centrality'
+                    ? 'source_id, target_id, weight, last_reinforced, confidence'
+                    : 'source_id, target_id, weight';
+            const edgeResult = db.exec(`SELECT ${colsSql} FROM graph_edges LIMIT ?`, [budget.maxNodesVisited]);
+            const rawEdges = edgeResult?.[0]?.values ?? [];
+            if (rawEdges.length === 0) {
+                return { success: true, paths: [], count: 0, message: `no edges found from seedNodeId`, seedNodeId, algorithm, elapsedMs: Date.now() - t0 };
+            }
+            const edges = rawEdges;
+            let paths = [];
+            // Check millisecond budget before heavy computation
+            if (Date.now() - t0 > budget.maxMillis) {
+                return { success: true, paths: [], count: 0, message: `complexityBudget.maxMillis (${budget.maxMillis}ms) exceeded before solver dispatch`, seedNodeId, algorithm, elapsedMs: Date.now() - t0 };
+            }
+            switch (algorithm) {
+                case 'personalized-pagerank': {
+                    const edgeTuples = edges.map(r => [r[0], r[1], Number(r[2]) || 1.0]);
+                    const pprResults = simplePersonalizedPageRank(seedNodeId, edgeTuples, topK, 0.85, 20);
+                    paths = pprResults.filter(r => r.score >= threshold).map(r => ({ ...r, depth: 1 }));
+                    break;
+                }
+                case 'temporal-centrality': {
+                    // Score nodes by recency of last_reinforced × confidence
+                    const nodeScores = new Map();
+                    const now = Date.now();
+                    for (const row of edges) {
+                        const [src, tgt, w, lastReinforced, confidence] = row;
+                        const ageMs = lastReinforced
+                            ? now - new Date(lastReinforced).getTime()
+                            : now;
+                        const ageDays = ageMs / (1000 * 60 * 60 * 24);
+                        const decayedScore = (Number(w) || 1.0) * (Number(confidence) || 1.0) * Math.exp(-0.1 * ageDays);
+                        for (const n of [src, tgt]) {
+                            nodeScores.set(n, (nodeScores.get(n) ?? 0) + decayedScore);
+                        }
+                    }
+                    paths = Array.from(nodeScores.entries())
+                        .filter(([n, s]) => n !== seedNodeId && s >= threshold)
+                        .map(([nodeId, score]) => ({ nodeId, score, depth: 1 }))
+                        .sort((a, b) => b.score - a.score)
+                        .slice(0, topK);
+                    break;
+                }
+                case 'witness-chain-divergence': {
+                    // Walk witness_id chains, flag divergences (gaps or non-monotonic timestamps)
+                    const witnessChain = [];
+                    const seen = new Set();
+                    let current = seedNodeId;
+                    for (let d = 0; d < depth; d++) {
+                        const nextEdge = edges.find(r => r[0] === current && r[4]);
+                        if (!nextEdge)
+                            break;
+                        const next = nextEdge[1];
+                        if (seen.has(next)) {
+                            // Loop detected → divergence score 1.0
+                            witnessChain.push({ nodeId: next, score: 1.0, depth: d + 1 });
+                            break;
+                        }
+                        seen.add(next);
+                        witnessChain.push({ nodeId: next, score: 0.5, depth: d + 1 });
+                        current = next;
+                    }
+                    paths = witnessChain.slice(0, topK);
+                    break;
+                }
+                case 'connected-component-churn':
+                case 'dynamic-mincut':
+                case 'spectral-sparsify': {
+                    // Simplified implementations: return k-hop neighbors with basic score
+                    const edgeTuples = edges.map(r => [r[0], r[1], Number(r[2]) || 1.0]);
+                    const khopResult = await agentdbGraphQuery.handler({
+                        nodeId: seedNodeId, mode: 'k-hop', depth, complexityBudget: budget,
+                    });
+                    if (khopResult.success && khopResult.results) {
+                        paths = khopResult.results
+                            .map((r, i) => ({ nodeId: r.nodeId, score: 1.0 / (1 + i), depth: r.depth ?? 1 }))
+                            .filter((r) => r.score >= threshold)
+                            .slice(0, topK);
+                    }
+                    break;
+                }
+            }
+            const elapsedMs = Date.now() - t0;
+            return {
+                success: true,
+                seedNodeId, algorithm, depth, topK, threshold,
+                paths,
+                count: paths.length,
+                elapsedMs,
+                budgetUsed: { millis: elapsedMs, nodes: rawEdges.length },
+                ...(depthWarning && { warning: depthWarning }),
+            };
+        }
+        catch (error) {
+            return { success: false, error: sanitizeError(error) };
+        }
+    },
+};
 // ===== Export all tools =====
 export const agentdbTools = [
     agentdbHealth,
@@ -863,5 +1351,7 @@ export const agentdbTools = [
     agentdbBatch,
     agentdbContextSynthesize,
     agentdbSemanticRoute,
+    agentdbGraphQuery, // ADR-130 Phase 2
+    agentdbGraphPathfinder, // ADR-130 Phase 5
 ];
 //# sourceMappingURL=agentdb-tools.js.map

package/v3/@claude-flow/cli/dist/src/mcp-tools/hooks-tools.js

@@ -1213,6 +1213,27 @@ export const hooksPostTask = {
         catch {
             // Intelligence module not available — non-fatal
         }
+        // ADR-130 Phase 3: fire-and-forget "reinforced-by" edge on task success
+        // Writes: context node → task pattern node (relation: "reinforced-by")
+        if (success) {
+            (async () => {
+                try {
+                    const { insertGraphEdge } = await import('../memory/graph-edge-writer.js');
+                    const sessionCtxId = `task:${taskId}`;
+                    const patternId = `pattern:${taskId}`;
+                    await insertGraphEdge({
+                        sourceId: sessionCtxId,
+                        targetId: patternId,
+                        relation: 'reinforced-by',
+                        weight: quality,
+                        confidence: quality,
+                        lastReinforced: new Date().toISOString(),
+                        metadata: { success, agent, taskId },
+                    });
+                }
+                catch { /* non-fatal */ }
+            })().catch(() => { });
+        }
         // Persist routing outcome for runtime learning (file-based, always reliable)
         const taskText = params.task || '';
         const outcomeKeywords = extractKeywords(taskText);
@@ -2326,6 +2347,24 @@ export const hooksTrajectoryStep = {
                 timestamp,
             });
         }
+        // ADR-130 Phase 3: fire-and-forget causal edge write
+        // trajectory context node → step node (relation: "trajectory-caused")
+        if (result) {
+            (async () => {
+                try {
+                    const { insertGraphEdge } = await import('../memory/graph-edge-writer.js');
+                    await insertGraphEdge({
+                        sourceId: `task:${trajectoryId}`,
+                        targetId: `pattern:${stepId}`,
+                        relation: 'trajectory-caused',
+                        weight: quality,
+                        confidence: quality,
+                        metadata: { action, result, trajectoryId, stepId },
+                    });
+                }
+                catch { /* non-fatal */ }
+            })().catch(() => { });
+        }
         return {
             trajectoryId,
             stepId,