<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Solving a Million-Step LLM Task with Zero Errors · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2511.09030/</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/2511.09030/feed.xml" rel="self" type="application/rss+xml" /><item><title>Solving a Million-Step LLM Task with Zero Errors — mentioned by nprz</title><link>https://news.ycombinator.com/item?id=46903666</link><guid isPermaLink="false">urn:hackerpapers:mention:2511.09030:46903666</guid><pubDate>Thu, 05 Feb 2026 19:10:54 GMT</pubDate><description>&lt;p&gt;There is research[0] currently being done on how to divide tasks and combine the answers to LLMs. This approach allows LLMs reach outcomes (solving a problem that requires 1 million steps) which would be impossible otherwise. [0]https://arxiv.org/abs/2511.09030&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2511.09030/"&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>Solving a Million-Step LLM Task with Zero Errors — mentioned by jdironman</title><link>https://news.ycombinator.com/item?id=46188060</link><guid isPermaLink="false">urn:hackerpapers:mention:2511.09030:46188060</guid><pubDate>Mon, 08 Dec 2025 03:46:14 GMT</pubDate><description>&lt;p&gt;I am going to give this a shot, but using a method I have been using lately with subagents. Basically, what I do is have it create an Architect, Executor, Adjudicator subagents. Architect breaks any ask down into atomic and testable subtasks that take 1-3 minutes &amp;#x27;dev&amp;#x27; time. Executor (can spawn more than one) implements them. Then adjudicator reviews that they are to spec / requirements. This all happens in subagent files + a runbook.json in the .claude folder of a project. Its based on a paper* that was featured on here a while back actually [1]. [1] https://arxiv.org/abs/2511.09030&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2511.09030/"&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>Solving a Million-Step LLM Task with Zero Errors — HN submission</title><link>https://news.ycombinator.com/item?id=45968362</link><guid isPermaLink="false">urn:hackerpapers:submission:2511.09030:45968362</guid><pubDate>Tue, 18 Nov 2025 16:26:28 GMT</pubDate><description>&lt;p&gt;Solving a million-step LLM task with zero errors&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;222 points; 95 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2511.09030/"&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>Solving a Million-Step LLM Task with Zero Errors — HN submission</title><link>https://news.ycombinator.com/item?id=45941820</link><guid isPermaLink="false">urn:hackerpapers:submission:2511.09030:45941820</guid><pubDate>Sun, 16 Nov 2025 00:52:50 GMT</pubDate><description>&lt;p&gt;Solving a Million-Step LLM Task with Zero Errors&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2511.09030/"&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>Solving a Million-Step LLM Task with Zero Errors — mentioned by jarrattp31</title><link>https://news.ycombinator.com/item?id=45929012</link><guid isPermaLink="false">urn:hackerpapers:mention:2511.09030:45929012</guid><pubDate>Fri, 14 Nov 2025 17:16:09 GMT</pubDate><description>&lt;p&gt;Apple’s Illusion of Thinking study showed how even strong LLMs lose reliability as reasoning chains grow. Our new research demonstrates the first system to complete 1M+ dependent reasoning steps with zero errors using a decomposed, microagent-based approach. Paper: https://arxiv.org/abs/2511.09030 Blog: https://www.cognizant.com/us/en/ai-lab/blog/maker&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2511.09030/"&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>Solving a Million-Step LLM Task with Zero Errors — HN submission</title><link>https://news.ycombinator.com/item?id=45929011</link><guid isPermaLink="false">urn:hackerpapers:submission:2511.09030:45929011</guid><pubDate>Fri, 14 Nov 2025 17:16:09 GMT</pubDate><description>&lt;p&gt;First Agentic System to Solve a Million-Step Reasoning Problem with Zero Errors&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2511.09030/"&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>
