Verifiable Delay Functions

[4meta5]

This is an emerging cryptographic primitive common to modern consensus protocols.

metalink

• On Verifiable Delay Functions (blog post)

[4meta5]

Verifiable Delay Functions from Supersingular Isogenies

• Verifiable Delay Functions from SupersingularIsogenies and Pairings, relevant slides from main author
• A note on isogeny-based hybrid verifiable delay functions
• w3f/isogenies_vdf_uses

python impl of a note on ...

[4meta5]

Continuous Verifiable Delay Functions VDFs let someone quickly check that you ran a slow function n times. But checking a sequence of (n runs->proof->m run->proof) was twice as hard. cVDFs fix this while still using an efficient RSA construction. src

It's an interesting adjustment to Pietrzak's proof, and final section is interesting, but an isogenies VDF gives this for free. And you can optimize arithmetic for a bespoke 1500 bit prime way easier than for an RSA modulus. ~ jeff burdge's response

[4meta5]

...use in BABE

Abstractions from the rust filecoin proofs are also interesting