|
barretenberg
|
The accumulation input structure contains all the necessary values to initalize an accumulation gate as well as additional values for checking its correctness. More...
#include <goblin_translator_circuit_builder.hpp>
Public Attributes | |
| Fr | op_code |
| Fr | P_x_lo |
| Fr | P_x_hi |
| std::array< Fr, NUM_BINARY_LIMBS > | P_x_limbs |
| std::array< std::array< Fr, NUM_MICRO_LIMBS >, NUM_BINARY_LIMBS > | P_x_microlimbs |
| Fr | P_y_lo |
| Fr | P_y_hi |
| std::array< Fr, NUM_BINARY_LIMBS > | P_y_limbs |
| std::array< std::array< Fr, NUM_MICRO_LIMBS >, NUM_BINARY_LIMBS > | P_y_microlimbs |
| Fr | z_1 |
| std::array< Fr, NUM_Z_LIMBS > | z_1_limbs |
| std::array< std::array< Fr, NUM_MICRO_LIMBS >, NUM_Z_LIMBS > | z_1_microlimbs |
| Fr | z_2 |
| std::array< Fr, NUM_Z_LIMBS > | z_2_limbs |
| std::array< std::array< Fr, NUM_MICRO_LIMBS >, NUM_Z_LIMBS > | z_2_microlimbs |
| std::array< Fr, NUM_BINARY_LIMBS > | previous_accumulator |
| std::array< Fr, NUM_BINARY_LIMBS > | current_accumulator |
| std::array< std::array< Fr, NUM_MICRO_LIMBS >, NUM_BINARY_LIMBS > | current_accumulator_microlimbs |
| std::array< Fr, NUM_BINARY_LIMBS > | quotient_binary_limbs |
| std::array< std::array< Fr, NUM_MICRO_LIMBS >, NUM_BINARY_LIMBS > | quotient_microlimbs |
| std::array< Fr, NUM_RELATION_WIDE_LIMBS > | relation_wide_limbs |
| std::array< std::array< Fr, NUM_MICRO_LIMBS >, 2 > | relation_wide_microlimbs |
| std::array< Fr, NUM_BINARY_LIMBS > | x_limbs |
| std::array< Fr, NUM_BINARY_LIMBS > | v_limbs |
| std::array< Fr, NUM_BINARY_LIMBS > | v_squared_limbs = { 0 } |
| std::array< Fr, NUM_BINARY_LIMBS > | v_cubed_limbs = { 0 } |
| std::array< Fr, NUM_BINARY_LIMBS > | v_quarted_limbs = { 0 } |
The accumulation input structure contains all the necessary values to initalize an accumulation gate as well as additional values for checking its correctness.
For example, we don't really nead the prime limbs, but they serve to check the correctness of over values. We also don't need the values of x's and v's limbs during circuit construction, since they are added to relations directly, but this allows us to check correctness of the computed accumulator