On the other hand, I doubt this proof will help you to build a faster gizmo or something in the real world.. especially since it's proving something we really think is true (a consequence of the Generalized Riemann Hypothesis), and for real-world applications you can just assume the thing that we think is true is actually true (even if we haven't been able to prove it for a century). (E.g., you don't need to prove that factoring is hard to use cryptography for practical purposes..)
Like, try
openssl prime -generate -bits 2048
Congratulations, you just found a prime that is big enough for every cryptographic protocol that uses prime numbers (not counting unusual and non-deployed post-quantum proposals).Some number theory research may impact the security of cryptosystems, but not all results do.
Some crypto (namely, RSA) depends on on composite numbers being hard to factor, which is a different problem.
Factoring that large integer directly yields the user's private key.
That depend on large semiprimes being hard to factor.