Cryptology ePrint Archive: Report 2015/1168

SCP: A Computationally-Scalable Byzantine Consensus Protocol For Blockchains

Loi Luu and Viswesh Narayanan and Kunal Baweja and Chaodong Zheng and Seth Gilbert and Prateek Saxena

Abstract: In this paper, we design a new blockchain Byzantine consensus protocol SCP where the throughput scales nearly linearly with the computation: the more computing power available, the more blocks selected per unit time. SCP is also efficient that the number of messages it requires is nearly linear in the network size. The {\em computational scalability} property offers the flexibility to tune bandwidth consumption by adjusting computational parameters (e.g. proof-of-work difficulty). The key ideas lie in securely establishing identities for network participants, randomly placing them in several committees and running a classical consensus protocol within each committee to propose blocks in {\em parallel}. We further design a mechanism to allow reaching consensus on blocks without broadcasting actual block data, while still enabling efficient block verification. We prove that our protocol is secure, efficient and applicable to several case studies. We conduct scalability experiments on Amazon EC2 with upto 80 cores, and confirm that SCP matches its theoretical scaling properties.

Category / Keywords: consensus protocol, byzantine agreement, cryptocurrency

Date: received 4 Dec 2015, last revised 13 Dec 2015, withdrawn 22 Aug 2016

Contact author: loiluu at comp nus edu sg

Available format(s): (-- withdrawn --)

Note: add acknowledgement section

Version: 20160823:024020 (All versions of this report)

Short URL: ia.cr/2015/1168

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]