Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
eccvm_transcript.test.cpp
Go to the documentation of this file.
12#include <gtest/gtest.h>
13
14using namespace bb;
16
17class ECCVMTranscriptTests : public ::testing::Test {
18 public:
36 {
37 TranscriptManifest manifest_expected;
38 // Size of types is number of bb::frs needed to represent the type
39 size_t frs_per_Fq = FrCodec::calc_num_fields<FF>();
40 size_t frs_per_Fr = FrCodec::calc_num_fields<Flavor::BF>();
41 size_t frs_per_G = FrCodec::calc_num_fields<typename Flavor::Commitment>();
42 size_t frs_per_evals = (Flavor::NUM_ALL_ENTITIES)*frs_per_Fq;
43
44 size_t round = 0;
45 manifest_expected.add_entry(round, "vk_hash", frs_per_Fr);
46 manifest_expected.add_entry(round, "Gemini:masking_poly_comm", frs_per_G);
47 manifest_expected.add_entry(round, "TRANSCRIPT_ADD", frs_per_G);
48 manifest_expected.add_entry(round, "TRANSCRIPT_EQ", frs_per_G);
49 manifest_expected.add_entry(round, "TRANSCRIPT_MSM_TRANSITION", frs_per_G);
50 manifest_expected.add_entry(round, "TRANSCRIPT_PX", frs_per_G);
51 manifest_expected.add_entry(round, "TRANSCRIPT_PY", frs_per_G);
52 manifest_expected.add_entry(round, "TRANSCRIPT_Z1", frs_per_G);
53 manifest_expected.add_entry(round, "TRANSCRIPT_Z2", frs_per_G);
54 manifest_expected.add_entry(round, "TRANSCRIPT_Z1ZERO", frs_per_G);
55 manifest_expected.add_entry(round, "TRANSCRIPT_Z2ZERO", frs_per_G);
56 manifest_expected.add_entry(round, "TRANSCRIPT_OP", frs_per_G);
57 manifest_expected.add_entry(round, "TRANSCRIPT_MSM_X", frs_per_G);
58 manifest_expected.add_entry(round, "TRANSCRIPT_MSM_Y", frs_per_G);
59 manifest_expected.add_entry(round, "PRECOMPUTE_POINT_TRANSITION", frs_per_G);
60 manifest_expected.add_entry(round, "PRECOMPUTE_S1LO", frs_per_G);
61 manifest_expected.add_entry(round, "PRECOMPUTE_S2HI", frs_per_G);
62 manifest_expected.add_entry(round, "PRECOMPUTE_S2LO", frs_per_G);
63 manifest_expected.add_entry(round, "PRECOMPUTE_S3HI", frs_per_G);
64 manifest_expected.add_entry(round, "PRECOMPUTE_S3LO", frs_per_G);
65 manifest_expected.add_entry(round, "PRECOMPUTE_S4HI", frs_per_G);
66 manifest_expected.add_entry(round, "PRECOMPUTE_S4LO", frs_per_G);
67 manifest_expected.add_entry(round, "PRECOMPUTE_SKEW", frs_per_G);
68 manifest_expected.add_entry(round, "MSM_SIZE_OF_MSM", frs_per_G);
69 manifest_expected.add_entry(round, "MSM_ADD2", frs_per_G);
70 manifest_expected.add_entry(round, "MSM_ADD3", frs_per_G);
71 manifest_expected.add_entry(round, "MSM_ADD4", frs_per_G);
72 manifest_expected.add_entry(round, "MSM_X1", frs_per_G);
73 manifest_expected.add_entry(round, "MSM_Y1", frs_per_G);
74 manifest_expected.add_entry(round, "MSM_X2", frs_per_G);
75 manifest_expected.add_entry(round, "MSM_Y2", frs_per_G);
76 manifest_expected.add_entry(round, "MSM_X3", frs_per_G);
77 manifest_expected.add_entry(round, "MSM_Y3", frs_per_G);
78 manifest_expected.add_entry(round, "MSM_X4", frs_per_G);
79 manifest_expected.add_entry(round, "MSM_Y4", frs_per_G);
80 manifest_expected.add_entry(round, "MSM_COLLISION_X1", frs_per_G);
81 manifest_expected.add_entry(round, "MSM_COLLISION_X2", frs_per_G);
82 manifest_expected.add_entry(round, "MSM_COLLISION_X3", frs_per_G);
83 manifest_expected.add_entry(round, "MSM_COLLISION_X4", frs_per_G);
84 manifest_expected.add_entry(round, "MSM_LAMBDA1", frs_per_G);
85 manifest_expected.add_entry(round, "MSM_LAMBDA2", frs_per_G);
86 manifest_expected.add_entry(round, "MSM_LAMBDA3", frs_per_G);
87 manifest_expected.add_entry(round, "MSM_LAMBDA4", frs_per_G);
88 manifest_expected.add_entry(round, "MSM_SLICE1", frs_per_G);
89 manifest_expected.add_entry(round, "MSM_SLICE2", frs_per_G);
90 manifest_expected.add_entry(round, "MSM_SLICE3", frs_per_G);
91 manifest_expected.add_entry(round, "MSM_SLICE4", frs_per_G);
92 manifest_expected.add_entry(round, "TRANSCRIPT_RESET_ACCUMULATOR", frs_per_G);
93 manifest_expected.add_entry(round, "LOOKUP_READ_COUNTS_0", frs_per_G);
94 manifest_expected.add_entry(round, "LOOKUP_READ_COUNTS_1", frs_per_G);
95 manifest_expected.add_entry(round, "TRANSCRIPT_BASE_INFINITY", frs_per_G);
96 manifest_expected.add_entry(round, "TRANSCRIPT_BASE_X_INVERSE", frs_per_G);
97 manifest_expected.add_entry(round, "TRANSCRIPT_BASE_Y_INVERSE", frs_per_G);
98 manifest_expected.add_entry(round, "TRANSCRIPT_ADD_X_EQUAL", frs_per_G);
99 manifest_expected.add_entry(round, "TRANSCRIPT_ADD_Y_EQUAL", frs_per_G);
100 manifest_expected.add_entry(round, "TRANSCRIPT_ADD_LAMBDA", frs_per_G);
101 manifest_expected.add_entry(round, "TRANSCRIPT_MSM_INTERMEDIATE_X", frs_per_G);
102 manifest_expected.add_entry(round, "TRANSCRIPT_MSM_INTERMEDIATE_Y", frs_per_G);
103 manifest_expected.add_entry(round, "TRANSCRIPT_MSM_INFINITY", frs_per_G);
104 manifest_expected.add_entry(round, "TRANSCRIPT_MSM_X_INVERSE", frs_per_G);
105 manifest_expected.add_entry(round, "TRANSCRIPT_MSM_COUNT_ZERO_AT_TRANSITION", frs_per_G);
106 manifest_expected.add_entry(round, "TRANSCRIPT_MSM_COUNT_AT_TRANSITION_INVERSE", frs_per_G);
107 manifest_expected.add_entry(round, "MSM_ROUND_MINUS_31_INV", frs_per_G);
108 manifest_expected.add_entry(round, "TRANSCRIPT_MUL", frs_per_G);
109 manifest_expected.add_entry(round, "TRANSCRIPT_MSM_COUNT", frs_per_G);
110 manifest_expected.add_entry(round, "PRECOMPUTE_SCALAR_SUM", frs_per_G);
111 manifest_expected.add_entry(round, "PRECOMPUTE_S1HI", frs_per_G);
112 manifest_expected.add_entry(round, "PRECOMPUTE_DX", frs_per_G);
113 manifest_expected.add_entry(round, "PRECOMPUTE_DY", frs_per_G);
114 manifest_expected.add_entry(round, "PRECOMPUTE_TX", frs_per_G);
115 manifest_expected.add_entry(round, "PRECOMPUTE_TY", frs_per_G);
116 manifest_expected.add_entry(round, "MSM_TRANSITION", frs_per_G);
117 manifest_expected.add_entry(round, "MSM_ADD", frs_per_G);
118 manifest_expected.add_entry(round, "MSM_DOUBLE", frs_per_G);
119 manifest_expected.add_entry(round, "MSM_SKEW", frs_per_G);
120 manifest_expected.add_entry(round, "MSM_ACCUMULATOR_X", frs_per_G);
121 manifest_expected.add_entry(round, "MSM_ACCUMULATOR_Y", frs_per_G);
122 manifest_expected.add_entry(round, "MSM_COUNT", frs_per_G);
123 manifest_expected.add_entry(round, "MSM_ROUND", frs_per_G);
124 manifest_expected.add_entry(round, "MSM_ADD1", frs_per_G);
125 manifest_expected.add_entry(round, "MSM_PC", frs_per_G);
126 manifest_expected.add_entry(round, "PRECOMPUTE_PC", frs_per_G);
127 manifest_expected.add_entry(round, "TRANSCRIPT_PC", frs_per_G);
128 manifest_expected.add_entry(round, "PRECOMPUTE_ROUND", frs_per_G);
129 manifest_expected.add_entry(round, "PRECOMPUTE_SELECT", frs_per_G);
130 manifest_expected.add_entry(round, "TRANSCRIPT_ACCUMULATOR_NOT_EMPTY", frs_per_G);
131 manifest_expected.add_entry(round, "TRANSCRIPT_ACCUMULATOR_X", frs_per_G);
132 manifest_expected.add_entry(round, "TRANSCRIPT_ACCUMULATOR_Y", frs_per_G);
133 manifest_expected.add_challenge(round, std::array{ "beta", "gamma" });
134
135 round++;
136 manifest_expected.add_entry(round, "LOOKUP_INVERSES", frs_per_G);
137 manifest_expected.add_entry(round, "Z_PERM", frs_per_G);
138 manifest_expected.add_challenge(round, "Sumcheck:alpha");
139
140 manifest_expected.add_challenge(round, "Sumcheck:gate_challenge");
141 round++;
142
143 manifest_expected.add_entry(round, "Libra:concatenation_commitment", frs_per_G);
144 manifest_expected.add_entry(round, "Libra:Sum", frs_per_Fq);
145 // get the challenge for the ZK Sumcheck claim
146 manifest_expected.add_challenge(round, "Libra:Challenge");
147
148 for (size_t i = 0; i < CONST_ECCVM_LOG_N; ++i) {
149 round++;
150 std::string idx = std::to_string(i);
151 manifest_expected.add_entry(round, "Sumcheck:univariate_comm_" + idx, frs_per_G);
152 manifest_expected.add_entry(round, "Sumcheck:univariate_" + idx + "_eval_0", frs_per_Fq);
153 manifest_expected.add_entry(round, "Sumcheck:univariate_" + idx + "_eval_1", frs_per_Fq);
154 std::string label = "Sumcheck:u_" + idx;
155 manifest_expected.add_challenge(round, label);
156 }
157
158 round++;
159
160 manifest_expected.add_entry(round, "Sumcheck:evaluations", frs_per_evals);
161 manifest_expected.add_entry(round, "Libra:claimed_evaluation", frs_per_Fq);
162 manifest_expected.add_entry(round, "Libra:grand_sum_commitment", frs_per_G);
163 manifest_expected.add_entry(round, "Libra:quotient_commitment", frs_per_G);
164 manifest_expected.add_challenge(round, "Libra:small_ipa_evaluation_challenge");
165
166 round++;
167 manifest_expected.add_entry(round, "Libra:concatenation_eval", frs_per_Fq);
168 manifest_expected.add_entry(round, "Libra:shifted_grand_sum_eval", frs_per_Fq);
169 manifest_expected.add_entry(round, "Libra:grand_sum_eval", frs_per_Fq);
170 manifest_expected.add_entry(round, "Libra:quotient_eval", frs_per_Fq);
171 manifest_expected.add_entry(round, "Translation:concatenated_masking_term_commitment", frs_per_G);
172 manifest_expected.add_challenge(round, "Translation:evaluation_challenge_x");
173
174 round++;
175 manifest_expected.add_entry(round, "Translation:op", frs_per_Fq);
176 manifest_expected.add_entry(round, "Translation:Px", frs_per_Fq);
177 manifest_expected.add_entry(round, "Translation:Py", frs_per_Fq);
178 manifest_expected.add_entry(round, "Translation:z1", frs_per_Fq);
179 manifest_expected.add_entry(round, "Translation:z2", frs_per_Fq);
180 manifest_expected.add_challenge(round, "Translation:batching_challenge_v");
181
182 round++;
183 manifest_expected.add_entry(round, "Translation:masking_term_eval", frs_per_Fq);
184 manifest_expected.add_entry(round, "Translation:grand_sum_commitment", frs_per_G);
185 manifest_expected.add_entry(round, "Translation:quotient_commitment", frs_per_G);
186 manifest_expected.add_challenge(round, "Translation:small_ipa_evaluation_challenge");
187
188 round++;
189 manifest_expected.add_entry(round, "Translation:concatenation_eval", frs_per_Fq);
190 manifest_expected.add_entry(round, "Translation:shifted_grand_sum_eval", frs_per_Fq);
191 manifest_expected.add_entry(round, "Translation:grand_sum_eval", frs_per_Fq);
192 manifest_expected.add_entry(round, "Translation:quotient_eval", frs_per_Fq);
193 manifest_expected.add_entry(round, "TripleIPA:pow_mask_commitment", frs_per_G);
194 manifest_expected.add_challenge(round, "TripleIPA:pow_mask_challenge");
195
196 round++;
197 manifest_expected.add_entry(round, "TripleIPA:pow_mask_evaluation", frs_per_Fq);
198 manifest_expected.add_challenge(round, "Shplonk:nu");
199
200 round++;
201 manifest_expected.add_entry(round, "Shplonk:Q", frs_per_G);
202 manifest_expected.add_challenge(round, "Shplonk:z");
203 manifest_expected.add_challenge(round, "TripleIPA:rho");
204
205 return manifest_expected;
206 }
207
209 {
211 using G1 = typename Flavor::CycleGroup;
212 using Fr = typename G1::Fr;
213
214 auto generators = G1::derive_generators("test generators", 3);
215
216 typename G1::element a = generators[0];
217 typename G1::element b = generators[1];
218 typename G1::element c = generators[2];
221
222 op_queue->add_accumulate(a);
223 op_queue->mul_accumulate(a, x);
224 op_queue->mul_accumulate(b, x);
225 op_queue->mul_accumulate(b, y);
226 op_queue->add_accumulate(a);
227 op_queue->mul_accumulate(b, x);
228 op_queue->eq_and_reset();
229 op_queue->add_accumulate(c);
230 op_queue->mul_accumulate(a, x);
231 op_queue->mul_accumulate(b, x);
232 op_queue->eq_and_reset();
233 op_queue->mul_accumulate(a, x);
234 op_queue->mul_accumulate(b, x);
235 op_queue->mul_accumulate(c, x);
236 op_queue->merge();
237 add_hiding_op_for_test(op_queue);
238
239 ECCVMCircuitBuilder builder{ op_queue };
240 return builder;
241 }
242};
243
245
250TEST_F(ECCVMTranscriptTests, ProverManifestConsistency)
251{
252 // Construct a simple circuit
253 auto builder = this->generate_trace(&engine);
254
255 // Automatically generate a transcript manifest by constructing a proof
256 std::shared_ptr<Transcript> prover_transcript = std::make_shared<Transcript>();
257 ECCVMProver prover(builder, prover_transcript);
258 prover.transcript->enable_manifest();
259 auto proof = prover.construct_proof();
260
261 // Check that the prover generated manifest agrees with the manifest hard coded in this suite
262 auto manifest_expected = this->construct_eccvm_honk_manifest();
263 auto prover_manifest = prover.transcript->get_manifest();
264
265 // Note: a manifest can be printed using manifest.print()
266 ASSERT_GT(manifest_expected.size(), 0);
267 for (size_t round = 0; round < manifest_expected.size(); ++round) {
268 ASSERT_EQ(prover_manifest[round], manifest_expected[round]) << "Prover manifest discrepency in round " << round;
269 }
270}
271
277TEST_F(ECCVMTranscriptTests, VerifierManifestConsistency)
278{
279 // Construct a simple circuit
280 auto builder = this->generate_trace(&engine);
281
282 // Automatically generate a transcript manifest in the prover by constructing a proof
283 std::shared_ptr<Transcript> prover_transcript = std::make_shared<Transcript>();
284 ECCVMProver prover(builder, prover_transcript);
285 prover_transcript->enable_manifest();
286 auto proof = prover.construct_proof();
287
288 // Automatically generate a transcript manifest in the verifier by verifying a proof
289 std::shared_ptr<Transcript> verifier_transcript = std::make_shared<Transcript>();
290 verifier_transcript->enable_manifest();
291 ECCVMVerifier verifier(verifier_transcript, proof);
292 auto verification_result = verifier.reduce_to_triple_ipa_claim();
293
294 ASSERT_TRUE(verification_result.reduction_succeeded);
295
296 // Check consistency between the manifests generated by the prover and verifier
297 auto prover_manifest = prover.transcript->get_manifest();
298 auto verifier_manifest = verifier.get_transcript()->get_manifest();
299
300 // Note: a manifest can be printed using manifest.print()
301 // The last challenge generated by the ECCVM Prover is the translation univariate batching challenge and, on the
302 // verifier side, is only generated in the translator verifier hence the ECCVM prover's manifest will have one extra
303 // challenge
304 ASSERT_GT(prover_manifest.size(), 0);
305 for (size_t round = 0; round < prover_manifest.size() - 1; ++round) {
306 ASSERT_EQ(prover_manifest[round], verifier_manifest[round])
307 << "Prover/Verifier manifest discrepency in round " << round;
308 }
309}
310
316TEST_F(ECCVMTranscriptTests, ChallengeGenerationTest)
317{
318 // initialized with random value sent to verifier
319 auto transcript = Flavor::Transcript::test_prover_init_empty();
320 // test a bunch of challenges
321 std::vector<std::string> challenge_labels{ "a", "b", "c", "d", "e", "f" };
322 auto challenges = transcript->template get_challenges<FF>(challenge_labels);
323 // check they are not 0
324 for (size_t i = 0; i < challenges.size(); ++i) {
325 ASSERT_NE(challenges[i], 0) << "Challenge " << i << " is 0";
326 }
327 constexpr uint32_t random_val{ 17 }; // arbitrary
328 transcript->send_to_verifier("random val", random_val);
329 // test more challenges
330 challenge_labels = { "a", "b", "c" };
331 challenges = transcript->template get_challenges<FF>(challenge_labels);
332
333 ASSERT_NE(challenges[0], 0) << "Challenge a is 0";
334 ASSERT_NE(challenges[1], 0) << "Challenge b is 0";
335 ASSERT_NE(challenges[2], 0) << "Challenge c is 0";
336}
ECCVMCircuitBuilder generate_trace(numeric::RNG *engine=nullptr)
TranscriptManifest construct_eccvm_honk_manifest()
Construct a manifest for a ECCVM Honk proof.
Common transcript class for both parties. Stores the data for the current round, as well as the manif...
static constexpr size_t NUM_ALL_ENTITIES
BaseTranscript< Codec, HashFunction > Transcript
std::shared_ptr< Transcript > transcript
Unified ECCVM verifier class for both native and recursive verification.
ReductionResult reduce_to_triple_ipa_claim()
Reduce the ECCVM proof to a compact TripleIPA verifier claim.
std::shared_ptr< Transcript > get_transcript() const
IPA (inner product argument) commitment scheme class.
Definition ipa.hpp:87
void add_entry(size_t round, const std::string &element_label, size_t element_size)
void add_challenge(size_t round, const std::string &label)
Add a single challenge label to the manifest for the given round.
AluTraceBuilder builder
Definition alu.test.cpp:124
FF a
FF b
std::string label
numeric::RNG & engine
Base class templates shared across Honk flavors.
void add_hiding_op_for_test(const std::shared_ptr< ECCOpQueue > &op_queue)
Set a hiding op on the op_queue for testing.
RNG & get_debug_randomness(bool reset, std::uint_fast64_t seed)
Definition engine.cpp:245
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
TEST_F(IPATest, ChallengesAreZero)
Definition ipa.test.cpp:160
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Definition tuple.hpp:13
std::string to_string(bb::avm2::ValueTag tag)
Curve::AffineElement G1
static field random_element(numeric::RNG *engine=nullptr) noexcept