barretenberg
Loading...
Searching...
No Matches
testing.hpp
1#pragma once
2#include "barretenberg/common/zip_view.hpp"
3#include "barretenberg/polynomials/polynomial.hpp"
4
5namespace proof_system::honk {
11template <typename Flavor>
12typename Flavor::ProverPolynomials get_sequential_prover_polynomials(const size_t log_circuit_size,
13 const size_t starting_value)
14{
15 using FF = typename Flavor::FF;
16 using Polynomial = typename Flavor::Polynomial;
17
18 typename Flavor::ProverPolynomials prover_polynomials;
19 size_t circuit_size = 1 << log_circuit_size;
20 size_t value_idx = starting_value;
21 for (auto& polynomial : prover_polynomials.get_all()) {
22 polynomial = Polynomial(circuit_size);
23 for (auto& value : polynomial) {
24 value = FF(value_idx++);
25 }
26 }
27 return prover_polynomials;
28}
29
30template <typename Flavor> typename Flavor::ProverPolynomials get_zero_prover_polynomials(const size_t log_circuit_size)
31{
32 using FF = typename Flavor::FF;
33 using Polynomial = typename Flavor::Polynomial;
34
35 typename Flavor::ProverPolynomials prover_polynomials;
36 size_t circuit_size = 1 << log_circuit_size;
37 for (auto& polynomial : prover_polynomials.get_all()) {
38 polynomial = Polynomial(circuit_size);
39 for (auto& value : polynomial) {
40 value = FF(0);
41 }
42 }
43 return prover_polynomials;
44}
45
46} // namespace proof_system::honk
Definition: polynomial.hpp:12
A container for the prover polynomials handles.
Definition: AvmMini_flavor.hpp:263
A container for the prover polynomials handles.
Definition: goblin_translator.hpp:955
Defines particular circuit builder types expected to be used for circuit construction in stdlib and c...
Definition: claim.hpp:6
Flavor::ProverPolynomials get_sequential_prover_polynomials(const size_t log_circuit_size, const size_t starting_value)
Get a ProverPolynomials instance initialized to sequential values starting at 0.
Definition: testing.hpp:12