@n-dx/core 0.1.0

package/packages/llm-client/package.json

@@ -0,0 +1,34 @@
+{
+  "name": "@n-dx/llm-client",
+  "version": "0.1.0",
+  "private": true,
+  "license": "Elastic-2.0",
+  "type": "module",
+  "exports": {
+    ".": {
+      "import": "./dist/public.js",
+      "types": "./dist/public.d.ts"
+    },
+    "./dist/*": "./dist/*"
+  },
+  "files": [
+    "dist"
+  ],
+  "scripts": {
+    "build": "tsc",
+    "dev": "tsc --watch",
+    "typecheck": "tsc --noEmit",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "validate": "tsc --noEmit && vitest run",
+    "prepare": "pnpm run build"
+  },
+  "dependencies": {
+    "@anthropic-ai/sdk": "^0.39.0"
+  },
+  "devDependencies": {
+    "@types/node": "^22.0.0",
+    "typescript": "^5.3.0",
+    "vitest": "^4.0.0"
+  }
+}

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

@@ -0,0 +1,44 @@
+export interface AcknowledgedFinding {
+    hash: string;
+    reason: string;
+    text: string;
+    type?: string;
+    scope?: string;
+    acknowledgedAt: string;
+    acknowledgedBy: string;
+}
+export interface AcknowledgedStore {
+    version: 1;
+    findings: AcknowledgedFinding[];
+}
+/**
+ * Compute a stable content hash for a finding.
+ *
+ * Normalizes volatile numbers (call counts, file counts) and lowercases
+ * so that the same conceptual finding produces the same hash even when
+ * thresholds shift counts between analysis runs.
+ */
+export declare function computeFindingHash(finding: {
+    type: string;
+    scope: string;
+    text: string;
+}): string;
+/** Load acknowledged findings store. Returns empty store if file missing. */
+export declare function loadAcknowledged(rexDir: string): Promise<AcknowledgedStore>;
+/** Save acknowledged findings store to disk. */
+export declare function saveAcknowledged(rexDir: string, store: AcknowledgedStore): Promise<void>;
+/** Add or update an acknowledged finding. Pure — returns new store, caller saves. */
+export declare function acknowledgeFinding(store: AcknowledgedStore, hash: string, text: string, reason: string, by: string, type?: string, scope?: string): AcknowledgedStore;
+/** Check if a finding hash is acknowledged. */
+export declare function isAcknowledged(store: AcknowledgedStore, hash: string): boolean;
+/**
+ * Check if a finding is acknowledged, using fuzzy text matching as a fallback
+ * when exact hash match fails. Finds matches among acknowledged findings with
+ * the same type+scope, then compares normalized text via bigram Dice similarity.
+ */
+export declare function isAcknowledgedFuzzy(store: AcknowledgedStore, finding: {
+    hash: string;
+    type: string;
+    scope: string;
+    text: string;
+}): boolean;

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

