Repository navigation
Research exact Q8 three-role target minima - #2248
Merged
Mister-Meeseeks merged 1 commit intoOct 15, 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.
Result
This adds exact three-register paid-call minima in the full group algebra
F2[Q8]withx=i,y=j,z=-1=x^2=y^2, paid labels{x,y}, and all 28 rank-one idempotents inM3(F2):diag([z],[z],[x])ordiag([z],[z],[y])has exact minimum 5 calls.diag([z],[z],[z])has exact minimum 6 calls.All three registers may contain arbitrary dirty data. Equality is coefficientwise in the eight-element group algebra. The result adds no supplier or kappa change.
Method and evidence
The verifier performs a breadth-first search over exact 3-by-3 group-algebra matrices through depth four. The 56 paid factors produce new-state layer sizes
[1, 56, 2324, 89574, 3286437]. It checks sorted-layer digests, Q8 associativity, theC2 x C2abelianization, all 168GL3(F2)conjugations of the 28 idempotents, and 952 packed-versus-generic matrix transitions. Direct coordinate words attain the stated upper bounds; all one-call deletion controls fail.The first-order trace argument supplies the remaining parity step. The mixed targets require odd length, so the complete depth-four census and the five-call direct words give minimum 5. The all-central target requires even length; the census excludes lengths through four and parity excludes five, giving minimum 6. The depth-four census also reproduces the known
diag(z,z,1)control at distance four.Pins and reproduction
809fc39d62870d18f94dd48473f46972; trackbit-mechanisms; taskbit-new-register-model; priority revision 4.0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2.d46eb6d5b3e279428753d770653663fbdf1063e55c255ea073d768f344927ef7.10b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32.research/q8-r3-two-central-one-generator-seed809fc39d/.Run from the repository root:
The direct verifier and metadata/source-pin check pass locally on CPython 3.14.7. The registered replay targets Python 3.12, which is unavailable locally; the PR workflow will provide that replay.
Scope and predecessor credit
The Q8 central-pair result in merged PR #1822 covers
diag(z,z,1)and an anti-diagonal pair; the Q8 mixed-target result in merged PR #1925 covers a different target family. The three-central target was listed as an open question in the #1822 package. Open PR #2047 covers one central output with two order-four outputs for everyr>=3. This package is restricted to the statedr=3target profiles and depth-four search; it does not imply a bound for other targets, register counts, groups, labels, or longer words.Each target's direct call bill is already optimal in this model. There is no physical mapping of these Q8 factors into the selected bit supplier, and the selected complex primitive still binds. No selected-bound change is claimed.
Prepared with substantial OpenAI Codex assistance. The result is a scoped exact finite obstruction, not an unconditional multiplication theorem or a full theorem audit. Apache-2.0.