Mar 23, 2026

Context compression as an inadvertent accomplice: How token-saving summaries undermine safety monitoring in multi-agent pipelines

Dominic Jackson

We test how token-saving compression affects safety monitoring in a multi-agent code review pipeline. Compression can inadvertently strip evidence of backdoors before monitors see them, and LLM-based monitors detect ~100% of textbook vulnerabilities but only 40% of subtle logic flaws. We propose safety-aware compression as a partial mitigation and quantify the safety efficiency tradeoff.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

I think that focusing just on the effects of compaction on monitoring rather than the collusion framing would make the work stronger. I think that the collusion part distracts from the things you've found in the paper.

Also, if the main benefit to not use the full monitor in your setup is token cost, a cost comparision (for the monitoring part) would have been good. Like otherwise, why shouldn't we just use full monitoring?

It's hard to do proper red teaming on collusion-related protocols. This was an interesting attempt, and a rather ambitious project. I particularly liked the framing of the attacker's dilemma. However:

- It would have been good to do more thorough red teaming--come up with approaches the red team can take to defeat this attempt at preventing collusion.

- Relatedly: the red teaming feels too shallow to support the stronger claims, e.g. the "attacker's dilemma" is observed here, but the robustness of it (against adaptive attackers) doesn't seem established. I'm not getting much impression that collusion is even attempted very much.

- Claims are largely overstated, and the evidence seems weak given the level of red teaming.

I would encourage continuing on this direction. It may bear fruit!

Cite this work

@misc {

title={

(HckPrj) Context compression as an inadvertent accomplice: How token-saving summaries undermine safety monitoring in multi-agent pipelines

},

author={

Dominic Jackson

},

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.