<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Metarc on Arhuman's Blog</title><link>https://blog.assad.fr/en/tags/metarc/</link><description>Recent content in Metarc on Arhuman's Blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 16 May 2026 01:38:37 +0100</lastBuildDate><atom:link href="https://blog.assad.fr/en/tags/metarc/index.xml" rel="self" type="application/rss+xml"/><item><title>Compressing time to compress logs</title><link>https://blog.assad.fr/en/post/time_compression/</link><pubDate>Sat, 16 May 2026 01:38:37 +0100</pubDate><guid>https://blog.assad.fr/en/post/time_compression/</guid><description>&lt;p&gt;This morning, I had fun compressing time.&lt;/p&gt;
&lt;p&gt;But before you picture me as a theoretical physics genius or a crackpot in need of a straitjacket, let me explain.&lt;/p&gt;
&lt;p&gt;I am currently working on &lt;a href="https://github.com/arhuman/metarc-go"&gt;Metarc&lt;/a&gt;, a &lt;em&gt;metacompression&lt;/em&gt; tool (understand: applying smart transformations to certain structures before handing off to a classical compressor like &lt;code&gt;zstd&lt;/code&gt;). If you have never heard the term, you will understand in 5 minutes. If you are a compression expert, hang on, you might find food for debate.&lt;/p&gt;</description></item><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, and 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 increasingly more powerful algorithms: &lt;code&gt;Brotli&lt;/code&gt;, &lt;code&gt;zstd&lt;/code&gt;.&lt;/p&gt;</description></item></channel></rss>