Todo List

Class bb::BarycentricDataCompileTime< Fr, domain_end, num_evals, domain_start >

: TODO(https://github.com/AztecProtocol/barretenberg/issues/713) Optimize with lookup tables?

Member bb::BaseTranscript< Codec_, HashFunction >::send_to_verifier (const std::string &label, const T &element)

Use a concept to only allow certain types to be passed. Requirements are that the object should be serializable.

Member bb::GetParameterView

TODO(https://github.com/AztecProtocol/barretenberg/issues/759): Optimize

Member bb::Goblin::ensure_well_formed_op_queue_for_avm (MegaBuilder &builder) const

(https://github.com/AztecProtocol/barretenberg/issues/1537) Asses whether two Translator variants (one with Zk and one without) would be a better option

Class bb::MegaFlavor::VerificationKey

TODO(https://github.com/AztecProtocol/barretenberg/issues/876)

Member bb::Polynomial< Fr >::copy_vector (const std::vector< T > &vec)

https://github.com/AztecProtocol/barretenberg/issues/1292

Member bb::ProtogalaxyProverInternal< ProverInstance >::compute_combiner (const ProverInstances &instances, const GateSeparatorPolynomial< FF > &gate_separators, const UnivariateRelationParameters &relation_parameters, const UnivariateSubrelationSeparators &alphas, TupleOfTuplesOfUnivariates &univariate_accumulators)

(https://github.com/AztecProtocol/barretenberg/issues/968) Make combiner tests better

Member bb::stdlib::recursion::honk::TEST (RecursiveTranscript, InfinityConsistencyBN254)

(https://github.com/AztecProtocol/barretenberg/issues/1064) Add more transcript tests for both curves

Member bb::stdlib::recursion::honk::TEST (RecursiveTranscript, InfinityConsistencyGrumpkin)

(https://github.com/AztecProtocol/barretenberg/issues/1064) Add more transcript tests for both curves

Member bb::UltraPermutationRelationImpl< FF_ >::accumulate (ContainerOverSubrelations &accumulators, const AllEntities &in, const Parameters &params, const FF &scaling_factor)

Protogalaxy Accumulation

Member bb::ZKSumcheckData< Flavor >::update_zk_sumcheck_data (const FF &round_challenge, const size_t round_idx)

Refactor once the Libra univariates are extracted from the Proving Key. Then the prover does not need to update the first round_idx - 1 univariates and could release the memory. Also, use batch_invert / reduce the number of divisions by 2.

File flavor.hpp

TODO(#395): Getters should return arrays?

TODO(#396): Access specifiers?

TODO(#397): Use more handle types?

TODO(#398): Selectors should come from arithmetization.

Member PGInternalTest::compute_combiner_no_optimistic_skipping (const ProverInstances &keys, const GateSeparatorPolynomial< FF > &gate_separators, const UnivariateRelationParametersNoOptimisticSkipping &relation_parameters, const UnivariateSubrelationSeparators &alphas, TupleOfTuplesOfUnivariatesNoOptimisticSkipping &univariate_accumulators)

(https://github.com/AztecProtocol/barretenberg/issues/968) Make combiner tests better

Member smt_circuit::UltraCircuit::handle_delta_range_relation (size_t cursor)

Useless?

Member smt_circuit::UltraCircuit::simulate_circuit_eval (std::vector< bb::fr > &witness) const override

Do we actually need this here?

Member smt_terms::SymSet< sym_entry >::contains (const sym_entry &entry) const

(alex) maybe it should return the term value, for bool comaptibility

Page Sumcheck Implementation

Docs for Flavors and Relations.

Compute precise upper bounds.