🛠 using drand and timelock encryption
summary
Workshop explains how a decentralized BLS 12‑381 threshold beacon produces verifiable randomness and how that randomness becomes a clock for timelock encryption. Demos and client libs shown: JavaScript, Go, Rust, and a CLI; code examples fetch beacons by round number or wall time and watch async epochs. Two production nets exist: drand default network emits every 30s and faster network emits every 3s. Timelock encryption treats a future round as a public key and its signature as the secret needed to decrypt.
AI-written summary · about
chapters (11)
- 0:00Workshop introduction
- 0:22Workshop goals and prizes
- 1:26What is drand
- 4:57Drand vs other randomness
- 7:47Drand networks and beacon types
- 9:33Fetching drand randomness
- 11:21Drand client code walkthrough
- 13:09Timelock encryption intro
- 15:39Timelock encryption demos
- 17:25Q&A on drand and timelock
- 22:46Closing remarks
related talks
43mMr Sandman: Time Lock Puzzles for Good and Evil
20mVerifiable lotteries
15mTimelock Drive: Isolated Time-Based Defense for Storage Systems
41mEnd to End Encryption with Elixir and Beam
19mRNG and Me: A Peek Behind The Random Number Generator Curtain
41mOpening Doors with JSON Web Tokens
30mMy code is being hacked!
14mWarmup - Lockpicking