Paper 2025/1054
Rewardable Naysayer Proofs
, IMDEA Software, Technical University of Denmark, Sapienza University of RomeAbstract
Combining verifiable computation with optimistic approaches is a promising direction to scale blockchain applications. The basic idea consists of saving computations by avoiding the verification of proofs unless there are complaints. A key tool to design systems in the above direction has been recently proposed by Seres, Glaeser and Bonneau [FC'24] who formalized the concept of a Naysayer proof: an efficient to verify proof disproving a more demanding to verify original proof. In this work, we discuss the need of rewarding naysayer provers, the risks deriving from front-running attacks, and the failures of generic approaches trying to defeat them. Next, we introduce the concept of verifiable delayed naysayer proofs and show a construction leveraging proofs of sequential work, without relying on any additional infrastructure.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Financial Cryptography and Data Security 2025
- Keywords
- rollupsfront-runningnaysayer proofs
- Contact author(s)
-
avitabilegenn @ gmail com
luisi @ dtu dk
ivan visconti @ uniroma1 it - History
- 2025-06-06: approved
- 2025-06-05: received
- See all versions
- Short URL
- https://ia.cr/2025/1054
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1054,
author = {Gennaro Avitabile and Luisa Siniscalchi and Ivan Visconti},
title = {Rewardable Naysayer Proofs},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1054},
year = {2025},
url = {https://eprint.iacr.org/2025/1054}
}
