R12 S5 Learned Generator-Factored Executor Preregistration

Status: frozen before fit, fresh-board creation, or model score.

Claim class: bounded model-owned transition-law development behind the confirmed S4 v5 known-operation parser. This is not a general native-reasoning claim.

Question

The promoted S4 v5 system autonomously extracts a variable-length categorical program from one unpadded natural-language source, but its final state is still computed by a hand-authored pop-insert routine. S5 asks whether a tiny neural kernel can learn the local transition law from primitive supervision and then compose that law recurrently without the exact action table at inference.

Sole Treatment

The frozen S4 v5 parser emits categorical (direction, identity, amount) events and a categorical query. S5 replaces only exact execution with:

1. an exact three-by-three categorical assignment register;
2. a tied neural unit generator receiving only the target's current location and left/right direction;
3. hard-forward selection among six permutation matrices; and
4. one replay for amount one or two tied replays for amount two.

The neural generator is supervised on exactly six unit cells: three current locations times two directions. It receives no source tokens, identity names, amount-two examples, recurrent programs, development rows, confirmation rows, or answer labels. Amount two is therefore a held-out algebraic composition of the same learned primitive. The full generator has fewer than 100,000 parameters and the complete system remains below 150 million parameters.

The S5 program-only decoder independently reconstructs the frozen v5 program without importing or calling its host executor. Evaluation must additionally show exact program/query parity with the promoted decoder on every row. The promoted host executor is evaluated only as a quarantined upper-bound arm; its state or answer is never an input to S5.

Matched Controls

• Fixed deranged law: identical initialization, architecture, optimizer, updates, and six inputs, with every unit-action target cyclically deranged.
• Direction rotation: treatment weights with every parsed direction swapped at execution.
• State reset: treatment weights but the categorical register is reset before every event.
• Host exact upper bound: promoted v5 program executed by the old exact routine; comparison only, never a treatment input.

Custody

After these source bytes and tests are committed, one deterministic treatment fit and matched deranged fit may run. A new 512-group development board must be created from a seed drawn after commit and must pass the existing exact-prompt, 13-gram, name, factor, and roster-multiset exclusions against source data and all prior S4 boards. Exactly one serial H100 evaluation may access that board. No gate, label, architecture, optimizer, or decoder may change after access.

Frozen Gates

All of the following are required:

1. exact frozen-v5 program/query parity on every row;
2. 6/6 treatment unit-generator closure;
3. 36/36 exact amount-two transitions over all six states and three identities, despite zero amount-two training examples;
4. at least 95% program, state, and answer accuracy end to end;
5. at least 93% state accuracy at every depth three through eight;
6. at least 95% state accuracy among rows containing amount-two events;
7. learned state and answer each within 0.1 percentage point of host exact;
8. fixed-deranged and direction-rotated state each fall at least 40 points;
9. state-reset state falls at least 20 points;
10. zero recurrent/amount-two training examples, generator below 100k, total system below 150M, one development access, and zero confirmation access.

Passing qualifies one new independently seeded confirmation of the unchanged parser plus learned kernel. It establishes only that a learned, source-deleted, generator-factored neural transition law composes under a structurally managed known-operation loop. It does not establish unseen operation semantics, open-ended planning, learned termination, unrestricted language reasoning, or standalone native reasoning. Failure rejects S5 without changing the promoted v5 baseline.

Closure

Seed 107732609041319044 is retired before board creation, fit, model load, or score. The board command incorrectly supplied the sealed prior S4 confirmation as an exclusion input. The existing builder opened enough of that file to identify its forbidden confirmation split and failed closed with ValueError: confirmation input is forbidden; it created no output directory. This violates this protocol's zero-confirmation-access contract, so S5 v1 may not proceed. No confirmation content or statistic was used. S5 v1.1 may change only custody: exclude source/public/development boards while never opening any sealed confirmation bytes. Architecture, fit, controls, gates, and claim boundary remain frozen.