pith. sign in

arxiv: 1805.03870 · v4 · pith:C5RHXXFUnew · submitted 2018-05-10 · 💻 cs.DC

Scaling Nakamoto Consensus to Thousands of Transactions per Second

classification 💻 cs.DC
keywords confluxconsensustransactionsblocksorderthroughputachievesblockchain
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. StakeDag: Stake-based Consensus For Scalable Trustless Systems

    cs.DC 2019-07 unverdicted novelty 5.0

    StakeDag introduces a stake-weighted consensus protocol S_φ for leaderless asynchronous DAGs to achieve pBFT by treating stake as validating weights in a system separating users and validators.