Repository navigation
Refine the complete fixed CRT repair into literal binary control - #5486
Open
JoyboyBrian wants to merge 2 commits into
Open
JoyboyBrian wants to merge 2 commits into
JoyboyBrian wants to merge 2 commits into
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
PR5105 already executes the complete fixed CRT repair in a finite-symbol model; its explicit remaining binary-alphabet obligation includes stencil products and tape-role registers. This lowers the entire exact 8,242-instruction source program to 557,123 literal bit instructions using the unchanged PR4982 executor. The written successful-domain simulation gives
T_binary <= 101391*T_source + 29679, including finite-control initialization and erasure. It preserves arbitrary opaque12-bit records, the admitted32-bit ROM, physical head alignment and source ownership.Validation: registered Python3.12 replay and optimized replay pass;63 independent instruction/alias/dispatch cases, exact record-code inventory, wrong-role/stride/control/relocation faults, dirty-control initialization and typed-receipt controls pass. Actual producer and complete actual key-cut comparisons check2,862 and43,130 source boundaries respectively on persistent encoded tapes. Separate AI peer review independently checked all8,242 generated block boundaries and normal/optimized replay. Committed-byte/source-history checks, the official28-file export with explicit input ref, Git-free optimized replay, source-corruption rejection and typed-receipt-corruption rejection pass.
The full binary layer was not executed. Whole-program correctness is conditional on the pinned source theorem plus the written per-step proof. The binary scanner, all2,944 keys and whole sorting/reinsertion endpoint are not advertised as replayed. Input/ROM serialization, raw-S production, variable geometry, blank owned backing and the absence of malformed-input rollback remain explicit. No new κ, selected-frontier update, independent human acceptance or formal-kernel proof is claimed.
Two substantive commits separate the compiler/proof/source binding from independent controls and the reproducible receipt. Retains PR5105/4982/5015 and the complete credited CRT/key/scanner/repair lineage; Apache-2.0. Prepared by JoyboyBrian with substantial OpenAI Codex assistance.
Canonical claim: #4709 (comment)