Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
eccvm_recursive_verifier.test.cpp
Go to the documentation of this file.
10
11#include <gtest/gtest.h>
12
13namespace {
15}
16namespace bb {
17class ECCVMRecursiveTests : public ::testing::Test {
18 public:
29
32
34
40
43
50 static InnerBuilder generate_circuit(numeric::RNG* engine = nullptr, const size_t num_iterations = 1)
51 {
52 using Curve = curve::BN254;
53 using G1 = Curve::Element;
54 using Fr = Curve::ScalarField;
56
58 G1 a = G1::random_element(engine);
59 G1 b = G1::random_element(engine);
60 G1 c = G1::random_element(engine);
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);
78 op_queue->merge();
79 }
80 // Set hiding op for ECCVM ZK (required before ECCVMCircuitBuilder construction)
81 op_queue->append_hiding_op(Fq::random_element(engine), Fq::random_element(engine));
82 InnerBuilder builder{ op_queue };
83 return builder;
84 }
85
87 {
89 std::shared_ptr<Transcript> prover_transcript = std::make_shared<Transcript>();
90 InnerProver prover(builder, prover_transcript);
91 auto [proof, opening_claim] = prover.construct_proof();
92
93 // Compute IPA proof
94 auto ipa_transcript = std::make_shared<Transcript>();
95 PCS::compute_opening_proof(prover.key->commitment_key, opening_claim, ipa_transcript);
96 HonkProof ipa_proof = ipa_transcript->export_proof();
97
98 auto verification_key = std::make_shared<InnerFlavor::VerificationKey>();
99
100 info("ECCVM Recursive Verifier");
101 OuterBuilder outer_circuit;
102 auto stdlib_proof = stdlib::Proof<OuterBuilder>(outer_circuit, proof);
104 RecursiveVerifier verifier{ stdlib_verifier_transcript, stdlib_proof };
105 verifier.get_transcript()->enable_manifest();
106 [[maybe_unused]] auto recursive_result = verifier.reduce_to_ipa_opening();
108
109 info("Recursive Verifier: num gates = ", outer_circuit.get_num_finalized_gates_inefficient());
110
111 // Check for a failure flag in the recursive verifier circuit
112 EXPECT_EQ(outer_circuit.failed(), false) << outer_circuit.err();
113
114 bool result = CircuitChecker::check(outer_circuit);
115 EXPECT_TRUE(result);
116
117 std::shared_ptr<Transcript> verifier_transcript = std::make_shared<Transcript>();
118 InnerVerifier native_verifier(verifier_transcript, proof);
119 verifier_transcript->enable_manifest();
120 auto native_result = native_verifier.reduce_to_ipa_opening();
121
122 // Verify IPA
123 auto ipa_verify_transcript = std::make_shared<Transcript>();
124 ipa_verify_transcript->load_proof(ipa_proof);
126 bool ipa_verified = IPA<curve::Grumpkin>::reduce_verify(ipa_vk, native_result.ipa_claim, ipa_verify_transcript);
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();
130
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;
135 }
136
137 // Ensure verification key commitments are the same
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);
141 }
142
143 // Construct a full proof from the recursive verifier circuit
144 {
145 auto prover_instance = std::make_shared<OuterProverInstance>(outer_circuit);
146 auto verification_key = std::make_shared<OuterFlavor::VerificationKey>(prover_instance->get_precomputed());
147 auto vk_and_hash = std::make_shared<OuterFlavor::VKAndHash>(verification_key);
148 OuterProver prover(prover_instance, verification_key);
149 OuterVerifier verifier(vk_and_hash);
150 auto proof = prover.construct_proof();
151 bool verified = verifier.verify_proof(proof).result;
152
153 ASSERT_TRUE(verified);
154 }
155
156 // Check that the size of the recursive verifier is consistent with historical expectation
158 << "Ultra-arithmetized ECCVM Recursive verifier gate count changed! Update this value if you are sure this "
159 "is expected.";
160 }
161
163 {
165 builder.op_queue->add_erroneous_equality_op_for_testing();
166 builder.op_queue->merge();
167 std::shared_ptr<Transcript> prover_transcript = std::make_shared<Transcript>();
168 InnerProver prover(builder, prover_transcript);
169 auto [proof, opening_claim] = prover.construct_proof();
170
171 // Compute IPA proof
172 auto ipa_transcript = std::make_shared<Transcript>();
173 PCS::compute_opening_proof(prover.key->commitment_key, opening_claim, ipa_transcript);
174 HonkProof ipa_proof = ipa_transcript->export_proof();
175
176 auto verification_key = std::make_shared<InnerFlavor::VerificationKey>();
177
178 OuterBuilder outer_circuit;
179 auto stdlib_proof = stdlib::Proof<OuterBuilder>(outer_circuit, proof);
180
182 RecursiveVerifier verifier{ stdlib_verifier_transcript, stdlib_proof };
183 [[maybe_unused]] auto output = verifier.reduce_to_ipa_opening();
185 info("Recursive Verifier: estimated num finalized gates = ",
187
188 // Check for a failure flag in the recursive verifier circuit
189 EXPECT_FALSE(CircuitChecker::check(outer_circuit));
190 }
191
193 {
194 for (size_t idx = 0; idx < 2; idx++) {
196 std::shared_ptr<Transcript> prover_transcript = std::make_shared<Transcript>();
197 InnerProver prover(builder, prover_transcript);
198 auto [proof, opening_claim] = prover.construct_proof();
199
200 // Compute IPA proof
201 auto ipa_transcript_prover = std::make_shared<Transcript>();
202 PCS::compute_opening_proof(prover.key->commitment_key, opening_claim, ipa_transcript_prover);
203 HonkProof ipa_proof_native = ipa_transcript_prover->export_proof();
204
205 // Tamper with the proof to be verified
206 tamper_with_proof<InnerProver, InnerFlavor>(proof, static_cast<bool>(idx));
207
208 OuterBuilder outer_circuit;
209 auto stdlib_proof = stdlib::Proof<OuterBuilder>(outer_circuit, proof);
211 RecursiveVerifier verifier{ stdlib_verifier_transcript, stdlib_proof };
212 auto recursive_result = verifier.reduce_to_ipa_opening();
214
215 if (idx == 0) {
216 // In this case, we changed the first non-zero value in the proof. It leads to a circuit check failure.
217 EXPECT_FALSE(CircuitChecker::check(outer_circuit));
218 } else {
219 // Changing the last commitment in the `proof_data` would not result in a circuit check failure at
220 // this stage.
221 EXPECT_TRUE(CircuitChecker::check(outer_circuit));
222
223 // However, IPA recursive verifier must fail, as one of the commitments is incorrect.
224 VerifierCommitmentKey<InnerFlavor::Curve> native_pcs_vk(1UL << CONST_ECCVM_LOG_N);
226 &outer_circuit, 1UL << CONST_ECCVM_LOG_N, native_pcs_vk);
227
228 // Construct ipa_transcript from proof
229 auto stdlib_ipa_proof = stdlib::Proof<OuterBuilder>(outer_circuit, ipa_proof_native);
232 stdlib_pcs_vkey, recursive_result.ipa_claim, ipa_transcript));
233 }
234 }
235 }
236
238 {
239
240 // Retrieves the trace blocks (each consisting of a specific gate) from the recursive verifier circuit
241 auto get_blocks = [](size_t inner_size)
243 auto inner_circuit = generate_circuit(&engine, inner_size);
244 std::shared_ptr<Transcript> prover_transcript = std::make_shared<Transcript>();
245 InnerProver inner_prover(inner_circuit, prover_transcript);
246
247 auto [proof, opening_claim] = inner_prover.construct_proof();
248
249 // Compute IPA proof
250 auto ipa_transcript = std::make_shared<Transcript>();
251 PCS::compute_opening_proof(inner_prover.key->commitment_key, opening_claim, ipa_transcript);
252 HonkProof ipa_proof = ipa_transcript->export_proof();
253
254 // Create a recursive verification circuit for the proof of the inner circuit
255 OuterBuilder outer_circuit;
256 auto stdlib_proof = stdlib::Proof<OuterBuilder>(outer_circuit, proof);
257
259 RecursiveVerifier verifier{ stdlib_verifier_transcript, stdlib_proof };
260
261 [[maybe_unused]] auto recursive_opening_claim = verifier.reduce_to_ipa_opening();
263
264 auto outer_proving_key = std::make_shared<OuterProverInstance>(outer_circuit);
265 auto outer_verification_key =
266 std::make_shared<OuterFlavor::VerificationKey>(outer_proving_key->get_precomputed());
267
268 return { outer_circuit.blocks, outer_verification_key };
269 };
270
271 auto [blocks_20, verification_key_20] = get_blocks(20);
272 auto [blocks_40, verification_key_40] = get_blocks(40);
273
274 compare_ultra_blocks_and_verification_keys<OuterFlavor>({ blocks_20, blocks_40 },
275 { verification_key_20, verification_key_40 });
276 };
277};
278
283
284TEST_F(ECCVMRecursiveTests, SingleRecursiveVerificationFailure)
285{
287};
288
289TEST_F(ECCVMRecursiveTests, SingleRecursiveVerificationFailureTamperedProof)
290{
291 BB_DISABLE_ASSERTS(); // Avoid on_curve assertion failure in cycle_group constructor
293};
294
299} // namespace bb
#define BB_DISABLE_ASSERTS()
Definition assert.hpp:33
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
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.
static void test_recursive_verification_failure_tampered_proof()
std::conditional_t< IsMegaBuilder< OuterBuilder >, MegaFlavor, UltraFlavor > OuterFlavor
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).
Definition flavor.hpp:136
IPA (inner product argument) commitment scheme class.
Definition ipa.hpp:92
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.
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
Definition grumpkin.hpp:62
A simple wrapper around a vector of stdlib field elements representing a proof.
Definition proof.hpp:19
static void add_default(Builder &builder)
Add default public inputs when they are not present.
#define info(...)
Definition log.hpp:93
AluTraceBuilder builder
Definition alu.test.cpp:124
FF a
FF b
numeric::RNG & engine
constexpr size_t ECCVM_RECURSIVE_VERIFIER_GATE_COUNT
RNG & get_debug_randomness(bool reset, std::uint_fast64_t seed)
Definition engine.cpp:190
std::filesystem::path bb_crs_path()
void init_file_crs_factory(const std::filesystem::path &path)
Entry point for Barretenberg command-line interface.
Definition api.hpp:5
std::vector< fr > HonkProof
Definition proof.hpp:15
ECCVMVerifier_< ECCVMRecursiveFlavor > ECCVMRecursiveVerifier
TEST_F(IPATest, ChallengesAreZero)
Definition ipa.test.cpp:142
ECCVMVerifier_< ECCVMFlavor > ECCVMVerifier
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Definition tuple.hpp:13
Curve::AffineElement G1
static field random_element(numeric::RNG *engine=nullptr) noexcept