Very big: Array ordering and naive summation (Stefan Karpinski demonstrated that you can get any values in [0,2^970) by summing identical 2046 values in different order)
Hmm… This is tricky, but I think it’s fine. (It’s tricky because it had the same problem if it were using the transpose Evals[i, id].)