On Monday, 27 May 2013 at 20:14:35 UTC, Andrei Alexandrescu wrote:
At some point Walter and I were talking about generating an MD hash for very long names. That has some disadvantages (i.e. no easy reverse lookup) but it may work.
Surely a better solution would be to use a lossless compression? With the amount of repetition you should get very high ratios.
