# R12 SD-CST Renderer-Native Program Decoder Preregistration

**Status:** closed and rejected on the sole valid training-only run; see
`R12_SD_CST_RENDERER_NATIVE_PROGRAM_RESULT.md`

**Parent:** rejected Renderer-Orbit Query Bus v1.2 checkpoint; its successful
query/declaration/initial interfaces are frozen

**Claim class:** favorable conventional compiler control on consumed training
rows; no primitive novelty or reasoning claim

## 1. Fixed diagnosis

Renderer-Orbit v1.2 reaches 99.85--100% on held-out declaration address,
initial-occurrence address, initial state, query address, and query class, but
0% packet on both fit and held-out renderers. The failed fields are exactly
those routed through one generic residual into frozen exact-surface line, kind,
amount, and hard line-conditioned event heads.

The next control asks whether a renderer-native structured decoder can consume
the already-trained orbit memory. It does not alter or widen the categorical
tape executor. A pass would establish compiler capacity only; this is a known
structured-attention parser and cannot be called a new reasoning primitive.

## 2. Architecture and parameter contract

`RendererNativeProgramCompiler` loads the exact v1.2 checkpoint SHA
`2e019b81...`. Every inherited tensor is frozen and digest-bound. It adds:

- nine trainable line/slot queries over frozen 512-wide orbit memory;
- shared source keys and separate line/event query projections;
- a two-layer, eight-head, 512-wide slot transformer with 2,048-wide MLP;
- trainable kind and amount heads; and
- eight event-name queries, hard-masked by the model-owned decoded line.

Declaration and initial-occurrence pointers, initial-state matching, the raw-
byte query bus, categorical tape, recurrent executor, motor, and reader remain
frozen. Exact live construction gives:

| Component | Parameters |
|---|---:|
| nominal Shohin base | 125,081,664 |
| complete native-program compiler | 54,724,859 |
| motor + reader | 20,041 |
| **complete deployed system** | **179,826,564** |
| trainable native program decoder | 7,103,493 |
| strict-200M headroom | 20,173,436 |

Only the exact 35 `native_*` parameters may receive gradients. The frozen
parent state digest must be byte-identical before and after fitting.

## 3. Data and training

This training-only control deliberately reuses the already-consumed renderer
orbit and therefore cannot make a fresh generalization claim. It uses the same
SHA-ordered 12,000 fit semantics x four even-parity renderer views and 2,000
disjoint held-out semantics x four odd-parity views. Development, confirmation,
answers, final states, and trajectories are unreachable.

The frozen contract is two epochs / 3,000 updates, family batch eight, AdamW lr
`2e-4`, betas `(0.9, 0.95)`, weight decay `0.01`, 100-step warmup, cosine decay,
and clip `1.0`. Losses and renderer consistency are unchanged from v1.2. Line,
kind, and amount are always supervised; event address/identity activate only
when the current model-selected line supports the true span. Final fit event
pointers must reach 99%, preventing permanent avoidance.

## 4. Gates

All must pass:

1. each held-out renderer initial state at least 95%;
2. complete kind at least 95%;
3. complete active identity at least 90%;
4. complete active amount at least 95%;
5. query and query pointer each at least 99%;
6. complete packet at least 80%;
7. every fit renderer event pointer at least 99%;
8. frozen parent digest byte-identical;
9. complete system strictly below 200M; and
10. development/confirmation access exactly zero.

No threshold is relaxed after output. A failure closes this control without
more epochs. A pass retains it only as the favorable conventional compiler for
a separately committed fresh-board comparison; it does not authorize a native
reasoning claim or confirmation access.

## 5. Prior-art and equivalence boundary

The decoder is ordinary learned structured attention plus transformer slot
composition. Its discrete line mask is inherited project machinery. It has no
novel resource separation and is expected to collapse to a favorable parser
control under the invention charter. Its purpose is to stop blaming the
executor for a source-interface failure and to establish a strong compiler
baseline that any future reasoning mechanism must preserve or beat.