Skip to main content

​
Halo: Recursive Proof Composition without a Trusted Setup

The Halo paper introduces a transformative approach to recursive proof composition, addressing one of the most critical challenges in zero-knowledge scalability

​
Abstract

The Halo paper introduces a transformative approach to recursive proof composition, addressing one of the most critical challenges in zero-knowledge scalability: the need for trusted setups. By utilizing an innovative technique involving inner-product arguments and the folding of polynomial commitments, Halo enables the aggregation of proofs without the recursive overhead typically associated with cycle-of-curves constructions. This allows for the verification of an arbitrary number of prior proofs within a single instance, facilitating highly efficient transaction batching and rollups. The research provides a rigorous framework for maintaining proof integrity throughout recursive iterations while mitigating the security risks inherent in structured reference string generation. This advancement is fundamental to modern blockchain scalability research, as it provides a path toward succinct verification of massive transaction histories. The paper demonstrates that cryptographic trust can be decoupled from proof generation, setting a new benchmark for trustless, scalable, and verifiable computation in decentralized networks. Authors: Sean Bowe, Jack Grigg, Daira Hopwood Publication: IACR ePrint Archive Publication date: 2019-01-01

​
Key findings

  • Enables recursive proof composition without requiring a trusted setup.
  • Uses a novel polynomial commitment scheme to aggregate proofs efficiently.
  • Reduces verification costs for complex state transitions in blockchains.
  • Demonstrates robustness against security threats associated with ceremony-based proof systems.

​
Citation

Sean Bowe, Jack Grigg, Daira Hopwood (2019). Halo: Recursive Proof Composition without a Trusted Setup. IACR ePrint Archive. https://eprint.iacr.org/2019/1021
Canonical knowledge ID: research:halo-recursive-proof-composition-without-a-trusted-setup