> completely random data can't be compress Given that a normal B-Tree can't retrieve the original order, it must be more compressible than random data and a re

> completely random data can't be compress Given that a normal B-Tree can't retrieve the original order, it must be more compressible than random data and a representation that would let you represent a wrong order has invalid sequences, so it must be less space efficient than one that would use those sequences to mean something valid.