3 ms·
Step 1 : Create a compressed (must not 'store') archive split into small-ish sections of size N/K. Step 2 : Run par2 against the archive sections and create as
by mjevans 3y ago
Step 1 : Create a compressed (must not 'store') archive split into small-ish sections of size N/K.
Step 2 : Run par2 against the archive sections and create as much parity as possible.
Step 3 : Distribute any middle (not the start of the archive, and not the incomplete end piece) segments of the archive and a 'correct' number of parity / recovery packets.
If a complete count of the archive and parity pieces are brought together, par2 can recover the remaining pieces of the archive and extraction will be possible.
The hashes only (no recovery data) par2 file should be distributed with all copies.
- hgomersall 3y agoThis is what Shamir's secret sharing algorithm does, just that that has the benefit of being information-theoretically secure.