References

[GWC19]

PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge, https://eprint.iacr.org/2019/953, Aug 2019

[SHPlonk]

What is SHPLONK? - Sin7Y Tech Review (11), HackerNoon. https://hackernoon.com/what-is-shplonk-sin7y-tech-review-11, Oct 2021.

[BDFG20]

Dan Boneh, Justin Drake, Ben Fisch, Ariel Gabizon: Efficient polynomial commitment schemes for multiple points and polynomials. IACR Cryptology. ePrint Archive, https://eprint.iacr.org/2020/081.pdf, 2020.

[BGH19]

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

[Haloinfinite21]

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

[Hyperplonk]

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

[KZG10]

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. https://doi.org/10.1007/978-3-642-17373-8_11