Benchmark result with 2^20 entries, based on https://github.com/summa-dev/summa-solvency/commit/d6e85c9affebef338846d5fb13e40eb8ab657811

v1.1.1_2_20_entry_benchmark_result.log

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 246.7s.
Benchmarking build Merkle sum tree for 2 power of 20 entries with 1 currencies: Collecting 10 samples in estimated 246.69 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:   [24.533 s 24.542 s 24.552 s]

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 255.2s.
Benchmarking build sorted Merkle sum tree for 2 power of 20 entries with 1 currencies: Collecting 10 samples in estimated 255.18 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:   [25.744 s 25.754 s 25.765 s]

Start:   None Creating params
End:     None Creating params ......................................................152.112ms
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 5.9s 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 5.8847 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:   [106.27 ms 106.88 ms 107.50 ms]

Start:   None Creating params
End:     None Creating params ......................................................189.223ms
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

Warning: Unable to complete 10 samples in 5.0s. You may wish to increase target time to 6.9s or enable flat sampling.
Benchmarking gen proving key for 2 power of 20 entries with 1 currencies mst inclusion circuit: Collecting 10 samples in estimated 6.9069 s (55 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:   [125.11 ms 125.87 ms 126.55 ms]

Start:   None Creating params
End:     None Creating params ......................................................153.335ms
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 ............................................................421.234ms
Start:   Creating proof
End:     Creating proof ............................................................410.184ms
Start:   Creating proof
End:     Creating proof ............................................................403.601ms
Start:   Creating proof
End:     Creating proof ............................................................401.910ms
Start:   Creating proof
End:     Creating proof ............................................................398.599ms
Start:   Creating proof
End:     Creating proof ............................................................399.605ms
Start:   Creating proof
End:     Creating proof ............................................................401.825ms
Start:   Creating proof
End:     Creating proof ............................................................402.933ms
Start:   Creating proof
End:     Creating proof ............................................................399.061ms
Start:   Creating proof
End:     Creating proof ............................................................416.201ms
Start:   Creating proof
End:     Creating proof ............................................................398.921ms
Start:   Creating proof
End:     Creating proof ............................................................407.009ms
Start:   Creating proof
End:     Creating proof ............................................................399.422ms
Start:   Creating proof
End:     Creating proof ............................................................404.702ms
Start:   Creating proof
End:     Creating proof ............................................................398.472ms
Benchmarking generate zk proof - tree of 2 power of 20 entries with 1 currencies mst inclusion circuit: Collecting 10 samples in estimated 8.0925 s (20 iterations)
Start:   Creating proof
End:     Creating proof ............................................................399.163ms
Start:   Creating proof
End:     Creating proof ............................................................398.436ms
Start:   Creating proof
End:     Creating proof ............................................................405.581ms
Start:   Creating proof
End:     Creating proof ............................................................422.977ms
Start:   Creating proof
End:     Creating proof ............................................................405.305ms
Start:   Creating proof
End:     Creating proof ............................................................414.423ms
Start:   Creating proof
End:     Creating proof ............................................................400.461ms
Start:   Creating proof
End:     Creating proof ............................................................403.771ms
Start:   Creating proof
End:     Creating proof ............................................................399.507ms
Start:   Creating proof
End:     Creating proof ............................................................404.276ms
Start:   Creating proof
End:     Creating proof ............................................................399.280ms
Start:   Creating proof
End:     Creating proof ............................................................403.429ms
Start:   Creating proof
End:     Creating proof ............................................................400.818ms
Start:   Creating proof
End:     Creating proof ............................................................398.810ms
Start:   Creating proof
End:     Creating proof ............................................................402.050ms
Start:   Creating proof
End:     Creating proof ............................................................408.469ms
Start:   Creating proof
End:     Creating proof ............................................................398.912ms
Start:   Creating proof
End:     Creating proof ............................................................399.883ms
Start:   Creating proof
End:     Creating proof ............................................................398.095ms
Start:   Creating proof
End:     Creating proof ............................................................395.695ms
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:   [400.44 ms 403.33 ms 406.77 ms]
Found 1 outliers among 10 measurements (10.00%)
  1 (10.00%) high mild

Start:   None Creating params
End:     None Creating params ......................................................151.039ms
Start:   Creating proof
End:     Creating proof ............................................................401.845ms
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.0580 s (1265 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.9996 ms 4.0000 ms 4.0002 ms]
Found 1 outliers among 10 measurements (10.00%)
  1 (10.00%) low severe