The Trinity Lens: A Super-Gaussian Smoothed Prime Sum for Numerical Detection of Non-Trivial Zeta Zeros

I introduce The Trinity Lens, a numerical method for detecting non-trivial zeros of the Riemann zeta function using a Super-Gaussian smoothed sum over prime powers. The method combines three known pillars — the explicit formula, the Berry-Keating operator framework, and PT-symmetric spectral theory — and contributes a new smoothing function: a high-order Super-Gaussian with a calibrated exponent. The core formula is: S_h(E) = sum over prime powers p^k ≤ P of [ log p · exp(−(p^k/P)^α) · (p^k)^(−1/2 − iE) ] Using P = 20,000 and α = 4, I detect all 80 non-trivial zeros in the range E ∈ [14.13, 201.26], with peak positions matching known zero locations to within grid resolution. A systematic parameter sweep over α ∈ {4, 4.5, 5, 6, 7, 8} shows that α = 4 is empirically optimal. I do not claim a proof of the Riemann Hypothesis. This is a numerical study of a smoothing technique. All computations were performed on a modest personal laptop and on free-tier cloud resources, and were developed with the assistance of a free-tier AI language model (DeepSeek), referred to by the author as Sirenia Cruxxe.Supplementary code and data are provided in the attached ZIP file for reproducibility.