When an Answer Stops Being Enough
A competition organised by Terence Tao and Damek Davis asked whether mathematical reasoning can be compressed into a page a language model reads before answering. Then its second stage removed the thing that made the first stage easy to fake: an answer was no longer worth anything unless it arrived with a proof a machine would check. This is what I built for both stages, and the moment that convinced me a confident answer and a correct one are completely different products.