Bittensor subnet cracks 16-year-old Green's Problem 51, verified in Lean
markjeffrey · x · 2026-09-13
Conjectures, a Bittensor subnet for incentivized mathematical discovery, reports that its miners found a near half density solution to Green's Problem 51 — a 16-year-old open problem — and had it formally verified in Lean.
It's a clean example of incentive mechanisms turning distributed compute into checkable mathematical progress: miners compete for solutions, and the result is machine-verified rather than relying solely on human review.
More from Research
- AIR: Effective-Learning-Rate Scheduler Beats Cosine on 128B-Token MoE Pretraining — stochasticchasm · 2026-10-30
- NVIDIA researcher: train robot policies with privileged sim info, improving Pi 0.5 — wellecks · 2026-10-30
- DeepMind's f_charton shares his take on the current state of AI and mathematics in Sorbonne talk — f_charton · 2026-10-30
- Gym-Anything launches: 200 robot RL environments across 25 simulations — wellecks · 2026-10-30
- What coding agents actually see when searching MCP tools — and why discoverability is bad — _babush_ · 2026-10-30
- Interpretability goes to production: diagnosing real-world LLM failures via internal states — burkov · 2026-10-30