Welcome to the resource topic for 2023/384
Title:
Origami: Fold a Plonk for Ethereum’s VDF
Authors: zhenfei zhang
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.
ePrint: https://eprint.iacr.org/2023/384
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .