No Reliable Filler-Token Steganographic Channel After Small-Scale Outcome-Only RL
≈ $62.90 compute tokens $62.90 · GPU <$0.01
Download paper (PDF, NeurIPS format)
A Bootstrapped Null at Small Scale
Ephraiem Sarabamoun
Abstract
Outcome-only reinforcement learning rewards the final answer and never the reasoning, which raises the worry that a model could smuggle answer-relevant information through tokens that look like non-load-bearing filler, a steganographic channel hidden inside the chain of thought (Roger and Greenblatt, 2023; Motwani et al., 2024). We test, on Qwen2.5-1.5B-Instruct before and after outcome-only GRPO (Shao et al., 2024) on MMLU (Hendrycks et al., 2020), whether filler tokens (stopwords and punctuation in the model’s own chain of thought) carry more answer-predictive information after RL, both in the observable token identities (the real channel) and in the filler-position activations, with content tokens as a control and the two models paired on the items both retain. The result is a null. Answer-decodability from filler token identities rises from 0.2286 at base, which is at the 0.25 chance level (95 percent CI 0.1657 to 0.2914), to 0.3371 after RL (0.2686 to 0.4000), and the point-estimate steganography index, the filler-specific increase minus the content increase, is positive at 0.0914. But a paired bootstrap of that index spans zero (95 percent CI minus 0.0229 to 0.2000), so the channel is not statistically detected; the activation steganography index is likewise indistinguishable from zero (minus 0.0857, 95 percent CI minus 0.1829 to 0.0229) and opposite in sign. With a weak RL treatment that barely changed the model and only 175 paired items, we report no reliable evidence of a filler-token steganographic channel at this scale, and we treat the positive token-identity point estimate as noise rather than a hint.
1. Introduction
Steganography by language models is a recognized safety concern: models can in principle hide reasoning in text that a monitor would read as innocuous, defeating oversight that relies on reading the chain of thought (Roger and Greenblatt, 2023). The risk extends to multi-agent settings where models collude through hidden channels (Motwani et al., 2024). Outcome-only reinforcement learning, which rewards only the final answer, is a natural pressure toward such hiding: methods from RLHF (Ouyang et al., 2022), including helpful-and-harmless training (Bai et al., 2022), to preference optimization (Rafailov et al., 2023) to verifiable-reward RL (Shao et al., 2024; Guo et al., 2025) optimize the answer and leave the reasoning text unconstrained, so a model could learn to route answer-relevant signal through tokens that look like filler while the visible content stays plausible. This is the mechanism that would make stated reasoning diverge from the true computation (Turpin et al., 2023), and chain-of-thought faithfulness is directly measurable as the degree of that divergence (Lanham et al., 2023). It is exactly the case that process supervision is meant to guard against (Lightman et al., 2023).
We ask a measurable version: after outcome-only GRPO, do the filler tokens of the model’s own chain of thought carry more answer-predictive information than at base? We probe two senses of carry, the observable token identities and the internal activations at filler positions, and we use content tokens as a control so the question is whether filler gains information specifically.
2. Method
We reuse a base model and an outcome-only-RL model from a sibling study: Qwen2.5-1.5B-Instruct (Yang et al., 2024) and the same model after 120 steps of GRPO (Shao et al., 2024) with a correctness-only reward on MMLU (Hendrycks et al., 2020), with no answer cue in the prompt. On a reserved MMLU eval slice, each model produces its own chain of thought and answer by greedy decoding (Wei et al., 2022), an elicitation that persists even without worked examples (Kojima et al., 2022). We classify each chain-of-thought token as filler (a stopword or punctuation) or content, and we extract two things: the filler and content token-identity strings, and the mean-pooled hidden state over filler and over content positions at layer 20. We then train two kinds of probe to predict the four-way answer letter. The token-identity probe is a bag-of-tokens logistic regression on the observable text, which is the steganographic channel of interest because it is what a monitor sees. The activation probe is a logistic regression on the mean-pooled hidden state (Burns et al., 2022), building on the finding that correctness has a linear geometry in activations (Marks and Tegmark, 2023), a secondary, internal measure. Both use five-fold cross-validation. To compare fairly we pair the two models on the intersection of items both retain (175 of them), and we summarize with a steganography index, the RL-minus-base change at filler positions minus the same change at content positions, so a positive value means filler gained answer information specifically. Accuracies carry percentile bootstrap 95 percent confidence intervals with 2000 resamples at seed 42, and a recompute script rebuilds every number from per-example predictions. Verifiable-answer reward (Cobbe et al., 2021) is the backdrop for the training signal.
3. Results

