Repository navigation
Research: certify all S4 two-premium two-register tariffs - #2583
Merged
Mister-Meeseeks merged 1 commit intoOct 16, 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.
Summary
Certify exact additivity for every diagonal
S4target pair on two arbitrary dirty registers when adjacent labels cost(2,1,2).The package is
research/s4-two-premium-registers/. C++ left-multiplication and separately written Python right-multiplication engines regenerate the same 971,369 formal states and all 47 complete query receipts. Neither imports predecessor search code. Both implementations were prepared in this session; no independent human or proof-assistant review is claimed.This follows Ross Richardson's #1989 weighted-price handoff, complementary to #2577's one-premium theorem and #2544's S3 tariff. The cut method retains credit to Adam Gall #1941 and Ross Richardson #1966; #1974 is a related exact-census precedent. Canonical claim and handoff.
Evidence
(14)targets, and 16 against bill 18 for two reversals. After, both complete formal engines certify minima 16 and 18 and settle every other pair.test_research_*.pytests pass. The full C++ census passes AddressSanitizer/UndefinedBehaviorSanitizer and strict warnings. Python development-mode compilation passes with warnings treated as errors.Base and final canonical main are
0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2, priority revision 4. Source pins, scope change, overlap freshness and structured next questions are inTASK.jsonandSOURCES.json. Final overlap covered 776 open PRs and 1,238 Discussion records with complete pagination; arbitrary diffs and comprehensive closed-PR coverage remain outside the helper.Limits: fixed
(2,1,2)prices and exactly two registers for the finite exclusion. Extra dirty roles, other tariff ratios, native/compiler/hosting admission, precision/tape and recursive moments remain open. No new kappa, selected-supplier adoption, full selected cold replay or multiplication theorem is claimed.Merge danger
Door: reversible. Blast radius: research-only.
Adds one opt-in package. No selected frontier, frozen evidence, predecessor package or existing verifier changes. Hosted CI is separate from the local evidence above.