Home▸Algorithms & AI▸Reed-Solomon Erasure Coding for Distributed Storage

🧩 Reed-Solomon Erasure Coding for Distributed Storage

See how Reed-Solomon codes shard data into data and parity blocks across storage nodes, then reconstruct the original through polynomial interpolation after random nodes are dropped, the same technique behind RAID6 and modern erasure-coded storage.

Algorithms & AI3DModerate60 FPS

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.

🔬 What It Demonstrates

🎮 How to Use

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.

💡 Did You Know?

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.

⚙ Under the hood

reed-solomonerasure codingdistributed storageraid6polynomial interpolationgalois fieldfault tolerancedata durability

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install