loopforge 3.7.0 → 3.7.1

package/dist/index.d.ts

@@ -1,6 +1,7 @@
 /** LoopForge — Cognitive State Runtime for AI coding agents.
  *
- * TypeScript reference implementation v3.7.0
+ * TypeScript reference implementation. Version is single-sourced from
+ * package.json (see src/version.ts).
  *
  * Usage:
  *   import { LoopForgeEngine, ReplayBackend, compileLoop } from "loopforge";

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EACL,IAAI,EACJ,WAAW,EACX,qBAAqB,EACrB,kBAAkB,EAClB,iBAAiB,EACjB,cAAc,EACd,kBAAkB,EAClB,iBAAiB,EACjB,mBAAmB,EACnB,sBAAsB,EACtB,uBAAuB,EACvB,gBAAgB,EAChB,UAAU,EACV,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACtB,qBAAqB,EACrB,oBAAoB,EACpB,WAAW,EACX,kBAAkB,GACnB,MAAM,eAAe,CAAC;AAEvB,YAAY,EACV,iBAAiB,EACjB,cAAc,EACd,gBAAgB,EAChB,aAAa,EACb,UAAU,EACV,cAAc,EACd,aAAa,EACb,eAAe,EACf,kBAAkB,EAClB,mBAAmB,EACnB,iBAAiB,EACjB,YAAY,EACZ,eAAe,EACf,YAAY,EACZ,gBAAgB,EAChB,gBAAgB,EAChB,kBAAkB,EAClB,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,OAAO,EACP,cAAc,EACd,cAAc,GACf,MAAM,eAAe,CAAC;AAGvB,OAAO,EACL,SAAS,EACT,UAAU,EACV,WAAW,EACX,cAAc,EACd,cAAc,GACf,MAAM,aAAa,CAAC;AAErB,YAAY,EACV,UAAU,EACV,iBAAiB,EACjB,aAAa,EACb,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,eAAe,EACf,cAAc,EACd,qBAAqB,EACrB,SAAS,GACV,MAAM,aAAa,CAAC;AAGrB,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,yBAAyB,GAC1B,MAAM,iBAAiB,CAAC;AACzB,YAAY,EACV,SAAS,EACT,mBAAmB,EACnB,iBAAiB,EACjB,UAAU,GACX,MAAM,iBAAiB,CAAC;AAGzB,OAAO,EACL,WAAW,EACX,WAAW,EACX,SAAS,EACT,eAAe,EACf,mBAAmB,EACnB,YAAY,EACZ,gBAAgB,EAChB,kBAAkB,EAClB,mBAAmB,GACpB,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAG5C,OAAO,EACL,eAAe,EACf,YAAY,EACZ,mBAAmB,EACnB,sBAAsB,EACtB,uBAAuB,EACvB,kBAAkB,GACnB,MAAM,aAAa,CAAC;AAErB,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAElE,YAAY,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAGhD,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,YAAY,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAEtE,OAAO,EACL,iBAAiB,EACjB,mBAAmB,EACnB,uBAAuB,EACvB,wBAAwB,EACxB,0BAA0B,EAC1B,yBAAyB,EACzB,aAAa,EACb,uBAAuB,GACxB,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,gBAAgB,EAChB,gBAAgB,EAChB,sBAAsB,EACtB,qBAAqB,EACrB,sBAAsB,EACtB,uBAAuB,EACvB,mBAAmB,GACpB,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACL,QAAQ,GACT,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EACV,YAAY,GACb,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,sBAAsB,EACtB,aAAa,EACb,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,qBAAqB,CAAC;AAC7B,YAAY,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AAGjE,OAAO,EACL,gCAAgC,EAChC,2BAA2B,EAC3B,WAAW,EACX,uBAAuB,EACvB,6BAA6B,GAC9B,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,qBAAqB,EACrB,wBAAwB,EACxB,qBAAqB,EACrB,uBAAuB,GACxB,MAAM,wBAAwB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,EACL,IAAI,EACJ,WAAW,EACX,qBAAqB,EACrB,kBAAkB,EAClB,iBAAiB,EACjB,cAAc,EACd,kBAAkB,EAClB,iBAAiB,EACjB,mBAAmB,EACnB,sBAAsB,EACtB,uBAAuB,EACvB,gBAAgB,EAChB,UAAU,EACV,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACtB,qBAAqB,EACrB,oBAAoB,EACpB,WAAW,EACX,kBAAkB,GACnB,MAAM,eAAe,CAAC;AAEvB,YAAY,EACV,iBAAiB,EACjB,cAAc,EACd,gBAAgB,EAChB,aAAa,EACb,UAAU,EACV,cAAc,EACd,aAAa,EACb,eAAe,EACf,kBAAkB,EAClB,mBAAmB,EACnB,iBAAiB,EACjB,YAAY,EACZ,eAAe,EACf,YAAY,EACZ,gBAAgB,EAChB,gBAAgB,EAChB,kBAAkB,EAClB,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,OAAO,EACP,cAAc,EACd,cAAc,GACf,MAAM,eAAe,CAAC;AAGvB,OAAO,EACL,SAAS,EACT,UAAU,EACV,WAAW,EACX,cAAc,EACd,cAAc,GACf,MAAM,aAAa,CAAC;AAErB,YAAY,EACV,UAAU,EACV,iBAAiB,EACjB,aAAa,EACb,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,eAAe,EACf,cAAc,EACd,qBAAqB,EACrB,SAAS,GACV,MAAM,aAAa,CAAC;AAGrB,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,yBAAyB,GAC1B,MAAM,iBAAiB,CAAC;AACzB,YAAY,EACV,SAAS,EACT,mBAAmB,EACnB,iBAAiB,EACjB,UAAU,GACX,MAAM,iBAAiB,CAAC;AAGzB,OAAO,EACL,WAAW,EACX,WAAW,EACX,SAAS,EACT,eAAe,EACf,mBAAmB,EACnB,YAAY,EACZ,gBAAgB,EAChB,kBAAkB,EAClB,mBAAmB,GACpB,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAG5C,OAAO,EACL,eAAe,EACf,YAAY,EACZ,mBAAmB,EACnB,sBAAsB,EACtB,uBAAuB,EACvB,kBAAkB,GACnB,MAAM,aAAa,CAAC;AAErB,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAElE,YAAY,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAGhD,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,YAAY,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAEtE,OAAO,EACL,iBAAiB,EACjB,mBAAmB,EACnB,uBAAuB,EACvB,wBAAwB,EACxB,0BAA0B,EAC1B,yBAAyB,EACzB,aAAa,EACb,uBAAuB,GACxB,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,gBAAgB,EAChB,gBAAgB,EAChB,sBAAsB,EACtB,qBAAqB,EACrB,sBAAsB,EACtB,uBAAuB,EACvB,mBAAmB,GACpB,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACL,QAAQ,GACT,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EACV,YAAY,GACb,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,sBAAsB,EACtB,aAAa,EACb,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,qBAAqB,CAAC;AAC7B,YAAY,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AAGjE,OAAO,EACL,gCAAgC,EAChC,2BAA2B,EAC3B,WAAW,EACX,uBAAuB,EACvB,6BAA6B,GAC9B,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,qBAAqB,EACrB,wBAAwB,EACxB,qBAAqB,EACrB,uBAAuB,GACxB,MAAM,wBAAwB,CAAC"}

package/dist/index.js

@@ -1,6 +1,7 @@
 /** LoopForge — Cognitive State Runtime for AI coding agents.
  *
- * TypeScript reference implementation v3.7.0
+ * TypeScript reference implementation. Version is single-sourced from
+ * package.json (see src/version.ts).
  *
  * Usage:
  *   import { LoopForgeEngine, ReplayBackend, compileLoop } from "loopforge";

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,iBAAiB;AACjB,OAAO,EACL,IAAI,EACJ,WAAW,EACX,qBAAqB,EACrB,kBAAkB,EAClB,iBAAiB,EACjB,cAAc,EACd,kBAAkB,EAClB,iBAAiB,EACjB,mBAAmB,EACnB,sBAAsB,EACtB,uBAAuB,EACvB,gBAAgB,EAChB,UAAU,EACV,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACtB,qBAAqB,EACrB,oBAAoB,EACpB,WAAW,EACX,kBAAkB,GACnB,MAAM,eAAe,CAAC;AA4BvB,SAAS;AACT,OAAO,EACL,SAAS,EACT,UAAU,EACV,WAAW,EACX,cAAc,EACd,cAAc,GACf,MAAM,aAAa,CAAC;AAerB,gBAAgB;AAChB,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,yBAAyB,GAC1B,MAAM,iBAAiB,CAAC;AAQzB,gBAAgB;AAChB,OAAO,EACL,WAAW,EACX,WAAW,EACX,SAAS,EACT,eAAe,EACf,mBAAmB,EACnB,YAAY,EACZ,gBAAgB,EAChB,kBAAkB,EAClB,mBAAmB,GACpB,MAAM,oBAAoB,CAAC;AAE5B,SAAS;AACT,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5C,SAAS;AACT,OAAO,EACL,eAAe,EACf,YAAY,EACZ,mBAAmB,EACnB,sBAAsB,EACtB,uBAAuB,EACvB,kBAAkB,GACnB,MAAM,aAAa,CAAC;AAMrB,aAAa;AACb,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,2BAA2B;AAC3B,OAAO,EACL,iBAAiB,EACjB,mBAAmB,EACnB,uBAAuB,EACvB,wBAAwB,EACxB,0BAA0B,EAC1B,yBAAyB,EACzB,aAAa,EACb,uBAAuB,GACxB,MAAM,wBAAwB,CAAC;AAWhC,8DAA8D;AAC9D,OAAO,EACL,QAAQ,GACT,MAAM,oBAAoB,CAAC;AAI5B,OAAO,EACL,sBAAsB,EACtB,aAAa,EACb,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,qBAAqB,CAAC;AAG7B,oCAAoC;AACpC,OAAO,EACL,gCAAgC,EAChC,2BAA2B,EAC3B,WAAW,EACX,uBAAuB,EACvB,6BAA6B,GAC9B,MAAM,wBAAwB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,iBAAiB;AACjB,OAAO,EACL,IAAI,EACJ,WAAW,EACX,qBAAqB,EACrB,kBAAkB,EAClB,iBAAiB,EACjB,cAAc,EACd,kBAAkB,EAClB,iBAAiB,EACjB,mBAAmB,EACnB,sBAAsB,EACtB,uBAAuB,EACvB,gBAAgB,EAChB,UAAU,EACV,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACtB,qBAAqB,EACrB,oBAAoB,EACpB,WAAW,EACX,kBAAkB,GACnB,MAAM,eAAe,CAAC;AA4BvB,SAAS;AACT,OAAO,EACL,SAAS,EACT,UAAU,EACV,WAAW,EACX,cAAc,EACd,cAAc,GACf,MAAM,aAAa,CAAC;AAerB,gBAAgB;AAChB,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,yBAAyB,GAC1B,MAAM,iBAAiB,CAAC;AAQzB,gBAAgB;AAChB,OAAO,EACL,WAAW,EACX,WAAW,EACX,SAAS,EACT,eAAe,EACf,mBAAmB,EACnB,YAAY,EACZ,gBAAgB,EAChB,kBAAkB,EAClB,mBAAmB,GACpB,MAAM,oBAAoB,CAAC;AAE5B,SAAS;AACT,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5C,SAAS;AACT,OAAO,EACL,eAAe,EACf,YAAY,EACZ,mBAAmB,EACnB,sBAAsB,EACtB,uBAAuB,EACvB,kBAAkB,GACnB,MAAM,aAAa,CAAC;AAMrB,aAAa;AACb,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,2BAA2B;AAC3B,OAAO,EACL,iBAAiB,EACjB,mBAAmB,EACnB,uBAAuB,EACvB,wBAAwB,EACxB,0BAA0B,EAC1B,yBAAyB,EACzB,aAAa,EACb,uBAAuB,GACxB,MAAM,wBAAwB,CAAC;AAWhC,8DAA8D;AAC9D,OAAO,EACL,QAAQ,GACT,MAAM,oBAAoB,CAAC;AAI5B,OAAO,EACL,sBAAsB,EACtB,aAAa,EACb,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,qBAAqB,CAAC;AAG7B,oCAAoC;AACpC,OAAO,EACL,gCAAgC,EAChC,2BAA2B,EAC3B,WAAW,EACX,uBAAuB,EACvB,6BAA6B,GAC9B,MAAM,wBAAwB,CAAC"}

package/dist/loop-compiler.d.ts

@@ -3,7 +3,7 @@
  * The compiler evolves structured state and renders one prompt artifact.
  * L0/L1/L2 control state density only; the external Agent owns reasoning.
  */
