IACR News item: 24 March 2023
zhenfei zhang
ePrint Report
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.
Additional news items may be found on the IACR news page.