11#include <gtest/gtest.h>
63 for (
size_t idx = 0; idx < num_iterations; idx++) {
64 op_queue->add_accumulate(
a);
65 op_queue->mul_accumulate(
a, x);
66 op_queue->mul_accumulate(
b, x);
67 op_queue->mul_accumulate(
b, y);
68 op_queue->add_accumulate(
a);
69 op_queue->mul_accumulate(
b, x);
70 op_queue->eq_and_reset();
71 op_queue->add_accumulate(c);
72 op_queue->mul_accumulate(
a, x);
73 op_queue->mul_accumulate(
b, x);
74 op_queue->eq_and_reset();
75 op_queue->mul_accumulate(
a, x);
76 op_queue->mul_accumulate(
b, x);
77 op_queue->mul_accumulate(c, x);
95 PCS::compute_opening_proof(prover.
key->commitment_key, opening_claim, ipa_transcript);
96 HonkProof ipa_proof = ipa_transcript->export_proof();
100 info(
"ECCVM Recursive Verifier");
106 [[maybe_unused]]
auto recursive_result = verifier.reduce_to_ipa_opening();
112 EXPECT_EQ(outer_circuit.
failed(),
false) << outer_circuit.
err();
119 verifier_transcript->enable_manifest();
124 ipa_verify_transcript->load_proof(ipa_proof);
127 EXPECT_TRUE(ipa_verified && native_result.reduction_succeeded);
128 auto recursive_manifest = verifier.get_transcript()->get_manifest();
129 auto native_manifest = native_verifier.
get_transcript()->get_manifest();
131 ASSERT_GT(recursive_manifest.size(), 0);
132 for (
size_t i = 0; i < recursive_manifest.size(); ++i) {
133 EXPECT_EQ(recursive_manifest[i], native_manifest[i])
134 <<
"Recursive Verifier/Verifier manifest discrepency in round " << i;
138 for (
auto [vk_poly, native_vk_poly] :
139 zip_view(verifier.get_verification_key()->get_all(), verification_key->get_all())) {
140 EXPECT_EQ(vk_poly.get_value(), native_vk_poly);
148 OuterProver prover(prover_instance, verification_key);
153 ASSERT_TRUE(verified);
158 <<
"Ultra-arithmetized ECCVM Recursive verifier gate count changed! Update this value if you are sure this "
165 builder.op_queue->add_erroneous_equality_op_for_testing();
173 PCS::compute_opening_proof(prover.
key->commitment_key, opening_claim, ipa_transcript);
174 HonkProof ipa_proof = ipa_transcript->export_proof();
185 info(
"Recursive Verifier: estimated num finalized gates = ",
194 for (
size_t idx = 0; idx < 2; idx++) {
202 PCS::compute_opening_proof(prover.
key->commitment_key, opening_claim, ipa_transcript_prover);
203 HonkProof ipa_proof_native = ipa_transcript_prover->export_proof();
206 tamper_with_proof<InnerProver, InnerFlavor>(proof,
static_cast<bool>(idx));
226 &outer_circuit, 1UL << CONST_ECCVM_LOG_N, native_pcs_vk);
232 stdlib_pcs_vkey, recursive_result.ipa_claim, ipa_transcript));
241 auto get_blocks = [](
size_t inner_size)
245 InnerProver inner_prover(inner_circuit, prover_transcript);
251 PCS::compute_opening_proof(inner_prover.
key->commitment_key, opening_claim, ipa_transcript);
252 HonkProof ipa_proof = ipa_transcript->export_proof();
265 auto outer_verification_key =
268 return { outer_circuit.
blocks, outer_verification_key };
271 auto [blocks_20, verification_key_20] = get_blocks(20);
272 auto [blocks_40, verification_key_40] = get_blocks(40);
274 compare_ultra_blocks_and_verification_keys<OuterFlavor>({ blocks_20, blocks_40 },
275 { verification_key_20, verification_key_40 });
#define BB_DISABLE_ASSERTS()
Common transcript class for both parties. Stores the data for the current round, as well as the manif...
const std::string & err() const
The proving key is responsible for storing the polynomials used by the prover.
static constexpr size_t ECCVM_FIXED_SIZE
typename Curve::ScalarField FF
ECCVMCircuitBuilder CircuitBuilder
typename G1::affine_element Commitment
typename Curve::BaseField BF
FixedVKAndHash_< PrecomputedEntities< Commitment >, BF, ECCVMHardcodedVKAndHash > VerificationKey
The verification key stores commitments to the precomputed polynomials used by the verifier.
BaseTranscript< Codec, HashFunction > Transcript
std::pair< Proof, OpeningClaim > construct_proof()
std::shared_ptr< ProvingKey > key
StdlibTranscript< CircuitBuilder > Transcript
UltraCircuitBuilder CircuitBuilder
static void test_recursive_verification()
static void test_recursive_verification_failure()
static InnerBuilder generate_circuit(numeric::RNG *engine=nullptr, const size_t num_iterations=1)
Adds operations in BN254 to the op_queue and then constructs and ECCVM circuit from the op_queue.
InnerFlavor::Commitment InnerG1
static void test_recursive_verification_failure_tampered_proof()
static void SetUpTestSuite()
std::conditional_t< IsMegaBuilder< OuterBuilder >, MegaFlavor, UltraFlavor > OuterFlavor
static void test_independent_vk_hash()
Unified ECCVM verifier class for both native and recursive verification.
std::shared_ptr< Transcript > get_transcript() const
ReductionResult reduce_to_ipa_opening()
Reduce the ECCVM proof to an IPA opening claim.
Simple verification key class for fixed-size circuits (ECCVM, Translator).
IPA (inner product argument) commitment scheme class.
A ProverInstance is normally constructed from a finalized circuit and it contains all the information...
static bool check(const Builder &circuit)
Check the witness satisifies the circuit.
size_t get_num_finalized_gates() const override
Get the number of gates in a finalized circuit.
ExecutionTrace_ ExecutionTrace
size_t get_num_finalized_gates_inefficient(bool ensure_nonzero=true) const
Get the number of gates in the finalized version of the circuit.
Output verify_proof(const Proof &proof)
Perform ultra verification.
Representation of the Grumpkin Verifier Commitment Key inside a bn254 circuit.
typename Group::element Element
A simple wrapper around a vector of stdlib field elements representing a proof.
static void add_default(Builder &builder)
Add default public inputs when they are not present.
RNG & get_debug_randomness(bool reset, std::uint_fast64_t seed)
std::filesystem::path bb_crs_path()
void init_file_crs_factory(const std::filesystem::path &path)
Entry point for Barretenberg command-line interface.
std::vector< fr > HonkProof
ECCVMVerifier_< ECCVMRecursiveFlavor > ECCVMRecursiveVerifier
TEST_F(IPATest, ChallengesAreZero)
ECCVMVerifier_< ECCVMFlavor > ECCVMVerifier
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
static field random_element(numeric::RNG *engine=nullptr) noexcept