Repository navigation
Realize stable three-lane reversal with a paid fixed local program - #5189
Merged
Mister-Meeseeks merged 3 commits intoOct 23, 2026
Merged
Mister-Meeseeks merged 3 commits into
Mister-Meeseeks merged 3 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.
PR5148 attains the abstract stable-lane reversal pass bound but leaves physical lane assignment, merging, metadata, movement and cleanup unpaid. This package supplies one fixed419-instruction local program for its three-lane construction, with canonical binary runtime record width,15 fixed ports, partial-tail routing, preserved input and distinct output.
For every n>=0 and B>=1, the proof gives exact reversal, complete head/work restoration on valid inputs, action bound256((n+1)(B+1)(k+1)+B(L+1)+1), and retained tape backingK0+6nB+7n+B+2L+60. Here L=floor(log2 B)+1 and k=ceil(log3 n), with k0 for n0/1. Tape high-water capacity, runtime-width conversion and cleanup are charged. Malformed inputs may reject with partial work; transactional rollback is not claimed.
Validation:492 translated-origin full-frame cases plus8 ternary-stage/binary-carry cases through n244/B1024; exact source n7 two-stage sequence;8 rejection/semantic-mutant controls. Registered normal/optimized checks, source-history/committed-byte validation, official export verification, and Git-free read-only normal/optimized replay pass. Actual missingSOURCES/missingRESULT/source-byte corruption/typed integer-to-float receipt controls reject.
Package:
research/physical-three-lane-reversal. Basea5df48c55ea806d7952b65acc9c76d878ff09b13. Canonical claim. Credit Nick Petalas #5148, Matarener #3825, James Reed #3839 and retained PR5090 instruction semantics. JoyboyBrian with substantial OpenAI Codex assistance; Apache-2.0.This is a scoped physical reversal theorem with finite corroboration. Complete bit-free supplier composition and heterogeneous runtime lane counts remain open. No universal multitape lower bound, numerical gain, selected-frontier change or proof-kernel acceptance is claimed.