Method derive_commitment_keys

proof_system/src/proof_spec.rs:228–368

Derive commitment keys for Schnorr protocol from public params. This is done to avoid creating them if the same public params are used in multiple statements and is effectively a pre-processing step done for optimization.

(
        &self,
    )

    /// creating them if the same public params are used in multiple statements and is effectively a
    /// pre-processing step done for optimization.
    pub fn derive_commitment_keys(
        &self,
    ) -> Result<
        (
            StatementDerivedParams<Vec<E::G1Affine>>,
            StatementDerivedParams<Vec<E::G1Affine>>,
            StatementDerivedParams<(Vec<E::G1Affine>, Vec<E::G1Affine>)>,
            StatementDerivedParams<Vec<E::G1Affine>>,
            StatementDerivedParams<[E::G1Affine; 2]>,
            StatementDerivedParams<[E::G1Affine; 2]>,
            StatementDerivedParams<[E::G1Affine; 2]>,
        ),
        ProofSystemError,
    > {
        let mut derived_bound_check_lego_comm =
            DerivedParamsTracker::<LegoVerifyingKey<E>, Vec<E::G1Affine>, E>::new();
        let mut derived_ek_comm =
            DerivedParamsTracker::<EncryptionKey<E>, Vec<E::G1Affine>, E>::new();
        let mut derived_chunked_comm = DerivedParamsTracker::<
            (&ChunkedCommitmentGens<E::G1Affine>, u8),
            (Vec<E::G1Affine>, Vec<E::G1Affine>),
            E,
        >::new();
        let mut derived_r1cs_comm =
            DerivedParamsTracker::<LegoVerifyingKey<E>, Vec<E::G1Affine>, E>::new();
        let mut derived_bound_check_bpp_comm =
            DerivedParamsTracker::<(E::G1Affine, E::G1Affine), [E::G1Affine; 2], E>::new();
        let mut derived_bound_check_smc_comm =
            DerivedParamsTracker::<MemberCommitmentKey<E::G1Affine>, [E::G1Affine; 2], E>::new();
        let mut derived_ineq_comm =
            DerivedParamsTracker::<PedersenCommitmentKey<E::G1Affine>, [E::G1Affine; 2], E>::new();

        // To avoid creating variable with short lifetime
        let mut saver_comm_keys = BTreeMap::new();
        let mut bpp_comm_keys = BTreeMap::new();

        for (s_idx, statement) in self.statements.0.iter().enumerate() {
            match statement {
                Statement::SaverProver(_) | Statement::SaverVerifier(_) => {
                    let (comm_gens, chunk_bit_size) = match statement {
                        Statement::SaverProver(s) => (
                            s.get_chunked_commitment_gens(&self.setup_params, s_idx)?,
                            s.chunk_bit_size,
                        ),
                        Statement::SaverVerifier(s) => (
                            s.get_chunked_commitment_gens(&self.setup_params, s_idx)?,
                            s.chunk_bit_size,
                        ),
                        _ => unreachable!(),
                    };
                    saver_comm_keys.insert(s_idx, (comm_gens, chunk_bit_size));
                }
                Statement::BoundCheckBpp(s) => {
                    let ck = s
                        .get_setup_params(&self.setup_params, s_idx)?
                        .get_pedersen_commitment_key();
                    bpp_comm_keys.insert(s_idx, ck);
                }