Repository navigation
Lower inverse-code arithmetic to a smaller complete local tape bound - #5321
Merged
Mister-Meeseeks merged 1 commit intoOct 23, 2026
Merged
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.
This algorithmic improvement gives the actual rounded inverse-code map a smaller complete local tape bound. It emits 308 gather and 280 scatter signed sums, retains the eight rounding calls, and uses eight extra temporary words. The complete Gaussian paid profile and κ are unchanged. Common-coordinate owner access and the complete physical caller remain open.
The proof, instruction emitter, replay receipt, and source pins state the exact contract. Base: canonical main
ff3cc58e370d0f678e529246f8c73e8094e18fcf, priority revision 7.For N aligned real-component records, H ≥ 0 and W = bit_length(56H+2)+1:
The proof charges input validation, division, dirty scratch initialization, classical cleanup, forward movement and final rewind. All owner tapes must already provide the same coordinate. This compares constructive bounds on two fixed-tape models. It is not a measured speedup or an optimality claim. The rounded outputs, local error and noninjectivity are unchanged.
Run with CPython 3.12 and the standard library:
Expected markers:
PASS_REGISTERED_RESEARCH_PACKAGEandPASS_RESEARCH_COMMIT_BYTES. Both registered modes passed with Python 3.12.13, including warnings as errors and-O. Checks cover all 112 gather and eight scatter basis columns, 36 batches, 48 exact source-kernel comparisons, dirty scratch return, an independent primitive invoice, and sign/alias negative controls. The committed export passed its inventory check and both direct replay modes without a Git checkout.git diff --checkpassed. Full-history provenance validation was not run in the shallow checkout. No full Gaussian caller, Lean, compiler or selected-frontier replay ran.This completes the local tape-cost follow-up claimed here. It builds on the scalar factorization in Discussion #5314. @JoyboyBrian’s PR #5035 supplies the divider, validation and original tariff; @dillona’s PR #4933 supplies the physical mode factorization. The consumed bytes are the canonical-main files in SOURCES.json. Standard Walsh butterflies and retained predecessor work keep their credit. New lowering, allocation, proof and checks: Ali Romman (@aliromman) with substantial OpenAI Codex assistance. Apache-2.0.