Skip to content

When Latent Agents Lie: KV-Cache Integrity in Multi-Agent LLM Collaboration

Jun 2026 · arXiv.org · Vol abs/2606.28958 · 2 citations · 41 references
Computer Science

TL;DR

The main lesson is that full-KV latent memory can be useful, but it should be treated as a security-sensitive object, not as ordinary internal model state.

Abstract

LLM agents can share more than text. In some systems, an agent can send a short visible message while also passing its full KV-cache state to another model. This hidden state can help the final model combine evidence from several agents, but it is also hard to inspect. A visible message may look harmless even if the hidden state has been changed. We study this problem in a multi-agent question-answering setup. Specialists each see part of the evidence, send a short commitment, and pass full KV-cache state to a coordinator. In clean runs, this latent collaboration improves over a matched text-only version. On transformed HiddenBench with Qwen3-4B, it reaches EM/F1 of 0.338/0.486, compared with 0.231/0.369 for text collaboration. Qwen3-8B and HotPotQA runs show the same direction of improvement. The problem appears when one specialist is malicious. Some false visible commitments can steer answers. More seriously, changing the hidden KV state can collapse performance even when the visible commitment still looks plausible. A verifier that checks only text misses this failure mode. Simple magnitude checks catch some obvious corruptions, but adaptive attacks can evade them while still damaging the final answer. The most reliable fix we find is not to guess whether hidden state looks normal, but to protect it in transport. We implement an HMAC-SHA256 manifest that binds the specialist, session, model, visible commitment, tensor metadata, and payload digest. It accepts all 774 honest replayed payloads and rejects all 295 recorded tampered payloads. The main lesson is that full-KV latent memory can be useful, but it should be treated as a security-sensitive object, not as ordinary internal model state.

View source

Similar papers

Preprint Aug 2026

When Does Latent Communication Pay? A Causal Audit of Relayed KV Caches in Multi-Agent LLMs

Multi-agent LLM systems relay key-value caches instead of text and credit their gains to exchanged"latent thoughts". That credit is a claim about which example's cache is relayed, not merely that one is. We audit it causally in released systems. The cache is replaced with deranged (mismatched-example), zeroed, and mome...

Jiaming Cheng, Subhransu Das, Rajiv Ramnath · 3 citations
Jul 2026

ChannelGuard: Safe Models Do Not Compose into Safe Multi-Agent Systems

ChannelGuard, a training-free defense-in-depth framework placing information-bottleneck gates on every inter-agent channel; each scores channel text against an adversarial phrase bank by embedding similarity and deterministically passes, compresses, or blocks it, adding no LLM call, while an attribution method records...

Elias Hossain, Md. Mehedi Hasan Bhuiyan Nipu, Fatema Tuj Johora Faria et al. · 0 citations
Jul 2026

Σ-Mem: An Online Reliability Memory for LLM-based Multi-Agent Systems

Memory is central to long-horizon LLM agents, yet existing memory systems primarily preserve interaction content rather than modeling which agents can be trusted and under what conditions. This limitation is particularly important in multi-agent systems, where a central model may be unable to directly verify plausible...

Peilin Feng, Suorong Yang, Soujanya Poria · 0 citations
Preprint Aug 2026

When Collaboration Becomes a Trigger: Collective Evidence-Threshold Backdoors in Multi-Agent Systems

This work introduces a collective evidence-threshold backdoor paradigm for MAS and Boundary-Conditioned Backdoor Injection, which constructs counterfactual boundary pairs to separate benign behavior before the threshold from the adversarial objective after it, and learns latent progression aligned with evidence.

Jiahao Xiao, Lei Feng, Min-Ling Zhang · 0 citations
Conference 2026

When Verification Hurts: The Cost of Overriding Abstention in Two-Stage Web Agents

This study cautions against transplanting verification into grounding pipelines and identifies calibrated abstention as a property worth preserving and proposes an abstention-aware verifier that intervenes only under sufficient candidate coverage and confidence.

Duchen Li · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.