TY - GEN
T1 - Mitigating bitcoin node storage size by DHT
AU - Abe, Ryosuke
AU - Suzuki, Shigeya
AU - Murai, Jun
N1 - Publisher Copyright:
© 2018 ACM.
PY - 2018/11/12
Y1 - 2018/11/12
N2 - A type of Bitcoin node called “Full Node” has to hold the entire of historical transaction data called “Blockchain” to verify that new transactions are correct or not. To operate nodes as Full Nodes, the required storage size will be too large for resource-constrained devices. In this paper, to mitigate storage size, we propose a storage load balancing scheme by distributed storage based on Distributed Hash Table (DHT). By our scheme, nodes in a DHT cluster can behave like Full Nodes without holding the entire of the blockchain.
AB - A type of Bitcoin node called “Full Node” has to hold the entire of historical transaction data called “Blockchain” to verify that new transactions are correct or not. To operate nodes as Full Nodes, the required storage size will be too large for resource-constrained devices. In this paper, to mitigate storage size, we propose a storage load balancing scheme by distributed storage based on Distributed Hash Table (DHT). By our scheme, nodes in a DHT cluster can behave like Full Nodes without holding the entire of the blockchain.
KW - Bitcoin
KW - Blockchain
KW - Distributed Hash Table
KW - Storage
UR - http://www.scopus.com/inward/record.url?scp=85059007471&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85059007471&partnerID=8YFLogxK
U2 - 10.1145/3289166.3289169
DO - 10.1145/3289166.3289169
M3 - Conference contribution
AN - SCOPUS:85059007471
T3 - Asian Internet Engineering Conference, AINTEC 2018
SP - 17
EP - 23
BT - Asian Internet Engineering Conference, AINTEC 2018
PB - Association for Computing Machinery, Inc
T2 - 14th Asian Internet Engineering Conference, AINTEC 2018
Y2 - 12 November 2018 through 14 November 2018
ER -