CycLedger: A Scalable and Secure Parallel Protocol for Distributed Ledger via Sharding

01/19/2020
by   Mengqian Zhang, et al.
0

Traditional public distributed ledgers have not been able to scale-out well and work efficiently. Sharding is deemed as a promising way to solve this problem. By partitioning all nodes into small committees and letting them work in parallel, we can significantly lower the amount of communication and computation, reduce the overhead on each node's storage, as well as enhance the throughput of distributed ledger. Existing sharding-based protocols still suffer from several serious drawbacks. The first thing is that all honest nodes must connect well with each other, which demands a huge number of communication channels in the network. Moreover, previous protocols have face great loss in efficiency in the case where the honesty of each committee's leader is in question. At the same time, no explicit incentive is provided for nodes to actively participate in the protocol. We present CycLedger, a scalable and secure parallel protocol for distributed ledger via sharding. Our protocol selects a leader and a partial set for each committee, who are in charge of maintaining intra-shard consensus and communicating with other committees, to reduce the amortized complexity of communication, computation and storage on all nodes. We introduce a novel commitment scheme between committees and a recovery procedure to prevent the system from crashing even when leaders of committees are malicious. To add incentive for the network, we use the concept of reputation, which measures each node's computing power. As nodes with higher reputation receive more rewards, there is an encouragement for nodes with strong computing ability to work honestly so as to gain reputation. In this way, we strike out a new path to establish scalability, security and incentive for the sharding-based distributed ledger.

READ FULL TEXT
research
02/27/2012

Protocols for Learning Classifiers on Distributed Data

We consider the problem of learning classifiers for labeled data that ha...
research
01/12/2021

Time and Communication Complexity of Leader Election in Anonymous Networks

We study the problem of randomized Leader Election in synchronous distri...
research
03/10/2022

State-Machine Replication Scalability Made Simple (Extended Version)

Consensus, state-machine replication (SMR) and total order broadcast (TO...
research
12/31/2021

An Efficient and Robust Committee Structure for Sharding Blockchain

Nowadays, sharding is deemed as a promising way to save traditional bloc...
research
02/22/2023

IRS: An Incentive-compatible Reward Scheme for Algorand

Founded in 2017, Algorand is one of the world's first carbon-negative, p...
research
03/17/2020

PigPaxos: Devouring the communication bottlenecks in distributed consensus

Paxos family of protocols are employed by many cloud computing services ...
research
04/22/2023

Pipeline MoE: A Flexible MoE Implementation with Pipeline Parallelism

The Mixture of Experts (MoE) model becomes an important choice of large ...

Please sign up or login with your details

Forgot password? Click here to reset