I think last time this was asked, the consensus was that the implementation was based on linear feedback shift registers and xor, which happens to be a reed-solomon code (not as clear on this part, but what matters is what it is, not what it isn't). Regardless, from reading the source previously, I am fairly sure it operates bytewise, with xor for first syndrome (parity), and LFSR and then xor for the other syndromes.
See http://openindiana.org/pipermail/openindiana-discuss/2012-October/010419.html Tim On Thu, Feb 21, 2013 at 12:10 PM, Sašo Kiselkov <[email protected]>wrote: > On 02/21/2013 06:56 PM, Roy Sigurd Karlsbakk wrote: > > Are you sure z2 uses reed-solomon? I thought it just used > two-dimensional XOR like Raid-6 > > Pretty sure, unless the documentation is lying: > > > https://github.com/illumos/illumos-gate/blob/master/usr/src/uts/common/fs/zfs/vdev_raidz.c#L38-L45 > > Cheers, > -- > Saso > > _______________________________________________ > OpenIndiana-discuss mailing list > [email protected] > http://openindiana.org/mailman/listinfo/openindiana-discuss > _______________________________________________ OpenIndiana-discuss mailing list [email protected] http://openindiana.org/mailman/listinfo/openindiana-discuss
