snark

Type Alias VerifierIndex

Source 
pub type VerifierIndex = VerifierIndex<Fq>;

Aliased Type§

pub struct VerifierIndex {
Show 27 fields
    pub domain: Radix2EvaluationDomain<Fp<MontBackend<FrConfig, 4>, 4>>,
    pub max_poly_size: usize,
    pub zk_rows: u64,
    pub srs: Arc<SRS<Affine<PallasParameters>>>,
    pub public: usize,
    pub prev_challenges: usize,
    pub sigma_comm: [PolyComm<Affine<PallasParameters>>; 7],
    pub coefficients_comm: [PolyComm<Affine<PallasParameters>>; 15],
    pub generic_comm: PolyComm<Affine<PallasParameters>>,
    pub psm_comm: PolyComm<Affine<PallasParameters>>,
    pub complete_add_comm: PolyComm<Affine<PallasParameters>>,
    pub mul_comm: PolyComm<Affine<PallasParameters>>,
    pub emul_comm: PolyComm<Affine<PallasParameters>>,
    pub endomul_scalar_comm: PolyComm<Affine<PallasParameters>>,
    pub range_check0_comm: Option<PolyComm<Affine<PallasParameters>>>,
    pub range_check1_comm: Option<PolyComm<Affine<PallasParameters>>>,
    pub foreign_field_add_comm: Option<PolyComm<Affine<PallasParameters>>>,
    pub foreign_field_mul_comm: Option<PolyComm<Affine<PallasParameters>>>,
    pub xor_comm: Option<PolyComm<Affine<PallasParameters>>>,
    pub rot_comm: Option<PolyComm<Affine<PallasParameters>>>,
    pub shift: [Fp<MontBackend<FrConfig, 4>, 4>; 7],
    pub permutation_vanishing_polynomial_m: OnceCell<DensePolynomial<Fp<MontBackend<FrConfig, 4>, 4>>>,
    pub w: OnceCell<Fp<MontBackend<FrConfig, 4>, 4>>,
    pub endo: Fp<MontBackend<FrConfig, 4>, 4>,
    pub lookup_index: Option<LookupVerifierIndex<Affine<PallasParameters>>>,
    pub linearization: Linearization<Vec<PolishToken<Fp<MontBackend<FrConfig, 4>, 4>, Column, BerkeleyChallengeTerm>>, Column>,
    pub powers_of_alpha: Alphas<Fp<MontBackend<FrConfig, 4>, 4>>,

}

Fields§

§domain: Radix2EvaluationDomain<Fp<MontBackend<FrConfig, 4>, 4>>

evaluation domain

§max_poly_size: usize

maximal size of polynomial section

§zk_rows: u64

the number of randomized rows to achieve zero knowledge

§srs: Arc<SRS<Affine<PallasParameters>>>

polynomial commitment keys

§public: usize

number of public inputs

§prev_challenges: usize

number of previous evaluation challenges, for recursive proving

§sigma_comm: [PolyComm<Affine<PallasParameters>>; 7]

permutation commitment array

§coefficients_comm: [PolyComm<Affine<PallasParameters>>; 15]

coefficient commitment array

§generic_comm: PolyComm<Affine<PallasParameters>>

generic gate commitment array

§psm_comm: PolyComm<Affine<PallasParameters>>

poseidon constraint selector polynomial commitment

§complete_add_comm: PolyComm<Affine<PallasParameters>>

EC addition selector polynomial commitment

§mul_comm: PolyComm<Affine<PallasParameters>>

EC variable base scalar multiplication selector polynomial commitment

§emul_comm: PolyComm<Affine<PallasParameters>>

endoscalar multiplication selector polynomial commitment

§endomul_scalar_comm: PolyComm<Affine<PallasParameters>>

endoscalar multiplication scalar computation selector polynomial commitment

§range_check0_comm: Option<PolyComm<Affine<PallasParameters>>>

RangeCheck0 polynomial commitments

§range_check1_comm: Option<PolyComm<Affine<PallasParameters>>>

RangeCheck1 polynomial commitments

§foreign_field_add_comm: Option<PolyComm<Affine<PallasParameters>>>

Foreign field addition gates polynomial commitments

§foreign_field_mul_comm: Option<PolyComm<Affine<PallasParameters>>>

Foreign field multiplication gates polynomial commitments

§xor_comm: Option<PolyComm<Affine<PallasParameters>>>

Xor commitments

§rot_comm: Option<PolyComm<Affine<PallasParameters>>>

Rot commitments

§shift: [Fp<MontBackend<FrConfig, 4>, 4>; 7]

wire coordinate shifts

§permutation_vanishing_polynomial_m: OnceCell<DensePolynomial<Fp<MontBackend<FrConfig, 4>, 4>>>

zero-knowledge polynomial

§w: OnceCell<Fp<MontBackend<FrConfig, 4>, 4>>

domain offset for zero-knowledge

§endo: Fp<MontBackend<FrConfig, 4>, 4>

endoscalar coefficient

§lookup_index: Option<LookupVerifierIndex<Affine<PallasParameters>>>§linearization: Linearization<Vec<PolishToken<Fp<MontBackend<FrConfig, 4>, 4>, Column, BerkeleyChallengeTerm>>, Column>§powers_of_alpha: Alphas<Fp<MontBackend<FrConfig, 4>, 4>>

The mapping between powers of alpha and constraints