← BSD Conjecture · Phase 0
Global Bounding · 2026-08-12 · Verdict: GO, enter Phase 1
Does not claim to prove BSD, nor treats LMFDB numerical matches as proofs. This batch completed: splitting weak BSD, Sha finiteness, and the strong BSD leading coefficient formula; establishing a closure map of currently known theorems; establishing a curve-level BSD certificate ladder (C0–C10); auditing externally available routes and determining Strong-BSD Twist-Family Reproduction as the top choice; auditing and rejecting the "lattice rank convergence" claim from Neo.K's old draft (circular reasoning risk, archived as an exploratory analogy); designing the first executable Agent experiment and machine-readable JSON schema; establishing a faithful certificate frontier of "unproven/uncertified curves" (Certificate Globalizer).
Nine documents to be read in sequence—each is a prerequisite for the next, recommended to read in order. Document 05 is the most special in this bundle: a formal rejection of the researcher's own old claims.