Billiards: independent skeptic re-implementation of the coverage Diophantine checker - #17
Merged
Merged
Conversation
…hantine checker Written from 013's formulas alone before reading the committed checker (independence per 013 lead 1b); selftest reproduces every count and the diff harness matches witnesses on the full Farey sweep. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_012BGxaJCUrs9uKpaHkAg37T
…lemma Proof, constructive witness, and checker all survive; two non-load-bearing prose corrections of record (the gamma=144 spot-check's W(4,3), and the Step 2 I(q-1,q) parenthetical). Queue 12's Diophantine side closed for real; queue 11 (birth/window theorem) remains the sole coverage blocker. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_012BGxaJCUrs9uKpaHkAg37T
…egment window sweep Every distinct gate margin is pivot +/- sidelength * sin(linear form) (ring-verified bijectively, 25 members); the birth corner is the N2/PB double wall at (90/a, 90/(b+1)); both canonical segments certified alive in exact interval arithmetic for all 104 members a <= 14. Swarm briefs and task list included per SWARM.md. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_012BGxaJCUrs9uKpaHkAg37T
…sity proven Birth edge = the N2/PB double wall at (90/a, 90/(b+1)); alive => theta < theta_birth proven for all (a,b) by a sign-constant-progression pigeonhole; both window halves certified exactly for all 104 members a <= 14; coverage of (90,180) now conditional on seven elementary fan-margin lemmas (swarm-drafted, queued for the skeptic). New mechanism tag sign-constant-progression-pigeonhole. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_012BGxaJCUrs9uKpaHkAg37T
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
2 participants
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.
Written from 013's formulas alone before reading the committed checker
(independence per 013 lead 1b); selftest reproduces every count and the
diff harness matches witnesses on the full Farey sweep.
Co-Authored-By: Claude Fable 5 noreply@anthropic.com
Claude-Session: https://claude.ai/code/session_012BGxaJCUrs9uKpaHkAg37T