The verification key is responsible for storing the commitments to the precomputed (non-witnessk) polynomials used by the verifier.
More...
|
| | VerificationKey (CircuitBuilder *builder, const std::shared_ptr< NativeVerificationKey > &native_key) |
| | Construct a new Verification Key with stdlib types from a provided native verification key.
|
| |
| | VerificationKey (std::span< FF > elements) |
| | Deserialize a verification key from a vector of field elements.
|
| |
| bool | operator== (const StdlibVerificationKey_ &) const=default |
| |
| virtual | ~StdlibVerificationKey_ ()=default |
| |
| | StdlibVerificationKey_ ()=default |
| |
| | StdlibVerificationKey_ (const size_t circuit_size, const size_t num_public_inputs) |
| |
| virtual std::vector< FF > | to_field_elements () const |
| | Serialize verification key to field elements.
|
| |
| FF | hash () |
| | A model function to show how to compute the VK hash (without the Transcript abstracting things away).
|
| |
| virtual FF | hash_through_transcript (const std::string &domain_separator, Transcript &transcript) const |
| | Hashes the vk using the transcript's independent buffer and returns the hash.
|
| |
| bool | operator== (const PrecomputedEntities &) const =default |
| |
| | DEFINE_FLAVOR_MEMBERS (DataType, q_m, q_c, q_l, q_r, q_o, q_4, q_lookup, q_arith, q_delta_range, q_elliptic, q_memory, q_nnf, q_poseidon2_external, q_poseidon2_internal, sigma_1, sigma_2, sigma_3, sigma_4, id_1, id_2, id_3, id_4, table_1, table_2, table_3, table_4, lagrange_first, lagrange_last) auto get_non_gate_selectors() |
| |
| auto | get_gate_selectors () |
| |
| auto | get_selectors () |
| |
| auto | get_sigmas () |
| |
| auto | get_ids () |
| |
| auto | get_tables () |
| |
template<typename BuilderType>
class bb::UltraRecursiveFlavor_< BuilderType >::VerificationKey
The verification key is responsible for storing the commitments to the precomputed (non-witnessk) polynomials used by the verifier.
- Note
- Note the discrepancy with what sort of data is stored here vs in the proving key. We may want to resolve that, and split out separate PrecomputedPolynomials/Commitments data for clarity but also for portability of our circuits.
Definition at line 101 of file ultra_recursive_flavor.hpp.