References

Further Reads

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 a trusted setup. Cryptology ePrint Archive, Report 2019/1021, 2019.

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

Abhiram Kothapalli, Srinath Setty, and Ioanna Tzialla. Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. In CRYPTO, 2022

Nova benchmarks, https://hackmd.io/0gVClQ9IQiSXHYAK0Up9hg?view

Justin Drake. ZK Whiteboard Sessions – Module Fourteen: Nova Crash Course with Justin Drake. https://www.youtube.com/watch?v=SwonTtOQzAk&list, 2022.

https://zkresear.ch/t/towards-a-nova-based-zk-vm/105

Abhiram Kothapalli and Srinath Setty. SuperNova: Proving universal machine executions without universal circuits, https://eprint.iacr.org/2022/1758.pdf, Dec 2022.

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

Abhiram Kothapalli and Srinath Setty. HyperNova: Recursive arguments for customizable constraint systems, https://eprint.iacr.org/2023/573.pdf, April 2023.