Module PlonkSource

Sourcemodule Arithmetic_gates : sig ... end
Sourcemodule Boolean_gates : sig ... end
Sourcemodule Circuit : sig ... end
Sourcemodule Cq : sig ... end
Sourcemodule Custom_gates : sig ... end
Sourcemodule Ecc_gates : sig ... end
Sourcemodule Evaluations_map : sig ... end
Sourcemodule Gates_common : sig ... end
Sourcemodule Hash_gates : sig ... end
Sourcemodule Identities : sig ... end
Sourcemodule Input_commitment : sig ... end
Sourcemodule List : sig ... end
Sourcemodule Main_protocol : sig ... end

aPlonK is a PlonK-based proving system. As such, it provides a way to create succinct cryptographic proofs about a given predicate, which can be then verified with a low computational cost.

Sourcemodule Main_protocol_intf : sig ... end
Sourcemodule Mod_arith_gates : sig ... end
Sourcemodule Permutation_gate : sig ... end
Sourcemodule Plookup_gate : sig ... end
Sourcemodule Polynomial_protocol : sig ... end

A polynomial protocol allows a prover to convince a verifier of the fact that certain algebraic identites between polynomials (polynomials that have been previously committed) hold when evaluated over a set of points. (In our implementation such set of points must be a subgroup of roots of unity.)

Sourcemodule Range_check_gate : sig ... end