this post was submitted on 21 Nov 2026
63 points (83.9% liked)

Technology

89964 readers
3217 users here now

This is a most excellent place for technology news and articles.


Our Rules


  1. Follow the lemmy.world rules.
  2. Only tech related news or articles.
  3. Be excellent to each other!
  4. Mod approved content bots can post up to 10 articles per day.
  5. Threads asking for personal tech support may be deleted.
  6. Politics threads may be removed.
  7. No memes allowed as posts, OK to post as comments.
  8. Only approved bots from the list below, this includes using AI responses and summaries. To ask if your bot can be added please contact a mod.
  9. Check for duplicates before posting, duplicates may be removed
  10. Accounts 7 days and younger will have their posts automatically removed.

Approved Bots


founded 3 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
[–] Endmaker@ani.social 11 points 4 hours ago (4 children)

Can someone ELI5 the implication of this proof?

[–] missingno@fedia.io 4 points 26 minutes ago

We've confirmed something that was long suspected to be true, but learned nothing in the process. Hard to say if humans can even understand the proof. It's true... and that's it.

Usually the importance of a problem like this is that the journey to solve it leads to major breakthroughs that can touch other fields of mathematics. So it's a bit surreal to see the most famous unsolved problem finally felled, with the caveat that we learned nothing in the process.

[–] Ledivin@lemmy.world 42 points 4 hours ago* (last edited 4 hours ago) (1 children)

The short answer is "not much."

Us assuming that the Riemann hypothesis is true is the basis of much of our mathematics. If it was proven false, it could affect a ton of the math we've built on top of it for centuries, but it being proven true is just confirmation of what everyone was sure of but couldn't quite prove.

[–] ExcessShiv@lemmy.dbzer0.com 7 points 3 hours ago

math we've built on top of it for centuries

Well, almost centuries at least. The Riemann hypothesis is less than 200 years old (167)

[–] theherk@lemmy.world 16 points 4 hours ago (1 children)

It’s counter proof would have been monumental. This is big. Perhaps the biggest of ours and a few generations surrounding, but not practically so.

It changes little. It’s the result we’ve come to expect. Some other conjectures will use it, maybe Goldbach.

But the disproof would have hurt a lot of number theory, maybe engineering, and probably crypto.

[–] justOnePersistentKbinPlease@fedia.io 4 points 4 hours ago (1 children)

Could primes being predictable result in a weakening of the design of encryption because it would be easier to calculate large primes?

No, not directly at least. Encryption relies on the difficult nature of factorisation, not knowing if a specific number can't be factorised (is prime).

  • Possibly some of the internal components of this could be extended to help factorisation problems (but also possibly not)
  • Most modern encryption algorithms moved away from primes because of other weaknesses like quantum factorisation anyway
[–] AppleTea@lemmy.zip 7 points 4 hours ago* (last edited 4 hours ago) (1 children)

So there are prime numbers, that are only divisible by 1 and themselves. Here's a set of all the prime numbers bellow 100:

[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]

As you start getting larger and larger numbers, primes show up less and less. The Riemann hypothesis is that there is some pattern, some formula to the distribution of prime numbers.

So if there is a pattern and you had the formula, you could predict which arbitrarily large number is going to be prime. Otherwise, you just have to find a big number and check if its divisible.

[–] gibmiser@lemmy.world 8 points 4 hours ago (3 children)

The other poster said a ton of math is built upon that idea? Like what and why?

Sorry I know asking this is alot, im just curious.

[–] loppy@fedia.io 9 points 3 hours ago

The Wikipedia page lists various consequences. Mostly things that will not mean anything at all to a layman. The other thing is that claims that "all of modern mathematics" hinges on the Riemann hypothesis are extremely overblown; it's mostly consequential to number theory, which is something many modern mathematicians work on/intersect, but there's also many who never touch it and for whom the Riemann hypothesis being true or false changes nothing.

[–] PetteriPano@lemmy.world 2 points 2 hours ago* (last edited 2 hours ago) (1 children)

We love using big primes for public key cryptography.

That's some black magic math that lets you take a pair of big primes. Keep one for yourself, give the other to the world. You can then encrypt or sign things with your number, and everyone with the public prime can decrypt or verify that you signed it. And vice versa, people can encrypt things that only you can decode.

As I recall, it all relies on the fact that it's a lot of work trying to find suitable primes for this. Knowing the pattern to how often primes occur can make it easier to break. This proof only predicts how many primes we'll find, so it's the basis for it.

[–] Valmond@lemmy.dbzer0.com 1 points 10 minutes ago

Big primes are made with that Fermat theorem though, it has nothing to do with their distribution.

[–] AppleTea@lemmy.zip 2 points 4 hours ago

I wish I knew for sure, but I don't.

Best guess, I can say that a lot of mathematical profs work by looking for the simplest description, then building up from there. Primes are as mathematically simple as it gets, so its kinda important to keep in mind there's "simple" numbers hiding out there in the unthinkably large digits.