What it is

Automated construction of the things a benchmark is made of. The 2026 papers show environments, tasks, and graders can be generated at scale and low cost (ClawEnvKit, STAGE-Claw, LOGIGEN, TASTE), with validity enforced by construction (MANTRA’s symbolic cross-check, LOGIGEN’s state-diff verification) or by a second checker agent. What none of them measures is representativeness: whether generated tasks reflect real work. That is the gap the WorldSmith and ITSMBench projects sit in.

(agent-drafted from the sources’ summaries, not yet reviewed)

Key sources

  • LOGIGEN — Triple-agent pipeline compiles policy into DB triggers, forward-explores to synthesize 20k verifiable tasks; state-diff verification, demonstrated simulator hacking
  • TASTE — Samples tool sequences from contrastive n-gram model to build harder, broader-coverage tau-bench extension; hint-assisted verifier validated at precision 1.0
  • STAGE-Claw — An authoring agent writes task, environment and verifier; an independent checker agent validates reproducibility and difficulty; output-only grading inflates scores 5-7 points
  • ClawEnvKit — Generates whole environments (task, tools, fixtures, grader) from one natural-language line; 1,040 environments for $80 versus 208 human-hours, but validity is LLM-judged
  • MANTRA — Generates trace-level compliance checks and a symbolic world model independently from a manual, cross-validating them with Z3; 285 validated tasks, no LLM judge
  • Auditing Reward Hackability — Source of the 28.5% expert-verifier hack rate; when an agent repairs a verifier, 61.9% of its tests fail on the gold solution and an LLM judge endorses them anyway
  • Hardening Agent Benchmarks — Adversarial QA automated as a hacker/fixer/solver loop; a weak model’s defenses hold against stronger hackers, but hardening also rejects 11pp more legitimate solutions
  • SWE-Mutation — Scores an agent-built verifier by mutation kill rate, reporting both error directions in one run; the score moves ~30 points with attacker strength alone, so a frozen attacker is mandatory
  • Rate or Fate - RLVeR — verifier soundness reduces to one scalar, J = TPR − FPR; J > 0 costs only ~1/J compute, J < 0 destroys the policy (−12.6 pts at J = −0.1); assumes i.i.d. noise, which hackable verifiers violate

To ingest

(none)