Skip to content

Instantly share code, notes, and snippets.

@sifnoc
Created January 17, 2024 07:59
Show Gist options
  • Save sifnoc/838ad7ea10c01d05a985d0a5898ce129 to your computer and use it in GitHub Desktop.
Save sifnoc/838ad7ea10c01d05a985d0a5898ce129 to your computer and use it in GitHub Desktop.
WARNING: HTML report generation will become a non-default optional feature in Criterion.rs 0.4.0.
This feature is being moved to cargo-criterion (https://github.com/bheisler/cargo-criterion) and will be optional in a future version of Criterion.rs. To silence this warning, either switch to cargo-criterion or enable the 'html_reports' feature in your Cargo.toml.
Gnuplot not found, using plotters backend
Benchmarking build Merkle sum tree for 2 power of 20 entries with 1 currencies
Benchmarking build Merkle sum tree for 2 power of 20 entries with 1 currencies: Warming up for 3.0000 s
Warning: Unable to complete 10 samples in 5.0s. You may wish to increase target time to 318.7s.
Benchmarking build Merkle sum tree for 2 power of 20 entries with 1 currencies: Collecting 10 samples in estimated 318.70 s (10 iterations)
Benchmarking build Merkle sum tree for 2 power of 20 entries with 1 currencies: Analyzing
build Merkle sum tree for 2 power of 20 entries with 1 currencies
time: [31.954 s 31.966 s 31.978 s]
change: [+1.5803% +1.7455% +1.9273%] (p = 0.00 < 0.05)
Performance has regressed.
Benchmarking build sorted Merkle sum tree for 2 power of 20 entries with 1 currencies
Benchmarking build sorted Merkle sum tree for 2 power of 20 entries with 1 currencies: Warming up for 3.0000 s
Warning: Unable to complete 10 samples in 5.0s. You may wish to increase target time to 326.3s.
Benchmarking build sorted Merkle sum tree for 2 power of 20 entries with 1 currencies: Collecting 10 samples in estimated 326.31 s (10 iterations)
Benchmarking build sorted Merkle sum tree for 2 power of 20 entries with 1 currencies: Analyzing
build sorted Merkle sum tree for 2 power of 20 entries with 1 currencies
time: [32.806 s 32.826 s 32.847 s]
change: [+0.4616% +1.0316% +1.4122%] (p = 0.00 < 0.05)
Change within noise threshold.
Start: None Creating params
End: None Creating params ......................................................216.709ms
Benchmarking gen verification key for 2 power of 20 entries with 1 currencies mst inclusion circuit
Benchmarking gen verification key for 2 power of 20 entries with 1 currencies mst inclusion circuit: Warming up for 3.0000 s
Warning: Unable to complete 10 samples in 5.0s. You may wish to increase target time to 7.6s or enable flat sampling.
Benchmarking gen verification key for 2 power of 20 entries with 1 currencies mst inclusion circuit: Collecting 10 samples in estimated 7.5947 s (55 iterations)
Benchmarking gen verification key for 2 power of 20 entries with 1 currencies mst inclusion circuit: Analyzing
gen verification key for 2 power of 20 entries with 1 currencies mst inclusion circuit
time: [134.63 ms 135.42 ms 136.92 ms]
change: [-1.4694% -0.2336% +0.9823%] (p = 0.74 > 0.05)
No change in performance detected.
Start: None Creating params
End: None Creating params ......................................................214.384ms
Benchmarking gen proving key for 2 power of 20 entries with 1 currencies mst inclusion circuit
Benchmarking gen proving key for 2 power of 20 entries with 1 currencies mst inclusion circuit: Warming up for 3.0000 s
Benchmarking gen proving key for 2 power of 20 entries with 1 currencies mst inclusion circuit: Collecting 10 samples in estimated 5.6634 s (30 iterations)
Benchmarking gen proving key for 2 power of 20 entries with 1 currencies mst inclusion circuit: Analyzing
gen proving key for 2 power of 20 entries with 1 currencies mst inclusion circuit
time: [171.93 ms 180.14 ms 187.16 ms]
change: [-5.9664% -1.1019% +3.9066%] (p = 0.69 > 0.05)
No change in performance detected.
Found 1 outliers among 10 measurements (10.00%)
1 (10.00%) low mild
Start: None Creating params
End: None Creating params ......................................................214.834ms
Benchmarking generate zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit
Benchmarking generate zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit: Warming up for 3.0000 s
Start: Creating proof
End: Creating proof ............................................................478.634ms
Start: Creating proof
End: Creating proof ............................................................472.148ms
Start: Creating proof
End: Creating proof ............................................................498.289ms
Start: Creating proof
End: Creating proof ............................................................490.624ms
Start: Creating proof
End: Creating proof ............................................................478.621ms
Start: Creating proof
End: Creating proof ............................................................460.760ms
Start: Creating proof
End: Creating proof ............................................................432.057ms
Benchmarking generate zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit: Collecting 10 samples in estimated 9.4665 s (20 iterations)
Start: Creating proof
End: Creating proof ............................................................487.668ms
Start: Creating proof
End: Creating proof ............................................................509.956ms
Start: Creating proof
End: Creating proof ............................................................473.178ms
Start: Creating proof
End: Creating proof ............................................................478.994ms
Start: Creating proof
End: Creating proof ............................................................459.532ms
Start: Creating proof
End: Creating proof ............................................................460.488ms
Start: Creating proof
End: Creating proof ............................................................463.363ms
Start: Creating proof
End: Creating proof ............................................................505.090ms
Start: Creating proof
End: Creating proof ............................................................485.090ms
Start: Creating proof
End: Creating proof ............................................................471.696ms
Start: Creating proof
End: Creating proof ............................................................484.824ms
Start: Creating proof
End: Creating proof ............................................................494.894ms
Start: Creating proof
End: Creating proof ............................................................442.460ms
Start: Creating proof
End: Creating proof ............................................................441.371ms
Start: Creating proof
End: Creating proof ............................................................460.205ms
Start: Creating proof
End: Creating proof ............................................................480.810ms
Start: Creating proof
End: Creating proof ............................................................502.302ms
Start: Creating proof
End: Creating proof ............................................................447.847ms
Start: Creating proof
End: Creating proof ............................................................428.827ms
Start: Creating proof
End: Creating proof ............................................................490.429ms
Benchmarking generate zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit: Analyzing
generate zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit
time: [463.83 ms 473.76 ms 483.13 ms]
change: [-4.1951% -1.3928% +1.5254%] (p = 0.37 > 0.05)
No change in performance detected.
Start: None Creating params
End: None Creating params ......................................................212.943ms
Start: Creating proof
End: Creating proof ............................................................434.175ms
proof size in bytes: 1632
Benchmarking verify zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit
Benchmarking verify zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit: Warming up for 3.0000 s
Benchmarking verify zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit: Collecting 10 samples in estimated 5.1425 s (1375 iterations)
Benchmarking verify zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit: Analyzing
verify zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit
time: [3.6266 ms 3.7215 ms 3.8089 ms]
change: [-1.3987% +1.1565% +4.0176%] (p = 0.43 > 0.05)
No change in performance detected.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment