Crate zero_plonk

Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge (PLONK) is a zero knowledge proof system.

This protocol was created by:

• Ariel Gabizon (Protocol Labs),
• Zachary J. Williamson (Aztec Protocol)
• Oana Ciobotaru

This crate contains a pure-rust implementation done by the DuskNetwork team of this algorithm using as a reference implementation this one done by the creators of the protocol:

https://github.com/AztecProtocol/barretenberg/blob/master/barretenberg/src/aztec/plonk/

Modules

commitment_scheme

Ideally we should cleanly abstract away the polynomial commitment scheme We note that PLONK makes use of the linearization technique conceived in SONIC [Mary Maller].

composer

PLONK turbo composer definitions

constraint_system

The constraint System module stores the implementation of the PLONK Standard Composer, as well as the circuit tools and abstractions, used by the Composer to generate, build, preprocess circuits.

error

A collection of all possible errors encountered in PLONK.

notes

This module is a self contained file which explains how PLONK and its protocol components work in our library.

prelude

Collection of functions needed to use plonk library.

proof_system

Proving system

runtime

PLONK runtime controller