Repository navigation
Bound complete R437 source transport actions and fixed-pool backing - #5107
Merged
Mister-Meeseeks merged 4 commits intoOct 23, 2026
Merged
Mister-Meeseeks merged 4 commits into
Mister-Meeseeks merged 4 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.
The original R437 fixed-pool transport lacked a complete charge for gather, every routed old-prefix cube, scatter and retained backing. This package derives explicit conservative bounds from the original source loops, including binary arithmetic, radix partitions, family scans, owner installation, rewinds, both pool boundaries and cleanup. It pays cleared physical backing once per physical role and keeps unrelated entry residents and suspended parents separate.
This refines claim 19142273 to tape-cell actions (reads, writes and unit moves) with fixed compiled q/d/R control and a supplied valid Context. It does not supply a uniform finite-control/codebook compiler, current-root admission, full node/reserve budget or new multiplication bound. The original selected-bit-physical-caller and transport predecessors retain credit; frozen sources are unchanged. The exact historical selected file is authenticated through the original loader in a temporary projection, rather than treating that historical compatibility as current-root admission.
Validation executes unchanged actual gather/route/scatter dispatch, Machine commits and ScratchPool installation. Complete reduced cases cover d1/w1,2,3 and d2/w2; the latter checks 23,328 family bits, all 48 low classes and all 81 high fields per prefix against an independent GL/coordinate oracle. Repeated payloads, nonzero high carries, a position-dependent returned-stage change, unselected bytes, borrowed heads and retirement cleanup are checked. Actual wrong partition-bit, lost owner-installation and missing Lease-retirement mutations fail.
Registered normal and
-Oreplay pass. Committed-byte/source-history checks and official export/check pass for 412 files. Git-free cold normal/optimized replay passes with PATH excluding Git and no PYTHONPATH; actual source corruption and integer-to-boolean receipt corruption fail, with all bytes restored. Peer review identified that the previous route prefactor could underpay chart preparation across multiple cubes; the final formula raises it from 8192 to 16384 and the affected proof and receipts were regenerated.Reproduce:
python3.12 scripts/research_package.py --package research/r437-complete-transport-tariff.Open next questions: price Context/codebook preparation and join the remaining full-node and parent-resident ledger before admission. No production GL64 replay, full historical selected replay, Lean/kernel acceptance, or complete supplier theorem is claimed. Prepared by JoyboyBrian with substantial OpenAI Codex assistance.