# Nova: Recursive Zero-Knowledge Arguments from Folding Schemes Content type: Research Paper Summary: Nova is a novel recursive zero-knowledge proof system designed to efficiently verify an arbitrary number of computations. It builds upon the concept of recursive proofs, allowing a proof of a computation to itself be part of a subsequent computation, thus enabling the verification of an unbounded number of steps. The key innovation in Nova is its use of a 'folding scheme' which combines multiple instances of a computation into a single, smaller instance. This folding process is executed within a Key concepts: Abhiram Kothapalli, Srinath Setty, Ioanna Tzialla, zero-knowledge proof, recursion, folding scheme, scalability, snark, plonk, recursive proof
Paperexpert

Nova: Recursive Zero-Knowledge Arguments from Folding Schemes

Abhiram Kothapalli, Srinath Setty, Ioanna Tzialla

IACR ePrint ArchiveJanuary 2021

Abstract

Nova is a novel recursive zero-knowledge proof system designed to efficiently verify an arbitrary number of computations. It builds upon the concept of recursive proofs, allowing a proof of a computation to itself be part of a subsequent computation, thus enabling the verification of an unbounded number of steps. The key innovation in Nova is its use of a 'folding scheme' which combines multiple instances of a computation into a single, smaller instance. This folding process is executed within a zero-knowledge framework, specifically using a variant of the Nova protocol that relies on the PLONK proof system. Nova achieves a constant-time overhead for each step of the recursion, independent of the complexity of the computation being verified. This makes it exceptionally well-suited for scaling blockchains by enabling efficient batching and verification of off-chain computations. The system's ability to reduce large computation chains into a single verifiable proof with minimal overhead marks a significant advancement in the scalability and efficiency of zero-knowledge proofs for distributed ledgers.

Key Findings

  • 1Nova introduces a recursive proof system that enables the verification of an unbounded sequence of computations.
  • 2It employs a novel folding scheme to combine multiple computation instances into a single, smaller instance, reducing verification overhead.
  • 3Nova achieves constant-time overhead per recursive step, making it highly scalable for blockchain applications.
  • 4The system leverages PLONK and other cryptographic primitives to construct efficient and verifiable proofs of computation.

Topics

zero-knowledge proofrecursionfolding schemescalabilitysnarkplonkrecursive proof
Download / View

Citation

Abhiram Kothapalli, Srinath Setty, Ioanna Tzialla (2021). Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. IACR ePrint Archive. https://eprint.iacr.org/2021/370.pdf

BibTeX

@misc{novarecursive2021,
  title = {Nova: Recursive Zero-Knowledge Arguments from Folding Schemes},
  author = {Abhiram Kothapalli and Srinath Setty and Ioanna Tzialla},
  year = {2021},
  howpublished = {\url{https://eprint.iacr.org/2021/370.pdf}},
}

Knowledge Explorer

Explore Related Concepts

See how Nova: Recursive Zero-Knowledge Arguments from Folding Schemes connects to glossary terms, books, and other research in the Knowledge Graph.

Explore Connections