[klohto]

> The same way there's no 'need' to find bigger prime numbers.

From cryptography standpoint, there is always a need to find bigger prime number. I wouldn't compare this with a Pi.

[benchaney]

Finding bigger prime numbers has no impact on cryptography at all.

The large prime numbers needed for cryptography are a few hundred digits long. The are generated by picking a random numbers and checking it’s neighbors for primality.

The largest prime numbers that have been discovered have millions of digits. Finding a larger prime would have no effect whatsoever on our ability to quickly generate primes with a few hundred digits.

[frutiger]

How does finding a bigger prime help or hinder cryptography? And with many forms of cryptography (e.g. DH kex, ECC) primes only enter as the modulus of the modular arithmetic where being larger is usually not particularly helpful.

[XorNot]

Finding a change in the behavior of Pi that emerges at high precisions would be a significant discovery.

[mhh__]

But it's only 9s after the 762nd digit?

[klohto]

Absolutely! I'm not disputing that it's not "interesting", just that I wouldn't compare Pi number search to prime number search.