<?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>SAIR Foundation on AmeyArc</title><link>https://amey-thakur.github.io/tags/sair-foundation/</link><description>Recent content in SAIR Foundation 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/sair-foundation/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><item><title>Twenty-Five Thousand Groups, and the Ones Nobody Can Reach</title><link>https://amey-thakur.github.io/posts/2026-08-15-twenty-five-thousand-groups-and-the-ones-nobody-can-reach/</link><pubDate>Sat, 15 Aug 2026 19:59:59 -0400</pubDate><guid>https://amey-thakur.github.io/posts/2026-08-15-twenty-five-thousand-groups-and-the-ones-nobody-can-reach/</guid><description>There is a question in mathematics that has been open since the 1800s, and for one slice of it you can now attack it by search. I built a factory that produced degree-24 polynomials, submitted ten thousand scoreable pairs to a competition organised with the LMFDB and Terence Tao, and finished 54th of 256 with a score of 2.36. The interesting part is not the rank. It is that I can prove, with numbers, exactly why the score was small, and the answer says something about how these searches should be run.</description></item><item><title>Can a Neural Network Learn Exact Arithmetic?</title><link>https://amey-thakur.github.io/posts/2026-08-12-can-a-neural-network-learn-exact-arithmetic/</link><pubDate>Wed, 12 Aug 2026 19:59:59 -0400</pubDate><guid>https://amey-thakur.github.io/posts/2026-08-12-can-a-neural-network-learn-exact-arithmetic/</guid><description>A calculator multiplies two thousand-digit numbers and takes the remainder without thinking about it. Ask a neural network to do the same thing and it becomes an open research question, one that Terence Tao helped set as a competition. The answer has to be exact, because a remainder that is off by one is simply wrong. This is what I submitted to the SAIR Foundation&amp;rsquo;s Modular Arithmetic Challenge, why the obvious approach cannot work, and the one idea that made the difference.</description></item></channel></rss>