The Phantom Filter: Why Fake Controlling Functions Produce Non-Integer Output Copy

We test the BSD compiler of Paper 142 with perturbed controlling functions — fake Fourier coefficient sequences that do not arise from any elliptic curve. The compiler processes these fakes without error: the functional equation holds to machine precision, the convergent series converges, and every intermediate quantity is well-defined. But the output is non-integer. A systematic bias of +1 on every a_p produces |Sha| = 0.64 — not a perfect square, not even a legal group order. The machinery does not reject the fake. It ignores it: the perturbation carries no topological content, and the integer-output mechanism has nothing to quantise. We argue that this is the mechanism behind finiteness of Sha: phantom elements of the Tate–Shafarevich group are locally coherent but globally incoherent, carrying no topological transit through the golden balance. The filter does not fight phantoms. It does not see them. This is why the universe is stable — not because it rejects fakes, but because fakes never enter the selection mechanism.