Scaling Bitcoin to Physical Limits
summary
Claims a way to provably scale Bitcoin by splitting blocks into separate roles: proposal blocks, many parallel voter chains (e.g. 1,000) and separate transaction blocks, using randomized sortition so adversary cannot bias votes. Theorems show throughput ≈ C·(1−β) (capacity minus adversary share) and latency ≈ O(D + (D/M)·log(1/ε)). A Rust prototype on ~100 AWS nodes runs at 70,000 tps with ~23 second confirmation and shows the design works under real-network conditions.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 2:05Bitcoin scalability issues
- 3:47Nakamoto blockchain analysis
- 7:45Constraints of the current model
- 16:32Deconstructing the protocol
- 24:37The mechanism of Prism
- 30:24Increasing system throughput
- 33:49Security theorems and results
- 39:25Confirmation intuition
- 47:11Demo and implementation
related talks
29mMonoxide: Scale out Blockchains with Asynchronous Consensus Zones
01h 12mScaling distributed ledgers: Achieving arbitrary throughput and sub-second latency
54mDistributed Trust: Is “Blockchain” the answer?
34mScaling Monero
01h 11mDemystifying Bitcoin
49mScaling Tezos with rollups
25mEnhancing Bitcoin Security and Performance with Strong Consistency via...
24mValidity and the future of blockchains