Ladder: A Convergence-based Structured DAG Blockchain for High Throughput and Low Latency
summary
A structured twin-chain DAG named Ladder imposes regular convergence points so an upper chain runs parallel PoW block production while a designated convergence node produces lower-chain blocks that sort forks and permanently order transactions. A dynamic BFT committee forms to create super blocks when conflicting or missing lower-chain blocks appear. Implementation runs on 18 servers (80–120 ms latency, PoW difficulty 18) and reports ~4,500 TPS, a 59.6% throughput gain and ~20.9% latency reduction versus prior DAG designs.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 3:34Dual-chain architecture
- 7:04Round operation
- 9:13Lower chain conflicts
- 12:03BFT committee settings
- 13:51Performance results
- 15:37Security analysis
- 16:18Conclusion
related talks
30mChainweb: A Parallel chain Architecture for Massive Throughput
22mA Decentralized Blockchain with High Throughput and Fast Confirmation
01h 12mScaling distributed ledgers: Achieving arbitrary throughput and sub-second latency
23mScaling Wars: The Race to Speed Up On-Chain Infrastructure
55mUntangling the BlockDAG
24mState of Blockchain
02h 44mBlockchain consensus mechanisms
29mBuilding Probabilistic BFT Protocols Through Subsampled Voting