Factoring RSA-260 | Cognition

How Devin and a Cognition researcher built the world’s highest-performance GPU lattice siever, to make factoring numbers 10x cheaper than the previous…

By Eric Lu09.09.26 Over the past few weeks, the Cognition research team and I have been optimizing our job scheduler to better use disaggregated compute. As a proof of concept, and because I’ve enjoyed factoring numbers as a hobby for the past ten years or so, I drove a bevy of Devins to obtain a factorization of RSA-260. In order to do this, my Devins built the world's highest-performance GPU lattice siever, which enables factoring numbers at 10x lower cost than the previous public state of the art. Here is the factorization:…

saved by

• Elizabeth Qiu
• Brandon Wang
• Matthew Lee
• nathan karri

related reading

• RSA numbersen.wikipedia.org
• VROOM: Accelerating (Almost All) Number-Theoretic Cryptography Using Vectorization and the Residue Number Systemeprint.iacr.org
• Shtetl-Optimized >> Blog Archive >> Quantum computing bombshells that are not April Foolsscottaaronson.blog
• Discovering cryptographic weaknesses with Claude \ Anthropicanthropic.com
• What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
• The Best GPUs for Deep Learning in 2023 — An In-depth Analysistimdettmers.com
• Auto-research with codex: How I achieved a 232x Faster Kernel over baseline with Codex in GPU Mode's qr_v2 problemsankalp.bearblog.dev
• Formalizing Fermat's Last Theoremanthropic.com
• A High-Level Technical Overview of Fully Homomorphic Encryption || Math ∩ Programmingjeremykun.com
• Why didn't we get GPT-2 in 2005?dynomight.net
• QR Decomp at the Speed of Lightml-mike.com
• Computational Complexityblog.computationalcomplexity.org