@caupulican/pi-adaptative 0.81.38 → 0.81.40

package/dist/core/tasks/session-task-state.js.map

@@ -1 +1 @@
-{"version":3,"file":"session-task-state.js","sourceRoot":"","sources":["../../../src/core/tasks/session-task-state.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,mBAAmB,EAAE,gBAAgB,EAAuB,MAAM,iBAAiB,CAAC;AAE7F,MAAM,CAAC,MAAM,4BAA4B,GAAG,kBAAkB,CAAC;AAO/D,MAAM,UAAU,4BAA4B,CAC3C,cAAyD,EACzD,KAAqB,EACZ;IACT,MAAM,OAAO,GAAkC;QAC9C,OAAO,EAAE,CAAC;QACV,KAAK,EAAE,mBAAmB,CAAC,KAAK,CAAC;KACjC,CAAC;IACF,OAAO,cAAc,CAAC,iBAAiB,CAAC,4BAA4B,EAAE,OAAO,CAAC,CAAC;AAAA,CAC/E;AAED,SAAS,aAAa,CAAC,KAAc,EAAoC;IACxE,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAC9E,MAAM,SAAS,GAAG,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IAC/C,OAAO,SAAS,KAAK,MAAM,CAAC,SAAS,IAAI,SAAS,KAAK,IAAI,CAAC;AAAA,CAC5D;AAED,MAAM,UAAU,+BAA+B,CAAC,OAAgC,EAA8B;IAC7G,KAAK,IAAI,KAAK,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,UAAU,KAAK,4BAA4B;YAAE,SAAS;QAC3F,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC;YAAE,SAAS;QACxF,IAAI,gBAAgB,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,OAAO,mBAAmB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,SAAS,CAAC;AAAA,CACjB","sourcesContent":["import type { SessionEntry, SessionManager } from \"@caupulican/pi-agent-core/node\";\nimport { cloneTaskStepsState, isTaskStepsState, type TaskStepsState } from \"./task-state.ts\";\n\nexport const TASK_STEPS_STATE_CUSTOM_TYPE = \"task_steps_state\";\n\nexport interface TaskStepsStateSnapshotPayload {\n\tversion: 1;\n\tstate: TaskStepsState;\n}\n\nexport function appendTaskStepsStateSnapshot(\n\tsessionManager: Pick<SessionManager, \"appendCustomEntry\">,\n\tstate: TaskStepsState,\n): string {\n\tconst payload: TaskStepsStateSnapshotPayload = {\n\t\tversion: 1,\n\t\tstate: cloneTaskStepsState(state),\n\t};\n\treturn sessionManager.appendCustomEntry(TASK_STEPS_STATE_CUSTOM_TYPE, payload);\n}\n\nfunction isPlainRecord(value: unknown): value is Record<string, unknown> {\n\tif (!value || typeof value !== \"object\" || Array.isArray(value)) return false;\n\tconst prototype = Object.getPrototypeOf(value);\n\treturn prototype === Object.prototype || prototype === null;\n}\n\nexport function getLatestTaskStepsStateSnapshot(entries: readonly SessionEntry[]): TaskStepsState | undefined {\n\tfor (let index = entries.length - 1; index >= 0; index--) {\n\t\tconst entry = entries[index];\n\t\tif (entry.type !== \"custom\" || entry.customType !== TASK_STEPS_STATE_CUSTOM_TYPE) continue;\n\t\tconst payload = entry.data;\n\t\tif (!isPlainRecord(payload) || payload.version !== 1 || !(\"state\" in payload)) continue;\n\t\tif (isTaskStepsState(payload.state)) return cloneTaskStepsState(payload.state);\n\t}\n\treturn undefined;\n}\n"]}
+{"version":3,"file":"session-task-state.js","sourceRoot":"","sources":["../../../src/core/tasks/session-task-state.ts"],"names":[],"mappings":"AACA,OAAO,EACN,qBAAqB,EACrB,4BAA4B,EAC5B,gCAAgC,GAGhC,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,mBAAmB,EAAE,gBAAgB,EAAuB,MAAM,iBAAiB,CAAC;AAE7F,MAAM,CAAC,MAAM,4BAA4B,GAAG,kBAAkB,CAAC;AAI/D,MAAM,+BAA+B,GAAkD;IACtF,UAAU,EAAE,4BAA4B;IACxC,QAAQ,EAAE,OAAO;IACjB,OAAO,EAAE,gBAAgB;IACzB,KAAK,EAAE,mBAAmB;CAC1B,CAAC;AAEF,MAAM,UAAU,4BAA4B,CAC3C,cAAyD,EACzD,KAAqB,EACZ;IACT,OAAO,qBAAqB,CAAC,cAAc,EAAE,+BAA+B,EAAE,KAAK,CAAC,CAAC;AAAA,CACrF;AAED;sFACsF;AACtF,MAAM,UAAU,mCAAmC,CAAC,IAAa,EAA8B;IAC9F,OAAO,4BAA4B,CAAC,IAAI,EAAE,+BAA+B,CAAC,CAAC;AAAA,CAC3E;AAED;;;;;GAKG;AACH,MAAM,UAAU,+BAA+B,CAC9C,cAAoE,EACvC;IAC7B,OAAO,gCAAgC,CAAC,cAAc,EAAE,+BAA+B,CAAC,CAAC;AAAA,CACzF","sourcesContent":["import type { SessionManager } from \"@caupulican/pi-agent-core/node\";\nimport {\n\tappendSessionSnapshot,\n\tdecodeSessionSnapshotPayload,\n\tgetLatestSessionSnapshotOnBranch,\n\ttype SessionSnapshotCodec,\n\ttype SessionSnapshotPayload,\n} from \"../session-snapshot.ts\";\nimport { cloneTaskStepsState, isTaskStepsState, type TaskStepsState } from \"./task-state.ts\";\n\nexport const TASK_STEPS_STATE_CUSTOM_TYPE = \"task_steps_state\";\n\nexport type TaskStepsStateSnapshotPayload = SessionSnapshotPayload<\"state\", TaskStepsState>;\n\nconst TASK_STEPS_STATE_SNAPSHOT_CODEC: SessionSnapshotCodec<TaskStepsState, \"state\"> = {\n\tcustomType: TASK_STEPS_STATE_CUSTOM_TYPE,\n\tvalueKey: \"state\",\n\tisValue: isTaskStepsState,\n\tclone: cloneTaskStepsState,\n};\n\nexport function appendTaskStepsStateSnapshot(\n\tsessionManager: Pick<SessionManager, \"appendCustomEntry\">,\n\tstate: TaskStepsState,\n): string {\n\treturn appendSessionSnapshot(sessionManager, TASK_STEPS_STATE_SNAPSHOT_CODEC, state);\n}\n\n/** Pure payload decode: validates + clones a task-steps snapshot payload. No SessionManager access,\n * so unit tests can exercise decoding directly against a constructed `data` value. */\nexport function decodeTaskStepsStateSnapshotPayload(data: unknown): TaskStepsState | undefined {\n\treturn decodeSessionSnapshotPayload(data, TASK_STEPS_STATE_SNAPSHOT_CODEC);\n}\n\n/**\n * Most recent VALID task-steps snapshot on the active branch. Walks leaf→root ancestry via\n * `getLatestCustomEntryOnBranch`, skipping entries whose payload fails to decode and resuming\n * the search from that entry's parent, so an older valid snapshot still wins over a newer\n * malformed one (matches the pre-branch-scoping flat-list resolution semantics).\n */\nexport function getLatestTaskStepsStateSnapshot(\n\tsessionManager: Pick<SessionManager, \"getLatestCustomEntryOnBranch\">,\n): TaskStepsState | undefined {\n\treturn getLatestSessionSnapshotOnBranch(sessionManager, TASK_STEPS_STATE_SNAPSHOT_CODEC);\n}\n"]}

package/dist/core/tasks/task-contract-monitor.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Turn-boundary task_steps contract monitor.
+ *
+ * Pure logic only: given the current task_steps state and the prior consecutive-violation streak,
+ * decides whether the workflow contract described in the task_steps tool's `promptGuidelines`
+ * (`tools/task-steps.ts`) — at most one in_progress step, and an in_progress step whenever open
+ * steps remain — has been broken for N consecutive turns, and if so returns a ONE-LINE harness
+ * note. No model calls, no I/O, no session access: the caller (`AutoLearnController`) owns reading
+ * the task_steps state, persisting the returned streak across turns, and delivering the note
+ * through the session's existing next-turn message surface. This is an advisory nudge, not an
+ * enforcement gate.
+ */
+import type { TaskStepsState } from "./task-state.ts";
+/** Consecutive violating turns required before a harness note fires. */
+export declare const TASK_CONTRACT_VIOLATION_THRESHOLD = 3;
+export interface TaskContractStreak {
+    /** Number of consecutive turns the contract has been violated; reset to 0 on a compliant turn. */
+    consecutiveViolations: number;
+    /**
+     * Whether a note has already fired for the CURRENT streak. Re-arms to false only when the streak
+     * resets to 0 via a compliant turn, so a sustained violation emits exactly one note instead of
+     * repeating every turn past the threshold.
+     */
+    noteFired: boolean;
+}
+export declare const INITIAL_TASK_CONTRACT_STREAK: TaskContractStreak;
+export interface TaskContractCheckResult {
+    streak: TaskContractStreak;
+    /** Present only on the turn the streak first reaches the threshold. */
+    note?: string;
+}
+/**
+ * True when the task_steps contract is broken: more than one step is in_progress, or open
+ * (non-terminal) steps remain with none in_progress. An absent state (no task list ever created)
+ * is never a violation — there is nothing to enforce.
+ */
+export declare function isTaskStepsContractViolation(state: TaskStepsState | undefined): boolean;
+/**
+ * Advance the streak by one turn. Pure: takes the current task_steps state and the prior streak,
+ * returns the next streak plus, only on the exact turn the streak first reaches `threshold`, a
+ * ONE-LINE note. Callers must persist the returned streak and feed it back in as `priorStreak` on
+ * the next turn.
+ */
+export declare function checkTaskStepsContract(state: TaskStepsState | undefined, priorStreak: TaskContractStreak, threshold?: number): TaskContractCheckResult;
+//# sourceMappingURL=task-contract-monitor.d.ts.map

package/dist/core/tasks/task-contract-monitor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-contract-monitor.d.ts","sourceRoot":"","sources":["../../../src/core/tasks/task-contract-monitor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEtD,wEAAwE;AACxE,eAAO,MAAM,iCAAiC,IAAI,CAAC;AAEnD,MAAM,WAAW,kBAAkB;IAClC,kGAAkG;IAClG,qBAAqB,EAAE,MAAM,CAAC;IAC9B;;;;OAIG;IACH,SAAS,EAAE,OAAO,CAAC;CACnB;AAED,eAAO,MAAM,4BAA4B,EAAE,kBAAmE,CAAC;AAE/G,MAAM,WAAW,uBAAuB;IACvC,MAAM,EAAE,kBAAkB,CAAC;IAC3B,uEAAuE;IACvE,IAAI,CAAC,EAAE,MAAM,CAAC;CACd;AAED;;;;GAIG;AACH,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,cAAc,GAAG,SAAS,GAAG,OAAO,CAMvF;AAWD;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACrC,KAAK,EAAE,cAAc,GAAG,SAAS,EACjC,WAAW,EAAE,kBAAkB,EAC/B,SAAS,GAAE,MAA0C,GACnD,uBAAuB,CAYzB","sourcesContent":["/**\n * Turn-boundary task_steps contract monitor.\n *\n * Pure logic only: given the current task_steps state and the prior consecutive-violation streak,\n * decides whether the workflow contract described in the task_steps tool's `promptGuidelines`\n * (`tools/task-steps.ts`) — at most one in_progress step, and an in_progress step whenever open\n * steps remain — has been broken for N consecutive turns, and if so returns a ONE-LINE harness\n * note. No model calls, no I/O, no session access: the caller (`AutoLearnController`) owns reading\n * the task_steps state, persisting the returned streak across turns, and delivering the note\n * through the session's existing next-turn message surface. This is an advisory nudge, not an\n * enforcement gate.\n */\n\nimport type { TaskStepsState } from \"./task-state.ts\";\n\n/** Consecutive violating turns required before a harness note fires. */\nexport const TASK_CONTRACT_VIOLATION_THRESHOLD = 3;\n\nexport interface TaskContractStreak {\n\t/** Number of consecutive turns the contract has been violated; reset to 0 on a compliant turn. */\n\tconsecutiveViolations: number;\n\t/**\n\t * Whether a note has already fired for the CURRENT streak. Re-arms to false only when the streak\n\t * resets to 0 via a compliant turn, so a sustained violation emits exactly one note instead of\n\t * repeating every turn past the threshold.\n\t */\n\tnoteFired: boolean;\n}\n\nexport const INITIAL_TASK_CONTRACT_STREAK: TaskContractStreak = { consecutiveViolations: 0, noteFired: false };\n\nexport interface TaskContractCheckResult {\n\tstreak: TaskContractStreak;\n\t/** Present only on the turn the streak first reaches the threshold. */\n\tnote?: string;\n}\n\n/**\n * True when the task_steps contract is broken: more than one step is in_progress, or open\n * (non-terminal) steps remain with none in_progress. An absent state (no task list ever created)\n * is never a violation — there is nothing to enforce.\n */\nexport function isTaskStepsContractViolation(state: TaskStepsState | undefined): boolean {\n\tif (!state) return false;\n\tconst inProgressCount = state.steps.filter((step) => step.status === \"in_progress\").length;\n\tif (inProgressCount > 1) return true;\n\tconst openCount = state.steps.filter((step) => step.status !== \"completed\" && step.status !== \"cancelled\").length;\n\treturn openCount > 0 && inProgressCount === 0;\n}\n\nfunction buildTaskContractNote(state: TaskStepsState | undefined, consecutiveViolations: number): string {\n\tconst inProgressCount = state?.steps.filter((step) => step.status === \"in_progress\").length ?? 0;\n\tconst reason =\n\t\tinProgressCount > 1\n\t\t\t? `${inProgressCount} steps are in_progress at once`\n\t\t\t: \"open task_steps have none in_progress\";\n\treturn `Harness note: task_steps contract violated for ${consecutiveViolations} consecutive turns (${reason}) — set exactly one open step to in_progress before continuing.`;\n}\n\n/**\n * Advance the streak by one turn. Pure: takes the current task_steps state and the prior streak,\n * returns the next streak plus, only on the exact turn the streak first reaches `threshold`, a\n * ONE-LINE note. Callers must persist the returned streak and feed it back in as `priorStreak` on\n * the next turn.\n */\nexport function checkTaskStepsContract(\n\tstate: TaskStepsState | undefined,\n\tpriorStreak: TaskContractStreak,\n\tthreshold: number = TASK_CONTRACT_VIOLATION_THRESHOLD,\n): TaskContractCheckResult {\n\tif (!isTaskStepsContractViolation(state)) {\n\t\treturn { streak: { consecutiveViolations: 0, noteFired: false } };\n\t}\n\tconst consecutiveViolations = priorStreak.consecutiveViolations + 1;\n\tif (consecutiveViolations >= threshold && !priorStreak.noteFired) {\n\t\treturn {\n\t\t\tstreak: { consecutiveViolations, noteFired: true },\n\t\t\tnote: buildTaskContractNote(state, consecutiveViolations),\n\t\t};\n\t}\n\treturn { streak: { consecutiveViolations, noteFired: priorStreak.noteFired } };\n}\n"]}

