<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Metacompression on Arhuman's Blog</title><link>https://blog.assad.fr/en/tags/metacompression/</link><description>Recent content in Metacompression on Arhuman's Blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 24 Apr 2026 02:38:37 +0100</lastBuildDate><atom:link href="https://blog.assad.fr/en/tags/metacompression/index.xml" rel="self" type="application/rss+xml"/><item><title>Metacompression: compressing structure before bytes</title><link>https://blog.assad.fr/en/post/what_is_metacompression/</link><pubDate>Fri, 24 Apr 2026 02:38:37 +0100</pubDate><guid>https://blog.assad.fr/en/post/what_is_metacompression/</guid><description>&lt;h2 id="what-if-the-real-gain-wasnt-at-the-byte-level"&gt;What if the real gain wasn&amp;rsquo;t at the byte level?&lt;/h2&gt;
&lt;p&gt;I have always been fascinated by compression algorithms — I was 15 when I &amp;ldquo;invented&amp;rdquo; Run Length Encoding (before learning it had been discovered more than 20 years before I was born).&lt;br&gt;
I marveled at the visual simplicity of Huffman coding, at the cleverness of Lempel-Ziv which dynamically builds its dictionary.&lt;/p&gt;
&lt;p&gt;These algorithms are powerful, and it is no coincidence that they are continuously improved and combined to produce ever more powerful new algorithms: &lt;code&gt;Brotli&lt;/code&gt;, &lt;code&gt;zstd&lt;/code&gt;.&lt;/p&gt;</description></item></channel></rss>