<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Evaluation on AmeyArc</title><link>https://amey-thakur.github.io/tags/evaluation/</link><description>Recent content in Evaluation on AmeyArc</description><generator>Hugo -- 0.152.2</generator><language>en-us</language><lastBuildDate>Mon, 31 Aug 2026 19:59:59 -0400</lastBuildDate><atom:link href="https://amey-thakur.github.io/tags/evaluation/index.xml" rel="self" type="application/rss+xml"/><item><title>When an Answer Stops Being Enough</title><link>https://amey-thakur.github.io/posts/2026-08-31-when-an-answer-stops-being-enough/</link><pubDate>Mon, 31 Aug 2026 19:59:59 -0400</pubDate><guid>https://amey-thakur.github.io/posts/2026-08-31-when-an-answer-stops-being-enough/</guid><description>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.</description></item></channel></rss>