Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
avm2_recursion_constraint.test.cpp
Go to the documentation of this file.
2#ifndef DISABLE_AZTEC_VM
3
19
20#include <gtest/gtest.h>
21#include <memory>
22#include <vector>
23
24using namespace acir_format;
25using namespace bb;
26using namespace bb::avm2;
27
30 std::shared_ptr<AvmFlavor::VerificationKey> verification_key;
31 std::vector<FF> public_inputs_flat;
32};
33
34class AcirAvm2RecursionConstraint : public ::testing::Test {
35 public:
38
43
46
48
50 {
51 auto [trace, public_inputs] = avm2::testing::get_minimal_trace_with_pi();
52
53 InnerProver prover;
54 auto [proof, vk_data] = prover.prove(std::move(trace));
55 const auto verification_key = InnerProver::create_verification_key(vk_data);
56
57 const bool verified = prover.verify(proof, public_inputs, vk_data);
58 EXPECT_TRUE(verified) << "native proof verification failed";
59
60 const auto public_inputs_flat = PublicInputs::columns_to_flat(public_inputs.to_columns());
61
62 // TODO(#14234)[Unconditional PIs validation]: Remove next line
63 proof.insert(proof.begin(), 0);
64 return { proof, verification_key, public_inputs_flat };
65 }
66
71 {
72 std::vector<RecursionConstraint> avm_recursion_constraints;
73
74 AcirProgram program;
75
76 SlabVector<fr>& witness = program.witness;
77
78 for (const auto& inner_circuit_data : inner_circuits) {
79 const std::vector<fr> key_witnesses = inner_circuit_data.verification_key->to_field_elements();
80 const std::vector<fr> proof_witnesses = inner_circuit_data.proof;
81 const std::vector<fr> public_inputs_witnesses = inner_circuit_data.public_inputs_flat;
82
83 RecursionConstraint avm_recursion_constraint{
84 .key = add_to_witness_and_track_indices<bb::fr>(witness, key_witnesses),
85 .proof = add_to_witness_and_track_indices<bb::fr>(witness, proof_witnesses),
86 .public_inputs = add_to_witness_and_track_indices<bb::fr>(witness, public_inputs_witnesses),
87 .key_hash = 0, // not used
88 .proof_type = AVM,
89 };
90 avm_recursion_constraints.push_back(avm_recursion_constraint);
91 }
92
93 std::vector<size_t> avm_recursion_opcode_indices(avm_recursion_constraints.size());
94 std::iota(avm_recursion_opcode_indices.begin(), avm_recursion_opcode_indices.end(), 0);
95
96 AcirFormat& constraint_system = program.constraints;
97 constraint_system.varnum = static_cast<uint32_t>(witness.size());
98 constraint_system.num_acir_opcodes = static_cast<uint32_t>(avm_recursion_constraints.size());
99 constraint_system.avm_recursion_constraints = avm_recursion_constraints;
101
102 mock_opcode_indices(constraint_system);
103
104 return program;
105 }
106};
107
108TEST_F(AcirAvm2RecursionConstraint, TestBasicSingleAvm2RecursionConstraint)
109{
110 // Skip this test since it is redundant with the one below (which also does proving and verification for the AVM
111 // recursive verifier circuit) and both are expensive to run. It would be nice to reinstate this as a standalone in
112 // the future if possible.
113 GTEST_SKIP();
114
115 std::vector<InnerCircuitData> layer_1_circuits;
116 layer_1_circuits.push_back(create_inner_circuit_data());
117 AcirProgram avm_verifier_program = construct_avm_verifier_program(layer_1_circuits);
118 const ProgramMetadata metadata{ .honk_recursion = 1 };
119 auto layer_2_circuit = create_circuit(avm_verifier_program, metadata);
120
121 info("circuit gates = ", layer_2_circuit.get_estimated_num_finalized_gates());
122
123 auto prover_instance = std::make_shared<OuterProverInstance>(layer_2_circuit);
124 auto verification_key = std::make_shared<OuterVerificationKey>(prover_instance->get_precomputed());
125 OuterProver prover(prover_instance, verification_key);
126 info("prover gates = ", prover_instance->dyadic_size());
127 auto proof = prover.construct_proof();
128 VerifierCommitmentKey<curve::Grumpkin> ipa_verification_key(1 << CONST_ECCVM_LOG_N);
129 OuterVerifier verifier(verification_key, ipa_verification_key);
130 bool result = verifier.template verify_proof<bb::RollupIO>(proof, prover_instance->ipa_proof).result;
131 EXPECT_TRUE(result);
132}
133
141TEST_F(AcirAvm2RecursionConstraint, TestGenerateVKFromConstraintsWithoutWitness)
142{
143 // Generate AVM proof, verification key and public inputs
144 InnerCircuitData avm_prover_output = create_inner_circuit_data();
145
146 // First, construct an AVM2 recursive verifier circuit VK by providing a valid program witness
148 {
149 AcirProgram avm_verifier_program = construct_avm_verifier_program({ avm_prover_output });
150 const ProgramMetadata metadata{ .honk_recursion = 2 };
151 auto layer_2_circuit = create_circuit(avm_verifier_program, metadata);
152
153 info("circuit gates = ", layer_2_circuit.get_estimated_num_finalized_gates());
154
155 auto prover_instance = std::make_shared<OuterProverInstance>(layer_2_circuit);
156 expected_vk = std::make_shared<OuterVerificationKey>(prover_instance->get_precomputed());
157 OuterProver prover(prover_instance, expected_vk);
158 info("prover gates = ", prover_instance->dyadic_size());
159
160 // Construct and verify a proof of the outer AVM verifier circuits
161 auto proof = prover.construct_proof();
162 VerifierCommitmentKey<curve::Grumpkin> ipa_verification_key(1 << CONST_ECCVM_LOG_N);
163 OuterVerifier verifier(expected_vk, ipa_verification_key);
164
165 bool result = verifier.template verify_proof<bb::RollupIO>(proof, prover_instance->ipa_proof).result;
166 EXPECT_TRUE(result);
167 }
168
169 // Now, construct the AVM2 recursive verifier circuit VK by providing the program without a witness
171 {
172 AcirProgram avm_verifier_program = construct_avm_verifier_program({ avm_prover_output });
173
174 // Clear the program witness then construct the bberg circuit as normal
175 avm_verifier_program.witness.clear();
176 const ProgramMetadata metadata{ .honk_recursion = 2 };
177 auto layer_2_circuit = create_circuit(avm_verifier_program, metadata);
178
179 info("circuit gates = ", layer_2_circuit.get_estimated_num_finalized_gates());
180
181 auto prover_instance = std::make_shared<OuterProverInstance>(layer_2_circuit);
182 actual_vk = std::make_shared<OuterVerificationKey>(prover_instance->get_precomputed());
183 OuterProver prover(prover_instance, actual_vk);
184 info("prover gates = ", prover_instance->dyadic_size());
185 }
186
187 // Compare the VK constructed via running the IVC with the one constructed via mocking
188 EXPECT_EQ(*actual_vk.get(), *expected_vk.get());
189}
190
191#endif // DISABLE_AZTEC_VM
acir_format::AcirFormatOriginalOpcodeIndices create_empty_original_opcode_indices()
void mock_opcode_indices(acir_format::AcirFormat &constraint_system)
static AcirProgram construct_avm_verifier_program(const std::vector< InnerCircuitData > &inner_circuits)
Create a circuit that recursively verifies one or more inner avm2 circuits.
static InnerCircuitData create_inner_circuit_data()
A ProverInstance is normally constructed from a finalized circuit and it contains all the information...
The verification key is responsible for storing the commitments to the precomputed (non-witnessk) pol...
Representation of the Grumpkin Verifier Commitment Key inside a bn254 circuit.
bool verify(const Proof &proof, const PublicInputs &pi, const VkData &vk_data)
std::pair< Proof, VkData > prove(tracegen::TraceContainer &&trace)
static std::shared_ptr< AvmVerifier::VerificationKey > create_verification_key(const VkData &vk_data)
void info(Args... args)
Definition log.hpp:74
TestTraceContainer trace
UltraCircuitBuilder create_circuit(AcirProgram &program, const ProgramMetadata &metadata)
Specialization for creating an Ultra circuit from an acir program.
std::pair< tracegen::TraceContainer, PublicInputs > get_minimal_trace_with_pi()
Definition fixtures.cpp:183
std::filesystem::path bb_crs_path()
void init_file_crs_factory(const std::filesystem::path &path)
TEST_F(BoomerangGoblinRecursiveVerifierTests, graph_description_basic)
Construct and check a goblin recursive verification circuit.
Entry point for Barretenberg command-line interface.
std::vector< T, bb::ContainerSlabAllocator< T > > SlabVector
A vector that uses the slab allocator.
UltraCircuitBuilder_< UltraExecutionTraceBlocks > UltraCircuitBuilder
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Definition tuple.hpp:13
std::shared_ptr< AvmFlavor::VerificationKey > verification_key
AvmProvingHelper::Proof proof
AcirFormatOriginalOpcodeIndices original_opcode_indices
std::vector< RecursionConstraint > avm_recursion_constraints
RecursionConstraint struct contains information required to recursively verify a proof!
static std::vector< FF > columns_to_flat(std::vector< std::vector< FF > > const &columns)