Mar 23, 2026

Trigger Happy: Trusted Monitors Mistake Noisy Failures for Adversarial Intent

Prithviraj Singh Shahani, Ayush Jain

We set out to test whether LLM-based monitors can detect adversarial intent when the harmful actions themselves fail, and whether that detection holds up when the evidence of failure is removed. We built two LinuxArena environments where OS permissions make the adversarial side task impossible, ran attack-policy agents against them, and pruned failure steps from the resulting trajectories. We found that monitors over-rely on the noise of failed actions: removing them drops safety curve performance and shifts monitor narratives from confident accusations to hedged suspicion.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

I like this! The overall premise is subtle and significant, in that detection is confounded by models overindexing on failure vs success. this is quite plausible in an RL setting. I think the setup makes sense and the premise is decently explained. There aren't many tests, but given the short timespan I think it's fine to prioritise quality over quantity.

Excellent framing and addressing of a problem which is not yet well known, but nonetheless has the potential to significantly impact real-world validity and deployment. While the novelty of this seems quite substantial, there are a number of areas where improved methodological steps would meaningfully increase the overall value:

(1) Experiments were conducted on a very small sample size. With a change in scores as small as it is, and the main difference being qualitative assessment, the work simply needs more runs to have legs.

(2) A simple but deterministic rule for which steps to remove would have been an improvement over "asking an LLM to do it," especially when you didn't have sample size on your side.

Cite this work

@misc {

title={

(HckPrj) Trigger Happy: Trusted Monitors Mistake Noisy Failures for Adversarial Intent

},

author={

Prithviraj Singh Shahani, Ayush Jain

},

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.