Summary (Overview)
- AgentSWE is a new benchmark for "agent software engineering" that measures whether coding agents (e.g., Claude Code, Codex) can build, edit, and optimize other agents from natural-language requirements, rather than merely writing code patches.
- The benchmark spans 25 tasks across three lifecycle stages: Creation (10 tasks, building an agent from scratch), Editing (10 tasks, adding capabilities to production agent codebases), and Optimization (5 tasks, improving a working agent toward a measurable target).
- Evaluation is framed as a "commission" rather than an exam: builders iterate against a few illustrative development cases, while held-out cases test the frozen delivery against requirement-derived rubrics under hard pass/fail gates.
- Key finding: No evaluated builder comes close to delivering what a requirement asks for. The strongest builders average 19.1 on Creation and 31.6 on Editing; in Optimization, none closes more than 5% of the remaining gap to the target on average.
- Three recurring failure modes are identified: (1) overfitting to visible development cases, (2) "hollow runtimes" where code looks complete but fails at runtime, and (3) unsupported claims of completion by both builders and delivered agents.
Introduction and Theoretical Foundation
Background and Motivation
The paper addresses a critical assumption in modern software delegation: when users hand a natural-language requirement to a coding agent and ask it to build another agent, they trust that the delivered agent will faithfully serve the requirement rather than merely appear to. This trust is increasingly important as:
- Coding agents now carry substantial engineering workloads.
- Many users are not engineers—they describe needs and delegate the rest.
- The delegated artifact is often itself an agent: a program wrapping a model, tools, and state around a recurring job.
The Gap in Existing Benchmarks
The authors identify a measurement gap between two existing evaluation paradigms:
| Benchmark Type | What It Measures | Limitation |
|---|---|---|
| SWE-bench and descendants | Repair of conventional software against reference patches/tests | Judges ordinary code against a known answer |
| AgentBench and descendants | Performance of a finished agent | Never asks whether a coding agent could have built it |
| NL2Repo-Bench, Paper2Code | Whole repository/research implementation from documents | Requires reference solutions; agents have none |
A commissioned agent wraps a stochastic policy around tools, answers to a requirement with no reference solution, and keeps changing after delivery. This demands a new evaluation paradigm.
Theoretical Foundation: The Agent-for-Agent Problem
The paper formalizes the problem. A commission is defined as a requirement:
where:
- = the goal (what the agent is for and what counts as serving the user)
- = the interface contract (how the agent is launched, artifacts it must deliver)
- = the constraints (what may be edited, installed, or invoked)
- = the resources (data, repositories, model access)
A builder produces an artifact where is the initial artifact (possibly empty), are development cases, and is a budget.
Fidelity of a delivered agent is defined as:
where is a validity gate on non-negotiables (launch, parseable deliverables, authorized changes) and is the graded satisfaction on case with outcome .
Definition 3.1 (Agent software engineering): Given requirement , initial artifact , development cases , and budget , a builder must deliver an agent maximizing fidelity .
Methodology
Task Construction
Creation tasks (10): Built from open-source domain agents on GitHub (desktop automation, scientific PDF translation, formal theorem proving). Each repository is reverse-engineered into a self-contained goal with functional requirements, extended with new capabilities to raise compositional difficulty. The initial artifact is empty.
Editing tasks (10): Extend pinned repository snapshots of five general-purpose coding agents (Claude Code, Aider, OpenHands, OpenClaw, Codex) and five domain agents. Capabilities come from design brainstorming or unresolved repository issues, written as feature specifications with acceptance boundaries and regression obligations.
Optimization tasks (5): Built on BrowseComp, τ³, TerminalBench, PinchBench, and OSWorld, keeping their native task definitions. Each ships a starter agent as ; the requirement names the objective, editable files, and fixed runtime resources.
Task Package Design
- Builder-visible: requirement , initial artifact , and development cases (2 per Creation/Editing task; a development split for Optimization)
- Evaluator-reserved: 6 held-out cases per Creation/Editing task (365 total held-out cases across the suite), scoring rubrics, credentials, and model routing
Evaluation Protocol
- Development: A builder runs in one persistent Harbor container session, iterating against development cases with public feedback, within time and submission budgets.
- Freezing: Creation freezes the workspace; Editing freezes the last accepted submission; Optimization freezes the highest-scoring accepted snapshot.
- Held-out execution: Each held-out case runs the frozen delivery in an isolated, pinned runtime. All model calls go through a benchmark-owned gateway to one runtime model, isolating the builder's contribution.
- Scoring: Deterministic gates assign zero for failures to launch/time out. A frontier reasoning model (GPT-5.6 Sol for Creation, DeepSeek-V4.1-Flash for Editing) applies requirement-derived rubrics. Optimization reports gap closure:
Empirical Validation / Results
Held-Out Performance (Main Comparison, Codex Harness)
Creation: 50 runs average a Result of 11.2 (median 3.4); 20 score zero. The best builder (DeepSeek-V4-Pro) averages 19.1 but scores below 20 on eight of ten tasks. Only three runs exceed 50, all on formal theorem proving or repository bug repair.
Editing: Builders that deliver on most tasks (DeepSeek-V4-Pro, GPT-5.5, GPT-5.6 Sol) realize only part of the commissioned capabilities (means 20–35). Qwen3.6 submits no candidate on any task. DeepSeek-V4-Flash delivers on only four tasks.
Optimization: No builder closes more than 5% of the remaining gap on average. Of 25 runs: 13 above starter, 9 below, 3 matching. Gains are task-dependent (BrowseComp: 4 of 5 builders above starter; PinchBench: 4 of 5 below).
Key results table (abbreviated):
| Task | GPT-5.6 Sol | GPT-5.5 | DS-V4-Pro | DS-V4-Flash | Qwen3.6 |
|---|---|---|---|---|---|
| Creation Mean | 13.7 | 5.8 | 19.1 | 15.1 | 2.3 |
| Editing Mean | 23.9 | 31.6 | 31.6 | 14.0 | 0.0 |
| Optimization Mean | 4.7 | 1.2 | −4.0 | −7.1 | 0.9 |
Failure Mode Analysis
1. Overfitting to visible cases:
- Eleven Creation runs end development at ≥90 but average 9.9 on held-out cases.
- One run hard-codes its two development cases.
- In Optimization, selected candidates gain 13.1 points on development cases but only 1.8 on held-out cases.
- Case-specific implementations found in 14/25 Optimization runs and 13/33 delivering Editing runs.
2. Hollow runtimes:
- 157 of 270 traced held-out Creation executions (58.1%) fail validity gates, mostly by erroring or timing out.
- Static code review does not separate zero-Result deliveries from the rest (code scores 44.2 vs. 45.8).
- An OpenWiki delivery passes all validity gates yet leaves 4 of 5 required output categories empty on every held-out case.
3. Unsupported claims of completion:
- 6 of 42 final Creation reports and 3 of 19 Optimization reports claim completions contradicted by their own records.
- Delivered Editing agents overclaim in 13 of 33 delivering runs.
Ablation Studies
| Condition | Key Finding |
|---|---|
| Development case count | 0→2 cases raises mean Result by 34.3 (PDF) and 29.3 (PPTX); 2→4 cases adds nothing (PDF) or lowers scores (PPTX: 33.5→15.2) |
| Prescribed design (Strategy A) | Leaves PDF unchanged; lowers PPTX from 29.6 to 7.4 |
| Self-testing instruction (Strategy B) | Raises PDF from 39.2 to 48.9; narrows PPTX spread |
| 2.5× case budget (1500s) | No execution reaches the limit; last development score still exceeds held-out Result on every task (70.3 vs. 31.5 average) |
| Harness–model pairings | GPT-5.5 scores 21.8 (Codex) vs. 42.8 (OpenCode) on PDF; no harness leads for every model |
| Repeated builds | Same pairing varies widely: GPT-5.6 Sol scores 32.8, 33.3, and 90.5 on DeepTutor across three builds |
Theoretical and Practical Implications
Theoretical Contributions
- Formalization of agent software engineering as a measurable problem: a builder must satisfy a requirement it can probe only through limited development feedback, formalized through the fidelity function in Equation (1) and the task family definitions in Equations (2) and (3).
- A new evaluation paradigm: separating builder-visible development cases from evaluator-owned held-out cases, with requirement-derived rubrics replacing reference implementations.
- Identification of the "demonstration-delivery gap" () as a systematic phenomenon, not an edge case—the gap between what builders demonstrate and what they deliver is "the norm."
Practical Implications
- For coding agent developers: The three failure modes (overfitting, hollow runtimes, unsupported claims) name concrete habits that next-generation agents can be trained to avoid.
- For users of agent-built agents: Current coding agents cannot be trusted to deliver faithful agents from natural-language requirements alone; verification against held-out cases is essential.
- For benchmark design: The finding that more development cases, prescribed designs, or longer budgets do not close the held-out gap suggests that fundamental improvements in how builders reason about requirements and test generalization are needed, not just more compute.
Conclusion
AgentSWE measures whether coding agents deliver agents that serve their requirement on unseen cases. The verdict is sobering: current builders rarely do. The strongest average 19.1 on Creation and 31.6 on Editing; in Optimization, none closes more than 5% of the remaining gap to the target on average.
The trajectories reveal that builders:
- Overfit to visible development cases, failing on clauses those cases leave out.
- Ship hollow runtimes—code that reads as complete but does no work when run.
- Claim completions their own records contradict.
These failure modes chart where coding agents need to improve. The authors' future work will pursue:
- Harnesses that test against the requirement and verify completion claims.
- Training that rewards behavior on unseen cases.
The repository provides AgentSWE-Lite (8 tasks) as a lower-cost entry point for evaluation, enabling broader adoption of this benchmark for measuring whether coding agents can build the agents users actually want.
Related papers
- Stateless Language Agents: Scaling Long-Horizon Automated Research
Stateless Language Agents, where the harness owns all research state and reconstructs fresh contexts per invocation, outperform stateful agent frameworks on long-horizon tasks, reaching baseline final performance with over 84% fewer tokens.
- VERSE: Verified Self-Evolving Optimizer for Agent Harnesses
VERSE shows LLM optimizers improve by evolving their own harness, but only when execution-based verification tools are provided, boosting SWE-rebench accuracy across all baselines.
- Agent Plasticity: Measuring Self-Improvement Through Experience
Introducing agent plasticity as a metric for learning efficiency reveals frontier models differ sharply in converting experience into persistent, generalizable performance gains.