Cryptology ePrint Archive: Report 2020/190

Proof of Necessary Work: Succinct State Verification with Fairness Guarantees

Assimakis Kattis and Joseph Bonneau

Abstract: Blockchain-based payment systems utilize an append-only log of transactions whose correctness can be verified by any observer. In almost all of today’s implementations, verification costs grow linearly in either the number of transactions or blocks in the blockchain (often both). We propose a new distributed payment system which uses Incrementally Verifiable Computation (IVC) to enable constant-time verification. Since generating the succinct proofs needed to verify correctness is more expensive, we introduce the notion of Proof of Necessary Work (PoNW), in which proof generation is an integral part of the proof-of-work used in Nakamoto consensus, effectively producing proofs using energy that would otherwise be wasted. We implement and benchmark a prototype of our system using recent recursive SNARK-based constructions, enabling stateless “light” clients to efficiently verify the entire blockchain history in about 40 milliseconds.

Category / Keywords: cryptographic protocols / proof-of-work, consensus, IVC, zk-snarks

Date: received 15 Feb 2020, last revised 16 Feb 2020

Contact author: kattis at cs nyu edu

Available format(s): PDF | BibTeX Citation

Version: 20200218:090750 (All versions of this report)

Short URL: ia.cr/2020/190


[ Cryptology ePrint archive ]