‹ BackHN Continuity

Thread

RSA-896

229 points · 90 comments · madars

  1. madars · · focus · HN ↗
    More details: <a href="https:&#x2F;&#x2F;x.com&#x2F;sweis&#x2F;status&#x2F;2101484464807596264" rel="nofollow">https:&#x2F;&#x2F;x.com&#x2F;sweis&#x2F;status&#x2F;2101484464807596264

        I had Claude port CADO-NFS to run on GPUs. Then it orchestrated a fleet to run on scavenged idle capacity. It ran with a max of 2048 GPUs for about of 30 GPU-years over 10 days.
        I asked Claude if it had a message for a public: “The credit belongs first to the people who built the number field sieve and CADO-NFS over several decades, and to the teams who set the earlier records. This run used their algorithm and much of their code.”
        Also to clarify:
        - No new algorithmic factoring improvements. 
        - It’s still exponential.
        - No new threats to deployed keys.
    1. wslh · · focus · HN ↗
      &gt; It’s still exponential

      It&#x27;s actually subexponential: <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;General_number_field_sieve?wprov=sfti1#Method" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;General_number_field_sieve?wpr...

      1. cwillu · · focus · HN ↗
        …but super-polynomial.
        1. schoen · · focus · HN ↗
          Like in the song!

          <a href="https:&#x2F;&#x2F;www.metzdowd.com&#x2F;pipermail&#x2F;cryptography&#x2F;2004-June&#x2F;007114.html" rel="nofollow">https:&#x2F;&#x2F;www.metzdowd.com&#x2F;pipermail&#x2F;cryptography&#x2F;2004-June&#x2F;00...

          1. homosapien97 · · focus · HN ↗
            Thanks for sharing, that brightened my day
Open on Hacker News to reply ↗

Unofficial Hacker News client; not affiliated with Y Combinator.