Conjecture that I thought would not be solved in my lifetime....were

Lance blogged on the OpenAI solutions to many problems here and also created a website of the TCS-related problems OpenAI claims to have solved here.Scott blogged about it here. Terry Tao seems to have had an infinite number of guest bloggers talking about AI and Math even before the OpenAI .... WE NEED A WORD FOR IT.Now it's my turn. For now I will just discuss some of the results without getting into what it means for the future of mathematics, the future of academia, and the future of humanity.--------------------------------1) Let \(G\) be the graph whose vertex set is \(\mathbb{R}^2\), with an edge between every pair of points exactly a unit distance apart. The chromatic number \(\chi(G)\) is called the chromatic number of the plane. For nearly 70 years, all that was known was \( 4\le \chi\le 7\).The proof that \(\chi\ge 4\) is easy.The proof that \(\chi\le 7\) is easy.In 2018, Aubrey de Grey improved the lower bound to 5.The proof that \(\chi\ge 5\) is hard: it involves a…