INQUIRING LINE

AI keeps acing its benchmarks — but if those benchmarks don't measure real work, what exactly are we tracking?

Can automated benchmarks accurately capture progress on real-world long-horizon tasks?

This explores whether the automated, auto-gradable benchmarks the field uses to track AI progress actually measure what we care about — sustained performance on messy, multi-step, real-world work — or something narrower that only looks like progress.


This explores whether automated benchmarks capture real progress on long-horizon tasks, and the corpus is unusually blunt: they mostly don't, and the reasons are structural rather than incidental. The sharpest statement comes from work showing that agents which sweep abstract contests still fail real occupational workflows — the so-called benchmark-to-GDP gap, where the field optimizes exactly what it measures and has chosen to measure contests rather than work Why do agent benchmarks not predict real economic value?. The distortion runs both ways: automated benchmarks *overstate* capability by privileging precisely-specified, auto-gradable tasks, and *understate* it by missing emerging capabilities that only show up in open-ended settings Do automated benchmarks hide what frontier AI systems can really do?.

The most direct evidence is temporal. When you actually stretch tasks out, rankings scramble. Models that look interchangeable on single-turn benchmarks diverge dramatically once you run them across 50 round-trip relays — degradation curves that are completely invisible to standard short-interaction tests only become visible around relay 25 Do short benchmarks predict how models perform over long workflows?. And what predicts success over the long haul isn't the thing benchmarks are best at scoring: it's *persistence* through repeated benchmark-edit-incorporate cycles, where most models quit early or burn their budget unproductively regardless of how sharp their initial output was What predicts success in ultra-long-horizon agent tasks?. A one-shot score simply cannot see this.

There's a second, quieter failure mode: benchmarks can be gamed by memorization without anyone noticing. A model that reconstructs half of MATH-500 from partial prompts but scores zero on a post-release benchmark reveals that a chunk of apparent "reasoning progress" was contamination — the benchmark measured recall dressed as capability Does RLVR success on math benchmarks reflect genuine reasoning improvement?. This is the same coin as the GDP gap: a clean-looking number that doesn't correspond to the thing you thought you were measuring.

What's the alternative the corpus points toward? Not abandoning measurement, but changing its texture. Open-world evaluation through qualitative log analysis — reading what the agent actually did, with cost reported honestly — catches capabilities earlier and corrects the distortions Do automated benchmarks hide what frontier AI systems can really do?. Interestingly, some systems already treat empirical benchmarking as an *engine* rather than a report card: the Darwin Gödel Machine self-improves by validating agent variants against real tasks and keeping an evolutionary archive, which is benchmarking used as a discovery loop instead of a scoreboard Can AI systems improve themselves through trial and error?.

The thing you might not have expected: reliability at extreme length turns out to be an *architecture* problem, not a raw-capability one, which is precisely why single-number benchmarks mislead. Million-step tasks can be solved error-free by small non-reasoning models — if you decompose them extremely and vote at each step Can extreme task decomposition enable reliable execution at million-step scale?. A benchmark that scores the base model in isolation would rank it poorly, yet the same model inside the right harness runs flawlessly for a million steps. That inversion — where the harness, the workflow structure, and the persistence budget matter more than the model's benchmark score Can LLMs actually forecast time series better than we think?, Can explicit behavior maps help weaker planners compete with stronger models? — is exactly what an automated long-horizon benchmark is worst positioned to capture.


Sources 9 notes

Why do agent benchmarks not predict real economic value?

ALE's analysis of 960 real occupational workflows shows agents excel at abstract contests but fail long-horizon professional tasks. The gap is not model capability but benchmark design—the field optimizes what it measures, and it has measured contests rather than work.

Do automated benchmarks hide what frontier AI systems can really do?

Automated benchmarks both overstate and understate capability by privileging precisely-specified, auto-gradable tasks. Open-world evaluations of long-horizon messy tasks through qualitative log analysis—with cost explicitly reported—correct these distortions and catch emerging capabilities earlier.

Do short benchmarks predict how models perform over long workflows?

