IN THIS BREAKDOWN · 10 SECTIONS
You can read 22% of this breakdown.
The paper in one minute
Kimi K2.5 is Moonshot AI's open-weight multimodal model, built on Kimi K2 (a mixture-of-experts model with 1.04 trillion total and 32 billion active parameters) by continued training on about 15 trillion mixed text and vision tokens. Most of the report is about training text and vision together. For anyone building agents, the important part is Agent Swarm.
Most agents call one tool at a time, so a task that needs 300 searches takes 300 steps, and one context window holds everything they return. Agent Swarm gives the model two extra tools. create_subagent defines a sub-agent with its own system prompt. assign_task sends it work. Several sub-agents run in parallel, each with its own context, and each returns a single message to the orchestrator.
The orchestrator learns when to do this through Parallel-Agent Reinforcement Learning (PARL). Only the orchestrator is trained; sub-agents are frozen copies of an earlier checkpoint whose outputs count as observations. That avoids the problem of deciding which agent deserves credit for a final answer. The reward is the task score plus two temporary bonuses: one for creating sub-agents, so training does not collapse into a single serial agent, and one for sub-agents finishing their assignments, so the orchestrator does not spawn agents that do nothing. Both bonuses decay to zero by the end of training.
Latency is measured in critical steps: the orchestrator's steps plus, for each batch of parallel sub-agents, the steps of the slowest one. Splitting work only helps if it shortens the longest branch.
On WideSearch, the swarm reached a given score 3 to 4.5 times faster than a single agent, and scored 79.0% item-F1 against 72.7%.
Research notes: the problem, approach and results
less wall-clock time to reach a target item-F1 on WideSearch, swarm against single agent
BrowseComp, Agent Swarm against the single agent with discard-all context management; 60.6% without it
tool calls each sub-agent may make on BrowseComp, under an orchestrator limited to 15 steps
Agents that call tools one after another take longer as tasks grow, and a single context fills up on broad tasks such as checking forty companies or reading a hundred documents. Hand-written parallel workflows are brittle, and training several agents together has unclear credit assignment.
Give the model two tools, create_subagent and assign_task, and train only the orchestrator with RL (PARL); sub-agents are frozen checkpoints whose results come back as observations. Reward the task outcome, plus temporary bonuses for creating sub-agents and for sub-agents finishing their work, and constrain episodes by critical steps, the longest parallel branch, rather than total steps.
BrowseComp rose to 78.4% from 60.6% for the single agent without context management (74.9% with discard-all context management). WideSearch item-F1 rose from 72.7% to 79.0%, and the time to reach a target score fell 3 to 4.5 times. The underlying K2.5 model, a 1.04-trillion-parameter MoE with 32B active, is released.
Why it matters to an FDE
Customer research tasks are often wide: pull the latest filings for 40 suppliers, check 200 contracts for a clause, compare pricing across 30 competitors. A single agent does them one at a time and runs out of context partway through. Agent Swarm is a lab's worked answer: decompose, run in parallel with separate contexts, merge summaries.
Three things transfer even if you never use Kimi.
Separate contexts are context management. Each sub-agent sees only its share; the orchestrator sees only results. The paper frames this as sharding context rather than truncating it, and on BrowseComp it beat the same model using discard-all context management.
Measure latency as the longest branch. Critical steps make the trade-off explicit: eight sub-agents where one handles every item is no faster than one agent.
Guard against fake parallelism. The finish-rate bonus exists because the orchestrator learned to spawn agents that did nothing, which inflated a parallelism score without helping.
What the paper does not tell you is the bill. It reports time saved and accuracy gained, but no total tokens, tool calls or cost for the swarm. Each BrowseComp sub-agent may make up to 100 tool calls. Faster wall-clock time can mean much more total work. Before recommending a swarm, measure total tokens per completed task next to latency.
Read the 17.8-point BrowseComp gain against its baseline: the single agent had no context management and failed whenever its context overflowed. With discard-all context management it scored 74.9%, so the swarm's edge there is 3.5 points.
Understand the mechanism. Try it on a real problem.
Unlock this breakdown and 149 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
- ◇1 architecture diagram
- </>1 runnable code experiment
- ▦2 results tables
- ?5 interview questions with answers
- 03Key takeaways
How the swarm is built and trained, what it achieved, what it costs, and three misreadings
Free account - 04How it works
The swarm's tools, PARL training, critical steps, training prompts and the base model
Premium - 05The numbers that matter
Swarm results, time savings by target, budgets, and the base model's headline benchmarks
Premium - 06Try it yourself
Re-baseline the swarm's gains, then simulate latency, total work and context for a wide task
Premium - 07Where it breaks
Missing cost data, generous budgets, task selection, an in-house benchmark and small slips
Premium - 08Using it on a deployment
Fitting parallel sub-agents to a customer task, with budgets, merging and cost tracking
Premium - 09Interview angles
Five questions this paper prepares you for, with answer hints
Premium - 10Read next
Where to go from here on this site
Premium
