Erasure code-based low storage blockchain node
Doriane Perard, J\'er\^ome Lacan, Yann Bachy, Jonathan Detchart

TL;DR
This paper proposes a novel erasure code-based system for blockchain nodes that significantly reduces storage requirements, enabling low-capacity nodes to participate and maintain decentralization in large blockchain networks.
Contribution
It introduces a new low storage node architecture using erasure codes, allowing blockchain data to be reconstructed from fewer nodes, promoting decentralization.
Findings
Reduces storage requirements for blockchain nodes
Ensures blockchain data can be reconstructed from fewer nodes
Supports participation of low-capacity nodes in blockchain networks
Abstract
The concept of a decentralized ledger usually implies that each node of a blockchain network stores the entire blockchain. However, in the case of popular blockchains, which each weigh several hundreds of GB, the large amount of data to be stored can incite new or low-capacity nodes to run lightweight clients. Such nodes do not participate to the global storage effort and can result in a centralization of the blockchain by very few nodes, which is contrary to the basic concepts of a blockchain. To avoid this problem, we propose new low storage nodes that store a reduced amount of data generated from the blockchain by using erasure codes. The properties of this technique ensure that any block of the chain can be easily rebuild from a small number of such nodes. This system should encourage low storage nodes to contribute to the storage of the blockchain and to maintain decentralization…
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.
