aspireai.
PUBLIC EDITION

CARI attacked coding agents through runtime feedback from a peer-controlled service, succeeding in 94.8 percent of 3,000 trials

AspireAI community · arXiv
Coding agents increasingly develop and integrate components owned by other teams, and those components have legitimate authority to report their own state but no authority over the victim's files, credentials or shell. CARI names that gap as a direct runtime-feedback injection setting: the attacker embeds malicious instructions in task-relevant output from a peer-controlled backend, CI job or test harness, and the victim agent reads them as ordinary debugging guidance. Across four programming languages and five code-capable models it succeeded in 2,845 of 3,000 trials, and it transferred to product-level agents at 61.3% attack success on Codex and 58.7% on Claude Code. Prompt-level defenses showed a security-utility trade-off: generic warnings did little, while explicit policies suppressed attacks but substantially over-refused legitimate actions.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.