"Mathematics just got a compiler": Cambridge talk on 290K-theorem library and AI verification
satnam6502 · x · 2026-11-15
The author previews a University of Cambridge talk on how "mathematics just got a compiler":
- A library of 290,000+ theorems now accessible to non-mathematicians
- History of interactive theorem provers for hardware verification, from Mike Gordon's work through Cambridge researchers Paulson, Sewell, Armstrong, and Jamnik
- The virtuous cycle: AI needs formal proofs of its output, while AI makes formal proof cheap and automatic
- SAIL-based verification of a RISC-V processor against a formal ISA specification
- A JSON scanner circuit derived from its specification via proved-correct transformations
More from AGI Musings
- 45 days talking to one personal AI agent: "minimum control, minimum friction" wins — perilli · 2026-11-15
- 12 lessons from Jensen Huang's YC interview: textbooks saved NVIDIA, AI kills tasks not jobs — tibo_maker · 2026-11-15
- Microsoft's 15-hour outage: why a senior engineer says AI won't replace programmers — amaarora · 2026-11-15
- Dev-turned-Ops argues Ops roles may be more resilient to AI agents than Dev jobs — cl3don · 2026-11-15
- Ramez: Highest-Benefit AI Policy Is Forcing Labs to Disclose Research Data — latticecut · 2026-11-15
- AI safety researcher models RSI timelines against his kid's school start — HaydnBelfield · 2026-11-15