Repository navigation
Record that one added route does not save a dirty one-move G20 failure - #7074
Open
unpaidmoon wants to merge 1 commit into
Open
unpaidmoon wants to merge 1 commit into
unpaidmoon wants to merge 1 commit into
Conversation
Group the 686,779 dirty failures from the length-at-least-5 one-move census by their first missing frame pair, add that one route, and show that none of the resulting words is a strict saving. 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
781451/250000000(0.003125804).On the emitted local word of #5708, every length-at-least-5 one-move assignment that #6923 classifies as a dirty failure was replayed with exactly one route added at its first missing edge. The added route has an integer rank in
1..7. Of the 686,779 assignments, 686,386 still miss a different edge. The other 393 emit. Each emission pays the new edge one, two, or three times, and each is a strict loss on(0, 1)at every rank in1..7. None is a strict saving.The 686,779 failures use 22,709 missing frame pairs. The multiplicity table has SHA-256
8f38eb2f6e526ede87a62c1fc88c35fd5d3ba87a16f755df690a76cea5a68494. The maximum multiplicity is 1,841, attained by 303 edges into frame 1 (frames326..635except 507 and 519–524), accounting for 557,823 failures. Every first missing hop pays.The lex-first emission is scalar positions 5,760–6,924, length 13, outer gate
ADD(89, 19), correction 6 moved from frame 575 to frame 429. Its missing edge is(429, 575). At rank 1 the paid difference is3 H2 − H4.Task and overlap
Base
17469fff78c22941280f04d39dc5a1faee09c840. Cardbit-helper-contract, scope refined. This is open question 2 of #6923. #6963 settled two moved corrections on length-5 intervals and left this added-route question on the #6923 package.#6305, #6337, #6633, and #6664 screen other conjugation clauses. This census does not rerun them, does not move a second correction, and does not add a second route. It does not change the selected frontier.
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. The census walk is the #6923 route rule resumed at the contact, with the first missing edge inserted. Every emission was replayed independently bypaid_histogramat ranks 1..7. One still-rejected word in each of the 28 lengths was replayed the same way and still misses an edge. The classifier and the walk agree on all 686,779 first missing pairs.Not run: the #5708 integration replay, the 18-call caller, adjoint columns, moduli 101 and 10201, ordinary admission, Lean, Docker, and
make frontier6030-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 #6305. The two-move classification at lengths 2..4 is Nick Petalas's #6664. The length-1..3 one-move obstruction is unpaidmoon's #6337. The length-4 one-move obstruction is unpaidmoon's #6633. The length-at-least-5 one-move obstruction, including the dirty-failure count and the classifier replayed here, is unpaidmoon's #6923. The length-5 two-move census that left this question open is unpaidmoon's #6963.Prepared by unpaidmoon with substantial Cursor Grok assistance. Apache-2.0.
Open next questions
Workflow feedback (optional)
The #6923 classifier already isolates the dirty class, so the added-route walk only has to resume at the contact. Reclassifying the whole one-move domain was the slow step because the missing frame pair is not stored. Recording that pair in the one-move census output would make this follow-up a direct replay. Feedback thread: #1200