small_subgroup_ipa.hpp File Reference

#include "barretenberg/commitment_schemes/utils/test_settings.hpp"
#include "barretenberg/constants.hpp"
#include "barretenberg/ecc/curves/bn254/bn254.hpp"
#include "barretenberg/eccvm/eccvm_translation_data.hpp"
#include "barretenberg/polynomials/polynomial.hpp"
#include "barretenberg/polynomials/univariate.hpp"
#include "barretenberg/stdlib/primitives/curves/grumpkin.hpp"
#include "barretenberg/sumcheck/zk_sumcheck_data.hpp"
#include "small_subgroup_ipa_utils.hpp"
#include <array>
#include <vector>

Go to the source code of this file.

Classes
class	bb::SmallSubgroupIPAProver< Flavor >
	A Curve-agnostic ZK protocol to prove inner products of small vectors. More...
class	bb::SmallSubgroupIPAVerifier< Curve >
	Verifies the consistency of polynomial evaluations provided by the the prover. More...

Namespaces
namespace	bb
	Entry point for Barretenberg command-line interface.

Functions
template<typename Curve >
std::vector< typename Curve::ScalarField >	bb::compute_eccvm_challenge_coeffs (const typename Curve::ScalarField &evaluation_challenge_x, const typename Curve::ScalarField &batching_challenge_v, size_t num_polys, size_t num_coeffs_per_poly)
	Given num_polys polynomials each contributing num_coeffs_per_poly masking coefficients, an evaluation challenge \( x \) and a batching challenge \( v \), compute the challenge polynomial whose coefficients (in the Lagrange basis over the Small Subgroup) are \( (1, x, \ldots, x^{M-1},\; v, vx, \ldots, vx^{M-1},\; \ldots,\; v^{N-1}x^{M-1},\; 0, \ldots, 0) \) where \( M = \text{num\_coeffs\_per\_poly} \) and \( N = \text{num\_polys} \).