With the development of blockchain, the huge history data limits the scalability of the blockchain. This paper proposes to downsample these data to reduce the storage overhead of nodes. These nodes keep good independency, if downsampling follows the entropy of blockchain. Moreover, it demonstrates that the entire blockchain history can be efficiently recovered through the cooperative decoding of a group of nodes like fountain codes, if reserved data over these nodes obey the soliton distribution. However, these data on nodes are uncoded (transparent). Thus, the proposed algorithm not only keeps decentralization and security, but also has good scalability in independency and recovery.
@article{arxiv.1911.01778,
title = {Downsampling and Transparent Coding for Blockchain},
author = {Qin Huang and Li Quan and Shengli Zhang},
journal= {arXiv preprint arXiv:1911.01778},
year = {2019}
}