Storing the data with redundancy?

From @githubber314159 on Sun Apr 16 2017 18:42:27 GMT+0000 (UTC)

Hello everybody! Especially for long-term archival, it seems important to me that we account for bit rot. There are two ways:

  1. Whenever one detects that a stored block has a wrong hash, re-request the block from the network.
    Advantage: less space needed
    Disadvantage: What if you thought the file is safe because you pinned it but actually you are the only one holding the data?

  2. Store 1% / 0.1% of redundancy with Reed-Solomon forward correcting codes.
    Advantage: simple, for example just use par2cmdline (Parchive) or use the implementation from BlackBlaze.
    Advantage: less network traffic because you can flip the bit again yourself.
    Disadvantage: additional space needed.

What do you think?

Copied from original issue: