✳flâneur — a map of the web's best reading

Verifiable Delay Functions. A brief and gentle introduction | by Ramses Fernandez | RootstockLabs: Research & Technology | Medium

medium.com · 2,647 words · saved by 1 readers

This is where the RootstockLabs team publish research focused on expanding the frontiers of decentralised technology to make Bitcoin work for everyone. Follow publication 437 Listen Share More V erifiable Delay Functions (VDFs henceforth) are a cryptographic primitive that allows a prover to show a verifier that a certain amount of time running a function was spent, and do it in a way that the verifier can check the result quickly. These functions aim to provide a minimum amount of time delay on players either knowing some piece of information or participating in the protocol in some way. VDFs do this by requiring significant computation to calculate but relatively little computation to verify, and here many people may become nostalgic and think something like “this reminds me a lot of Proof of Work” and somehow they are right: VDFs and PoW share the philosophy of “hard to compute” vs. “easy to verify”, but the main difference is that PoW is a representative for proof of parallelizable

Verifiable Delay Functions A brief and gentle introduction Ramses Fernandez 11 min read · May 20, 2021 -- Listen Share Press enter or click to view image in full size Introduction V erifiable Delay Functions (VDFs henceforth) are a cryptographic primitive that allows a prover to show a verifier that a certain amount of time running a function was spent, and do it in a way that the verifier can check the result quickly. These functions aim to provide a minimum amount of time delay on players either knowing some piece of information or participating in the protocol in some way. VDFs do this by r

Explore this link on the map →

saved by

related reading