References

Paul Valiant. Incrementally verifiable computation or proofs of knowledge imply time/space efficiency. In TCC, pages 552–576, 2008

Sean Bowe, Jack Grigg, and Daira Hopwood. Halo: Recursive proof composition without t a Trusted Setup

Binyi Chen et al. “HyperPlonk: Plonk with Linear-Time Prover and HighDegree Custom Gates”. In: IACR Cryptol. ePrint Arch. 2022 (2022), p. 1355

Sam Green and Jackson Blazensky. Introduction to the Sum-Check Protocol. https://semiotic.ai/articles/Sumcheck-tutorial/, June 2022.

Omer Shlomovits. Hardware-friendliness of HyperPlonk, https://medium.com/@ingonyama/hardware-friendliness-of-hyperplonk-491d8c86605, Dec 2022