@@ -0,0 +1,100 @@
+import { createHash } from "node:crypto";
+import { readFile, writeFile } from "node:fs/promises";
+import { join } from "node:path";
+// ── Constants ────────────────────────────────────────────────────────
+const STORE_FILE = "acknowledged-findings.json";
+// ── Hash computation ─────────────────────────────────────────────────
+/**
+ * Compute a stable content hash for a finding.
+ *
+ * Normalizes volatile numbers (call counts, file counts) and lowercases
+ * so that the same conceptual finding produces the same hash even when
+ * thresholds shift counts between analysis runs.
+ */
+export function computeFindingHash(finding) {
+    const normalized = finding.text.replace(/\d+/g, "N").toLowerCase().trim();
+    const input = `${finding.type}:${finding.scope}:${normalized}`;
+    return createHash("sha256").update(input).digest("hex").slice(0, 12);
+}
+// ── Store I/O ────────────────────────────────────────────────────────
+function emptyStore() {
+    return { version: 1, findings: [] };
+}
+/** Load acknowledged findings store. Returns empty store if file missing. */
+export async function loadAcknowledged(rexDir) {
+    try {
+        const raw = await readFile(join(rexDir, STORE_FILE), "utf-8");
+        const data = JSON.parse(raw);
+        if (data.version !== 1 || !Array.isArray(data.findings))
+            return emptyStore();
+        return data;
+    }
+    catch {
+        return emptyStore();
+    }
+}
+/** Save acknowledged findings store to disk. */
+export async function saveAcknowledged(rexDir, store) {
+    await writeFile(join(rexDir, STORE_FILE), JSON.stringify(store, null, 2) + "\n");
+}
+// ── Pure operations ──────────────────────────────────────────────────
+/** Add or update an acknowledged finding. Pure — returns new store, caller saves. */
+export function acknowledgeFinding(store, hash, text, reason, by, type, scope) {
+    const existing = store.findings.filter((f) => f.hash !== hash);
+    return {
+        ...store,
+        findings: [
+            ...existing,
+            { hash, reason, text, type, scope, acknowledgedAt: new Date().toISOString(), acknowledgedBy: by },
+        ],
+    };
+}
+/** Check if a finding hash is acknowledged. */
+export function isAcknowledged(store, hash) {
+    return store.findings.some((f) => f.hash === hash);
+}
+// ── Fuzzy matching ────────────────────────────────────────────────────
+function normalizeText(text) {
+    return text.toLowerCase().trim().replace(/\s+/g, " ");
+}
+function bigramSimilarity(a, b) {
+    if (a === b)
+        return 1.0;
+    if (a.length < 2 || b.length < 2)
+        return a === b ? 1.0 : 0;
+    const bigramsA = new Set();
+    for (let i = 0; i < a.length - 1; i++)
+        bigramsA.add(a.slice(i, i + 2));
+    const bigramsB = new Set();
+    for (let i = 0; i < b.length - 1; i++)
+        bigramsB.add(b.slice(i, i + 2));
+    let intersection = 0;
+    for (const gram of bigramsA) {
+        if (bigramsB.has(gram))
+            intersection++;
+    }
+    return (2 * intersection) / (bigramsA.size + bigramsB.size);
+}
+/** Similarity threshold for fuzzy cross-run finding matching. */
+const FUZZY_SIMILARITY_THRESHOLD = 0.65;
+/**
+ * Check if a finding is acknowledged, using fuzzy text matching as a fallback
+ * when exact hash match fails. Finds matches among acknowledged findings with
+ * the same type+scope, then compares normalized text via bigram Dice similarity.
+ */
+export function isAcknowledgedFuzzy(store, finding) {
+    // Fast path: exact hash match
+    if (store.findings.some((f) => f.hash === finding.hash))
+        return true;
+    // Fuzzy path: compare text against acknowledged findings with same type+scope
+    const normalizedText = normalizeText(finding.text);
+    for (const acked of store.findings) {
+        if (acked.type !== finding.type || acked.scope !== finding.scope)
+            continue;
+        const similarity = bigramSimilarity(normalizedText, normalizeText(acked.text));
+        if (similarity >= FUZZY_SIMILARITY_THRESHOLD)
+            return true;
+    }
+    return false;
+}
+//# sourceMappingURL=acknowledge.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"acknowledge.js","sourceRoot":"","sources":["../../src/analyze/acknowledge.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAmBjC,wEAAwE;AAExE,MAAM,UAAU,GAAG,4BAA4B,CAAC;AAEhD,wEAAwE;AAExE;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAsD;IACvF,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IAC1E,MAAM,KAAK,GAAG,GAAG,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,IAAI,UAAU,EAAE,CAAC;IAC/D,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACvE,CAAC;AAED,wEAAwE;AAExE,SAAS,UAAU;IACjB,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;AACtC,CAAC;AAED,6EAA6E;AAC7E,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,MAAc;IACnD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,OAAO,CAAC,CAAC;QAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAsB,CAAC;QAClD,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,OAAO,UAAU,EAAE,CAAC;QAC7E,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,UAAU,EAAE,CAAC;IACtB,CAAC;AACH,CAAC;AAED,gDAAgD;AAChD,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,MAAc,EAAE,KAAwB;IAC7E,MAAM,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AACnF,CAAC;AAED,wEAAwE;AAExE,qFAAqF;AACrF,MAAM,UAAU,kBAAkB,CAChC,KAAwB,EACxB,IAAY,EACZ,IAAY,EACZ,MAAc,EACd,EAAU,EACV,IAAa,EACb,KAAc;IAEd,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAC/D,OAAO;QACL,GAAG,KAAK;QACR,QAAQ,EAAE;YACR,GAAG,QAAQ;YACX,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE;SAClG;KACF,CAAC;AACJ,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,cAAc,CAAC,KAAwB,EAAE,IAAY;IACnE,OAAO,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AACrD,CAAC;AAED,yEAAyE;AAEzE,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAS,EAAE,CAAS;IAC5C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACxB,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvE,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,YAAY,EAAE,CAAC;IACzC,CAAC;IAED,OAAO,CAAC,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;AAC9D,CAAC;AAED,iEAAiE;AACjE,MAAM,0BAA0B,GAAG,IAAI,CAAC;AAExC;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAwB,EACxB,OAAoE;IAEpE,8BAA8B;IAC9B,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAErE,8EAA8E;IAC9E,MAAM,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACnD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QACnC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,IAAI,KAAK,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK;YAAE,SAAS;QAC3E,MAAM,UAAU,GAAG,gBAAgB,CAAC,cAAc,EAAE,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/E,IAAI,UAAU,IAAI,0BAA0B;YAAE,OAAO,IAAI,CAAC;IAC5D,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/packages/rex/dist/analyze/analyze-shared.d.ts

