The Skip Ratchet
summary
Introduces a concrete construction—the Skip Ratchet—that combines hierarchical hashing and skip lists to give group key agreement properties suited to decentralized trustless settings: logarithmic-time seeks across billions of writes, backward secrecy when members join, and efficient resynchronization for long-offline clients. Multiple production implementations exist (TypeScript, Rust, Go, plus private Haskell and Elixir ports) and the design is already driving a decentralized, encrypted file system (WebNative File System) and local-first collaborative data science tooling, with real-world micropayment and payment-channel use cases.
AI-written summary · about
chapters (17)
- 0:00Start
- 1:38Uses
- 3:39Deterministic Keys in WNFS
- 5:15Hash Chains
- 5:55Pseudoradom Stream
- 9:58The Ishango Bone
- 12:52Positional Systems
- 13:51Mixed-Radix
- 14:56Compound Hash
- 16:11Deterministic Skip List
- 17:00Simplified Binary Skip Ratchet
- 18:57Deriving Secrets With Secrets
- 19:40Zeroing & Epochs
- 21:10Setup
- 24:01Limiting Ranges
- 24:58Range Access
- 25:50Takeaways
related talks
56mSecrets of the Ratchets
21mGhostor: Toward a Secure Data Sharing System from Decentralized Trust
14mNimble: Rollback Protection for Confidential Cloud Services
57mPractical Groth16 Aggregation
22mXRD: Scalable Messaging System with Cryptographic Privacy
01h 01mKey transparency: Blockchain meets NoiseSocket
15mShared Security, Coordinating the Chaos
30mCryptocurrencies and Smart Contracts
