32 circuit.add_ultra_and_mega_gates_to_ensure_all_polys_are_non_zero();
43 auto alpha = prover_instance->alpha;
44 auto gate_challenges = prover_instance->gate_challenges;
45 auto w4 = prover_instance->polynomials.w_4;
46 auto lookup_read_counts = prover_instance->polynomials.lookup_read_counts;
47 auto lookup_read_tag = prover_instance->polynomials.lookup_read_tags;
48 auto lookup_inverse = prover_instance->polynomials.lookup_inverses;
49 auto z_perm = prover_instance->polynomials.z_perm;
50 auto databus_inverses = prover_instance->polynomials.get_databus_inverses().get_copy();
61 for (
auto [new_challenge, old_challenge] :
zip_view(prover_instance->gate_challenges, gate_challenges)) {
65 BB_ASSERT_EQ(prover_instance->polynomials.lookup_read_counts, lookup_read_counts);
66 BB_ASSERT_EQ(prover_instance->polynomials.lookup_read_tags, lookup_read_tag);
67 BB_ASSERT_EQ(prover_instance->polynomials.lookup_inverses, lookup_inverse);
68 BB_ASSERT_EQ(prover_instance->polynomials.z_perm, z_perm);
69 for (
auto [new_databus, old_databus] :
70 zip_view(prover_instance->polynomials.get_databus_inverses().get_copy(), databus_inverses)) {
78 circuit.add_ultra_and_mega_gates_to_ensure_all_polys_are_non_zero();
91 transcript->load_proof(proof);
92 OinkVerifier verifier(verifier_instance, transcript, verification_key->num_public_inputs);
96 verifier_instance->witness_commitments);
98 for (
auto [prover_comm, verifier_comm, label] :
zip_view(
99 prover_commitments.get_all(), verifier_commitments.get_all(), Flavor::VerifierCommitments::get_labels())) {
100 EXPECT_EQ(prover_comm, verifier_comm) <<
"Mismatch in commitments " << label;
NativeVerificationKey_< PrecomputedEntities< Commitment >, Codec, HashFunction, CommitmentKey > VerificationKey
The verification key stores commitments to the precomputed (non-witness) polynomials used by the veri...