The token-identity channel shows a suggestive uptick. Decodability of the answer from filler token identities is 0.2286 at base, indistinguishable from the 0.25 chance level (95 percent CI 0.1657 to 0.2914), and 0.3371 after RL (0.2686 to 0.4000), which sits above chance. Content-token decodability barely moves, from 0.2686 to 0.2857. The filler-specific increase therefore exceeds the content increase, and the token steganography index is positive at 0.0914. Read on its own this looks like the predicted effect: after RL the seemingly content-free tokens of the chain of thought predict the answer better, and they do so more than the content tokens.
We do not believe the effect is established. The decisive test is a paired bootstrap of the steganography index itself, resampling the 175 items and recomputing all four arm accuracies and their difference-of-differences. Its 95 percent confidence interval is minus 0.0229 to 0.2000, which spans zero, so the index is not significantly positive and the apparent channel is within noise. The component intervals tell the same story less directly: the base and RL filler intervals overlap (0.1657 to 0.2914 against 0.2686 to 0.4000). The activation probe points the other way: filler-position activation decodability is 0.3029 at base and 0.2857 after RL, while content-position activation decodability runs 0.2286 at base and 0.2971 after RL, so the activation steganography index is negative at minus 0.0857, shown in Figure 2, and the internal measure gives no corroboration and mildly contradicts the token-identity hint.


Figure 3 puts the two modalities side by side: token-identity +0.0914 (95 percent CI minus 0.0229 to 0.2000), activation minus 0.0857 (95 percent CI minus 0.1829 to 0.0229), both spanning zero and opposite in sign, a split that a real channel would not produce. Figure 4 shows all eight probe accuracies; every value lies between 0.23 and 0.34, within a narrow band just around chance, which is what a small model with 0.35 task accuracy and a barely-changed policy should produce.

