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

tezos-octez-v20.1.tag.bz2

sha256=ddfb5076eeb0b32ac21c1eed44e8fc86a6743ef18ab23fff02d36e365bb73d61

sha512=d22a827df5146e0aa274df48bc2150b098177ff7e5eab52c6109e867eb0a1f0ec63e6bfbb0e3645a6c2112de3877c91a17df32ccbff301891ce4ba630c997a65

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