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: Completed, auditors: [Sergei], commit: }
3// external_1: { status: not started, auditors: [], commit: }
4// external_2: { status: not started, auditors: [], commit: }
5// =====================
6
7#include "ultra_prover.hpp"
15namespace bb {
16
17template <typename Flavor>
19 const std::shared_ptr<HonkVK>& honk_vk,
20 const std::shared_ptr<Transcript>& transcript)
21 : prover_instance(std::move(prover_instance))
22 , transcript(transcript)
23 , honk_vk(honk_vk)
24{}
25
42{
43 auto proof = transcript->export_proof();
44
45 // Append IPA proof if present
46 if (!prover_instance->ipa_proof.empty()) {
47 BB_ASSERT_EQ(prover_instance->ipa_proof.size(), static_cast<size_t>(IPA_PROOF_LENGTH));
48 proof.insert(proof.end(), prover_instance->ipa_proof.begin(), prover_instance->ipa_proof.end());
49 }
50
51 return proof;
52}
53
54template <typename Flavor> void UltraProver_<Flavor>::generate_gate_challenges()
55{
56 virtual_log_n =
57 Flavor::USE_PADDING ? Flavor::VIRTUAL_LOG_N : static_cast<size_t>(prover_instance->log_dyadic_size());
58
59 prover_instance->gate_challenges =
60 transcript->template get_dyadic_powers_of_challenge<FF>("Sumcheck:gate_challenge", virtual_log_n);
61}
62
64{
65 BB_BENCH_NAME("UltraProver::construct_proof");
66 size_t key_size = prover_instance->polynomials.max_end_index();
67 if constexpr (Flavor::HasZK) {
68 // SmallSubgroupIPA commits polynomials up to SUBGROUP_SIZE + 3.
69 constexpr size_t log_subgroup_size = static_cast<size_t>(numeric::get_msb(Curve::SUBGROUP_SIZE));
70 key_size = std::max(key_size, size_t{ 1 } << (log_subgroup_size + 1));
71 }
72 commitment_key = CommitmentKey(key_size);
73
74 OinkProver<Flavor> oink_prover(prover_instance, honk_vk, transcript);
75 oink_prover.prove();
76 vinfo("created oink proof");
79 }
80
81 generate_gate_challenges();
82
83 // Run sumcheck
84 execute_sumcheck_iop();
85 vinfo("finished relation check rounds");
88 }
89 // Execute Shplemini PCS
90 execute_pcs();
91 vinfo("finished PCS rounds");
94 }
95
96 return export_proof();
97}
98
103template <typename Flavor> void UltraProver_<Flavor>::execute_sumcheck_iop()
104{
105 BB_BENCH_NAME("sumcheck.prove");
106
107 using Sumcheck = SumcheckProver<Flavor>;
108 size_t polynomial_size = prover_instance->dyadic_size();
109 Sumcheck sumcheck(polynomial_size,
110 prover_instance->polynomials,
111 transcript,
112 prover_instance->alpha,
113 prover_instance->gate_challenges,
114 prover_instance->relation_parameters,
115 virtual_log_n);
116
117 if constexpr (Flavor::HasZK) {
118 // Generate libra univariates for ALL rounds (real + virtual) so that the ZK and non-ZK
119 // virtual round paths are unified. The libra contributes to every round uniformly.
120 zk_sumcheck_data = ZKData(virtual_log_n, transcript, commitment_key);
121 sumcheck_output = sumcheck.prove(zk_sumcheck_data);
122 } else {
123 sumcheck_output = sumcheck.prove();
124 }
125}
126
131template <typename Flavor> void UltraProver_<Flavor>::execute_pcs()
132{
133 BB_BENCH_NAME("UltraProver::execute_pcs");
135 using PolynomialBatcher = GeminiProver_<Curve>::PolynomialBatcher;
136
137 auto& ck = commitment_key;
138
139 PolynomialBatcher polynomial_batcher(prover_instance->dyadic_size(), prover_instance->polynomials.max_end_index());
140 polynomial_batcher.set_unshifted(prover_instance->polynomials.get_unshifted());
141 polynomial_batcher.set_to_be_shifted_by_one(prover_instance->polynomials.get_to_be_shifted());
142
143 OpeningClaim prover_opening_claim;
144 if constexpr (!Flavor::HasZK) {
145 prover_opening_claim = ShpleminiProver_<Curve>::prove(
146 prover_instance->dyadic_size(), polynomial_batcher, sumcheck_output.challenge, ck, transcript);
147 } else {
148
149 SmallSubgroupIPA small_subgroup_ipa_prover(
150 zk_sumcheck_data, sumcheck_output.challenge, sumcheck_output.claimed_libra_evaluation, transcript, ck);
151 small_subgroup_ipa_prover.prove();
152
153 prover_opening_claim = ShpleminiProver_<Curve>::prove(prover_instance->dyadic_size(),
154 polynomial_batcher,
155 sumcheck_output.challenge,
156 ck,
157 transcript,
158 small_subgroup_ipa_prover.get_witness_polynomials());
159 }
160 vinfo("executed multivariate-to-univariate reduction");
161 PCS::compute_opening_proof(ck, prover_opening_claim, transcript);
162 vinfo("computed opening proof");
163}
164
165template class UltraProver_<UltraFlavor>;
166template class UltraProver_<UltraZKFlavor>;
168#ifdef STARKNET_GARAGA_FLAVORS
171#endif
173template class UltraProver_<MegaFlavor>;
174template class UltraProver_<MegaZKFlavor>;
175template class UltraProver_<MegaAvmFlavor>;
176
177} // namespace bb
#define BB_ASSERT_EQ(actual, expected,...)
Definition assert.hpp:83
#define BB_BENCH_NAME(name)
Definition bb_bench.hpp:264
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:129
Executes the "Oink" phase of the Honk proving protocol: the initial rounds that commit to witness dat...
void prove(bool emit_alpha=true)
Commit to witnesses, compute relation parameters, and prepare for Sumcheck.
Unverified claim (C,r,v) for some witness polynomial p(X) such that.
Definition claim.hpp:55
Polynomial p and an opening pair (r,v) such that p(r) = v.
Definition claim.hpp:36
static OpeningClaim prove(size_t 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_COMMITMENTS > &libra_polynomials={}, const std::vector< Polynomial > &sumcheck_round_univariates={}, const std::vector< std::array< FF, 3 > > &sumcheck_round_evaluations={})
Definition shplemini.hpp:37
A Curve-agnostic ZK protocol to prove inner products of small vectors.
std::array< bb::Polynomial< FF >, NUM_SMALL_IPA_COMMITMENTS > 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:304
UltraProver_(std::shared_ptr< ProverInstance >, const std::shared_ptr< HonkVK > &, const std::shared_ptr< Transcript > &transcript=std::make_shared< Transcript >())
BB_PROFILE void generate_gate_challenges()
BB_PROFILE void execute_pcs()
Reduce the sumcheck multivariate evaluations to a single univariate opening claim via Shplemini,...
typename Transcript::Proof Proof
BB_PROFILE void execute_sumcheck_iop()
Run Sumcheck to establish that ∑_i pow(\vec{β*})f_i(ω) = 0, producing sumcheck round challenges u = (...
typename Flavor::CommitmentKey CommitmentKey
Proof export_proof()
Export the complete proof, including IPA proof for rollup circuits.
static constexpr size_t SUBGROUP_SIZE
Definition grumpkin.hpp:74
#define vinfo(...)
Definition log.hpp:94
bool use_memory_profile
MemoryProfile GLOBAL_MEMORY_PROFILE
constexpr T get_msb(const T in)
Definition get_msb.hpp:50
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.
void add_checkpoint(const std::string &stage)