PBFT and Blockchains
summary
Describes how Practical Byzantine Fault Tolerance becomes a usable replication engine: it uses 3f+1 replicas, an extra pre-prepare phase and cryptographic certificates to produce a tamper-evident log that orders client calls (logs act as immutable ledgers). Proposes a cross-chain deal protocol that writes escrow, transfer and commit votes to a certified blockchain (CBC); commits carry CBC state proofs signed by replica keys so contracts can trust outcomes. Design favors safety over liveness, requires a single agreed CBC and protected replica keys.
AI-written summary · about
chapters (24)
- 0:00Introduction
- 3:15Byzantine Fault Tolerance
- 6:00Remote File Systems
- 7:21Replication
- 14:32Crosschain deals
- 15:07Miguels thesis
- 16:16Recent work
- 17:17Atomic transactions
- 18:10Acceptable outcomes
- 18:36Carol gets the ticket
- 18:54Crosschain swaps
- 19:33Escrow
- 23:13Shared Resource
- 23:53Certified Blockchain
- 27:06Passive Blockchain
- 31:51Exchange Rate
- 33:46The Problem
- 36:47The Participants
- 41:46Fault Tolerance
- 45:01Sharding
- 45:38What is F really
- 46:11F replicas
- 50:06Application latency
- 51:51Block chains
related talks
17mThe Bedrock of Byzantine Fault Tolerance: A Unified Platform for BFT Protocols...
15mAlea-BFT: Practical Asynchronous Byzantine Fault Tolerance
54mDistributed Trust: Is “Blockchain” the answer?
25mEnhancing Bitcoin Security and Performance with Strong Consistency via...
42mBeyond Blockchain: Convergent Consensus
43mAll Together Now: An Introduction to Distributed Consensus
47mCant we just agree
18mChitu: Avoiding Unnecessary Fallback in Byzantine Consensus