Faster Verifiable Delay Function For Shorter Delay Parameter

by   Souvik Sur, et al.

A Verifiable Delay Function (VDF) is a function that takes a specified sequential time T to be evaluated, but can be verified in O(log T)-time. For meaningful security, T can be at most subexponential in the security parameter λ but has no lower bound. VDFs are useful in several applications ranging from randomness beacons to sustainable blockchains but are really rare in practice. To the best of our knowledge, the sequential effort required for verification in all the VDFs [7,9,4] known to date, is in Ω(log T). This paper proposes a verifiable delay function that requires only two sequential squaring to verify when the delay parameter is polynomially-bounded i.e., T≤𝚙𝚘𝚕𝚢(λ). Thus in our VDF, the sequential effort required for verification is fixed and independent of the security parameter.


page 1

page 2

page 3

page 4


Delay Function with Fixed Effort Verification

A Verifiable Delay Function (VDF) is a function that takes a specified (...

How Hard Are Verifiable Delay Functions?

Verifiable delay functions (VDF) are functions that enable a verifier to...

Sequential Proof-of-Work for Fair Staking and Distributed Randomness Beacons

We propose a new Proof-of-Stake consensus protocol based on a Sequential...

Managing a Queue to a Soft Delay Target

This memo proposes to transplant the core idea of Curvy RED, the softene...

Decentralizing Permissioned Blockchain with Delay Towers

Growing excitement around permissionless blockchains is uncovering its l...

On the Routing Convergence Delay in the Lightning Network

Nodes in the Lightning Network synchronise routing information through a...

Practical and Verifiable Electronic Sortition

Existing verifiable e-sortition systems are impractical due to computati...

Please sign up or login with your details

Forgot password? Click here to reset