eccvm.bench.cpp

Go to the documentation of this file.

#include <benchmark/benchmark.h>
 
#include "barretenberg/ecc/curves/bn254/fq.hpp"
#include "barretenberg/eccvm/eccvm_circuit_builder.hpp"
#include "barretenberg/eccvm/eccvm_prover.hpp"
#include "barretenberg/eccvm/eccvm_verifier.hpp"
#include "barretenberg/srs/global_crs.hpp"
 
using namespace benchmark;
using namespace bb;
 
using Flavor = ECCVMFlavor;
using Builder = ECCVMCircuitBuilder;
using Transcript = ECCVMFlavor::Transcript;
 
namespace {
 
Builder generate_trace(size_t target_num_gates)
{
    std::shared_ptr<ECCOpQueue> op_queue = std::make_shared<ECCOpQueue>();
    using G1 = typename Flavor::CycleGroup;
    using Fr = typename G1::Fr;
 
    auto generators = get_precomputed_generators<G1, "test generators", 2>();
 
    typename G1::element a = generators[0];
    typename G1::element b = generators[1];
    Fr x = Fr::random_element();
    Fr y = Fr::random_element();
 
    // Each loop adds 163 gates. Note: builder.get_estimated_num_finalized_gates() is very expensive here (bug?) and
    // it's actually painful to use a `while` loop
    size_t num_iterations = target_num_gates / 163;
    for (size_t _ = 0; _ < num_iterations; _++) {
        op_queue->add_accumulate(a);
        op_queue->mul_accumulate(a, x);
        op_queue->mul_accumulate(b, x);
        op_queue->mul_accumulate(b, y);
        op_queue->add_accumulate(a);
        op_queue->mul_accumulate(b, x);
        op_queue->eq_and_reset();
        op_queue->merge();
    }
 
    using Fq = curve::BN254::BaseField;
    op_queue->append_hiding_op(Fq::random_element(), Fq::random_element());
 
    Builder builder{ op_queue };
    return builder;
}
 
void eccvm_generate_prover(State& state) noexcept
{
 
    size_t target_num_gates = 1 << static_cast<size_t>(state.range(0));
    for (auto _ : state) {
        Builder builder = generate_trace(target_num_gates);
        std::shared_ptr<Transcript> prover_transcript = std::make_shared<Transcript>();
        ECCVMProver prover(builder, prover_transcript);
    };
}
 
template <typename Prover> void construct_proof(State& state) noexcept
{
    size_t target_num_gates = 1 << static_cast<size_t>(state.range(0));
    for (auto _ : state) {
        Builder builder = generate_trace(target_num_gates);
        std::shared_ptr<Transcript> prover_transcript = std::make_shared<Transcript>();
        Prover prover(builder, prover_transcript);
        auto proof = prover.construct_proof();
        benchmark::DoNotOptimize(proof);
        benchmark::DoNotOptimize(prover.ipa_proof);
    };
}
 
template <typename Prover> void execute_sumcheck(State& state) noexcept
{
    size_t target_num_gates = 1 << static_cast<size_t>(state.range(0));
    for (auto _ : state) {
        state.PauseTiming();
        Builder builder = generate_trace(target_num_gates);
        std::shared_ptr<Transcript> prover_transcript = std::make_shared<Transcript>();
        Prover prover(builder, prover_transcript);
        prover.execute_preamble_round();
        prover.execute_wire_commitments_round();
        prover.execute_log_derivative_commitments_round();
        prover.execute_grand_product_computation_round();
        state.ResumeTiming();
 
        prover.execute_relation_check_rounds();
        benchmark::DoNotOptimize(prover.sumcheck_output);
    };
}
 
void eccvm_full_prove(State& state) noexcept
{
    construct_proof<ECCVMProver>(state);
}
 
void eccvm_full_sumcheck(State& state) noexcept
{
    execute_sumcheck<ECCVMProver>(state);
}
 
BENCHMARK(eccvm_generate_prover)->Unit(kMillisecond)->DenseRange(12, CONST_ECCVM_LOG_N);
BENCHMARK(eccvm_full_prove)->Unit(kMillisecond)->DenseRange(12, CONST_ECCVM_LOG_N);
BENCHMARK(eccvm_full_sumcheck)->Unit(kMillisecond)->DenseRange(12, CONST_ECCVM_LOG_N);
} // namespace
 
int main(int argc, char** argv)
{
    bb::srs::init_file_crs_factory(bb::srs::bb_crs_path());
    benchmark::Initialize(&argc, argv);
    benchmark::RunSpecifiedBenchmarks();
    benchmark::Shutdown();
    return 0;
}