Rumor: multiple vagueposts hint a polynomial-time factoring algorithm is close, heavily salted
ZeroStateReflex · x · 2026-11-22
Xenoimpulse (retweeted by repligate) reports that a friend with a track record of accurate OpenAI/Ant math rumor predictions says several people around him are vagueposting about a polynomial-time factoring algorithm being close.
The poster explicitly advises taking it "with an entire shaker of salt" — it's a secondhand rumor with no paper or evidence. If real, such an algorithm would break RSA and most mainstream public-key cryptography.
More from Research
- Kenneth Stanley: AI's Riemann proof vindicates 'Why Greatness Cannot Be Planned' — kenneth0stanley · 2026-11-22
- Numberphile is now tracking the Riemann proof saga — 'it's over' — shauseth · 2026-11-22
- Kasparov on AI math: brute force beat humans at chess without thinking like us — stevenstrogatz · 2026-11-22
- Claude re-checks paper appendix: plain 1-5 ratings (89.6%) match headline SSR figure (90.2%) — scaling01 · 2026-11-22
- After the Riemann proof buzz, Cell essay asks which cancer questions AI can crack — marinkazitnik · 2026-11-22
- Reddit asks: why do OpenAI, Anthropic, and Google models sound almost identical? — retrorays · 2026-11-22