Repository navigation
Exclude PR6111's eight-call half-frame candidate (No new κ) - #6148
Merged
Mister-Meeseeks merged 1 commit intoOct 28, 2026
Conversation
Prepared for @CubeJerry with substantial OpenAI Codex assistance. Scoped formal-model result; No new kappa. Credits and exact source pins are in the research 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
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 profile (A,B,P,Q,R,S)=(1,3,0,1,1,2), R=2A, S=P/2, cannot realize the four-target BIT endpoint at any finite restored dirty width, even with free binary mixing. Two-use lattice descent contracts S,S to P and exposes rank 2<4. This resolves PR6111's specific open example, which passes determinant/support checks and even jointly satisfiable first-order equations. No new κ.
Base: 721c038.
Model: PR2910 README blob 608a24af8bc3d27ee1554c94872601bb3a409f67.
Question: PR6111 head 961b749. Its theorem/code is not a dependency.
Reproduce (Python 3.12, stdlib):
python3 -I -B research/bit-two-use-lattice-descent/verify.pyExpected: PASS_BIT_TWO_USE_LATTICE_DESCENT, descent_rank=2<4.
Passed: 22,168 projector triples; 9,120 block cases; two exact polynomial engines; 12 dirty-register positive endpoints; noncommuting-middle, deleted-call and half-frame controls; 7 CLI tests in normal/-O modes rejecting changed sources, repins and receipts. Registered replay, source ancestry/modes, and official Git-free export replay with empty PATH pass.
The written proof supplies arbitrary-width coverage; finite replay is regression evidence, not proof-assistant verification. No native supplier, physical cost reduction or full multiplier is claimed; the five framework assumptions remain. Hosted CI and selected cold replay are unclaimed.
Prepared for @CubeJerry with substantial OpenAI Codex assistance. Credit JosieElliston/Claude (#6111), JoyboyBrian (#6104), apoursh (#6089), Nick Petalas (#2910), Cinna Davis (#2085/2112), Philippe Van Velzen and retained lineage. Classical block algebra is not claimed new.
Published commit d2cba5a; its complete tree matches the locally tested tree.
Proof, evidence, exact pins and handoff.