Mar 23, 2026

Activation Sparsity as a Scheming Signal

Ajinkya

- Problem: Scheming models can hide intent in outputs. We ask whether internal activations instead betray the hidden goal.

- Method: Hooked into MLP layers of Qwen2.5-Instruct (1.5B and 3B), measured Gini coefficient of activation distributions across 50 benign vs 50 scheming rollouts on identical tasks.

- Finding: Scheming produces measurably more uniform activations (lower Gini) in 15/18 layers (p = 0.0003, d = 0.701, sign test p = 0.004), consistent across three threat models and both model sizes.

- Detection: A simple threshold detector on signal layers achieves AUROC = 0.745 with no output access.

- Implication: A lightweight, output-independent monitoring signal that cannot be suppressed by hiding reasoning in text.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

Using activation sparsity as a scheming signal is potentially interesting for control. However, the results didn't seem significant to me (the primary metric in the notebook was not a significant result, the deltas in metric breakdown were very small) and there seemed to be methodology issues (the n=50 paper results come from tiling 20 prompts 2.5x inflating statistical power).

If the paper was more clear about these limitations, that would be better. Testing with a real control environment would have also made this stronger.

The report investigates detecting scheming by interpreting the activations by using model activations to classify scheming vs non scheming actions.

The report is clearly presented and explains the technical details in a very intuitive way, making it more accessible.

>Our hypothesis is that scheming requires more parallel computational work: completing

the surface task, tracking the hidden goal, and actively suppressing evidence of the

deception. We predict this manifests as more uniform activation distributions and thus a

lower Gini coefficient compared to benign execution, which routes through sparse,

specialized circuits.

I think this is a pretty insightful hypothesis.

The low number of tasks / prompts is a limitation and this should be scaled up in future work. I'd also be interested in seeing whether the techniques and insights generalise to models with trained checking goals rather than prompted model organisms.

Some technical details are not included making the paper somewhat unreproducible. This can be fixed for scaled up work. E.g., I can't easily tell what Table 1 is supposed to say (or what the col headings relate to).

Unfortunately I think I basically don't believe the project achieves meaningful results yet. The core result seems to be:

Gini coefficient 0.622 ± 0.003 (for benign) 0.619 ± 0.004 (for scheming) −0.003 (delta)

but the delta is within the error bars. And I am not confident in the statistical tests.

I think the analysis needs to be scaled up quite a bit to ensure the results are really significant. The AUROCs do look compelling but it's hard to judge how much I can believe them.

Overall I think it's a cool and promising idea and I'd be excited to see a scaled up analysis!

Cite this work

@misc {

title={

(HckPrj) Activation Sparsity as a Scheming Signal

},

author={

Ajinkya

},

date={

3/23/26

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

Feb 2, 2026

Markov Chain Lock Watermarking: Provably Secure Authentication for LLM Outputs

We present Markov Chain Lock (MCL) watermarking, a cryptographically secure framework for authenticating LLM outputs. MCL constrains token generation to follow a secret Markov chain over SHA-256 vocabulary partitions. Using doubly stochastic transition matrices, we prove four theoretical guarantees: (1) exponentially decaying false positive rates via Hoeffding bounds, (2) graceful degradation under adversarial modification with closed-form expected scores, (3) information-theoretic security without key access, and (4) bounded quality loss via KL divergence. Experiments on 173 Wikipedia prompts using Llama-3.2-3B demonstrate that the optimal 7-state soft cycle configuration achieves 100\% detection, 0\% FPR, and perplexity 4.20. Robustness testing confirms detection above 96\% even with 30\% word replacement. The framework enables $O(n)$ model-free detection, addressing EU AI Act Article 50 requirements. Code available at \url{https://github.com/ChenghengLi/MCLW}

Read More

Feb 2, 2026

Prototyping an Embedded Off-Switch for AI Compute

This project prototypes an embedded off-switch for AI accelerators. The security block requires periodic cryptographic authorization to operate: the chip generates a nonce, an external authority signs it, and the chip verifies the signature before granting time-limited permission. Without valid authorization, outputs are gated to zero. The design was implemented in HardCaml and validated in simulation.

Read More

Feb 2, 2026

Fingerprinting All AI Cluster I/O Without Mutually Trusted Processors

We design and simulate a "border patrol" device for generating cryptographic evidence of data traffic entering and leaving an AI cluster, while eliminating the specific analog and steganographic side-channels that post-hoc verification can not close. The device eliminates the need for any mutually trusted logic, while still meeting the security needs of the prover and verifier.

Read More

Feb 2, 2026

Markov Chain Lock Watermarking: Provably Secure Authentication for LLM Outputs

We present Markov Chain Lock (MCL) watermarking, a cryptographically secure framework for authenticating LLM outputs. MCL constrains token generation to follow a secret Markov chain over SHA-256 vocabulary partitions. Using doubly stochastic transition matrices, we prove four theoretical guarantees: (1) exponentially decaying false positive rates via Hoeffding bounds, (2) graceful degradation under adversarial modification with closed-form expected scores, (3) information-theoretic security without key access, and (4) bounded quality loss via KL divergence. Experiments on 173 Wikipedia prompts using Llama-3.2-3B demonstrate that the optimal 7-state soft cycle configuration achieves 100\% detection, 0\% FPR, and perplexity 4.20. Robustness testing confirms detection above 96\% even with 30\% word replacement. The framework enables $O(n)$ model-free detection, addressing EU AI Act Article 50 requirements. Code available at \url{https://github.com/ChenghengLi/MCLW}

Read More

Feb 2, 2026

Prototyping an Embedded Off-Switch for AI Compute

This project prototypes an embedded off-switch for AI accelerators. The security block requires periodic cryptographic authorization to operate: the chip generates a nonce, an external authority signs it, and the chip verifies the signature before granting time-limited permission. Without valid authorization, outputs are gated to zero. The design was implemented in HardCaml and validated in simulation.

Read More

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.