package octez-plonk

You can search for identifiers within the package.

in-package search v0.2.0

Plonk zero-knowledge proving system

Install

Dune Dependency

www.tezos.com Readme Edit opam file Versions (1)

Authors

T

Tezos devteam

Maintainers

C

contact@tezos.com

Sources

tezos-17.3.tar.gz

sha256=7062cd57addd452852598a2214ade393130efa087b99068d53713bdf912b3680

sha512=08e4091144a03ce3c107fb91a66501bd8b65ca3278917c455a2eaac6df3e108ade63f6ab8340a4bb152d60f404326e464d0ec95d26cafe8e82f870465d24a5fc

doc/octez-plonk.aggregation/Aggregation/Main_protocol/index.html

Module `Aggregation.Main_protocol`Source

Sourcemodule SMap = Plonk.SMap

Sourcemodule type S = sig ... end

Sourcemodule Make_impl (Super_PP : Polynomial_protocol.S) : sig ... end

Source

module Make
  (PP : Polynomial_protocol.S) : 
  S with module PP = PP and type public_inputs = Plonk.Bls.Scalar.t array list

include sig ... end

Sourcemodule PP : sig ... end

Sourceexception Rest_not_null of string

Sourceexception Entry_not_in_table of string

Sourcemodule Input_commitment : sig ... end

Sourcetype scalar = Plonk.Bls.Scalar.t

Sourceval scalar_t : scalar Repr.t

Sourceval scalar_encoding : scalar Data_encoding.t

Sourcetype circuit_map = (Plonk.Circuit.t * int) Plonk.SMap.t

Source

type prover_public_parameters =
  Make(Polynomial_protocol).prover_public_parameters

Sourceval prover_public_parameters_t : prover_public_parameters Repr.t

Source

type verifier_public_parameters =
  Make(Polynomial_protocol).verifier_public_parameters

Sourceval verifier_public_parameters_t : verifier_public_parameters Repr.t

Source

val verifier_public_parameters_encoding : 
  verifier_public_parameters Data_encoding.t

Sourcetype proof = Make(Polynomial_protocol).proof

Sourceval proof_t : proof Repr.t

Sourceval proof_encoding : proof Data_encoding.t

Sourcetype circuit_prover_input = Make(Polynomial_protocol).circuit_prover_input = {

witness : scalar array;
input_commitments : Input_commitment.t list;

}

Sourceval circuit_prover_input_t : circuit_prover_input Repr.t

Sourcetype prover_inputs = circuit_prover_input list Plonk.SMap.t

Sourceval prover_inputs_t : prover_inputs Repr.t

Sourcetype public_inputs = Plonk.Bls.Scalar.t array list

Sourceval public_inputs_t : public_inputs Repr.t

Source

type verifier_inputs =
  (public_inputs * Input_commitment.public list list) Plonk.SMap.t

Sourceval verifier_inputs_t : verifier_inputs Repr.t

Source

val to_verifier_inputs : 
  prover_public_parameters ->
  prover_inputs ->
  verifier_inputs

Source

val input_commit : 
  ?size:int ->
  ?shift:int ->
  prover_public_parameters ->
  scalar array ->
  Input_commitment.t

Source

val setup : 
  zero_knowledge:bool ->
  circuit_map ->
  srs:
    (Octez_bls12_381_polynomial.Bls12_381_polynomial.Srs.t
     * Octez_bls12_381_polynomial.Bls12_381_polynomial.Srs.t) ->
  prover_public_parameters * verifier_public_parameters

Source

val update_prover_public_parameters : 
  Bytes.t ->
  prover_public_parameters ->
  prover_public_parameters

Source

val update_verifier_public_parameters : 
  Bytes.t ->
  verifier_public_parameters ->
  verifier_public_parameters

Sourceval prove : prover_public_parameters -> inputs:prover_inputs -> proof

Source

val verify : 
  verifier_public_parameters ->
  inputs:verifier_inputs ->
  proof ->
  bool

Sourcemodule Internal_for_tests : sig ... end

Sourcemodule Gates : sig ... end

Sourcemodule Perm : sig ... end

Sourceval get_gen_n_prover : prover_public_parameters -> scalar * int

Returns (g, n), where n is the size of the circuit padded to the next power of two & g is a primitive n-th root of unity

Sourceval get_gen_n_verifier : verifier_public_parameters -> scalar * int

Returns (g, n), where n is the size of the circuit padded to the next power of two & g is a primitive n-th root of unity

Source

val filter_prv_pp_circuits : 
  prover_public_parameters ->
  'a SMap.t ->
  prover_public_parameters

Source

val filter_vrf_pp_circuits : 
  verifier_public_parameters ->
  'a SMap.t ->
  verifier_public_parameters

Sourcetype prover_aux = Make(Polynomial_protocol).prover_aux = {

answers : scalar SMap.t SMap.t list;
batch : scalar SMap.t list;
alpha : scalar;
beta : scalar;
gamma : scalar;
delta : scalar;
x : scalar;
r : scalar;
cms_answers : PP.Answers_commitment.t SMap.t;
cms_pi : PP.Answers_commitment.t SMap.t;
ids_batch : (scalar * int) SMap.t;
t_answers : scalar list;

}

Auxiliary information needed by the prover for the meta-verification in aPlonK

Sourcetype verifier_aux = Make(Polynomial_protocol).verifier_aux = {

alpha : scalar;
beta : scalar;
gamma : scalar;
delta : scalar;
x : scalar;
r : scalar;

}

Auxiliary information needed by the verifier for the meta-verification in aPlonK

Sourcetype input_commit_info = Make(Polynomial_protocol).input_commit_info = {

nb_max_answers : int;
nb_max_pi : int;
func : ?size:int -> ?shift:int -> scalar array -> PP.Answers_commitment.t;

}

Source

val prove_list : 
  prover_public_parameters ->
  input_commit_infos:input_commit_info SMap.t ->
  inputs:prover_inputs ->
  proof * prover_aux

Source

val verify_list : 
  verifier_public_parameters ->
  (proof
   * scalar SMap.t list
   * PP.Answers_commitment.public SMap.t
   * PP.Answers_commitment.public SMap.t
   * scalar list
   * (scalar * int) SMap.t) ->
  bool * verifier_aux

package octez-plonk

Install

Dune Dependency

Authors

Maintainers

Sources

doc/octez-plonk.aggregation/Aggregation/Main_protocol/index.html

Module Aggregation.Main_protocolSource

Module `Aggregation.Main_protocol`Source