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
- Proxy Policy Steering adapts frozen VLA models to new tasks at inference time — weichiuma · 2026-09-14
- New research: standard SGD matches AdamW for LLM RL training, with far less memory overhead — zhaoran_wang · 2026-09-14
- RSI work separates practical harness self-improvement from unproven intelligence explosion — arthurcolle · 2026-09-14
- Amazon Proposes Query-Aware Index Pruning to Optimize Retrieval Under Budget Constraints — _reachsumit · 2026-09-14
- New Paper Finds Retrieval Signals Give No Reliable Routing Gain in Adaptive Multimodal RAG — _reachsumit · 2026-09-14
- Google: Graph RAG Cuts API Hallucination Rate from 56.4% to 16.2% in Java-to-Python Migration — _reachsumit · 2026-09-14