package/dist/core/tasks/task-contract-monitor.js

@@ -0,0 +1,56 @@
+/**
+ * Turn-boundary task_steps contract monitor.
+ *
+ * Pure logic only: given the current task_steps state and the prior consecutive-violation streak,
+ * decides whether the workflow contract described in the task_steps tool's `promptGuidelines`
+ * (`tools/task-steps.ts`) — at most one in_progress step, and an in_progress step whenever open
+ * steps remain — has been broken for N consecutive turns, and if so returns a ONE-LINE harness
+ * note. No model calls, no I/O, no session access: the caller (`AutoLearnController`) owns reading
+ * the task_steps state, persisting the returned streak across turns, and delivering the note
+ * through the session's existing next-turn message surface. This is an advisory nudge, not an
+ * enforcement gate.
+ */
+/** Consecutive violating turns required before a harness note fires. */
+export const TASK_CONTRACT_VIOLATION_THRESHOLD = 3;
+export const INITIAL_TASK_CONTRACT_STREAK = { consecutiveViolations: 0, noteFired: false };
+/**
+ * True when the task_steps contract is broken: more than one step is in_progress, or open
+ * (non-terminal) steps remain with none in_progress. An absent state (no task list ever created)
+ * is never a violation — there is nothing to enforce.
+ */
+export function isTaskStepsContractViolation(state) {
+    if (!state)
+        return false;
+    const inProgressCount = state.steps.filter((step) => step.status === "in_progress").length;
+    if (inProgressCount > 1)
+        return true;
+    const openCount = state.steps.filter((step) => step.status !== "completed" && step.status !== "cancelled").length;
+    return openCount > 0 && inProgressCount === 0;
+}
+function buildTaskContractNote(state, consecutiveViolations) {
+    const inProgressCount = state?.steps.filter((step) => step.status === "in_progress").length ?? 0;
+    const reason = inProgressCount > 1
+        ? `${inProgressCount} steps are in_progress at once`
+        : "open task_steps have none in_progress";
+    return `Harness note: task_steps contract violated for ${consecutiveViolations} consecutive turns (${reason}) — set exactly one open step to in_progress before continuing.`;
+}
+/**
+ * Advance the streak by one turn. Pure: takes the current task_steps state and the prior streak,
+ * returns the next streak plus, only on the exact turn the streak first reaches `threshold`, a
+ * ONE-LINE note. Callers must persist the returned streak and feed it back in as `priorStreak` on
+ * the next turn.
+ */
+export function checkTaskStepsContract(state, priorStreak, threshold = TASK_CONTRACT_VIOLATION_THRESHOLD) {
+    if (!isTaskStepsContractViolation(state)) {
+        return { streak: { consecutiveViolations: 0, noteFired: false } };
+    }
+    const consecutiveViolations = priorStreak.consecutiveViolations + 1;
+    if (consecutiveViolations >= threshold && !priorStreak.noteFired) {
+        return {
+            streak: { consecutiveViolations, noteFired: true },
+            note: buildTaskContractNote(state, consecutiveViolations),
+        };
+    }
+    return { streak: { consecutiveViolations, noteFired: priorStreak.noteFired } };
+}
+//# sourceMappingURL=task-contract-monitor.js.map

package/dist/core/tasks/task-contract-monitor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-contract-monitor.js","sourceRoot":"","sources":["../../../src/core/tasks/task-contract-monitor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,wEAAwE;AACxE,MAAM,CAAC,MAAM,iCAAiC,GAAG,CAAC,CAAC;AAanD,MAAM,CAAC,MAAM,4BAA4B,GAAuB,EAAE,qBAAqB,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;AAQ/G;;;;GAIG;AACH,MAAM,UAAU,4BAA4B,CAAC,KAAiC,EAAW;IACxF,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IACzB,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC,MAAM,CAAC;IAC3F,IAAI,eAAe,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,MAAM,CAAC;IAClH,OAAO,SAAS,GAAG,CAAC,IAAI,eAAe,KAAK,CAAC,CAAC;AAAA,CAC9C;AAED,SAAS,qBAAqB,CAAC,KAAiC,EAAE,qBAA6B,EAAU;IACxG,MAAM,eAAe,GAAG,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;IACjG,MAAM,MAAM,GACX,eAAe,GAAG,CAAC;QAClB,CAAC,CAAC,GAAG,eAAe,gCAAgC;QACpD,CAAC,CAAC,uCAAuC,CAAC;IAC5C,OAAO,kDAAkD,qBAAqB,uBAAuB,MAAM,mEAAiE,CAAC;AAAA,CAC7K;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CACrC,KAAiC,EACjC,WAA+B,EAC/B,SAAS,GAAW,iCAAiC,EAC3B;IAC1B,IAAI,CAAC,4BAA4B,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1C,OAAO,EAAE,MAAM,EAAE,EAAE,qBAAqB,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC;IACnE,CAAC;IACD,MAAM,qBAAqB,GAAG,WAAW,CAAC,qBAAqB,GAAG,CAAC,CAAC;IACpE,IAAI,qBAAqB,IAAI,SAAS,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC;QAClE,OAAO;YACN,MAAM,EAAE,EAAE,qBAAqB,EAAE,SAAS,EAAE,IAAI,EAAE;YAClD,IAAI,EAAE,qBAAqB,CAAC,KAAK,EAAE,qBAAqB,CAAC;SACzD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,EAAE,qBAAqB,EAAE,SAAS,EAAE,WAAW,CAAC,SAAS,EAAE,EAAE,CAAC;AAAA,CAC/E","sourcesContent":["/**\n * Turn-boundary task_steps contract monitor.\n *\n * Pure logic only: given the current task_steps state and the prior consecutive-violation streak,\n * decides whether the workflow contract described in the task_steps tool's `promptGuidelines`\n * (`tools/task-steps.ts`) — at most one in_progress step, and an in_progress step whenever open\n * steps remain — has been broken for N consecutive turns, and if so returns a ONE-LINE harness\n * note. No model calls, no I/O, no session access: the caller (`AutoLearnController`) owns reading\n * the task_steps state, persisting the returned streak across turns, and delivering the note\n * through the session's existing next-turn message surface. This is an advisory nudge, not an\n * enforcement gate.\n */\n\nimport type { TaskStepsState } from \"./task-state.ts\";\n\n/** Consecutive violating turns required before a harness note fires. */\nexport const TASK_CONTRACT_VIOLATION_THRESHOLD = 3;\n\nexport interface TaskContractStreak {\n\t/** Number of consecutive turns the contract has been violated; reset to 0 on a compliant turn. */\n\tconsecutiveViolations: number;\n\t/**\n\t * Whether a note has already fired for the CURRENT streak. Re-arms to false only when the streak\n\t * resets to 0 via a compliant turn, so a sustained violation emits exactly one note instead of\n\t * repeating every turn past the threshold.\n\t */\n\tnoteFired: boolean;\n}\n\nexport const INITIAL_TASK_CONTRACT_STREAK: TaskContractStreak = { consecutiveViolations: 0, noteFired: false };\n\nexport interface TaskContractCheckResult {\n\tstreak: TaskContractStreak;\n\t/** Present only on the turn the streak first reaches the threshold. */\n\tnote?: string;\n}\n\n/**\n * True when the task_steps contract is broken: more than one step is in_progress, or open\n * (non-terminal) steps remain with none in_progress. An absent state (no task list ever created)\n * is never a violation — there is nothing to enforce.\n */\nexport function isTaskStepsContractViolation(state: TaskStepsState | undefined): boolean {\n\tif (!state) return false;\n\tconst inProgressCount = state.steps.filter((step) => step.status === \"in_progress\").length;\n\tif (inProgressCount > 1) return true;\n\tconst openCount = state.steps.filter((step) => step.status !== \"completed\" && step.status !== \"cancelled\").length;\n\treturn openCount > 0 && inProgressCount === 0;\n}\n\nfunction buildTaskContractNote(state: TaskStepsState | undefined, consecutiveViolations: number): string {\n\tconst inProgressCount = state?.steps.filter((step) => step.status === \"in_progress\").length ?? 0;\n\tconst reason =\n\t\tinProgressCount > 1\n\t\t\t? `${inProgressCount} steps are in_progress at once`\n\t\t\t: \"open task_steps have none in_progress\";\n\treturn `Harness note: task_steps contract violated for ${consecutiveViolations} consecutive turns (${reason}) — set exactly one open step to in_progress before continuing.`;\n}\n\n/**\n * Advance the streak by one turn. Pure: takes the current task_steps state and the prior streak,\n * returns the next streak plus, only on the exact turn the streak first reaches `threshold`, a\n * ONE-LINE note. Callers must persist the returned streak and feed it back in as `priorStreak` on\n * the next turn.\n */\nexport function checkTaskStepsContract(\n\tstate: TaskStepsState | undefined,\n\tpriorStreak: TaskContractStreak,\n\tthreshold: number = TASK_CONTRACT_VIOLATION_THRESHOLD,\n): TaskContractCheckResult {\n\tif (!isTaskStepsContractViolation(state)) {\n\t\treturn { streak: { consecutiveViolations: 0, noteFired: false } };\n\t}\n\tconst consecutiveViolations = priorStreak.consecutiveViolations + 1;\n\tif (consecutiveViolations >= threshold && !priorStreak.noteFired) {\n\t\treturn {\n\t\t\tstreak: { consecutiveViolations, noteFired: true },\n\t\t\tnote: buildTaskContractNote(state, consecutiveViolations),\n\t\t};\n\t}\n\treturn { streak: { consecutiveViolations, noteFired: priorStreak.noteFired } };\n}\n"]}

package/dist/core/tasks/task-projection.d.ts

