Downsampling and Transparent Coding for Blockchain
Qin Huang, Li Quan, Shengli Zhang

TL;DR
This paper introduces a novel downsampling and transparent coding method for blockchain data, enhancing scalability and decentralization while enabling efficient recovery through cooperative decoding akin to fountain codes.
Contribution
It proposes a new approach combining entropy-based downsampling with transparent coding, allowing scalable storage and reliable recovery without compromising decentralization.
Findings
Reduces blockchain storage overhead effectively.
Enables efficient recovery via cooperative decoding.
Maintains decentralization and security.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Quantum Computing Algorithms and Architecture · Cellular Automata and Applications
