Repository navigation
Record that a second missing edge does not save a dirty one-move G20 word - #277
Draft
unpaidmoon wants to merge 1 commit into
Draft
unpaidmoon wants to merge 1 commit into
unpaidmoon wants to merge 1 commit into
Conversation
…word Recompute the 686,386 still-rejected dirty failures, insert the edge that rejects each one-edge walk, and show that both edges at rank 1 produce no strict saving on (0, 1). Co-authored-by: unpaidmoon <unpaidmoon@users.noreply.github.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.
Change and mathematical scope
Exhaustive finite census. No new κ. The selected conditional exponent stays
363005817/100000000000(0.00363005817).On the emitted local word of CrocSwap#5708, CrocSwap#6923 classifies 686,779 length-at-least-5 one-move assignments as dirty failures. Open CrocSwap#7074 inserts one route at the first missing edge and leaves 686,386 words still rejected. This package recomputes that domain (the first-edge multiplicity table matches CrocSwap#7074's SHA-256
8f38eb2f6e526ede87a62c1fc88c35fd5d3ba87a16f755df690a76cea5a68494) and inserts the second missing edge as well. Both inserted edges have rank 1.None of the 686,386 words is a strict saving on
(0, 1). The same absence holds for every rank pair in1..7: a missing third edge is missing at every such rank, and raising an inserted edge's rank adds a nonnegative termu(r^t − 1)to the rank-1 moment.t = 1/2and negative att = 4/5The lexicographically first still-rejected word, in order
(interval start, interval end, correction index, moved frame), is scalar positions 1,003–8,891, length 12. Correction 0,ADD(583, 87), moves from frame 1 to frame 326. The outer gate isADD(583, 60). After the first route(326, 1)is added, the rejecting edge is(591, 553). With both edges present, the walk still misses(467, 396).The three sign-changing words have shape
H1 + 3 H2 − H4 − H5. The first of them is positions 5,661–7,047, correction 8 moved from frame 593 to frame 360, edges(360, 358)and(360, 131). This is not the CrocSwap#6923 repair on that interval, which uses frame 358. These three words are not strict losses either.This is not a proof that no other routing model can save a word, and it does not insert a third edge. It does not change the selected frontier.
Task and overlap
Base
e54523517d0f03e58352e647c403a5af3e525a57. Cardbit-helper-contract, scope refined. This is open question 1 of CrocSwap#7074. CrocSwap#6923 is the merged one-move census. CrocSwap#6963 settled two moved corrections on length 5. CrocSwap#7079 is the two-move length-6 census. Those packages hold the published route table fixed. This package adds a second route on a dirty one-move failure. It does not rerun those screens and does not move a second correction.The fork PR is based on a pin of upstream
mainate54523517d0f03e58352e647c403a5af3e525a57, because the fork'smainis a different history. The intended upstream base is CrocSwapmainat that commit.Validation
Python 3.12, standard library, from the repository root. Both registered commands passed, and
scripts/research_package.pyprintedPASS_REGISTERED_RESEARCH_PACKAGEwithoutcome=negative-result.Checks raise exceptions, so
-Odoes not disable them. Every emission was replayed from the start of the word bypaid_histogram. The lexicographically first word, one still-rejected word of each of the 28 lengths, and the sign-changing witness were replayed independently. The sign-changing witness was also checked with its first added edge moved from rank 1 to rank 7.Not run: the CrocSwap#5708 integration replay, the 18-call caller, adjoint columns, moduli 101 and 10201, ordinary admission, Lean, Docker, and
make frontier7000-verify.Credit
The emitted word, route table, A2 relation, and the local-only conjugation count are Ali Romman's
research/g20-conjugation-admission, following Dugongue, ai-nanachi, and the retained G20 lineage named there. The length-4-and-above contact-frame obstruction is Nick Petalas's CrocSwap#6305. The two-move classification at lengths 2..4 is Nick Petalas's CrocSwap#6664. The length-1..3 one-move obstruction is unpaidmoon's CrocSwap#6337. The length-4 one-move obstruction is unpaidmoon's CrocSwap#6633. The length-at-least-5 one-move obstruction is unpaidmoon's CrocSwap#6923. The length-5 two-move census is unpaidmoon's CrocSwap#6963. The one-added-route census, including the 686,386 still-rejected words and the first-edge table checked here, is unpaidmoon's CrocSwap#7074.Prepared by unpaidmoon with substantial Cursor Grok assistance. Apache-2.0.
Open next questions
(467, 396). Replay that word with all three edges present at rank 1. This package inserts only the first two missing edges.Workflow feedback (optional)
Recording the second missing edge while the one-edge walk is still running makes this follow-up a direct replay. CrocSwap#7074 already noted that the one-move census does not store the missing pair. Feedback thread: CrocSwap#1200