package octez-libs

You can search for identifiers within the package.

in-package search v0.2.0

A package that contains multiple base libraries used by the Octez suite

Install

Dune Dependency

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

Authors

T

Tezos devteam

Maintainers

C

contact@tezos.com

Sources

octez-19.0.tar.gz

sha256=c6df840ebbf115e454db949028c595bec558a59a66cade73b52a6d099d6fa4d4

sha512=d8aee903b9fe130d73176bc8ec38b78c9ff65317da3cb4f3415f09af0c625b4384e7498201fdb61aa39086a7d5d409d0ab3423f9bc3ab989a680cf444a79bc13

doc/octez-libs.plonk/Plonk/index.html

Module `Plonk`Source

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