Repository navigation
Exclude helper469 rung removal by invertible receiver endpoint recoding - #6084
Merged
Mister-Meeseeks merged 2 commits intoOct 28, 2026
Merged
Conversation
Contributor
Author
|
CI follow-up for The plan failure reproduces on clean canonical main |
This was referenced Oct 28, 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.
Helper469's frame593 rung remains impossible to remove by invertible receiver-only endpoint recoding, the case expressly left outside PR6069's donor-only exclusion. For the selected PR6030 word and maximal windows [7896,14357] at chart3 and [14418,14850] at chart713, every donor and the receiver entry row have public-input1 coefficient zero; the required restored receiver has coefficient1/2. This separates the full rational affine span and makes the feasible nonzero receiver-multiplier set empty.
The focused package adds a source-pinned proof, exact certificate and independent standard-library verifier. It replays only helper469's required prefix and preserves all frozen predecessors. A separate literal input1 interpreter checks all 2,734,614 legal donor-slot visits. A synthetic positive shows why donor-only exclusion does not generally imply receiver-recoding exclusion; negative controls reject zero multipliers, stale donor versions, wrong charts, changed arbitrary-input columns and omitted restoration.
Validation at
06d9cd06aa769514304b1ec461117a793addb9f9:-O.This is a scoped scalar exclusion, with no new kappa or supplier claim. No candidate reaches the native/paid/productive/ordinary-cost gates; those profiles are not asserted. No 764-interval recensus, full selected/native/caller replay, Lean or Docker run is included. Human proof review should check the contact-free boundary, unchanged-donor induction and affine normal form.
Canonical claim: #6078
Credit Jonathan Capalbo/PR6069 for the accumulated-span argument and its receiver-recoding boundary; Nick Petalas/PR6033 for carrier-cost context; DreamingOfClouds/PR6030 for the selected word; Ali Romman/PR5827 and retained P104 predecessors. PR6069 head
b3f5aabddbae2d65f80bb8356e6993e0a65cd245is contextual provenance, not a computational dependency. Prepared for JoyboyBrian with substantial OpenAI Codex assistance; Apache-2.0.