• theherk@lemmy.world
    link
    fedilink
    English
    arrow-up
    0
    ·
    1 hour ago

    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.

      • badcommandorfilename@lemmy.world
        link
        fedilink
        English
        arrow-up
        0
        ·
        18 minutes ago

        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