claude-flow 3.32.17 → 3.32.19

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-flow",
-  "version": "3.32.17",
+  "version": "3.32.19",
   "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/catalog-manifest.json

@@ -1,8 +1,8 @@
 {
   "schemaVersion": 1,
   "generation": 1,
-  "generatedAt": "2026-07-27T02:44:16.339Z",
-  "gitSha": "a0a4f165",
+  "generatedAt": "2026-07-27T03:04:01.949Z",
+  "gitSha": "7e76906f",
   "catalog": {
     "agents": 164,
     "tools": 387,

package/v3/@claude-flow/cli/dist/src/commands/memory.js

@@ -345,25 +345,62 @@ const searchCommand = {
             type: 'boolean',
             default: false
         },
+        {
+            // #2760 dream-cycle — SCM routed memory. Classify the query intent
+            // and route search to the mapped namespaces (episodic → session
+            // writes, semantic → patterns, procedural → skills). Default
+            // "mixed" preserves the pre-#2760 behavior (search everything).
+            name: 'intent',
+            description: 'Route query to intent-mapped namespaces (auto | mixed | episodic | semantic | procedural) — dream-cycle #2760',
+            type: 'string',
+            choices: ['auto', 'mixed', 'episodic', 'semantic', 'procedural'],
+            default: 'mixed',
+        },
         DB_PATH_OPTION
     ],
     examples: [
         { command: 'claude-flow memory search -q "authentication patterns"', description: 'Semantic search' },
         { command: 'claude-flow memory search -q "JWT" -t keyword', description: 'Keyword search' },
         { command: 'claude-flow memory search -q "test" --build-hnsw', description: 'Build HNSW index and search' },
-        { command: 'claude-flow memory search -q "auth patterns" --smart', description: 'SmartRetrieval with RRF + MMR' }
+        { command: 'claude-flow memory search -q "auth patterns" --smart', description: 'SmartRetrieval with RRF + MMR' },
+        { command: 'claude-flow memory search -q "when did we last touch auth" --intent auto', description: 'SCM-routed retrieval (dream-cycle #2760)' },
     ],
     action: async (ctx) => {
         const query = ctx.flags.query || ctx.args[0];
-        const namespace = ctx.flags.namespace || 'all';
+        let namespace = ctx.flags.namespace || 'all';
         const limit = ctx.flags.limit || 10;
         const threshold = ctx.flags.threshold || 0.3;
         const searchType = ctx.flags.type || 'semantic';
         const buildHnsw = (ctx.flags['build-hnsw'] || ctx.flags.buildHnsw);
+        const requestedIntent = ctx.flags.intent || 'mixed';
         if (!query) {
             output.printError('Query is required. Use --query or -q');
             return { success: false, exitCode: 1 };
         }
+        // #2760 SCM routed memory (v1 MVP) — classify query intent and
+        // print a routing hint. Only fires when --intent is NOT the default
+        // "mixed" AND --namespace was NOT explicitly passed. Intentionally
+        // does NOT mutate the search path — the routing is advisory in v1
+        // so the search backend's exact behavior is preserved. v2 will
+        // apply the routing when the search-backend interface adds a
+        // multi-namespace OR filter.
+        if (requestedIntent !== 'mixed' && (namespace === 'all' || !ctx.flags.namespace)) {
+            try {
+                const { resolveIntent } = await import('../memory/scm-classifier.js');
+                const resolved = resolveIntent(query, requestedIntent);
+                if (resolved.intent !== 'mixed' && resolved.namespaces.length > 0) {
+                    output.printInfo(`SCM router → ${resolved.intent} (confidence ${(resolved.confidence * 100).toFixed(1)}%)`);
+                    output.writeln(output.dim(`  ${resolved.reason}`));
+                    output.writeln(output.dim(`  Suggested: rerun with --namespace ${resolved.namespaces[0]} to filter (or one of: ${resolved.namespaces.slice(1, 4).join(', ')}...)`));
+                }
+                else {
+                    output.writeln(output.dim(`SCM router → mixed (${resolved.reason})`));
+                }
+            }
+            catch (err) {
+                output.writeln(output.dim(`SCM routing skipped: ${err instanceof Error ? err.message : String(err)}`));
+            }
+        }
         // Build/rebuild HNSW index if requested
         if (buildHnsw) {
             output.printInfo('Building HNSW index...');
@@ -1595,11 +1632,106 @@ const initMemoryCommand = {
         }
     }
 };
+// #2763 dream-cycle — OAS memory-operator selector. Standalone
+// subcommand that returns the highest-value consolidation operator
+// that fits the given budget for the given entry count. Advisory —
+// the caller decides whether to invoke that operator.
+const selectOperatorCommand = {
+    name: 'select-operator',
+    description: 'Pick the highest-value consolidation operator that fits a budget (OAS, dream-cycle #2763)',
+    options: [
+        { name: 'budget', short: 'b', type: 'number', required: true, description: 'Budget in abstract operator points (1 point ≈ 1 Haiku call)' },
+        { name: 'entries', short: 'e', type: 'number', required: true, description: 'Number of entries to consolidate' },
+        { name: 'hint', type: 'string', choices: ['duplicates', 'verbose', 'patterns', 'general'], default: 'general', description: 'Entry-shape hint' },
+    ],
+    examples: [
+        { command: 'claude-flow memory select-operator -b 50 -e 200', description: 'Pick operator for 200 entries within 50 points' },
+        { command: 'claude-flow memory select-operator -b 5 -e 100 --hint duplicates --format json', description: 'JSON for pipelines' },
+    ],
+    action: async (ctx) => {
+        const budget = ctx.flags.budget;
+        const entries = ctx.flags.entries;
+        const hint = ctx.flags.hint || 'general';
+        if (budget === undefined || entries === undefined) {
+            output.printError('Both --budget and --entries are required.');
+            return { success: false, exitCode: 1 };
+        }
+        if (budget < 0 || entries < 0) {
+            output.printError('Budget and entries must be non-negative.');
+            return { success: false, exitCode: 1 };
+        }
+        const { selectOperator, OPERATORS } = await import('../memory/oas-operator-selector.js');
+        const selection = selectOperator({ budget, entries, hint: hint });
+        if (ctx.flags.format === 'json') {
+            output.printJson(selection);
+            return { success: true, data: selection };
+        }
+        const chosen = OPERATORS[selection.operator];
+        output.writeln();
+        output.printBox(`Budget: ${budget} points · Entries: ${entries}\n` +
+            `Operator: ${selection.operator}\n` +
+            `Description: ${chosen.description}\n` +
+            `Estimated cost: ${selection.estimatedCost.toFixed(2)} points\n` +
+            `Needs split: ${selection.needsSplit ? `YES — batch size ${selection.suggestedBatchSize}` : 'no'}`, 'OAS Operator Selection (#2763)');
+        output.writeln();
+        output.writeln(output.dim(selection.reason));
+        if (selection.considered.length > 0) {
+            output.writeln();
+            output.writeln(output.bold('All operators considered'));
+            output.printTable({
+                columns: [
+                    { key: 'id', header: 'Operator', width: 15 },
+                    { key: 'cost', header: 'Est. Cost', width: 12, align: 'right', format: (v) => Number(v).toFixed(2) },
+                    { key: 'fits', header: 'Fits Budget', width: 12, align: 'center', format: (v) => v ? '✓' : '—' },
+                ],
+                data: selection.considered,
+            });
+        }
+        return { success: true, data: selection };
+    },
+};
+// #2760 dream-cycle — SCM query classifier. Standalone subcommand so
+// users can inspect what intent a query maps to and pipe the mapped
+// namespaces into other tools (e.g. `memory search --namespace ...`).
+const classifyCommand = {
+    name: 'classify',
+    description: 'Classify a query into episodic/semantic/procedural intent (SCM router, dream-cycle #2760)',
+    options: [
+        { name: 'query', short: 'q', type: 'string', description: 'Query text to classify', required: true },
+        { name: 'intent', type: 'string', choices: ['auto', 'mixed', 'episodic', 'semantic', 'procedural'], default: 'auto', description: 'Force a specific intent (default: auto)' },
+    ],
+    examples: [
+        { command: 'claude-flow memory classify -q "when did we last touch auth"', description: 'Auto-classify (should return episodic)' },
+        { command: 'claude-flow memory classify -q "how does JWT work" --format json', description: 'JSON output for pipelines' },
+    ],
+    action: async (ctx) => {
+        const query = ctx.flags.query;
+        const requested = ctx.flags.intent || 'auto';
+        if (!query) {
+            output.printError('Query is required. Use --query or -q');
+            return { success: false, exitCode: 1 };
+        }
+        const { resolveIntent } = await import('../memory/scm-classifier.js');
+        const resolved = resolveIntent(query, requested);
+        if (ctx.flags.format === 'json') {
+            output.printJson(resolved);
+            return { success: true, data: resolved };
+        }
+        output.writeln();
+        output.printBox(`Query: "${query}"\n` +
+            `Intent: ${resolved.intent}\n` +
+            `Confidence: ${(resolved.confidence * 100).toFixed(1)}%\n` +
+            `Namespaces: ${resolved.namespaces.length > 0 ? resolved.namespaces.slice(0, 4).join(', ') + (resolved.namespaces.length > 4 ? '…' : '') : '(all — mixed retrieval)'}`, 'SCM Classifier (#2760)');
+        output.writeln();
+        output.writeln(output.dim(resolved.reason));
+        return { success: true, data: resolved };
+    },
+};
 // Main memory command
 export const memoryCommand = {
     name: 'memory',
     description: 'Memory management commands',
-    subcommands: [initMemoryCommand, storeCommand, retrieveCommand, searchCommand, listCommand, deleteCommand, purgeCommand, statsCommand, configureCommand, cleanupCommand, compressCommand, exportCommand, importCommand, distillCommand, backupCommand],
+    subcommands: [initMemoryCommand, storeCommand, retrieveCommand, searchCommand, listCommand, deleteCommand, purgeCommand, statsCommand, configureCommand, cleanupCommand, compressCommand, exportCommand, importCommand, distillCommand, backupCommand, classifyCommand, selectOperatorCommand],
     options: [],
     examples: [
         { command: 'claude-flow memory store -k "key" -v "value"', description: 'Store data' },

package/v3/@claude-flow/cli/dist/src/memory/oas-operator-selector.d.ts

@@ -0,0 +1,74 @@
+/**
+ * OAS (Operator-Aware Selection) memory-consolidation operator picker
+ * (#2763 dream-cycle).
+ *
+ * Findings from the OAS paper referenced in dream-cycle #2763: memory-
+ * consolidation performance improves by +48% when the caller picks the
+ * RIGHT operator for the current budget + workload, instead of always
+ * applying the most-expensive one. Ruflo already has multiple
+ * consolidation operators (merge / summarize / compress / distill),
+ * but has no cost-aware selector — every `memory consolidate` call
+ * uses the same path.
+ *
+ * v1 MVP: rule-based selector. Cost-per-entry estimates are informed
+ * by ruflo's own measured performance targets in v3/@claude-flow/cli/
+ * CLAUDE.md — no external benchmark call needed. v2 will refine costs
+ * from routing-outcomes trajectories.
+ */
+/** The four consolidation operators ruflo can apply. */
+export type OperatorId = 'merge' | 'summarize' | 'compress' | 'distill';
+export interface OperatorSpec {
+    id: OperatorId;
+    /** Estimated cost per entry, in abstract "operator points" (1 point ≈ 1 Haiku call). */
+    costPerEntry: number;
+    /** Maximum recommended entry count per invocation (higher counts split). */
+    maxEntries: number;
+    /** What the operator does — human-readable. */
+    description: string;
+    /** Best when the entry set has this shape. */
+    bestWhen: string;
+}
+export declare const OPERATORS: Record<OperatorId, OperatorSpec>;
+export interface OperatorSelection {
+    operator: OperatorId;
+    reason: string;
+    /** Estimated cost = costPerEntry × min(entries, maxEntries). */
+    estimatedCost: number;
+    /** True if entries > operator.maxEntries and caller should split into multiple invocations. */
+    needsSplit: boolean;
+    suggestedBatchSize: number;
+    /** All operators considered, in ranked order (best first). */
+    considered: Array<{
+        id: OperatorId;
+        cost: number;
+        fits: boolean;
+    }>;
+}
+export interface SelectOptions {
+    /** Budget in abstract operator points. */
+    budget: number;
+    /** Number of entries to consolidate. */
+    entries: number;
+    /**
+     * Optional hint about entry shape:
+     *   'duplicates' → strongly prefer merge (cheap wins first)
+     *   'verbose'    → prefer summarize
+     *   'patterns'   → prefer distill (small, high-signal)
+     *   'general'    → let cost-fit decide (default)
+     */
+    hint?: 'duplicates' | 'verbose' | 'patterns' | 'general';
+}
+/**
+ * Select the highest-value operator that fits the budget.
+ *
+ * Selection rule (v1):
+ *   1. If a hint is provided AND the hinted operator fits the budget,
+ *      pick it (hint is a strong signal about entry shape).
+ *   2. Else, rank operators by cost ascending; pick the most expensive
+ *      operator that still fits budget × 1.0 (no over-spend). Idea:
+ *      spend the whole budget on the most-fidelity operator we can afford.
+ *   3. If nothing fits, return merge (guaranteed cheapest) with
+ *      needsSplit=true so caller batches.
+ */
+export declare function selectOperator(opts: SelectOptions): OperatorSelection;
+//# sourceMappingURL=oas-operator-selector.d.ts.map

package/v3/@claude-flow/cli/dist/src/memory/oas-operator-selector.js

@@ -0,0 +1,117 @@
+/**
+ * OAS (Operator-Aware Selection) memory-consolidation operator picker
+ * (#2763 dream-cycle).
+ *
+ * Findings from the OAS paper referenced in dream-cycle #2763: memory-
+ * consolidation performance improves by +48% when the caller picks the
+ * RIGHT operator for the current budget + workload, instead of always
+ * applying the most-expensive one. Ruflo already has multiple
+ * consolidation operators (merge / summarize / compress / distill),
+ * but has no cost-aware selector — every `memory consolidate` call
+ * uses the same path.
+ *
+ * v1 MVP: rule-based selector. Cost-per-entry estimates are informed
+ * by ruflo's own measured performance targets in v3/@claude-flow/cli/
+ * CLAUDE.md — no external benchmark call needed. v2 will refine costs
+ * from routing-outcomes trajectories.
+ */
+export const OPERATORS = {
+    merge: {
+        id: 'merge',
+        costPerEntry: 0.02, // near-free — deterministic near-duplicate merge
+        maxEntries: 5000,
+        description: 'Near-duplicate merge (deterministic, cosine ≥ 0.95)',
+        bestWhen: 'Many near-identical entries (e.g. duplicated command traces)',
+    },
+    summarize: {
+        id: 'summarize',
+        costPerEntry: 0.5, // one Haiku call per ~2 entries
+        maxEntries: 500,
+        description: 'Short-to-long consolidation via Haiku (1 call per ~2 entries)',
+        bestWhen: 'Verbose logs / trajectory steps that share a theme',
+    },
+    compress: {
+        id: 'compress',
+        costPerEntry: 1.5, // LoRA-style compression pass — heavier
+        maxEntries: 200,
+        description: 'LoRA/EWC-style compression preserving semantic embeddings',
+        bestWhen: 'High-fidelity pattern preservation across many entries',
+    },
+    distill: {
+        id: 'distill',
+        costPerEntry: 3, // full distillation — heaviest
+        maxEntries: 100,
+        description: 'Full pattern distillation (extracts high-value patterns for ReasoningBank)',
+        bestWhen: 'Extracting durable learnings from a small high-signal set',
+    },
+};
+/**
+ * Select the highest-value operator that fits the budget.
+ *
+ * Selection rule (v1):
+ *   1. If a hint is provided AND the hinted operator fits the budget,
+ *      pick it (hint is a strong signal about entry shape).
+ *   2. Else, rank operators by cost ascending; pick the most expensive
+ *      operator that still fits budget × 1.0 (no over-spend). Idea:
+ *      spend the whole budget on the most-fidelity operator we can afford.
+ *   3. If nothing fits, return merge (guaranteed cheapest) with
+ *      needsSplit=true so caller batches.
+ */
+export function selectOperator(opts) {
+    const { budget, entries, hint } = opts;
+    const considered = Object.keys(OPERATORS).map((id) => {
+        const spec = OPERATORS[id];
+        const effectiveEntries = Math.min(entries, spec.maxEntries);
+        const cost = spec.costPerEntry * effectiveEntries;
+        return { id, cost, fits: cost <= budget };
+    }).sort((a, b) => a.cost - b.cost);
+    // Rule 1: honor a shape hint if the hinted operator fits.
+    const hintMap = {
+        duplicates: 'merge',
+        verbose: 'summarize',
+        patterns: 'distill',
+        general: 'compress',
+    };
+    if (hint && hint !== 'general') {
+        const preferred = hintMap[hint];
+        const match = considered.find((c) => c.id === preferred);
+        if (match?.fits) {
+            const spec = OPERATORS[match.id];
+            return {
+                operator: match.id,
+                reason: `Hint "${hint}" → ${match.id} (cost ${match.cost.toFixed(2)} ≤ budget ${budget})`,
+                estimatedCost: match.cost,
+                needsSplit: entries > spec.maxEntries,
+                suggestedBatchSize: spec.maxEntries,
+                considered,
+            };
+        }
+    }
+    // Rule 2: pick the most-expensive operator that still fits.
+    const fitting = considered.filter((c) => c.fits);
+    if (fitting.length > 0) {
+        const best = fitting[fitting.length - 1]; // most expensive fitting
+        const spec = OPERATORS[best.id];
+        return {
+            operator: best.id,
+            reason: `Best-fit within budget: ${best.id} at cost ${best.cost.toFixed(2)} (budget ${budget}, entries ${entries})`,
+            estimatedCost: best.cost,
+            needsSplit: entries > spec.maxEntries,
+            suggestedBatchSize: spec.maxEntries,
+            considered,
+        };
+    }
+    // Rule 3: budget too small for any operator on the full entry set.
+    // Split via merge (cheapest) with the merge batch size.
+    const mergeSpec = OPERATORS.merge;
+    const batchSize = Math.max(1, Math.floor(budget / mergeSpec.costPerEntry));
+    return {
+        operator: 'merge',
+        reason: `Budget ${budget} too small for any operator across ${entries} entries — split via merge in batches of ${batchSize}`,
+        estimatedCost: budget,
+        needsSplit: true,
+        suggestedBatchSize: batchSize,
+        considered,
+    };
+}
+//# sourceMappingURL=oas-operator-selector.js.map

package/v3/@claude-flow/cli/dist/src/memory/scm-classifier.d.ts

@@ -0,0 +1,51 @@
+/**
+ * Selective Context Memory (SCM) query-intent classifier (#2760).
+ *
+ * Dream-cycle #2760 (SCM routed memory 86% LongMemEval): agents perform
+ * dramatically better on long-memory retrieval when the query is routed
+ * to the RIGHT memory tier — episodic (session recall) vs semantic
+ * (learned patterns) vs procedural (skills/recipes). Ruflo previously
+ * had all these tiers writing to different namespaces but the search
+ * command didn't discriminate — every query searched everything.
+ *
+ * v1 classifier: keyword-scored intent detection. Ships as a bounded
+ * MVP so users can opt in via `memory search --intent auto|episodic|
+ * semantic|procedural|mixed`. Default remains `mixed` (existing
+ * behavior) so no baseline retrieval is disturbed.
+ *
+ * v2 (future): embedding-based classifier trained on the trajectory
+ * store's actual routing outcomes.
+ */
+export type MemoryIntent = 'episodic' | 'semantic' | 'procedural' | 'mixed';
+export interface ClassifiedIntent {
+    intent: MemoryIntent;
+    confidence: number;
+    /** Per-intent scores for transparency; sums roughly to 1. */
+    scores: Record<Exclude<MemoryIntent, 'mixed'>, number>;
+    /** Namespaces the caller should search for this intent (relative to memory backend). */
+    namespaces: string[];
+    /** Human-readable rationale. */
+    reason: string;
+}
+/**
+ * Keyword catalog per intent — case-insensitive substring match.
+ * Order matters for ties: earlier categories win when scores tie.
+ */
+declare const KEYWORDS: Record<Exclude<MemoryIntent, 'mixed'>, readonly string[]>;
+/**
+ * Namespaces owned by each intent. These match ruflo's actual
+ * memory-write conventions:
+ *   episodic  → session/trajectory writes (hooks_post-task, session-checkpoints)
+ *   semantic  → pattern/learning writes (patterns/, learned-*, adr-patterns)
+ *   procedural → skill/workflow writes (skills/, agents/, workflow-templates)
+ * A namespace listed under more than one intent means it's genuinely dual-nature.
+ */
+declare const NAMESPACES: Record<Exclude<MemoryIntent, 'mixed'>, readonly string[]>;
+export declare function classifyQueryIntent(query: string): ClassifiedIntent;
+/**
+ * Given a user-requested intent (which may be `auto`), resolve to a
+ * concrete ClassifiedIntent for the given query.
+ */
+export declare function resolveIntent(query: string, requested?: MemoryIntent | 'auto'): ClassifiedIntent;
+export { KEYWORDS as INTENT_KEYWORDS, NAMESPACES as INTENT_NAMESPACES };
+//# sourceMappingURL=scm-classifier.d.ts.map

package/v3/@claude-flow/cli/dist/src/memory/scm-classifier.js

@@ -0,0 +1,148 @@
+/**
+ * Selective Context Memory (SCM) query-intent classifier (#2760).
+ *
+ * Dream-cycle #2760 (SCM routed memory 86% LongMemEval): agents perform
+ * dramatically better on long-memory retrieval when the query is routed
+ * to the RIGHT memory tier — episodic (session recall) vs semantic
+ * (learned patterns) vs procedural (skills/recipes). Ruflo previously
+ * had all these tiers writing to different namespaces but the search
+ * command didn't discriminate — every query searched everything.
+ *
+ * v1 classifier: keyword-scored intent detection. Ships as a bounded
+ * MVP so users can opt in via `memory search --intent auto|episodic|
+ * semantic|procedural|mixed`. Default remains `mixed` (existing
+ * behavior) so no baseline retrieval is disturbed.
+ *
+ * v2 (future): embedding-based classifier trained on the trajectory
+ * store's actual routing outcomes.
+ */
+/**
+ * Keyword catalog per intent — case-insensitive substring match.
+ * Order matters for ties: earlier categories win when scores tie.
+ */
+const KEYWORDS = {
+    episodic: [
+        'when', 'last time', 'yesterday', 'today', 'session',
+        'recent', 'recently', 'trajectory', 'did i', 'did we',
+        'what happened', 'the previous', 'the last', 'earlier',
+        'this morning', 'this afternoon', 'this evening',
+    ],
+    semantic: [
+        'how does', 'what is', 'why', 'why does', 'concept',
+        'pattern', 'design', 'architecture', 'principle',
+        'means', 'meaning', 'definition', 'explanation',
+        'relationship between',
+    ],
+    procedural: [
+        'how do i', 'how to', 'steps to', 'recipe', 'playbook',
+        'procedure', 'walk me through', 'guide', 'runbook',
+        'checklist', 'template', 'workflow', 'skill',
+    ],
+};
+/**
+ * Namespaces owned by each intent. These match ruflo's actual
+ * memory-write conventions:
+ *   episodic  → session/trajectory writes (hooks_post-task, session-checkpoints)
+ *   semantic  → pattern/learning writes (patterns/, learned-*, adr-patterns)
+ *   procedural → skill/workflow writes (skills/, agents/, workflow-templates)
+ * A namespace listed under more than one intent means it's genuinely dual-nature.
+ */
+const NAMESPACES = {
+    episodic: [
+        'sessions', 'session-checkpoints', 'trajectory', 'trajectories',
+        'routing-outcomes', 'commands', 'feedback',
+    ],
+    semantic: [
+        'patterns', 'learned-patterns', 'adr-patterns', 'adr-edges',
+        'reasoning-patterns', 'concepts',
+    ],
+    procedural: [
+        'skills', 'agents', 'workflow-templates', 'playbooks', 'recipes',
+    ],
+};
+const CONFIDENCE_THRESHOLD = 0.35;
+export function classifyQueryIntent(query) {
+    const q = query.toLowerCase();
+    const scores = {
+        episodic: 0,
+        semantic: 0,
+        procedural: 0,
+    };
+    // Score by keyword hits (weighted by phrase length — longer phrases
+    // are less ambiguous, e.g. "how do i" beats "how").
+    for (const intent of Object.keys(KEYWORDS)) {
+        for (const kw of KEYWORDS[intent]) {
+            if (q.includes(kw)) {
+                // Weight: longer keyword → higher confidence
+                scores[intent] += Math.max(1, kw.length / 6);
+            }
+        }
+    }
+    const total = scores.episodic + scores.semantic + scores.procedural;
+    if (total === 0) {
+        return {
+            intent: 'mixed',
+            confidence: 0,
+            scores,
+            namespaces: [],
+            reason: 'No intent keywords matched — falling back to mixed retrieval (search all namespaces).',
+        };
+    }
+    // Normalize
+    const normalized = {
+        episodic: scores.episodic / total,
+        semantic: scores.semantic / total,
+        procedural: scores.procedural / total,
+    };
+    // Pick the winner
+    const entries = [
+        ['episodic', normalized.episodic],
+        ['semantic', normalized.semantic],
+        ['procedural', normalized.procedural],
+    ];
+    entries.sort((a, b) => b[1] - a[1]);
+    const [winner, winnerScore] = entries[0];
+    // Low-confidence winner → mixed
+    if (winnerScore < CONFIDENCE_THRESHOLD) {
+        return {
+            intent: 'mixed',
+            confidence: winnerScore,
+            scores: normalized,
+            namespaces: [],
+            reason: `Top intent (${winner}) below confidence threshold ${CONFIDENCE_THRESHOLD} — falling back to mixed retrieval.`,
+        };
+    }
+    return {
+        intent: winner,
+        confidence: winnerScore,
+        scores: normalized,
+        namespaces: [...NAMESPACES[winner]],
+        reason: `Classified as ${winner} (confidence ${(winnerScore * 100).toFixed(1)}%) — route to ${NAMESPACES[winner].length} namespaces.`,
+    };
+}
+/**
+ * Given a user-requested intent (which may be `auto`), resolve to a
+ * concrete ClassifiedIntent for the given query.
+ */
+export function resolveIntent(query, requested = 'auto') {
+    if (requested === 'auto')
+        return classifyQueryIntent(query);
+    if (requested === 'mixed') {
+        return {
+            intent: 'mixed',
+            confidence: 1,
+            scores: { episodic: 0, semantic: 0, procedural: 0 },
+            namespaces: [],
+            reason: 'Explicitly requested mixed retrieval (search all namespaces).',
+        };
+    }
+    return {
+        intent: requested,
+        confidence: 1,
+        scores: { episodic: 0, semantic: 0, procedural: 0, [requested]: 1 },
+        namespaces: [...NAMESPACES[requested]],
+        reason: `Explicitly requested ${requested} retrieval — route to ${NAMESPACES[requested].length} namespaces.`,
+    };
+}
+export { KEYWORDS as INTENT_KEYWORDS, NAMESPACES as INTENT_NAMESPACES };
+//# sourceMappingURL=scm-classifier.js.map

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

@@ -1,6 +1,6 @@
 {
   "name": "@claude-flow/cli",
-  "version": "3.32.17",
+  "version": "3.32.19",
   "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",