@@ -0,0 +1,51 @@
+/**
+ * Shared utilities for the analyze module.
+ *
+ * This module exists to break circular dependencies between reason.ts,
+ * extract.ts, and file-validation.ts. Pure utilities and constants that
+ * multiple analyze modules need are defined here so that no consumer
+ * needs to import from reason.ts (which dynamically imports extract.ts).
+ *
+ * @module rex/analyze/analyze-shared
+ */
+import type { TokenUsage, AnalyzeTokenUsage } from "../schema/index.js";
+export declare const DEFAULT_MODEL = "claude-sonnet-4-6";
+export declare const DEFAULT_CODEX_MODEL = "gpt-5-codex";
+/** Maximum number of LLM retry attempts for transient/parse failures. */
+export declare const MAX_RETRIES = 2;
+/** Result from a Claude CLI call, including text and optional token usage. */
+export interface ClaudeResult {
+    text: string;
+    tokenUsage?: TokenUsage;
+}
+/** Parse token usage from a claude CLI JSON envelope. */
+export declare function parseTokenUsage(envelope: Record<string, unknown>): TokenUsage | undefined;
+/** Create an empty AnalyzeTokenUsage accumulator. */
+export declare function emptyAnalyzeTokenUsage(): AnalyzeTokenUsage;
+/** Accumulate a single call's token usage into the aggregate. */
+export declare function accumulateTokenUsage(aggregate: AnalyzeTokenUsage, usage?: TokenUsage): void;
+export type FileFormat = "markdown" | "text" | "json" | "yaml";
+export declare function detectFileFormat(filePath: string): FileFormat;
+/**
+ * Extract JSON text from an LLM response, handling markdown fences,
+ * leading prose, and trailing text after the JSON array or object.
+ */
+export declare function extractJson(raw: string): string;
+/**
+ * Attempt to repair truncated JSON by closing any open structures.
+ * Handles trailing commas, truncated strings, mid-key/mid-value
+ * truncation, and unclosed brackets/braces.
+ * Returns repaired JSON string or null if not repairable.
+ */
+export declare function repairTruncatedJson(text: string): string | null;
+export declare const PRD_SCHEMA = "Each element must be an object with:\n- \"epic\": { \"title\": string, \"existingId\"?: string, \"status\"?: \"completed\"|\"pending\" }\n- \"features\": array of { \"title\": string, \"description\"?: string, \"existingId\"?: string, \"status\"?: \"completed\"|\"pending\", \"tasks\": array of { \"title\": string, \"description\"?: string, \"acceptanceCriteria\"?: string[], \"priority\"?: \"critical\"|\"high\"|\"medium\"|\"low\", \"tags\"?: string[], \"status\"?: \"completed\"|\"pending\", \"loe\"?: number, \"loeRationale\"?: string, \"loeConfidence\"?: \"low\"|\"medium\"|\"high\" } }\nThe optional \"existingId\" on epics and features references an existing PRD item by ID \u2014 use it to place new items under existing containers instead of creating duplicates.\nThe optional \"status\" field defaults to \"pending\". Set to \"completed\" when the code already implements the described functionality (used during baseline scans of existing codebases).\n\nLevel-of-Effort (LoE) fields on tasks:\n- \"loe\": estimated effort in engineer-weeks (positive number, e.g. 0.5, 1, 2, 4).\n- \"loeRationale\": one-sentence explanation justifying the estimate (mention key cost drivers).\n- \"loeConfidence\": your confidence in the estimate \u2014 \"low\" (novel domain, many unknowns), \"medium\" (some unknowns but bounded scope), or \"high\" (well-understood, similar work done before).\nInclude all three LoE fields on every task.";
+/**
+ * Shared task-quality guidelines that every PRD prompt should include.
+ * Extracted so that improvements to task quality expectations propagate
+ * everywhere at once.
+ */
+export declare const TASK_QUALITY_RULES = "Task quality:\n- Task titles MUST be specific and actionable, verb-first (e.g. \"Implement OAuth2 callback handler\", NOT \"OAuth2\" or \"Authentication stuff\").\n- Every task MUST have BOTH a description AND acceptanceCriteria. Omit neither.\n- Descriptions explain the \"why\" and expected outcome \u2014 not just restating the title. Give enough context for someone unfamiliar with the codebase to understand the intent.\n- Acceptance criteria MUST be concrete, verifiable pass/fail checks. Avoid subjective criteria like \"works well\" or \"is fast\".\n- Each task should represent a single unit of work completable in one focused session (1-4 hours).\n- Assign priority based on: blocking dependencies \u2192 user-facing impact \u2192 technical debt.";
+/**
+ * Strict output format instruction shared by all PRD prompts.
+ */
+export declare const OUTPUT_INSTRUCTION = "Respond with ONLY a valid JSON array. No explanation, no markdown fences, no commentary \u2014 just the JSON.";

package/packages/rex/dist/analyze/analyze-shared.js

