GPT-6 Astra shows its work in a fifth of Claude Sonnet 5’s steps

2 hours ago

Four AI models solve the same competition math problem, and all four get it right. GPT-6 Astra from OpenAI writes out its working in seven hundred and fifty-seven characters. Claude Sonnet 5 writes more than eleven thousand characters. That working is the chain of thought, the reasoning a model writes out before its answer, like scratch work on an exam. OpenAI and Anthropic usually hide it and show only the answer or a summary. This paper gets that working out of four models with a single trick, then compares them. Astra uses every kind of reasoning step the others use. Astra writes down far fewer side attempts and leaves routine arithmetic unwritten. And a small model handed Astra's short working gets less out of it.

Ask

Ask about this presentation

Answers are generated from this presentation.

Chapters

  1. 0:00GPT-6 Astra solves the same math problem as Claude with a fraction of the written working
  2. 0:42The authors give each model a tool that does nothing except hold its reasoning
  3. 1:05Each call gets a one-word reply, and the model keeps writing until it answers
  4. 1:39Reasoning in the box wins back most of what built-in reasoning adds
  5. 2:20The authors turn each written trace into a tree with one node per step
  6. 2:48Astra’s typical tree goes as deep as Claude’s with a fraction of the branches
  7. 3:32Astra’s working is the shortest and the hardest to compress on all three tests
  8. 4:02Small models get less out of Astra’s working than out of Opus 4.8’s or Sol’s
  9. 4:49The box shows what a model writes, and the authors can’t see further inside
  10. 5:35Read it for the tree comparison and what small models make of Astra’s working
Show transcript

GPT-6 Astra solves the same math problem as Claude with a fraction of the written working

GPT-6 Astra solves the same math problem as Claude with a fraction of the written working
Four models, one problem · Astra writes 757 characters, Claude Sonnet 5 writes 11,455
CoT = chain of thought, the working a model writes before it answers
each dot is one step
zlib ratio = how little a file zipper can shrink it
Figure 1 · one competition math problem (HMMT) · all four answers correct · excerpts, cuts marked [...]
Luo, Ren, Yu, Li, Li, Bjerva · Aalborg University, Seafill · “Capable yet Parsimonious” · arXiv 2609.26637 v1 · Sep 2026 · preprint

Four AI models solve the same competition math problem, and all four get it right. GPT-6 Astra from OpenAI writes out its working in seven hundred and fifty-seven characters. Claude Sonnet 5 writes more than eleven thousand characters. That working is the chain of thought, the reasoning a model writes out before its answer, like scratch work on an exam. OpenAI and Anthropic usually hide it and show only the answer or a summary. This paper gets that working out of four models with a single trick, then compares them. Astra uses every kind of reasoning step the others use. Astra writes down far fewer side attempts and leaves routine arithmetic unwritten. And a small model handed Astra's short working gets less out of it.

The authors give each model a tool that does nothing except hold its reasoning

The authors give each model a tool that does nothing except hold its reasoning
One text box · the first call is forced · built-in reasoning switched off
built-in reasoning · off
the model
GPT-6 Astra
Claude Opus 4.8
Claude Sonnet 5
GPT-5.6 Sol
first turn:
must call this tool
tool form
reasoning (free text)
the reasoning lands here, where the authors can read it
computes nothing
our diagram · from Sec. 3.1 · the tool’s real wording is left out
Luo, Ren, Yu, Li, Li, Bjerva · Aalborg University, Seafill · “Capable yet Parsimonious” · arXiv 2609.26637 v1 · Sep 2026 · preprint

AI models can use outside tools, like a calculator, by filling in a short form. The authors register a tool whose form has a single box, a free-text box for reasoning. The tool computes nothing. The authors switch the model's built-in reasoning off. Then, on the model's first turn, the authors force the model to call that tool. To call the tool, the model has to fill in the box, so it writes its reasoning where the authors can read it.

Each call gets a one-word reply, and the model keeps writing until it answers

