159 if (round_idx == 1) {
162 if (round_idx >= 2) {
175 FF evaluation_at_multivariate_challenge{ 1 };
177 for (
size_t idx = 2; idx < log_circuit_size; idx++) {
178 evaluation_at_multivariate_challenge *= multivariate_challenge[idx];
181 return FF{ 1 } - evaluation_at_multivariate_challenge;
191 const std::vector<FF>& padding_indicator_array)
193 FF evaluation_at_multivariate_challenge{ 1 };
195 for (
size_t idx = 2; idx < padding_indicator_array.size(); idx++) {
196 const FF& indicator = padding_indicator_array[idx];
197 evaluation_at_multivariate_challenge *=
FF{ 1 } - indicator + indicator * multivariate_challenge[idx];
200 return FF{ 1 } - evaluation_at_multivariate_challenge;
Entry point for Barretenberg command-line interface.
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Polynomial for Sumcheck with disabled Rows.
RowDisablingPolynomial()=default
static FF evaluate_at_challenge(std::vector< FF > multivariate_challenge, const size_t log_circuit_size)
Compute the evaluation of at the sumcheck challenge.
void update_evaluations(FF round_challenge, size_t round_idx)
Compute the evaluations of L^{(i)} at 0 and 1.
static FF evaluate_at_challenge(std::span< FF > multivariate_challenge, const std::vector< FF > &padding_indicator_array)
A variant of the above that uses padding_indicator_array.