← Phase 1 / 00 · Phase 1 Consensus Verdict
The ruling is not a vague claim of "infinitely many twists exist", but rather breaks the theorem hypotheses down into four separately auditable modules: the eligibility of the base curve $E$, the eligibility of the twist parameter $d$, the independent verification of $\operatorname{BSD}(E,2)$, and the branch-specific Chebotarev/splitting conditions—corresponding exactly to the engineering pipeline of Theorem → Predicate → Evidence source → Certificate → Pass/Fail/Open. The document also completes the minimal reproduction for this round: in an environment lacking the SageMath/LMFDB backend, instead of pretending to rerun 500K curves, it first isolates the two branches of Algorithm 2 that are easiest to independently verify—the CLZ20 branch (curve 46a1, $1\le d\le1000$) yields 7 admissible twists, and the Zha16 branch (curve 106d1, $-1000\le d\le1000$) yields 21, both matching the official repository fixture exactly. The document clearly states the true strength of this result: the pure Python mirror only verifies "whether d satisfies the explicit arithmetic conditions of Theorem 2.18, given that the base curve has already passed Algorithm 1". The true theorem strength still comes from the combined theorems of Cai–Li–Zhai, Zhai, and Banwait–Huang, along with the descent certificate for $\operatorname{BSD}(E,2)$—the output should be read as "admissible according to theorem criteria", not "BSD independently proved from elementary computation".
Relationship with other documents, try to use the words from its own document, not my interpretation.
"The output should be read as: admissible according to theorem criteria. Not as: BSD independently proved from elementary computation." — Excerpt from this document's "Why is this not a BSD proof?".
Loading...