engine averages internally via `repeat`; trials average across requests.
Sweep generates random trees of size N, calls /benchmark with one op, and fits the mean timings. Slope on log-log plot ≈ exponent k in O(Nk). Best fit is chosen by R² against canonical complexity curves.