Blink: An Optimal Proof of Proof-of-Work

Lukas Aumayr; Zeta Avarikioti; Matteo Maffei; Giulia Scaffino; Dionysis Zindros

Paper 2024/692

Blink: An Optimal Proof of Proof-of-Work

Lukas Aumayr, TU Wien

Zeta Avarikioti, TU Wien, Common Prefix

Matteo Maffei, TU Wien, Christian Doppler Laboratory Blockchain Technologies for the Internet of Things (CDL-BOT)

Giulia Scaffino, TU Wien, Christian Doppler Laboratory Blockchain Technologies for the Internet of Things (CDL-BOT), Common Prefix

Dionysis Zindros, Stanford University, Common Prefix

Abstract

Designing light clients for Proof-of-Work blockchains has been a foundational problem since Nakamoto's SPV construction in the Bitcoin paper. Over the years, communication was reduced from O(C) down to O(polylog(C)) in the system's lifetime C. We present Blink, the first provably secure O(1) light client that does not require a trusted setup.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: Blockchains Proof-of-Work Light Clients Super-Light Clients
Contact author(s): lukas aumayr @ tuwien ac at
georgia avarikioti @ tuwien ac at
matteo maffei @ tuwien ac at
giulia scaffino @ gmail com
dionyziz @ gmail com
History: 2024-05-06: revised; 2024-05-06: received; See all versions
Short URL: https://ia.cr/2024/692
License: CC BY-SA

BibTeX

@misc{cryptoeprint:2024/692,
      author = {Lukas Aumayr and Zeta Avarikioti and Matteo Maffei and Giulia Scaffino and Dionysis Zindros},
      title = {Blink: An Optimal Proof of Proof-of-Work},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/692},
      year = {2024},
      url = {https://eprint.iacr.org/2024/692}
}