Based on https://en.wikipedia.org/wiki/Reed%E2%80%93Solomon_error_cor... which gives (n=1 - k=3)/2 is 1 as the answer to the question of the number of missing symbols that RS(1,3) can recover which means that RS(1,3) is not a worse way of storing four copies but a worse way of storing 2 copies. It takes the space of four copies to store what only has the redundancy of two copies.
DeusCodex•1mo ago
It is a storage engine that shards files into Reed-Solomon blocks (RS(30,3) or RS(1,3)) to guarantee mathematical recovery from disk corruption. It then exposes this engine via a FUSE/WinFSP interface so you can access the data using standard tools (read, seek) without needing custom APIs.
Key features:
Engine Layer: Handles the heavy lifting of parity calculation and Merkle tree verification.
Access Layer: Virtual filesystem driver allows zero-copy access and random seeking on multi-gigabyte datasets.
Self-Healing: The engine transparently reconstructs corrupted sectors during reads.
I’m graduating in May and aiming for systems roles in the UK. I'd love feedback on the architecture and any feedback is highly appreciated, Thank you.