GO TO A SECTION

↑ ↓ to navigate · Enter to openExplore all sections →
FDEInterviews logo
arXiv preprint

Let's Think Dot by Dot: Hidden Computation in Transformer Language Models

Replace a chain of thought with a row of dots and a small transformer still solves a task it fails without them. The dots carry no information, only computation that no reader of the output can see.

Breakdown by FDE Interviews · 11 min read · Updated

About the original · 2024
AUTHORS
Pfau, Merrill, Bowman
FROM
New York University
PUBLISHED
Apr 2024 · arXiv preprint
CITED BY
262Semantic Scholar · Nov 2026
IN THIS BREAKDOWN · 10 SECTIONS

You can read 21% of this breakdown.

01

The paper in one minute

When a model writes a chain of thought, two things change: the text contains useful intermediate steps, and the model gets more forward passes before it answers. This paper separates the two. It replaces the chain of thought with filler, a string of dots, which carries no information. If accuracy still rises, the gain came from the extra computation, and that computation is invisible to anyone reading the tokens.

Large commercial models showed no benefit from filler in earlier tests on QA and math benchmarks. The authors argue those tasks were the wrong test. Theory says a transformer answering in one pass can solve only fairly parallel problems, and filler tokens add parallel width rather than sequential steps. So they built tasks that need parallel width. In 3SUM, the model sees a list of small vectors and must say whether any three sum to zero modulo 10. Its chain of thought lists every pairwise sum, which is exactly the kind of work each dot's hidden state can do in parallel. In 2SUM-Transform, the inputs are scrambled by a transformation revealed only at the end, so no work can be done until the last token.

A small 4-layer, 34M-parameter Llama trained on a mix of chain-of-thought and filler sequences solved length-12 3SUM perfectly from filler alone, while models without intermediate tokens stalled at 66%. On 2SUM-Transform, filler scored 93.6% against 95.1% for chain of thought and 78.7% for an immediate answer. The model learned to use filler only when trained with chain-of-thought examples whose steps were parallel; filler-only training or serial chain of thought did not teach it.

THE IDEA, VISUALLY
THREE WAYS TO ANSWER (FIGURE 1) chain of thought 01 10 73 27 : 11 74 28 83 37 90 ANS True filler tokens 01 10 73 27 : . . . . . . . . . . . . ANS True immediate answer 01 10 73 27 : ANS ? THE TASK (SECTION 3.1) 3SUM: is there a triple i, j, k with x_i + x_j + x_k = 0 (mod 10)? Here (8,3) = x1 + x2 and (2,7) = x3, so 8+2 and 3+7 wrap to 0. Each dot can hold one pairwise sum in its hidden state; the answer token then looks for a pair that cancels a third. Filler gives depth of computation, not information: transformers with filler stay in the class TC0, but can resolve more nested 'there exists' quantifiers at once. Learning to use filler needed parallel chain-of-thought examples; serial, instance-adaptive ones did not transfer. 3SUM, LLAMA 34M, 4 LAYERS (FIGURE 2, SECTION 4.3) length 12, filler 100% length 12, no filler 66% length 14, trained on filler only 71% frozen model, last layer retrained: 98% with 60% of the dots 2SUM-TRANSFORM, BEST OF 5 RUNS (TABLE 1) chain of thought 95.1% filler (input repeated back) 93.6% no intermediate tokens 78.7% majority class 63.0% filler recovers 91% of chain of thought's gain (our arithmetic) Claude 2 and GPT-3.5 showed no filler benefit on QA and math benchmarks (prior work cited here). arXiv 2404.15758, New York University, 2024
Three ways to answer a 3SUM question: write every pairwise sum, write the same number of dots, or answer at once. A 34M-parameter Llama model trained with dots solved length-12 instances perfectly and scored 66% without them. On 2SUM-Transform, dots recovered about 91% of chain of thought's gain over answering directly. The catch: the model only learned to use dots when trained alongside chain-of-thought examples with the same parallel structure.
Research notes: the problem, approach and results
100% vs 66%

length-12 3SUM accuracy with and without filler tokens, 34M Llama (Section 4.2)

93.6%

2SUM-Transform with filler, against 95.1% chain of thought and 78.7% immediate answer (Table 1)

98%

accuracy when a probe reads only the first 60% of the filler tokens (Figure 4)

THE PROBLEM

Chain of thought helps language models, but it is unclear whether the written steps do the work or whether the extra tokens simply give the model more computation. If the latter, models could compute in ways their visible reasoning does not show.

THE IDEA

Replace the chain of thought with meaningless filler tokens ('......') and test whether a transformer can still solve tasks it fails at when answering immediately. Use synthetic tasks, 3SUM and 2SUM-Transform, that theory suggests one forward pass cannot solve but that decompose into parallel steps.

THE RESULT

A 34M-parameter Llama reached 100% on length-12 3SUM with filler tokens against 66% without, and 93.6% on 2SUM-Transform against 78.7%. Learning to use filler required dense, parallel chain-of-thought supervision; with filler-only or serial chain-of-thought training it did not happen.

02

Why it matters to an FDE

This is a small-model, synthetic-task paper, but it sharpens a question that comes up in every regulated deployment: does the reasoning a model shows explain how it reached the answer?

Visible reasoning is not a full record. The paper shows that intermediate tokens can carry computation unrelated to what they say. When a customer plans to audit decisions by reading a model's chain of thought, explain that the text is evidence about the reasoning, not a transcript of it, and keep independent checks on the decisions themselves.

Monitoring outputs has a blind spot. The authors point out that most alignment and safety methods judge output tokens. Computation hidden in filler cannot be judged that way. Output monitoring is still useful; it is not sufficient on its own for high-stakes systems.

Current models do not seem to do this, and that can change. Earlier tests found no filler benefit in Claude 2 or GPT-3.5 on QA and math, and this paper needed special training to get it in a small model. The result says the capacity exists in the architecture, not that deployed models use it.

THE FULL BREAKDOWN

Understand the mechanism. Try it on a real problem.

Unlock this breakdown and 290 more papers.

Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.

6 months · One payment · No auto-renewal

Get Premium · ₹2,000 / $25
  • ◇1 architecture diagram
  • </>1 runnable code experiment
  • ▦2 results tables
  • ?5 interview questions with answers
  1. 03Key takeaways

    What filler tokens add, which tasks benefit, how models learn them and two misreadings

    Free account
  2. 04How it works

    The tasks and their encodings, the model, training mixtures, the probe and the theory

    Premium
  3. 05The numbers that matter

    3SUM by length and dimension, the probe, the training ablations and the 2SUM table

    Premium
  4. 06Try it yourself

    Solve the worked example, count filler tokens, check base rates and recompute Table 1

    Premium
  5. 07Where it breaks

    Toy models and tasks, unusual encodings, hard learning and unstated base rates

    Premium
  6. 08Using it on a deployment

    Auditing reasoning, designing faithfulness checks, and what to tell a risk team

    Premium
  7. 09Interview angles

    Five questions this paper prepares you for, with answer hints

    Premium
Back to the paper library →