Integer Factoring Record at N^o(1) Verified in Lean by Rudich and Rousseau
basedjensen · x · 2026-10-31
A new complexity record for Integer Factoring, N^o(1), by Isaac Rudich and Louis-Martin Rousseau has been formally verified in Lean, according to the record announcement forwarded by @bigospeedrun. Machine-checked verification gives the result high credibility for a problem underpinning RSA cryptography.
More from Research
- SCOPE workshop proposed for ICLR 2027 asks what counts as an AI scientific discovery — mariyaivasileva · 2026-10-31
- New MolmoSpaces-CommonSense benchmark: no robot policy tops 30% on manipulation tasks — RanjayKrishna · 2026-10-31
- Mischief launches video model trained from lab-grown brain cells at 0.5¢ per second — evilsocket · 2026-10-31
- Stanford CS336 notes: Percy Liang on scaling recipes and hyperparameter transfer — stanfordnlp · 2026-10-31
- Composable LoRA directions for texture, geometry and lighting make 3D fine-tuning cheaper — burkov · 2026-10-31
- Moondream releases RefCOCO-M with pixel-accurate masks and cleaned prompts for grounding evals — victormustar · 2026-10-31