Attempt unconditional certification of the five p=11 class groups - #10
Closed
Th0rgal wants to merge 2 commits into
Closed
Attempt unconditional certification of the five p=11 class groups#10Th0rgal wants to merge 2 commits into
Th0rgal wants to merge 2 commits into
Conversation
Member
Author
|
Closing: this was a computation-only Beal research probe misfiled into starknetid.rs (unrelated repo) to run Actions compute. All workflow runs are terminal since 2026-07-25 (results live in this branch's Actions history); the Beal campaign has since moved to the Pro mission fleet. Branch kept. |
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
1 participant
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.
Computation-only draft PR. Freitas--Naskręcki--Stoll isolate the GRH dependency in the complete solution of x^2+y^3=z^11 to five degree-36 class-group computations. This PR constructs those five composita from the published Table-5 fields and the X_0(11) 2-division polynomial, then runs PARI bnfinit followed by bnfcertify. Only FULL_CERTIFICATE=1 for all five fields would remove GRH; failures, timeouts, quotient-only certificates, or incomplete jobs prove nothing.