The simulation shards a sample file into k data blocks and m parity blocks using Reed-Solomon encoding, lets you randomly fail nodes up to the tolerance limit, and animates polynomial interpolation reconstructing every missing block exactly.
Adjust the number of data and parity blocks, click nodes to mark them as failed up to the maximum tolerable count, then run reconstruction to watch the interpolation recover the original file from the surviving blocks.
Sliders for data block count k and parity count m, clickable node grid to simulate failures, and a reconstruct button.
RAID6 and many cloud object stores use Reed-Solomon variants that can lose several disks at once and still recover everything perfectly, using the same polynomial math originally developed in 1960 for correcting errors in noisy communication channels.
The simulation shards a sample file into k data blocks and m parity blocks using Reed-Solomon encoding, lets you randomly fail nodes up to the tolerance limit, and animates polynomial interpolation reconstructing every missing block exactly.
The simulation shards a sample file into k data blocks and m parity blocks using Reed-Solomon encoding, lets you randomly fail nodes up to the tolerance limit, and animates polynomial interpolation reconstructing every missing block exactly.
Adjust the number of data and parity blocks, click nodes to mark them as failed up to the maximum tolerable count, then run reconstruction to watch the interpolation recover the original file from the surviving blocks.
RAID6 and many cloud object stores use Reed-Solomon variants that can lose several disks at once and still recover everything perfectly, using the same polynomial math originally developed in 1960 for correcting errors in noisy communication channels.