GenesisBench evaluates how coding agents can use language intelligence to improve physical intelligence.
A task gives an autonomous coding agent:
- a robotics environment or simulator;
- a fixed starter policy, controller, planner, or training system;
- queryable development feedback;
- a bounded research budget;
- a standardized final-artifact contract.
After the agent exits, GenesisBench independently evaluates its final artifact on a clean, hidden suite and assigns the resulting robotics score to the agent. The workflow is inspired by PostTrainBench, but the optimized artifact controls a physical system rather than being an instruction-tuned language model.
tasks/simulation_heuristics_ant_v1/ is the first executable task and the
canonical package example. The complete article-derived suite contains nine
tasks spanning MuJoCo locomotion, Atari RAM and vision control, VizDoom,
long-horizon recovery, and the aggregate Atari57 workflow.
The package follows BenchFlow 0.6.5's native task.md format
(schema_version: "1.3", document version "0.6").
Final scoring uses full 1,000-step episodes:
score = 0.70 * hidden nominal mean return
+ 0.30 * hidden dynamics-robustness mean return
The checked-in reproducibility suite includes unseen seeds and conservative mass, friction, damping, and actuator perturbations. An official hosted leaderboard can inject a private suite without changing the task contract.
Requirements:
- Python 3.12+
uv- Daytona credentials for authoritative leaderboard experiments
- Docker only for optional local task development
Install and validate:
uv sync --extra dev
uv run python scripts/validate_tasks.py
uv run bench tasks check \
tasks/simulation_heuristics_ant_v1 \
--level publication-grade
uv run pytest -qEvaluate the starter policy:
uv run python tasks/simulation_heuristics_ant_v1/evaluate.py \
--policy tasks/simulation_heuristics_ant_v1/starter_policy/policy.pyPrepare exactly the public workspace an agent receives:
uv run python scripts/prepare_task.py \
simulation_heuristics_ant_v1 \
/tmp/genesisbench-simulation-heuristics-ant-v1 \
--forceThe prepared OpenCode workspace deliberately excludes verifier/, oracle/,
and evidence/.
OpenCode is the default and only leaderboard harness for the nine-task suite. Install the Daytona dependency when using the hosted sandbox:
uv sync --extra dev --extra sandbox-daytonaConfigure credentials:
cp .env.example .envRun one model across all nine tasks:
uv run python scripts/run_article_suite.py \
--env-file /path/to/credentials.env \
--model gpt-5.6-solRun all four canonical models and rebuild the 10 leaderboard artifacts:
uv run python scripts/run_article_suite.py \
--env-file /path/to/credentials.env \
--all-models
uv run python scripts/build_article_suite_leaderboard.pySee experiments/article_suite/README.md for the exact model routes, task
manifest, isolation controls, and scoring contract. The task-by-task research
mapping is documented in docs/learning-beyond-gradients-suite.md.
The five-trial OpenCode sweep across all nine article-derived tasks:
See leaderboard/ARTICLE_SUITE.md for the nine
task-specific leaderboards followed by the final cross-task leaderboard.
leaderboard/article_suite.json contains the same 10-board structure in
machine-readable form.
Scores are unbounded normalized values: 0 matches the public starter and
100 matches the trusted article-level reference. Negative scores are genuine
regressions; scores above 100 exceed the reference.
Each model runs five independent trials. The final ranking uses RLiable-style
interquartile mean (IQM) over all 45 normalized trial-task scores: remove the
lowest 11 and highest 11, then average the middle 23. The displayed ± value
is the sample standard deviation of the five per-trial nine-task IQMs. The chart
uses a plot-only positive index equal to IQM + 100; raw IQM remains in the
JSON.
Inference settings are provider-specific: GPT-5.6 Sol and Claude Opus 4.8 use
max; GPT-5.5 and GPT-5.4 Mini use xhigh. These labels come from different
provider interfaces and are categorical settings, not a shared numeric compute
scale. Exact routes are documented in
docs/learning-beyond-gradients-suite.md.
All published article-suite rows run in Daytona sandboxes.
See docs/article-suite-scoring.md for the
formula, research precedent, and statistical limitations.
The selected-trajectory timeout audit and repaired cells are documented in
docs/article-suite-timeout-fairness.md.
Create a scaffold:
uv run python scripts/create_task.py my_robot_task \
--title "My Robot Policy Improvement Task"Then:
- Read
tasks/README.md. - Study the complete reference task in
tasks/simulation_heuristics_ant_v1/. - Implement the starter artifact, public evaluator, and clean final verifier.
- Run
uv run python scripts/validate_tasks.py. - Include a real coding-agent canary and reproducible score evidence.
See CONTRIBUTING.md for the full contribution workflow.
- GenesisBench 1.0: language intelligence improves physical intelligence.
- GenesisBench 2.0: world intelligence improves physical intelligence.
- Add manipulation, navigation, whole-body control, data generation, and sim-to-real tasks while preserving task-level resource accounting and clean final evaluation.
- Learning Beyond Gradients
- Autoresearch
- Autoresearch Robotics
- Genesis
- MuJoCo
- Isaac Sim
- RoboCasa
- NVIDIA ASPIRE
- NVIDIA ENPIRE
GenesisBench is licensed under GPL-3.0. See LICENSE.
Some reference-policy code is derived from Apache-2.0-licensed work. See
THIRD_PARTY_NOTICES.md and LICENSES/Apache-2.0.txt.
