Fastest at the largest graphs
verified_2026_v2 →#SystemWins · podiumsTime as n growsDone
A contest is one structured topology with left or right recursion at its largest n; the fastest completed system wins it. The line is the geometric mean time over topologies as n grows.
Latest campaign
verified_2026_v2 →99.4%
verified
Executed runs12,289
Timeout23
Out of memory13
Unsupported36
Iteration limit2
Skipped after a failure528
Topologies
Systems
ManageFrom the command line
Linux 6.18.15+deb13-cloud-amd64 · 48 CPUs · Python 3.12.15$
./virtualenv/bin/python benchmark.py --systems duckdb postgres --sizes 100 200 300 --campaign results/my_campaign$
./virtualenv/bin/python transitive.py --systems duckdb --sizes 100 301 100 --campaign results/my_campaignBoth commands, and the Start button of the wizard, run the same engine. A campaign directory holds one runs.jsonl per system, and its tables and figures appear under Campaigns when the run ends.