Verifiable Luck

on YouTube ↗35m

" summary

Defines verifiable random functions as a PRF glued to a signature and stresses the danger of leaking the pre-output (developers misuse it); gives concrete instantiations: RSA-FDH, BLS, and Schnorr-style Fiat‑Shamir transforms with hash-to-curve; proposes anonymized VRF via linkable ring/group signatures and shows it fits into a SNARK at around ~3000 constraints; demos real uses: verifiable card draws (infinite-deck go‑fish model), NSEC5 for DNS privacy, Polkadot sharding, and unique-account identity proofs.

AI-written summary · about

" chapters (18)

1. 0:00Intro
2. 0:17What are verifiable random functions
3. 2:18Building verifiable random functions
4. 7:08Card games
5. 7:50Drawing cards
6. 9:11Evolving the turn seed
7. 9:59Intuition
8. 11:09Examples
9. 12:07Real Protocol
10. 14:45Go Fish
11. 16:06Open Conflict
12. 16:29Polkadot
13. 18:49Revealing Information
14. 20:24Signature Schemes
15. 22:13An anonymized VRF
16. 23:18Identity Systems
17. 23:50W3C
18. 27:35Conclusion

" related talks

• 16mRandomness in your Smart ContractsAnush Vijayaraghavan · Smart Contract Summit #1 2021
• 01h 00mDecentralized Randomness ProtocolsAparna Krishnan · Web3 Summit 2018
• 58mBlockchains and Publicly-Verifiable LotteriesJoseph Bonneau · Blockchain in Society: Applications, Economics, Law, and Ethics 2019
• 01h 01mDerandomization: A Quick TutorialLijie Chen · Minimal Complexity Assumptions for Cryptography 2023
• 39mPrivacy and Evolution of SNARKsAriel G. Gabizon, Lucas Nuzzi, Eugene Leventhal, Aleksandr Vlasov · Smart Contract Summit #1 2021
• 15mWhy TRULY Random Keys Are CRITICAL (and How Quantum Dice Fixes It)Ramy Shelbaya · IoTSF Conference 2024
• 01h 09mCrypto + ML 1Shafi Goldwasser · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 11mTalk by Alex Lombardi (Princeton University)Alex Lombardi · Proofs (Simons Institute)