Beneath the Surface of Chains-of-Thought: A Mechanistic Interpretation of Reasoning Operations in LLMs

Seogyeong Jeong, Jaehui Hwang, Dongyoon Han, Geonmo Gu, Alice Oh, Taekyung Kim

KAIST · NAVER AI Lab

Published September 4, 2026 · on the feed September 7, 2026 · ▲ 10 · arXiv 2609.04753

Reasoning & mathInterpretability & analysis Empty repo arXiv ↗Hugging Face ↗

The abstract

Reasoning in large language models unfolds through diverse functional operations, such as problem formulation, goal decomposition, and deduction. Although these operations are explicitly distinguished in text, little is known about how they are geometrically organized in representation spaces. To this end, we investigate whether distinct reasoning operations exhibit corresponding geometric structure in hidden representations. We find that operations are separable in held-out representations, with separability peaking in middle layers, and verify that this structure is not explained by lexical or positional confounds. Across layers, token-wise operation-alignment becomes more distributed over spans, while identical surface tokens are represented differently depending on the operation of its surrounding chunk. Attention-masking interventions further show that operation-aligned representations at chunk onset depend on preceding reasoning context. Consequently, our work demonstrates that language models maintain representational correspondence between linguistic reasoning expressions and their internal geometric structures. Code and project materials are available at https://github.com/naver-ai/beneath-cot.

The Brief

1:56

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Beneath the Surface of Chains-of-Thought. A Mechanistic Interpretation of Reasoning Operations in LLMs. By Seogyeong Jeong and five others, from KAIST and NAVER AI Lab. Published on the fourth of September. Its code repository is a placeholder: a readme, and nothing to run yet.

Reasoning in a large language model unfolds through functional operations a reader can name: problem formulation, goal decomposition, deduction. Those operations are explicitly distinguished in the text a model produces. What has not been known is whether they are distinguished anywhere inside it. The claim established here is that they are. Distinct reasoning operations exhibit corresponding geometric structure in the hidden representations.

The operations turn out to be separable in held-out representations, and separability peaks in the middle layers rather than climbing steadily with depth. Two further observations sharpen that. Across layers, token-wise operation-alignment becomes more distributed over spans instead of staying concentrated on single tokens. And identical surface tokens are represented differently depending on the operation of the chunk surrounding them, which means the structure is not a property of the words themselves.

That last point is the one the authors take care over, because it is the obvious objection. If operations differ in the words they use, or in where they fall in a sequence, then apparent separability is nothing but a lexical or positional confound. The structure is verified against exactly those explanations and survives them. Attention-masking interventions add a further constraint: operation-aligned representations at chunk onset depend on the preceding reasoning context.

The conclusion is stated as a correspondence. Language models maintain a representational relationship between the linguistic expressions of reasoning and their internal geometric structures. The names we give the steps of a chain of thought are not only descriptions imposed from outside. Something in the middle layers is keeping track of them.

The deep dive

5:37

A longer episode, written from the whole paper. Written and voiced by AI.

Transcript

Beneath the Surface of Chains-of-Thought. A Mechanistic Interpretation of Reasoning Operations in LLMs. By Seogyeong Jeong and five others, from KAIST and NAVER AI Lab. Published on the fourth of September. This is the long version: the whole paper rather than the abstract.

Reasoning models are increasingly trained on the reasoning trajectory itself, not only on whether the final answer is right. Reinforcement learning and search methods optimise the trace. That makes a question urgent which used to be merely interesting: what structure are those training objectives actually shaping inside the model? You can read a chain of thought and see it move between recognisably different activities, formulating the problem, breaking it into parts, recalling a formula, doing arithmetic. Those distinctions are explicit in the text. Whether anything corresponds to them in the representations has not been known.

To ask the question you need a vocabulary for the operations, and the authors borrow one that predates the field entirely: Polya's four-stage account of problem solving from How to Solve It. Under understanding the problem sit extraction, which identifies what the problem explicitly gives you, and direct mapping, which turns a natural-language statement into a formal one. Planning contributes decomposition, the breaking of a problem into subproblems. Carrying out the plan contributes recall of formulas and definitions, deduction from known premises, algebraic manipulation, and arithmetic computation. Looking back contributes the final answer. Eight operations, used as span labels over generated traces.

The trace is then treated not as a homogeneous token sequence but as a sequence of chunks, each a contiguous span serving one functional role. For each operation, a probe learns a direction in representation space, and the test is whether held-out spans of that operation separate from the rest along it. They do, across three models spanning two families, and the separability is strongest in the middle layers rather than rising steadily with depth. The visualisations show what that looks like: project held-out spans onto an operation's own direction and the spans carrying that operation organise along it. The datasets are chosen to cover two different demands: one is computation-heavy mathematics, the other requires applying domain knowledge to theorem-driven questions, so the operations being labelled are not all of one kind.

Two further results describe how the structure develops. Across layers, the operation signal becomes more distributed over the span: early-layer separability is sparse and token-local, while in the middle and later layers it is spread across the tokens of the chunk. So the representation of an operation starts as a property of particular tokens and becomes a property of the passage. And attention-masking interventions show that operation-aligned representations at the onset of a chunk depend on the preceding reasoning context. Mask what came before, and the beginning of the next operation is represented differently. An operation, on this evidence, is not a label the model attaches to a passage after the fact. It is something the preceding trace helps put in place before the passage begins.

The authors are careful about what the taxonomy is. They treat it as an operational framework for analysing textually expressed reasoning functions, explicitly not as a definitive cognitive model and not as an exhaustive account of the model's latent computation. The eight operations are the frequent ones drawn from a broader taxonomy. Everything is measured on mathematical and theorem-driven reasoning, on three models. And one finding complicates the tidy picture: the operation geometry persists but weakens when the reasoning contains factual errors, so the correspondence between what a trace says it is doing and what the representations encode is not unconditional.

What the work establishes is a correspondence, and correspondence is the right word for it. The names we give the steps of a chain of thought are not only descriptions imposed from outside by readers who like taxonomies. Something in the middle layers tracks them, distinguishes them across problems and contexts, and is shaped by what came before. That matters most for where the field is going: if reasoning traces are becoming the object of optimisation, then knowing they have internal geometric structure is the groundwork for intervening in that structure directly.

Paper Quest · 7 chapters · about 40 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

A model's reasoning reads like a sequence of steps. The question is whether the model itself knows that.

You are studying a model that writes out its reasoning before answering maths problems. Reading the text, you can tell when it is restating the problem, splitting it into parts, or deducing a step.

The road ahead

  1. 1 · The problem ~6 min You can see kinds of step in a model's written reasoning, but little is known about whether the model keeps them apart inside.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Hidden states keep kinds of reasoning step apart, most clearly at one depth, and words or position do not explain it.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Label each span by its kind of step, probe hidden states on held-out spans, rule out words and position, then mask earlier context.
  6. 6 · The experiment ~6 min You’ll guess: When kinds of reasoning step are told apart from a model's hidden states, where in the layers is the separation strongest?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.