Lean-verified improvement tightens Ramsey bound to R(k,k) ≤ 3.49135655ᵏ
ctjlewis · x · 2026-10-18
Developer ctjlewis improved the best-known exponential base for the diagonal Ramsey number: R(k,k) ≤ 3.49135655ᵏ for sufficiently large k, shaving about 0.2% off the previous base.
- The proof refines the method of Zhao, Booth-Clibborn and Schwahn, retaining the complementary-neighbourhood moment constraint, deriving scalar feasibility and envelope laws, and retuning the source/root construction; it builds on Lu and Wang's retained-set descent.
- The result is fully verified in Lean, published via a timestamped SHA-256 hash on hashes.sh, with the EvolvingPrograms/DiagonalRamsey repo (MIT license) organizing the proof into sections S1–S8 for easy auditing.
Related event: Ramsey Upper Bound Improved to 3.49135655^k with Lean Verification(2 posts)→
More from Research
- PyNNDescent 0.7 benchmark: ~6x faster kNN graph builds on 64-core Xeon — leland_mcinnes · 2026-10-18
- Terence Tao: OpenAI's quasi-Riemann result is the biggest advance in 50 years — jracine22 · 2026-10-18
- What is wrong with AI writing - ICLR reviewing edition — bobrodsky · 2026-10-18
- Meta, MIT and Yale propose ReHarness: backward revision for agentic continual learning — HanGuo97 · 2026-10-18
- Fields Medalist Kontsevich: AI Agent Suggested a Better Math Definition — luislamb · 2026-10-18
- NYT Cites MIT–OpenAI Study Linking Extended Chatbot Use to Poorer Well-Being — patpat_mit · 2026-10-18