TY - GEN
T1 - PolyShard
T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020
AU - Li, Songze
AU - Yu, Mingchao
AU - Yang, Chien Sheng
AU - Avestimehr, A. Salman
AU - Kannan, Sreeram
AU - Viswanath, Pramod
N1 - Funding Information:
This material is based upon work supported by the Distributed Technology Research Foundation, Input-Output Hong Kong, the National Science Foundation under grants CCF-1705007, CCF-1763673 and CCF-1703575, and the Army Research Office under grant W911NF1810332. This material is also based upon work supported by Defense Advanced Research Projects Agency (DARPA) under Contract No. HR001117C0053. The views, opinions, and/or findings expressed are those of the authors and should not be interpreted as representing the official views or policies of the Department of Defense or the U.S. Government.
Publisher Copyright:
© 2020 IEEE.
PY - 2020/6
Y1 - 2020/6
N2 - Today's blockchain designs suffer from a trilemma claiming that no blockchain system can simultaneously achieve decentralization, security, and performance scalability. For current blockchain systems, as more nodes join the network, the efficiency of the system (computation, communication, and storage) stays constant at best. A leading idea for enabling blockchains to scale efficiency is the notion of sharding: different subsets of nodes handle different portions of the blockchain, thereby reducing the load for each individual node. However, existing sharding proposals achieve efficiency scaling by compromising on trust - corrupting the nodes in a given shard will lead to the permanent loss of the corresponding portion of data. In this paper, we settle the trilemma by demonstrating a new protocol for coded storage and computation in blockchains. In particular, we propose PolyShard: "polynomially coded sharding" scheme that achieves information-theoretic upper bounds on the efficiency of the storage, system throughput, as well as on trust, thus enabling a truly scalable system.
AB - Today's blockchain designs suffer from a trilemma claiming that no blockchain system can simultaneously achieve decentralization, security, and performance scalability. For current blockchain systems, as more nodes join the network, the efficiency of the system (computation, communication, and storage) stays constant at best. A leading idea for enabling blockchains to scale efficiency is the notion of sharding: different subsets of nodes handle different portions of the blockchain, thereby reducing the load for each individual node. However, existing sharding proposals achieve efficiency scaling by compromising on trust - corrupting the nodes in a given shard will lead to the permanent loss of the corresponding portion of data. In this paper, we settle the trilemma by demonstrating a new protocol for coded storage and computation in blockchains. In particular, we propose PolyShard: "polynomially coded sharding" scheme that achieves information-theoretic upper bounds on the efficiency of the storage, system throughput, as well as on trust, thus enabling a truly scalable system.
UR - http://www.scopus.com/inward/record.url?scp=85090421899&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85090421899&partnerID=8YFLogxK
U2 - 10.1109/ISIT44484.2020.9174305
DO - 10.1109/ISIT44484.2020.9174305
M3 - Conference contribution
AN - SCOPUS:85090421899
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 203
EP - 208
BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 21 July 2020 through 26 July 2020
ER -