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.
More from Research
- Liquid AI's tiny longevity models top GPT-5 and Gemini in Cell-published biology benchmark — JosephJacks_ · 2026-09-18
- No, OpenAI did not solve the Navier-Stokes equations, experts clarify — gerardsans · 2026-09-18
- SPLADE's original author releases new sparse embedding model: 150M params beat models up to 1B — IgorCarron · 2026-09-18
- Gumroad founder openly shares full osteosarcoma genomics, imaging and pathology data — iskander · 2026-09-18
- PointZero: a 3D world model pre-trained without robot data hits SOTA on 3D dynamics — YunzhuLiYZ · 2026-09-18
- Chinese Researchers Open-Source Cache-to-Cache: LLMs Talk Without Tokens, +14.2% Accuracy — Scobleizer · 2026-09-18