package octez-plonk
module type S = sig ... end
module Make_impl
(PC :
Plonk.Polynomial_commitment.S
with type Commitment.t = Plonk.Bls.G1.t Plonk.SMap.t) :
sig ... end
module Make
(PC :
Plonk.Polynomial_commitment.S
with type Commitment.t = Plonk.Bls.G1.t Plonk.SMap.t) :
S
include sig ... end
type secret = Plonk.Bls.Poly.t Plonk.SMap.t
type query = Plonk.Bls.Scalar.t Plonk.SMap.t
type answer = Plonk.Bls.Scalar.t Plonk.SMap.t Plonk.SMap.t
type proof = Make(Plonk.Polynomial_commitment.Kzg_impl).proof
module Commitment : sig ... end
module Public_parameters : sig ... end
val prove :
Public_parameters.prover ->
transcript ->
secret list ->
Commitment.prover_aux list ->
query list ->
answer list ->
proof * transcript
val verify :
Public_parameters.verifier ->
transcript ->
Commitment.t list ->
query list ->
answer list ->
proof ->
bool * transcript
type prover_aux = Make(Plonk.Polynomial_commitment.Kzg_impl).prover_aux = {
r : Plonk.Bls.Scalar.t;
s_list : Plonk.Bls.Scalar.t Plonk.SMap.t list;
}
Auxiliary information needed by the prover for the meta-verification in aPlonK
val prove_super_aggregation :
Public_parameters.prover ->
transcript ->
Plonk.Bls.Poly.t Plonk.SMap.t list ->
Commitment.prover_aux list ->
query list ->
Plonk.Bls.Scalar.t Plonk.SMap.t Plonk.SMap.t list ->
(proof * prover_aux) * transcript
val verify_super_aggregation :
Public_parameters.verifier ->
transcript ->
Commitment.t list ->
query list ->
Plonk.Bls.Scalar.t Plonk.SMap.t list ->
proof ->
bool * Plonk.Bls.Scalar.t * transcript
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>