The Golden Zeta: Prime Numbers from the Norm Form of ℤ[φ]

We present two machines for finding prime numbers. The first, due to Riemann (1859), guesses the prime count with the logarithmic integral and corrects with waves from zeta zeros — an approximation that never terminates and whose convergence requires the Riemann Hypothesis. The second uses the golden norm form N(a + bφ) = a² + ab − b², which takes two integers as input and produces an integer as output. Every prime p ≡ ±1 (mod 5) is directly manufactured by this form as a product of golden conjugates: p = (a + bφ)(a + b − bφ). Primes p ≡ ±2 (mod 5) are invisible to the norm form — the golden ring's dark matter — identified by the absence of solutions and confirmed by a simple congruence test. The complete set…