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
[–] 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