# Research

> PLONK, plookup, and the research that followed: the cryptography written by Aztec contributors that now sits underneath much of the zero-knowledge industry.

Canonical: https://aztec.network/research  
Type: Research index  
Publisher: Aztec Foundation

## Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments

Authors: Tohru Kohrita, Patrick Towa  
Published: 1 January 2023  
Paper: https://eprint.iacr.org/2023/917

A way to commit to multilinear polynomials and prove their evaluations in zero knowledge using any homomorphic univariate scheme, with far cheaper evaluation proofs than earlier constructions.

## Proposal: The Turbo-PLONK program syntax for specifying SNARK programs

Authors: Ariel Gabizon, Zachary J. Williamson  
Published: 1 January 2020  
Paper: https://docs.zkproof.org/pages/standards/accepted-workshop3/proposal-turbo_plonk.pdf

Extends PLONK with custom gates, so a program can express its most common operations directly instead of decomposing everything into additions and multiplications.

## Efficient polynomial commitment schemes for multiple points and polynomials

Authors: Dan Boneh, Justin Drake, Ben Fisch, Ariel Gabizon  
Published: 1 January 2020  
Paper: https://eprint.iacr.org/2020/081

The scheme known as SHPLONK. Opens many polynomials at many points with a smaller proof and less verifier work than opening each one separately.

## plookup: A simplified polynomial protocol for lookup tables

Authors: Ariel Gabizon, Zachary J. Williamson  
Published: 1 January 2020  
Paper: https://eprint.iacr.org/2020/315

A protocol for proving that values appear in a precomputed table, which makes operations that are expensive in arithmetic circuits, such as range checks and hashing, dramatically cheaper.

## Halo Infinite: Recursive zk-SNARKs from any Additive Polynomial Commitment Scheme

Authors: Dan Boneh, Justin Drake, Ben Fisch, Ariel Gabizon  
Published: 1 January 2020  
Paper: https://eprint.iacr.org/2020/1536

Shows that efficient recursive proof composition works with any additive polynomial commitment scheme, generalising the technique behind Halo.

## PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge

Authors: Ariel Gabizon, Zachary J. Williamson, Oana Ciobotaru  
Published: 1 January 2019  
Paper: https://eprint.iacr.org/2019/953

A universal zk-SNARK: one trusted setup serves every program, and it can be updated. PLONK and its descendants became the most widely deployed family of proof systems in the industry.

## The AZTEC Protocol

Authors: Zachary J. Williamson  
Published: 1 January 2018  
Paper: https://github.com/AztecProtocol/aztec-v1/blob/develop/AZTEC.pdf

The original protocol: a set of zero-knowledge proofs that define confidential transactions with efficient verification on Ethereum.

## Questions

### What cryptography did Aztec contributors create?

PLONK, the universal SNARK construction now used across much of the zero-knowledge industry, was written by Aztec contributors, as were plookup for lookup tables, Turbo-PLONK, Halo Infinite, and the multi-point polynomial commitment schemes that followed.

Reviewed 21 September 2026  
Sources: [eprint.iacr.org](https://eprint.iacr.org/2019/953)

---

Markdown representation of https://aztec.network/research. Published by Aztec Foundation.
