Polynomial_protocol.Make_implSourcemodule Super_PC : Polynomial_commitment.Sinclude sig ... endmodule Domain : sig ... endmodule Poly : sig ... endmodule Fr_generation : sig ... endtype verifier_identities =
Super_PC.Scalar.t ->
Super_PC.Scalar.t Plonk.SMap.t Plonk.SMap.t ->
Super_PC.Scalar.t Plonk.SMap.ttype non_committed =
Super_PC.Scalar.t ->
Super_PC.Scalar.t Plonk.SMap.t Plonk.SMap.t ->
Super_PC.Scalar.t Plonk.SMap.ttype proof = {cm_t : Super_PC.Commitment.t;pc_proof : Super_PC.proof;pc_answers : Super_PC.Scalar.t Plonk.SMap.t Plonk.SMap.t list;}val convert_eval_points :
generator:Super_PC.Scalar.t ->
x:Super_PC.Scalar.t ->
eval_point list ->
Super_PC.Scalar.t Plonk.SMap.tval merge_prover_identities :
(Evaluations.t Plonk.SMap.t -> Evaluations.t Plonk.SMap.t) list ->
prover_identitiesval merge_verifier_identities :
(Super_PC.Scalar.t ->
Super_PC.Scalar.t Plonk.SMap.t Plonk.SMap.t ->
Super_PC.Scalar.t Plonk.SMap.t)
list ->
verifier_identitiesval compute_t :
n:int ->
alpha:Fr_generation.scalar ->
nb_of_t_chunks:int ->
Evaluations.t Plonk.SMap.t ->
Poly.t Plonk.SMap.tval verify_t :
int ->
Super_PC.Scalar.t ->
Fr_generation.scalar ->
Fr_generation.scalar Plonk.SMap.t ->
Super_PC.Commitment.t ->
Fr_generation.scalar Plonk.SMap.t Plonk.SMap.t ->
boolval setup :
setup_params:int ->
srs:(Bls12_381_polynomial.Srs.t * Bls12_381_polynomial.Srs.t) ->
Super_PC.Public_parameters.prover * Super_PC.Public_parameters.verifierval prove_aux :
pc_function:
(Super_PC.Public_parameters.prover ->
Bytes.t ->
Poly.t Plonk.SMap.t list ->
Super_PC.Commitment.prover_aux list ->
Super_PC.Scalar.t Plonk.SMap.t list ->
Super_PC.Scalar.t Plonk.SMap.t Plonk.SMap.t list ->
'a) ->
Super_PC.Public_parameters.prover ->
Bytes.t ->
int ->
Super_PC.Scalar.t ->
(Poly.t Plonk.SMap.t * Super_PC.Commitment.prover_aux) list ->
eval_point list list ->
'b ->
('b -> Evaluations.t Plonk.SMap.t) ->
int ->
'a
* (Fr_generation.scalar
* Fr_generation.scalar
* Super_PC.Scalar.t Plonk.SMap.t Plonk.SMap.t list
* Super_PC.Commitment.t)val prove :
Super_PC.Public_parameters.prover ->
Bytes.t ->
n:int ->
generator:Super_PC.Scalar.t ->
secrets:(Poly.t Plonk.SMap.t * Super_PC.Commitment.prover_aux) list ->
eval_points:eval_point list list ->
evaluations:'a ->
identities:('a -> Evaluations.t Plonk.SMap.t) ->
nb_of_t_chunks:int ->
proof * Bytes.tval verify_aux :
Bytes.t ->
Super_PC.Scalar.t ->
Super_PC.Commitment.t list ->
eval_point list list ->
proof ->
Fr_generation.scalar
* Fr_generation.scalar
* Bytes.t
* Super_PC.Commitment.t list
* Super_PC.Scalar.t Plonk.SMap.t listval verify :
Super_PC.Public_parameters.verifier ->
Bytes.t ->
n:int ->
generator:Super_PC.Scalar.t ->
commitments:Super_PC.Commitment.t list ->
eval_points:eval_point list list ->
?non_committed:
(Fr_generation.scalar ->
Super_PC.Scalar.t Plonk.SMap.t Plonk.SMap.t ->
Super_PC.Scalar.t Plonk.SMap.t) ->
identities:
(Fr_generation.scalar ->
Super_PC.Scalar.t Plonk.SMap.t Plonk.SMap.t ->
Fr_generation.scalar Plonk.SMap.t) ->
proof ->
bool * Bytes.ttype prover_aux = {answers : PC.Scalar.t SMap.t SMap.t list;batch : PC.Scalar.t SMap.t list;alpha : PC.Scalar.t;x : PC.Scalar.t;r : PC.Scalar.t;cm_answers : PC.Scalar.t;}val prove_super_aggregation :
Super_PC.Public_parameters.prover ->
Bytes.t ->
n:int ->
generator:Super_PC.Scalar.t ->
secrets:(Poly.t Plonk.SMap.t * Super_PC.Commitment.prover_aux) list ->
eval_points:eval_point list list ->
evaluations:'a ->
identities:('a -> Evaluations.t Plonk.SMap.t) ->
nb_of_t_chunks:int ->
(proof * prover_aux) * Super_PC.transcriptval verify_super_aggregation :
Super_PC.Public_parameters.verifier ->
Bytes.t ->
n:'a ->
generator:Super_PC.Scalar.t ->
commitments:Super_PC.Commitment.t list ->
eval_points:eval_point list list ->
s_list:Super_PC.Scalar.t Plonk.SMap.t list ->
cm_answers:Super_PC.Scalar.t ->
proof ->
(bool * verifier_aux) * Super_PC.transcript