17 bool is_a_match =
true;
21 if (prover_challenge != verifier_challenge) {
22 info(
"Challenge mismatch at index ", idx);
29 info(
"Non-shifted commitment mismatch");
34 info(
"Shifted commitment mismatch");
46 info(
"Non-shifted evaluation mismatch");
52 info(
"Shifted evaluation mismatch");
CommitmentKey object over a pairing group 𝔾₁.
Commitment commit(PolynomialSpan< const Fr > polynomial, bool has_duplicates_hint=false) const
Uses the ProverSRS to create a commitment to p(X)
void increase_virtual_size(const size_t size_in)
Fr evaluate_mle(std::span< const Fr > evaluation_points, bool shift=false) const
evaluate multi-linear extension p(X_0,…,X_{n-1}) = \sum_i a_i*L_i(X_0,…,X_{n-1}) at u = (u_0,...
Entry point for Barretenberg command-line interface.
Polynomial shifted_polynomial
std::vector< FF > challenge
Polynomial non_shifted_polynomial
bool compare_with_verifier_claim(const MultilinearBatchingVerifierClaim< curve::BN254 > &verifier_claim) const
Debug helper to compare prover claim against verifier claim.
Verifier's claim for multilinear batching - contains commitments and evaluation claims.
Commitment non_shifted_commitment
Commitment shifted_commitment
std::vector< FF > challenge
FF non_shifted_evaluation