A novel method for generating large prime numbers

Hello r/CryptoTechnology,I’ve developed a novel method for generating large prime numbers that bypasses the traditional Miller-Rabin trial-and-error paradigm. Instead of sieving, it uses a constructive spectral law derived from the non-trivial Riemann zeta zeros.The results (benchmarked on a standard i7 CPU):Code 1 (parallel, gmpy2): ~13.8 ms per 1024-bit prime.Code 2 (pure Python): ~36 ms per 1024-bit prime using a Riemann-von Mangoldt explicit formula extraction.I recently submitted this to two major journals (including one in mathematical physics). Both gave me a "desk reject" within days without a technical review, likely because I am an independent researcher without a PhD. https://github.com/model-vpr/ultrafast-spectral-primes

Preprint (Zenodo): https://doi.org/10.5281/zenodo.19893929

I’m inviting everyone here to clone the repo, run the benchmarks, and try to break it. Is there a statistical bias I’m missing, or is this as revolutionary for key generation as the numbers suggest?