Hacker News Reader

Seems a lot like Normalized Compression Distance (https://en.wikipedia.org/wiki/Normalized_compression_distanc...) and Kolmogorov Complexity.

Good compression, necessarily, requires good "next token" probability estimation. I was essentially using zlib's implicit probability estimator.