[Bulat-Ziganshin]

Let's see: in order to produce 32 parity blocks from 255 data blocks you are probably perform 32x255 multiplications, i.e. NxM operations where N,M is number of data/parity blocks. for a fixed N/M rate it is considered as O(N^2) algo

Once you fixed N and M, encoding speed will be fixed in both your and my algo. In mine, it's 1 GB/s for N=M=524288

And yes, it's doing the same as your algo - generate parity blocks from data blocks and then restore from any combination of N survived blocks