<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2404.15758/</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/2404.15758/feed.xml" rel="self" type="application/rss+xml" /><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by thefxperson</title><link>https://news.ycombinator.com/item?id=49982367</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:49982367</guid><pubDate>Tue, 06 Oct 2026 18:41:49 GMT</pubDate><description>&lt;p&gt;My understanding is that the extra token vectors generated as reasoning are still useful, but that their surface form (tokens themselves) do not necessarily reflect the underlying reasoning. i.e. reading the reasoning traces could be complete gibberish, but the hidden-dim vectors themselves still refine the latent probabilities and help in generating the correct answer. Not an expert in LLMs, but this seems supported by the abstract of the paper cited in the above article: it remains unclear to what extent these performance gains can be attributed to human-like task decomposition or simply…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by wren6991</title><link>https://news.ycombinator.com/item?id=49824438</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:49824438</guid><pubDate>Thu, 24 Sep 2026 00:06:08 GMT</pubDate><description>&lt;p&gt;I think this is a known phenomenon: even in non-reasoning models, adding useless/filler tokens before an answer improves task performance. The model is doing some computation during the filler. See: https://arxiv.org/html/2404.15758v1&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by khalic</title><link>https://news.ycombinator.com/item?id=49558454</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:49558454</guid><pubDate>Thu, 03 Sep 2026 23:16:23 GMT</pubDate><description>&lt;p&gt;[2404.15758] Let&amp;#x27;s Think Dot by Dot: Hidden Computation in Transformer Language Models https://arxiv.org/abs/2404.15758&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by dannyw</title><link>https://news.ycombinator.com/item?id=49450203</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:49450203</guid><pubDate>Wed, 26 Aug 2026 14:50:35 GMT</pubDate><description>&lt;p&gt;You might already know this, but a large part of test-time compute / &amp;#x27;overthinking&amp;#x27; is just letting the model do more passes, and refine its activation residuals more. For example, even if you make thinking tokens literally just &amp;#x27;....&amp;#x27; (absolutely meaningless; zero information), you still see significant performance improvements: https://arxiv.org/abs/2404.15758 and https://arxiv.org/abs/2607.22925 for some starters. Treat thinking more like a &amp;quot;loading screen message&amp;quot; that&amp;#x27;s been RL&amp;#x27;d to somewhat resemble its actual internal state; which happens in its activations, not tokens.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by neuroticnews25</title><link>https://news.ycombinator.com/item?id=49327205</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:49327205</guid><pubDate>Mon, 17 Aug 2026 06:40:49 GMT</pubDate><description>&lt;p&gt;I was pretty happy with Depseek Pro in Opencode util I discovered I can see the thinking trace by clicking on the &amp;quot;thinking...&amp;quot; communicate. All those seemingly unnecessary &amp;quot;but wait&amp;quot; messages are frustrating to read. But at least to some extent it&amp;#x27;s just model taking time thinking through the problem, and the trace produced doesn&amp;#x27;t have to be representative of what happens internally: https://arxiv.org/abs/2404.15758&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by Chance-Device</title><link>https://news.ycombinator.com/item?id=47649090</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:47649090</guid><pubDate>Sun, 05 Apr 2026 13:12:44 GMT</pubDate><description>&lt;p&gt;Let’s see, I think these pretty much map out a little chronology of the research: https://arxiv.org/abs/2112.00114 https://arxiv.org/abs/2406.06467 https://arxiv.org/abs/2404.15758 https://arxiv.org/abs/2512.12777 First that scratchpads matter, then why they matter, then that they don’t even need to be meaningful tokens, then a conceptual framework for the whole thing.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by prodigycorp</title><link>https://news.ycombinator.com/item?id=47648541</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:47648541</guid><pubDate>Sun, 05 Apr 2026 12:08:59 GMT</pubDate><description>&lt;p&gt;Are you sure about that? Chain of thought does not need to be semantically useful to improve LLM performance. https://arxiv.org/abs/2404.15758&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by Majromax</title><link>https://news.ycombinator.com/item?id=47047917</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:47047917</guid><pubDate>Tue, 17 Feb 2026 14:34:36 GMT</pubDate><description>&lt;p&gt;Thinking happens in latent space, but the thinking trace is then the projection of that thinking onto tokens. Since autoregressive generation involves sampling a specific token and continuing the process, that sampling step is lossy. However, it is a genuine question whether the literal meanings of thinking blocks are important over their less-observable latent meanings. The ultimate latent state attributable to the last-generated thinking token is some combination of the actual token (literal meaning) and recurrent thinking thus far. The latter does have some value; a 2024 paper…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by krackers</title><link>https://news.ycombinator.com/item?id=44475057</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:44475057</guid><pubDate>Sat, 05 Jul 2025 19:49:20 GMT</pubDate><description>&lt;p&gt;There are several such papers, off the top of my head one is https://arxiv.org/abs/2404.15758 It&amp;#x27;s a bit more subtle though, if I understand correctly this only works for parallelizable problems. Which makes intuitive sense since the model cannot pass information along with each dot. So in that sense COT can be seen as some form of sampling, which also tracks with findings that COT doesn&amp;#x27;t boost the &amp;quot;raw intelligence&amp;quot; but rather uncovers latent intelligence, converting pass@k to maj@k. Antirez touches upon this in [1]. On the other hand, I think problems with serial dependencies require…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by layoric</title><link>https://news.ycombinator.com/item?id=44067910</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:44067910</guid><pubDate>Thu, 22 May 2025 22:37:19 GMT</pubDate><description>&lt;p&gt;There are several papers pointing towards &amp;#x27;thinking&amp;#x27; output is meaningless to the final output, and using dots, or pause tokens enabling the same additional rounds of throughput result in similar improvements. So in a lot of regards the &amp;#x27;thinking&amp;#x27; is mostly marketing. - &amp;quot;Think before you speak: Training Language Models With Pause Tokens&amp;quot; - https://arxiv.org/abs/2310.02226 - &amp;quot;Let&amp;#x27;s Think Dot by Dot: Hidden Computation in Transformer Language Models&amp;quot; - https://arxiv.org/abs/2404.15758 - &amp;quot;Do LLMs Really Think Step-by-step In Implicit Reasoning?&amp;quot; - https://arxiv.org/abs/2411.15862 - Video by…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by andai</title><link>https://news.ycombinator.com/item?id=43455284</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:43455284</guid><pubDate>Sun, 23 Mar 2025 19:37:29 GMT</pubDate><description>&lt;p&gt;Here&amp;#x27;s one where just appending dots to the output improved quality: https://arxiv.org/abs/2404.15758&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by gardnr</title><link>https://news.ycombinator.com/item?id=43451202</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:43451202</guid><pubDate>Sun, 23 Mar 2025 06:25:36 GMT</pubDate><description>&lt;p&gt;There was a paper[1] from last year where the authors discovered getting the model to output anything during times of uncertainty, improved the generations overall. If all of the post-training alignment reasoning starts with the same tokens then I could see how it would condition the model to continue the reasoning phase. 1: https://arxiv.org/abs/2404.15758&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by mistercow</title><link>https://news.ycombinator.com/item?id=42829870</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:42829870</guid><pubDate>Sun, 26 Jan 2025 13:12:06 GMT</pubDate><description>&lt;p&gt;Has anyone done a benchmark on these reasoning models compared to simply prompting &amp;quot;non-reasoning&amp;quot; LLMs with massive chain of thought? For example, a go to test I&amp;#x27;ve used (but will have to stop using soon) is: &amp;quot;Write some JS code to find the smallest four digit prime number whose digits are in strictly descending order&amp;quot; That prompt, on its own, usually leads to an incorrect response with non-reasoning models. They almost always forget the &amp;quot;smallest&amp;quot; part, and give the largest four digit prime with descending digits instead. If I prompt o1, it takes longer, but gives the correct answer. If I…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by mistercow</title><link>https://news.ycombinator.com/item?id=41046719</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:41046719</guid><pubDate>Tue, 23 Jul 2024 15:04:29 GMT</pubDate><description>&lt;p&gt;Absolutely. I&amp;#x27;m just making a more general point that &amp;quot;the same information in fewer tokens&amp;quot; does not mean &amp;quot;more comprehensible to an LLM&amp;quot;. And we have more practical evidence that that&amp;#x27;s not the case, like the recent &amp;quot;Let&amp;#x27;s Think Dot by Dot&amp;quot; paper, which found that you can get many of the benefits of chain-of-thought simply by adding filler tokens to your context (if your model is trained to deal with filler tokens). For that matter, chain-of-thought itself is an example of increasing the tokens:information ratio, and generally improves LLM performance. That&amp;#x27;s not to say that I think that…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by FeepingCreature</title><link>https://news.ycombinator.com/item?id=40483259</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:40483259</guid><pubDate>Sun, 26 May 2024 16:12:19 GMT</pubDate><description>&lt;p&gt;&amp;gt; A LLM is not busy humming away, thinking on it&amp;#x27;s own. Let&amp;#x27;s Think Dot by Dot: Hidden Computation in Transformer Language Models https://arxiv.org/abs/2404.15758 A LLM will readily hum away, thinking on its own, if given the option.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by zargon</title><link>https://news.ycombinator.com/item?id=40480511</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:40480511</guid><pubDate>Sun, 26 May 2024 08:21:25 GMT</pubDate><description>&lt;p&gt;The tokens don&amp;#x27;t have to be related to the task at all. (From an outside perspective. The connections are internal in the model. That might raise transparency concerns.) A single designated &amp;#x27;compute token&amp;#x27; repeated over and over can perform as well as traditional &amp;#x27;chain of thought.&amp;#x27; See for example, Let&amp;#x27;s Think Dot by Dot (https://arxiv.org/abs/2404.15758).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by spencerchubb</title><link>https://news.ycombinator.com/item?id=40479626</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:40479626</guid><pubDate>Sun, 26 May 2024 03:40:00 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2404.15758&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by FeepingCreature</title><link>https://news.ycombinator.com/item?id=40333646</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:40333646</guid><pubDate>Sun, 12 May 2024 11:48:01 GMT</pubDate><description>&lt;p&gt;Saying that LLMs should be able to do problems without CoT is a bit like saying that humans should be able to write programs without thinking though. CoT is fundamentally an architectural necessity owed to the finite cognitive effort possible per token. Let it be CoT, let it be QuietSTaR ( https://arxiv.org/abs/2403.09629 ), let it be pause tokens ( https://arxiv.org/abs/2310.02226 ), let it even be dots ( https://arxiv.org/abs/2404.15758 ), but the thinking has to happen somewhere. I think mostly, LLMs at the moment are incredibly uneven. LLM assistants can pull obscure knowledge out of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — mentioned by richdougherty</title><link>https://news.ycombinator.com/item?id=40330303</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.15758:40330303</guid><pubDate>Sat, 11 May 2024 19:59:38 GMT</pubDate><description>&lt;p&gt;Related? &amp;quot;Let&amp;#x27;s Think Dot by Dot: Hidden Computation in Transformer Language Models&amp;quot; https://arxiv.org/abs/2404.15758 &amp;gt; Chain-of-thought responses from language models improve performance across most benchmarks. However, it remains unclear to what extent these performance gains can be attributed to human-like task decomposition or simply the greater computation that additional tokens allow. We show that transformers can use meaningless filler tokens (e.g., &amp;#x27;......&amp;#x27;) in place of a chain of thought to solve two hard algorithmic tasks they could not solve when responding without intermediate…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Let's Think Dot by Dot: Hidden Computation in Transformer Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=40182695</link><guid isPermaLink="false">urn:hackerpapers:submission:2404.15758:40182695</guid><pubDate>Sat, 27 Apr 2024 19:28:26 GMT</pubDate><description>&lt;p&gt;Let&amp;#x27;s Think Dot by Dot: Hidden Computation in Transformer Language Models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;159 points; 32 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2404.15758/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
