<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2507.15855/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2507.15855/feed.xml" rel="self" type="application/rss+xml" /><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — mentioned by CamperBob2</title><link>https://news.ycombinator.com/item?id=46465732</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.15855:46465732</guid><pubDate>Fri, 02 Jan 2026 15:32:53 GMT</pubDate><description>&lt;p&gt;Except of course it&amp;#x27;s not true lol. Horses are smart critters, but they absolutely cannot do arithmetic no matter how much you train them. These things are not horses. How can anyone choose to remain so ignorant in the face of irrefutable evidence that they&amp;#x27;re wrong? https://arxiv.org/abs/2507.15855 It&amp;#x27;s as if a disease like COVID swept through the population, and every human&amp;#x27;s IQ dropped 10 to 15 points while our machines grew smarter to an even larger degree.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — mentioned by NitpickLawyer</title><link>https://news.ycombinator.com/item?id=45898248</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.15855:45898248</guid><pubDate>Wed, 12 Nov 2025 09:49:44 GMT</pubDate><description>&lt;p&gt;a) no, gemini 2.5 was shown to &amp;quot;win&amp;quot; gold w/o tools. - https://arxiv.org/html/2507.15855v1 b) reductionism isn&amp;#x27;t worth our time. Planning works in the real world, today. (try any agentic tool like cc/codex/whatever). And if you&amp;#x27;re set on the purist view, there&amp;#x27;s mounting evidence from anthropic that there is planning in the core of an LLM. c) so ... not true? Long context works today. This is simply moving goalposts and nothing more. X can&amp;#x27;t do Y -&amp;gt; well, here they are doing Y -&amp;gt; well, not like that.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — mentioned by impossiblefork</title><link>https://news.ycombinator.com/item?id=45544028</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.15855:45544028</guid><pubDate>Fri, 10 Oct 2025 21:34:10 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s reasonable to question it, but there&amp;#x27;s a fun Chinese paper (https://arxiv.org/abs/2507.15855) where they attempt to create a system of prompts that can be used with commercial LLMs to solve hard maths problems. It turns out that they can use the same prompt system for all of them, with no changes and still solve 5/6 IMO problems. I think this is possibly iffy, since people might have updated the models etc., but it&amp;#x27;s pretty obvious that this kind of thing is how OpenAI are doing their multi-stage thinking thing for maths internally. Consequently if prompt systems are this transferable…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — mentioned by dang</title><link>https://news.ycombinator.com/item?id=45483654</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.15855:45483654</guid><pubDate>Sun, 05 Oct 2025 17:50:37 GMT</pubDate><description>&lt;p&gt;We&amp;#x27;ve changed the top link to that from https://arxiv.org/abs/2507.15855. Thanks!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — mentioned by yorwba</title><link>https://news.ycombinator.com/item?id=45483415</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.15855:45483415</guid><pubDate>Sun, 05 Oct 2025 17:22:49 GMT</pubDate><description>&lt;p&gt;I think you meant to link to Implicit Actor Critic Coupling via a Supervised Learning Framework for RLVR https://arxiv.org/abs/2509.02522 not Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline https://arxiv.org/abs/2507.15855&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — mentioned by jsnell</title><link>https://news.ycombinator.com/item?id=45280358</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.15855:45280358</guid><pubDate>Wed, 17 Sep 2025 19:30:11 GMT</pubDate><description>&lt;p&gt;A terse prompt and expecting a one-shot answer is really not how you&amp;#x27;d get an LLM to solve complex problems. I don&amp;#x27;t know what Deepmind and OpenAI did in this case, but to get an idea of the kind of scaffolding and prompting strategy that one might want, have a look at this paper where some floks used the normal generally available Gemini Pro 2.5 to solve 5/6 of the 2025 IMO problems: https://arxiv.org/pdf/2507.15855&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — mentioned by starchild3001</title><link>https://news.ycombinator.com/item?id=45009917</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.15855:45009917</guid><pubDate>Mon, 25 Aug 2025 03:28:28 GMT</pubDate><description>&lt;p&gt;Hypothesis: If you had ~1M dollar to burn, I think we should try setting up an AI agent to explore and try to invent new mathematics. It turns out agents can get an IMO gold with Gemini 2.5 Pro production model only. Therefore I suspect a swarm of agents burning through tokens like there&amp;#x27;s no tomorrow can invent new math. Reference: https://arxiv.org/abs/2507.15855 Alternative: If Gemini Deep Think or GPT5-Pro people are listening, I think they should give free access to their models with potential scaffolding (ie. agentic workflow) to say some ~100 researchers to see if any of them can prove…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — mentioned by 986aignan</title><link>https://news.ycombinator.com/item?id=44848474</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.15855:44848474</guid><pubDate>Sat, 09 Aug 2025 17:41:47 GMT</pubDate><description>&lt;p&gt;It is possible to take this too far, though - consider the OpenAI IMO proofs[1], for instance, and compare them to Gemini&amp;#x27;s.[2] [1] https://github.com/aw31/openai-imo-2025-proofs [2] https://arxiv.org/pdf/2507.15855 Appendix A&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — mentioned by demirbey05</title><link>https://news.ycombinator.com/item?id=44827871</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.15855:44827871</guid><pubDate>Thu, 07 Aug 2025 17:50:31 GMT</pubDate><description>&lt;p&gt;IMO is not breakthrough, if you craft proper prompts you can excel imo with 2.5 Pro. Paper : https://arxiv.org/abs/2507.15855. Google just put whole computational power with very high quality data. It was test-time scaling. Why it didn&amp;#x27;t solve problem 6 as well? Yes, it was breakthrough but saturated quickly. Wait for next breakthrough. If they can build adapting weights in llm we can talk different things but test time scaling coming to end with increasing hallucination rate. No sign for AGI.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — HN submission</title><link>https://news.ycombinator.com/item?id=44684197</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.15855:44684197</guid><pubDate>Fri, 25 Jul 2025 15:24:29 GMT</pubDate><description>&lt;p&gt;Gemini 2.5 Pro Capable of Winning Gold at IMO 2025&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — HN submission</title><link>https://news.ycombinator.com/item?id=44666513</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.15855:44666513</guid><pubDate>Thu, 24 Jul 2025 03:16:37 GMT</pubDate><description>&lt;p&gt;Gemini 2.5 Pro Capable of Winning Gold at IMO 2025 with Prompting&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 3 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — mentioned by bwfan123</title><link>https://news.ycombinator.com/item?id=44648558</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.15855:44648558</guid><pubDate>Tue, 22 Jul 2025 15:41:20 GMT</pubDate><description>&lt;p&gt;This paper [1] shows that gemini pro 2.5 without data-contamination and some minimal prompting (llm orchestration) can solve problems 1-5 on imo 2025. [1] https://arxiv.org/pdf/2507.15855 For problems with 2 page solutions, the search space of solutions is likely limited, and hence could be brute-forced by a search. Combinatorics is likely the hold-out since there are no set approaches one could take ie training data wont cover the space of techniques - which could explain why problem 6 stumped the llms. Also, in the future the minimal diligence IMO problem setters could do is to test against…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Winning Gold at IMO 2025 with a Model-Agnostic Verification-and-Refinement Pipeline — HN submission</title><link>https://news.ycombinator.com/item?id=44643300</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.15855:44643300</guid><pubDate>Tue, 22 Jul 2025 04:43:06 GMT</pubDate><description>&lt;p&gt;Gemini 2.5 Pro Capable of Winning Gold at IMO 2025&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2507.15855/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
