Introduction to Verifiable Delay Functions (VDFs) with Joseph Bonneau | a16z crypto research talks

TL;DR

Verifiable Delay Functions (VDFS) prevent front-running & have various proofs ensuring delayed solutions under cryptographic primitives.

Transcript

uh so welcome to this afternoon's um a6 crypto research seminar uh very happy um that we'll be having jovano just joined as a research partner the research team uh last week and he's going to be telling us about a very important cryptographic primitive which he co-invented verifiable delay functions so joe it's all yours this talk is going to be as... Read More

Key Insights

• 👊 VDFS are cryptographic primitives ensuring delayed computations to prevent front-running attacks.
• ❓ Different proofs, like Wesolowski's and Peter Zack's, provide efficient and secure methods for validating delayed computations in VDFS.
• 🧡 Various applications of VDFS range from front-running prevention to watermarking and other cryptographic schemes.
• ❓ Efforts are being made to develop efficient verifiers and practical implementations of VDFS for different hardware platforms.
• 👊 Considerations like changing the parameter t and protecting against grinding attacks are essential in designing and implementing VDFS securely.
• 🧚 The importance of ensuring fair distribution of ASICs to prevent unequal computational advantages and maintain security in VDFS applications.
• 👻 The iterative nature of VDFS computations and proofs allows for detailed validation and secure delayed solutions in cryptographic schemes.

Questions & Answers

Q: What are VDFS primarily used for?

VDFS are mainly utilized to prevent front-running in transactions and other blockchain applications by ensuring delayed computations and verifiable proofs.

Q: How does Wesolowski's proof work for VDFS?

Wesolowski's proof involves using a random prime number to check midway point validation for verifying the correctness of large sequential computations in VDFS.

Q: What is the significance of Peter Zack's proof for VDFS?

Peter Zach's proof breaks down large exponents into midpoints for recursive validation, providing an efficient and intuitive method for verifying delayed computations in VDFS.

Q: How can VDFS be applied to watermarking schemes?

VDFS can be used for watermarking by embedding the prover's identity into the proof, ensuring authenticity and preventing manipulation in cryptographic schemes.

Summary & Key Takeaways

• VDFS is a cryptographic primitive ensuring delayed computations to prevent front-running or manipulation.

• Two main proofs for VDFS: Wesolowski's uses random prime for checking, while Peter Zack's breaks computation into midpoints for recursive validation.

• Applications of VDFS range from front-running prevention to watermarking and more.