Mar 22, 2026

Reasoning-Level Poisoning of Trusted Monitors: A Systematic Red-Teaming Methodology

TANG Meng

We identify and systematically exploit a previously unstudied vulnerability class in trusted monitoring: knowledge-layer attacks that target what the monitor cannot know rather than what it cannot yet do. By embedding false claims drawn from training-data misconceptions into factual text, we achieve a 50% evasion rate against Opus 4.6 monitoring an equally capable model—a setting strictly harder than prior work. Over 13 iterative rounds, we developed a transferable attack system comprising 9 constructive methods, a 6-layer defense model, and a multi-gate quality pipeline, where the AI itself discovered effective strategies through failure analysis. A fresh AI session using only the documented methodology reproduced 50% evasion in new domains. This vulnerability is scaling-resistant: larger models encode the same misconceptions with greater confidence. We release the complete methodology and dataset.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

- the paper argues that web search won't reliably fix the problem, and the reasoning is sound. But this is still a theoretical argument, not an empirical one

- The 10% hit rate from the misconception hunting protocol is mentioned briefly but deserves more attention. How many high quality misconceptions exist across domains, for example? Is this a finite, exhaustible resource or effectively unlimited? It'd be an interesting analysis

It's outstanding work to be honest. A novel and vulnerability class - with a systematic methodology for exploiting it and findings presented with clarity.

Excellent conceptual contribution!

The distinction between attacking what a monitor can't yet do vs what it can't know is sharp and novel. The defence layer model of monitor cognition is a theoretical framework others can build on.

The iterative methodology is well-documented, and the validation round that reproduces evasion with a fresh AI session using only the documented methods is a strong demonstration of transferability.

My main caveat is that the threat model is narrower in scope than the paper suggests, factual claims in text vs the behavioural attacks (code backdoors, infrastructure sabotage) that dominate AI control. But as a conceptual contribution, this opens a genuinely new direction.

Cite this work

@misc {

title={

(HckPrj) Reasoning-Level Poisoning of Trusted Monitors: A Systematic Red-Teaming Methodology

},

author={

TANG Meng

},

date={

3/22/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.