The mention n*log2(n) bits of info for ordering n transactions. This is the same as log2(n^n). I believe that's an overestimate, I think that you need log2(n!) which is always lower.