And... then? You would essentially need a homomorphic hash function for that to work.
I.e.: [ a, b, c ].map(hash) produces the same order.
where hash: A -> B, where p, q in A. p < q => x, y in B. x < y.
I.e.: [ a, b, c ].map(hash) produces the same order.
where hash: A -> B, where p, q in A. p < q => x, y in B. x < y.
It's not that hard, in many cases, to find an `f : DataDomain -> Int` st. `f(x1) < f(x2)` where `hash(x1) < hash(x2)`