Home > Resources > papers > CBBZ23-HyperPlonk

HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023)

URL: https://link.springer.com/chapter/10.1007/978-3-031-30617-4_17

Summary

Extends PLONK to the multilinear setting using the sumcheck protocol, enabling linear-time proving and support for high-degree custom gates. HyperPlonk replaces the univariate polynomial IOP with a multilinear one over the hypercube, improving prover efficiency for large circuits. Published at EUROCRYPT 2023.

Used by

• HyperPlonk

Related resources

• Algebraic Methods for Interactive Proof Systems (paper, 1992)
• PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge (paper, 2019)