Repository navigation
Implement canonical padded-rotation switch queries as a restored fourteen-tape program with quadratic bit cost - #7593
Open
CubeJerry wants to merge 1 commit 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.
Contribution and significance
#7504 gives canonical padded-rotation Beneš switch formulas but leaves their literal fixed-tape implementation open. This package implements that interface in one input-independent 2,096-location, fourteen-tape program.
For legal encoded h,s,a,j,x, it returns the canonical row-j bit at the current wire x in at most 1024(h+3)^2 transitions, adding at most 16(h+4) historical cells. It preserves five borrowed descriptors, restores all heads and retires eight private bodies, leaving one owned Boolean. Domain validation precedes identity shortcuts.
The new work is the physical lowering and full ownership/cost proof. Nick Petalas's formulas and the original #4100 canonical compiler retain their credit; the latter supplies an independent expected-bit oracle.
Verification
python3 -B scripts/research_package.py --package research/literal-canonical-rotation-switchRecorded checks cover 1,566 queries across 49 small networks, all 544 h=5,s=17,j=6 entries, malformed domains, graph mutants and depths through h=129. Independent sparse interpretation and a parity-union-find network oracle reproduce the queries and detect a returning wrong-bit mutation.
Scope and remaining obligations
Descriptors and working windows are supplied. Current CRT production, payload consumption and full routing are separate; repeated queries retain their quadratic bill.
No new kappa: the package retains all five foundational assumptions and does not establish an unconditional multiplication theorem. Finite checks corroborate the scoped written proofs.
Provenance and credit
Base:
e54523517d0f03e58352e647c403a5af3e525a57. Full PR draft, exact dependency pins, review and predecessor credit.Prepared for Jerry Chen / @CubeJerry with substantial OpenAI assistance. Original source authors and predecessor results retain their credit. Model-assisted review is not human or formal-kernel acceptance.