Researchers have introduced a novel code-based challenge aimed at automating mathematical discovery for the $k$-server conjecture, a longstanding open problem in competitive analysis. The $k$-server conjecture is a fundamental problem that has far-reaching implications for various fields, including computer science and optimization. The challenge, dubbed $k$-server-bench, involves discovering a potential function that satisfies a complex system of linear inequalities structured as a large graph. Any violation of these inequalities can definitively refute a candidate solution, making the evaluation procedure sound but incomplete1. This development has significant implications for the field of artificial intelligence, as it can potentially lead to breakthroughs in automated mathematical discovery. The $k$-server-bench challenge can also have a broader impact on policy, security, and workforce dynamics, particularly in areas where AI developments from decentralized finance are being applied. So what matters to practitioners is that this challenge can pave the way for more efficient and automated solutions to complex mathematical problems.