Scaling Nakamoto Consensus to Thousands of Transactions per Second

Abstract

This paper presents Conflux, a fast, scalable and decentralized blockchain system that optimistically process concurrent blocks without discarding any as forks. The Conflux consensus protocol represents relationships between blocks as a direct acyclic graph and achieves consensus on a total order of the blocks. Conflux then, from the block order, deterministically derives a transaction total order as the blockchain ledger. We evaluated Conflux on Amazon EC2 clusters with up to 20k full nodes. Conflux achieves a transaction throughput of 5.76GB/h while confirming transactions in 4.5-7.4 minutes. The throughput is equivalent to 6400 transactions per second for typical Bitcoin transactions. Our results also indicate that when running Conflux, the consensus protocol is no longer the throughput bottleneck. The bottleneck is instead at the processing capability of individual nodes.

Cited by in corpus (37)

• A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks
• Blockchain-Empowered Socially Optimal Transactive Energy System: Framework and Implementation
• On the Construction of a Post-Quantum Blockchain for Smart City
• Deconstructing the Blockchain to Approach Physical Limits
• A Survey of State-of-the-Art on Blockchains: Theories, Modelings, and Tools
• Scalable and Probabilistic Leaderless BFT Consensus through Metastability
• SquirRL: Automating Attack Analysis on Blockchain Incentive Mechanisms with Deep Reinforcement Learning
• Implicit Model Specialization through DAG-based Decentralized Federated Learning
• Proof-of-Execution: Reaching Consensus through Fault-Tolerant Speculation
• SoK: DAG-based Consensus Protocols
• Blockclique: scaling blockchains through transaction sharding in a multithreaded block graph
• Continuous-Time Analysis of the Bitcoin and Prism Backbone Protocols
• OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems
• Rainblock: Faster Transaction Processing in Public Blockchains
• StakeDag: Stake-based Consensus For Scalable Trustless Systems
• ONLAY: Online Layering for scalable asynchronous BFT system
• Effective Scaling of Blockchain Beyond Consensus Innovations and Moore's Law
• On Analysis of the Bitcoin and Prism Backbone Protocols
• Optimal Bootstrapping of PoW Blockchains
• Consensus Mechanism Design based on Structured Directed Acyclic Graphs
• RingBFT: Resilient Consensus over Sharded Ring Topology
• SURFACE: A Practical Blockchain Consensus Algorithm for Real-World Networks
• StairDag: Cross-DAG Validation For Scalable BFT Consensus
• Eunomia: A Permissionless Parallel Chain Protocol Based on Logical Clock
• Barracuda: The Power of $\ell$-polling in Proof-of-Stake Blockchains
• Thinkey: A Scalable Blockchain Architecture
• A Survey of Blockchain Data Management Systems
• DAG-Oriented Protocols PHANTOM and GHOSTDAG under Incentive Attack via Transaction Selection Strategy
• Transaction Placement in Sharded Blockchains
• Security Analysis on Tangle-based Blockchain through Simulation
• Permissionless Blockchains and Secure Logging
• Lachesis: Scalable Asynchronous BFT on DAG Streams
• Pooling is not Favorable: Decentralize Mining Power of PoW Blockchain Using Age-of-Work
• Engineering Economics in the Conflux Network
• StreamNet: A DAG System with Streaming Graph Computing
• Fission: A Provably Fast, Scalable, and Secure Permissionless Blockchain
• Securing Parallel-chain Protocols under Variable Mining Power