Cryptographer Matthew Green uses Claude to unpack ETH's new Lean-verified complexity result
matthew_d_green · x · 2026-10-27
Security researcher Matthew Green highlighted a new ETH result (stunning if the Lean proof holds, even if only barely numerically) and asked Claude to reason through it: we may live in "Subexponentia," where we asymptotically have all the public-key crypto we want but SAT remains around 2^{n^{0.01}} — your GPG keys stay safe, though you may need a new hard drive to store them.
Related event: Cryptographer Says New ETH Lean Proof Could Reveal a Subexponential World(2 posts)→
More from Fun
- Model breeding begins: neuron combo makes Qwen believe it's Cookie Monster — yacineMTB · 2026-10-27
- Anthropic IPO talk reaches boomers: 84-year-old mom texts "Anthropic is going public" — geoffwolfe · 2026-10-27
- Founding-age list goes viral: Dario Amodei was 38, most tech founders were 30 — akbirthko · 2026-10-27
- AI circle joke: dismantling Mercury would be easier than building housing in the Bay Area — generativist · 2026-10-27
- davidfowl claps back at theo: too many hand-merged PRs means you work with people, not agents — rakyll · 2026-10-27
- "Living on-call with Codex and Claude": devs joke their agents pager them 24/7 — sloppenheimer · 2026-10-27