@@ -0,0 +1,20 @@
+import type { TaskStepStatus, TaskStepsState } from "./task-state.ts";
+export interface OpenTaskStepProjection {
+    id: string;
+    status: TaskStepStatus;
+    content: string;
+    /** Always populated by projectOpenTaskSteps; optional for hand-built/legacy projections. */
+    requirementIds?: readonly string[];
+}
+export interface TaskRequirementReference {
+    id: string;
+    text: string;
+}
+/** Conservative fallback used only for task steps persisted before explicit requirement links existed. */
+export declare function taskStepReferencesRequirement(step: Pick<OpenTaskStepProjection, "content" | "requirementIds">, requirement: TaskRequirementReference): boolean;
+export declare function projectOpenTaskSteps(state: TaskStepsState | undefined): OpenTaskStepProjection[];
+export declare function resolveTaskStepRequirementIds(step: Pick<OpenTaskStepProjection, "content" | "requirementIds">, requirements: readonly TaskRequirementReference[]): {
+    matchedIds: readonly string[];
+    unknownIds: readonly string[];
+};
+//# sourceMappingURL=task-projection.d.ts.map

package/dist/core/tasks/task-projection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-projection.d.ts","sourceRoot":"","sources":["../../../src/core/tasks/task-projection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEtE,MAAM,WAAW,sBAAsB;IACtC,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,cAAc,CAAC;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,4FAA4F;IAC5F,cAAc,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED,MAAM,WAAW,wBAAwB;IACxC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACb;AAMD,0GAA0G;AAC1G,wBAAgB,6BAA6B,CAC5C,IAAI,EAAE,IAAI,CAAC,sBAAsB,EAAE,SAAS,GAAG,gBAAgB,CAAC,EAChE,WAAW,EAAE,wBAAwB,GACnC,OAAO,CAST;AAED,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,cAAc,GAAG,SAAS,GAAG,sBAAsB,EAAE,CAShG;AAED,wBAAgB,6BAA6B,CAC5C,IAAI,EAAE,IAAI,CAAC,sBAAsB,EAAE,SAAS,GAAG,gBAAgB,CAAC,EAChE,YAAY,EAAE,SAAS,wBAAwB,EAAE,GAC/C;IAAE,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,CAmBlE","sourcesContent":["import type { TaskStepStatus, TaskStepsState } from \"./task-state.ts\";\n\nexport interface OpenTaskStepProjection {\n\tid: string;\n\tstatus: TaskStepStatus;\n\tcontent: string;\n\t/** Always populated by projectOpenTaskSteps; optional for hand-built/legacy projections. */\n\trequirementIds?: readonly string[];\n}\n\nexport interface TaskRequirementReference {\n\tid: string;\n\ttext: string;\n}\n\nfunction escapeRegExp(text: string): string {\n\treturn text.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\n/** Conservative fallback used only for task steps persisted before explicit requirement links existed. */\nexport function taskStepReferencesRequirement(\n\tstep: Pick<OpenTaskStepProjection, \"content\" | \"requirementIds\">,\n\trequirement: TaskRequirementReference,\n): boolean {\n\tif ((step.requirementIds?.length ?? 0) > 0) return step.requirementIds?.includes(requirement.id) ?? false;\n\tconst idToken = requirement.id.trim();\n\tif (idToken.length >= 2) {\n\t\tconst idPattern = new RegExp(`(^|[^a-z0-9])${escapeRegExp(idToken.toLocaleLowerCase())}([^a-z0-9]|$)`, \"i\");\n\t\tif (idPattern.test(step.content)) return true;\n\t}\n\tconst text = requirement.text.trim();\n\treturn text.length >= 8 && step.content.toLocaleLowerCase().includes(text.toLocaleLowerCase());\n}\n\nexport function projectOpenTaskSteps(state: TaskStepsState | undefined): OpenTaskStepProjection[] {\n\treturn (state?.steps ?? [])\n\t\t.filter((step) => step.status !== \"completed\" && step.status !== \"cancelled\")\n\t\t.map((step) => ({\n\t\t\tid: step.id,\n\t\t\tstatus: step.status,\n\t\t\tcontent: step.activeForm || step.content,\n\t\t\trequirementIds: [...(step.requirementIds ?? [])],\n\t\t}));\n}\n\nexport function resolveTaskStepRequirementIds(\n\tstep: Pick<OpenTaskStepProjection, \"content\" | \"requirementIds\">,\n\trequirements: readonly TaskRequirementReference[],\n): { matchedIds: readonly string[]; unknownIds: readonly string[] } {\n\tconst explicitIds = [...new Set(step.requirementIds ?? [])];\n\tif (explicitIds.length > 0) {\n\t\tconst knownIds = new Set(requirements.map((requirement) => requirement.id));\n\t\treturn {\n\t\t\tmatchedIds: explicitIds.filter((id) => knownIds.has(id)),\n\t\t\tunknownIds: explicitIds.filter((id) => !knownIds.has(id)),\n\t\t};\n\t}\n\tconst projected = {\n\t\tcontent: step.content,\n\t\trequirementIds: explicitIds,\n\t};\n\treturn {\n\t\tmatchedIds: requirements\n\t\t\t.filter((requirement) => taskStepReferencesRequirement(projected, requirement))\n\t\t\t.map((requirement) => requirement.id),\n\t\tunknownIds: [],\n\t};\n}\n"]}

package/dist/core/tasks/task-projection.js

@@ -0,0 +1,47 @@
+function escapeRegExp(text) {
+    return text.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+/** Conservative fallback used only for task steps persisted before explicit requirement links existed. */
+export function taskStepReferencesRequirement(step, requirement) {
+    if ((step.requirementIds?.length ?? 0) > 0)
+        return step.requirementIds?.includes(requirement.id) ?? false;
+    const idToken = requirement.id.trim();
+    if (idToken.length >= 2) {
+        const idPattern = new RegExp(`(^|[^a-z0-9])${escapeRegExp(idToken.toLocaleLowerCase())}([^a-z0-9]|$)`, "i");
+        if (idPattern.test(step.content))
+            return true;
+    }
+    const text = requirement.text.trim();
+    return text.length >= 8 && step.content.toLocaleLowerCase().includes(text.toLocaleLowerCase());
+}
+export function projectOpenTaskSteps(state) {
+    return (state?.steps ?? [])
+        .filter((step) => step.status !== "completed" && step.status !== "cancelled")
+        .map((step) => ({
+        id: step.id,
+        status: step.status,
+        content: step.activeForm || step.content,
+        requirementIds: [...(step.requirementIds ?? [])],
+    }));
+}
+export function resolveTaskStepRequirementIds(step, requirements) {
+    const explicitIds = [...new Set(step.requirementIds ?? [])];
+    if (explicitIds.length > 0) {
+        const knownIds = new Set(requirements.map((requirement) => requirement.id));
+        return {
+            matchedIds: explicitIds.filter((id) => knownIds.has(id)),
+            unknownIds: explicitIds.filter((id) => !knownIds.has(id)),
+        };
+    }
+    const projected = {
+        content: step.content,
+        requirementIds: explicitIds,
+    };
+    return {
+        matchedIds: requirements
+            .filter((requirement) => taskStepReferencesRequirement(projected, requirement))
+            .map((requirement) => requirement.id),
+        unknownIds: [],
+    };
+}
+//# sourceMappingURL=task-projection.js.map

package/dist/core/tasks/task-projection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-projection.js","sourceRoot":"","sources":["../../../src/core/tasks/task-projection.ts"],"names":[],"mappings":"AAeA,SAAS,YAAY,CAAC,IAAY,EAAU;IAC3C,OAAO,IAAI,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AAAA,CACnD;AAED,0GAA0G;AAC1G,MAAM,UAAU,6BAA6B,CAC5C,IAAgE,EAChE,WAAqC,EAC3B;IACV,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC;IAC1G,MAAM,OAAO,GAAG,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;IACtC,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACzB,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,gBAAgB,YAAY,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;QAC5G,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,OAAO,IAAI,CAAC;IAC/C,CAAC;IACD,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACrC,OAAO,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC;AAAA,CAC/F;AAED,MAAM,UAAU,oBAAoB,CAAC,KAAiC,EAA4B;IACjG,OAAO,CAAC,KAAK,EAAE,KAAK,IAAI,EAAE,CAAC;SACzB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,CAAC;SAC5E,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACf,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,OAAO,EAAE,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO;QACxC,cAAc,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC;KAChD,CAAC,CAAC,CAAC;AAAA,CACL;AAED,MAAM,UAAU,6BAA6B,CAC5C,IAAgE,EAChE,YAAiD,EACkB;IACnE,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC,CAAC;IAC5D,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5E,OAAO;YACN,UAAU,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACxD,UAAU,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SACzD,CAAC;IACH,CAAC;IACD,MAAM,SAAS,GAAG;QACjB,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,cAAc,EAAE,WAAW;KAC3B,CAAC;IACF,OAAO;QACN,UAAU,EAAE,YAAY;aACtB,MAAM,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,6BAA6B,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;aAC9E,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC;QACtC,UAAU,EAAE,EAAE;KACd,CAAC;AAAA,CACF","sourcesContent":["import type { TaskStepStatus, TaskStepsState } from \"./task-state.ts\";\n\nexport interface OpenTaskStepProjection {\n\tid: string;\n\tstatus: TaskStepStatus;\n\tcontent: string;\n\t/** Always populated by projectOpenTaskSteps; optional for hand-built/legacy projections. */\n\trequirementIds?: readonly string[];\n}\n\nexport interface TaskRequirementReference {\n\tid: string;\n\ttext: string;\n}\n\nfunction escapeRegExp(text: string): string {\n\treturn text.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\n/** Conservative fallback used only for task steps persisted before explicit requirement links existed. */\nexport function taskStepReferencesRequirement(\n\tstep: Pick<OpenTaskStepProjection, \"content\" | \"requirementIds\">,\n\trequirement: TaskRequirementReference,\n): boolean {\n\tif ((step.requirementIds?.length ?? 0) > 0) return step.requirementIds?.includes(requirement.id) ?? false;\n\tconst idToken = requirement.id.trim();\n\tif (idToken.length >= 2) {\n\t\tconst idPattern = new RegExp(`(^|[^a-z0-9])${escapeRegExp(idToken.toLocaleLowerCase())}([^a-z0-9]|$)`, \"i\");\n\t\tif (idPattern.test(step.content)) return true;\n\t}\n\tconst text = requirement.text.trim();\n\treturn text.length >= 8 && step.content.toLocaleLowerCase().includes(text.toLocaleLowerCase());\n}\n\nexport function projectOpenTaskSteps(state: TaskStepsState | undefined): OpenTaskStepProjection[] {\n\treturn (state?.steps ?? [])\n\t\t.filter((step) => step.status !== \"completed\" && step.status !== \"cancelled\")\n\t\t.map((step) => ({\n\t\t\tid: step.id,\n\t\t\tstatus: step.status,\n\t\t\tcontent: step.activeForm || step.content,\n\t\t\trequirementIds: [...(step.requirementIds ?? [])],\n\t\t}));\n}\n\nexport function resolveTaskStepRequirementIds(\n\tstep: Pick<OpenTaskStepProjection, \"content\" | \"requirementIds\">,\n\trequirements: readonly TaskRequirementReference[],\n): { matchedIds: readonly string[]; unknownIds: readonly string[] } {\n\tconst explicitIds = [...new Set(step.requirementIds ?? [])];\n\tif (explicitIds.length > 0) {\n\t\tconst knownIds = new Set(requirements.map((requirement) => requirement.id));\n\t\treturn {\n\t\t\tmatchedIds: explicitIds.filter((id) => knownIds.has(id)),\n\t\t\tunknownIds: explicitIds.filter((id) => !knownIds.has(id)),\n\t\t};\n\t}\n\tconst projected = {\n\t\tcontent: step.content,\n\t\trequirementIds: explicitIds,\n\t};\n\treturn {\n\t\tmatchedIds: requirements\n\t\t\t.filter((requirement) => taskStepReferencesRequirement(projected, requirement))\n\t\t\t.map((requirement) => requirement.id),\n\t\tunknownIds: [],\n\t};\n}\n"]}

package/dist/core/tasks/task-state.d.ts

