Factoring RSA-260 | Cognition
cognition.com · 7,561 words · saved by 4 readers
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
related reading
- RSA numbersen.wikipedia.org
- VROOM: Accelerating (Almost All) Number-Theoretic Cryptography Using Vectorization and the Residue Number Systemeprint.iacr.org
- How to Optimize a CUDA Matmul Kernel for cuBLAS-like Performance: a Worklogsiboehm.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
- Math & Engineeringxn--2-umb.com
- QR Decomp at the Speed of Lightml-mike.com
- unit-distance-cot.pdfcdn.openai.com
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- >10x More Efficient Pretraining — Magicmagic.dev
- [2510.13786] The Art of Scaling Reinforcement Learning Compute for LLMsarxiv.org
- Circom-ecdsa optimizations - General - zk researchzkresear.ch
- Computational Complexityblog.computationalcomplexity.org