Repository navigation
Realize the formal A5 alphabet on eight binary address bits (no κ) - #5114
Merged
Mister-Meeseeks merged 1 commit intoOct 23, 2026
Merged
Mister-Meeseeks merged 1 commit into
Mister-Meeseeks merged 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.
Summary
Construct an explicit eight-bit binary affine carrier for the formal A5 alphabet, with an injective extension to F2[A5]. This is a finite exact construction with a scoped algebraic proof, produced by Nick Petalas. No new kappa is claimed.
The generators corresponding to x=(12)(34) and y=(135) have literal address CNOT words of lengths 4 and 12. Complete in-place data permutation programs use 360 and 510 bit XORs per 256-entry bit array, preserving arbitrary dirty data and using no extra data bit. The construction answers the address-carrier part of Wentao Li's #4089 handoff and Cinna Davis's #3914 nonabelian escape route. Their endpoint theorem and caller obstruction are cited premises; predecessor searches and verifiers were not replayed.
Scientific base: 81e9bd6. Contribution head: d165f73. The package retains the exact original card, scope refinement, source pins, generated hash-bound result and overlap coverage.
Evidence
From the repository root:
Direct success marker: PASS_A5_EIGHT_BIT_CARRIER. Registered success marker: PASS_REGISTERED_RESEARCH_PACKAGE.
Limitations and unrun obligations
Two natural copies are necessary and sufficient only within the specified replication family. There is no minimum over all affine representations or optimal CNOT claim. Address-coordinate CNOT counts and data-array XOR counts are separate tariffs. Fixed table generation/storage/reads, actual tape movement, arbitrary scalar role mixing and rank-one-projector adaptation, source/target frames, ownership, routing, precision, compiler closure and recursive/outer admission are not supplied or priced as free. No native supplier, full multiplication theorem, selected-frontier change, human acceptance or formal proof-kernel verification follows.
Credit Wentao Li #4089, Cinna Davis #2246/#3914, eumemic, Ali Romman and the retained register-model lineage. The classical A5=SL2(F4) isomorphism, regular-orbit criterion, finite-field arithmetic and XOR-swap construction retain their mathematical credit. Independent human and formal proof-kernel review are unclaimed.
Related open work
Open next questions
CI notes
CI pending at d165f73. Local registered normal/optimized checks and publication/export checks pass. No hosted CI result is claimed yet.
Merge Danger
Door: two-way. Blast radius: package. Seven new files are confined to research/a5-eight-bit-carrier; shared code, frozen sources and selected-frontier files are unchanged.