Research

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.

A breakthrough zero-knowledge proof with universal SNARK construction, fully succinct verification, and significantly lower prover running time.

A simplified polynomial protocol for lookup tables, making it easier and faster to build with zero-knowledge proofs.

A program syntax and framework to capture more general and flexible constraints for specifying SNARK programs.

Efficient polynomial commitment schemes for multiple points and polynomials.

An enhanced version of the Kate, Zaverucha and Goldberg polynomial commitment scheme, as well as 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]. Building with zero-knowledge becomes faster and more practical.

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.