Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
ultra_prover.cpp
Go to the documentation of this file.
1// === AUDIT STATUS ===
2// internal: { status: not started, auditors: [], date: YYYY-MM-DD }
3// external_1: { status: not started, auditors: [], date: YYYY-MM-DD }
4// external_2: { status: not started, auditors: [], date: YYYY-MM-DD }
5// =====================
6
7#include "ultra_prover.hpp"
12namespace bb {
13
14template <IsUltraOrMegaHonk Flavor>
16 const std::shared_ptr<HonkVK>& honk_vk,
17 const CommitmentKey& commitment_key)
18 : prover_instance(std::move(prover_instance))
19 , honk_vk(honk_vk)
20 , transcript(std::make_shared<Transcript>())
21 , commitment_key(commitment_key)
22{}
23
31template <IsUltraOrMegaHonk Flavor>
33 const std::shared_ptr<HonkVK>& honk_vk,
34 const std::shared_ptr<Transcript>& transcript)
35 : prover_instance(std::move(prover_instance))
36 , honk_vk(honk_vk)
37 , transcript(transcript)
38 , commitment_key(prover_instance->commitment_key)
39{}
40
48template <IsUltraOrMegaHonk Flavor>
50 const std::shared_ptr<HonkVK>& honk_vk,
51 const std::shared_ptr<Transcript>& transcript)
52 : prover_instance(std::make_shared<ProverInstance>(circuit))
53 , honk_vk(honk_vk)
54 , transcript(transcript)
55 , commitment_key(prover_instance->commitment_key)
56{}
57
58template <IsUltraOrMegaHonk Flavor>
59UltraProver_<Flavor>::UltraProver_(Builder&& circuit, const std::shared_ptr<HonkVK>& honk_vk)
60 : prover_instance(std::make_shared<ProverInstance>(circuit))
61 , honk_vk(honk_vk)
62 , transcript(std::make_shared<Transcript>())
63 , commitment_key(prover_instance->commitment_key)
64{}
65
66template <IsUltraOrMegaHonk Flavor> typename UltraProver_<Flavor>::Proof UltraProver_<Flavor>::export_proof()
67{
68 auto proof = transcript->export_proof();
69
70 // Add the IPA proof
71 if constexpr (HasIPAAccumulator<Flavor>) {
72 // The extra calculation is for the IPA proof length.
73 BB_ASSERT_EQ(prover_instance->ipa_proof.size(), static_cast<size_t>(IPA_PROOF_LENGTH));
74 proof.insert(proof.end(), prover_instance->ipa_proof.begin(), prover_instance->ipa_proof.end());
75 }
76
77 return proof;
78}
79
80template <IsUltraOrMegaHonk Flavor> void UltraProver_<Flavor>::generate_gate_challenges()
81{
82 // Determine the number of rounds in the sumcheck based on whether or not padding is employed
83 const size_t virtual_log_n =
84 Flavor::USE_PADDING ? Flavor::VIRTUAL_LOG_N : static_cast<size_t>(prover_instance->log_dyadic_size());
85
86 prover_instance->gate_challenges =
87 transcript->template get_dyadic_powers_of_challenge<FF>("Sumcheck:gate_challenge", virtual_log_n);
88}
89
90template <IsUltraOrMegaHonk Flavor> typename UltraProver_<Flavor>::Proof UltraProver_<Flavor>::construct_proof()
91{
92 OinkProver<Flavor> oink_prover(prover_instance, honk_vk, transcript);
93 oink_prover.prove();
94 vinfo("created oink proof");
95
96 generate_gate_challenges();
97
98 // Run sumcheck
99 execute_sumcheck_iop();
100 vinfo("finished relation check rounds");
101 // Execute Shplemini PCS
102 execute_pcs();
103 vinfo("finished PCS rounds");
104
105 return export_proof();
106}
107
113template <IsUltraOrMegaHonk Flavor> void UltraProver_<Flavor>::execute_sumcheck_iop()
114{
115 const size_t virtual_log_n = Flavor::USE_PADDING ? Flavor::VIRTUAL_LOG_N : prover_instance->log_dyadic_size();
116
117 using Sumcheck = SumcheckProver<Flavor>;
118 size_t polynomial_size = prover_instance->dyadic_size();
119 Sumcheck sumcheck(polynomial_size,
120 prover_instance->polynomials,
121 transcript,
122 prover_instance->alpha,
123 prover_instance->gate_challenges,
124 prover_instance->relation_parameters,
125 virtual_log_n);
126 {
127
128 BB_BENCH_NAME("sumcheck.prove");
129
130 if constexpr (Flavor::HasZK) {
131 const size_t log_subgroup_size = static_cast<size_t>(numeric::get_msb(Curve::SUBGROUP_SIZE));
132 CommitmentKey commitment_key(1 << (log_subgroup_size + 1));
133 zk_sumcheck_data = ZKData(numeric::get_msb(polynomial_size), transcript, commitment_key);
134 sumcheck_output = sumcheck.prove(zk_sumcheck_data);
135 } else {
136 sumcheck_output = sumcheck.prove();
137 }
138 }
139}
140
147template <IsUltraOrMegaHonk Flavor> void UltraProver_<Flavor>::execute_pcs()
148{
150 using PolynomialBatcher = GeminiProver_<Curve>::PolynomialBatcher;
151
152 auto& ck = prover_instance->commitment_key;
153 if (!ck.initialized()) {
154 ck = CommitmentKey(prover_instance->dyadic_size());
155 }
156
157 PolynomialBatcher polynomial_batcher(prover_instance->dyadic_size());
158 polynomial_batcher.set_unshifted(prover_instance->polynomials.get_unshifted());
159 polynomial_batcher.set_to_be_shifted_by_one(prover_instance->polynomials.get_to_be_shifted());
160
161 OpeningClaim prover_opening_claim;
162 if constexpr (!Flavor::HasZK) {
163 prover_opening_claim = ShpleminiProver_<Curve>::prove(
164 prover_instance->dyadic_size(), polynomial_batcher, sumcheck_output.challenge, ck, transcript);
165 } else {
166
167 SmallSubgroupIPA small_subgroup_ipa_prover(
168 zk_sumcheck_data, sumcheck_output.challenge, sumcheck_output.claimed_libra_evaluation, transcript, ck);
169 small_subgroup_ipa_prover.prove();
170
171 prover_opening_claim = ShpleminiProver_<Curve>::prove(prover_instance->dyadic_size(),
172 polynomial_batcher,
173 sumcheck_output.challenge,
174 ck,
175 transcript,
176 small_subgroup_ipa_prover.get_witness_polynomials());
177 }
178 vinfo("executed multivariate-to-univariate reduction");
179 PCS::compute_opening_proof(ck, prover_opening_claim, transcript);
180 vinfo("computed opening proof");
181}
182
183template class UltraProver_<UltraFlavor>;
184template class UltraProver_<UltraZKFlavor>;
186#ifdef STARKNET_GARAGA_FLAVORS
189#endif
192template class UltraProver_<MegaFlavor>;
193template class UltraProver_<MegaZKFlavor>;
194
195} // namespace bb
#define BB_ASSERT_EQ(actual, expected,...)
Definition assert.hpp:77
#define BB_BENCH_NAME(name)
Definition bb_bench.hpp:219
static constexpr bool HasZK
static constexpr bool USE_PADDING
Class responsible for computation of the batched multilinear polynomials required by the Gemini proto...
Definition gemini.hpp:126
Class for all the oink rounds, which are shared between the folding prover and ultra prover.
void prove()
Oink Prover function that runs all the rounds of the verifier.
Unverified claim (C,r,v) for some witness polynomial p(X) such that.
Definition claim.hpp:53
A ProverInstance is normally constructed from a finalized circuit and it contains all the information...
Polynomial p and an opening pair (r,v) such that p(r) = v.
Definition claim.hpp:34
static OpeningClaim prove(const FF circuit_size, PolynomialBatcher &polynomial_batcher, std::span< FF > multilinear_challenge, const CommitmentKey< Curve > &commitment_key, const std::shared_ptr< Transcript > &transcript, const std::array< Polynomial, NUM_SMALL_IPA_EVALUATIONS > &libra_polynomials={}, const std::vector< Polynomial > &sumcheck_round_univariates={}, const std::vector< std::array< FF, 3 > > &sumcheck_round_evaluations={})
Definition shplemini.hpp:36
A Curve-agnostic ZK protocol to prove inner products of small vectors.
std::array< bb::Polynomial< FF >, NUM_SMALL_IPA_EVALUATIONS > get_witness_polynomials() const
void prove()
Compute the derived witnesses and and commit to them.
The implementation of the sumcheck Prover for statements of the form for multilinear polynomials .
Definition sumcheck.hpp:289
BB_PROFILE void generate_gate_challenges()
BB_PROFILE void execute_pcs()
Produce a univariate opening claim for the sumcheck multivariate evalutions and a batched univariate ...
typename Transcript::Proof Proof
BB_PROFILE void execute_sumcheck_iop()
Run Sumcheck to establish that ∑_i pow(\vec{β*})f_i(ω) = 0. This results in u = (u_1,...
typename Flavor::CommitmentKey CommitmentKey
typename Flavor::Transcript Transcript
UltraProver_(const std::shared_ptr< ProverInstance > &, const std::shared_ptr< HonkVK > &, const CommitmentKey &)
typename Flavor::CircuitBuilder Builder
static constexpr size_t SUBGROUP_SIZE
Definition grumpkin.hpp:74
#define vinfo(...)
Definition log.hpp:80
constexpr T get_msb(const T in)
Definition get_msb.hpp:47
Entry point for Barretenberg command-line interface.
Definition api.hpp:5
CommitmentKey< Curve > ck
STL namespace.
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Definition tuple.hpp:13
This structure is created to contain various polynomials and constants required by ZK Sumcheck.