-import { type CriterionStatus, type Lesson, type LoopCompileRequest, type LoopCompileResponse, type LoopHealth, type LoopObjective, type LoopRoundResult, type RollingSummary, type SubGoal, type TaskAlignment, type VerificationFlag } from "./protocol.js";
+import { type CriterionStatus, type Lesson, type LoopCompileRequest, type LoopCompileResponse, type LoopHealth, type LoopObjective, type LoopRoundResult, type RollingSummary, type SubGoal, type SubGoalUpdate, type TaskAlignment, type VerificationFlag } from "./protocol.js";
 import type { PresentedStateSnapshot } from "./canonical-state.js";
 export interface PreviousRound {
     round: number;
@@ -50,20 +50,34 @@ export declare function deriveConstraintId(text: string): string;
 /** v2.11: Derive a stable criterion ID from its text hash (cr-XXXXXXXX).
  *  Same hash strategy as SubGoal — deterministic across rounds. */
 export declare function deriveCriterionId(text: string): string;
+/** Closed migration matrix. done/canceled are terminal (no out-edges); the
+ *  matrix rejects re-opening. blocked → in_progress is the recovery path. */
+export declare const SUBGOAL_TRANSITIONS: Record<SubGoalUpdate["status"], readonly SubGoal["status"][]>;
+/** Whether a transition is legal. Same-status is a legal no-op (used by
+ *  replay idempotency). References to terminal sub-goals are rejected by
+ *  validateSubGoalUpdates before this is consulted. */
+export declare function canTransitionSubGoal(from: SubGoal["status"], to: SubGoalUpdate["status"]): boolean;
+/** Referential validation of a payload's subgoal_updates against the
+ *  derived sub-goal set. Returns one error per invalid entry:
+ *  unknown_id | terminal_reference | illegal_transition. */
+export declare function validateSubGoalUpdates(subGoals: SubGoal[], updates: SubGoalUpdate[]): Array<{
+    id: string;
+    reason: string;
+}>;
 export declare function alignTask(proposedTask: string, request: LoopCompileRequest, context: Record<string, unknown> | null): TaskAlignment;
 export declare function checkLoopHealth(loopId: string, request: LoopCompileRequest, context: Record<string, unknown> | null): LoopHealth;
 export declare function decideLevel(request: LoopCompileRequest, context: Record<string, unknown> | null): "l0" | "l1" | "l2";
-export declare function buildSelfEvalBlock(round: number, prevDriftFlags?: VerificationFlag[], 
+export declare function buildSelfEvalBlock(round: number, prevDriftFlags?: VerificationFlag[],
 /** v2.12: L0 is the minimal retry template — the v2.12 declarative fields
  *  (outcome/blocker/retroactiveClaims) are L1/L2 additions so the retry
  *  prompt stays within its tight budget. */
-level?: "l0" | "l1" | "l2", 
+level?: "l0" | "l1" | "l2",
 /** v3.3/v3.4: Whether this round's Current Task IS the ACTIVE Round
  *  Contract (derived from committed rounds — compileLoop passes
  *  `activeContract != null`). Only then does the template ask the agent
  *  to restate/propose it — a generic empty contract template would invite
  *  placeholder submissions that trigger round_underspecified noise. */
-hasContract?: boolean, 
+hasContract?: boolean,
 /** v3.5: L2-only prose suggesting a Round Contract declaration when the
  *  Current Task is NOT one (contract_nudge_on_l2 policy, computed at the
  *  compileLoop call site). Mutually exclusive with hasContract. The prose

package/dist/loop-compiler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"loop-compiler.d.ts","sourceRoot":"","sources":["../src/loop-compiler.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,OAAO,EAWL,KAAK,eAAe,EACpB,KAAK,MAAM,EACX,KAAK,kBAAkB,EACvB,KAAK,mBAAmB,EACxB,KAAK,UAAU,EACf,KAAK,aAAa,EAClB,KAAK,eAAe,EAEpB,KAAK,cAAc,EAEnB,KAAK,OAAO,EACZ,KAAK,aAAa,EAClB,KAAK,gBAAgB,EACtB,MAAM,eAAe,CAAC;AAKvB,OAAO,KAAK,EAAiB,sBAAsB,EAAa,MAAM,sBAAsB,CAAC;AA4B7F,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,cAAc,EAAE,MAAM,CAAC;CACxB;AAyCD,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAGxD;AAED,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,SAAK,GAAG,MAAM,CAKhF;AAED;;;2CAG2C;AAC3C,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,sBAAsB,GAAG,IAAI,CA0B/B;AAED,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,aAAa,GAAG,IAAI,CAqBtB;AAuHD;;;yCAGyC;AACzC,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,EACvC,YAAY,EAAE,MAAM,GACnB,MAAM,EAAE,CAkDV;AAsED;;;;;2BAK2B;AAC3B,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,EACvC,SAAS,EAAE,aAAa,GAAG,IAAI,EAC/B,YAAY,EAAE,MAAM,EACpB,QAAQ,EAAE,OAAO,EAAE,EACnB,eAAe,CAAC,EAAE,eAAe,GAAG,IAAI,GACvC,eAAe,EAAE,CA0CnB;AAED;;;;4CAI4C;AAC5C,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAU3D;AA8GD,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,EACvC,UAAU,SAAI,EACd,KAAK,CAAC,EAAE,MAAM,GACb,cAAc,GAAG,IAAI,CAyIvB;AAMD;6EAC6E;AAC7E,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED;mEACmE;AACnE,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEvD;AAED;mEACmE;AACnE,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEtD;AAuRD,wBAAgB,SAAS,CACvB,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,kBAAkB,EAC3B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,aAAa,CAef;AAED,wBAAgB,eAAe,CAC7B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,kBAAkB,EAC3B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,UAAU,CAkBZ;AAqDD,wBAAgB,WAAW,CACzB,OAAO,EAAE,kBAAkB,EAC3B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,IAAI,GAAG,IAAI,GAAG,IAAI,CAEpB;AAED,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,MAAM,EACb,cAAc,CAAC,EAAE,gBAAgB,EAAE;AACnC;;4CAE4C;AAC5C,KAAK,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI;AAC1B;;;;uEAIuE;AACvE,WAAW,UAAQ;AACnB;;;;6CAI6C;AAC7C,aAAa,UAAQ,GACpB,MAAM,CAiHR;AAMD,wBAAgB,WAAW,CACzB,OAAO,EAAE,kBAAkB,EAC3B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,mBAAmB,CAyJrB"}
+{"version":3,"file":"loop-compiler.d.ts","sourceRoot":"","sources":["../src/loop-compiler.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,OAAO,EAWL,KAAK,eAAe,EACpB,KAAK,MAAM,EACX,KAAK,kBAAkB,EACvB,KAAK,mBAAmB,EACxB,KAAK,UAAU,EACf,KAAK,aAAa,EAClB,KAAK,eAAe,EAEpB,KAAK,cAAc,EAEnB,KAAK,OAAO,EACZ,KAAK,aAAa,EAClB,KAAK,aAAa,EAClB,KAAK,gBAAgB,EACtB,MAAM,eAAe,CAAC;AAKvB,OAAO,KAAK,EAAiB,sBAAsB,EAAa,MAAM,sBAAsB,CAAC;AA6B7F,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,cAAc,EAAE,MAAM,CAAC;CACxB;AAyCD,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAGxD;AAED,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,SAAK,GAAG,MAAM,CAKhF;AAED;;;2CAG2C;AAC3C,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,sBAAsB,GAAG,IAAI,CA0B/B;AAED,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,aAAa,GAAG,IAAI,CAqBtB;AA8HD;;;yCAGyC;AACzC,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,EACvC,YAAY,EAAE,MAAM,GACnB,MAAM,EAAE,CAkDV;AAsED;;;;;2BAK2B;AAC3B,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,EACvC,SAAS,EAAE,aAAa,GAAG,IAAI,EAC/B,YAAY,EAAE,MAAM,EACpB,QAAQ,EAAE,OAAO,EAAE,EACnB,eAAe,CAAC,EAAE,eAAe,GAAG,IAAI,GACvC,eAAe,EAAE,CA0CnB;AAED;;;;4CAI4C;AAC5C,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAU3D;AA8GD,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,EACvC,UAAU,SAAI,EACd,KAAK,CAAC,EAAE,MAAM,GACb,cAAc,GAAG,IAAI,CAyIvB;AAMD;6EAC6E;AAC7E,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED;mEACmE;AACnE,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEvD;AAED;mEACmE;AACnE,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEtD;AA2CD;6EAC6E;AAC7E,eAAO,MAAM,mBAAmB,EAAE,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,EAAE,SAAS,OAAO,CAAC,QAAQ,CAAC,EAAE,CAK7F,CAAC;AAEF;;uDAEuD;AACvD,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,OAAO,CAAC,QAAQ,CAAC,EACvB,EAAE,EAAE,aAAa,CAAC,QAAQ,CAAC,GAC1B,OAAO,CAGT;AAED;;4DAE4D;AAC5D,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,OAAO,EAAE,EACnB,OAAO,EAAE,aAAa,EAAE,GACvB,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAkBvC;AA2ND,wBAAgB,SAAS,CACvB,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,kBAAkB,EAC3B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,aAAa,CAef;AAED,wBAAgB,eAAe,CAC7B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,kBAAkB,EAC3B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,UAAU,CAkBZ;AAqDD,wBAAgB,WAAW,CACzB,OAAO,EAAE,kBAAkB,EAC3B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,IAAI,GAAG,IAAI,GAAG,IAAI,CAEpB;AAED,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,MAAM,EACb,cAAc,CAAC,EAAE,gBAAgB,EAAE;AACnC;;4CAE4C;AAC5C,KAAK,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI;AAC1B;;;;uEAIuE;AACvE,WAAW,UAAQ;AACnB;;;;6CAI6C;AAC7C,aAAa,UAAQ,GACpB,MAAM,CAkHR;AAgDD,wBAAgB,WAAW,CACzB,OAAO,EAAE,kBAAkB,EAC3B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GACtC,mBAAmB,CAyKrB"}

package/dist/loop-compiler.js

@@ -7,7 +7,7 @@ import { createHash } from "node:crypto";
 import { getPolicy } from "./policy.js";
 import { AgentStatus, makeLoopCompileResponse, makeLoopHealth, makeLoopObjective, makeConstraintMeta, makeMilestoneSummary, makeRollingSummary, makeSubGoal, makeTaskAlignment, } from "./protocol.js";
 import { createCanonicalLoopState, renderCanonicalStateMarkdown, } from "./canonical-state.js";
-import { decodeRound, entryLineage, entryCriteriaMet, entryCriteriaRemaining, entryActiveConstraints, entryRetractedConstraints, entryProgressEstimate, entryEmergedSubtasks, machineGitMotionSeries, mergedRoundsFromEntries, } from "./committed-round.js";
+import { decodeRound, entryLineage, entryCriteriaMet, entryCriteriaRemaining, entryActiveConstraints, entryRetractedConstraints, entryProgressEstimate, entryEmergedSubtasks, entrySubGoalUpdates, machineGitMotionSeries, mergedRoundsFromEntries, } from "./committed-round.js";
 import { contractRoundEvaluations, deriveActiveRoundContract, } from "./round-contract.js";
 import { assemblePromptArtifact } from "./prompt-assembler.js";
 import { decidePromptLevel, } from "./prompt-policy.js";
@@ -144,9 +144,16 @@ function evolveObjective(request, context) {
     let version = current.version ?? 1;
     if (last?.objective_refinement?.trim()) {
         const refinement = last.objective_refinement.trim();
-        history.push(refinement);
-        objective = `${objective}\nRefinement: ${refinement}`;
-        version++;
+        // M5: fold each refinement exactly once per persisted objective state.
+        // A retry recompiles the same round against the same committed
+        // last_round_result; without this guard every retry attempt re-appends
+        // the refinement and inflates the version — the objective text and the
+        // state file grew "Refinement: X" once per attempt.
+        if (!history.includes(refinement)) {
+            history.push(refinement);
+            objective = `${objective}\nRefinement: ${refinement}`;
+            version++;
+        }
     }
     const revisions = new Map((last?.revised_success_criteria ?? []).map((item) => [item.old, item.new]));
     return makeLoopObjective({
@@ -609,11 +616,10 @@ function isCriterionId(ref) {
     return /^cr-[a-f0-9]{8}$/.test(ref);
 }
 /**
- * Match a user-provided sub-task reference against existing SubGoals.
- *
- * Tries exact SubGoal ID match first (e.g. "sg-a3f2b1c0"), then falls
- * back to Jaccard token similarity on descriptions. Returns the index
- * of the best-matching SubGoal, or -1 when no match reaches threshold.
+ * Match a user-provided description against existing SubGoals for DEDUP
+ * (emerged_subtasks creation). Exact ID first, then Jaccard similarity on
+ * descriptions. v3.7.1: status transitions no longer use this — they are
+ * strict ID references validated before the round advances.
  */
 function matchSubGoal(target, subGoals, threshold) {
     const trimmed = target.trim();
@@ -634,34 +640,90 @@ function matchSubGoal(target, subGoals, threshold) {
     }
     return bestScore >= threshold ? bestIdx : -1;
 }
+// ═══════════════════════════════════════════════════════════════════════════
+// Sub-goal transition matrix (v3.7.1 — single source)
+// ═══════════════════════════════════════════════════════════════════════════
+/** Closed migration matrix. done/canceled are terminal (no out-edges); the
+ *  matrix rejects re-opening. blocked → in_progress is the recovery path. */
+export const SUBGOAL_TRANSITIONS = {
+    in_progress: ["pending", "blocked"],
+    done: ["pending", "in_progress", "blocked"],
+    blocked: ["pending", "in_progress"],
+    canceled: ["pending", "in_progress", "blocked"],
+};
+/** Whether a transition is legal. Same-status is a legal no-op (used by
+ *  replay idempotency). References to terminal sub-goals are rejected by
+ *  validateSubGoalUpdates before this is consulted. */
+export function canTransitionSubGoal(from, to) {
+    if (from === to)
+        return true;
+    return SUBGOAL_TRANSITIONS[to].includes(from);
+}
+/** Referential validation of a payload's subgoal_updates against the
+ *  derived sub-goal set. Returns one error per invalid entry:
+ *  unknown_id | terminal_reference | illegal_transition. */
+export function validateSubGoalUpdates(subGoals, updates) {
+    const byId = new Map(subGoals.map((sg) => [sg.id, sg]));
+    const errors = [];
+    for (const update of updates) {
+        const target = byId.get(update.id);
+        if (!target) {
+            errors.push({ id: update.id, reason: "unknown_id" });
+            continue;
+        }
+        if (target.status === "done" || target.status === "canceled") {
+            errors.push({ id: update.id, reason: "terminal_reference" });
+            continue;
+        }
+        if (!canTransitionSubGoal(target.status, update.status)) {
+            errors.push({ id: update.id, reason: "illegal_transition" });
+        }
+    }
+    return errors;
+}
+/** Apply one transition to the accumulated list. Guards make replay of
+ *  committed history idempotent: terminal sub-goals never change and
+ *  same-status updates are no-ops. */
+function applySubGoalUpdate(subGoals, update, rnd) {
+    const target = subGoals.find((sg) => sg.id === update.id);
+    if (!target)
+        return;
+    if (target.status === "done" || target.status === "canceled")
+        return;
+    if (!canTransitionSubGoal(target.status, update.status))
+        return;
+    if (target.status === update.status)
+        return;
+    target.status = update.status;
+    target.status_changed_at_round = rnd;
+    if (update.status === "done")
+        target.completed_at_round = rnd;
+}
 /**
  * Manage the full sub-goal lifecycle across rounds.
  *
- * Accumulates sub-goals from all prior vault entries, processes the current
- * round's declarations, derives status changes, and returns the complete
- * structured SubGoal list.
- *
- * Status derivation priority (compiler-driven):
- *   1. Agent declared done/canceled/blocked → explicit status change
- *   2. next_action match → auto in_progress
- *   3. success_criteria_met match → auto done
+ * v3.7.1 derivation rule: EVERY committed round (round < currentRound) is
+ * replayed in round order — emerged_subtasks create pending items, then
+ * subgoal_updates apply explicit transitions. The round's own report
+ * (last_round_result, which the engine rebuilds from the same committed
+ * evaluation) contributes the same data on the fixture path, so applying
+ * it again is an idempotent no-op. Older transitions therefore never
+ * regress on later compiles, and no status is ever inferred.
  */
 function manageSubGoals(loopId, currentRound, lastRoundResult, vaultContext) {
     const policy = getPolicy().evolution;
     const allEntries = loopEntries(loopId, vaultContext);
-    const completedEntries = allEntries.filter((e) => entryRound(e) >= 1 && entryRound(e) < currentRound);
+    const completedEntries = allEntries
+        .filter((e) => entryRound(e) >= 1 && entryRound(e) < currentRound)
+        .sort((a, b) => entryRound(a) - entryRound(b));
     const subGoals = [];
-    // Phase 1 — Accumulate historical sub-goals from vault entries
-    for (const entry of completedEntries) {
-        const rnd = entryRound(entry);
-        const emerged = entryEmergedSubtasks(entry);
-        for (const desc of emerged) {
-            const id = deriveSubGoalId(desc);
+    const createEmerged = (descs, rnd) => {
+        for (const desc of descs) {
             // Dedup: skip if an existing sub-goal is too similar
             if (matchSubGoal(desc, subGoals, policy.subgoal_dedup_threshold) >= 0)
                 continue;
             subGoals.push(makeSubGoal({
-                id,
+                id: deriveSubGoalId(desc),
                 description: desc.trim(),
                 status: "pending",
                 declared_at_round: rnd,
@@ -669,56 +731,24 @@ function manageSubGoals(loopId, currentRound, lastRoundResult, vaultContext) {
                 priority: subGoals.length,
             }));
         }
+    };
+    // Phase 1 — Replay every committed round in order: create, then apply
+    // that round's declared transitions.
+    for (const entry of completedEntries) {
+        const rnd = entryRound(entry);
+        createEmerged(entryEmergedSubtasks(entry), rnd);
+        for (const update of entrySubGoalUpdates(entry)) {
+            applySubGoalUpdate(subGoals, update, rnd);
+        }
     }
-    // Phase 2 — Process current round's sub-task declarations
+    // Phase 2 — The current round's own report (fixture/rebuild path; on the
+    // vault path this duplicates the last committed round and is idempotent).
     if (lastRoundResult) {
         const rnd = lastRoundResult.round || (currentRound - 1);
-        // New sub-goals from this round
-        const emerged = lastRoundResult.emerged_subtasks ?? [];
-        for (const desc of emerged) {
-            if (matchSubGoal(desc, subGoals, policy.subgoal_dedup_threshold) >= 0)
-                continue;
-            subGoals.push(makeSubGoal({
-                id: deriveSubGoalId(desc),
-                description: desc.trim(),
-                status: "pending",
-                declared_at_round: rnd,
-                status_changed_at_round: rnd,
-                priority: subGoals.length,
-            }));
-        }
-        // Completed sub-goals
-        const completed = lastRoundResult.completed_subtasks ?? [];
-        for (const desc of completed) {
-            const idx = matchSubGoal(desc, subGoals, policy.subgoal_match_threshold);
-            if (idx >= 0 && subGoals[idx].status !== "done" && subGoals[idx].status !== "canceled") {
-                subGoals[idx].status = "done";
-                subGoals[idx].status_changed_at_round = rnd;
-                subGoals[idx].completed_at_round = rnd;
-            }
+        createEmerged(lastRoundResult.emerged_subtasks ?? [], rnd);
+        for (const update of lastRoundResult.subgoal_updates ?? []) {
+            applySubGoalUpdate(subGoals, update, rnd);
         }
-        // Blocked sub-goals
-        const blocked = lastRoundResult.blocked_subtasks ?? [];
-        for (const desc of blocked) {
-            const idx = matchSubGoal(desc, subGoals, policy.subgoal_match_threshold);
-            if (idx >= 0 && subGoals[idx].status !== "done" && subGoals[idx].status !== "canceled") {
-                subGoals[idx].status = "blocked";
-                subGoals[idx].status_changed_at_round = rnd;
-            }
-        }
-        // Canceled sub-goals
-        const canceled = lastRoundResult.canceled_subtasks ?? [];
-        for (const desc of canceled) {
-            const idx = matchSubGoal(desc, subGoals, policy.subgoal_match_threshold);
-            if (idx >= 0 && subGoals[idx].status !== "done" && subGoals[idx].status !== "canceled") {
-                subGoals[idx].status = "canceled";
-                subGoals[idx].status_changed_at_round = rnd;
-            }
-        }
-        // v3.7: no auto status inference. The v2.3 fuzzy heuristics
-        // (next_action Jaccard → in_progress, criteria Jaccard → done) were
-        // removed — they fabricated dashboard motion the machine never
-        // verified. Statuses change only via the agent declarations above.
     }
     // Sort for display: in_progress first, then pending by age desc, then blocked, then done, then canceled
     subGoals.sort((a, b) => {
@@ -910,17 +940,17 @@ function levelDecision(request, context) {
 export function decideLevel(request, context) {
     return levelDecision(request, context).level;
 }
-export function buildSelfEvalBlock(round, prevDriftFlags, 
+export function buildSelfEvalBlock(round, prevDriftFlags,
 /** v2.12: L0 is the minimal retry template — the v2.12 declarative fields
  *  (outcome/blocker/retroactiveClaims) are L1/L2 additions so the retry
  *  prompt stays within its tight budget. */
-level, 
+level,
 /** v3.3/v3.4: Whether this round's Current Task IS the ACTIVE Round
  *  Contract (derived from committed rounds — compileLoop passes
  *  `activeContract != null`). Only then does the template ask the agent
  *  to restate/propose it — a generic empty contract template would invite
  *  placeholder submissions that trigger round_underspecified noise. */
-hasContract = false, 
+hasContract = false,
 /** v3.5: L2-only prose suggesting a Round Contract declaration when the
  *  Current Task is NOT one (contract_nudge_on_l2 policy, computed at the
  *  compileLoop call site). Mutually exclusive with hasContract. The prose
@@ -948,9 +978,9 @@ proposalNudge = false) {
         },
         wrong_assumptions: [],
         next_action: "<next concrete action, or empty when complete>",
-        completed_subtasks: ["<sg-XXXXXXXX or text>"],
-        blocked_subtasks: ["<sg-XXXXXXXX or text>"],
-        canceled_subtasks: ["<sg-XXXXXXXX or text>"],
+        subgoal_updates: [
+            { id: "<sg-XXXXXXXX from the Sub-Goal Dashboard>", status: "done" },
+        ],
     };
     // v2.12: Declarative tri-state outcome (L1/L2 only — keeps L0 retry lean)
     if (declareOutcome) {
@@ -999,7 +1029,8 @@ proposalNudge = false) {
     lines.push("IMPORTANT: Replace every <placeholder> with your actual data.");
     lines.push("Set success=true only when the full goal and ALL hard constraints are verified.");
     lines.push("Use IDs for exact matching: c-XXXXXXXX, cr-XXXXXXXX, sg-XXXXXXXX.");
-    lines.push("For subtasks, use sub-goal IDs from the Sub-Goal Dashboard above.");
+    lines.push("Sub-goal changes go through `subgoal_updates` (active sub-goal IDs only;");
+    lines.push("done/canceled are terminal — reopen via `emerged_subtasks`; bad IDs reject).");
     // v3.5: L2 contract-less nudge (prose only — never the JSON key name, so
     // contract-less rounds keep their template-lean assertions).
     if (proposalNudge) {
@@ -1013,6 +1044,43 @@ proposalNudge = false) {
 // v2.5: checkpoint() removed — agent_declared milestones from
 // compression_checkpoint supersede the separate CheckpointSummary.
 // See buildRollingSummary() signal 1.
+/** v3.7.1: Derived Recovery Brief for the state-file Recent tier. Present
+ *  ONLY while a committed backtrack decision is the current round's record
+ *  (the recovery window); the redo commit replaces that record, so the
+ *  brief exits the projection by construction. Sources are the committed
+ *  rollback decision's own fields — no new persistence, no rejected
+ *  payloads. */
+function committedBacktrackBrief(loopId, round, context) {
+    const entry = loopEntries(loopId, context).find((e) => entryLineage(e).committed_action === "backtrack" && entryRound(e) === round);
+    if (!entry)
+        return undefined;
+    // Read the facts the engine stamped onto the merged lineage entry from
+    // the committed rollback decision (engine.ts mergeCommittedRound).
+    const lineage = entryLineage(entry);
+    const asStrings = (value) => Array.isArray(value) ? value.filter((v) => typeof v === "string") : [];
+    const asNumbers = (value) => Array.isArray(value) ? value.filter((v) => typeof v === "number") : [];
+    const failedRounds = asNumbers(lineage.backtrackFailedRounds);
+    const approaches = asStrings(lineage.backtrackApproaches).slice(0, 6);
+    const assumptions = asStrings(lineage.backtrackWrongAssumptions).slice(0, 5);
+    const target = typeof lineage.backtrackTarget === "number" ? lineage.backtrackTarget : 0;
+    const trigger = typeof lineage.backtrackTriggerRule === "string"
+        ? lineage.backtrackTriggerRule
+        : "unknown";
+    const lines = [
+        `- **Trigger**: ${trigger}`,
+        `- **Restored to round**: ${target} (redo round ${target + 1})`,
+    ];
+    if (failedRounds.length > 0)
+        lines.push(`- **Failed rounds**: ${failedRounds.join(", ")}`);
+    for (const approach of approaches)
+        lines.push(`  - Failed approach: ${approach}`);
+    if (assumptions.length > 0) {
+        lines.push("- **Falsified assumptions** (do not rebuild on these):");
+        for (const assumption of assumptions)
+            lines.push(`  - ${assumption}`);
+    }
+    return lines;
+}
 export function compileLoop(request, context) {
     const decision = levelDecision(request, context);
     const previous = getPreviousRound(request.loop_id, request.round - 1, context);
@@ -1085,14 +1153,27 @@ export function compileLoop(request, context) {
         warnings,
     });
     const policy = getPolicy();
-    const statePath = `${policy.state_file.directory}/${request.loop_id}-state.md`;
+    // L7 (v3.7.x): the state-file path is empty when the file is disabled —
+    // prompts must never point at (or collapse content behind) a file that
+    // writeStateFile will not create. An empty path propagates into the
+    // assembler's pointer lines and the L1 collapse gate below.
+    const statePath = policy.state_file.enabled
+        ? `${policy.state_file.directory}/${request.loop_id}-state.md`
+        : "";
     const state = createCanonicalLoopState(request, response, statePath, {
         roundStats,
         machineStatus,
         // v3.4: derived active contract — the Current Task's source of truth.
         roundContract: activeContract,
     });
-    const markdown = renderCanonicalStateMarkdown(state);
+    const markdown = renderCanonicalStateMarkdown(state, {
+        // v3.7.1: retry attempts are marked in the derived view (attempt is
+        // request context, not a committed fact). The Recovery Brief renders in
+        // the Recent tier only while a committed backtrack decision is this
+        // round's record; the redo commit removes it by construction.
+        attempt: request.attempt,
+        recoveryBrief: committedBacktrackBrief(request.loop_id, request.round, context),
+    });
     // v2.4–v2.5: Adaptive L2 budget — scales with loop complexity
     const adaptiveL2 = policy.prompt.l2_adaptive_enabled
         ? Math.min(policy.prompt.l2_max_chars
@@ -1103,7 +1184,10 @@ export function compileLoop(request, context) {
     // v2.8: L2 pointer mode — when enabled, skip the monolithic markdown blob.
     // Structured L2 sections (milestones, sub-goals, trust, progress) still
     // render. The state file on disk is the durable source of truth.
-    const l2Pointer = policy.prompt.l2_pointer_enabled && decision.level === "l2";
+    // L7: pointer mode REQUIRES the file — with state_file disabled it would
+    // silently drop the full state from L2 prompts and point at nothing.
+    const l2Pointer = policy.state_file.enabled &&
+        policy.prompt.l2_pointer_enabled && decision.level === "l2";
     const artifact = assemblePromptArtifact({
         state,
         level: decision.level,
@@ -1114,11 +1198,11 @@ export function compileLoop(request, context) {
             l2: adaptiveL2,
         },
         attempt: request.attempt,
-        selfEvaluationBlock: buildSelfEvalBlock(request.round, request.verification_flags, decision.level, 
+        selfEvaluationBlock: buildSelfEvalBlock(request.round, request.verification_flags, decision.level,
         // v3.4: restate the contract only when this prompt's Current Task IS
         // the ACTIVE contract (derived — not the previous submission's field,
         // which is a proposal and may differ from what this round executes).
-        activeContract != null, 
+        activeContract != null,
         // v3.5: L2-only declaration nudge when nothing is active (policy-gated;
         // mutually exclusive with the restate template above).
         decision.level === "l2" && activeContract === null &&