DELEGATE-52 evaluated models across 50-round-trip relays and found short-interaction performance does not predict sustained delegation accuracy. Models ranking similarly on single-turn tasks diverged dramatically by relay 25, revealing degradation curves invisible to standard benchmarks.

What predicts success in ultra-long-horizon agent tasks?

Across 17 frontier models on 36 expert-curated optimization tasks, repeated benchmark-edit-incorporate cycles within a wall-clock budget proved the dominant success predictor. Most models terminated early or burned budget unproductively; Claude Opus 4.6 stood out as persistent.

Does RLVR success on math benchmarks reflect genuine reasoning improvement?

Qwen2.5-Math-7B reconstructs 54.6% of MATH-500 from partial prompts but scores 0.0% on post-release LiveMathBench, revealing dataset contamination. On clean benchmarks, only correct rewards improve performance; random and inverse rewards fail or degrade reasoning ability.

Show all 9 sources
Can AI systems improve themselves through trial and error?

DGM replaces formal proofs with empirical benchmarking and maintains an evolutionary archive of agent variants, achieving 2.5× improvement on SWE-bench and 2.2× on Polyglot by discovering capabilities like better code editing and context management.

Can extreme task decomposition enable reliable execution at million-step scale?

MAKER solves million-step tasks with zero errors by decomposing into minimal subtasks, applying voting at each step, and flagging correlated errors. Surprisingly, small non-reasoning models suffice when decomposition is extreme enough, inverting the standard approach to hard problems.

Can LLMs actually forecast time series better than we think?

LLMs have stronger intrinsic forecasting ability than recognized, but only when workflows separate numerical reasoning from contextual reasoning. Monolithic prompting obscures this capability; structured decomposition surfaces it.

Can explicit behavior maps help weaker planners compete with stronger models?

A behavior-to-code mapping representation improved win rates by 10–19 points while reducing planner tokens by 8–13%. Weaker planners using this mapping matched stronger models' code localization across all precision and recall metrics.

Papers this line draws on 8

The research behind the notes this line reads — ranked by how closely each paper relates.

Research prompt for your LLMexpand ↓

Copy into ChatGPT or Claude to take this line of inquiry further — it asks the model to find newer work and re-test which earlier constraints still hold.

You are an evaluation analyst. Still-open question: can automated benchmarks accurately capture progress on real-world long-horizon tasks?

What a curated library found — and when (dated claims, not current truth; findings span ~2025–2026):
- Agents that sweep abstract contests still fail real occupational workflows — a "benchmark-to-GDP gap" where the field measures contests, not work (~2026).
- Automated benchmarks both OVERSTATE capability (privileging auto-gradable, precisely-specified tasks) and UNDERSTATE it (missing capabilities that only surface in open-ended settings) (~2026).
- Rankings scramble over horizon: models look interchangeable single-turn, then diverge across 50 relays — degradation invisible until ~relay 25 (~2026).
- What predicts long-haul success is persistence through benchmark-edit-incorporate cycles, not initial-output sharpness; most models quit early (~2026).
- Contamination masquerades as reasoning: a model reconstructs half of MATH-500 from partial prompts yet scores zero post-release (~2025). Reliability at extreme length is an architecture problem — small non-reasoning models run a million steps error-free under extreme decomposition + voting (~2025).

Anchor papers (verify; mind their dates): Darwin Gödel Machine (2025, arXiv:2505.22954); Reasoning or Memorization? (2025, arXiv:2507.10532); Solving a Million-Step LLM Task with Zero Errors (2025, arXiv:2511.09030); Open-World Evaluations for Measuring Frontier AI Capabilities (2026, arXiv:2605.20520).

Your task:
(1) RE-TEST EACH CONSTRAINT. For every finding, judge whether newer models, training, tooling, orchestration (memory, harnesses, multi-agent), or evaluation has relaxed or overturned it — and, since this is frontier-extending, name what remains UNSOLVED next. Separate the durable question from the perishable limitation; cite what resolved it and say where a constraint still holds.
(2) Surface the strongest contradicting or superseding work from the last ~6 months.
(3) Propose 2 research questions that assume the regime may have moved.

Cite arXiv IDs; flag anything you cannot ground in a real paper.