1024 drives. In this scenario 16 becomes the erasure set size. This is decided based on the greatest common divisor (GCD) of acceptable erasure set sizes ranging from *4 to 16*.

- *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*.  In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4...

pkg math/big, method (*Int) DivMod(*Int, *Int, *Int) (*Int, *Int)
pkg math/big, method (*Int) Exp(*Int, *Int, *Int) *Int
pkg math/big, method (*Int) Format(fmt.State, int32)
pkg math/big, method (*Int) GCD(*Int, *Int, *Int, *Int) *Int
pkg math/big, method (*Int) GobDecode([]uint8) error
pkg math/big, method (*Int) GobEncode() ([]uint8, error)
pkg math/big, method (*Int) Int64() int64