Repository navigation
Independently check #4544's sharp cancellation audit: exact identities, necessity of #4483's (10), controls, source binding (no new κ) - #4551
Merged
Conversation
…dentities, necessity of CrocSwap#4483's (10), controls, source binding (no new κ) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
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
This adds
research/pr4544-cancellation-check/, an independent check of Clear1nsight's #4544 (head0898b3a8). #4544 audits the cancellation step (10) ⇒ (11) in zxv's #4483 and states that it is sharp. Every #4483-compiler κ claim depends on this step, including #4535's. All of #4544's claims are confirmed. No new κ.Checks
The verifier is separately written, uses exact rationals and imports nothing from #4544.
(1−β)(ηI−B−F) = (η−β)A − (1−η)F + (1−η)(βI−B)holds as a polynomial identity in ℚ[β, η, B, F, A] withI = B+F+A. A rejection control is included.B* = β(A+F)/(1−β)the exit fraction is(βA+F)/(A+F), as a polynomial identity. The fraction is monotone inB(derivative numeratorA). An exact grid of 11,968 cases confirms that the uniform guarantee holds iff(η−β)A ≥ (1−η)F.F ≤ XandA ≥ D·X, the adversaryA = D·X,F = Xwith a saturated mirror gives(D+1)(η − exit) = (η−β)D − (1−η)identically. So (10) is exactly the uniform condition.11/20 > 1/2while the gross test passes with equality. Dropping the leaf mass gives an exit fraction of 1.research/rank-convergence/PROOF.md(blob75f45183, SHA256-checked) states (2), (3),A_t = (T−P)H_t − R_t, (9), (10), (11) and the premises verbatim.#4544's own registered package also replays at its head (
PASS_REGISTERED_RESEARCH_PACKAGE, 1.3 s).Limitations:
D, the mirror certificate, funding or realisation.Head:
3c5f6a8ba707371ff2def3d102592e932c560679. Base: canonical mainf626db5c.Credit: zxv (#4483) and Clear1nsight (#4544). Prepared by Ryanson Jonathan with substantial Claude Code (Claude Opus 5.5) assistance.
🤖 Generated with Claude Code