According to GIMPS, this is the first time a prime number was not found by an ordinary PC, but rather a “‘cloud supercomputer’ spanning 17 countries” that utilized an Nvidia A100 GPU chip to make the initial diagnosis. The primary architect of this find is Luke Durant, who worked at Nvidia as a software engineer for 11 years
I don’t understand this and therefore it’s stupid and pointless. Fuck you math elitist assholes with your so-called “large” prime numbers spending billions of dollars that could be used to make my life better. I don’t comprehend this at all and there it does not matter. The end.
Yeah, fuck those assholes that pursue science for the benefit of humanity! I do not see why anyone should be allowed to be creative if I do not see the benefit for me in particular.
We need to decide democratically what science is, with everyone getting a fair vote, so wasteful science like this can finally be stopped.
Like voting on which science is right lol?
That’s how we end up with solar roadways…
Is this Poe’s law? I genuinely thought this was satire but the downvotes and responses are very serious!
This is a very dangerous way of thinking. You cannot tell at the time of discovery if specific research will be useful or not down the line. You need to advance the research in all directions, even if some of them seem silly or useless, or else you will handicap your progress in other fields which you didn’t see the connection with at first.
Ohhh, you’ve never gained pandemic weight and then gone shopping for jeans in public and seen yourself in a mirror, have you
If you want it to be useful for the economy and industry in order to warrant funding, I’ve got news for you:
The majority of modern encryption relies on prime numbers. It is currently speculated but not known, that the number of prime numbers is infinite.
Should it be proven, that there are only a finite amount of prime numbers, all encryption would become vulnerable.
Many encryption algorithms rely on the assumption that the factorizations of numbers in prime numbers has an exponential cost and not a polynomial cost (I.e. is a NP problem and not P, and we don’t know if P != NP although many would bet on it). Whether there are infinite prime numbers or not is really irrelevant in the context you are mentioning, because encryption relies on factorizing finite numbers of relatively fixed sizes.
The problem is that for big numbers like n=p*q (where p and q are both prime) it’s expensive to recover p and q given n.
Note that actually more modern ciphers don’t rely on this (like elliptic curve crypto).