Each call gets a one-word reply, and the model keeps writing until it answers
It works even when the usage report counts no reasoning
built-in reasoning · off
the model
GPT-6 Astra
Claude Opus 4.8
Claude Sonnet 5
GPT-5.6 Sol
first turn:
must call this tool
tool form
reasoning (free text)
computes nothing
a one-word acknowledgment
call again
or answer
Astra can’t switch reasoning off · runs at its lowest setting
Claude Opus 5 · Fable 5 · Fable 5.1 · 0% extracted (App. D.3.1)
our diagram · from Sec. 3.1 and App. B · reported to OpenAI and Anthropic (Sec. 6)
Luo, Ren, Yu, Li, Li, Bjerva · Aalborg University, Seafill · “Capable yet Parsimonious” · arXiv 2609.26637 v1 · Sep 2026 · preprint

Each time the model calls the tool, the model gets back a one-word acknowledgment and nothing else. Then the model can call the tool again or give its answer. So the model keeps writing reasoning into the box until it's done. The trick works even when the usage report counts no reasoning at all. GPT-6 Astra can't switch its built-in reasoning off, so Astra runs at its lowest setting. The authors reported the method to the security teams at OpenAI and Anthropic. On Anthropic's newest models, Claude Opus 5, Fable 5 and Fable 5.1, the trick failed on every setup the authors tried.

Reasoning in the box wins back most of what built-in reasoning adds

Reasoning in the box wins back most of what built-in reasoning adds
Accuracy on 80 competition math problems, four models, three settings
reasoning off
built-in, high
forced into the box
Claude Opus 4.8
72.5
86.3
85.0
Claude Sonnet 5
42.5
77.5
81.3
GPT-5.6 Sol
25.0
97.5
91.3
GPT-6 Astra
n/a
97.5
93.8
Claude Opus 4.8
Claude Sonnet 5
GPT-5.6 Sol
GPT-6 Astra
HLE
24.0 · 33.0 · 27.0
17.0 · 21.0 · 22.0
13.0 · 25.0 · 23.0
n/a · 35.0 · 32.0
LiveCodeBench
58.0 · 83.0 · 82.0
52.0 · 77.0 · 77.0
47.0 · 90.0 · 90.0
n/a · 92.0 · 89.0
each cell: off · built-in · forced
HLE = a hard general-knowledge exam · 100 questions · LiveCodeBench = a coding test · 100 problems
Claude Opus 4.8 · most of the gain comes back
Sol’s 91.3 · insistent wording · the plain wording scores 81.3 (Table 5)
Astra’s n/a · can’t be switched off
DeepSeek V4 Flash and GLM 5.2 · the box shares 88% and 79% of the wording two real runs share · about 1.4 times as long (Table 4)
Table 1 · accuracy, % · 80 competition math problems · a single number per cell, no error bars
Luo, Ren, Yu, Li, Li, Bjerva · Aalborg University, Seafill · “Capable yet Parsimonious” · arXiv 2609.26637 v1 · Sep 2026 · preprint

The authors first check that the boxed working does the job, on eighty competition math problems. Claude Opus 4.8 with reasoning switched off scores seventy-two point five percent. With its built-in reasoning switched on high, Opus 4.8 scores eighty-six point three percent. Forced to reason in the box, Opus 4.8 scores eighty-five percent. GPT-6 Astra scores ninety-seven point five percent with its built-in reasoning and ninety-three point eight percent with the box. The authors also test two open models, DeepSeek V4 Flash and GLM 5.2, whose real reasoning anyone can read. The boxed working shares most of the wording that two real runs share with each other.

The authors turn each written trace into a tree with one node per step

