Skip to content

Do Models Read What They Write? Causal Registers in Scratchpad Reasoning

Jun 2026 · arXiv.org · Vol abs/2606.29522 · 0 citations · 26 references
Computer Science

Abstract

A central hope behind process supervision is that models can expose intermediate variables that matter for their later behavior. For this to help with alignment, a scratchpad must be tied to the computation: when the model writes a state, later steps should compute from that state. To test this requirement, we use a controlled state-tracking task with a known update rule, comparing models trained to report only the final state with models trained to write intermediate states before giving the final answer. At evaluation, we edit the internal representation of one written state while leaving the visible scratchpad text fixed. Because the transition rule is known, the edit has a single correct downstream consequence. In Qwen2.5-Coder-7B, the state-writing model predicts the next phase bit implied by the edited state on 80% and 91% of held-out examples across the two task variants, while pretrained and final-answer-only controls remain near baseline. Additional controls rule out generic next-token steering and copying another continuation: the prediction depends on both the edited state and the current move. The same causal-use pattern replicates across model families. Together, these results suggest a sharper goal for scratchpad oversight: not just to make intermediate reasoning legible, but to train written states that the model uses as part of its computation.

View source

Similar papers

Preprint Jul 2026

Similar Models Learn Differently: Final-Window Pretraining Shapes Post-Training Beyond SFT

A controlled experiment on the final window of pretraining, the last data trained on before instruction tuning, finds that what a model is pretrained on last shapes how it reacts to alignment, and what it was trained on last should be reported with it.

Cen Lu, Yung-Chen Tang, Andrea Cavallaro · 0 citations
Preprint Aug 2026

Beyond the Trace: Coupling an Interpretable Reasoning-State Readout to Native MoE Routing

A two-level internal readout for mixture-of-experts reasoning that makes latent process state readable, while routing makes it deployable and actionable and improves single-branch selection and plain majority voting over completed candidate sets.

Kang Chen, Sihan Zhao, Yixin Cao et al. · 0 citations
Preprint Jul 2026

Can a Language Model Learn Facts Continually in Its Weights?

This work follows invented facts written into Qwen3 models from creation through sequences of twenty to one hundred later writes, using held-out questions of five types, and finds that facts can be behaviourally forgotten without being erased.

Charles O'Neill · 0 citations
Preprint Aug 2026

Located but Not Releasable: Silent Gate Inversion and Bounded Linear Release

The complete pipeline -- detect, localize, and release -- is submitted to a fully preregistered stress test on a 25.7M transformer trained on causal-evidence discrimination, where a known suppression phenomenon (latent causal structure present but behaviorally unused) has previously been documented.

Xi-Ning Xun · 0 citations