1#include <benchmark/benchmark.h>
6using namespace benchmark;
12static void construct_proof_megahonk(State& state,
void (*test_circuit_function)(
MegaCircuitBuilder&,
size_t))
noexcept
14 size_t num_iterations = 10;
15 bb::mock_circuits::construct_proof_with_specified_num_iterations<MegaProver>(
16 state, test_circuit_function, num_iterations);
22static void construct_proof_megahonk_power_of_2(State& state)
noexcept
24 auto log2_of_gates =
static_cast<size_t>(state.range(0));
25 bb::mock_circuits::construct_proof_with_specified_num_iterations<MegaProver>(
26 state, &bb::mock_circuits::generate_basic_arithmetic_circuit<MegaCircuitBuilder>, log2_of_gates);
29static void get_row_power_of_2(State& state)
noexcept
31 auto log2_of_gates =
static_cast<size_t>(state.range(0));
32 size_t gates = 1 << log2_of_gates;
34 for (
auto _ : state) {
35 for (
size_t i = 0; i < gates; i++) {
36 benchmark::DoNotOptimize(polynomials.get_row(i));
44BENCHMARK_CAPTURE(construct_proof_megahonk, sha256, &generate_sha256_test_circuit<MegaCircuitBuilder>)
50 &stdlib::generate_ecdsa_verification_test_circuit<MegaCircuitBuilder>)
58BENCHMARK(construct_proof_megahonk_power_of_2)
A container for the prover polynomials handles.
Entry point for Barretenberg command-line interface.
BENCHMARK_CAPTURE(bench_round_mega, oink, [](auto &prover) { prover.run_oink_prover_on_each_incomplete_key();}) -> DenseRange(14, 20) -> Unit(kMillisecond)
BENCHMARK(vector_of_evaluations) -> DenseRange(15, 21) ->Unit(kMillisecond) ->Iterations(1)