Repository navigation
Certify the global six-source DUO batch optimum (140 queries, 142 adds) - #2156
Merged
Mister-Meeseeks merged 2 commits intoOct 15, 2026
Merged
Conversation
This was referenced Oct 15, 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.
PR2128 supplies a six-source DUO batch with 140 root queries and 142 source/readout adds. This package proves that it simultaneously minimizes both charges in the inherited single-dirty-connector model, including schedules that use more than two readouts for some outputs. The abstract query/add frontier is the single point
(140,142); the attaining construction remains credited to Aaron Wang/Navinor.The key unrestricted basis value is known: Volodymyr Gavrylkiv, JIS 20 (2017), Table 3, reports
r[(C2)^6]=14. This package independently rebuilds its finite lower bound and applies it to the complete connector bill. A full-cover 13-point set can be translated and linearly normalized to contain zero and the six coordinate vectors. Two code-disjoint enumerators exhaust all 36,288,252 remaining combinations and agree on the complete histogram: maximum 63/64. Thus paired universality needs at least 14 source calls at every add budget. The README also bounds schedules with missing masks and extra readouts, and uses the replayed 12/14-add singleton controls to establish the separate 142-add floor.The original
(13,16)handoff is retained as a separate restricted cross-check: two other enumerators agree byte-for-byte on all 7,480 full-cover expansions among 54,864,810 normalized words; a literal Python audit checks all 86,900 legal hidden triples over 251 complete rotation/reversal orbits, with maximum 63/64. This cross-check is not presented as a new group-theoretic lower bound.Validation:
Only the new scoped package is added. Scientific base is canonical main
0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2, priority revision 4. Exact sources, changed assignment, literature credit, validation and remaining physical-admission question are recorded. Canonical investigation.Credit Ross Richardson for the interface/prefix reduction, Navinor for DUO, Aaron Wang/Navinor for PR2128's witness, Douglas Colkitt/Hanson Sun for the singleton census, and Volodymyr Gavrylkiv for the unrestricted basis value. Substantial OpenAI Codex assistance for Tairitsu-Aya in mathematics, code, verification and writing; all independent algorithms have the same author/assistant, with no independent human or formal-kernel review claimed. Apache-2.0. Physical supplier, compiler, frame/owner, hosting, precision/tape and all-size obligations remain. No selected-frontier or kappa change.