gipfeli

JPEGLI = A small JPEG The suffix -li is used in Swiss German dialects. It forms a diminutive of the root word, by adding -li to the end of the root word to convey the smallness of the object and to convey a sense of intimacy or endearment. This obviously comes out of Google Zürich. Other notable Google projects using Swiss German: https://github.com/google/gipfeli high-speed compression Gipfeli = Croissant https://github.com/google/guetzli perceptual JPEG encoder Guetzli = Cookie https://github.com/weggli-rs/weggli semantic search tool Weggli = Bread roll https://github.com/google/brotli lossless compression Brötli = Small bread

It exists! https://github.com/google/gipfeli It was aiming for better compression than LZ4 at much higher speeds than deflate. Now brotli and zstd on their faster settings mostly beat it in that niche.

And let’s not forget Gipfeli and Knusperli ;) https://github.com/google/gipfeli https://github.com/google/knusperli

Also, it's in line with Brotli[1] and Gipfeli[2], other compression libraries/formats from Google bearing names of Swiss pastries. [1]: https://github.com/google/brotli [2]: https://github.com/google/gipfeli

More compression news!: https://github.com/Cyan4973/zstd declared its format stable a couple days ago, getting a step towards 1.0. In the example there, it's a little denser than gzip -1 and a lot faster, and includes entropy encoding that uses finite state machines (and that I don't truly understand--maybe there's some similarity to lzfse there). It can look at your data and construct a static dictionary, which sounds cool for tasks like packing a bunch of 4kb database pages. (https://github.com/google/gipfeli is another compressor aiming at that general space ('fast but not Snappy/LZ4 fast'), but I don't think it caught on much.)

Neat. Google's Gipfeli (https://github.com/google/gipfeli) also aims for compression ratio and time to fall in between gzip -6 and the fastest algorithms. I've only glanced at code; think it includes a Snappy/LZO/LZ4-like repeat matcher using a hashtable, combined with simple-but-fast entropy coding where each literal input byte becomes 6, 8, or 10 bits. Super cool that Collet's working on still-pretty-fast-but-better compression out in the open.