International Association for Cryptologic Research

International Association
for Cryptologic Research


Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments

Ben Fisch , Stanford University
Dan Boneh , Stanford University
Ariel Gabizon , Aztec
Justin Drake , Ethereum Foundation
DOI: 10.1007/978-3-030-84242-0_23 (login may be required)
Search ePrint
Search Google
Conference: CRYPTO 2021
Abstract: Polynomial commitment schemes (PCS) have recently been in the spotlight for their key role in building SNARKs. A PCS provides the ability to commit to a polynomial over a finite field and prove its evaluation at points. A *succinct* PCS has commitment size and evaluation proof size sublinear in the degree of the polynomial. An *efficient* PCS has sublinear proof verification. Any efficient and succinct PCS can be used to construct a SNARK with similar security and efficiency characteristics (in the random oracle model). Proof-carrying data (PCD) enables a set of parties to carry out an indefinitely long distributed computation where every step along the way is accompanied by a proof of correctness. It generalizes *incrementally verifiable computation* and can even be used to construct SNARKs. Until recently, however, the only known method for constructing PCD required expensive SNARK recursion. A system called *Halo* first demonstrated a new methodology for building PCD without SNARKs, exploiting an aggregation property of the *Bulletproofs* inner-product argument. The construction was *heuristic* because it makes non-black-box use of a concrete instantiation of the Fiat-Shamir transform. We expand upon this methodology to show that PCD can be (heuristically) built from any homomorphic polynomial commitment scheme (PCS), even if the PCS evaluation proofs are neither succinct nor efficient. In fact, the Halo methodology extends to any PCS that has an even more general property, namely the ability to aggregate linear combinations of commitments into a new succinct commitment that can later be opened to this linear combination. Our results thus imply new constructions of SNARKs and PCD that were not previously described in the literature and serve as a blueprint for future constructions as well.
Video from CRYPTO 2021
  title={Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments},
  author={Ben Fisch and Dan Boneh and Ariel Gabizon and Justin Drake},