67 const std::shared_ptr<VerificationKey>& honk_vk =
nullptr);
78 const std::shared_ptr<VerificationKey>& honk_vk =
nullptr);
93 const std::shared_ptr<VerificationKey>& honk_vk);
103 const size_t& full_batched_size,
104 const std::vector<FF>& challenges);
std::shared_ptr< Napi::ThreadSafeFunction > instance
Common transcript class for both parties. Stores the data for the current round, as well as the manif...
HyperNova folding prover. Folds circuit instances into accumulators, deferring PCS verification.
MultilinearBatchingProverClaim Accumulator
std::shared_ptr< Transcript > transcript
HonkProof export_proof()
Export the proof contained in the transcript.
Accumulator sumcheck_output_to_accumulator(MegaSumcheckOutput &sumcheck_output, const std::shared_ptr< ProverInstance > &instance, const std::shared_ptr< VerificationKey > &honk_vk)
Convert the output of the sumcheck run on the incoming instance into an accumulator.
static constexpr size_t NUM_SHIFTED_ENTITIES
std::pair< HonkProof, Accumulator > fold(const Accumulator &accumulator, const std::shared_ptr< ProverInstance > &instance, const std::shared_ptr< VerificationKey > &honk_vk=nullptr)
Fold an instance into an accumulator. Folding happens in place.
HypernovaFoldingProver(std::shared_ptr< Transcript > &transcript)
static constexpr size_t NUM_UNSHIFTED_ENTITIES
Accumulator instance_to_accumulator(const std::shared_ptr< ProverInstance > &instance, const std::shared_ptr< VerificationKey > &honk_vk=nullptr)
Turn an instance into an accumulator by running Sumcheck.
Flavor::Commitment Commitment
Commitment batch_mul(const RefArray< Commitment, N > &_points, const std::vector< FF > &scalars)
Utility to perform batch mul of commitments.
std::pair< std::vector< FF >, std::vector< FF > > get_batching_challenges()
Generate the challenges required to batch the incoming instance with the accumulator.
static Polynomial< FF > batch_polynomials(RefArray< Polynomial< FF >, N > polynomials_to_batch, const size_t &full_batched_size, const std::vector< FF > &challenges)
Batch prover polynomials. Batching happens in place into the first polynomial in the RefArray supplie...
SumcheckOutput< Flavor > MegaSumcheckOutput
static constexpr size_t NUM_SHIFTED_ENTITIES
BaseTranscript< Codec, HashFunction > Transcript
VerifierCommitments_< Commitment, VerificationKey, HasZK > VerifierCommitments
Curve::AffineElement Commitment
static constexpr size_t NUM_UNSHIFTED_ENTITIES
NativeVerificationKey_< PrecomputedEntities< Commitment >, Codec, HashFunction, CommitmentKey > VerificationKey
The verification key is responsible for storing the commitments to the precomputed (non-witness) poly...
Base Native verification key class.
Class for all the oink rounds, which are shared between the folding prover and ultra prover.
Structured polynomial class that represents the coefficients 'a' of a_0 + a_1 x .....
A ProverInstance is normally constructed from a finalized circuit and it contains all the information...
A template class for a reference array. Behaves as if std::array<T&, N> was possible.
The implementation of the sumcheck Prover for statements of the form for multilinear polynomials .
Entry point for Barretenberg command-line interface.
std::vector< fr > HonkProof
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Contains the evaluations of multilinear polynomials at the challenge point . These are computed by S...