pub fn keygen_pk_impl<'params, C, P, ConcreteCircuit>(
params: &P,
vk: Option<VerifyingKey<C>>,
circuit: &ConcreteCircuit,
compress_selectors: bool,
) -> Result<ProvingKey<C>, Error>where
C: CurveAffine,
C::Scalar: FromUniformBytes<64>,
P: Params<'params, C> + Sync,
ConcreteCircuit: Circuit<C::Scalar>,
Expand description
Generate a ProvingKey
from either a precalculated VerifyingKey
and an instance of Circuit
, or
just a Circuit
, in which case a new VerifyingKey
is generated. The latter is more efficient because
it does fixed column FFTs only once.