@@ -10,6 +10,7 @@ export interface TaskStepInput {
     status?: TaskStepStatus;
     priority?: TaskStepPriority;
     owner?: string;
+    requirementIds?: readonly string[];
     note?: string;
     notes?: readonly string[];
     evidence?: readonly string[];
@@ -21,6 +22,8 @@ export interface TaskStep {
     status: TaskStepStatus;
     priority?: TaskStepPriority;
     owner?: string;
+    /** Goal requirements this foreground step advances. Optional only for snapshots from older sessions. */
+    requirementIds?: readonly string[];
     notes: readonly string[];
     evidence: readonly string[];
     createdAt: string;
@@ -46,6 +49,7 @@ export interface TaskStepUpdate {
     status?: TaskStepStatus;
     priority?: TaskStepPriority;
     owner?: string;
+    requirementIds?: readonly string[];
     note?: string;
     evidence?: readonly string[];
 }
@@ -55,6 +59,14 @@ export declare class TaskStepsError extends Error {
 export declare function isTaskStepsState(value: unknown): value is TaskStepsState;
 export declare function cloneTaskStepsState(state: TaskStepsState): TaskStepsState;
 export declare function createTaskStepsState(now: string): TaskStepsState;
+/**
+ * Find an OPEN (non-terminal) step whose content matches `content` case-insensitively.
+ * Terminal steps (completed/cancelled) are deliberately excluded so a legitimate re-add of
+ * previously finished work still creates a new step.
+ */
+export declare function findOpenDuplicateStep(steps: readonly TaskStep[], content: string): TaskStep | undefined;
+/** True when a completed step has no evidence attached (a verification nudge candidate). */
+export declare function hasUnverifiedCompletedStep(state: TaskStepsState): boolean;
 export declare function setTaskSteps(state: TaskStepsState, inputs: readonly TaskStepInput[], now: string): TaskStepsState;
 export declare function addTaskStep(state: TaskStepsState, input: TaskStepInput, now: string): TaskStepsState;
 export declare function resolveTaskStepSelector(steps: readonly TaskStep[], selector: string): TaskStep;

package/dist/core/tasks/task-state.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"task-state.d.ts","sourceRoot":"","sources":["../../../src/core/tasks/task-state.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,kBAAkB,0EAA2E,CAAC;AAC3G,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEjE,eAAO,MAAM,oBAAoB,oCAAqC,CAAC;AACvE,MAAM,MAAM,gBAAgB,GAAG,CAAC,OAAO,oBAAoB,CAAC,CAAC,MAAM,CAAC,CAAC;AAErE,eAAO,MAAM,cAAc,MAAM,CAAC;AAClC,eAAO,MAAM,4BAA4B,OAAQ,CAAC;AAMlD,MAAM,WAAW,aAAa;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,cAAc,CAAC;IACxB,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1B,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC7B;AAED,MAAM,WAAW,QAAQ;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,cAAc,CAAC;IACvB,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IACzB,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,gBAAgB;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,cAAc;IAC9B,OAAO,EAAE,CAAC,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,cAAc,EAAE,MAAM,CAAC;IACvB,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC3B,OAAO,EAAE,gBAAgB,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,cAAc;IAC9B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,cAAc,CAAC;IACxB,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC7B;AAED,qBAAa,cAAe,SAAQ,KAAK;IACxC,YAAY,OAAO,EAAE,MAAM,EAG1B;CACD;AA2DD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,cAAc,CAmBxE;AAMD,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,cAAc,GAAG,cAAc,CAMzE;AAED,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,MAAM,GAAG,cAAc,CAUhE;AA2GD,wBAAgB,YAAY,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,aAAa,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,cAAc,CA6BjH;AAED,wBAAgB,WAAW,CAAC,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,GAAG,cAAc,CAQpG;AAED,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,EAAE,QAAQ,EAAE,MAAM,GAAG,QAAQ,CA0B9F;AAED,wBAAgB,cAAc,CAC7B,KAAK,EAAE,cAAc,EACrB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,cAAc,EACtB,GAAG,EAAE,MAAM,GACT,cAAc,CAqChB;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,MAAM,GAAG,cAAc,CAKjF;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,MAAM,GAAG,cAAc,CAYnF;AAED,wBAAgB,eAAe,CAC9B,KAAK,EAAE,cAAc,EACrB,OAAO,GAAE;IAAE,eAAe,CAAC,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5D,MAAM,CA4BR;AAED,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,SAAK,GAAG,MAAM,GAAG,SAAS,CAmB/F;AAED,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,CAErE;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS,CAO5E","sourcesContent":["export const TASK_STEP_STATUSES = [\"pending\", \"in_progress\", \"completed\", \"blocked\", \"cancelled\"] as const;\nexport type TaskStepStatus = (typeof TASK_STEP_STATUSES)[number];\n\nexport const TASK_STEP_PRIORITIES = [\"low\", \"normal\", \"high\"] as const;\nexport type TaskStepPriority = (typeof TASK_STEP_PRIORITIES)[number];\n\nexport const MAX_TASK_STEPS = 100;\nexport const MAX_TASK_STEP_CONTENT_LENGTH = 2_000;\nconst MAX_TASK_STEP_NOTE_LENGTH = 4_000;\nconst MAX_TASK_STEP_OWNER_LENGTH = 200;\nconst MAX_TASK_STEP_EVIDENCE = 32;\nconst MAX_TASK_STEP_EVIDENCE_LENGTH = 2_000;\n\nexport interface TaskStepInput {\n\tcontent: string;\n\tactiveForm?: string;\n\tstatus?: TaskStepStatus;\n\tpriority?: TaskStepPriority;\n\towner?: string;\n\tnote?: string;\n\tnotes?: readonly string[];\n\tevidence?: readonly string[];\n}\n\nexport interface TaskStep {\n\tid: string;\n\tcontent: string;\n\tactiveForm?: string;\n\tstatus: TaskStepStatus;\n\tpriority?: TaskStepPriority;\n\towner?: string;\n\tnotes: readonly string[];\n\tevidence: readonly string[];\n\tcreatedAt: string;\n\tupdatedAt: string;\n}\n\nexport interface TaskStepsArchive {\n\tcompleted: number;\n\tcancelled: number;\n\tcompactedAt?: string;\n}\n\nexport interface TaskStepsState {\n\tversion: 1;\n\trevision: number;\n\tnextStepNumber: number;\n\tsteps: readonly TaskStep[];\n\tarchive: TaskStepsArchive;\n\tcreatedAt: string;\n\tupdatedAt: string;\n}\n\nexport interface TaskStepUpdate {\n\tcontent?: string;\n\tactiveForm?: string;\n\tstatus?: TaskStepStatus;\n\tpriority?: TaskStepPriority;\n\towner?: string;\n\tnote?: string;\n\tevidence?: readonly string[];\n}\n\nexport class TaskStepsError extends Error {\n\tconstructor(message: string) {\n\t\tsuper(message);\n\t\tthis.name = \"TaskStepsError\";\n\t}\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n\tif (!value || typeof value !== \"object\" || Array.isArray(value)) return false;\n\tconst prototype = Object.getPrototypeOf(value);\n\treturn prototype === Object.prototype || prototype === null;\n}\n\nfunction isTaskStepStatus(value: unknown): value is TaskStepStatus {\n\treturn TASK_STEP_STATUSES.some((status) => status === value);\n}\n\nfunction isTaskStepPriority(value: unknown): value is TaskStepPriority {\n\treturn TASK_STEP_PRIORITIES.some((priority) => priority === value);\n}\n\nfunction hasOptionalString(record: Record<string, unknown>, key: string, maxLength: number): boolean {\n\tconst value = record[key];\n\treturn value === undefined || (typeof value === \"string\" && value.length <= maxLength);\n}\n\nfunction isBoundedStringArray(value: unknown, maxItems: number, maxLength: number): value is readonly string[] {\n\treturn (\n\t\tArray.isArray(value) &&\n\t\tvalue.length <= maxItems &&\n\t\tvalue.every((item) => typeof item === \"string\" && item.length > 0 && item.length <= maxLength)\n\t);\n}\n\nfunction isTaskStep(value: unknown): value is TaskStep {\n\tif (!isRecord(value)) return false;\n\treturn (\n\t\ttypeof value.id === \"string\" &&\n\t\t/^step-[1-9]\\d*$/.test(value.id) &&\n\t\ttypeof value.content === \"string\" &&\n\t\tvalue.content.length > 0 &&\n\t\tvalue.content.length <= MAX_TASK_STEP_CONTENT_LENGTH &&\n\t\thasOptionalString(value, \"activeForm\", MAX_TASK_STEP_CONTENT_LENGTH) &&\n\t\tisTaskStepStatus(value.status) &&\n\t\t(value.priority === undefined || isTaskStepPriority(value.priority)) &&\n\t\thasOptionalString(value, \"owner\", MAX_TASK_STEP_OWNER_LENGTH) &&\n\t\tisBoundedStringArray(value.notes, MAX_TASK_STEP_EVIDENCE, MAX_TASK_STEP_NOTE_LENGTH) &&\n\t\tisBoundedStringArray(value.evidence, MAX_TASK_STEP_EVIDENCE, MAX_TASK_STEP_EVIDENCE_LENGTH) &&\n\t\ttypeof value.createdAt === \"string\" &&\n\t\ttypeof value.updatedAt === \"string\"\n\t);\n}\n\nfunction isTaskStepsArchive(value: unknown): value is TaskStepsArchive {\n\tif (!isRecord(value)) return false;\n\treturn (\n\t\tNumber.isInteger(value.completed) &&\n\t\tNumber(value.completed) >= 0 &&\n\t\tNumber.isInteger(value.cancelled) &&\n\t\tNumber(value.cancelled) >= 0 &&\n\t\thasOptionalString(value, \"compactedAt\", 100)\n\t);\n}\n\nexport function isTaskStepsState(value: unknown): value is TaskStepsState {\n\tif (!isRecord(value)) return false;\n\tif (\n\t\tvalue.version !== 1 ||\n\t\t!Number.isInteger(value.revision) ||\n\t\tNumber(value.revision) < 0 ||\n\t\t!Number.isInteger(value.nextStepNumber) ||\n\t\tNumber(value.nextStepNumber) < 1 ||\n\t\t!Array.isArray(value.steps) ||\n\t\tvalue.steps.length > MAX_TASK_STEPS ||\n\t\t!value.steps.every(isTaskStep) ||\n\t\t!isTaskStepsArchive(value.archive) ||\n\t\ttypeof value.createdAt !== \"string\" ||\n\t\ttypeof value.updatedAt !== \"string\"\n\t) {\n\t\treturn false;\n\t}\n\tconst ids = new Set(value.steps.map((step) => step.id));\n\treturn ids.size === value.steps.length && value.steps.filter((step) => step.status === \"in_progress\").length <= 1;\n}\n\nfunction cloneTaskStep(step: TaskStep): TaskStep {\n\treturn { ...step, notes: [...step.notes], evidence: [...step.evidence] };\n}\n\nexport function cloneTaskStepsState(state: TaskStepsState): TaskStepsState {\n\treturn {\n\t\t...state,\n\t\tsteps: state.steps.map(cloneTaskStep),\n\t\tarchive: { ...state.archive },\n\t};\n}\n\nexport function createTaskStepsState(now: string): TaskStepsState {\n\treturn {\n\t\tversion: 1,\n\t\trevision: 0,\n\t\tnextStepNumber: 1,\n\t\tsteps: [],\n\t\tarchive: { completed: 0, cancelled: 0 },\n\t\tcreatedAt: now,\n\t\tupdatedAt: now,\n\t};\n}\n\nfunction requireBoundedText(value: string, label: string, maxLength: number): string {\n\tconst normalized = value.trim();\n\tif (!normalized) throw new TaskStepsError(`${label} is required.`);\n\tif (normalized.length > maxLength) throw new TaskStepsError(`${label} must be at most ${maxLength} characters.`);\n\treturn normalized;\n}\n\nfunction optionalBoundedText(value: string | undefined, label: string, maxLength: number): string | undefined {\n\tif (value === undefined) return undefined;\n\tconst normalized = value.trim();\n\tif (!normalized) return undefined;\n\tif (normalized.length > maxLength) throw new TaskStepsError(`${label} must be at most ${maxLength} characters.`);\n\treturn normalized;\n}\n\nfunction normalizeStrings(values: readonly string[] | undefined, label: string, maxLength: number): string[] {\n\tif (!values) return [];\n\tconst normalized: string[] = [];\n\tfor (const value of values) {\n\t\tconst item = requireBoundedText(value, label, maxLength);\n\t\tif (!normalized.includes(item)) normalized.push(item);\n\t}\n\tif (normalized.length > MAX_TASK_STEP_EVIDENCE) {\n\t\tthrow new TaskStepsError(`${label} supports at most ${MAX_TASK_STEP_EVIDENCE} entries.`);\n\t}\n\treturn normalized;\n}\n\nfunction appendUniqueStrings(\n\tcurrent: readonly string[],\n\tvalues: readonly string[] | undefined,\n\tlabel: string,\n\tmaxLength: number,\n): string[] {\n\tconst appended = [...current];\n\tfor (const value of normalizeStrings(values, label, maxLength)) {\n\t\tif (!appended.includes(value)) appended.push(value);\n\t}\n\tif (appended.length > MAX_TASK_STEP_EVIDENCE) {\n\t\tthrow new TaskStepsError(`${label} supports at most ${MAX_TASK_STEP_EVIDENCE} entries.`);\n\t}\n\treturn appended;\n}\n\nfunction normalizeInputNotes(input: TaskStepInput): string[] {\n\tconst notes = normalizeStrings(input.notes, \"Task step note\", MAX_TASK_STEP_NOTE_LENGTH);\n\tconst note = optionalBoundedText(input.note, \"Task step note\", MAX_TASK_STEP_NOTE_LENGTH);\n\tif (note && !notes.includes(note)) notes.push(note);\n\treturn notes;\n}\n\nfunction demoteOtherActiveSteps(steps: TaskStep[], activeIndex: number): void {\n\tfor (let index = 0; index < steps.length; index++) {\n\t\tif (index !== activeIndex && steps[index].status === \"in_progress\") {\n\t\t\tsteps[index] = { ...steps[index], status: \"pending\" };\n\t\t}\n\t}\n}\n\nfunction nextState(state: TaskStepsState, steps: readonly TaskStep[], now: string): TaskStepsState {\n\treturn {\n\t\t...state,\n\t\trevision: state.revision + 1,\n\t\tsteps: steps.map(cloneTaskStep),\n\t\tarchive: { ...state.archive },\n\t\tupdatedAt: now,\n\t};\n}\n\nfunction createStep(args: {\n\tinput: TaskStepInput;\n\tid: string;\n\tcreatedAt: string;\n\tupdatedAt: string;\n\texisting?: TaskStep;\n}): TaskStep {\n\tconst existing = args.existing;\n\tconst notes =\n\t\targs.input.note === undefined && args.input.notes === undefined\n\t\t\t? [...(existing?.notes ?? [])]\n\t\t\t: normalizeInputNotes(args.input);\n\tconst evidence =\n\t\targs.input.evidence === undefined\n\t\t\t? [...(existing?.evidence ?? [])]\n\t\t\t: normalizeStrings(args.input.evidence, \"Task step evidence\", MAX_TASK_STEP_EVIDENCE_LENGTH);\n\treturn {\n\t\tid: args.id,\n\t\tcontent: requireBoundedText(args.input.content, \"Task step content\", MAX_TASK_STEP_CONTENT_LENGTH),\n\t\tactiveForm:\n\t\t\targs.input.activeForm === undefined\n\t\t\t\t? existing?.activeForm\n\t\t\t\t: optionalBoundedText(args.input.activeForm, \"Task step active form\", MAX_TASK_STEP_CONTENT_LENGTH),\n\t\tstatus: args.input.status ?? existing?.status ?? \"pending\",\n\t\tpriority: args.input.priority ?? existing?.priority,\n\t\towner:\n\t\t\targs.input.owner === undefined\n\t\t\t\t? existing?.owner\n\t\t\t\t: optionalBoundedText(args.input.owner, \"Task step owner\", MAX_TASK_STEP_OWNER_LENGTH),\n\t\tnotes,\n\t\tevidence,\n\t\tcreatedAt: args.createdAt,\n\t\tupdatedAt: args.updatedAt,\n\t};\n}\n\nexport function setTaskSteps(state: TaskStepsState, inputs: readonly TaskStepInput[], now: string): TaskStepsState {\n\tif (inputs.length > MAX_TASK_STEPS) {\n\t\tthrow new TaskStepsError(`Task steps supports at most ${MAX_TASK_STEPS} steps.`);\n\t}\n\tconst existingByContent = new Map<string, TaskStep[]>();\n\tfor (const step of state.steps) {\n\t\tconst key = step.content.toLocaleLowerCase();\n\t\tconst matches = existingByContent.get(key) ?? [];\n\t\tmatches.push(step);\n\t\texistingByContent.set(key, matches);\n\t}\n\n\tlet nextStepNumber = state.nextStepNumber;\n\tconst steps = inputs.map((input) => {\n\t\tconst content = requireBoundedText(input.content, \"Task step content\", MAX_TASK_STEP_CONTENT_LENGTH);\n\t\tconst matches = existingByContent.get(content.toLocaleLowerCase());\n\t\tconst existing = matches?.shift();\n\t\tconst id = existing?.id ?? `step-${nextStepNumber++}`;\n\t\treturn createStep({\n\t\t\tinput: { ...input, content },\n\t\t\tid,\n\t\t\tcreatedAt: existing?.createdAt ?? now,\n\t\t\tupdatedAt: now,\n\t\t\texisting,\n\t\t});\n\t});\n\tconst activeIndex = steps.findLastIndex((step) => step.status === \"in_progress\");\n\tif (activeIndex >= 0) demoteOtherActiveSteps(steps, activeIndex);\n\treturn { ...nextState(state, steps, now), nextStepNumber };\n}\n\nexport function addTaskStep(state: TaskStepsState, input: TaskStepInput, now: string): TaskStepsState {\n\tif (state.steps.length >= MAX_TASK_STEPS) {\n\t\tthrow new TaskStepsError(`Task steps already has the maximum ${MAX_TASK_STEPS} steps.`);\n\t}\n\tconst step = createStep({ input, id: `step-${state.nextStepNumber}`, createdAt: now, updatedAt: now });\n\tconst steps = [...state.steps.map(cloneTaskStep), step];\n\tif (step.status === \"in_progress\") demoteOtherActiveSteps(steps, steps.length - 1);\n\treturn { ...nextState(state, steps, now), nextStepNumber: state.nextStepNumber + 1 };\n}\n\nexport function resolveTaskStepSelector(steps: readonly TaskStep[], selector: string): TaskStep {\n\tconst normalized = selector.trim().toLocaleLowerCase();\n\tif (!normalized) throw new TaskStepsError(\"Task step selector is required.\");\n\tif (normalized === \"current\" || normalized === \"active\") {\n\t\tconst active = steps.find((step) => step.status === \"in_progress\");\n\t\tif (!active) throw new TaskStepsError(\"No in_progress task step was found.\");\n\t\treturn active;\n\t}\n\n\tconst exactId = steps.find((step) => step.id.toLocaleLowerCase() === normalized);\n\tif (exactId) return exactId;\n\tconst idPrefix = steps.filter((step) => step.id.toLocaleLowerCase().startsWith(normalized));\n\tif (idPrefix.length === 1) return idPrefix[0];\n\tif (idPrefix.length > 1) {\n\t\tthrow new TaskStepsError(`Task step selector is ambiguous: ${idPrefix.map((step) => step.id).join(\", \")}.`);\n\t}\n\n\tconst exactContent = steps.filter((step) => step.content.toLocaleLowerCase() === normalized);\n\tif (exactContent.length === 1) return exactContent[0];\n\tconst contentMatches = steps.filter((step) => step.content.toLocaleLowerCase().includes(normalized));\n\tif (contentMatches.length === 1) return contentMatches[0];\n\tif (exactContent.length > 1 || contentMatches.length > 1) {\n\t\tconst matches = exactContent.length > 1 ? exactContent : contentMatches;\n\t\tthrow new TaskStepsError(`Task step selector is ambiguous: ${matches.map((step) => step.id).join(\", \")}.`);\n\t}\n\tthrow new TaskStepsError(`Task step not found for selector: ${selector}.`);\n}\n\nexport function updateTaskStep(\n\tstate: TaskStepsState,\n\tselector: string,\n\tupdate: TaskStepUpdate,\n\tnow: string,\n): TaskStepsState {\n\tconst selected = resolveTaskStepSelector(state.steps, selector);\n\tconst selectedIndex = state.steps.findIndex((step) => step.id === selected.id);\n\tconst steps = state.steps.map(cloneTaskStep);\n\tconst current = steps[selectedIndex];\n\tconst note = optionalBoundedText(update.note, \"Task step note\", MAX_TASK_STEP_NOTE_LENGTH);\n\tconst notes = note\n\t\t? appendUniqueStrings(current.notes, [note], \"Task step note\", MAX_TASK_STEP_NOTE_LENGTH)\n\t\t: [...current.notes];\n\tconst evidence = appendUniqueStrings(\n\t\tcurrent.evidence,\n\t\tupdate.evidence,\n\t\t\"Task step evidence\",\n\t\tMAX_TASK_STEP_EVIDENCE_LENGTH,\n\t);\n\tsteps[selectedIndex] = {\n\t\t...current,\n\t\tcontent:\n\t\t\tupdate.content === undefined\n\t\t\t\t? current.content\n\t\t\t\t: requireBoundedText(update.content, \"Task step content\", MAX_TASK_STEP_CONTENT_LENGTH),\n\t\tactiveForm:\n\t\t\tupdate.activeForm === undefined\n\t\t\t\t? current.activeForm\n\t\t\t\t: optionalBoundedText(update.activeForm, \"Task step active form\", MAX_TASK_STEP_CONTENT_LENGTH),\n\t\tstatus: update.status ?? current.status,\n\t\tpriority: update.priority ?? current.priority,\n\t\towner:\n\t\t\tupdate.owner === undefined\n\t\t\t\t? current.owner\n\t\t\t\t: optionalBoundedText(update.owner, \"Task step owner\", MAX_TASK_STEP_OWNER_LENGTH),\n\t\tnotes,\n\t\tevidence,\n\t\tupdatedAt: now,\n\t};\n\tif (steps[selectedIndex].status === \"in_progress\") demoteOtherActiveSteps(steps, selectedIndex);\n\treturn nextState(state, steps, now);\n}\n\nexport function clearTaskSteps(state: TaskStepsState, now: string): TaskStepsState {\n\treturn {\n\t\t...nextState(state, [], now),\n\t\tarchive: { completed: 0, cancelled: 0 },\n\t};\n}\n\nexport function compactTaskSteps(state: TaskStepsState, now: string): TaskStepsState {\n\tconst completed = state.steps.filter((step) => step.status === \"completed\").length;\n\tconst cancelled = state.steps.filter((step) => step.status === \"cancelled\").length;\n\tconst open = state.steps.filter((step) => step.status !== \"completed\" && step.status !== \"cancelled\");\n\treturn {\n\t\t...nextState(state, open, now),\n\t\tarchive: {\n\t\t\tcompleted: state.archive.completed + completed,\n\t\t\tcancelled: state.archive.cancelled + cancelled,\n\t\t\tcompactedAt: now,\n\t\t},\n\t};\n}\n\nexport function formatTaskSteps(\n\tstate: TaskStepsState,\n\toptions: { includeTerminal?: boolean; maxItems?: number } = {},\n): string {\n\tconst visible = options.includeTerminal\n\t\t? state.steps\n\t\t: state.steps.filter((step) => step.status !== \"completed\" && step.status !== \"cancelled\");\n\tconst maxItems = Math.max(1, Math.min(MAX_TASK_STEPS, Math.floor(options.maxItems ?? 20)));\n\tconst statusMarker: Record<TaskStepStatus, string> = {\n\t\tpending: \" \",\n\t\tin_progress: \">\",\n\t\tcompleted: \"x\",\n\t\tblocked: \"!\",\n\t\tcancelled: \"-\",\n\t};\n\tconst lines = [`Task steps (${visible.length} visible, ${state.steps.length} tracked):`];\n\tfor (const step of visible.slice(0, maxItems)) {\n\t\tconst details = [step.priority, step.owner].filter(Boolean).join(\", \");\n\t\tlines.push(\n\t\t\t`- [${statusMarker[step.status]}] ${step.id} ${step.activeForm || step.content}${details ? ` (${details})` : \"\"}`,\n\t\t);\n\t\tfor (const note of step.notes.slice(-2)) lines.push(`  note: ${note}`);\n\t\tfor (const evidence of step.evidence.slice(-2)) lines.push(`  evidence: ${evidence}`);\n\t}\n\tif (visible.length > maxItems) lines.push(`- … ${visible.length - maxItems} more`);\n\tif (state.archive.completed || state.archive.cancelled) {\n\t\tlines.push(\n\t\t\t`Archived terminal steps: ${state.archive.completed} completed, ${state.archive.cancelled} cancelled.`,\n\t\t);\n\t}\n\treturn lines.join(\"\\n\");\n}\n\nexport function formatTaskStepsContext(state: TaskStepsState, maxItems = 12): string | undefined {\n\tconst open = state.steps.filter((step) => step.status !== \"completed\" && step.status !== \"cancelled\");\n\tif (open.length === 0) return undefined;\n\tconst limit = Math.max(1, Math.min(MAX_TASK_STEPS, Math.floor(maxItems)));\n\tconst lines = [\n\t\t\"Current native task_steps context for this session:\",\n\t\t\"Open task_steps:\",\n\t\t...open.slice(0, limit).map((step) => `- [${step.status}] ${step.activeForm || step.content}`),\n\t];\n\tif (open.length > limit) lines.push(`- … ${open.length - limit} more open step(s)`);\n\tconst active = open.find((step) => step.status === \"in_progress\");\n\tlines.push(\n\t\t\"\",\n\t\tactive\n\t\t\t? `Continue the in_progress step first: ${active.activeForm || active.content}. Update it completed, blocked, or cancelled as soon as evidence is known.`\n\t\t\t: `No step is in_progress. Start the first open step before unrelated work: ${open[0].activeForm || open[0].content}.`,\n\t\t\"Use task_steps to keep this checklist current and leave no stale in_progress step before the final response.\",\n\t);\n\treturn lines.join(\"\\n\");\n}\n\nexport function serializeTaskStepsState(state: TaskStepsState): string {\n\treturn JSON.stringify(cloneTaskStepsState(state), null, 2);\n}\n\nexport function parseTaskStepsState(text: string): TaskStepsState | undefined {\n\ttry {\n\t\tconst parsed: unknown = JSON.parse(text);\n\t\treturn isTaskStepsState(parsed) ? cloneTaskStepsState(parsed) : undefined;\n\t} catch {\n\t\treturn undefined;\n\t}\n}\n"]}
+{"version":3,"file":"task-state.d.ts","sourceRoot":"","sources":["../../../src/core/tasks/task-state.ts"],"names":[],"mappings":"AAEA,eAAO,MAAM,kBAAkB,0EAA2E,CAAC;AAC3G,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEjE,eAAO,MAAM,oBAAoB,oCAAqC,CAAC;AACvE,MAAM,MAAM,gBAAgB,GAAG,CAAC,OAAO,oBAAoB,CAAC,CAAC,MAAM,CAAC,CAAC;AAErE,eAAO,MAAM,cAAc,MAAM,CAAC;AAClC,eAAO,MAAM,4BAA4B,OAAQ,CAAC;AAQlD,MAAM,WAAW,aAAa;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,cAAc,CAAC;IACxB,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,cAAc,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1B,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC7B;AAED,MAAM,WAAW,QAAQ;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,cAAc,CAAC;IACvB,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,wGAAwG;IACxG,cAAc,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IACzB,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,gBAAgB;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,cAAc;IAC9B,OAAO,EAAE,CAAC,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,cAAc,EAAE,MAAM,CAAC;IACvB,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC3B,OAAO,EAAE,gBAAgB,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,cAAc;IAC9B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,cAAc,CAAC;IACxB,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,cAAc,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC7B;AAED,qBAAa,cAAe,SAAQ,KAAK;IACxC,YAAY,OAAO,EAAE,MAAM,EAG1B;CACD;AAuDD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,cAAc,CAmBxE;AAWD,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,cAAc,GAAG,cAAc,CAMzE;AAED,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,MAAM,GAAG,cAAc,CAUhE;AAqDD;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS,CAOvG;AAED,4FAA4F;AAC5F,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO,CAEzE;AA6DD,wBAAgB,YAAY,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,aAAa,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,cAAc,CA6BjH;AAED,wBAAgB,WAAW,CAAC,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,GAAG,cAAc,CAYpG;AAED,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,EAAE,QAAQ,EAAE,MAAM,GAAG,QAAQ,CA0B9F;AAED,wBAAgB,cAAc,CAC7B,KAAK,EAAE,cAAc,EACrB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,cAAc,EACtB,GAAG,EAAE,MAAM,GACT,cAAc,CAyChB;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,MAAM,GAAG,cAAc,CAKjF;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,MAAM,GAAG,cAAc,CAYnF;AAED,wBAAgB,eAAe,CAC9B,KAAK,EAAE,cAAc,EACrB,OAAO,GAAE;IAAE,eAAe,CAAC,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5D,MAAM,CAkCR;AAED,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,SAAK,GAAG,MAAM,GAAG,SAAS,CA4B/F;AAED,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,CAErE;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS,CAO5E","sourcesContent":["import { isPlainRecord } from \"../util/value-guards.ts\";\n\nexport const TASK_STEP_STATUSES = [\"pending\", \"in_progress\", \"completed\", \"blocked\", \"cancelled\"] as const;\nexport type TaskStepStatus = (typeof TASK_STEP_STATUSES)[number];\n\nexport const TASK_STEP_PRIORITIES = [\"low\", \"normal\", \"high\"] as const;\nexport type TaskStepPriority = (typeof TASK_STEP_PRIORITIES)[number];\n\nexport const MAX_TASK_STEPS = 100;\nexport const MAX_TASK_STEP_CONTENT_LENGTH = 2_000;\nconst MAX_TASK_STEP_NOTE_LENGTH = 4_000;\nconst MAX_TASK_STEP_OWNER_LENGTH = 200;\nconst MAX_TASK_STEP_EVIDENCE = 32;\nconst MAX_TASK_STEP_EVIDENCE_LENGTH = 2_000;\nconst MAX_TASK_STEP_REQUIREMENTS = 32;\nconst MAX_TASK_STEP_REQUIREMENT_ID_LENGTH = 200;\n\nexport interface TaskStepInput {\n\tcontent: string;\n\tactiveForm?: string;\n\tstatus?: TaskStepStatus;\n\tpriority?: TaskStepPriority;\n\towner?: string;\n\trequirementIds?: readonly string[];\n\tnote?: string;\n\tnotes?: readonly string[];\n\tevidence?: readonly string[];\n}\n\nexport interface TaskStep {\n\tid: string;\n\tcontent: string;\n\tactiveForm?: string;\n\tstatus: TaskStepStatus;\n\tpriority?: TaskStepPriority;\n\towner?: string;\n\t/** Goal requirements this foreground step advances. Optional only for snapshots from older sessions. */\n\trequirementIds?: readonly string[];\n\tnotes: readonly string[];\n\tevidence: readonly string[];\n\tcreatedAt: string;\n\tupdatedAt: string;\n}\n\nexport interface TaskStepsArchive {\n\tcompleted: number;\n\tcancelled: number;\n\tcompactedAt?: string;\n}\n\nexport interface TaskStepsState {\n\tversion: 1;\n\trevision: number;\n\tnextStepNumber: number;\n\tsteps: readonly TaskStep[];\n\tarchive: TaskStepsArchive;\n\tcreatedAt: string;\n\tupdatedAt: string;\n}\n\nexport interface TaskStepUpdate {\n\tcontent?: string;\n\tactiveForm?: string;\n\tstatus?: TaskStepStatus;\n\tpriority?: TaskStepPriority;\n\towner?: string;\n\trequirementIds?: readonly string[];\n\tnote?: string;\n\tevidence?: readonly string[];\n}\n\nexport class TaskStepsError extends Error {\n\tconstructor(message: string) {\n\t\tsuper(message);\n\t\tthis.name = \"TaskStepsError\";\n\t}\n}\n\nfunction isTaskStepStatus(value: unknown): value is TaskStepStatus {\n\treturn TASK_STEP_STATUSES.some((status) => status === value);\n}\n\nfunction isTaskStepPriority(value: unknown): value is TaskStepPriority {\n\treturn TASK_STEP_PRIORITIES.some((priority) => priority === value);\n}\n\nfunction hasOptionalString(record: Record<string, unknown>, key: string, maxLength: number): boolean {\n\tconst value = record[key];\n\treturn value === undefined || (typeof value === \"string\" && value.length <= maxLength);\n}\n\nfunction isBoundedStringArray(value: unknown, maxItems: number, maxLength: number): value is readonly string[] {\n\treturn (\n\t\tArray.isArray(value) &&\n\t\tvalue.length <= maxItems &&\n\t\tvalue.every((item) => typeof item === \"string\" && item.length > 0 && item.length <= maxLength)\n\t);\n}\n\nfunction isTaskStep(value: unknown): value is TaskStep {\n\tif (!isPlainRecord(value)) return false;\n\treturn (\n\t\ttypeof value.id === \"string\" &&\n\t\t/^step-[1-9]\\d*$/.test(value.id) &&\n\t\ttypeof value.content === \"string\" &&\n\t\tvalue.content.length > 0 &&\n\t\tvalue.content.length <= MAX_TASK_STEP_CONTENT_LENGTH &&\n\t\thasOptionalString(value, \"activeForm\", MAX_TASK_STEP_CONTENT_LENGTH) &&\n\t\tisTaskStepStatus(value.status) &&\n\t\t(value.priority === undefined || isTaskStepPriority(value.priority)) &&\n\t\thasOptionalString(value, \"owner\", MAX_TASK_STEP_OWNER_LENGTH) &&\n\t\t(value.requirementIds === undefined ||\n\t\t\tisBoundedStringArray(value.requirementIds, MAX_TASK_STEP_REQUIREMENTS, MAX_TASK_STEP_REQUIREMENT_ID_LENGTH)) &&\n\t\tisBoundedStringArray(value.notes, MAX_TASK_STEP_EVIDENCE, MAX_TASK_STEP_NOTE_LENGTH) &&\n\t\tisBoundedStringArray(value.evidence, MAX_TASK_STEP_EVIDENCE, MAX_TASK_STEP_EVIDENCE_LENGTH) &&\n\t\ttypeof value.createdAt === \"string\" &&\n\t\ttypeof value.updatedAt === \"string\"\n\t);\n}\n\nfunction isTaskStepsArchive(value: unknown): value is TaskStepsArchive {\n\tif (!isPlainRecord(value)) return false;\n\treturn (\n\t\tNumber.isInteger(value.completed) &&\n\t\tNumber(value.completed) >= 0 &&\n\t\tNumber.isInteger(value.cancelled) &&\n\t\tNumber(value.cancelled) >= 0 &&\n\t\thasOptionalString(value, \"compactedAt\", 100)\n\t);\n}\n\nexport function isTaskStepsState(value: unknown): value is TaskStepsState {\n\tif (!isPlainRecord(value)) return false;\n\tif (\n\t\tvalue.version !== 1 ||\n\t\t!Number.isInteger(value.revision) ||\n\t\tNumber(value.revision) < 0 ||\n\t\t!Number.isInteger(value.nextStepNumber) ||\n\t\tNumber(value.nextStepNumber) < 1 ||\n\t\t!Array.isArray(value.steps) ||\n\t\tvalue.steps.length > MAX_TASK_STEPS ||\n\t\t!value.steps.every(isTaskStep) ||\n\t\t!isTaskStepsArchive(value.archive) ||\n\t\ttypeof value.createdAt !== \"string\" ||\n\t\ttypeof value.updatedAt !== \"string\"\n\t) {\n\t\treturn false;\n\t}\n\tconst ids = new Set(value.steps.map((step) => step.id));\n\treturn ids.size === value.steps.length && value.steps.filter((step) => step.status === \"in_progress\").length <= 1;\n}\n\nfunction cloneTaskStep(step: TaskStep): TaskStep {\n\treturn {\n\t\t...step,\n\t\trequirementIds: [...(step.requirementIds ?? [])],\n\t\tnotes: [...step.notes],\n\t\tevidence: [...step.evidence],\n\t};\n}\n\nexport function cloneTaskStepsState(state: TaskStepsState): TaskStepsState {\n\treturn {\n\t\t...state,\n\t\tsteps: state.steps.map(cloneTaskStep),\n\t\tarchive: { ...state.archive },\n\t};\n}\n\nexport function createTaskStepsState(now: string): TaskStepsState {\n\treturn {\n\t\tversion: 1,\n\t\trevision: 0,\n\t\tnextStepNumber: 1,\n\t\tsteps: [],\n\t\tarchive: { completed: 0, cancelled: 0 },\n\t\tcreatedAt: now,\n\t\tupdatedAt: now,\n\t};\n}\n\nfunction requireBoundedText(value: string, label: string, maxLength: number): string {\n\tconst normalized = value.trim();\n\tif (!normalized) throw new TaskStepsError(`${label} is required.`);\n\tif (normalized.length > maxLength) throw new TaskStepsError(`${label} must be at most ${maxLength} characters.`);\n\treturn normalized;\n}\n\nfunction optionalBoundedText(value: string | undefined, label: string, maxLength: number): string | undefined {\n\tif (value === undefined) return undefined;\n\tconst normalized = value.trim();\n\tif (!normalized) return undefined;\n\tif (normalized.length > maxLength) throw new TaskStepsError(`${label} must be at most ${maxLength} characters.`);\n\treturn normalized;\n}\n\nfunction normalizeStrings(values: readonly string[] | undefined, label: string, maxLength: number): string[] {\n\tif (!values) return [];\n\tconst normalized: string[] = [];\n\tfor (const value of values) {\n\t\tconst item = requireBoundedText(value, label, maxLength);\n\t\tif (!normalized.includes(item)) normalized.push(item);\n\t}\n\tif (normalized.length > MAX_TASK_STEP_EVIDENCE) {\n\t\tthrow new TaskStepsError(`${label} supports at most ${MAX_TASK_STEP_EVIDENCE} entries.`);\n\t}\n\treturn normalized;\n}\n\nfunction appendUniqueStrings(\n\tcurrent: readonly string[],\n\tvalues: readonly string[] | undefined,\n\tlabel: string,\n\tmaxLength: number,\n): string[] {\n\tconst appended = [...current];\n\tfor (const value of normalizeStrings(values, label, maxLength)) {\n\t\tif (!appended.includes(value)) appended.push(value);\n\t}\n\tif (appended.length > MAX_TASK_STEP_EVIDENCE) {\n\t\tthrow new TaskStepsError(`${label} supports at most ${MAX_TASK_STEP_EVIDENCE} entries.`);\n\t}\n\treturn appended;\n}\n\nfunction normalizeInputNotes(input: TaskStepInput): string[] {\n\tconst notes = normalizeStrings(input.notes, \"Task step note\", MAX_TASK_STEP_NOTE_LENGTH);\n\tconst note = optionalBoundedText(input.note, \"Task step note\", MAX_TASK_STEP_NOTE_LENGTH);\n\tif (note && !notes.includes(note)) notes.push(note);\n\treturn notes;\n}\n\n/**\n * Find an OPEN (non-terminal) step whose content matches `content` case-insensitively.\n * Terminal steps (completed/cancelled) are deliberately excluded so a legitimate re-add of\n * previously finished work still creates a new step.\n */\nexport function findOpenDuplicateStep(steps: readonly TaskStep[], content: string): TaskStep | undefined {\n\tconst normalized = content.trim().toLocaleLowerCase();\n\tif (!normalized) return undefined;\n\treturn steps.find(\n\t\t(step) =>\n\t\t\tstep.status !== \"completed\" && step.status !== \"cancelled\" && step.content.toLocaleLowerCase() === normalized,\n\t);\n}\n\n/** True when a completed step has no evidence attached (a verification nudge candidate). */\nexport function hasUnverifiedCompletedStep(state: TaskStepsState): boolean {\n\treturn state.steps.some((step) => step.status === \"completed\" && step.evidence.length === 0);\n}\n\nfunction demoteOtherActiveSteps(steps: TaskStep[], activeIndex: number): void {\n\tfor (let index = 0; index < steps.length; index++) {\n\t\tif (index !== activeIndex && steps[index].status === \"in_progress\") {\n\t\t\tsteps[index] = { ...steps[index], status: \"pending\" };\n\t\t}\n\t}\n}\n\nfunction nextState(state: TaskStepsState, steps: readonly TaskStep[], now: string): TaskStepsState {\n\treturn {\n\t\t...state,\n\t\trevision: state.revision + 1,\n\t\tsteps: steps.map(cloneTaskStep),\n\t\tarchive: { ...state.archive },\n\t\tupdatedAt: now,\n\t};\n}\n\nfunction createStep(args: {\n\tinput: TaskStepInput;\n\tid: string;\n\tcreatedAt: string;\n\tupdatedAt: string;\n\texisting?: TaskStep;\n}): TaskStep {\n\tconst existing = args.existing;\n\tconst notes =\n\t\targs.input.note === undefined && args.input.notes === undefined\n\t\t\t? [...(existing?.notes ?? [])]\n\t\t\t: normalizeInputNotes(args.input);\n\tconst evidence =\n\t\targs.input.evidence === undefined\n\t\t\t? [...(existing?.evidence ?? [])]\n\t\t\t: normalizeStrings(args.input.evidence, \"Task step evidence\", MAX_TASK_STEP_EVIDENCE_LENGTH);\n\tconst requirementIds =\n\t\targs.input.requirementIds === undefined\n\t\t\t? [...(existing?.requirementIds ?? [])]\n\t\t\t: normalizeStrings(args.input.requirementIds, \"Task step requirement id\", MAX_TASK_STEP_REQUIREMENT_ID_LENGTH);\n\treturn {\n\t\tid: args.id,\n\t\tcontent: requireBoundedText(args.input.content, \"Task step content\", MAX_TASK_STEP_CONTENT_LENGTH),\n\t\tactiveForm:\n\t\t\targs.input.activeForm === undefined\n\t\t\t\t? existing?.activeForm\n\t\t\t\t: optionalBoundedText(args.input.activeForm, \"Task step active form\", MAX_TASK_STEP_CONTENT_LENGTH),\n\t\tstatus: args.input.status ?? existing?.status ?? \"pending\",\n\t\tpriority: args.input.priority ?? existing?.priority,\n\t\towner:\n\t\t\targs.input.owner === undefined\n\t\t\t\t? existing?.owner\n\t\t\t\t: optionalBoundedText(args.input.owner, \"Task step owner\", MAX_TASK_STEP_OWNER_LENGTH),\n\t\trequirementIds,\n\t\tnotes,\n\t\tevidence,\n\t\tcreatedAt: args.createdAt,\n\t\tupdatedAt: args.updatedAt,\n\t};\n}\n\nexport function setTaskSteps(state: TaskStepsState, inputs: readonly TaskStepInput[], now: string): TaskStepsState {\n\tif (inputs.length > MAX_TASK_STEPS) {\n\t\tthrow new TaskStepsError(`Task steps supports at most ${MAX_TASK_STEPS} steps.`);\n\t}\n\tconst existingByContent = new Map<string, TaskStep[]>();\n\tfor (const step of state.steps) {\n\t\tconst key = step.content.toLocaleLowerCase();\n\t\tconst matches = existingByContent.get(key) ?? [];\n\t\tmatches.push(step);\n\t\texistingByContent.set(key, matches);\n\t}\n\n\tlet nextStepNumber = state.nextStepNumber;\n\tconst steps = inputs.map((input) => {\n\t\tconst content = requireBoundedText(input.content, \"Task step content\", MAX_TASK_STEP_CONTENT_LENGTH);\n\t\tconst matches = existingByContent.get(content.toLocaleLowerCase());\n\t\tconst existing = matches?.shift();\n\t\tconst id = existing?.id ?? `step-${nextStepNumber++}`;\n\t\treturn createStep({\n\t\t\tinput: { ...input, content },\n\t\t\tid,\n\t\t\tcreatedAt: existing?.createdAt ?? now,\n\t\t\tupdatedAt: now,\n\t\t\texisting,\n\t\t});\n\t});\n\tconst activeIndex = steps.findLastIndex((step) => step.status === \"in_progress\");\n\tif (activeIndex >= 0) demoteOtherActiveSteps(steps, activeIndex);\n\treturn { ...nextState(state, steps, now), nextStepNumber };\n}\n\nexport function addTaskStep(state: TaskStepsState, input: TaskStepInput, now: string): TaskStepsState {\n\t// Dedupe against OPEN steps only, before the capacity check: a duplicate re-add of an\n\t// already-open step is a no-op regardless of whether the list happens to be full. Terminal\n\t// (completed/cancelled) matches are excluded so a legitimate re-add still creates a step.\n\tif (findOpenDuplicateStep(state.steps, input.content)) return state;\n\tif (state.steps.length >= MAX_TASK_STEPS) {\n\t\tthrow new TaskStepsError(`Task steps already has the maximum ${MAX_TASK_STEPS} steps.`);\n\t}\n\tconst step = createStep({ input, id: `step-${state.nextStepNumber}`, createdAt: now, updatedAt: now });\n\tconst steps = [...state.steps.map(cloneTaskStep), step];\n\tif (step.status === \"in_progress\") demoteOtherActiveSteps(steps, steps.length - 1);\n\treturn { ...nextState(state, steps, now), nextStepNumber: state.nextStepNumber + 1 };\n}\n\nexport function resolveTaskStepSelector(steps: readonly TaskStep[], selector: string): TaskStep {\n\tconst normalized = selector.trim().toLocaleLowerCase();\n\tif (!normalized) throw new TaskStepsError(\"Task step selector is required.\");\n\tif (normalized === \"current\" || normalized === \"active\") {\n\t\tconst active = steps.find((step) => step.status === \"in_progress\");\n\t\tif (!active) throw new TaskStepsError(\"No in_progress task step was found.\");\n\t\treturn active;\n\t}\n\n\tconst exactId = steps.find((step) => step.id.toLocaleLowerCase() === normalized);\n\tif (exactId) return exactId;\n\tconst idPrefix = steps.filter((step) => step.id.toLocaleLowerCase().startsWith(normalized));\n\tif (idPrefix.length === 1) return idPrefix[0];\n\tif (idPrefix.length > 1) {\n\t\tthrow new TaskStepsError(`Task step selector is ambiguous: ${idPrefix.map((step) => step.id).join(\", \")}.`);\n\t}\n\n\tconst exactContent = steps.filter((step) => step.content.toLocaleLowerCase() === normalized);\n\tif (exactContent.length === 1) return exactContent[0];\n\tconst contentMatches = steps.filter((step) => step.content.toLocaleLowerCase().includes(normalized));\n\tif (contentMatches.length === 1) return contentMatches[0];\n\tif (exactContent.length > 1 || contentMatches.length > 1) {\n\t\tconst matches = exactContent.length > 1 ? exactContent : contentMatches;\n\t\tthrow new TaskStepsError(`Task step selector is ambiguous: ${matches.map((step) => step.id).join(\", \")}.`);\n\t}\n\tthrow new TaskStepsError(`Task step not found for selector: ${selector}.`);\n}\n\nexport function updateTaskStep(\n\tstate: TaskStepsState,\n\tselector: string,\n\tupdate: TaskStepUpdate,\n\tnow: string,\n): TaskStepsState {\n\tconst selected = resolveTaskStepSelector(state.steps, selector);\n\tconst selectedIndex = state.steps.findIndex((step) => step.id === selected.id);\n\tconst steps = state.steps.map(cloneTaskStep);\n\tconst current = steps[selectedIndex];\n\tconst note = optionalBoundedText(update.note, \"Task step note\", MAX_TASK_STEP_NOTE_LENGTH);\n\tconst notes = note\n\t\t? appendUniqueStrings(current.notes, [note], \"Task step note\", MAX_TASK_STEP_NOTE_LENGTH)\n\t\t: [...current.notes];\n\tconst evidence = appendUniqueStrings(\n\t\tcurrent.evidence,\n\t\tupdate.evidence,\n\t\t\"Task step evidence\",\n\t\tMAX_TASK_STEP_EVIDENCE_LENGTH,\n\t);\n\tsteps[selectedIndex] = {\n\t\t...current,\n\t\tcontent:\n\t\t\tupdate.content === undefined\n\t\t\t\t? current.content\n\t\t\t\t: requireBoundedText(update.content, \"Task step content\", MAX_TASK_STEP_CONTENT_LENGTH),\n\t\tactiveForm:\n\t\t\tupdate.activeForm === undefined\n\t\t\t\t? current.activeForm\n\t\t\t\t: optionalBoundedText(update.activeForm, \"Task step active form\", MAX_TASK_STEP_CONTENT_LENGTH),\n\t\tstatus: update.status ?? current.status,\n\t\tpriority: update.priority ?? current.priority,\n\t\towner:\n\t\t\tupdate.owner === undefined\n\t\t\t\t? current.owner\n\t\t\t\t: optionalBoundedText(update.owner, \"Task step owner\", MAX_TASK_STEP_OWNER_LENGTH),\n\t\trequirementIds:\n\t\t\tupdate.requirementIds === undefined\n\t\t\t\t? [...(current.requirementIds ?? [])]\n\t\t\t\t: normalizeStrings(update.requirementIds, \"Task step requirement id\", MAX_TASK_STEP_REQUIREMENT_ID_LENGTH),\n\t\tnotes,\n\t\tevidence,\n\t\tupdatedAt: now,\n\t};\n\tif (steps[selectedIndex].status === \"in_progress\") demoteOtherActiveSteps(steps, selectedIndex);\n\treturn nextState(state, steps, now);\n}\n\nexport function clearTaskSteps(state: TaskStepsState, now: string): TaskStepsState {\n\treturn {\n\t\t...nextState(state, [], now),\n\t\tarchive: { completed: 0, cancelled: 0 },\n\t};\n}\n\nexport function compactTaskSteps(state: TaskStepsState, now: string): TaskStepsState {\n\tconst completed = state.steps.filter((step) => step.status === \"completed\").length;\n\tconst cancelled = state.steps.filter((step) => step.status === \"cancelled\").length;\n\tconst open = state.steps.filter((step) => step.status !== \"completed\" && step.status !== \"cancelled\");\n\treturn {\n\t\t...nextState(state, open, now),\n\t\tarchive: {\n\t\t\tcompleted: state.archive.completed + completed,\n\t\t\tcancelled: state.archive.cancelled + cancelled,\n\t\t\tcompactedAt: now,\n\t\t},\n\t};\n}\n\nexport function formatTaskSteps(\n\tstate: TaskStepsState,\n\toptions: { includeTerminal?: boolean; maxItems?: number } = {},\n): string {\n\tconst visible = options.includeTerminal\n\t\t? state.steps\n\t\t: state.steps.filter((step) => step.status !== \"completed\" && step.status !== \"cancelled\");\n\tconst maxItems = Math.max(1, Math.min(MAX_TASK_STEPS, Math.floor(options.maxItems ?? 20)));\n\tconst statusMarker: Record<TaskStepStatus, string> = {\n\t\tpending: \" \",\n\t\tin_progress: \">\",\n\t\tcompleted: \"x\",\n\t\tblocked: \"!\",\n\t\tcancelled: \"-\",\n\t};\n\tconst lines = [`Task steps (${visible.length} visible, ${state.steps.length} tracked):`];\n\tfor (const step of visible.slice(0, maxItems)) {\n\t\tconst details = [\n\t\t\tstep.priority,\n\t\t\tstep.owner,\n\t\t\tstep.requirementIds?.length ? `requirements: ${step.requirementIds.join(\", \")}` : undefined,\n\t\t]\n\t\t\t.filter(Boolean)\n\t\t\t.join(\", \");\n\t\tlines.push(\n\t\t\t`- [${statusMarker[step.status]}] ${step.id} ${step.activeForm || step.content}${details ? ` (${details})` : \"\"}`,\n\t\t);\n\t\tfor (const note of step.notes.slice(-2)) lines.push(`  note: ${note}`);\n\t\tfor (const evidence of step.evidence.slice(-2)) lines.push(`  evidence: ${evidence}`);\n\t}\n\tif (visible.length > maxItems) lines.push(`- … ${visible.length - maxItems} more`);\n\tif (state.archive.completed || state.archive.cancelled) {\n\t\tlines.push(\n\t\t\t`Archived terminal steps: ${state.archive.completed} completed, ${state.archive.cancelled} cancelled.`,\n\t\t);\n\t}\n\treturn lines.join(\"\\n\");\n}\n\nexport function formatTaskStepsContext(state: TaskStepsState, maxItems = 12): string | undefined {\n\tconst open = state.steps.filter((step) => step.status !== \"completed\" && step.status !== \"cancelled\");\n\tif (open.length === 0) return undefined;\n\tconst limit = Math.max(1, Math.min(MAX_TASK_STEPS, Math.floor(maxItems)));\n\tconst lines = [\n\t\t\"Current native task_steps context for this session:\",\n\t\t\"Open task_steps:\",\n\t\t...open.slice(0, limit).map((step) => `- [${step.status}] ${step.activeForm || step.content}`),\n\t];\n\tif (open.length > limit) lines.push(`- … ${open.length - limit} more open step(s)`);\n\tconst active = open.find((step) => step.status === \"in_progress\");\n\tlines.push(\n\t\t\"\",\n\t\tactive\n\t\t\t? `Continue the in_progress step first: ${active.activeForm || active.content}. Update it completed, blocked, or cancelled as soon as evidence is known.`\n\t\t\t: `No step is in_progress. Start the first open step before unrelated work: ${open[0].activeForm || open[0].content}.`,\n\t\t\"Use task_steps to keep this checklist current and leave no stale in_progress step before the final response.\",\n\t);\n\tif (hasUnverifiedCompletedStep(state)) {\n\t\tlines.push(\n\t\t\t\"A completed step has no evidence attached; attach evidence via task_steps update before treating it as verified.\",\n\t\t);\n\t}\n\t// Wrapped in a marker (mirrors the <memory_context> precedent) so context-gc's\n\t// semantic-memory packer can recognize this as a deterministic, re-derivable context page and\n\t// pack stale copies down to the most recent one instead of letting a full page accumulate every\n\t// turn. The revision (monotonic per mutation) lets a reader tell which page is current.\n\treturn `<task_steps_context revision=${state.revision}>\\n${lines.join(\"\\n\")}\\n</task_steps_context>`;\n}\n\nexport function serializeTaskStepsState(state: TaskStepsState): string {\n\treturn JSON.stringify(cloneTaskStepsState(state), null, 2);\n}\n\nexport function parseTaskStepsState(text: string): TaskStepsState | undefined {\n\ttry {\n\t\tconst parsed: unknown = JSON.parse(text);\n\t\treturn isTaskStepsState(parsed) ? cloneTaskStepsState(parsed) : undefined;\n\t} catch {\n\t\treturn undefined;\n\t}\n}\n"]}

package/dist/core/tasks/task-state.js

@@ -1,3 +1,4 @@
+import { isPlainRecord } from "../util/value-guards.js";
 export const TASK_STEP_STATUSES = ["pending", "in_progress", "completed", "blocked", "cancelled"];
 export const TASK_STEP_PRIORITIES = ["low", "normal", "high"];
 export const MAX_TASK_STEPS = 100;
@@ -6,18 +7,14 @@ const MAX_TASK_STEP_NOTE_LENGTH = 4_000;
 const MAX_TASK_STEP_OWNER_LENGTH = 200;
 const MAX_TASK_STEP_EVIDENCE = 32;
 const MAX_TASK_STEP_EVIDENCE_LENGTH = 2_000;
+const MAX_TASK_STEP_REQUIREMENTS = 32;
+const MAX_TASK_STEP_REQUIREMENT_ID_LENGTH = 200;
 export class TaskStepsError extends Error {
     constructor(message) {
         super(message);
         this.name = "TaskStepsError";
     }
 }
-function isRecord(value) {
-    if (!value || typeof value !== "object" || Array.isArray(value))
-        return false;
-    const prototype = Object.getPrototypeOf(value);
-    return prototype === Object.prototype || prototype === null;
-}
 function isTaskStepStatus(value) {
     return TASK_STEP_STATUSES.some((status) => status === value);
 }
@@ -34,7 +31,7 @@ function isBoundedStringArray(value, maxItems, maxLength) {
         value.every((item) => typeof item === "string" && item.length > 0 && item.length <= maxLength));
 }
 function isTaskStep(value) {
-    if (!isRecord(value))
+    if (!isPlainRecord(value))
         return false;
     return (typeof value.id === "string" &&
         /^step-[1-9]\d*$/.test(value.id) &&
@@ -45,13 +42,15 @@ function isTaskStep(value) {
         isTaskStepStatus(value.status) &&
         (value.priority === undefined || isTaskStepPriority(value.priority)) &&
         hasOptionalString(value, "owner", MAX_TASK_STEP_OWNER_LENGTH) &&
+        (value.requirementIds === undefined ||
+            isBoundedStringArray(value.requirementIds, MAX_TASK_STEP_REQUIREMENTS, MAX_TASK_STEP_REQUIREMENT_ID_LENGTH)) &&
         isBoundedStringArray(value.notes, MAX_TASK_STEP_EVIDENCE, MAX_TASK_STEP_NOTE_LENGTH) &&
         isBoundedStringArray(value.evidence, MAX_TASK_STEP_EVIDENCE, MAX_TASK_STEP_EVIDENCE_LENGTH) &&
         typeof value.createdAt === "string" &&
         typeof value.updatedAt === "string");
 }
 function isTaskStepsArchive(value) {
-    if (!isRecord(value))
+    if (!isPlainRecord(value))
         return false;
     return (Number.isInteger(value.completed) &&
         Number(value.completed) >= 0 &&
@@ -60,7 +59,7 @@ function isTaskStepsArchive(value) {
         hasOptionalString(value, "compactedAt", 100));
 }
 export function isTaskStepsState(value) {
-    if (!isRecord(value))
+    if (!isPlainRecord(value))
         return false;
     if (value.version !== 1 ||
         !Number.isInteger(value.revision) ||
@@ -79,7 +78,12 @@ export function isTaskStepsState(value) {
     return ids.size === value.steps.length && value.steps.filter((step) => step.status === "in_progress").length <= 1;
 }
 function cloneTaskStep(step) {
-    return { ...step, notes: [...step.notes], evidence: [...step.evidence] };
+    return {
+        ...step,
+        requirementIds: [...(step.requirementIds ?? [])],
+        notes: [...step.notes],
+        evidence: [...step.evidence],
+    };
 }
 export function cloneTaskStepsState(state) {
     return {
@@ -149,6 +153,21 @@ function normalizeInputNotes(input) {
         notes.push(note);
     return notes;
 }
+/**
+ * Find an OPEN (non-terminal) step whose content matches `content` case-insensitively.
+ * Terminal steps (completed/cancelled) are deliberately excluded so a legitimate re-add of
+ * previously finished work still creates a new step.
+ */
+export function findOpenDuplicateStep(steps, content) {
+    const normalized = content.trim().toLocaleLowerCase();
+    if (!normalized)
+        return undefined;
+    return steps.find((step) => step.status !== "completed" && step.status !== "cancelled" && step.content.toLocaleLowerCase() === normalized);
+}
+/** True when a completed step has no evidence attached (a verification nudge candidate). */
+export function hasUnverifiedCompletedStep(state) {
+    return state.steps.some((step) => step.status === "completed" && step.evidence.length === 0);
+}
 function demoteOtherActiveSteps(steps, activeIndex) {
     for (let index = 0; index < steps.length; index++) {
         if (index !== activeIndex && steps[index].status === "in_progress") {
@@ -173,6 +192,9 @@ function createStep(args) {
     const evidence = args.input.evidence === undefined
         ? [...(existing?.evidence ?? [])]
         : normalizeStrings(args.input.evidence, "Task step evidence", MAX_TASK_STEP_EVIDENCE_LENGTH);
+    const requirementIds = args.input.requirementIds === undefined
+        ? [...(existing?.requirementIds ?? [])]
+        : normalizeStrings(args.input.requirementIds, "Task step requirement id", MAX_TASK_STEP_REQUIREMENT_ID_LENGTH);
     return {
         id: args.id,
         content: requireBoundedText(args.input.content, "Task step content", MAX_TASK_STEP_CONTENT_LENGTH),
@@ -184,6 +206,7 @@ function createStep(args) {
         owner: args.input.owner === undefined
             ? existing?.owner
             : optionalBoundedText(args.input.owner, "Task step owner", MAX_TASK_STEP_OWNER_LENGTH),
+        requirementIds,
         notes,
         evidence,
         createdAt: args.createdAt,
@@ -221,6 +244,11 @@ export function setTaskSteps(state, inputs, now) {
     return { ...nextState(state, steps, now), nextStepNumber };
 }
 export function addTaskStep(state, input, now) {
+    // Dedupe against OPEN steps only, before the capacity check: a duplicate re-add of an
+    // already-open step is a no-op regardless of whether the list happens to be full. Terminal
+    // (completed/cancelled) matches are excluded so a legitimate re-add still creates a step.
+    if (findOpenDuplicateStep(state.steps, input.content))
+        return state;
     if (state.steps.length >= MAX_TASK_STEPS) {
         throw new TaskStepsError(`Task steps already has the maximum ${MAX_TASK_STEPS} steps.`);
     }
@@ -284,6 +312,9 @@ export function updateTaskStep(state, selector, update, now) {
         owner: update.owner === undefined
             ? current.owner
             : optionalBoundedText(update.owner, "Task step owner", MAX_TASK_STEP_OWNER_LENGTH),
+        requirementIds: update.requirementIds === undefined
+            ? [...(current.requirementIds ?? [])]
+            : normalizeStrings(update.requirementIds, "Task step requirement id", MAX_TASK_STEP_REQUIREMENT_ID_LENGTH),
         notes,
         evidence,
         updatedAt: now,
@@ -325,7 +356,13 @@ export function formatTaskSteps(state, options = {}) {
     };
     const lines = [`Task steps (${visible.length} visible, ${state.steps.length} tracked):`];
     for (const step of visible.slice(0, maxItems)) {
-        const details = [step.priority, step.owner].filter(Boolean).join(", ");
+        const details = [
+            step.priority,
+            step.owner,
+            step.requirementIds?.length ? `requirements: ${step.requirementIds.join(", ")}` : undefined,
+        ]
+            .filter(Boolean)
+            .join(", ");
         lines.push(`- [${statusMarker[step.status]}] ${step.id} ${step.activeForm || step.content}${details ? ` (${details})` : ""}`);
         for (const note of step.notes.slice(-2))
             lines.push(`  note: ${note}`);
@@ -355,7 +392,14 @@ export function formatTaskStepsContext(state, maxItems = 12) {
     lines.push("", active
         ? `Continue the in_progress step first: ${active.activeForm || active.content}. Update it completed, blocked, or cancelled as soon as evidence is known.`
         : `No step is in_progress. Start the first open step before unrelated work: ${open[0].activeForm || open[0].content}.`, "Use task_steps to keep this checklist current and leave no stale in_progress step before the final response.");
-    return lines.join("\n");
+    if (hasUnverifiedCompletedStep(state)) {
+        lines.push("A completed step has no evidence attached; attach evidence via task_steps update before treating it as verified.");
+    }
+    // Wrapped in a marker (mirrors the <memory_context> precedent) so context-gc's
+    // semantic-memory packer can recognize this as a deterministic, re-derivable context page and
+    // pack stale copies down to the most recent one instead of letting a full page accumulate every
+    // turn. The revision (monotonic per mutation) lets a reader tell which page is current.
+    return `<task_steps_context revision=${state.revision}>\n${lines.join("\n")}\n</task_steps_context>`;
 }
 export function serializeTaskStepsState(state) {
     return JSON.stringify(cloneTaskStepsState(state), null, 2);