Nowadays, sharding is deemed as a promising way to save traditional
blockchain protocols from their low scalability. However, such technique also
brings several potential risks and huge communication overheads. An improper
design may give rise to the inconsistent state among different committees.
Further, the communication overheads arising from cross-shard transactions
unfortunately reduce the system’s performance. In this paper, we first
summarize five essential issues that all sharding blockchain designers face.
For each issue, we discuss its key challenge and propose our suggested
solutions. In order to break the performance bottlenecks, we propose a
reputation mechanism for selecting leaders. The term of reputation in our
design reflects each node’s honest computation resources. In addition, we
introduce a referee committee and partial sets in each committee, and design a
recovery procedure in case the leader is malicious. Under the design, we prove
that malicious leaders will not hurt the system and will be evicted.
Furthermore, we conduct a series of simulations to evaluate our design. The
results show that selecting leaders by the reputation can dramatically improve
the system performance.

Go to Source of this post
Author Of this post: <a href="http://arxiv.org/find/cs/1/au:+Zhang_M/0/1/0/all/0/1">Mengqian Zhang</a>, <a href="http://arxiv.org/find/cs/1/au:+Li_J/0/1/0/all/0/1">Jichen Li</a>, <a href="http://arxiv.org/find/cs/1/au:+Chen_Z/0/1/0/all/0/1">Zhaohua Chen</a>, <a href="http://arxiv.org/find/cs/1/au:+Chen_H/0/1/0/all/0/1">Hongyin Chen</a>, <a href="http://arxiv.org/find/cs/1/au:+Deng_X/0/1/0/all/0/1">Xiaotie Deng</a>

By admin