Skip to content
This repository has been archived by the owner. It is now read-only.

Storing the data with redundancy? #248

Closed
ghost opened this issue Apr 16, 2017 · 1 comment
Closed

Storing the data with redundancy? #248

ghost opened this issue Apr 16, 2017 · 1 comment

Comments

@ghost
Copy link

ghost commented Apr 16, 2017

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.

Related: https://en.wikipedia.org/wiki/Cooperative_storage_cloud#Data_redundancy
What do you think?

@flyingzumwalt
Copy link
Contributor

flyingzumwalt commented May 23, 2017

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant