Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma
summary
Paper proves there is no perfect Plasma: any off‑chain plasma protocol must either incur large exit sizes or allow non‑uniquely attributable mass exits. Under communication locality and a 2n+1 party construction (total on‑chain funds 2n) adversary withholds data from n parties, forcing either Bob‑style large exits or simultaneous mass exits; the lower bound uses entropy of a random corrupted subset so describing who must be blocked requires large on‑chain communication. Practically this explains seven‑day exit timeouts.
AI-written summary · about
chapters (9)
- 0:00Start
- 0:23Motivation
- 1:43What Is Blockchain
- 3:09Plasma Protocols
- 3:49Content and Overview
- 7:35Protocol Called Timestamping as a Service
- 13:27The Main Features of Plasma Protocols
- 16:04Mass Exits
- 17:12Exit Challenges
related talks
38mLower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma c
30mOn the Optimal Round Complexity of Multi-Party Computation in the Plain Model
30mCan Private Proof-of-Stake Blockchains Obtain All of Safety, Liveness, and Privacy?
31mBroadcast Optimal Multi-Party Computation
32mSoK: Private Programmability on Blockchain Systems
01h 00mThe Path to Shielded Programmability
52mGame-Theoretically Secure Protocols Inspired by Blockchains
01h 03mClosing Keynote Day 2