Handwritten baseline · Original rendered interface · Zero model calls
A bounded notebook is enough for this script to escape.
The same frozen controller completed eight prospectively selected worlds using only each rendered screen, the legal action menu and its 1,024-byte notebook. Every decision runs in a fresh isolated process. It must acquire instance facts through legal actions; it receives no seed, engine object or cached record collection.
8 / 8prospective full-start escapes
559 Blargest notebook, of 1,024 B
0faults across those cases
0model calls or weight updates
This is a handwritten scripted policy. The results establish permitted-interface solvability on the tested worlds. They do not establish Beam success, learned transfer or universal solvability. Beam and GLM results remain in their separate study tables.
Inspect an actual trajectory
Public clue before this action
Submitted command and notebook write
Only retained instance memory
Exact rendered observation after this action
All eight prospective cases
The controller hash was frozen before these seeds were initialized. No tuning or replacement occurred. The two earlier development instances, erased-notebook control and team-visible derivative appear separately below.
| World | Result | Actions | Notebook peak | Final charge | Faults |
|---|
The erased-notebook check
On development world 9277, the kept notebook supports an escape. With the same controller and erased notebook, the next fresh process after Blackout reports that its acquired plan is missing. It stops issuing commands while the engine is still running: this is a controller stop, with no terminal ability score. It is neither a native game loss nor an infrastructure censor, and does not prove every erased policy must fail.
What this baseline tests
The policy measures channel wiring and phase, traverses timed shutters, collects equipment and freight evidence, authenticates and files conditional amendments, schedules team support and deliveries, verifies a witness, and commissions circuits in dependency order. It compresses the acquired plan into its notebook before Blackout. Later circuit and exit actions use that retained plan and current public meters.
Isolation, controls and exact reproduction
- Every decision uses a fresh Python process with isolated interpreter settings and an allowlisted environment.
- Only the current rendered screen and decoded legal menu enter the controller. It uses zero previous conversation messages, a strict subset of the available K4 history.
- A Python audit hook denies file, network and subprocess access after imports. Generic public rules are code; instance answers must be observed.
- Actual keyed notebook writes are checked against the native 1,024-byte limit. Blackout clears the native trajectory, and erasure removes the notebook from the next process input.
- The team-visible derivative adds an already-public structured field. Its 138 commands and results match the original-interface development run; it is not a demonstrated necessary repair.
Reproduction commands · Supplement manifest · Changed assignment check · Separately scoped derivative checks