Module Polynomial_protocol.Make_implSource

Functor building an implementation of a polynomial protocol given a polynomial commitment scheme PC.

Parameters

Signature

module PC = PC
Sourcetype prover_public_parameters = PC.Public_parameters.prover
Sourceval prover_public_parameters_t : PC.Public_parameters.prover Repr.t
Sourcetype verifier_public_parameters = PC.Public_parameters.verifier
Sourceval verifier_public_parameters_t : PC.Public_parameters.verifier Repr.t
Sourcetype proof = {
  1. cm_t : PC.Commitment.t;
  2. pc_proof : PC.proof;
  3. pc_answers : PC.answer list;
}
Sourceval proof_t : proof Repr.t

split_t n t nb_of_t_chunks splits t polynomial in nb_of_t_chunks polynomials of at most n coefficients (and at most degree n-1), except the last one that may have more coeffictients depending on t’s degree

Sourceval verify_t : int -> Kzg.Bls.Scalar.t -> Kzg.Bls.Scalar.t -> Kzg.Bls.Scalar.t list -> bool
Sourceval prove : PC.Public_parameters.prover -> Kzg__Utils.Transcript.t -> n:int -> generator:Kzg.Bls.Scalar.t -> secrets: (Kzg.Bls.Poly.t Plonk.Identities.SMap.t * PC.Commitment.prover_aux) list -> eval_points:Identities.eval_point list list -> evaluations:'a -> identities:('a -> Identities.Evaluations.t Plonk.Identities.SMap.t) -> nb_of_t_chunks:int -> proof * Kzg.Utils.Transcript.t
Sourceval verify_aux : Kzg__Utils.Transcript.t -> Kzg.Bls.Scalar.t -> PC.Commitment.t list -> Identities.eval_point list list -> proof -> Kzg.Bls.Scalar.t * Kzg.Bls.Scalar.t * Kzg__Utils.Transcript.t * PC.Commitment.t list * Kzg.Bls.Scalar.t Plonk.Identities.SMap.t list
Sourceval verify : PC.Public_parameters.verifier -> Kzg__Utils.Transcript.t -> n:int -> generator:Kzg.Bls.Scalar.t -> commitments:PC.Commitment.t list -> eval_points:Identities.eval_point list list -> identities: (Kzg.Bls.Scalar.t -> Kzg.Bls.Scalar.t Plonk.Identities.SMap.t Plonk.Identities.SMap.t -> Kzg.Bls.Scalar.t Plonk.Identities.SMap.t) -> proof -> bool * Kzg.Utils.Transcript.t