A design for Probabilistic Partial Pruning



Summary:

A proposal to increase data redundancy and share the load across nodes has been submitted by Keagan McClelland to the bitcoin-dev community. The proposal aims to alleviate the pressure of full archive nodes on the IBD problem. As a part of this approach, fountain codes are used to create an infinite stream of codewords that can be XORed to recover the full message. SeF, an approach that employs fountain codes, was presented at Scaling Bitcoin 2019. Droplet nodes in SeF retain a fixed number of codewords from the encoding concatenated blocks and serve them to compatible clients. This is considered more robust than retaining a random sample of blocks and performs well according to simulations. The theory of fountain codes and its variants should be of interest, and there is also work on fountain codes in an adversarial setting.


Updated on: 2023-06-14T18:39:10.842328+00:00