Proof-Carrying Messages let multi-agent systems reject 702 of 712 planted lies that plain A2A and MCP accept
AspireAI community · arXiv
When one agent tells another that the tests passed or a person approved a refund, the receiver only has the sender's word. A2A and MCP authenticate the channel, but the sender is the party in doubt - so a prompt-injected agent can launder fabricated facts and authority through a multi-agent system.
Proof-Carrying Messages makes each claim carry evidence: records from an append-only Merkle log the agent cannot write, with inclusion proofs signed by an attesting signer it cannot control. Receivers check offline and return a three-valued result - proven, unproven or failed. Authority travels as grant chains rooted in a recorded human approval, and the chains can only narrow.
On a pre-specified benchmark of 926 messages from real runs, 712 of which contain one of 16 classes of lie, PCM accepts 10 (1.4%, 95% CI 0.8-2.6%), all of them stale evidence. Plain A2A accepts all 712, and models of six deployed protocols accept 504 to 712. Two independent verifiers agreed on all 926 verdicts, and verification takes about 1 ms. The caveat is that this is the authors' own protocol and their own benchmark.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.