Tag archive
Explore misa77, a novel compression codec that boasts decoding speeds twice as fast as LZ4 while achieving superior compression ratios. This deep dive examines its technical innovations.
Lossy or lossless compression? Learn the key differences, when to use each, and how to compress images without losing quality. Free tool included.
I run ezyZip, a browser-based archive tool, so "which format should I use?" is a question I field...
The Uncompressed Elephant in the Room Open a shell on your primary storage array. Run du...
An embedding is a []float32. A store of a million of them is 512 MB of float32 that you will spend...
You know that moment when a project starts simple but ends up forcing you to learn more about FFmpeg?...
Originally published at norvik.tech Introduction Dive into the complexities of...
Engineering note (NOT a research breakthrough): External extension to rei-lang npm package (v0.5.5) compress pipeline. Adds general k-order linear recurrence detector motivated by FIDT (STEP 845 = FIA × FDA direct product) β₁-cycle perspective. Empirically improves 5 of 14 test sequences (Tribonacci, Pell, Tetranacci, affine, custom 2nd-order) from compression ratio 1.000 (raw) to 0.500-0.909. Existing 8 cases unaffected. Random data correctly stays raw (Kolmogorov-Chaitin respected). ★ Honest scope: Does NOT revive retired infinite-compression / Shannon-superseding / 1000TB-10GB claims (formally retired 2026-04-17). FIDT provides β₁-cycle MOTIVATION only; math is undergraduate Gauss elimination. Implementation ~150 lines TypeScript. Berlekamp-Massey class detector — no novelty claim. Three-party co-authorship per OUKC charter v1.0.
A CLI that compresses text with Huffman coding and reports the ratio, in Go. The essence of Huffman...
There is no single best way to encode a batch of records. A column of HTTP status codes wants...
How Does File Compression Work? Compression is a way to reduce a file's size. To...
The problem of predicting what comes next, from compression to language models