Verifable Delay Functions (paper)
eprint.iacr.org · 9,303 words · saved by 1 readers
N/A
Verifiable Delay Functions Dan Boneh1 , Joseph Bonneau2 , Benedikt Bünz1 , and Ben Fisch1 1 Stanford University 2 New York University June 26, 2019 Abstract We study the problem of building a verifiable delay function (VDF). A VDF requires a specified number of sequential steps to evaluate, yet produces a…
saved by
related reading
- Verifiable Delay Functions. A brief and gentle introduction | by Ramses Fernandez | RootstockLabs: Research & Technology | Mediummedium.com
- 370.pdfeprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- [2305.09032] Time is Money: Strategic Timing Games in Proof-of-Stake Protocolsarxiv.org
- Towards a Theory of Maximal Extractable Value II: Uncertaintyarxiv.org
- thesis.pdfaayushg.com
- [2606.05433] Zero knowledge verification for frontier AI training is possiblearxiv.org
- ants.dvicrypto.stanford.edu
- Timing Games in Responsive Consensus Protocolsarxiv.org
- STARK-paper.pdfstarkware.co
- 1482.pdfeprint.iacr.org