Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
translator_recursive_flavor.hpp
Go to the documentation of this file.
1// === AUDIT STATUS ===
2// internal: { status: Planned, auditors: [], commit: }
3// external_1: { status: not started, auditors: [], commit: }
4// external_2: { status: not started, auditors: [], commit: }
5// =====================
6
7#pragma once
19
20namespace bb {
21
32
33 public:
34 // TODO(https://github.com/AztecProtocol/barretenberg/issues/990): Establish whether mini_circuit_size pattern is
35 // needed
38 using PCS = KZG<Curve>;
44 using SubrelationSeparators = std::array<FF, NUM_SUBRELATIONS - 1>;
45
48
50
51 // Indicates that this flavor runs with non-ZK Sumcheck.
52 static constexpr bool HasZK = true;
53 // Translator proof size and its recursive verifier circuit are genuinely fixed, hence no padding is needed.
55 // None of this parameters can be changed
56
57 // Number of bits in a binary limb
58 // This is not a configurable value. Relations are sepcifically designed for it to be 68
59 static constexpr size_t NUM_LIMB_BITS = NativeFlavor::NUM_LIMB_BITS;
60
61 // The number of multivariate polynomials on which a sumcheck prover sumcheck operates (including shifts). We
62 // often need containers of this size to hold related data, so we choose a name more agnostic than
63 // `NUM_POLYNOMIALS`. Note: this number does not include the individual sorted list polynomials.
65 // The number of polynomials precomputed to describe a circuit and to aid a prover in constructing a satisfying
66 // assignment of witnesses. We again choose a neutral name.
68 // The total number of witness entities not including shifts.
70
71 // Number of wires representing the op queue whose commitments are going to be checked against those from the
72 // final round of merge
74
76
78
79 static constexpr size_t MAX_PARTIAL_RELATION_LENGTH = compute_max_partial_relation_length<Relations>();
80
81 // BATCHED_RELATION_PARTIAL_LENGTH = algebraic degree of sumcheck relation *after* multiplying by the `pow_zeta`
82 // random polynomial e.g. For \sum(x) [A(x) * B(x) + C(x)] * PowZeta(X), relation length = 2 and random relation
83 // length = 3
86
92 public:
94 using Base::Base;
95 };
102
107
109 // Reuse the VerifierCommitments from Translator
111 // Reuse the transcript from Translator
113
115};
116} // namespace bb
Common transcript class for both parties. Stores the data for the current round, as well as the manif...
Simple stdlib verification key class for fixed-size circuits (ECCVM, Translator).
Definition flavor.hpp:382
Simple verification key class for fixed-size circuits (ECCVM, Translator).
Definition flavor.hpp:136
A base class labelling all entities (for instance, all of the polynomials used by the prover during s...
A container for commitment labels.
Container for all witness polynomials used/constructed by the prover.
static constexpr size_t NUM_ALL_ENTITIES
static constexpr RepeatedCommitmentsData REPEATED_COMMITMENTS
static constexpr size_t NUM_WITNESS_ENTITIES
static constexpr size_t NUM_OP_QUEUE_WIRES
static constexpr bool USE_PADDING
static constexpr size_t NUM_LIMB_BITS
std::tuple< TranslatorPermutationRelation< FF >, TranslatorDeltaRangeConstraintRelation< FF >, TranslatorOpcodeConstraintRelation< FF >, TranslatorAccumulatorTransferRelation< FF >, TranslatorDecompositionRelation< FF >, TranslatorNonNativeFieldRelation< FF >, TranslatorZeroConstraintsRelation< FF > > Relations_
static constexpr size_t NUM_PRECOMPUTED_ENTITIES
static constexpr size_t NUM_SUBRELATIONS
static constexpr size_t BATCHED_RELATION_PARTIAL_LENGTH
FixedVKAndHash_< PrecomputedEntities< Commitment >, FF, TranslatorHardcodedVKAndHash > VerificationKey
The verification key stores commitments to the precomputed polynomials used by the verifier.
A field element for each entity of the flavor. These entities represent the prover polynomials evalua...
The recursive counterpart of the native Translator flavor.
static constexpr size_t MAX_PARTIAL_RELATION_LENGTH
std::array< FF, NUM_SUBRELATIONS - 1 > SubrelationSeparators
TranslatorFlavor::Relations_< FF > Relations
static constexpr size_t BATCHED_RELATION_PARTIAL_LENGTH
static constexpr RepeatedCommitmentsData REPEATED_COMMITMENTS
Wrapper holding a verification key and its precomputed hash.
Definition flavor.hpp:593
Representation of the Grumpkin Verifier Commitment Key inside a bn254 circuit.
Base class templates for structures that contain data parameterized by the fundamental polynomials of...
Entry point for Barretenberg command-line interface.
Definition api.hpp:5
BaseTranscript< stdlib::StdlibCodec< stdlib::field_t< UltraCircuitBuilder > >, stdlib::poseidon2< UltraCircuitBuilder > > UltraStdlibTranscript
UltraCircuitBuilder_< UltraExecutionTraceBlocks > UltraCircuitBuilder
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Definition tuple.hpp:13
field_t< CircuitBuilder > ScalarField
Definition bn254.hpp:33
Group::BaseField BaseField
Definition bn254.hpp:35
Group AffineElement
Definition bn254.hpp:37