Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
honk_transcript.test.cpp
Go to the documentation of this file.
15
16#include <gtest/gtest.h>
17
18using namespace bb;
19
20#ifdef STARKNET_GARAGA_FLAVORS
21using FlavorTypes = ::testing::Types<UltraFlavor,
23 UltraStarknetFlavor,
24 UltraStarknetZKFlavor,
29#else
31 ::testing::Types<UltraFlavor, UltraKeccakFlavor, UltraZKFlavor, UltraKeccakZKFlavor, MegaFlavor, MegaZKFlavor>;
32#endif
33
34template <typename Flavor> class HonkTranscriptTests : public ::testing::Test {
35 public:
37
39 using FF = Flavor::FF;
44 using IO = DefaultIO;
47
60 {
61 TranscriptManifest manifest_expected;
62
63 const size_t virtual_log_n = Flavor::USE_PADDING ? Flavor::VIRTUAL_LOG_N : log_n;
64
65 size_t MAX_PARTIAL_RELATION_LENGTH = Flavor::BATCHED_RELATION_PARTIAL_LENGTH;
66 // Size of types is number of bb::frs needed to represent the types
67 // UltraKeccak uses uint256_t for commitments and frs, so we need to handle that differently.
68 size_t data_types_per_Frs = [] {
69 if constexpr (IsKeccakFlavor<Flavor>) {
70 return U256Codec::calc_num_fields<FF>();
71 } else {
72 return FrCodec::calc_num_fields<FF>();
73 }
74 }();
75 size_t data_types_per_G = [] {
76 if constexpr (IsKeccakFlavor<Flavor>) {
77 return U256Codec::calc_num_fields<Commitment>();
78 } else {
79 return FrCodec::calc_num_fields<Commitment>();
80 }
81 }();
82 size_t frs_per_uni = MAX_PARTIAL_RELATION_LENGTH * data_types_per_Frs;
83 size_t frs_per_evals = (Flavor::NUM_ALL_ENTITIES)*data_types_per_Frs;
84
85 size_t round = 0;
86 manifest_expected.add_entry(round, "vk_hash", data_types_per_Frs);
87
88 manifest_expected.add_entry(round, "public_input_0", data_types_per_Frs);
89 constexpr size_t PUBLIC_INPUTS_SIZE = IO::PUBLIC_INPUTS_SIZE;
90 for (size_t i = 0; i < PUBLIC_INPUTS_SIZE; i++) {
91 manifest_expected.add_entry(round, "public_input_" + std::to_string(1 + i), data_types_per_Frs);
92 }
93
94 // For ZK flavors: Gemini masking polynomial commitment is sent at end of oink
95 if constexpr (Flavor::HasZK) {
96 manifest_expected.add_entry(round, "Gemini:masking_poly_comm", data_types_per_G);
97 }
98 manifest_expected.add_entry(round, "W_L", data_types_per_G);
99 manifest_expected.add_entry(round, "W_R", data_types_per_G);
100 manifest_expected.add_entry(round, "W_O", data_types_per_G);
101
102 // Mega-specific witness commitments: ECC op wires and databus polynomials
103 if constexpr (IsMegaFlavor<Flavor>) {
104 manifest_expected.add_entry(round, "ECC_OP_WIRE_1", data_types_per_G);
105 manifest_expected.add_entry(round, "ECC_OP_WIRE_2", data_types_per_G);
106 manifest_expected.add_entry(round, "ECC_OP_WIRE_3", data_types_per_G);
107 manifest_expected.add_entry(round, "ECC_OP_WIRE_4", data_types_per_G);
108 manifest_expected.add_entry(round, "CALLDATA", data_types_per_G);
109 manifest_expected.add_entry(round, "CALLDATA_READ_COUNTS", data_types_per_G);
110 manifest_expected.add_entry(round, "CALLDATA_READ_TAGS", data_types_per_G);
111 manifest_expected.add_entry(round, "SECONDARY_CALLDATA", data_types_per_G);
112 manifest_expected.add_entry(round, "SECONDARY_CALLDATA_READ_COUNTS", data_types_per_G);
113 manifest_expected.add_entry(round, "SECONDARY_CALLDATA_READ_TAGS", data_types_per_G);
114 manifest_expected.add_entry(round, "RETURN_DATA", data_types_per_G);
115 manifest_expected.add_entry(round, "RETURN_DATA_READ_COUNTS", data_types_per_G);
116 manifest_expected.add_entry(round, "RETURN_DATA_READ_TAGS", data_types_per_G);
117 }
118
119 manifest_expected.add_challenge(round, "eta");
120
121 round++;
122 manifest_expected.add_entry(round, "LOOKUP_READ_COUNTS", data_types_per_G);
123 manifest_expected.add_entry(round, "LOOKUP_READ_TAGS", data_types_per_G);
124 manifest_expected.add_entry(round, "W_4", data_types_per_G);
125 manifest_expected.add_challenge(round, std::array{ "beta", "gamma" });
126
127 round++;
128 manifest_expected.add_entry(round, "LOOKUP_INVERSES", data_types_per_G);
129 // Mega-specific databus inverse commitments
130 if constexpr (IsMegaFlavor<Flavor>) {
131 manifest_expected.add_entry(round, "CALLDATA_INVERSES", data_types_per_G);
132 manifest_expected.add_entry(round, "SECONDARY_CALLDATA_INVERSES", data_types_per_G);
133 manifest_expected.add_entry(round, "RETURN_DATA_INVERSES", data_types_per_G);
134 }
135 manifest_expected.add_entry(round, "Z_PERM", data_types_per_G);
136
137 manifest_expected.add_challenge(round, "alpha");
138 manifest_expected.add_challenge(round, "Sumcheck:gate_challenge");
139 round++;
140
141 if constexpr (Flavor::HasZK) {
142 manifest_expected.add_entry(round, "Libra:concatenation_commitment", data_types_per_G);
143 manifest_expected.add_entry(round, "Libra:Sum", data_types_per_Frs);
144 manifest_expected.add_challenge(round, "Libra:Challenge");
145 round++;
146 }
147
148 for (size_t i = 0; i < virtual_log_n; ++i) {
149 std::string idx = std::to_string(i);
150 manifest_expected.add_entry(round, "Sumcheck:univariate_" + idx, frs_per_uni);
151 std::string label = "Sumcheck:u_" + idx;
152 manifest_expected.add_challenge(round, label);
153 round++;
154 }
155
156 manifest_expected.add_entry(round, "Sumcheck:evaluations", frs_per_evals);
157
158 if constexpr (Flavor::HasZK) {
159 manifest_expected.add_entry(round, "Libra:claimed_evaluation", data_types_per_Frs);
160 manifest_expected.add_entry(round, "Libra:grand_sum_commitment", data_types_per_G);
161 manifest_expected.add_entry(round, "Libra:quotient_commitment", data_types_per_G);
162 }
163
164 manifest_expected.add_challenge(round, "rho");
165
166 round++;
167 for (size_t i = 1; i < virtual_log_n; ++i) {
168 std::string idx = std::to_string(i);
169 manifest_expected.add_entry(round, "Gemini:FOLD_" + idx, data_types_per_G);
170 }
171 manifest_expected.add_challenge(round, "Gemini:r");
172 round++;
173 for (size_t i = 1; i <= virtual_log_n; ++i) {
174 std::string idx = std::to_string(i);
175 manifest_expected.add_entry(round, "Gemini:a_" + idx, data_types_per_Frs);
176 }
177
178 if constexpr (Flavor::HasZK) {
179 manifest_expected.add_entry(round, "Libra:concatenation_eval", data_types_per_Frs);
180 manifest_expected.add_entry(round, "Libra:shifted_grand_sum_eval", data_types_per_Frs);
181 manifest_expected.add_entry(round, "Libra:grand_sum_eval", data_types_per_Frs);
182 manifest_expected.add_entry(round, "Libra:quotient_eval", data_types_per_Frs);
183 }
184
185 manifest_expected.add_challenge(round, "Shplonk:nu");
186 round++;
187 manifest_expected.add_entry(round, "Shplonk:Q", data_types_per_G);
188 manifest_expected.add_challenge(round, "Shplonk:z");
189
190 round++;
191 manifest_expected.add_entry(round, "KZG:W", data_types_per_G);
192
193 return manifest_expected;
194 }
195
197 {
198 FF a = 1;
199 builder.add_variable(a);
200 builder.add_public_variable(a);
202 }
203
204 Proof export_serialized_proof(Prover& prover, const size_t num_public_inputs, const size_t log_n)
205 {
206 // reset internal variables needed for exporting the proof
207 // Note: this excludes IPA proof length since export_proof appends it separately
208 size_t proof_length = ProofLength::Honk<Flavor>::LENGTH_WITHOUT_PUB_INPUTS(log_n) + num_public_inputs;
209 prover.get_transcript()->test_set_proof_parsing_state(0, proof_length);
210 return prover.export_proof();
211 }
212};
213
215
220TYPED_TEST(HonkTranscriptTests, ProverManifestConsistency)
221{
222 // Construct a simple circuit of size n = 8 (i.e. the minimum circuit size)
223 auto builder = typename TestFixture::Builder();
224 TestFixture::generate_test_circuit(builder);
225
226 // Automatically generate a transcript manifest by constructing a proof
228 auto verification_key = std::make_shared<typename TestFixture::VerificationKey>(prover_instance->get_precomputed());
229 typename TestFixture::Prover prover(prover_instance, verification_key);
230 prover.get_transcript()->enable_manifest();
231 auto proof = prover.construct_proof();
232
233 // Check that the prover generated manifest agrees with the manifest hard coded in this suite
234 auto manifest_expected = TestFixture::construct_honk_manifest(prover.log_dyadic_size());
235 auto prover_manifest = prover.get_transcript()->get_manifest();
236 // Note: a manifest can be printed using manifest.print()
237 manifest_expected.print();
238 prover_manifest.print();
239 ASSERT_GT(manifest_expected.size(), 0);
240 for (size_t round = 0; round < manifest_expected.size(); ++round) {
241 if (prover_manifest[round] != manifest_expected[round]) {
242 info("Prover manifest discrepency in round ", round);
243 info("Prover manifest:");
244 prover_manifest[round].print();
245 info("Expected manifest:");
246 manifest_expected[round].print();
247 FAIL();
248 }
249 }
250}
251
256TYPED_TEST(HonkTranscriptTests, VerifierManifestConsistency)
257{
258 // Construct a simple circuit of size n = 8 (i.e. the minimum circuit size)
259 auto builder = typename TestFixture::Builder();
260 TestFixture::generate_test_circuit(builder);
261
262 // Automatically generate a transcript manifest in the prover by constructing a proof
264 auto verification_key = std::make_shared<typename TestFixture::VerificationKey>(prover_instance->get_precomputed());
265 auto vk_and_hash = std::make_shared<typename TypeParam::VKAndHash>(verification_key);
266 typename TestFixture::Prover prover(prover_instance, verification_key);
267 prover.get_transcript()->enable_manifest();
268 auto proof = prover.construct_proof();
269
270 // Automatically generate a transcript manifest in the verifier by verifying a proof
271 auto verifier_transcript = std::make_shared<typename TypeParam::Transcript>();
272 verifier_transcript->enable_manifest();
273 typename TestFixture::Verifier verifier(vk_and_hash, verifier_transcript);
274 [[maybe_unused]] auto _ = verifier.verify_proof(proof);
275
276 // Check consistency between the manifests generated by the prover and verifier
277 auto prover_manifest = prover.get_transcript()->get_manifest();
278 auto verifier_manifest = verifier.get_transcript()->get_manifest();
279
280 // Note: a manifest can be printed using manifest.print()
281 ASSERT_GT(prover_manifest.size(), 0);
282 for (size_t round = 0; round < prover_manifest.size(); ++round) {
283 ASSERT_EQ(prover_manifest[round], verifier_manifest[round])
284 << "Prover/Verifier manifest discrepency in round " << round;
285 }
286}
287
292TYPED_TEST(HonkTranscriptTests, ChallengeGenerationTest)
293{
294 using Flavor = TypeParam;
295 using FF = Flavor::FF;
296 // initialized with random value sent to verifier
297 auto transcript = TypeParam::Transcript::test_prover_init_empty();
298 // test a bunch of challenges
299 std::vector<std::string> challenge_labels{ "a", "b", "c", "d", "e", "f" };
300 auto challenges = transcript->template get_challenges<FF>(challenge_labels);
301 // check they are not 0
302 for (size_t i = 0; i < challenges.size(); ++i) {
303 ASSERT_NE(challenges[i], 0) << "Challenge " << i << " is 0";
304 }
305 constexpr uint32_t random_val{ 17 }; // arbitrary
306 transcript->send_to_verifier("random val", random_val);
307 // test more challenges
308 challenge_labels = { "a", "b", "c" };
309 challenges = transcript->template get_challenges<FF>(challenge_labels);
310 ASSERT_NE(challenges[0], 0) << "Challenge a is 0";
311 ASSERT_NE(challenges[1], 0) << "Challenge b is 0";
312 ASSERT_NE(challenges[2], 0) << "Challenge c is 0";
313}
314
316{
317 using Flavor = TypeParam;
318 using FF = Flavor::FF;
319 using Commitment = Flavor::Commitment;
320 // Construct a simple circuit of size n = 8 (i.e. the minimum circuit size)
321 auto builder = typename TestFixture::Builder();
322 TestFixture::generate_test_circuit(builder);
323
324 // Automatically generate a transcript manifest by constructing a proof
326 auto verification_key = std::make_shared<typename TestFixture::VerificationKey>(prover_instance->get_precomputed());
327 auto vk_and_hash = std::make_shared<typename TypeParam::VKAndHash>(verification_key);
328 typename TestFixture::Prover prover(prover_instance, verification_key);
329 auto proof = prover.construct_proof();
330 typename TestFixture::Verifier verifier(vk_and_hash);
331 EXPECT_TRUE(verifier.verify_proof(proof).result);
332
333 const size_t virtual_log_n = Flavor::USE_PADDING ? Flavor::VIRTUAL_LOG_N : prover_instance->log_dyadic_size();
334
335 // Use StructuredProof test utility to deserialize/serialize proof data
336 StructuredProof<Flavor> proof_structure;
337
338 // try deserializing and serializing with no changes and check proof is still valid
339 proof_structure.deserialize(
340 prover.get_transcript()->test_get_proof_data(), verification_key->num_public_inputs, virtual_log_n);
341 proof_structure.serialize(prover.get_transcript()->test_get_proof_data(), virtual_log_n);
342
343 proof = TestFixture::export_serialized_proof(prover, prover_instance->num_public_inputs(), virtual_log_n);
344 // we have changed nothing so proof is still valid
345 typename TestFixture::Verifier verifier2(vk_and_hash);
346 EXPECT_TRUE(verifier2.verify_proof(proof).result);
347
348 Commitment one_group_val = Commitment::one();
349 FF rand_val = FF::random_element();
350 proof_structure.z_perm_comm = one_group_val * rand_val; // choose random object to modify
351 proof = TestFixture::export_serialized_proof(prover, prover_instance->num_public_inputs(), virtual_log_n);
352 // we have not serialized it back to the proof so it should still be fine
353 typename TestFixture::Verifier verifier3(vk_and_hash);
354 EXPECT_TRUE(verifier3.verify_proof(proof).result);
355
356 proof_structure.serialize(prover.get_transcript()->test_get_proof_data(), virtual_log_n);
357 proof = TestFixture::export_serialized_proof(prover, prover_instance->num_public_inputs(), virtual_log_n);
358 // the proof is now wrong after serializing it
359 typename TestFixture::Verifier verifier4(vk_and_hash);
360 EXPECT_FALSE(verifier4.verify_proof(proof).result);
361
362 proof_structure.deserialize(
363 prover.get_transcript()->test_get_proof_data(), verification_key->num_public_inputs, virtual_log_n);
364 EXPECT_EQ(static_cast<Commitment>(proof_structure.z_perm_comm), one_group_val * rand_val);
365}
typename Flavor::Transcript::Proof Proof
TranscriptManifest construct_honk_manifest(const size_t &log_n)
Construct a manifest for a Honk proof (Ultra or Mega)
void generate_test_circuit(Builder &builder)
Proof export_serialized_proof(Prover &prover, const size_t num_public_inputs, const size_t log_n)
Flavor::Commitment Commitment
Manages the data that is propagated on the public inputs of an application/function circuit.
static constexpr size_t PUBLIC_INPUTS_SIZE
static void add_default(Builder &builder)
Add default IO values to a circuit builder (for native tests)
static constexpr bool HasZK
typename Curve::ScalarField FF
static constexpr size_t NUM_ALL_ENTITIES
ECCVMCircuitBuilder CircuitBuilder
typename G1::affine_element Commitment
FixedVKAndHash_< PrecomputedEntities< Commitment >, BF, ECCVMHardcodedVKAndHash > VerificationKey
The verification key stores commitments to the precomputed polynomials used by the verifier.
static constexpr size_t BATCHED_RELATION_PARTIAL_LENGTH
static constexpr bool USE_PADDING
Simple verification key class for fixed-size circuits (ECCVM, Translator, AVM).
Definition flavor.hpp:101
Child class of MegaFlavor that runs with ZK Sumcheck.
Contains all the information required by a Honk prover to create a proof, constructed from a finalize...
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.
const std::shared_ptr< Transcript > & get_transcript() const
Proof export_proof()
Export the complete proof, including IPA proof for rollup circuits.
Child class of UltraFlavor that runs with ZK Sumcheck.
#define info(...)
Definition log.hpp:93
AluTraceBuilder builder
Definition alu.test.cpp:124
FF a
Base class templates shared across Honk flavors.
testing::Types< UltraFlavor, UltraKeccakFlavor, MegaFlavor > FlavorTypes
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
TYPED_TEST_SUITE(CommitmentKeyTest, Curves)
TYPED_TEST(CommitmentKeyTest, CommitToZeroPoly)
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Definition tuple.hpp:13
std::string to_string(bb::avm2::ValueTag tag)
static constexpr size_t LENGTH_WITHOUT_PUB_INPUTS(size_t log_n)
Test utility for deserializing/serializing proof data into typed structures.
static field random_element(numeric::RNG *engine=nullptr) noexcept