Skip to main content

KimchiIndex

Type Alias KimchiIndex 

Source
type KimchiIndex = ProverIndex<FULL_ROUNDS, Pallas, IPA_SRS<Pallas>>;

Aliased Type§

struct KimchiIndex {
    pub cs: Arc<ConstraintSystem<Fp<MontBackend<FrConfig, 4>, 4>>>,
    pub linearization: Linearization<Vec<PolishToken<Fp<MontBackend<FrConfig, 4>, 4>, Column, BerkeleyChallengeTerm>>, Column>,
    pub powers_of_alpha: Alphas<Fp<MontBackend<FrConfig, 4>, 4>>,
    pub srs: Arc<SRS<Affine<PallasParameters>>>,
    pub max_poly_size: usize,
    pub column_evaluations: Arc<LazyCache<ColumnEvaluations<Fp<MontBackend<FrConfig, 4>, 4>>>>,
    pub verifier_index: Option<VerifierIndex<55, Affine<PallasParameters>, SRS<Affine<PallasParameters>>>>,
    pub verifier_index_digest: Option<Fp<MontBackend<FqConfig, 4>, 4>>,
}

Fields§

§cs: Arc<ConstraintSystem<Fp<MontBackend<FrConfig, 4>, 4>>>

constraints system polynomials

§linearization: Linearization<Vec<PolishToken<Fp<MontBackend<FrConfig, 4>, 4>, Column, BerkeleyChallengeTerm>>, Column>

The symbolic linearization of our circuit, which can compile to concrete types once certain values are learned in the protocol.

§powers_of_alpha: Alphas<Fp<MontBackend<FrConfig, 4>, 4>>

The mapping between powers of alpha and constraints

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

polynomial commitment keys

§max_poly_size: usize

maximal size of polynomial section

§column_evaluations: Arc<LazyCache<ColumnEvaluations<Fp<MontBackend<FrConfig, 4>, 4>>>>§verifier_index: Option<VerifierIndex<55, Affine<PallasParameters>, SRS<Affine<PallasParameters>>>>

The verifier index corresponding to this prover index

§verifier_index_digest: Option<Fp<MontBackend<FqConfig, 4>, 4>>

The verifier index digest corresponding to this prover index