Repository navigation
Conversation
…ral-frame arities (no κ) Adds research/cubic-odd-s-shift-floor: - Theorem A: for odd S = r(r-1)/2, a parity lemma, an integral weight and a factorization reduce three-query repair in PR6653's integer-shift alphabet to a finite search. Over the 99 odd-S arities 3 <= r <= 200, exactly 17 admit three queries (all previously covered); the other 82, including 15, 22, 30 and 31, need four, with explicit four-query certificates. - Theorem B: twenty new three-query arities (48 ... 192) in the PR6212 / PR7475 general-frame contract, each with a literal integer-shear program. - Two separate exact checkers (normal and -O) and a byte-for-byte certificate generator. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01ErDAeESzficxtkpvZpvqVP
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
This PR adds the research package
research/cubic-odd-s-shift-floor: scoped proofs, a complete finite classification and exact certificates. No κ, supplier or selected-result change.Theorem A: integer shifts need four queries at 82 odd-S arities. In PR6653's integer-shift alphabet, the only source change is
a += k*bwith integerk, and the only query isy += q*a^3with dyadicq. LetS = r(r-1)/2be odd.w = 6c-(2r-1)that PR6653 suggested, shows that exactly one node has the other parity.2S.(w_0+3x)(w_0+x+4y) = 3x^2-M.So for odd S the question is a finite computation. Over the 99 odd-S arities
3 <= r <= 200:Theorem B: twenty new three-query arities. At 48, 49, 57, 60, 69, 84, 88, 96, 105, 112, 120, 121, 124, 132, 133, 148, 169, 177, 184 and 192, the package gives exact dyadic certificates in the PR6212/PR7475 general-frame contract. Each comes with a literal integer-shear program that restores both arbitrary sources. With PR6212's lower bound, three queries is the exact minimum at all twenty. At five of these arities (84, 105, 121, 132, 148), two of the three rows are non-monic.
Remaining obligations.
b.Task and overlap
Base:
e54523517d0f03e58352e647c403a5af3e525a57, which is current main.Task card:
joint-query-controller, scope changed. This is the same coefficient/restoration side family as #7475, #7478 and #7479. TASK.json gives the reason and the connection to the bottleneck.What it answers: it continues PR6653's Open next question 1 and takes up PR7479's Open next question 2 (restricted families).
Relation to #7539 (same team). @mithrax-exo's #7539 states the same two results: the same 17/82 split at odd S and the same twenty general-frame rows. This PR is meant to replace it. What it adds:
python -O;My review on #7539 lists the differences in detail. If both PRs are kept, review only one of them.
Overlap checks:
r = 15any frame needs two rows of height above 64. Theorem A is complementary: it covers integer shifts of every height, at 82 arities.find_overlap.py --offlinefound only the local cubic packages already cited.Validation
CPython 3.12, standard library only:
The registered replay has five commands:
verify.pyandindependent_check.py, each run normally and under-O, plusbuild.py --check. All five pass. The expected markers arePASS_CUBIC_ODD_S_SHIFT_FLOORandPASS_CUBIC_ODD_S_SHIFT_FLOOR_INDEPENDENT.verify.py3x^2-Mover every odd gap|x| < 2Swith a quadratic sieve and enumerates the divisor route.rretained children, and on dirty rational inputs.r = 12misses PR6653's same-parity certificate, which shows that the parity lemma is load-bearing.independent_check.pyS·N, uses Cipolla square roots and solves the node quadratic.build.py --checkregeneratesCERTIFICATES.jsonbyte for byte.Publication preflight.
scripts/check_research_commit.py --check-modes --check-source-historypasses on a full-history clone (13 files, source pine545235).What is proof and what is search. Theorem A's search is the proof: Lemmas 3–5 make it complete, and both checkers run it in full. The twenty general-frame rows came from an external search that is not included; they are the same rows as in #7539. They are accepted only by the exact checks. The two checkers are separate AI-assisted implementations; neither human nor proof-kernel review is claimed.
Credit
Prepared with substantial AI assistance from several agents, including Anthropic Claude, as disclosed in TASK.json. Apache-2.0.
Open next questions
These are recorded in the package README and TASK.json.
u, which correspond to dyadic shifts, and combine it with #7506.|c| <= 12000and the third node forced found nothing.reager shears, using #7475's event inequality.🤖 Generated with Claude Code
https://claude.ai/code/session_01ErDAeESzficxtkpvZpvqVP