Class-leading zero knowledge cryptography that powers the rest of the industry.
Research Papers
Plonk
We present a universal SNARK construction with fully succinct verification, and significantly lower prover running time. Authored by Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru.
PLOOKUP
A simplified polynomial protocol for lookup tables. Authored by Ariel Gabizon, and Zachary J. Williamson.
TURBO-PLONK
We present the Turbo-PLONK program syntax, a framework to capture more general and flexible constraints for specifying SNARK programs. Authored by Ariel Gabizon, and Zachary J. Williamson.
SHPLONK
We present an enhanced version of the Kate, Zaverucha and Goldberg polynomial commitment scheme, and a second scheme where the proof consists of two group elements and the verifier complexity is better than previously known batched verification methods for [KZG]. Authored by: Dan Boneh, Justin Drake, Ben Fisch, and Ariel Gabizon.
HALO INFINITE
Efficient polynomial commitment schemes for multiple points and polynomials. Authored by: Dan Boneh, Justin Drake, Ben Fisch, and Ariel Gabizon
ZEROMORPH
This paper introduces a new scheme to commit to multilinear polynomials and to later prove evaluations thereof. The scheme exponentially improves on the added prover costs for evaluation proofs to be zero-knowledge. Authored by: Tohru Kohrita, and Patrick Towa.
The Aztec Protocol
The Anonymous Zero-knowledge Transactions with Efficient Communication (AZTEC) protocol describes a set of zero-knowledge proofs that define a confidential transaction protocol, designed for use within blockchain protocols that support Turing-complete general-purpose computation.
