Hacker News Reader

I wonder how it compares to traditional compression?

I've tried their "Integer that increments by 1 at every timestep." case on 10000 integer. The algorithm described said "6.98x compression"

bzip2 gave 80000/8642 = 9.2x compression

zstd gave 80000/11316 = 7.1x compression

View on HN

I'm not sure that's a very fair comparison, as this algorithm does point-wise streaming compression/decompression. I could see myself using something like this in a FPGA context or within a tight acquisition inner loop for example.

Reply on news.ycombinator.com