A Decentralized Blockchain with High Throughput and Fast Confirmation
summary
Conflux implements a production Rust blockchain and EVM on Amazon EC2 and demonstrates on up to 12,000 full nodes that the novel Tree-Graph ledger plus the greedy heaviest adaptive sub-tree consensus achieves 9.6 Mbps block throughput (≈3,480 TPS on a mixed workload) and median confirmation under one minute. The system uses a timer chain to get trusted generation times, a Ninka-tree structure to keep subtree weights cheaply, adaptive weighted blocks to resist liveness attacks, and deferred execution to avoid redundant work.
AI-written summary · about
chapters (17)
- 0:00Intro
- 0:22An Ideal Blockchain System
- 1:02Blockchain Performance Problem
- 1:38Bitcoin and Ethereum Background
- 2:58Standard Nakamoto Consensus
- 5:01Longest Chain is Not Safe with Fast Generation fork
- 5:28GHOST Consensus
- 6:46GHOST is Weak to Liveness Attacks
- 8:20One Fix: Structured GHOST Approach
- 9:51Greedy Heaviest Adaptive SubTree (GHAST)
- 12:11Determine Weights from Past Sub-graphs
- 14:04Trusted Block Generation Time: TimerChain
- 15:30Conflux Ordering Algorithm
- 17:06Implementation & Optimizations
- 19:22Experimental Environment
- 19:49Throughput, Latency, and Scalability
- 21:36Conclusion
related talks
20mChina’s Blockchain Policy Shifts and Future Prospects
42mBeyond Blockchain: Convergent Consensus
42mThe CDelta Cryptocurrency Platform
24mState of Blockchain
16mDispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks
11mBuilding the First Real-Time Blockchain
27mInterPlanetary Consensus
01h 12mScaling distributed ledgers: Achieving arbitrary throughput and sub-second latency