The author compares DNA genomes and large language model weights as passive information sequences—scores that only become meaningful when processed by cellular machinery or inference engines. Both arise from massive search processes (evolution and gradient descent) that compress vast experiences into lossy representations, leaving much uninterpreted “junk.” This parallel explains why it’s hard to pinpoint where specific functions reside in either genome or model.

This article explores an unconventional method for classifying text by leveraging compression algorithms. The author demonstrates how to concatenate labeled documents, compress them, and use the compressed sizes to predict labels for new texts. While the method shows promise, it is computationally expensive and generally underperforms compared to traditional classifiers.

This article explores how Python 3.14's zstd module enables efficient text classification through incremental compression. It outlines a method where text is classified based on the size of compressed output from different class-specific compressors, demonstrating improved speed and accuracy over traditional methods.