Mar 23, 2026

Frankenstein ducks the linear probes

Abhinav Chand, Balaji R

Recent work has shown that linear probes are very effective in

detecting deceptive behavior of large language models, both

pre-generation (intent) and post-generation (harmful content) of

LLM’s response . We investigate fine-tuning methods to

suppress detection by deception probes. Our results show that we

can reduce the detection rate of linear probe monitors with our

fine-tuning method.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

This seems interesting to me as a useful component for doing the red team iteration for a control game where the protocol involves linear probes. This is potentially useful for this.

One core issue is that this paper's threat model is unrealistic in a way that matters. They train against the exact probe direction they then evaluate on. But in a real deployment, the blue team constructs probes after receiving the model, possibly using different contrast pairs, different layers, or ensembles. The red team doesn't get to see those probes during training. So the paper demonstrates something closer to "you can overfit against a known classifier" rather than "you can make a model that's fundamentally harder to probe."

I also think this paper could have been condensed.

This project seems very similar to Obfuscated Activations (https://arxiv.org/pdf/2412.09565), with a topical shift to sleeper agents / AI control. The training method degrading sleeper agent behavior as a condition to evade the probe is a weakness, as is the lack of results showing generalization beyond evading the specific probe that was trained against.

Overall it's good and ambitious work for the scope of a hackathon, but would've benefitted from some more careful literature review + more accurate signposting of the weaknesses of the results. The continuation I'd be most excited for is a demonstration like the iterative monitor evasion result in figure 8 from Obfuscated Activations.

Cite this work

@misc {

title={

(HckPrj) Frankenstein ducks the linear probes

},

author={

Abhinav Chand, Balaji R

},

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.