🛠 using drand and timelock encryption
summary
Decentralized drand provides verifiable, unbiasable randomness using BLS12-381 signatures; the default network emits randomness every 30 seconds/default and a fast network every 3 seconds. Time-lock encryption turns a future epoch message into a public key and its forthcoming signature into the secret, enabling ciphertext that only decrypts at a specified round; unchained beacons are required for this. Libraries (JavaScript, Go, CLI, tlog.js) plus a TimeVault demo and examples (raffles, UBI selection, MAV mitigation) are available; $2,000 prizes incentivize practical apps.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 1:00Challenges
- 1:36What is drand
- 2:57Primer of drand
- 4:08Randomness of drand
- 8:03drand networks
- 9:39drand API
- 11:28drand demo
- 13:21timelock encryption
- 14:11fancy math
- 14:26timelock
- 15:51time Vault
- 16:30Tlogjs
- 19:57Derandomizer
related talks
20mVerifiable lotteries
15mTimelock Drive: Isolated Time-Based Defense for Storage Systems
43mMr Sandman: Time Lock Puzzles for Good and Evil
19mRNG and Me: A Peek Behind The Random Number Generator Curtain
01h 01mKey transparency: Blockchain meets NoiseSocket
51mEndrun - Secure Digital Communications for Our Modern Dystopia
50mIdentity & Trust in Monitored Spaces
25mCryptography Isn't Scary