The BSD Compiler: A Uniform Pipeline from Weierstrass Coefficients to the BSD Quotient Copy

We present a uniform computational pipeline — the BSD compiler — that takes the Weierstrass coefficients of an elliptic curve over ℚ as input and produces the BSD quotient as output. Every intermediate quantity (Fourier coefficients, L-value, period, regulator, Tamagawa numbers, torsion) is computed from the input alone, with no external data. The compiler has been tested at rank 0 (11a1, 27606c1), rank 1 (37a1), and rank 2 (389a1), producing |Sha| to 10 significant figures in every case. At rank 2, the compiler reduces the full BSD conjecture to a single assertion: finiteness of Sha. When fed fake controlling functions, the compiler produces non-integer output; when fed genuine curves with |Sha| = 4, it produces 4 = 2² exactly. The compiler does not test input for validity. It transforms topology into integers and ignores everything else. This paper consolidates Papers 141–144 into a single reference.
Copy