Repository navigation
Conversation
This was referenced Nov 13, 2026
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.
Summary
A switch bit of the precise canonical Beneš network for a padded modular rotation can be computed directly in O(h²) bit operations and O(h) working bits, for N=2^h and every 1<=s<=N, 0<=a<s. Claim type: scoped written proof and arithmetic construction, with finite exact corroboration. No new κ.
The new endpoint formulas and child closure avoid constructing the permutation, colored graph or whole row ROM. Interior queries follow one child:
An empty child is identity; the only nontrivial modular reduction is equality with s'. The proof identifies the source's component orientations, so this is the exact deterministic table, including padded-wire switches. At h=5,s=17,j=6 it supplies any one of the 544 offset/address bits without constructing that ROM.
Only
research/canonical-rotation-switch-query/is added. Canonical base ise54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Theuniform-transfer-auditcard explicitly changes scope to an original construction motivated by the current-state key handoff. The advance CLAIM is delivered without a scope change.This contribution was produced by Nick Petalas. Credit 1337isnot1337 #4100 for the canonical compiler and padded rotation, ToikY #4192 for the generic arena lowering, and JoyboyBrian #5092/#5496 for the producer/current-row context, retaining their predecessor notices. Parity coloring and binary arithmetic are standard. The new formulas, child-closure proof and direct evaluator are this contribution. Nick Petalas #4876 studies optimal active-swap tariffs; its construction and proof are not dependencies.
Evidence
The old generic interface materializes a permutation/network or supplies a row ROM. The new arithmetic evaluator follows at most h child steps. This is a construction comparison, not a measured physical runtime speedup.
Warning-strict normal and optimized runs pass 713 complete small networks, all 168,862 switch entries, 710 root decompositions and 19,406 routed addresses. Twelve domain rejections, six semantic controls and twenty large-width queries through h=4096 pass. Both registered commands took 0.30 seconds locally on CPython 3.12.15 / macOS 27.0.1 arm64, standard library only. The mathematical proof covers every positive h; the executable height cap bounds Python allocation.
The hash-bound generated normal/optimized export receipts agree. Registered replay, committed bytes and declared source history, official package export/integrity, and read-only Git-free normal/optimized exported replays with empty PATH all passed. The nine exported source files retained their bytes. The canonical source is a reference for the new construction's certificate; no predecessor research replay or receipt audit is the deliverable.
From the repository root:
Another CPython 3.12 path may be substituted. Direct verification prints
PASS_CANONICAL_ROTATION_SWITCH_QUERY; registered replay printsPASS_REGISTERED_RESEARCH_PACKAGE. Add--receipt /absolute/path/outside/checkout.jsonfor a generated report bound to the seven package-file hashes and canonical source hash. Export reproduction:/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/export_research_package.py export --package research/canonical-rotation-switch-query --ref HEAD --output /absolute/scratch/package.tar /Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/export_research_package.py check /absolute/scratch/package.tarLimitations
This is an arithmetic bit-query construction. Literal fixed tape lowering, current CRT offset production, descriptor serialization, owned predicate return, borrowed-state restoration, cleanup and the full key/caller price remain unimplemented. Repeated queries need a complete workload comparison against retained ROM reuse. Optimal active-swap tariffs for padded rotations remain open. The selected frontier and its five assumptions are unchanged. No selected scientific cold replay, native replay, Lean, Docker, independent human review or formal proof-kernel acceptance is claimed.
Open next questions
Structured first steps and blockers are in TASK.json; the proof and replay commands are in the package README.
Related open work
The completion overlap check found no additional open PR studying the canonical padded-rotation switch predicate. No new same-quantity comparison was required.
CI notes
CI did not certify this package. At unchanged head
4eece58f5cebdb70a92d65447974f1c02383f60b, run 43437339750, plan job 131925744532, failed during "Onboarding helper tests". The job log reports 760 tests, exactly one failure and 24 skips. The failing test istest_research_current_status.CurrentCiNavigationTests.test_current_ci_section_matches_selected_record, with an assertion that the literal commandmake frontier7000-verifywas absent from the CI document.The selected record on base
e54523517d0f03e58352e647c403a5af3e525a57namesmake frontier7000-verify;docs/ci-verification.mdstill describes selected #6030 andmake frontier6030-verify. The record, CI document and failing test have no changes in this PR. This is an inherited repository-level navigation failure. The package replay job 131928073997 was skipped because planning failed. Local replay success above is not hosted certification.The same exact test, missing-command assertion and
failures=1, skipped=24summary were independently read in rohanarun's run 42905094314, dillona's run 42903313790, and petalas #7503's run 43437288667. These are the other runs checked here; no wider failure-range claim is made. No fix commit, retrigger or workflow rerun was made. The shared repair remains with maintainers.Merge danger
Reversible package-only addition. The replay registration affects this package and its declared immutable source inputs. Shared code, predecessor files and selected records are unchanged.