Repository navigation
Certify R439 disjoint-helper optimum: 17,933 ADDs - #3117
Merged
Mister-Meeseeks merged 1 commit intoOct 17, 2026
Merged
Mister-Meeseeks merged 1 commit into
Mister-Meeseeks merged 1 commit into
Conversation
Exact fixed-class saving 6,372 ADDs; fully priced 210-pair word improves PR2487 by 127 ADDs and lowers both envelopes. No new kappa. Prepared for @CubeJerry with substantial OpenAI Codex assistance. Predecessor attribution and scoped obligations are retained in the package.
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
2 participants
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.
Closes PR2487's non-greedy matching question: 210 restored helper pairs save 6,372 ADDs, giving the exact fixed-class minimum of 17,933. Versus PR2487: 127 fewer ADDs, F 73,805 -> 72,715, B 1,187,790 -> 1,147,320. A solver-free certificate checks 92,235 inequalities using 430 vertex and 47 odd-set prices. Both precision guards pass; paid profile mass remains 5,129.
Unlike PR941's different PR915 target basis, this certifies the unchanged PR589 D pairing class. No minimum-F claim. No new κ; the complex side still binds.
Base: 997e6a9.
Published commit: e0cc74f.
Complete remote tree verified equal to the tested tree.
Reproduce (Python 3.12, standard library):
python3 -B scripts/research_package.py --package research/r439-copyshare-optimal-matchingExpected: PASS_REGISTERED_RESEARCH_PACKAGE, outcome=completed.
Executed: registered replay; all 661 D columns; both full-word orientations; unchanged owner/exporter and profile checks; 10 mathematical rejection controls; isolated optimized Git-free replay with 3 disk-corruption controls. Baseline binding and card first-example checks also passed.
Scope: disjoint non-retained helper pairs with fixed targets and continuation. H2-sem/chronological bridge inherited; original syntactic H2/K still fail. Native/hosted, all-size/compiler, common-label, routing, precision/tape and outer analytic admission remain unproved here. Selected frontier and upstream/ unchanged.
Prepared for @CubeJerry with substantial OpenAI Codex assistance. Credit PR848/1782/1194, Wentao Li/1805/2487, Gareth Davidson/941, PR589/555 and the exporter lineage. Apache-2.0.
Proof, exact source/dependency pins, seed-03 claim and full evidence:
https://github.com/CubeJerry/integer-mult-bounds/tree/research/cubejerry-seed03-bit-20261017-2a7a18e0/research/r439-copyshare-optimal-matching