5 ms·

What was the methodology,software, hardware, cpu cores, time taken?

• internet2000 12d ago
  [flagged]
  • bawolff 12d ago
    Seems unlikely given claude would not really be effective for this type of problem.
    • charcircuit 12d ago
      Why not? Claude has already shown it can automate mathematics and it can automate programming and running programs (including renting the servers).
      • hnaccount_rng 12d ago
        Because there is nothing not already automated here. RSA will either be cracked because some assumption about prime numbers doesn’t hold or because we throw more and more brute force on it. And if it were the former it wouldn’t be the “next” in line that would be cracked…
        • charcircuit 12d ago
          You don't have to have RSA be broken in order to get a competitive advantage over other people searching. You just need Claud to find software optimization that got overlooked or something from number theory to come up with better candidates to guess.
          • bawolff 12d ago
            True, but if that happened, i think that would be the headline, not RSA-260 was factorized.
  • adastra22 12d ago
    It wasn’t. The person that posted the factorization has nothing to do with Anthropic, and has for many years held the leaderboard on GPU-hours applied to factorization and prime search problems. He’s not yet on record as to how this one was done (probably waiting for publication), but there is no reason at all to assume any LLM was involved.
  • tyre 12d ago
    I heard it was a lucky guess