PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge,, Aug 2019


What is SHPLONK? - Sin7Y Tech Review (11), HackerNoon., Oct 2021.


Dan Boneh, Justin Drake, Ben Fisch, Ariel Gabizon: Efficient polynomial commitment schemes for multiple points and polynomials. IACR Cryptology. ePrint Archive,, 2020.


Sean Bowe, Jack Grigg, and Daira Hopwood. Halo: Recursive proof composition without a trusted setup. Cryptology ePrint Archive, Report 2019/1021, 2019.


Dan Boneh, Justin Drake, Ben Fisch, and Ariel Gabizon. Halo Infinite: Recursive zk-SNARKs from any Additive Polynomial Commitment Scheme. In CRYPTO, 2021.


Binyi Chen, Benedikt B¨unz, Dan Boneh, and Zhenfei Zhang. Hyperplonk: Plonk with linear-time prover and high-degree custom gates. In EUROCRYPT, 2023.


Kate, A., Zaverucha, G.M., Goldberg, I. (2010). Constant-Size Commitments to Polynomials and Their Applications. In: Abe, M. (eds) Advances in Cryptology - ASIACRYPT 2010. ASIACRYPT 2010. Lecture Notes in Computer Science, vol 6477. Springer, Berlin, Heidelberg.

Last updated