row_disabling_polynomial.hpp

Go to the documentation of this file.

// === AUDIT STATUS ===
// internal:    { status: Complete, auditors: [Khashayar], commit: }
// external_1:  { status: not started, auditors: [], commit: }
// external_2:  { status: not started, auditors: [], commit: }
// =====================
 
#pragma once
#include "barretenberg/common/assert.hpp"
#include "barretenberg/common/bb_bench.hpp"
#include "barretenberg/common/compiler_hints.hpp"
#include "barretenberg/common/thread.hpp"
#include "barretenberg/stdlib/primitives/bool/bool.hpp"
 
#include <cstddef>
#include <vector>
namespace bb {
template <typename FF> struct RowDisablingPolynomial {
    // initialized as a constant linear polynomial = 1
    FF eval_at_0{ 1 };
    FF eval_at_1{ 1 };
 
    RowDisablingPolynomial() = default;
    void update_evaluations(FF round_challenge, size_t round_idx)
    {
        if (round_idx == 1) {
            eval_at_1 = FF{ 0 };
        }
        if (round_idx >= 2) {
            eval_at_0 *= (FF{ 1 } - round_challenge);
        }
    }
    static FF evaluate_at_challenge(std::span<const FF> multivariate_challenge, const size_t log_circuit_size)
    {
        BB_ASSERT(multivariate_challenge.size() >= log_circuit_size,
                  "RowDisablingPolynomial: challenge shorter than log_circuit_size");
        FF evaluation_at_multivariate_challenge{ 1 };
 
        for (size_t idx = 2; idx < log_circuit_size; idx++) {
            evaluation_at_multivariate_challenge *= (FF{ 1 } - multivariate_challenge[idx]);
        }
 
        return FF{ 1 } - evaluation_at_multivariate_challenge;
    }
};
 
} // namespace bb