@@ -0,0 +1,356 @@
+/**
+ * Shared utilities for the analyze module.
+ *
+ * This module exists to break circular dependencies between reason.ts,
+ * extract.ts, and file-validation.ts. Pure utilities and constants that
+ * multiple analyze modules need are defined here so that no consumer
+ * needs to import from reason.ts (which dynamically imports extract.ts).
+ *
+ * @module rex/analyze/analyze-shared
+ */
+import { extname } from "node:path";
+// ── Model defaults ──
+export const DEFAULT_MODEL = "claude-sonnet-4-6";
+export const DEFAULT_CODEX_MODEL = "gpt-5-codex";
+/** Maximum number of LLM retry attempts for transient/parse failures. */
+export const MAX_RETRIES = 2;
+/** Parse token usage from a claude CLI JSON envelope. */
+export function parseTokenUsage(envelope) {
+    // Claude CLI --output-format json includes usage fields at the top level
+    const input = envelope.input_tokens ?? envelope.total_input_tokens;
+    const output = envelope.output_tokens ?? envelope.total_output_tokens;
+    if (typeof input !== "number" && typeof output !== "number") {
+        return undefined;
+    }
+    const usage = {
+        input: typeof input === "number" ? input : 0,
+        output: typeof output === "number" ? output : 0,
+    };
+    const cacheCreation = envelope.cache_creation_input_tokens;
+    const cacheRead = envelope.cache_read_input_tokens;
+    if (typeof cacheCreation === "number" && cacheCreation > 0) {
+        usage.cacheCreationInput = cacheCreation;
+    }
+    if (typeof cacheRead === "number" && cacheRead > 0) {
+        usage.cacheReadInput = cacheRead;
+    }
+    return usage;
+}
+/** Create an empty AnalyzeTokenUsage accumulator. */
+export function emptyAnalyzeTokenUsage() {
+    return { calls: 0, inputTokens: 0, outputTokens: 0 };
+}
+/** Accumulate a single call's token usage into the aggregate. */
+export function accumulateTokenUsage(aggregate, usage) {
+    aggregate.calls++;
+    if (!usage)
+        return;
+    aggregate.inputTokens += usage.input;
+    aggregate.outputTokens += usage.output;
+    if (usage.cacheCreationInput) {
+        aggregate.cacheCreationInputTokens =
+            (aggregate.cacheCreationInputTokens ?? 0) + usage.cacheCreationInput;
+    }
+    if (usage.cacheReadInput) {
+        aggregate.cacheReadInputTokens =
+            (aggregate.cacheReadInputTokens ?? 0) + usage.cacheReadInput;
+    }
+}
+const FORMAT_MAP = {
+    ".md": "markdown",
+    ".txt": "text",
+    ".json": "json",
+    ".yaml": "yaml",
+    ".yml": "yaml",
+};
+export function detectFileFormat(filePath) {
+    const ext = extname(filePath).toLowerCase();
+    return FORMAT_MAP[ext] ?? "markdown";
+}
+// ── JSON extraction utilities ──
+/**
+ * Walk a JSON structure starting at `open` (`[` or `{`), tracking nesting
+ * and string state, and return the index of the matching close character.
+ * Returns -1 if the structure is never closed (truncated).
+ */
+function findMatchingClose(text, startIndex) {
+    const open = text[startIndex];
+    const close = open === "[" ? "]" : "}";
+    let depth = 0;
+    let inString = false;
+    let escaped = false;
+    for (let i = startIndex; i < text.length; i++) {
+        const ch = text[i];
+        if (escaped) {
+            escaped = false;
+            continue;
+        }
+        if (ch === "\\") {
+            escaped = true;
+            continue;
+        }
+        if (ch === '"') {
+            inString = !inString;
+            continue;
+        }
+        if (inString)
+            continue;
+        if (ch === open)
+            depth++;
+        else if (ch === close) {
+            depth--;
+            if (depth === 0)
+                return i;
+        }
+    }
+    return -1;
+}
+/**
+ * Extract JSON text from an LLM response, handling markdown fences,
+ * leading prose, and trailing text after the JSON array or object.
+ */
+export function extractJson(raw) {
+    let text = raw.trim();
+    // Try markdown code fences first
+    const fenceMatch = text.match(/```(?:json)?\s*\n?([\s\S]*?)\n?\s*```/);
+    if (fenceMatch) {
+        return fenceMatch[1].trim();
+    }
+    // Find the start of a top-level JSON array. When text already starts with
+    // `[`, the search begins at index 0. Otherwise, look for `[` at the
+    // beginning of a line (to avoid matching arrays embedded in object values).
+    let arrayStart = -1;
+    if (text.startsWith("[")) {
+        arrayStart = 0;
+    }
+    else {
+        const match = text.match(/(?:^|\n)\s*(\[)/);
+        if (match) {
+            arrayStart = text.indexOf(match[1], match.index);
+        }
+    }
+    if (arrayStart >= 0) {
+        text = text.slice(arrayStart);
+        const closeIdx = findMatchingClose(text, 0);
+        if (closeIdx >= 0) {
+            return text.slice(0, closeIdx + 1);
+        }
+        // Unclosed array — return the sliced text for downstream repair
+        return text;
+    }
+    // Handle JSON objects: find the first `{` (at start or on its own line)
+    // and match its closing `}`, stripping leading and trailing prose.
+    let objStart = -1;
+    if (text.startsWith("{")) {
+        objStart = 0;
+    }
+    else {
+        const match = text.match(/(?:^|\n)\s*(\{)/);
+        if (match) {
+            objStart = text.indexOf(match[1], match.index);
+        }
+    }
+    if (objStart >= 0) {
+        text = text.slice(objStart);
+        const closeIdx = findMatchingClose(text, 0);
+        if (closeIdx >= 0) {
+            return text.slice(0, closeIdx + 1);
+        }
+        // Unclosed object — return sliced text for downstream repair
+        return text;
+    }
+    return text;
+}
+/**
+ * Strip incomplete escape sequences from the end of a truncated JSON string.
+ * Handles:
+ *  - trailing lone backslash (`"path\` → `"path`)
+ *  - partial unicode escapes (`"emoji \u00` → `"emoji `)
+ */
+function stripTrailingEscape(s) {
+    // Strip partial \uXXXX (1-4 hex digits after \u)
+    const partialUnicode = s.match(/\\u[\da-fA-F]{0,3}$/);
+    if (partialUnicode)
+        return s.slice(0, partialUnicode.index);
+    // Strip lone trailing backslash (incomplete escape)
+    if (s.endsWith("\\")) {
+        // But not an escaped backslash (\\) — count consecutive trailing backslashes
+        let count = 0;
+        for (let i = s.length - 1; i >= 0 && s[i] === "\\"; i--)
+            count++;
+        // Odd number means the last backslash is a lone escape starter
+        if (count % 2 === 1)
+            return s.slice(0, -1);
+    }
+    return s;
+}
+/**
+ * Attempt to repair truncated JSON by closing any open structures.
+ * Handles trailing commas, truncated strings, mid-key/mid-value
+ * truncation, and unclosed brackets/braces.
+ * Returns repaired JSON string or null if not repairable.
+ */
+export function repairTruncatedJson(text) {
+    // Only attempt repair on text that starts as a JSON array or object
+    const trimmed = text.trim();
+    if (!trimmed.startsWith("[") && !trimmed.startsWith("{"))
+        return null;
+    // Try parsing as-is first
+    try {
+        JSON.parse(trimmed);
+        return trimmed;
+    }
+    catch {
+        // Continue with repair
+    }
+    // Track open brackets, braces, and string state
+    let inString = false;
+    let escaped = false;
+    const stack = [];
+    for (const ch of trimmed) {
+        if (escaped) {
+            escaped = false;
+            continue;
+        }
+        if (ch === "\\") {
+            escaped = true;
+            continue;
+        }
+        if (ch === '"') {
+            inString = !inString;
+            continue;
+        }
+        if (inString)
+            continue;
+        if (ch === "[" || ch === "{") {
+            stack.push(ch);
+        }
+        else if (ch === "]" || ch === "}") {
+            stack.pop();
+        }
+    }
+    if (stack.length === 0)
+        return null;
+    // Close any unclosed string, stripping incomplete escape sequences first
+    let repaired = trimmed;
+    if (inString)
+        repaired = stripTrailingEscape(repaired) + '"';
+    // Close structures in reverse order
+    while (stack.length > 0) {
+        const open = stack.pop();
+        repaired += open === "[" ? "]" : "}";
+    }
+    // Validate the repaired JSON actually parses
+    try {
+        JSON.parse(repaired);
+        return repaired;
+    }
+    catch {
+        // The naive close didn't work (trailing commas, partial values, etc.)
+        // Try progressively stripping trailing junk before closing
+    }
+    // Strategy: progressively strip trailing incomplete tokens from the
+    // truncation point. Each pattern removes one layer of junk:
+    //   - trailing commas/whitespace
+    //   - dangling colons (key with no value)
+    //   - partial key-value pairs (e.g. `,"feat` or `,"key":"val`)
+    //   - orphaned keys without values
+    //   - bare partial literals after a colon (e.g. `:"nul`, `:"fals`, `:"tr`)
+    const stripPatterns = [
+        // Trailing comma, colon, or whitespace
+        /[,:\s]+$/,
+        // Dangling key with optional colon: `,"key":` or `,"key"` or `,"ke`
+        /,\s*"[^"]*"?\s*:?\s*$/,
+        // Dangling value token (partial string, number, bool, null)
+        /,\s*(?:"[^"]*"?|[\d.]+|true|false|null)\s*$/,
+        // Orphan key without comma prefix: `"key":` at end of object
+        /"\w*"?\s*:?\s*$/,
+        // Bare partial literal after colon (handles truncated true/false/null)
+        /:\s*(?:t(?:r(?:ue?)?)?|f(?:a(?:l(?:se?)?)?)?|n(?:u(?:ll?)?)?|[\d.]+)\s*$/,
+    ];
+    let content = trimmed;
+    if (inString)
+        content = stripTrailingEscape(content) + '"';
+    for (let attempts = 0; attempts < 20; attempts++) {
+        // Recompute the structure stack for the current content
+        let innerString = false;
+        let innerEscaped = false;
+        const innerStack = [];
+        for (const ch of content) {
+            if (innerEscaped) {
+                innerEscaped = false;
+                continue;
+            }
+            if (ch === "\\") {
+                innerEscaped = true;
+                continue;
+            }
+            if (ch === '"') {
+                innerString = !innerString;
+                continue;
+            }
+            if (innerString)
+                continue;
+            if (ch === "[" || ch === "{")
+                innerStack.push(ch);
+            else if (ch === "]" || ch === "}")
+                innerStack.pop();
+        }
+        let candidate = content;
+        if (innerString)
+            candidate = stripTrailingEscape(candidate) + '"';
+        const closingStack = [...innerStack];
+        while (closingStack.length > 0) {
+            const open = closingStack.pop();
+            candidate += open === "[" ? "]" : "}";
+        }
+        try {
+            JSON.parse(candidate);
+            return candidate;
+        }
+        catch {
+            // Try each strip pattern until one makes progress
+            let stripped = false;
+            for (const pattern of stripPatterns) {
+                const result = content.replace(pattern, "");
+                if (result.length < content.length) {
+                    content = result;
+                    stripped = true;
+                    break;
+                }
+            }
+            if (!stripped)
+                break;
+        }
+    }
+    return null;
+}
+// ── Prompt constants ──
+export const PRD_SCHEMA = `Each element must be an object with:
+- "epic": { "title": string, "existingId"?: string, "status"?: "completed"|"pending" }
+- "features": array of { "title": string, "description"?: string, "existingId"?: string, "status"?: "completed"|"pending", "tasks": array of { "title": string, "description"?: string, "acceptanceCriteria"?: string[], "priority"?: "critical"|"high"|"medium"|"low", "tags"?: string[], "status"?: "completed"|"pending", "loe"?: number, "loeRationale"?: string, "loeConfidence"?: "low"|"medium"|"high" } }
+The optional "existingId" on epics and features references an existing PRD item by ID — use it to place new items under existing containers instead of creating duplicates.
+The optional "status" field defaults to "pending". Set to "completed" when the code already implements the described functionality (used during baseline scans of existing codebases).
+
+Level-of-Effort (LoE) fields on tasks:
+- "loe": estimated effort in engineer-weeks (positive number, e.g. 0.5, 1, 2, 4).
+- "loeRationale": one-sentence explanation justifying the estimate (mention key cost drivers).
+- "loeConfidence": your confidence in the estimate — "low" (novel domain, many unknowns), "medium" (some unknowns but bounded scope), or "high" (well-understood, similar work done before).
+Include all three LoE fields on every task.`;
+/**
+ * Shared task-quality guidelines that every PRD prompt should include.
+ * Extracted so that improvements to task quality expectations propagate
+ * everywhere at once.
+ */
+export const TASK_QUALITY_RULES = `Task quality:
+- Task titles MUST be specific and actionable, verb-first (e.g. "Implement OAuth2 callback handler", NOT "OAuth2" or "Authentication stuff").
+- Every task MUST have BOTH a description AND acceptanceCriteria. Omit neither.
+- Descriptions explain the "why" and expected outcome — not just restating the title. Give enough context for someone unfamiliar with the codebase to understand the intent.
+- Acceptance criteria MUST be concrete, verifiable pass/fail checks. Avoid subjective criteria like "works well" or "is fast".
+- Each task should represent a single unit of work completable in one focused session (1-4 hours).
+- Assign priority based on: blocking dependencies → user-facing impact → technical debt.`;
+/**
+ * Strict output format instruction shared by all PRD prompts.
+ */
+export const OUTPUT_INSTRUCTION = `Respond with ONLY a valid JSON array. No explanation, no markdown fences, no commentary — just the JSON.`;
+//# sourceMappingURL=analyze-shared.js.map

package/packages/rex/dist/analyze/analyze-shared.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analyze-shared.js","sourceRoot":"","sources":["../../src/analyze/analyze-shared.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAGpC,uBAAuB;AAEvB,MAAM,CAAC,MAAM,aAAa,GAAG,mBAAmB,CAAC;AACjD,MAAM,CAAC,MAAM,mBAAmB,GAAG,aAAa,CAAC;AAEjD,yEAAyE;AACzE,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAU7B,yDAAyD;AACzD,MAAM,UAAU,eAAe,CAAC,QAAiC;IAC/D,yEAAyE;IACzE,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,IAAI,QAAQ,CAAC,kBAAkB,CAAC;IACnE,MAAM,MAAM,GAAG,QAAQ,CAAC,aAAa,IAAI,QAAQ,CAAC,mBAAmB,CAAC;IAEtE,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC5D,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,KAAK,GAAe;QACxB,KAAK,EAAE,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,EAAE,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;KAChD,CAAC;IAEF,MAAM,aAAa,GAAG,QAAQ,CAAC,2BAA2B,CAAC;IAC3D,MAAM,SAAS,GAAG,QAAQ,CAAC,uBAAuB,CAAC;IACnD,IAAI,OAAO,aAAa,KAAK,QAAQ,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;QAC3D,KAAK,CAAC,kBAAkB,GAAG,aAAa,CAAC;IAC3C,CAAC;IACD,IAAI,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QACnD,KAAK,CAAC,cAAc,GAAG,SAAS,CAAC;IACnC,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,sBAAsB;IACpC,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;AACvD,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,oBAAoB,CAClC,SAA4B,EAC5B,KAAkB;IAElB,SAAS,CAAC,KAAK,EAAE,CAAC;IAClB,IAAI,CAAC,KAAK;QAAE,OAAO;IACnB,SAAS,CAAC,WAAW,IAAI,KAAK,CAAC,KAAK,CAAC;IACrC,SAAS,CAAC,YAAY,IAAI,KAAK,CAAC,MAAM,CAAC;IACvC,IAAI,KAAK,CAAC,kBAAkB,EAAE,CAAC;QAC7B,SAAS,CAAC,wBAAwB;YAChC,CAAC,SAAS,CAAC,wBAAwB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,kBAAkB,CAAC;IACzE,CAAC;IACD,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QACzB,SAAS,CAAC,oBAAoB;YAC5B,CAAC,SAAS,CAAC,oBAAoB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,cAAc,CAAC;IACjE,CAAC;AACH,CAAC;AAMD,MAAM,UAAU,GAA+B;IAC7C,KAAK,EAAE,UAAU;IACjB,MAAM,EAAE,MAAM;IACd,OAAO,EAAE,MAAM;IACf,OAAO,EAAE,MAAM;IACf,MAAM,EAAE,MAAM;CACf,CAAC;AAEF,MAAM,UAAU,gBAAgB,CAAC,QAAgB;IAC/C,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC;IAC5C,OAAO,UAAU,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC;AACvC,CAAC;AAED,kCAAkC;AAElC;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,IAAY,EAAE,UAAkB;IACzD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IACvC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,OAAO,GAAG,KAAK,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,OAAO,EAAE,CAAC;YAAC,OAAO,GAAG,KAAK,CAAC;YAAC,SAAS;QAAC,CAAC;QAC3C,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YAAC,OAAO,GAAG,IAAI,CAAC;YAAC,SAAS;QAAC,CAAC;QAC9C,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAAC,QAAQ,GAAG,CAAC,QAAQ,CAAC;YAAC,SAAS;QAAC,CAAC;QACnD,IAAI,QAAQ;YAAE,SAAS;QACvB,IAAI,EAAE,KAAK,IAAI;YAAE,KAAK,EAAE,CAAC;aACpB,IAAI,EAAE,KAAK,KAAK,EAAE,CAAC;YACtB,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW;IACrC,IAAI,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAEtB,iCAAiC;IACjC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,uCAAuC,CAAC,CAAC;IACvE,IAAI,UAAU,EAAE,CAAC;QACf,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9B,CAAC;IAED,0EAA0E;IAC1E,oEAAoE;IACpE,4EAA4E;IAC5E,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;IACpB,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACzB,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;SAAM,CAAC;QACN,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAC5C,IAAI,KAAK,EAAE,CAAC;YACV,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,KAAM,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;QACpB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,gEAAgE;QAChE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,wEAAwE;IACxE,mEAAmE;IACnE,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACzB,QAAQ,GAAG,CAAC,CAAC;IACf,CAAC;SAAM,CAAC;QACN,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAC5C,IAAI,KAAK,EAAE,CAAC;YACV,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,KAAM,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;QAClB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,6DAA6D;QAC7D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,mBAAmB,CAAC,CAAS;IACpC,iDAAiD;IACjD,MAAM,cAAc,GAAG,CAAC,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;IACtD,IAAI,cAAc;QAAE,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,KAAK,CAAC,CAAC;IAE5D,oDAAoD;IACpD,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACrB,6EAA6E;QAC7E,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE;YAAE,KAAK,EAAE,CAAC;QACjE,+DAA+D;QAC/D,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,oEAAoE;IACpE,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtE,0BAA0B;IAC1B,IAAI,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACpB,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,MAAM,CAAC;QACP,uBAAuB;IACzB,CAAC;IAED,gDAAgD;IAChD,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,GAAG,KAAK,CAAC;YAChB,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YAChB,OAAO,GAAG,IAAI,CAAC;YACf,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,QAAQ,GAAG,CAAC,QAAQ,CAAC;YACrB,SAAS;QACX,CAAC;QACD,IAAI,QAAQ;YAAE,SAAS;QAEvB,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACpC,KAAK,CAAC,GAAG,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpC,yEAAyE;IACzE,IAAI,QAAQ,GAAG,OAAO,CAAC;IACvB,IAAI,QAAQ;QAAE,QAAQ,GAAG,mBAAmB,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;IAE7D,oCAAoC;IACpC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC1B,QAAQ,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IACvC,CAAC;IAED,6CAA6C;IAC7C,IAAI,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACrB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAAC,MAAM,CAAC;QACP,sEAAsE;QACtE,2DAA2D;IAC7D,CAAC;IAED,oEAAoE;IACpE,4DAA4D;IAC5D,iCAAiC;IACjC,0CAA0C;IAC1C,+DAA+D;IAC/D,mCAAmC;IACnC,2EAA2E;IAC3E,MAAM,aAAa,GAAG;QACpB,uCAAuC;QACvC,UAAU;QACV,oEAAoE;QACpE,uBAAuB;QACvB,4DAA4D;QAC5D,6CAA6C;QAC7C,6DAA6D;QAC7D,iBAAiB;QACjB,uEAAuE;QACvE,0EAA0E;KAC3E,CAAC;IAEF,IAAI,OAAO,GAAG,OAAO,CAAC;IACtB,IAAI,QAAQ;QAAE,OAAO,GAAG,mBAAmB,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC;IAE3D,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,CAAC;QACjD,wDAAwD;QACxD,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,IAAI,YAAY,EAAE,CAAC;gBAAC,YAAY,GAAG,KAAK,CAAC;gBAAC,SAAS;YAAC,CAAC;YACrD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAAC,YAAY,GAAG,IAAI,CAAC;gBAAC,SAAS;YAAC,CAAC;YACnD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBAAC,WAAW,GAAG,CAAC,WAAW,CAAC;gBAAC,SAAS;YAAC,CAAC;YACzD,IAAI,WAAW;gBAAE,SAAS;YAC1B,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;gBAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;iBAC7C,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;gBAAE,UAAU,CAAC,GAAG,EAAE,CAAC;QACtD,CAAC;QAED,IAAI,SAAS,GAAG,OAAO,CAAC;QACxB,IAAI,WAAW;YAAE,SAAS,GAAG,mBAAmB,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC;QAElE,MAAM,YAAY,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;QACrC,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,EAAG,CAAC;YACjC,SAAS,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACxC,CAAC;QAED,IAAI,CAAC;YACH,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACtB,OAAO,SAAS,CAAC;QACnB,CAAC;QAAC,MAAM,CAAC;YACP,kDAAkD;YAClD,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;gBACpC,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;gBAC5C,IAAI,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;oBACnC,OAAO,GAAG,MAAM,CAAC;oBACjB,QAAQ,GAAG,IAAI,CAAC;oBAChB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,CAAC,QAAQ;gBAAE,MAAM;QACvB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,yBAAyB;AAEzB,MAAM,CAAC,MAAM,UAAU,GAAG;;;;;;;;;;4CAUkB,CAAC;AAE7C;;;;GAIG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG;;;;;;yFAMuD,CAAC;AAE1F;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,0GAA0G,CAAC"}

package/packages/rex/dist/analyze/batch-types.d.ts

@@ -0,0 +1,48 @@
+/**
+ * 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.
+ */
+/**
+ * Record of a single granularity adjustment performed during a review session.
+ * Captures what was changed and how, providing an audit trail of adjustments.
+ */
+export interface GranularityAdjustmentRecord {
+    /** The direction of adjustment. */
+    direction: "break_down" | "consolidate";
+    /** Titles of the original proposals that were adjusted. */
+    originalTitles: string[];
+    /** Titles of the resulting proposals after adjustment. */
+    resultTitles: string[];
+    /** ISO 8601 timestamp of the adjustment. */
+    timestamp: string;
+}
+/**
+ * Record of a single batch acceptance/rejection decision.
+ * Written alongside the PRD after accept to provide an audit trail of what
+ * was proposed, what was accepted, how the decision was made (interactive
+ * review vs auto-accept), and any granularity adjustments performed during
+ * the review session.
+ */
+export interface BatchAcceptanceRecord {
+    /** ISO 8601 timestamp of the decision. */
+    timestamp: string;
+    /** Total proposals offered in this batch. */
+    totalProposals: number;
+    /** Number of proposals accepted. */
+    acceptedCount: number;
+    /** Number of proposals rejected (not accepted). */
+    rejectedCount: number;
+    /** Total PRD items (epics + features + tasks) added from accepted proposals. */
+    acceptedItemCount: number;
+    /** Titles of accepted proposals (epic titles). */
+    accepted: string[];
+    /** Titles of rejected proposals (epic titles). */
+    rejected: string[];
+    /** How the decision was made. */
+    mode: "interactive" | "auto" | "cached";
+    /** Granularity adjustments made during this batch review session. */
+    granularityAdjustments?: GranularityAdjustmentRecord[];
+}