Enum IndexHandle 

pub enum IndexHandle {
    Owned(Box<ProverIndex<FULL_ROUNDS, Vesta, <OpeningProof<Vesta, FULL_ROUNDS> as OpenProof<Vesta, FULL_ROUNDS>>::SRS>>),
    Mmap(Box<MmapProverIndex<FULL_ROUNDS, Vesta, <OpeningProof<Vesta, FULL_ROUNDS> as OpenProof<Vesta, FULL_ROUNDS>>::SRS>>),
}

Holds a prover index behind one of two backing stores. The enum variants both [Deref] to the same &ProverIndex, so all existing .0.cs… / .0.srs… field-access patterns in this file continue to work via auto-deref. Concretely:

• IndexHandle::Owned is the classic path: a heap-allocated ProverIndex whose Vec<F> fields are Rust-owned. Populated by caml_pasta_fp_plonk_index_create / _read.
• IndexHandle::Mmap wraps an MmapProverIndex whose bulk Vec<F> fields point into an mmap’d cache file. Populated by caml_pasta_fp_plonk_index_read_cached. Dropping an Mmap variant skips the inner Vec<F>s’ destructors (they would otherwise call dealloc on mmap memory — UB) and unmaps the file.

Variants

Owned(Box<ProverIndex<FULL_ROUNDS, Vesta, <OpeningProof<Vesta, FULL_ROUNDS> as OpenProof<Vesta, FULL_ROUNDS>>::SRS>>)

Mmap(Box<MmapProverIndex<FULL_ROUNDS, Vesta, <OpeningProof<Vesta, FULL_ROUNDS> as OpenProof<Vesta, FULL_ROUNDS>>::SRS>>)

Methods from Deref<Target = ProverIndex<FULL_ROUNDS, Vesta, <OpeningProof<Vesta, FULL_ROUNDS> as OpenProof<Vesta, FULL_ROUNDS>>::SRS>>

pub fn verify( &self, witness: &[Vec<F>; 15], public: &[F], ) -> Result<(), GateError>

This function verifies the consistency of the wire assignments (witness) against the constraints

pub fn perm_quot( &self, lagrange: &WitnessOverDomains<F>, beta: F, gamma: F, z: &DensePolynomial<F>, alphas: impl Iterator<Item = F>, ) -> Result<(Evaluations<F, Radix2EvaluationDomain<F>>, DensePolynomial<F>), ProverError>

permutation quotient poly contribution computation

Errors

Will give error if polynomial division fails.

Panics

Will panic if power of alpha is missing.

pub fn perm_lnrz( &self, e: &ProofEvaluations<PointEvaluations<F>>, zeta: F, beta: F, gamma: F, alphas: impl Iterator<Item = F>, ) -> Evaluations<F, Radix2EvaluationDomain<F>>

permutation linearization poly contribution computation

pub fn perm_aggreg( &self, witness: &[Vec<F>; 15], beta: &F, gamma: &F, rng: &mut (impl RngCore + CryptoRng), ) -> Result<DensePolynomial<F>, ProverError>

permutation aggregation polynomial computation

Errors

Will give error if permutation result is not correct.

Panics

Will panic if first element is not 1.

pub fn verifier_index_digest<EFqSponge>(&self) -> <G as AffineRepr>::BaseField

where EFqSponge: Clone + FqSponge<<G as AffineRepr>::BaseField, G, <G as AffineRepr>::ScalarField, FULL_ROUNDS>, VerifierIndex<FULL_ROUNDS, G, Srs>: Clone,

Retrieve or compute the digest for the corresponding verifier index.

pub fn verifier_index(&self) -> VerifierIndex<FULL_ROUNDS, G, Srs>

where VerifierIndex<FULL_ROUNDS, G, Srs>: Clone,

Produces the VerifierIndex from the prover’s ProverIndex.

Panics

Will panic if srs cannot be in cell.

Trait Implementations

impl Deref for IndexHandle

type Target = ProverIndex<FULL_ROUNDS, Affine<VestaParameters>, <OpeningProof<Affine<VestaParameters>, FULL_ROUNDS> as OpenProof<Affine<VestaParameters>, FULL_ROUNDS>>::SRS>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.