Conjectures claims two Erdős problem solutions per day via Bittensor, including a 55-year-old open question
markjeffrey · x · 2026-09-18
Conjectures announced miner-found solutions to two Erdős problems, now solving at a rate of two per day, powered by Bittensor. The first, Erdős Problem 108 — open for 55 years — disproves the conjecture by constructing graphs with arbitrarily high chromatic number whose C4-free subgraphs need at most six colors.
Related event: Bittensor Subnet Solves Six Decades-Old Open Math Problems in Ten Days(4 posts)→
More from Research
- Tencent unveils Hyra 2.0, a research agent that builds reusable scientific tools — TencentHunyuan · 2026-11-02
- What broke when I ran a leaderless agent swarm with no orchestrator — 7 failure modes and fixes — LostHumanity67 · 2026-11-02
- Forced yes/no prompts push GPT and Claude to 95%+ confidence on Goldbach's unproved halt test — Nir777 · 2026-11-02
- General Reasoning explains how to train agent swarms with RL and latency pressure — rosstaylor90 · 2026-11-02
- Mathematician Tony Feng: current-paradigm LLMs lack the diversity of thought research needs — littmath · 2026-11-02
- Measure Theory vs Probability: 'You're Confusing the Finger With the Moon' — LucaAmb · 2026-11-02