Skip to content

Comment on How RAID-6 dual parity calculation works

Comments

I come from a different math background, and it always surprises me people don't explain erasure encodings in terms of polynomials.

We all know that a polynomial of degree n is basically defined by n points. So a line is defined by 2 points.

If I need to encode the 2 pieces of info [a,b] I can just generate a polynomial ax+b and sample it at 2 points to recover the info. If I sample it at 3 points I can lose any one point and still recover [a,b]. The concept generalizes to higher dimensions and discrete values.

afaik that's basically it.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.