The recursive counterpart to the "native" Ultra flavor. More...

#include <ultra_recursive_flavor.hpp>

Inheritance diagram for bb::UltraRecursiveFlavor_< BuilderType >:

Classes
class	AllValues
	A field element for each entity of the flavor. These entities represent the prover polynomials evaluated at one point. More...

Public Types
using	CircuitBuilder = BuilderType

using	Curve = stdlib::bn254< CircuitBuilder >

using	PCS = KZG< Curve >

using	GroupElement = typename Curve::Element

using	Commitment = typename Curve::Element

using	FF = typename Curve::ScalarField

using	NativeFlavor = UltraFlavor

using	NativeVerificationKey = NativeFlavor::VerificationKey

using	Codec = stdlib::StdlibCodec< FF >

using	Transcript = StdlibTranscript< CircuitBuilder >

using	Relations = UltraFlavor::Relations_< FF >

using	SubrelationSeparator = FF

using	VerificationKey = StdlibVerificationKey_< CircuitBuilder, NativeFlavor::PrecomputedEntities< Commitment >, typename NativeFlavor::VerificationKey >

using	CommitmentLabels = UltraFlavor::CommitmentLabels

using	WitnessCommitments = UltraFlavor::WitnessEntities< Commitment >

using	VKAndHash = VKAndHash_< FF, VerificationKey >

Static Public Member Functions
static constexpr size_t	FINAL_PCS_MSM_SIZE (size_t log_n=VIRTUAL_LOG_N)

static const CommitmentLabels &	commitment_labels ()

Static Public Attributes
static constexpr size_t	VIRTUAL_LOG_N = UltraFlavor::VIRTUAL_LOG_N

static constexpr bool	USE_SHORT_MONOMIALS = UltraFlavor::USE_SHORT_MONOMIALS

static constexpr bool	HasZK = false

static constexpr bool	HasLogDerivLookup = UltraFlavor::HasLogDerivLookup

static constexpr bool	HasElliptic = UltraFlavor::HasElliptic

static constexpr bool	HasMemory = UltraFlavor::HasMemory

static constexpr bool	HasNonNativeField = UltraFlavor::HasNonNativeField

static constexpr bool	HasEccOpQueue = UltraFlavor::HasEccOpQueue

static constexpr bool	HasDataBus = UltraFlavor::HasDataBus

static constexpr bool	USE_PADDING = UltraFlavor::USE_PADDING

static constexpr size_t	NUM_WIRES = UltraFlavor::NUM_WIRES

static constexpr size_t	NUM_ALL_ENTITIES = UltraFlavor::NUM_ALL_ENTITIES

static constexpr size_t	NUM_PRECOMPUTED_ENTITIES = UltraFlavor::NUM_PRECOMPUTED_ENTITIES

static constexpr size_t	NUM_WITNESS_ENTITIES = UltraFlavor::NUM_WITNESS_ENTITIES

static constexpr RepeatedCommitmentsData	REPEATED_COMMITMENTS = UltraFlavor::REPEATED_COMMITMENTS

static constexpr size_t	MAX_PARTIAL_RELATION_LENGTH = compute_max_partial_relation_length<Relations>()

static constexpr size_t	BATCHED_RELATION_PARTIAL_LENGTH = MAX_PARTIAL_RELATION_LENGTH + 1

static constexpr size_t	NUM_RELATIONS = std::tuple_size<Relations>::value

static constexpr size_t	NUM_SUBRELATIONS = NativeFlavor::NUM_SUBRELATIONS

Detailed Description

template<typename BuilderType>
class bb::UltraRecursiveFlavor_< BuilderType >

The recursive counterpart to the "native" Ultra flavor.

This flavor can be used to instantiate a recursive Ultra Honk verifier for a proof created using the conventional Ultra flavor. It is similar in structure to its native counterpart with two main differences: 1) the curve types are stdlib types (e.g. field_t instead of field) and 2) it does not specify any Prover related types (e.g. Polynomial, ProverUnivariates, etc.) since we do not emulate prover computation in circuits, i.e. it only makes sense to instantiate a Verifier with this flavor.

Note: Unlike conventional flavors, "recursive" flavors are templated by a builder (much like native vs stdlib types). This is because the flavor itself determines the details of the underlying verifier algorithm (i.e. the set of relations), while the Builder determines the arithmetization of that algorithm into a circuit.

Template Parameters

BuilderType Determines the arithmetization of the verifier circuit defined based on this flavor.

Definition at line 28 of file ultra_recursive_flavor.hpp.