Repository navigation
Research: sharp 21-ADD positive-lift minimum for all eight k8 leaver cells - #1126
Merged
Merged
Conversation
Contributor
|
100-PR batch review at Merged to Reviewed scope: Sharp 21-ADD lower bound for each fixed positive-lift leaver endpoint, transported by fixed diagonal conjugacy; arbitrary rational circuits remain outside scope. The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions. Batch review, attribution and evidence. Thank you for the contribution. |
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.
The eight PR1005 mutable-leaver cells retained by the selected PR1042 construction each need exactly 21 ADDs in their fixed-endpoint positive-lift class. Their binary endpoints force three source sums and three target transfers; each source pair then requires at least five source-to-target additions. The existing words attain the bound.
This package supplies the all-length proof, direct checks for all eight cores, exact rational diagonal conjugacies, full projected 0/1-cost state enumeration for all 24 projections, source pins and eleven negative controls. It matches the committed core lists to the construction's coded-cell list. It does not replay the rebuilt complete supplier; the retained R492 evidence word is explicitly distinguished from the selected R480 construction. PR1049's endpoint/accounting audit is credited, not repeated as a new result.
Validation: both normal and optimized standard-library replay pass. No extra registers, arbitrary rational gates, cross-cell compensation or paid-frame optimality are included in the theorem. No kappa improvement, native admission, or global supplier optimality is claimed. Base ba82555; seed21, complex-supplier track.
Prepared for @woklerx with substantial OpenAI Codex assistance. Construction credit: Jeremy Kothe's PR1005/1018/1042 lineage and the predecessors named in NOTICE.md. Apache-2.0.