@n-dx/core 0.1.0

package/packages/rex/dist/analyze/batch-types.js

@@ -0,0 +1,9 @@
+/**
+ * Types for batch acceptance records used by the analyze → chunked-review pipeline.
+ *
+ * These types live in the core analyze module (rex-prd-engine zone) so that
+ * both analyze.ts and the chunked-review satellite can import them without
+ * creating a core → satellite inversion.
+ */
+export {};
+//# sourceMappingURL=batch-types.js.map

package/packages/rex/dist/analyze/batch-types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"batch-types.js","sourceRoot":"","sources":["../../src/analyze/batch-types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/packages/rex/dist/analyze/consolidation-guard.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Post-processing consolidation guard.
+ *
+ * After the LLM returns proposals, this module detects over-granular output
+ * (task count exceeds a configurable ceiling) and triggers a secondary
+ * re-consolidation prompt as a safety net. If the LLM cannot reduce below
+ * the ceiling, a labeled warning is emitted.
+ *
+ * @module rex/analyze/consolidation-guard
+ */
+import type { LoEConfig, AnalyzeTokenUsage } from "../schema/index.js";
+import type { Proposal } from "./propose.js";
+export interface ConsolidationGuardResult {
+    /** Proposals after consolidation (may be unchanged if within ceiling). */
+    proposals: Proposal[];
+    /** Whether the guard triggered a consolidation pass. */
+    triggered: boolean;
+    /** Whether the consolidation successfully reduced below the ceiling. */
+    reduced: boolean;
+    /** Original task count before consolidation. */
+    originalTaskCount: number;
+    /** Task count after consolidation (same as original if not triggered). */
+    finalTaskCount: number;
+    /** The ceiling that was applied. */
+    ceiling: number;
+    /** Warning message if consolidation could not reduce below ceiling. */
+    warning?: string;
+    /** Token usage from the consolidation LLM call (zero if not triggered). */
+    tokenUsage: AnalyzeTokenUsage;
+}
+/** Count total tasks across all proposals. */
+export declare function countProposalTasks(proposals: Proposal[]): number;
+/**
+ * Build the re-consolidation prompt for over-granular proposals.
+ * Pure function — no I/O.
+ */
+export declare function buildConsolidationGuardPrompt(proposals: Proposal[], ceiling: number, currentTaskCount: number): string;
+/**
+ * Apply the post-processing consolidation guard to a set of proposals.
+ *
+ * If the total task count exceeds the configured ceiling, triggers a
+ * secondary LLM consolidation pass. If the LLM cannot reduce below the
+ * ceiling, the best-effort result is returned with a warning.
+ */
+export declare function applyConsolidationGuard(proposals: Proposal[], loeConfig?: LoEConfig, model?: string): Promise<ConsolidationGuardResult>;

package/packages/rex/dist/analyze/consolidation-guard.js

@@ -0,0 +1,125 @@
+/**
+ * Post-processing consolidation guard.
+ *
+ * After the LLM returns proposals, this module detects over-granular output
+ * (task count exceeds a configurable ceiling) and triggers a secondary
+ * re-consolidation prompt as a safety net. If the LLM cannot reduce below
+ * the ceiling, a labeled warning is emitted.
+ *
+ * @module rex/analyze/consolidation-guard
+ */
+import { LOE_DEFAULTS } from "../schema/index.js";
+import { spawnClaude, DEFAULT_MODEL, parseProposalResponse, emptyAnalyzeTokenUsage, accumulateTokenUsage, FEW_SHOT_EXAMPLE, OUTPUT_INSTRUCTION, PRD_SCHEMA, TASK_QUALITY_RULES, } from "./reason.js";
+// ── Task counting ──
+/** Count total tasks across all proposals. */
+export function countProposalTasks(proposals) {
+    let count = 0;
+    for (const p of proposals) {
+        for (const f of p.features) {
+            count += f.tasks.length;
+        }
+    }
+    return count;
+}
+// ── Prompt builder ──
+/**
+ * Build the re-consolidation prompt for over-granular proposals.
+ * Pure function — no I/O.
+ */
+export function buildConsolidationGuardPrompt(proposals, ceiling, currentTaskCount) {
+    const proposalJson = JSON.stringify(proposals, null, 2);
+    return `You are a product requirements analyst. The following PRD proposals contain ${currentTaskCount} tasks, which exceeds the project's consolidation ceiling of ${ceiling} tasks. Consolidate them into fewer, larger work packages.
+
+Current proposals:
+${proposalJson}
+
+Target: Reduce to at most ${ceiling} tasks total while preserving all scope.
+
+Rules:
+- Merge closely related tasks within each feature into broader tasks with combined acceptance criteria.
+- If a feature has many small tasks, consolidate them into 1–3 well-scoped tasks.
+- If multiple features overlap significantly, merge them into one feature.
+- Preserve the epic structure — do NOT change epic titles unless features are merged across epics.
+- Each resulting task MUST have a verb-first title AND both a description and acceptanceCriteria.
+- Preserve ALL original intent — consolidation must not drop functionality or acceptance criteria.
+- Keep the highest priority among merged tasks.
+- Preserve LoE fields: when merging tasks with "loe", sum the LoE values and update "loeRationale" to reflect the combined scope. Keep the lower confidence level.
+- Do NOT add new functionality — only consolidate what exists.
+- Do NOT produce tasks with only a title — every task needs both description and criteria.
+
+${TASK_QUALITY_RULES}
+
+${PRD_SCHEMA}
+
+${FEW_SHOT_EXAMPLE}
+
+${OUTPUT_INSTRUCTION}`;
+}
+// ── Guard logic ──
+/**
+ * Apply the post-processing consolidation guard to a set of proposals.
+ *
+ * If the total task count exceeds the configured ceiling, triggers a
+ * secondary LLM consolidation pass. If the LLM cannot reduce below the
+ * ceiling, the best-effort result is returned with a warning.
+ */
+export async function applyConsolidationGuard(proposals, loeConfig, model) {
+    const ceiling = loeConfig?.proposalCeiling ?? LOE_DEFAULTS.proposalCeiling;
+    const originalTaskCount = countProposalTasks(proposals);
+    const tokenUsage = emptyAnalyzeTokenUsage();
+    // Within ceiling — no action needed
+    if (originalTaskCount <= ceiling) {
+        return {
+            proposals,
+            triggered: false,
+            reduced: false,
+            originalTaskCount,
+            finalTaskCount: originalTaskCount,
+            ceiling,
+            tokenUsage,
+        };
+    }
+    // Over ceiling — trigger consolidation
+    const prompt = buildConsolidationGuardPrompt(proposals, ceiling, originalTaskCount);
+    const result = await spawnClaude(prompt, model ?? DEFAULT_MODEL);
+    accumulateTokenUsage(tokenUsage, result.tokenUsage);
+    const consolidated = parseProposalResponse(result.text);
+    const finalTaskCount = countProposalTasks(consolidated);
+    if (consolidated.length === 0) {
+        // Consolidation failed entirely — return originals with warning
+        return {
+            proposals,
+            triggered: true,
+            reduced: false,
+            originalTaskCount,
+            finalTaskCount: originalTaskCount,
+            ceiling,
+            warning: `Consolidation guard: LLM returned no proposals. Keeping original ${originalTaskCount} tasks (ceiling: ${ceiling}).`,
+            tokenUsage,
+        };
+    }
+    if (finalTaskCount > ceiling) {
+        // Consolidation reduced but not enough — return best-effort with warning
+        return {
+            proposals: consolidated,
+            triggered: true,
+            reduced: false,
+            originalTaskCount,
+            finalTaskCount,
+            ceiling,
+            warning: `Consolidation guard: reduced from ${originalTaskCount} to ${finalTaskCount} tasks but could not reach ceiling of ${ceiling}.`,
+            tokenUsage,
+        };
+    }
+    // Successfully reduced below ceiling
+    return {
+        proposals: consolidated,
+        triggered: true,
+        reduced: true,
+        originalTaskCount,
+        finalTaskCount,
+        ceiling,
+        tokenUsage,
+    };
+}
+//# sourceMappingURL=consolidation-guard.js.map

package/packages/rex/dist/analyze/consolidation-guard.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidation-guard.js","sourceRoot":"","sources":["../../src/analyze/consolidation-guard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,OAAO,EACL,WAAW,EACX,aAAa,EACb,qBAAqB,EACrB,sBAAsB,EACtB,oBAAoB,EACpB,gBAAgB,EAChB,kBAAkB,EAClB,UAAU,EACV,kBAAkB,GACnB,MAAM,aAAa,CAAC;AAuBrB,sBAAsB;AAEtB,8CAA8C;AAC9C,MAAM,UAAU,kBAAkB,CAAC,SAAqB;IACtD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,uBAAuB;AAEvB;;;GAGG;AACH,MAAM,UAAU,6BAA6B,CAC3C,SAAqB,EACrB,OAAe,EACf,gBAAwB;IAExB,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAExD,OAAO,+EAA+E,gBAAgB,gEAAgE,OAAO;;;EAG7K,YAAY;;4BAEc,OAAO;;;;;;;;;;;;;;EAcjC,kBAAkB;;EAElB,UAAU;;EAEV,gBAAgB;;EAEhB,kBAAkB,EAAE,CAAC;AACvB,CAAC;AAED,oBAAoB;AAEpB;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,SAAqB,EACrB,SAAqB,EACrB,KAAc;IAEd,MAAM,OAAO,GAAG,SAAS,EAAE,eAAe,IAAI,YAAY,CAAC,eAAe,CAAC;IAC3E,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;IACxD,MAAM,UAAU,GAAG,sBAAsB,EAAE,CAAC;IAE5C,oCAAoC;IACpC,IAAI,iBAAiB,IAAI,OAAO,EAAE,CAAC;QACjC,OAAO;YACL,SAAS;YACT,SAAS,EAAE,KAAK;YAChB,OAAO,EAAE,KAAK;YACd,iBAAiB;YACjB,cAAc,EAAE,iBAAiB;YACjC,OAAO;YACP,UAAU;SACX,CAAC;IACJ,CAAC;IAED,uCAAuC;IACvC,MAAM,MAAM,GAAG,6BAA6B,CAC1C,SAAS,EACT,OAAO,EACP,iBAAiB,CAClB,CAAC;IAEF,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,MAAM,EAAE,KAAK,IAAI,aAAa,CAAC,CAAC;IACjE,oBAAoB,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;IAEpD,MAAM,YAAY,GAAG,qBAAqB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxD,MAAM,cAAc,GAAG,kBAAkB,CAAC,YAAY,CAAC,CAAC;IAExD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,gEAAgE;QAChE,OAAO;YACL,SAAS;YACT,SAAS,EAAE,IAAI;YACf,OAAO,EAAE,KAAK;YACd,iBAAiB;YACjB,cAAc,EAAE,iBAAiB;YACjC,OAAO;YACP,OAAO,EAAE,oEAAoE,iBAAiB,oBAAoB,OAAO,IAAI;YAC7H,UAAU;SACX,CAAC;IACJ,CAAC;IAED,IAAI,cAAc,GAAG,OAAO,EAAE,CAAC;QAC7B,yEAAyE;QACzE,OAAO;YACL,SAAS,EAAE,YAAY;YACvB,SAAS,EAAE,IAAI;YACf,OAAO,EAAE,KAAK;YACd,iBAAiB;YACjB,cAAc;YACd,OAAO;YACP,OAAO,EAAE,qCAAqC,iBAAiB,OAAO,cAAc,yCAAyC,OAAO,GAAG;YACvI,UAAU;SACX,CAAC;IACJ,CAAC;IAED,qCAAqC;IACrC,OAAO;QACL,SAAS,EAAE,YAAY;QACvB,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,IAAI;QACb,iBAAiB;QACjB,cAAc;QACd,OAAO;QACP,UAAU;KACX,CAAC;AACJ,CAAC"}

package/packages/rex/dist/analyze/decompose.d.ts

@@ -0,0 +1,62 @@
+/**
+ * LoE-threshold-driven proposal decomposition.
+ *
+ * After the initial proposal step, this module identifies items whose LoE
+ * exceeds the configured threshold and runs a secondary LLM call per item
+ * to produce child proposals. Recursion is capped at a configurable depth
+ * limit to prevent runaway decomposition.
+ *
+ * @module rex/analyze/decompose
+ */
+import type { LoEConfig, AnalyzeTokenUsage } from "../schema/index.js";
+import type { Proposal, ProposalTask } from "./propose.js";
+/** A task that exceeded the threshold and its decomposed children. */
+export interface DecomposedTask {
+    /** The original task that was decomposed. */
+    original: ProposalTask;
+    /** Child tasks produced by the decomposition LLM call. */
+    children: ProposalTask[];
+    /** Recursion depth at which this decomposition occurred (0-indexed). */
+    depth: number;
+}
+/** Result of the decomposition pass over a full proposal set. */
+export interface DecompositionResult {
+    /** Proposals with oversized tasks replaced by their children. */
+    proposals: Proposal[];
+    /** Tasks that were decomposed (for logging/display). */
+    decomposed: DecomposedTask[];
+    /** Aggregated token usage from all decomposition LLM calls. */
+    tokenUsage: AnalyzeTokenUsage;
+}
+/**
+ * Build an LLM prompt to decompose a single oversized task into smaller
+ * children whose individual LoE falls at or below the threshold.
+ *
+ * Pure function — no I/O.
+ */
+export declare function buildDecompositionPrompt(task: ProposalTask, thresholdWeeks: number): string;
+/**
+ * Parse the LLM's decomposition response into child ProposalTasks.
+ * Validates against schema, adds default source/sourceFile from the parent.
+ */
+export declare function parseDecompositionResponse(raw: string, parent: ProposalTask): ProposalTask[];
+/**
+ * Decompose a single task into smaller children via an LLM call.
+ * Returns the child tasks along with token usage.
+ */
+export declare function decomposeTask(task: ProposalTask, thresholdWeeks: number, model?: string): Promise<{
+    children: ProposalTask[];
+    tokenUsage: AnalyzeTokenUsage;
+}>;
+/**
+ * Apply the LoE decomposition pass to a set of proposals.
+ *
+ * For each proposal, iterates over features and their tasks. Tasks whose
+ * `loe` exceeds `config.taskThresholdWeeks` are decomposed via LLM calls.
+ * Children that still exceed the threshold are recursively decomposed up
+ * to `config.maxDecompositionDepth` levels.
+ *
+ * Tasks without an `loe` field are left unchanged (they need LoE estimation
+ * first, which is the responsibility of the proposal generation prompt).
+ */
+export declare function applyDecompositionPass(proposals: Proposal[], loeConfig?: LoEConfig, model?: string): Promise<DecompositionResult>;

package/packages/rex/dist/analyze/decompose.js

@@ -0,0 +1,212 @@
+/**
+ * LoE-threshold-driven proposal decomposition.
+ *
+ * After the initial proposal step, this module identifies items whose LoE
+ * exceeds the configured threshold and runs a secondary LLM call per item
+ * to produce child proposals. Recursion is capped at a configurable depth
+ * limit to prevent runaway decomposition.
+ *
+ * @module rex/analyze/decompose
+ */
+import { LOE_DEFAULTS } from "../schema/index.js";
+import { spawnClaude, DEFAULT_MODEL, extractJson, repairTruncatedJson, emptyAnalyzeTokenUsage, accumulateTokenUsage, TASK_QUALITY_RULES, } from "./reason.js";
+import { z } from "zod";
+// ── Zod schema for decomposition response ──
+const DecompositionChildSchema = z.object({
+    title: z.string(),
+    description: z.string().optional(),
+    acceptanceCriteria: z.array(z.string()).optional(),
+    priority: z.enum(["critical", "high", "medium", "low"]).optional(),
+    tags: z.array(z.string()).optional(),
+    loe: z.number().positive().optional(),
+    loeRationale: z.string().optional(),
+    loeConfidence: z.enum(["low", "medium", "high"]).optional(),
+});
+const DecompositionResponseSchema = z.array(DecompositionChildSchema);
+// ── Prompt builder ──
+/**
+ * Build an LLM prompt to decompose a single oversized task into smaller
+ * children whose individual LoE falls at or below the threshold.
+ *
+ * Pure function — no I/O.
+ */
+export function buildDecompositionPrompt(task, thresholdWeeks) {
+    const taskJson = JSON.stringify(task, null, 2);
+    return `You are a product requirements analyst. The following task has a level-of-effort (LoE) estimate that exceeds the project's threshold of ${thresholdWeeks} engineer-week${thresholdWeeks === 1 ? "" : "s"}. Break it down into smaller, independently deliverable child tasks.
+
+Task to decompose:
+${taskJson}
+
+Rules:
+- Each child task MUST have an LoE at or below ${thresholdWeeks} engineer-week${thresholdWeeks === 1 ? "" : "s"}.
+- Each child task MUST include "loe" (number, in engineer-weeks), "loeRationale" (string explaining the estimate), and "loeConfidence" ("low"|"medium"|"high").
+- The sum of child LoE values should approximate the parent's LoE (${task.loe ?? "unknown"} weeks).
+- Each child MUST have a verb-first title, a description, and acceptanceCriteria.
+- Distribute the parent's acceptance criteria among children — do not lose any.
+- Keep priorities consistent with the parent (${task.priority ?? "medium"}).
+- Preserve tags from the parent where relevant.
+- Do NOT add entirely new functionality — only decompose what exists.
+- Produce 2-5 child tasks.
+
+${TASK_QUALITY_RULES}
+
+Respond with ONLY a valid JSON array of task objects. No explanation, no markdown fences — just the JSON.`;
+}
+// ── Response parsing ──
+/**
+ * Parse the LLM's decomposition response into child ProposalTasks.
+ * Validates against schema, adds default source/sourceFile from the parent.
+ */
+export function parseDecompositionResponse(raw, parent) {
+    const text = extractJson(raw);
+    let parsed;
+    try {
+        parsed = JSON.parse(text);
+    }
+    catch {
+        const repaired = repairTruncatedJson(text);
+        if (repaired) {
+            parsed = JSON.parse(repaired);
+        }
+        else {
+            throw new Error(`Invalid JSON in decomposition response: ${text.slice(0, 200)}`);
+        }
+    }
+    const result = DecompositionResponseSchema.safeParse(parsed);
+    if (!result.success) {
+        // Lenient fallback: parse valid items individually
+        if (Array.isArray(parsed) && parsed.length > 0) {
+            const valid = [];
+            for (const item of parsed) {
+                const single = DecompositionChildSchema.safeParse(item);
+                if (single.success)
+                    valid.push(single.data);
+            }
+            if (valid.length > 0) {
+                return valid.map((child) => ({
+                    ...child,
+                    source: parent.source,
+                    sourceFile: parent.sourceFile,
+                }));
+            }
+        }
+        throw new Error(`Decomposition response failed schema validation: ${result.error.issues.map((i) => i.message).join("; ")}`);
+    }
+    return result.data.map((child) => ({
+        ...child,
+        source: parent.source,
+        sourceFile: parent.sourceFile,
+    }));
+}
+// ── Single-task decomposition ──
+/**
+ * Decompose a single task into smaller children via an LLM call.
+ * Returns the child tasks along with token usage.
+ */
+export async function decomposeTask(task, thresholdWeeks, model) {
+    const prompt = buildDecompositionPrompt(task, thresholdWeeks);
+    const tokenUsage = emptyAnalyzeTokenUsage();
+    const result = await spawnClaude(prompt, model ?? DEFAULT_MODEL);
+    accumulateTokenUsage(tokenUsage, result.tokenUsage);
+    const children = parseDecompositionResponse(result.text, task);
+    return { children, tokenUsage };
+}
+// ── Recursive decomposition of a task list ──
+/**
+ * Recursively decompose tasks that exceed the threshold, up to the depth limit.
+ * Returns tasks with decomposition annotations (oversized tasks carry their
+ * children in `task.decomposition`) and tracking info about what was decomposed.
+ */
+async function decomposeTasks(tasks, thresholdWeeks, maxDepth, currentDepth, model, tokenUsage, decomposed) {
+    const result = [];
+    for (const task of tasks) {
+        const taskLoe = task.loe ?? 0;
+        // Skip tasks at or below threshold, or without LoE
+        if (taskLoe <= thresholdWeeks || taskLoe === 0) {
+            result.push(task);
+            continue;
+        }
+        // At depth limit — keep the task as-is
+        if (currentDepth >= maxDepth) {
+            result.push(task);
+            continue;
+        }
+        // Decompose this task
+        const { children, tokenUsage: callUsage } = await decomposeTask(task, thresholdWeeks, model);
+        tokenUsage.calls += callUsage.calls;
+        tokenUsage.inputTokens += callUsage.inputTokens;
+        tokenUsage.outputTokens += callUsage.outputTokens;
+        if (callUsage.cacheCreationInputTokens) {
+            tokenUsage.cacheCreationInputTokens =
+                (tokenUsage.cacheCreationInputTokens ?? 0) +
+                    callUsage.cacheCreationInputTokens;
+        }
+        if (callUsage.cacheReadInputTokens) {
+            tokenUsage.cacheReadInputTokens =
+                (tokenUsage.cacheReadInputTokens ?? 0) +
+                    callUsage.cacheReadInputTokens;
+        }
+        decomposed.push({
+            original: task,
+            children,
+            depth: currentDepth,
+        });
+        // Recursively check children that still exceed the threshold
+        const resolvedChildren = await decomposeTasks(children, thresholdWeeks, maxDepth, currentDepth + 1, model, tokenUsage, decomposed);
+        // Annotate the task with its decomposition instead of replacing it
+        result.push({
+            ...task,
+            decomposition: {
+                children: resolvedChildren,
+                thresholdWeeks,
+            },
+        });
+    }
+    return result;
+}
+// ── Full proposal set decomposition ──
+/**
+ * Apply the LoE decomposition pass to a set of proposals.
+ *
+ * For each proposal, iterates over features and their tasks. Tasks whose
+ * `loe` exceeds `config.taskThresholdWeeks` are decomposed via LLM calls.
+ * Children that still exceed the threshold are recursively decomposed up
+ * to `config.maxDecompositionDepth` levels.
+ *
+ * Tasks without an `loe` field are left unchanged (they need LoE estimation
+ * first, which is the responsibility of the proposal generation prompt).
+ */
+export async function applyDecompositionPass(proposals, loeConfig, model) {
+    const thresholdWeeks = loeConfig?.taskThresholdWeeks ?? LOE_DEFAULTS.taskThresholdWeeks;
+    const maxDepth = loeConfig?.maxDecompositionDepth ?? LOE_DEFAULTS.maxDecompositionDepth;
+    const resolvedModel = model ?? DEFAULT_MODEL;
+    const tokenUsage = emptyAnalyzeTokenUsage();
+    const decomposed = [];
+    // Check if any tasks actually need decomposition before doing work
+    const hasOversizedTasks = proposals.some((p) => p.features.some((f) => f.tasks.some((t) => (t.loe ?? 0) > thresholdWeeks)));
+    if (!hasOversizedTasks) {
+        return { proposals, decomposed: [], tokenUsage };
+    }
+    // Process each proposal's features/tasks
+    const resultProposals = [];
+    for (const proposal of proposals) {
+        const resultFeatures = [];
+        for (const feature of proposal.features) {
+            const resolvedTasks = await decomposeTasks(feature.tasks, thresholdWeeks, maxDepth, 0, resolvedModel, tokenUsage, decomposed);
+            resultFeatures.push({
+                ...feature,
+                tasks: resolvedTasks,
+            });
+        }
+        resultProposals.push({
+            ...proposal,
+            features: resultFeatures,
+        });
+    }
+    return {
+        proposals: resultProposals,
+        decomposed,
+        tokenUsage,
+    };
+}
+//# sourceMappingURL=decompose.js.map

package/packages/rex/dist/analyze/decompose.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decompose.js","sourceRoot":"","sources":["../../src/analyze/decompose.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAGlD,OAAO,EACL,WAAW,EACX,aAAa,EACb,WAAW,EACX,mBAAmB,EACnB,sBAAsB,EACtB,oBAAoB,EAEpB,kBAAkB,GAEnB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAwBxB,8CAA8C;AAE9C,MAAM,wBAAwB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE;IACjB,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAClC,kBAAkB,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE;IAClD,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,EAAE;IAClE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE;IACpC,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACrC,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IACnC,aAAa,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE;CAC5D,CAAC,CAAC;AAEH,MAAM,2BAA2B,GAAG,CAAC,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC;AAEtE,uBAAuB;AAEvB;;;;;GAKG;AACH,MAAM,UAAU,wBAAwB,CACtC,IAAkB,EAClB,cAAsB;IAEtB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAE/C,OAAO,2IAA2I,cAAc,iBAAiB,cAAc,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG;;;EAGhN,QAAQ;;;iDAGuC,cAAc,iBAAiB,cAAc,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG;;qEAE1C,IAAI,CAAC,GAAG,IAAI,SAAS;;;gDAG1C,IAAI,CAAC,QAAQ,IAAI,QAAQ;;;;;EAKvE,kBAAkB;;0GAEsF,CAAC;AAC3G,CAAC;AAED,yBAAyB;AAEzB;;;GAGG;AACH,MAAM,UAAU,0BAA0B,CACxC,GAAW,EACX,MAAoB;IAEpB,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAE9B,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CACb,2CAA2C,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAChE,CAAC;QACJ,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,2BAA2B,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC7D,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,mDAAmD;QACnD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/C,MAAM,KAAK,GAA+C,EAAE,CAAC;YAC7D,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAG,wBAAwB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBACxD,IAAI,MAAM,CAAC,OAAO;oBAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9C,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;oBAC3B,GAAG,KAAK;oBACR,MAAM,EAAE,MAAM,CAAC,MAAM;oBACrB,UAAU,EAAE,MAAM,CAAC,UAAU;iBAC9B,CAAC,CAAC,CAAC;YACN,CAAC;QACH,CAAC;QACD,MAAM,IAAI,KAAK,CACb,oDAAoD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC3G,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACjC,GAAG,KAAK;QACR,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,UAAU,EAAE,MAAM,CAAC,UAAU;KAC9B,CAAC,CAAC,CAAC;AACN,CAAC;AAED,kCAAkC;AAElC;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,IAAkB,EAClB,cAAsB,EACtB,KAAc;IAEd,MAAM,MAAM,GAAG,wBAAwB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IAC9D,MAAM,UAAU,GAAG,sBAAsB,EAAE,CAAC;IAE5C,MAAM,MAAM,GAAiB,MAAM,WAAW,CAC5C,MAAM,EACN,KAAK,IAAI,aAAa,CACvB,CAAC;IACF,oBAAoB,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;IAEpD,MAAM,QAAQ,GAAG,0BAA0B,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC/D,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;AAClC,CAAC;AAED,+CAA+C;AAE/C;;;;GAIG;AACH,KAAK,UAAU,cAAc,CAC3B,KAAqB,EACrB,cAAsB,EACtB,QAAgB,EAChB,YAAoB,EACpB,KAAa,EACb,UAA6B,EAC7B,UAA4B;IAE5B,MAAM,MAAM,GAAmB,EAAE,CAAC;IAElC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QAE9B,mDAAmD;QACnD,IAAI,OAAO,IAAI,cAAc,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;YAC/C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClB,SAAS;QACX,CAAC;QAED,uCAAuC;QACvC,IAAI,YAAY,IAAI,QAAQ,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClB,SAAS;QACX,CAAC;QAED,sBAAsB;QACtB,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,MAAM,aAAa,CAC7D,IAAI,EACJ,cAAc,EACd,KAAK,CACN,CAAC;QACF,UAAU,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,CAAC;QACpC,UAAU,CAAC,WAAW,IAAI,SAAS,CAAC,WAAW,CAAC;QAChD,UAAU,CAAC,YAAY,IAAI,SAAS,CAAC,YAAY,CAAC;QAClD,IAAI,SAAS,CAAC,wBAAwB,EAAE,CAAC;YACvC,UAAU,CAAC,wBAAwB;gBACjC,CAAC,UAAU,CAAC,wBAAwB,IAAI,CAAC,CAAC;oBAC1C,SAAS,CAAC,wBAAwB,CAAC;QACvC,CAAC;QACD,IAAI,SAAS,CAAC,oBAAoB,EAAE,CAAC;YACnC,UAAU,CAAC,oBAAoB;gBAC7B,CAAC,UAAU,CAAC,oBAAoB,IAAI,CAAC,CAAC;oBACtC,SAAS,CAAC,oBAAoB,CAAC;QACnC,CAAC;QAED,UAAU,CAAC,IAAI,CAAC;YACd,QAAQ,EAAE,IAAI;YACd,QAAQ;YACR,KAAK,EAAE,YAAY;SACpB,CAAC,CAAC;QAEH,6DAA6D;QAC7D,MAAM,gBAAgB,GAAG,MAAM,cAAc,CAC3C,QAAQ,EACR,cAAc,EACd,QAAQ,EACR,YAAY,GAAG,CAAC,EAChB,KAAK,EACL,UAAU,EACV,UAAU,CACX,CAAC;QAEF,mEAAmE;QACnE,MAAM,CAAC,IAAI,CAAC;YACV,GAAG,IAAI;YACP,aAAa,EAAE;gBACb,QAAQ,EAAE,gBAAgB;gBAC1B,cAAc;aACf;SACF,CAAC,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,wCAAwC;AAExC;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,SAAqB,EACrB,SAAqB,EACrB,KAAc;IAEd,MAAM,cAAc,GAClB,SAAS,EAAE,kBAAkB,IAAI,YAAY,CAAC,kBAAkB,CAAC;IACnE,MAAM,QAAQ,GACZ,SAAS,EAAE,qBAAqB,IAAI,YAAY,CAAC,qBAAqB,CAAC;IACzE,MAAM,aAAa,GAAG,KAAK,IAAI,aAAa,CAAC;IAE7C,MAAM,UAAU,GAAG,sBAAsB,EAAE,CAAC;IAC5C,MAAM,UAAU,GAAqB,EAAE,CAAC;IAExC,mEAAmE;IACnE,MAAM,iBAAiB,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7C,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CACpB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,cAAc,CAAC,CACnD,CACF,CAAC;IAEF,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACvB,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;IACnD,CAAC;IAED,yCAAyC;IACzC,MAAM,eAAe,GAAe,EAAE,CAAC;IAEvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,cAAc,GAAsB,EAAE,CAAC;QAE7C,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;YACxC,MAAM,aAAa,GAAG,MAAM,cAAc,CACxC,OAAO,CAAC,KAAK,EACb,cAAc,EACd,QAAQ,EACR,CAAC,EACD,aAAa,EACb,UAAU,EACV,UAAU,CACX,CAAC;YAEF,cAAc,CAAC,IAAI,CAAC;gBAClB,GAAG,OAAO;gBACV,KAAK,EAAE,aAAa;aACrB,CAAC,CAAC;QACL,CAAC;QAED,eAAe,CAAC,IAAI,CAAC;YACnB,GAAG,QAAQ;YACX,QAAQ,EAAE,cAAc;SACzB,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,SAAS,EAAE,eAAe;QAC1B,UAAU;QACV,UAAU;KACX,CAAC;AACJ,CAAC"}

package/packages/rex/dist/analyze/dedupe.d.ts

@@ -0,0 +1,30 @@
+import type { ScanResult } from "./scanners.js";
+/**
+ * Compute similarity between two strings using a combination of:
+ * 1. Action-verb normalization (synonyms mapped, then compared on content)
+ * 2. Bigram Dice coefficient (character-level)
+ * 3. Word overlap with fuzzy matching (Jaccard index)
+ * 4. Substring containment bonus
+ *
+ * When both strings start with an action verb (e.g. "Fix", "Implement"),
+ * the verb is factored out and similarity is computed on the remaining
+ * content words. Synonymous verbs ("Add" / "Implement") are treated as
+ * matching, so only the content difference matters.
+ *
+ * Returns the maximum of these scores (0.0–1.0).
+ */
+export declare function similarity(a: string, b: string): number;
+/**
+ * Deduplicate scan results by merging near-duplicates within the same kind.
+ *
+ * Uses multi-signal similarity: name comparison (bigram Dice + word overlap
+ * with action-verb normalization) combined with description similarity for
+ * results that describe the same work in different words.
+ *
+ * Results of different kinds (epic vs feature vs task) are never merged.
+ *
+ * @param results - Raw scan results
+ * @param threshold - Similarity threshold (0.0–1.0). Default 0.7.
+ * @returns Deduplicated results with merged metadata
+ */
+export declare function deduplicateScanResults(results: ScanResult[], threshold?: number): ScanResult[];