Paper 2023/384
Origami: Fold a Plonk for Ethereum’s VDF
Abstract
We present Origami verifiable delay function, build from the MinRoot hash and our dedicated plonk proof system that utilizes a tai- lored custom gate and a folding scheme. MinRoot VDF is the leading candidate for Ethereum adoption. For N iterations of MinRoot hash func- tion, the overall cost of Origami is N +o(N ) group operations; improving the previous best known result of 6N from a Nova based solution. The proof size is 128k + 224 bytes if we fold the proofs for k times; and may be further reduce to around 960 bytes, regardless of k, via a standard recursive prover.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Verifiable delay functionZero-knowledge proofsMinRoot Hash
- Contact author(s)
- zhenfei zhang @ hotmail com
- History
- 2023-03-24: approved
- 2023-03-17: received
- See all versions
- Short URL
- https://ia.cr/2023/384
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/384,
author = {zhenfei zhang},
title = {Origami: Fold a Plonk for Ethereum’s VDF},
howpublished = {Cryptology ePrint Archive, Paper 2023/384},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/384}},
url = {https://eprint.iacr.org/2023/384}
}
