3#include <gtest/gtest.h>
9 constexpr size_t d = 5;
10 std::vector<fr> betas(d);
11 for (
auto& beta : betas) {
17 for (
auto& u_i : variables) {
23 for (
auto& u_i : variables) {
25 expected_eval *=
fr(1) - u_i + u_i * poly.
betas[beta_idx];
34 std::vector<fr> betas{ 2, 4, 16 };
36 std::vector<fr> expected_values{ 1, 2, 4, 8, 16, 32, 64, 128 };
42 constexpr size_t d = 5;
43 std::vector<fr> betas(d);
44 for (
auto& beta : betas) {
48 std::vector<fr> expected_beta_products(1 << d);
49 for (
size_t i = 0; i < (1 << d); i++) {
50 expected_beta_products[i] = 1;
51 for (
size_t j = 0; j < d; j++) {
53 expected_beta_products[i] *= betas[j];
Structured polynomial class that represents the coefficients 'a' of a_0 + a_1 x .....
Entry point for Barretenberg command-line interface.
field< Bn254FrParams > fr
TEST(BoomerangMegaCircuitBuilder, BasicCircuit)
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Implementation of the methods for the -polynomials used in in Sumcheck.
std::vector< FF > betas
The challenges .
void partially_evaluate(FF challenge)
Partially evaluate the -polynomial at the new challenge and update .
FF partial_evaluation_result
The value obtained by partially evaluating one variable in the power polynomial at each round....
Polynomial< FF > beta_products
The consecutive evaluations for identified with the integers .
static field random_element(numeric::RNG *engine=nullptr) noexcept