The authors turn each written trace into a tree with one node per step
A fresh approach grows a new branch · every step gets one of seven labels
R = the start · each numbered circle = one step, one node
a branch · three approaches tried at once
depth · how many levels down
width · the most steps side by side on one level, here the three 5s
C = carries on the same line · E = explores a new one
Figure 3 · trees built by DeepSeek-V4-Flash, step types labelled by Claude Opus 5, both acting as judges (App. F, App. L) · one trace per model per problem
Luo, Ren, Yu, Li, Li, Bjerva · Aalborg University, Seafill · “Capable yet Parsimonious” · arXiv 2609.26637 v1 · Sep 2026 · preprint

To compare how each model organises its reasoning, the authors turn every trace into a tree. Every step in the working becomes a node. When the model tries a fresh approach, the tree grows a new branch. Depth is how many levels down the tree goes. Width is the most steps side by side on any one level. Each step also gets one of seven labels, such as read, plan, explore and verify. Other AI models, acting as judges, build the trees and assign the labels. The judges get one trace per model per problem.

Astra’s typical tree goes as deep as Claude’s with a fraction of the branches

Astra’s typical tree goes as deep as Claude’s with a fraction of the branches
Median over 80 math problems · 27 nodes for Astra, 136 for Claude Sonnet 5
p = width · q = depth · N = nodes, for this one tree
Table 3 · median of 80 math problems
GPT-6 Astra
GPT-5.6 Sol
Claude Opus 4.8
Claude Sonnet 5
nodes
27
60
96
136
about a fifth
depth
11
11
12
13
about the same
width
5
12
22
28.5
the gap
Figure 4 · one tree near each model’s median, same spacing in every panel · Table 3 medians below
Luo, Ren, Yu, Li, Li, Bjerva · Aalborg University, Seafill · “Capable yet Parsimonious” · arXiv 2609.26637 v1 · Sep 2026 · preprint

The authors draw one typical tree per model. On the math problems, the median tree for Astra, the middle one of its eighty, has twenty-seven nodes. The median tree for GPT-5.6 Sol has sixty nodes, for Claude Opus 4.8 ninety-six nodes, and for Claude Sonnet 5 a hundred and thirty-six nodes. So the typical Astra tree is about a fifth the size of the Sonnet 5 tree, under a third the size of the Opus 4.8 tree, and under half the size of the Sol tree. Median depth runs from eleven levels for Astra to thirteen for Sonnet 5. The trees differ in width. The median Astra tree is five steps wide, and the median Sonnet 5 tree is twenty-eight and a half steps wide. All seven kinds of step show up in every model's working.

Astra’s working is the shortest and the hardest to compress on all three tests

Astra’s working is the shortest and the hardest to compress on all three tests
One division check shows why · Astra writes one line, Claude Opus 4.8 writes out the multiplication
Astra · short and dense
zlib ratio · higher means a file zipper shrinks it less
across · length of the working (log scale)
circle = MATH · triangle = HLE, a hard general-knowledge exam · square = LCB, a coding test
Claude Opus 4.8 · the same check, every multiplication written out
Astra · one line
Figure 2 · length against compressibility, all three tests · Table 2 · one division check, three models
Luo, Ren, Yu, Li, Li, Bjerva · Aalborg University, Seafill · “Capable yet Parsimonious” · arXiv 2609.26637 v1 · Sep 2026 · preprint

A file zipper, the kind that shrinks a document to send it, barely shrinks Astra's short working. That holds on all three tests in the paper, the math problems, a hard general-knowledge exam and a coding test. One division check shows why. Claude Opus 4.8 writes out a hundred and one times four thousand, then a hundred and one times a hundred and sixty-one, then adds the two together. Astra writes the division and its result in one line, followed by the word yes. Astra runs the same check and leaves the multiplication unwritten.

Small models get less out of Astra’s working than out of Opus 4.8’s or Sol’s