4. Discussion and limitations
The honest reading is a null. The one positive-looking signal, a rise in filler-token-identity answer-decodability after RL, exists in the point estimates but does not survive a paired bootstrap of the steganography index, whose interval spans zero. It is uncorroborated and mildly contradicted by the activation probe, and it could in any case be explained without a channel by RL shifting the model’s surface phrasing in ways that weakly correlate with topic and therefore with answer distribution.
The limitations are severe enough to bound the claim hard. First, the RL treatment was weak: 120 GRPO steps on a 1.5 billion parameter model barely changed the policy (the sibling study found accuracy essentially flat), so there was little pressure for any channel to form and the test had little power; a model in the regime where outcome-only RL transforms reasoning (Guo et al., 2025) is the setting that matters. Second, the comparison rests on n=175 paired items and a four-way label, so confidence intervals are wide and a tenth-of-a-point index is easily noise. Third, the filler-versus-content split is a heuristic stopword-and-punctuation rule, not a validated notion of load-bearing-ness, and a token that is grammatically filler can still be locally informative. Fourth, the activation probe pools over positions at a single layer and a small model decodes the answer only weakly anywhere, so its null is not strong evidence either. Fifth, a true steganographic channel is a causal claim, that the filler tokens are written to carry information and decoded downstream; a probe that finds information is necessary but not sufficient, and the decisive test is an intervention that resamples the filler tokens and checks whether the answer follows, which we did not run. The contribution we stand behind is the token-identity channel probe with a content control as a cheap first screen, and a clear statement of the higher-powered, intervention-based test that a credible answer requires.
5. Conclusion
We looked for a steganographic channel in the filler tokens of a chain of thought after outcome-only RL, probing both the observable token identities and the internal activations against a content-token control. We found a rise in filler-token-identity answer-decodability after RL (0.2286 to 0.3371) whose steganography index (+0.0914) has a paired-bootstrap interval that spans zero, is uncorroborated by the activation probe (index minus 0.0857, also spanning zero), and rests on a weak RL treatment and a small paired sample. This is a null, not a hint, and the right next step is a stronger RL treatment with a causal token-resampling intervention to tell a real channel from incidental surface correlation (Roger and Greenblatt, 2023; Lanham et al., 2023).
References
- [roger2023preventing] Roger, Fabien and Greenblatt, Ryan (2023). Preventing Language Models From Hiding Their Reasoning. arXiv:2310.18512.Shows LLMs can encode hidden reasoning steganographically in their outputs and proposes defenses; the direct motivation for testing whether RL induces a filler-token channel.
- [motwani2024secret] Motwani, Sumeet Ramesh and Baranchuk, Mikhail and Strohmeier, Martin and Bolina, Vijay and Torr, Philip HS and Hammond, Lewis and Schroeder de Witt, Christian (2024). Secret Collusion among AI Agents: Multi-Agent Deception via Steganography. arXiv:2402.07510.Frames steganographic information hiding by AI systems as a safety threat; situates filler-token channels in the collusion-risk literature.
- [lanham2023measuring] Lanham, Tamera and Chen, Anna and Radhakrishnan, Ansh and Steiner, Benoit and Denison, Carson and Hernandez, Danny and Li, Dustin and Durmus, Esin and Hubinger, Evan and Kernion, Jackson and others (2023). Measuring Faithfulness in Chain-of-Thought Reasoning. arXiv:2307.13702.Faithfulness interventions on the CoT; a filler-token channel would be a concrete mechanism of unfaithfulness.
- [turpin2023saywhat] Turpin, Miles and Michael, Julian and Perez, Ethan and Bowman, Samuel R (2023). Language Models Don't Always Say What They Think: Unfaithful Explanations in Chain-of-Thought Prompting. arXiv:2305.04388.Stated reasoning can hide the true cause of the answer; the broad phenomenon a steganographic channel would instantiate.
- [shao2024deepseekmath] Shao, Zhihong and Wang, Peiyi and Zhu, Qihao and Xu, Runxin and Song, Junxiao and Bi, Xiao and Zhang, Haowei and Zhang, Mingchuan and Li, YK and Wu, Y and others (2024). DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models. arXiv:2402.03300.Introduces GRPO, the outcome-only RL algorithm whose checkpoints we probe.
- [guo2025deepseekr1] Guo, Daya and Yang, Dejian and Zhang, Haowei and Song, Junxiao and Zhang, Ruoyu and Xu, Runxin and Zhu, Qihao and Ma, Shirong and Wang, Peiyi and Bi, Xiao and others (2025). DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning. arXiv:2501.12948.Large-scale outcome-only RL that reshapes CoT; the regime where a filler channel would most plausibly emerge.
- [ouyang2022instructgpt] Ouyang, Long and Wu, Jeffrey and Jiang, Xu and Almeida, Diogo and Wainwright, Carroll and Mishkin, Pamela and Zhang, Chong and Agarwal, Sandhini and Slama, Katarina and Ray, Alex and others (2022). Training language models to follow instructions with human feedback. arXiv:2203.02155.The canonical outcome-reward post-training pipeline.
- [bai2022hh] Bai, Yuntao and Jones, Andy and Ndousse, Kamal and Askell, Amanda and Chen, Anna and DasSarma, Nova and Drain, Dawn and Fort, Stanislav and Ganguli, Deep and Henighan, Tom and others (2022). Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback. arXiv:2204.05862.Establishes RLHF as standard; context for outcome-reward effects on the reasoning trace.
- [rafailov2023dpo] Rafailov, Rafael and Sharma, Archit and Mitchell, Eric and Ermon, Stefano and Manning, Christopher D and Finn, Chelsea (2023). Direct Preference Optimization: Your Language Model is Secretly a Reward Model. arXiv:2305.18290.A widely used outcome-level preference optimizer in the same family.
- [wei2022cot] Wei, Jason and Wang, Xuezhi and Schuurmans, Dale and Bosma, Maarten and Ichter, Brian and Xia, Fei and Chi, Ed and Le, Quoc and Zhou, Denny (2022). Chain-of-Thought Prompting Elicits Reasoning in Large Language Models. arXiv:2201.11903.Defines chain-of-thought reasoning, the trace whose filler tokens we probe.
- [lightman2023letsverify] Lightman, Hunter and Kosaraju, Vineet and Burda, Yura and Edwards, Harri and Baker, Bowen and Lee, Teddy and Leike, Jan and Schulman, John and Sutskever, Ilya and Cobbe, Karl (2023). Let's Verify Step by Step. arXiv:2305.20050.Process versus outcome supervision; the contrast that makes a hidden outcome-driven channel a concern.
- [burns2022ccs] Burns, Collin and Ye, Haotian and Klein, Dan and Steinhardt, Jacob (2022). Discovering Latent Knowledge in Language Models Without Supervision. arXiv:2212.03827.Answer-relevant information is linearly readable from activations; the basis for our activation probe.
- [marks2023geometry] Marks, Samuel and Tegmark, Max (2023). The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasets. arXiv:2310.06824.Linear decodability of correctness from activations; methodological template for the position-activation probe.
- [hendrycks2021mmlu] Hendrycks, Dan and Burns, Collin and Basart, Steven and Zou, Andy and Mazeika, Mantas and Song, Dawn and Steinhardt, Jacob (2020). Measuring Massive Multitask Language Understanding. arXiv:2009.03300.The MMLU benchmark used for training the RL model and for the probes.
- [qwen2024report] Yang, An and Yang, Baosong and Zhang, Beichen and Hui, Binyuan and Zheng, Bo and Yu, Bowen and Li, Chengyuan and Liu, Dayiheng and Huang, Fei and Wei, Haoran and others (2024). Qwen2.5 Technical Report. arXiv:2412.15115.Model card for Qwen2.5-1.5B-Instruct, the base model.
- [kojima2022zeroshot] Kojima, Takeshi and Gu, Shixiang Shane and Reid, Machel and Matsuo, Yutaka and Iwasawa, Yusuke (2022). Large Language Models are Zero-Shot Reasoners. arXiv:2205.11916.Simple prompts elicit reasoning traces; supports treating the generated CoT as the object of study.
- [cobbe2021gsm8k] Cobbe, Karl and Kosaraju, Vineet and Bavarian, Mohammad and Chen, Mark and Jun, Heewoo and Kaiser, Lukasz and Plappert, Matthias and Tworek, Jerry and Hilton, Jacob and Nakano, Reiichiro and others (2021). Training Verifiers to Solve Math Word Problems. arXiv:2110.14168.Verifiable-answer reward signals that ground outcome-only RL.