cclaw-cli 0.55.2 → 2.0.0

package/dist/track-heuristics.d.ts

@@ -1,4 +1,4 @@
-import type { FlowTrack, TrackHeuristicRule, TrackHeuristicsConfig } from "./types.js";
+import type { FlowStage, FlowTrack, TrackHeuristicRule, TrackHeuristicsConfig } from "./types.js";
 export interface TrackResolution {
     track: FlowTrack;
     reason: string;
@@ -6,6 +6,11 @@ export interface TrackResolution {
     confidence: "high" | "medium" | "low";
     overrideGuidance: string;
 }
+export interface QuestionBudgetHint {
+    min: number;
+    recommended: number;
+    hardCapWarning: number;
+}
 /**
  * Reference implementation of the track classifier the /cc skill prose
  * describes. Tests pin its behavior so the built-in defaults stay honest.
@@ -14,6 +19,7 @@ export interface TrackResolution {
  * "advisory" language.
  */
 export declare function resolveTrackFromPrompt(prompt: string, config: TrackHeuristicsConfig | undefined): TrackResolution;
+export declare function questionBudgetHint(track: FlowTrack, stage: FlowStage): QuestionBudgetHint;
 export declare const TRACK_HEURISTICS_DEFAULTS: {
     readonly fallback: "standard";
     readonly evaluationOrder: readonly ("quick" | "medium" | "standard")[];

package/dist/track-heuristics.js

@@ -54,6 +54,12 @@ const DEFAULT_RULES = {
 // into runtime, so cclaw stopped offering the knob in v0.38.0.
 const EVALUATION_ORDER = ["standard", "medium", "quick"];
 const DEFAULT_FALLBACK = "standard";
+const ADAPTIVE_ELICITATION_STAGES = new Set(["brainstorm", "scope", "design"]);
+const QUESTION_BUDGET_HINTS_BY_TRACK = {
+    quick: { min: 2, recommended: 3, hardCapWarning: 4 },
+    medium: { min: 5, recommended: 6, hardCapWarning: 8 },
+    standard: { min: 10, recommended: 12, hardCapWarning: 14 }
+};
 function hasToken(promptLower, token) {
     return promptLower.includes(token.toLowerCase());
 }
@@ -130,6 +136,12 @@ export function resolveTrackFromPrompt(prompt, config) {
         overrideGuidance: "Confirm or override before state is written; choose quick only for known low-blast-radius work, medium for known architecture with product framing, standard for uncertainty."
     };
 }
+export function questionBudgetHint(track, stage) {
+    if (!ADAPTIVE_ELICITATION_STAGES.has(stage)) {
+        return { min: 0, recommended: 0, hardCapWarning: 0 };
+    }
+    return QUESTION_BUDGET_HINTS_BY_TRACK[track];
+}
 export const TRACK_HEURISTICS_DEFAULTS = {
     fallback: DEFAULT_FALLBACK,
     evaluationOrder: EVALUATION_ORDER,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "cclaw-cli",
-  "version": "0.55.2",
+  "version": "2.0.0",
   "description": "Installer-first flow toolkit for coding agents",
   "type": "module",
   "bin": {
@@ -17,7 +17,8 @@
   },
   "scripts": {
     "clean:dist": "node -e \"import('node:fs/promises').then((fs) => fs.rm('dist', { recursive: true, force: true }))\"",
-    "build": "npm run clean:dist && tsc -p tsconfig.json && node scripts/chmod-bin.mjs",
+    "build": "npm run clean:dist && tsc -p tsconfig.json && npm run build:hook-bundle && node scripts/chmod-bin.mjs",
+    "build:hook-bundle": "esbuild src/runtime/run-hook.entry.ts --bundle --platform=node --format=esm --outfile=dist/runtime/run-hook.mjs",
     "test": "vitest run",
     "test:watch": "vitest",
     "test:coverage": "vitest run --coverage",
@@ -47,6 +48,7 @@
     "@stryker-mutator/vitest-runner": "^9.6.1",
     "@types/node": "^24.7.2",
     "@vitest/coverage-v8": "^3.2.4",
+    "esbuild": "^0.28.0",
     "typescript": "^5.9.3",
     "vitest": "^3.2.4"
   }

package/dist/content/hook-inline-snippets.d.ts

@@ -1,96 +0,0 @@
-/**
- * hook-inline-snippets.ts
- *
- * Runtime `.cclaw/hooks/run-hook.mjs` is a **standalone Node script** that
- * cannot import from `cclaw-cli` — it must work inside the end-user's
- * project even when the CLI is not installed. Two derived computations,
- * though, must remain 1:1 with the canonical TS implementations:
- *
- * 1. `computeCompoundReadinessInline` mirrors
- *    `src/knowledge-store.ts::computeCompoundReadiness`.
- * 2. `computeRalphLoopStatusInline` mirrors
- *    `src/tdd-cycle.ts::computeRalphLoopStatus`.
- * 3. `computeEarlyLoopStatusInline` mirrors
- *    `src/early-loop.ts::computeEarlyLoopStatus`.
- *
- * Previously those bodies lived inline in `src/content/node-hooks.ts` — a
- * ~2000-line file — next to unrelated hook-handler code. Any silent drift
- * only surfaced when someone remembered to update both sides.
- *
- * This module centralizes the inline JavaScript snippets so:
- *
- * - There is exactly **one place** (this file) that holds each inline
- *   JS body.
- * - Each snippet carries an explicit "mirrors X, parity enforced by Y"
- *   header comment and is emitted into `run-hook.mjs` verbatim.
- * - `src/content/node-hooks.ts` only interpolates the snippets, it no
- *   longer owns their source code.
- *
- * Parity with the TypeScript canonical implementations is enforced by
- * `tests/unit/ralph-loop-parity.test.ts` and
- * `tests/unit/early-loop-parity.test.ts`. Any structural change to the
- * canonical TS code MUST:
- *
- * 1. Update the matching snippet below.
- * 2. Re-run parity tests for the touched snippet.
- *
- * DO NOT inline tests here — keep the parity check in its dedicated test
- * file.
- */
-/**
- * Inline JS helpers used by both compound-readiness and ralph-loop
- * snippets. Kept small and locked: they are shared across the two inline
- * routines and must not grow into a hidden utility namespace.
- *
- * - `normalizeCompoundLastUpdatedAt` produces a stable ISO-8601 UTC
- *   timestamp so the hook-written `compound-readiness.json` is byte-equal
- *   to the CLI-written version for the same input.
- * - `countArchivedRunsInline` counts immediate subdirectories of
- *   `<root>/.cclaw/archive/` so both the hook and the CLI see the same
- *   `archivedRunsCount` for the small-project relaxation.
- * - `formatCompoundReadinessLineInline` mirrors the one-line summary shape
- *   used by `src/internal/compound-readiness.ts::formatCompoundReadinessLine`
- *   so session-start and internal CLI command stay wording-compatible.
- */
-export declare const HOOK_INLINE_SHARED_HELPERS = "\nfunction normalizeCompoundLastUpdatedAt(date) {\n  return date.toISOString().replace(/\\.\\d{3}Z$/u, \"Z\");\n}\n\n// Count archived runs as sub-directories under `.cclaw/archive/`. Missing\n// dir returns 0; unexpected errors return undefined so the caller can\n// skip the small-project relaxation rather than guess.\nasync function countArchivedRunsInline(root) {\n  const dir = path.join(root, RUNTIME_ROOT, \"archive\");\n  try {\n    const entries = await fs.readdir(dir, { withFileTypes: true });\n    return entries.filter((entry) => entry.isDirectory()).length;\n  } catch (error) {\n    const code = error && typeof error === \"object\" && \"code\" in error ? error.code : null;\n    if (code === \"ENOENT\") return 0;\n    return undefined;\n  }\n}\n\nfunction formatCompoundReadinessLineInline(readiness) {\n  if (!readiness || typeof readiness !== \"object\") {\n    return \"\";\n  }\n  const ready = Array.isArray(readiness.ready) ? readiness.ready : [];\n  const readyCount =\n    typeof readiness.readyCount === \"number\" && Number.isFinite(readiness.readyCount)\n      ? Math.trunc(readiness.readyCount)\n      : ready.length;\n  const clusterCount =\n    typeof readiness.clusterCount === \"number\" && Number.isFinite(readiness.clusterCount)\n      ? Math.trunc(readiness.clusterCount)\n      : 0;\n  const threshold =\n    typeof readiness.threshold === \"number\" && Number.isFinite(readiness.threshold)\n      ? Math.trunc(readiness.threshold)\n      : COMPOUND_RECURRENCE_THRESHOLD;\n  if (readyCount === 0) {\n    return \"Compound readiness: no candidates (clusters=\" +\n      String(clusterCount) + \", threshold=\" + String(threshold) + \")\";\n  }\n  const critical = ready.filter(\n    (entry) => entry && typeof entry === \"object\" && entry.severity === \"critical\"\n  ).length;\n  const criticalSuffix = critical > 0 ? \" (critical=\" + String(critical) + \")\" : \"\";\n  return \"Compound readiness: clusters=\" + String(clusterCount) +\n    \", ready=\" + String(readyCount) + criticalSuffix;\n}\n";
-/**
- * Inline mirror of `src/knowledge-store.ts::computeCompoundReadiness`.
- *
- * Parity enforced by
- * `tests/unit/ralph-loop-parity.test.ts::compound-readiness parity`.
- *
- * Signature contract:
- *   async function computeCompoundReadinessInline(root, options) -> CompoundReadiness
- *
- * Accepted options (all optional):
- * - prereadRaw: string | undefined — pre-read `knowledge.jsonl` contents.
- * - threshold: integer >= 1 — default recurrence threshold.
- * - archivedRunsCount: integer >= 0 — enables small-project relaxation.
- * - maxReady: integer >= 1 — cap on returned `ready` cluster count
- *   (default 10).
- *
- * Depends on: `SMALL_PROJECT_ARCHIVE_RUNS_THRESHOLD`,
- * `SMALL_PROJECT_RECURRENCE_THRESHOLD`, `COMPOUND_RECURRENCE_THRESHOLD`,
- * and `HOOK_INLINE_SHARED_HELPERS` being in the same runtime scope.
- */
-export declare const COMPOUND_READINESS_INLINE_SOURCE = "\nasync function computeCompoundReadinessInline(root, options) {\n  const filePath = path.join(root, RUNTIME_ROOT, \"knowledge.jsonl\");\n  // Caller may supply pre-read raw to avoid double-reading knowledge.jsonl.\n  const raw = typeof (options && options.prereadRaw) === \"string\"\n    ? options.prereadRaw\n    : await readTextFile(filePath, \"\");\n  const baseThresholdRaw = options && options.threshold;\n  const baseThreshold = Number.isInteger(baseThresholdRaw) && baseThresholdRaw >= 1\n    ? baseThresholdRaw\n    : COMPOUND_RECURRENCE_THRESHOLD;\n  const archivedRunsCount =\n    typeof (options && options.archivedRunsCount) === \"number\" &&\n    Number.isFinite(options.archivedRunsCount) &&\n    options.archivedRunsCount >= 0\n      ? Math.floor(options.archivedRunsCount)\n      : undefined;\n  const smallProjectRelaxationApplied =\n    archivedRunsCount !== undefined &&\n    archivedRunsCount < SMALL_PROJECT_ARCHIVE_RUNS_THRESHOLD &&\n    baseThreshold > SMALL_PROJECT_RECURRENCE_THRESHOLD;\n  const threshold = smallProjectRelaxationApplied\n    ? SMALL_PROJECT_RECURRENCE_THRESHOLD\n    : baseThreshold;\n  const maxReady = Number.isInteger(options && options.maxReady) && options.maxReady >= 1\n    ? options.maxReady\n    : 10;\n  const normalize = (value) => String(value == null ? \"\" : value).trim().replace(/\\s+/gu, \" \").toLowerCase();\n  const severityWeight = (sev) => {\n    if (sev === \"critical\") return 3;\n    if (sev === \"important\") return 2;\n    if (sev === \"suggestion\") return 1;\n    return 0;\n  };\n  const buckets = new Map();\n  for (const rawLine of raw.split(/\\r?\\n/gu)) {\n    const line = rawLine.trim();\n    if (line.length === 0) continue;\n    let row;\n    try { row = JSON.parse(line); } catch { continue; }\n    if (!row || typeof row !== \"object\" || Array.isArray(row)) continue;\n    if (row.maturity === \"lifted-to-enforcement\" || typeof row.superseded_by === \"string\") continue;\n    const type = typeof row.type === \"string\" ? row.type : \"\";\n    const trigger = typeof row.trigger === \"string\" ? row.trigger : \"\";\n    const action = typeof row.action === \"string\" ? row.action : \"\";\n    if (type.length === 0 || trigger.length === 0 || action.length === 0) continue;\n    const key = type + \"||\" + normalize(trigger) + \"||\" + normalize(action);\n    const frequency = Number.isInteger(row.frequency) && row.frequency > 0 ? Math.floor(row.frequency) : 1;\n    const lastSeen = typeof row.last_seen_ts === \"string\" ? row.last_seen_ts : \"\";\n    let bucket = buckets.get(key);\n    if (!bucket) {\n      bucket = {\n        trigger,\n        action,\n        recurrence: frequency,\n        entryCount: 1,\n        severity: typeof row.severity === \"string\" ? row.severity : undefined,\n        lastSeenTs: lastSeen,\n        types: new Set([type]),\n        maturity: new Set([typeof row.maturity === \"string\" ? row.maturity : \"raw\"])\n      };\n      buckets.set(key, bucket);\n      continue;\n    }\n    bucket.recurrence += frequency;\n    bucket.entryCount += 1;\n    bucket.types.add(type);\n    bucket.maturity.add(typeof row.maturity === \"string\" ? row.maturity : \"raw\");\n    if (row.severity === \"critical\") {\n      bucket.severity = \"critical\";\n    } else if (row.severity === \"important\" && bucket.severity !== \"critical\") {\n      bucket.severity = \"important\";\n    }\n    if (lastSeen && Date.parse(lastSeen) > Date.parse(bucket.lastSeenTs || \"0\")) {\n      bucket.lastSeenTs = lastSeen;\n    }\n  }\n  const ready = [];\n  for (const bucket of buckets.values()) {\n    const criticalOverride = bucket.severity === \"critical\";\n    const meetsRecurrence = bucket.recurrence >= threshold;\n    if (!criticalOverride && !meetsRecurrence) continue;\n    ready.push({\n      trigger: bucket.trigger,\n      action: bucket.action,\n      recurrence: bucket.recurrence,\n      entryCount: bucket.entryCount,\n      qualification: criticalOverride && !meetsRecurrence ? \"critical_override\" : \"recurrence\",\n      ...(bucket.severity ? { severity: bucket.severity } : {}),\n      lastSeenTs: bucket.lastSeenTs,\n      types: Array.from(bucket.types).sort(),\n      maturity: Array.from(bucket.maturity).sort()\n    });\n  }\n  ready.sort((a, b) => {\n    const sevDiff = severityWeight(b.severity) - severityWeight(a.severity);\n    if (sevDiff !== 0) return sevDiff;\n    if (b.recurrence !== a.recurrence) return b.recurrence - a.recurrence;\n    const recencyDiff = Date.parse(b.lastSeenTs || \"0\") - Date.parse(a.lastSeenTs || \"0\");\n    if (!Number.isNaN(recencyDiff) && recencyDiff !== 0) return recencyDiff;\n    return String(a.trigger).localeCompare(String(b.trigger));\n  });\n  return {\n    schemaVersion: 2,\n    threshold,\n    baseThreshold,\n    ...(archivedRunsCount !== undefined ? { archivedRunsCount } : {}),\n    smallProjectRelaxationApplied,\n    clusterCount: buckets.size,\n    readyCount: ready.length,\n    ready: ready.slice(0, maxReady),\n    lastUpdatedAt: normalizeCompoundLastUpdatedAt(new Date())\n  };\n}\n";
-/**
- * Inline mirror of `src/tdd-cycle.ts::computeRalphLoopStatus`.
- *
- * Parity enforced by
- * `tests/unit/ralph-loop-parity.test.ts::ralph-loop parity`.
- *
- * Signature contract:
- *   async function computeRalphLoopStatusInline(stateDir, runId) -> RalphLoopStatus
- */
-export declare const RALPH_LOOP_INLINE_SOURCE = "\nasync function computeRalphLoopStatusInline(stateDir, runId) {\n  const filePath = path.join(stateDir, \"tdd-cycle-log.jsonl\");\n  const raw = await readTextFile(filePath, \"\");\n  const sliceMap = new Map();\n  const acClosed = new Set();\n  const redOpenSlices = [];\n  let loopIteration = 0;\n  for (const rawLine of raw.split(/\\r?\\n/gu)) {\n    const line = rawLine.trim();\n    if (line.length === 0) continue;\n    let row;\n    try { row = JSON.parse(line); } catch { continue; }\n    if (!row || typeof row !== \"object\" || Array.isArray(row)) continue;\n    const rowRun = typeof row.runId === \"string\" && row.runId.length > 0 ? row.runId : runId;\n    if (rowRun !== runId) continue;\n    const slice = typeof row.slice === \"string\" && row.slice.length > 0 ? row.slice : \"S-unknown\";\n    let state = sliceMap.get(slice);\n    if (!state) {\n      state = { slice, redCount: 0, greenCount: 0, refactorCount: 0, redOpen: false, acIds: [] };\n      sliceMap.set(slice, state);\n    }\n    const exitCode = typeof row.exitCode === \"number\" ? row.exitCode : undefined;\n    if (row.phase === \"red\") {\n      state.redCount += 1;\n      if (exitCode !== undefined && exitCode !== 0) state.redOpen = true;\n    } else if (row.phase === \"green\") {\n      state.greenCount += 1;\n      state.redOpen = false;\n      loopIteration += 1;\n      if (Array.isArray(row.acIds)) {\n        for (const acId of row.acIds) {\n          if (typeof acId !== \"string\" || acId.length === 0) continue;\n          acClosed.add(acId);\n          if (!state.acIds.includes(acId)) state.acIds.push(acId);\n        }\n      }\n    } else if (row.phase === \"refactor\") {\n      state.refactorCount += 1;\n    }\n  }\n  for (const state of sliceMap.values()) {\n    if (state.redOpen) redOpenSlices.push(state.slice);\n  }\n  const slices = Array.from(sliceMap.values()).sort((a, b) => a.slice.localeCompare(b.slice, \"en\"));\n  return {\n    schemaVersion: 1,\n    runId,\n    loopIteration,\n    redOpen: redOpenSlices.length > 0,\n    redOpenSlices,\n    acClosed: Array.from(acClosed).sort(),\n    sliceCount: slices.length,\n    slices,\n    lastUpdatedAt: new Date().toISOString()\n  };\n}\n";
-/**
- * Inline mirror of `src/early-loop.ts::computeEarlyLoopStatus`.
- *
- * Parity enforced by
- * `tests/unit/early-loop-parity.test.ts::early-loop parity`.
- *
- * Signature contract:
- *   async function computeEarlyLoopStatusInline(stateDir, stageId, runId, maxIterations) -> EarlyLoopStatus
- */
-export declare const EARLY_LOOP_INLINE_SOURCE = "\nfunction normalizeEarlyLoopSeverityInline(value) {\n  if (value === \"critical\" || value === \"important\" || value === \"suggestion\") {\n    return value;\n  }\n  return \"important\";\n}\n\nfunction normalizeEarlyLoopTextInline(value, fallback) {\n  if (typeof value !== \"string\") return fallback;\n  const trimmed = value.trim();\n  return trimmed.length > 0 ? trimmed : fallback;\n}\n\nfunction stableConcernFallbackIdInline(locator, summary) {\n  const seed = (String(locator) + \"::\" + String(summary)).trim().toLowerCase();\n  let hash = 0;\n  for (let index = 0; index < seed.length; index += 1) {\n    hash = (Math.imul(31, hash) + seed.charCodeAt(index)) >>> 0;\n  }\n  return \"C-\" + hash.toString(16).padStart(8, \"0\");\n}\n\nfunction normalizeEarlyLoopConcernInline(row) {\n  if (!row || typeof row !== \"object\" || Array.isArray(row)) return null;\n  const locator = normalizeEarlyLoopTextInline(row.locator, \"unknown-location\");\n  const summary = normalizeEarlyLoopTextInline(row.summary, \"missing-summary\");\n  const id = typeof row.id === \"string\" && row.id.trim().length > 0\n    ? row.id.trim()\n    : stableConcernFallbackIdInline(locator, summary);\n  return {\n    id,\n    severity: normalizeEarlyLoopSeverityInline(row.severity),\n    locator,\n    summary\n  };\n}\n\nfunction normalizeEarlyLoopMaxIterationsInline(value) {\n  return Number.isInteger(value) && value >= 1 ? value : 3;\n}\n\nfunction earlyLoopSeverityWeightInline(value) {\n  if (value === \"critical\") return 3;\n  if (value === \"important\") return 2;\n  return 1;\n}\n\nfunction sortEarlyLoopConcernsInline(a, b) {\n  const severityDiff = earlyLoopSeverityWeightInline(b.severity) - earlyLoopSeverityWeightInline(a.severity);\n  if (severityDiff !== 0) return severityDiff;\n  if (a.firstSeenIteration !== b.firstSeenIteration) {\n    return a.firstSeenIteration - b.firstSeenIteration;\n  }\n  if (a.lastSeenIteration !== b.lastSeenIteration) {\n    return a.lastSeenIteration - b.lastSeenIteration;\n  }\n  return String(a.id).localeCompare(String(b.id), \"en\");\n}\n\nfunction formatEarlyLoopStatusLineInline(status) {\n  if (!status || typeof status !== \"object\") return \"\";\n  const convergence = status.convergenceTripped ? \"tripped\" : \"clear\";\n  return \"Early Loop: stage=\" + String(status.stage) +\n    \", iter=\" + String(status.iteration) + \"/\" + String(status.maxIterations) +\n    \", open=\" + String(Array.isArray(status.openConcerns) ? status.openConcerns.length : 0) +\n    \", convergence=\" + convergence;\n}\n\nasync function computeEarlyLoopStatusInline(stateDir, stageId, runId, maxIterations) {\n  const filePath = path.join(stateDir, \"early-loop-log.jsonl\");\n  const raw = await readTextFile(filePath, \"\");\n  const maxIters = normalizeEarlyLoopMaxIterationsInline(maxIterations);\n  const concernsMap = new Map();\n  let previousSnapshotKey = \"\";\n  let sameConcernStreak = 0;\n  let convergenceTripped = false;\n  let escalationReason = undefined;\n  let currentIteration = 0;\n  let lastSeenConcernIds = [];\n\n  for (const rawLine of raw.split(/\\r?\\n/gu)) {\n    const line = rawLine.trim();\n    if (line.length === 0) continue;\n    let parsed;\n    try {\n      parsed = JSON.parse(line);\n    } catch {\n      continue;\n    }\n    if (!parsed || typeof parsed !== \"object\" || Array.isArray(parsed)) continue;\n    const rowRunId = typeof parsed.runId === \"string\" && parsed.runId.trim().length > 0\n      ? parsed.runId.trim()\n      : \"active\";\n    const rowStage = typeof parsed.stage === \"string\" && parsed.stage.trim().length > 0\n      ? parsed.stage.trim()\n      : \"brainstorm\";\n    if (rowRunId !== runId || rowStage !== stageId) continue;\n\n    currentIteration += 1;\n    const iteration = Number.isInteger(parsed.iteration) && parsed.iteration >= 1\n      ? parsed.iteration\n      : currentIteration;\n    const seenThisIteration = new Set();\n    const concerns = Array.isArray(parsed.concerns) ? parsed.concerns : [];\n    for (const rawConcern of concerns) {\n      const concern = normalizeEarlyLoopConcernInline(rawConcern);\n      if (!concern) continue;\n      seenThisIteration.add(concern.id);\n      const existing = concernsMap.get(concern.id);\n      if (!existing) {\n        concernsMap.set(concern.id, {\n          id: concern.id,\n          severity: concern.severity,\n          locator: concern.locator,\n          summary: concern.summary,\n          firstSeenIteration: iteration,\n          lastSeenIteration: iteration\n        });\n        continue;\n      }\n      existing.lastSeenIteration = iteration;\n      existing.locator = concern.locator;\n      existing.summary = concern.summary;\n      if (earlyLoopSeverityWeightInline(concern.severity) >= earlyLoopSeverityWeightInline(existing.severity)) {\n        existing.severity = concern.severity;\n      }\n      delete existing.resolvedAtIteration;\n    }\n\n    const resolvedConcernIds = Array.isArray(parsed.resolvedConcernIds)\n      ? parsed.resolvedConcernIds\n          .filter((entry) => typeof entry === \"string\" && entry.trim().length > 0)\n          .map((entry) => entry.trim())\n      : [];\n    for (const concernId of resolvedConcernIds) {\n      const existing = concernsMap.get(concernId);\n      if (!existing) continue;\n      if (seenThisIteration.has(concernId)) continue;\n      if (existing.resolvedAtIteration === undefined) {\n        existing.resolvedAtIteration = iteration;\n      }\n    }\n\n    for (const concern of concernsMap.values()) {\n      if (concern.resolvedAtIteration !== undefined) continue;\n      if (seenThisIteration.has(concern.id)) continue;\n      concern.resolvedAtIteration = iteration;\n    }\n\n    const openConcernIds = Array.from(concernsMap.values())\n      .filter((concern) => concern.resolvedAtIteration === undefined)\n      .map((concern) => concern.id)\n      .sort((a, b) => String(a).localeCompare(String(b), \"en\"));\n    lastSeenConcernIds = openConcernIds;\n    const snapshotKey = openConcernIds.join(\"|\");\n    if (snapshotKey.length > 0 && snapshotKey === previousSnapshotKey) {\n      sameConcernStreak += 1;\n      if (!convergenceTripped && sameConcernStreak >= 2) {\n        convergenceTripped = true;\n        escalationReason = \"same concerns \" + String(sameConcernStreak) + \" iterations in a row\";\n      }\n    } else {\n      sameConcernStreak = snapshotKey.length > 0 ? 1 : 0;\n    }\n    previousSnapshotKey = snapshotKey;\n  }\n\n  const openConcerns = Array.from(concernsMap.values())\n    .filter((concern) => concern.resolvedAtIteration === undefined)\n    .sort(sortEarlyLoopConcernsInline);\n  const resolvedConcerns = Array.from(concernsMap.values())\n    .filter((concern) => concern.resolvedAtIteration !== undefined)\n    .sort((a, b) => {\n      if (a.resolvedAtIteration !== b.resolvedAtIteration) {\n        return a.resolvedAtIteration - b.resolvedAtIteration;\n      }\n      return sortEarlyLoopConcernsInline(a, b);\n    });\n\n  if (!convergenceTripped && openConcerns.length > 0 && currentIteration >= maxIters) {\n    convergenceTripped = true;\n    escalationReason = \"max iterations \" + String(maxIters) +\n      \" reached with \" + String(openConcerns.length) + \" open concern(s)\";\n  }\n\n  return {\n    schemaVersion: 1,\n    stage: stageId,\n    runId,\n    iteration: currentIteration,\n    maxIterations: maxIters,\n    openConcerns,\n    resolvedConcerns,\n    lastSeenConcernIds,\n    convergenceTripped,\n    ...(escalationReason ? { escalationReason } : {}),\n    lastUpdatedAt: new Date().toISOString()\n  };\n}\n";