Small models get less out of Astra’s working than out of Opus 4.8’s or Sol’s
Claude Haiku 4.5 and GPT-5.4 Nano lose the most, and still beat their own scores
open circle = the donor’s own score · filled dot = the recipient with the donor’s working · dashed line = the recipient alone
Haiku 4.5 · about 76, from Astra’s 93.8
GPT-5.4 Nano · about 80
Haiku 4.5 alone, about 35
Haiku 4.5 · 15 of 18 wrong answers had the right one in Astra’s working (Table 10)
Figure 5 · 80 math problems · the donor’s working, final answer removed, placed before the question
Luo, Ren, Yu, Li, Li, Bjerva · Aalborg University, Seafill · “Capable yet Parsimonious” · arXiv 2609.26637 v1 · Sep 2026 · preprint

The last test hands one model's working, minus its final answer, to another model and asks it to finish the problem. Working from GPT-5.6 Sol and Claude Opus 4.8 carries over with little loss to all six models that receive it. With its own working, Astra solves ninety-three point eight percent of the math problems. Claude Haiku 4.5, a small Anthropic model, lands near seventy-six percent with Astra's working. GPT-5.4 Nano, a small OpenAI model, lands near eighty percent. On its own, Haiku 4.5 scores about thirty-five percent, so Astra's working still helps it a lot. In fifteen of Haiku's eighteen wrong answers, Astra's working already held the right answer. The authors' reading is that a small model can't fill in the steps Astra left unwritten.

The box shows what a model writes, and the authors can’t see further inside

The box shows what a model writes, and the authors can’t see further inside
Four limits, all stated in the paper
“we cannot determine whether the extracted text reflects the model’s actual internal reasoning or merely provides a useful behavioral proxy”Sec. 5
Tool wording tuned per model · GPT-5.6 Sol scores 81.3 with plain wording, 91.3 with insistent wording (Table 5)
80 math problems · 100 each on the exam and the coding test · no error bars · one trace per problem for the trees
Reuse measured with the working in the prompt · the authors’ proposed test: spell out the skipped steps (Sec. 4.4)
Sec. 4.4, Sec. 5, Table 5, App. C
Luo, Ren, Yu, Li, Li, Bjerva · Aalborg University, Seafill · “Capable yet Parsimonious” · arXiv 2609.26637 v1 · Sep 2026 · preprint

The authors say they cannot tell whether the text in the box is the model's real internal reasoning or only a useful stand-in for it. The comparison measures the working each model writes when it's made to write it down. The authors also tune the tool's wording for each model. That wording moves the score. GPT-5.6 Sol scores eighty-one point three percent with plain wording and ninety-one point three percent with the insistent wording used in the main table. The tests are small, with eighty math problems, a hundred questions each on the exam and the coding test, and no error bars. The authors name the experiment that would settle the reuse result. If someone spells out the steps Astra left unwritten, the authors predict a small model gets back most of what it lost, and a strong model stays about the same.

Read it for the tree comparison and what small models make of Astra’s working

Read it for the tree comparison and what small models make of Astra’s working
Four closed models · 80 math problems · behaviour only
Read it
Section 4 · the trees and the reuse test
useful if you train small models on a big model’s working
one of several extraction tricks · code sent only to OpenAI and Anthropic · blocked on Claude Opus 5, Fable 5 and Fable 5.1
Xiaoyu Luo, Tao Ren, Wenrui Yu, Xiao Li, Qiongxiu Li, Johannes Bjerva · Aalborg University · Seafill
“Capable yet Parsimonious: Extracting and Characterizing Hidden Chain-of-Thought in Frontier Models”
arXiv 2609.26637 v1 · 22 September 2026 · preprint, not peer reviewed
Luo, Ren, Yu, Li, Li, Bjerva · Aalborg University, Seafill · “Capable yet Parsimonious” · arXiv 2609.26637 v1 · Sep 2026 · preprint

Read it. Section four holds the trees and the reuse test, and it matters to anyone who trains a small model on a big model's working. Hold off on implementing anything. The extraction trick joins several earlier ones, and the code went only to OpenAI and Anthropic. The paper is by Xiaoyu Luo and five co-authors, a preprint on arXiv, the open archive for research papers, posted before peer review.