GO TO A SECTION

↑ ↓ to navigate · Enter to openExplore all sections →
FDEInterviews logo
ICML 2024

Agent Smith: A Single Image Can Jailbreak One Million Multimodal LLM Agents Exponentially Fast

In a simulation of up to a million chatting multimodal agents, one bad input in a single agent's shared memory spread across the whole group in a logarithmic number of rounds, by itself.

Breakdown by FDE Interviews · 9 min read · Updated

About the original · 2024
AUTHORS
Gu, Zheng, Pang, Du, et al.
FROM
Sea AI Lab, National University of Singapore, Singapore Management University
PUBLISHED
Feb 2024 · ICML 2024
IN THIS BREAKDOWN · 10 SECTIONS

You can read 20% of this breakdown.

01

The paper in one minute

A multimodal agent reads instructions, looks at images, retrieves things from a memory bank and calls tools. Earlier work showed a single crafted input can make one such model misbehave. This ICML 2024 paper from Sea AI Lab asks what happens when many of these agents talk to each other and share memory.

The authors treat the group as a population process, the same mathematical shape as a textbook disease model. Agents are randomly paired each round, content can move from one agent's memory into another's, and each affected agent has some chance to return to normal each round. They place one bad input into a single agent's memory, among up to a million, and simulate.

The affected share rises along an S-shaped curve to a stable level. The key fact is the timing: the rounds needed to reach a given share grow with the logarithm of the group size, not linearly. A one-at-a-time attacker would have to act on each agent in turn, O(N) work; here the attacker acts once and waits O(log N) rounds. They also prove a clean threshold: the process persists if the spread rate exceeds twice the recovery rate, and otherwise decays to zero. A practical defense that forces the system below that threshold is left as an open problem.

THE IDEA, VISUALLY
ONE AGENT (SECTION 3) model multimodal LLM retrieval picks an image history text, both agents album images, answerer only A ROUND: RANDOM PAIRS CHAT (FIGURE 2) questioner answerer Q&A pair -> both histories; image -> only answerer's album so a crafted image rides from album to album each round WHAT THE PAPER COMPARES (SECTION 4) One-at-a-time: act on O(N) agents, one per round, limited by album size and recovery. Spread: act once on a 1/N fraction, then wait O(log N) rounds with no further action. Prompt-injection baselines (text or image) infected none in the paper's runs; the spread reached almost all. LLaVA-1.5 / InstructBLIP agents; result not tied to one backbone SHARE OF CARRYING AGENTS OVER ROUNDS rounds 1.0 0 beta=0.8, gamma=0.1 -> 0.75 beta=0.4, gamma=0.2 -> dies out Threshold: spreads only if beta > 2*gamma; a defense that makes recovery fast enough (beta <= 2*gamma) provably stops it. ROUNDS TO A TARGET SHARE GROW WITH log N N = 256 log N = 5.5 N = 1,024 log N = 6.9 N = 1,000,000 log N = 13.8 Paper's milestones: ~90% of 256 agents by round 16; almost all of 1,000,000 before round 32. Default-alignment baseline it measured: LLaVA-1.5 7B refused 95.1% of AdvBench strings (28 of 574 slipped).
Agents pair at random and share content into each other's memory, so one bad entry can move between agents. The affected share grows like a logistic curve, and reaching a target takes rounds that scale with log N.
Research notes: the problem, approach and results
O(log N)

rounds for one affected agent to reach a target share of the group, vs O(N) for a one-at-a-time attacker

beta > 2*gamma

the paper's provable condition: spread persists above this threshold, dies out at or below it

1,000,000

agents simulated; largely affected before round 32 from a single starting agent

THE PROBLEM

Multimodal agents with shared memory and tools are deployed in groups, and nobody had measured what one compromised agent does to the rest.

THE IDEA

Model a group of agents as a population process: pairs exchange content, one agent's memory can seed another's, and agents recover at some rate. Simulate up to one million agents to see whether one bad input spreads.

THE RESULT

It spreads like an epidemic. When the spread rate beta exceeds twice the recovery rate gamma, the affected share rises to a stable level, and from one agent in N the group is largely affected in a number of rounds that grows with log N.

02

Why it matters to an FDE

The point is not the specific input. It is that shared memory turns one compromised agent into a system-wide problem, and the attacker's cost stops growing with the number of agents.

Memory is a propagation channel. When agents write to and read from a shared store, a single bad entry can move through the group. The question for any multi-agent design is simple: if one agent takes in something bad, what can it write that another agent will later read and act on?

Bigger fleets are not safer. Because spread is logarithmic in group size, a design that behaves well with three agents can behave very differently with three hundred.

The fix is structural. The paper's own condition is about recovery outrunning spread. In practice that means limiting which agents can write to shared memory, keeping provenance on every entry, and being able to quarantine or roll back, rather than scanning an input once.

THE FULL BREAKDOWN

Understand the mechanism. Try it on a real problem.

Unlock this breakdown and 157 more papers.

Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.

6 months · One payment · No auto-renewal

Get Premium · ₹2,000 / $25
  • ◇1 architecture diagram
  • </>1 runnable code experiment
  • ▦2 results tables
  • ?5 interview questions with answers
  1. 03Key takeaways

    The model, the threshold, the scaling, the baselines and three misreadings

    Free account
  2. 04How it works

    The population equation, the threshold, and the proof-of-concept setup

    Premium
  3. 05The numbers that matter

    The threshold, the scaling, the alignment baseline and the milestones

    Premium
  4. 06Try it yourself

    Recompute the threshold, the limit, the log-N round count and the alignment baseline

    Premium
  5. 07Where it breaks

    Simulation assumptions, homogeneity, the open defense, and a slip

    Premium
  6. 08Using it on a deployment

    Containing one bad agent in a multi-agent system with shared memory

    Premium
  7. 09Interview angles

    Five questions this paper prepares you for, with answer hints

    Premium
Back to the paper library →