2#include <gtest/gtest.h>
16 auto P1 = G1::random_element();
17 auto P2 = G1::random_element();
20 op_queue->initialize_new_subtable();
21 op_queue->add_accumulate(P1);
22 op_queue->mul_accumulate(P2, z);
23 op_queue->eq_and_reset();
36 auto table_polynomials = op_queue->construct_ultra_ops_table_columns();
37 auto prev_table_polynomials = op_queue->construct_previous_ultra_ops_table_columns();
38 auto subtable_polynomials = op_queue->construct_current_ultra_ops_subtable_columns();
42 for (
auto [table_poly, prev_table_poly, subtable_poly] :
43 zip_view(table_polynomials, prev_table_polynomials, subtable_polynomials)) {
44 const Fr table_eval = table_poly.evaluate(eval_challenge);
47 if (settings == MergeSettings::PREPEND) {
49 const size_t current_subtable_size = op_queue->get_current_ultra_ops_subtable_num_rows();
50 const Fr subtable_eval = subtable_poly.evaluate(eval_challenge);
51 const Fr shifted_previous_table_eval = prev_table_poly.evaluate(eval_challenge) *
52 eval_challenge.
pow(current_subtable_size);
53 EXPECT_EQ(table_eval, subtable_eval + shifted_previous_table_eval);
56 const size_t prev_table_size = op_queue->get_previous_ultra_ops_table_num_rows();
57 const size_t shift_magnitude = ultra_fixed_offset.has_value()
61 const Fr prev_table_eval = prev_table_poly.evaluate(eval_challenge);
62 const Fr shifted_subtable_eval =
63 subtable_poly.evaluate(eval_challenge) * eval_challenge.
pow(shift_magnitude);
64 EXPECT_EQ(table_eval, shifted_subtable_eval + prev_table_eval);
76 auto ultra_table = op_queue->get_ultra_ops();
77 auto eccvm_table = op_queue->get_eccvm_ops();
80 for (
const auto& ultra_op : ultra_table) {
81 if (ultra_op.op_code.value() == 0) {
84 EXPECT_EQ(ultra_op.op_code.value(), eccvm_table[j++].op_code.value());
98 EXPECT_EQ(eccvm_ops[0].base_point, G1::one());
99 EXPECT_EQ(eccvm_ops[1].op_code.add,
false);
108 auto P1 = G1::random_element();
109 auto P2 = G1::random_element();
111 auto P_expected = P1 + P2 * z;
135 const size_t NUM_SUBTABLES = 5;
136 for (
size_t i = 0; i < NUM_SUBTABLES; ++i) {
139 op_queue->merge(settings);
153 const size_t NUM_SUBTABLES = 2;
154 for (
size_t i = 0; i < NUM_SUBTABLES; ++i) {
157 op_queue->merge(settings);
164 op_queue->merge(settings);
177 const size_t NUM_SUBTABLES = 2;
178 for (
size_t i = 0; i < NUM_SUBTABLES; ++i) {
181 op_queue->merge(settings);
186 const size_t ultra_fixed_offset = op_queue->get_ultra_ops_table_num_rows() + 20;
189 op_queue->merge(settings, ultra_fixed_offset);
static void check_table_column_polynomials(const std::shared_ptr< bb::ECCOpQueue > &op_queue, MergeSettings settings, std::optional< size_t > ultra_fixed_offset=std::nullopt)
Check that the table column polynomials reconstructed by the op queue have the correct relationship.
static void check_opcode_consistency_with_eccvm(const std::shared_ptr< bb::ECCOpQueue > &op_queue)
Check that the opcode values are consistent between the ultra ops table and the eccvm ops table.
static void populate_an_arbitrary_subtable_of_ops(const std::shared_ptr< bb::ECCOpQueue > &op_queue)
Used to construct execution trace representations of elliptic curve operations.
UltraOp add_accumulate(const Point &to_add)
Write point addition op to queue and natively perform addition.
void merge(MergeSettings settings=MergeSettings::PREPEND, std::optional< size_t > ultra_fixed_offset=std::nullopt)
std::vector< ECCVMOperation > & get_eccvm_ops()
UltraOp mul_accumulate(const Point &to_mul, const Fr &scalar)
Write multiply and add op to queue and natively perform operation.
UltraOp eq_and_reset()
Write equality op using internal accumulator point.
void empty_row_for_testing()
Write empty row to queue.
Structured polynomial class that represents the coefficients 'a' of a_0 + a_1 x .....
static constexpr size_t NUM_ROWS_PER_OP
typename Group::affine_element AffineElement
static constexpr affine_element affine_one
Entry point for Barretenberg command-line interface.
MergeSettings
The MergeSettings define whether an current subtable will be added at the beginning (PREPEND) or at t...
TEST(BoomerangMegaCircuitBuilder, BasicCircuit)
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
BB_INLINE constexpr field pow(const uint256_t &exponent) const noexcept
static field random_element(numeric::RNG *engine=nullptr) noexcept