[JoyboyBrian]

Result

PR4795 prices the actual key service instructions while its surrounding CRT producer/scanner/repair still executes Python Boolean control and records only cell actions. This package lowers the retained source ASTs into one fixed finite-symbol program and executes the whole actual middle layer: six unary headers → stencil → dense mask → split → 2,944 direct nested key calls → twelve stable radix passes → reinsertion and cleanup, for all 4,096 opaque payload records.

The static program has no runtime source function, AST, callable key or host mask. It relocates the unchanged key instructions into the split continuation, initializes and resets its finite registers, and explicitly installs/disposes of every owned outer marker. The control-only CFG must be acyclic after cutting at tape operations; its longest path gives a proved bound on every intervening instruction sequence. The local theorem covers arbitrary payloads and target-independent ROMs in the declared fixed u2/t2/y8 geometry. It is not an all-size evaluator theorem or a new kappa.

Validation

• Full source-bound normal receipt and Git-free optimized replay, with every actual returned key checked independently, exact bad-only call set, complete payload endpoint, borrowed unary/ROM preservation, all owned storage/head return and control erasure.
• Twelve bounded controls cover unsupported try-finally/loop-else/constructor/method forms, dropped radix pass, bucket cleanup, carry, nested key, borrowed-role alias/ROM mutation and a control-only cycle.
• Exact source SHA/blob authentication, metadata/source-history and official export integrity. Separate agent review fixed compiler admission and borrowed-byte test coverage; no independent human or proof-kernel acceptance is claimed.

The final actual caller executes 167,388,895 instructions and 52,900,280 cell actions, including 22 explicit owned-marker installation/disposal writes. Its static program has 8,242 instructions and control-only path bound 606. RESULT.json and VALIDATION.md record exact counts, source hashes and commands. No historical selected suite, Lean or Docker is run.

Boundary and credit

The raw post-S stream and 32-bit ROM remain explicit inputs. Raw compact S with twelve paid dirty-back shuttles, variable-geometry keys, binary alphabet lowering, descriptor/ROM lifecycle, full E(p,ell) and native/precision/outer admission remain open. Source exceptions reject without promising the original producer's rollback. Fixed finite symbols do not imply a literal binary transition-table tariff.

Credit Cinna Davis #4100; Hiroki KUMAZAKI #4169/#4174; ToikY #4201/#4208; #4637 and the Jose Manuel/Ryanson Jonathan repair lineage; unpaidmoon, Douglas Colkitt/OpenAI and retained #4795/#4752 key/query sources. Algorithms and earlier proofs are reused, not claimed as new. Original notices, predecessor bytes, selected frontier and archives remain unchanged. JoyboyBrian with substantial OpenAI Codex assistance; Apache-2.0.

Base: 81e9bd6. Canonical claim: #4709 (comment)