Habr author shows off a neural archiver that compresses data using inference from any neural network
A new Habr article introduces a neural archiver: a way to compress data by running neural network inference instead of relying on classic algorithms like ZIP. The author traces the history of archiving and shows how to build a simple neural archiver on top of inference from any neural network that predicts probabilities for the next characters or tokens, enabling denser data compression.
AI-processed from Habr AI; edited by Hamidun News
The author of a technical blog on Habr has presented "NeuroArchiver", an article with a working example of a data compression tool that uses inference from an arbitrary neural network instead of classic algorithms like ZIP or RAR.
Why revisit archiving at all
For decades, archiving was considered a closed topic: classic compression algorithms such as ZIP, RAR, and gzip have been polished to the limit, and few people expected new breakthroughs in the field. The author opens with the history of the subject: how the first compression algorithms emerged, and why a topic many consider long solved is gaining momentum again, specifically because of neural networks.
From there, he moves from history to practice and shows how to write a simple neural archiver that works through inference. Any neural network that can predict a probability distribution for the next character or token can be plugged into the compression scheme without retraining and without being tied to a specific model architecture. That sets the approach apart from specialized codecs, which are written and tuned for a particular data type.
How inference helps compress data
The idea is to use the model's predictions as a source of probabilities for entropy coding: the more accurately the network guesses the next character or token, the fewer bits it takes to encode the actual data. The principle is universal. In theory, any language model or other generative model will work, as long as you can query it in inference mode and get a probability distribution as output.
The author implements the idea with a simple teaching example meant to demonstrate the mechanism itself, not to squeeze maximum compression out of it. The approach repurposes an off-the-shelf model, originally trained to generate text, for an entirely different task: compactly representing arbitrary data. The author stresses that the article's goal is to understand the mechanics, not to compete with production archivers on speed or compression ratio.
What it means
The piece is another example of off-the-shelf large models finding uses far beyond chatbots: in data compression, anomaly detection, and text quality assessment. The line between "AI applications" and ordinary engineering utilities keeps blurring, and model inference is turning into a universal building block that can be embedded almost anywhere, as long as someone is willing to take an existing neural network and write the glue code around it.
For developers, this is more of an educational case study than a production-ready product. It demonstrates a principle that, with some effort, could be developed into a working tool for specific data types such as logs, config files, or serialized structures.
The framing of the problem itself, "compress anything by relying on the predictions of an existing model", is typical of the Habr community: walkthroughs like this let readers not only learn about a new method but also reproduce the experiment themselves, plugging in their own neural network and their own data.
- Nov 2, 2026LLM Agent Built a Gearbox in KOMPAS-3D, but Scored Only 50 out of 100 on the Specification
- Nov 2, 2026Agents ignored the prompt to read memory in 7 of 7 sessions: an analysis of 13 thousand logs
- Nov 2, 2026Karpathy Built HackerTube, a Catalog of 6,454 Videos, in Two Hours with Claude Code
- Nov 2, 2026We Audited 929 Automations at Alpina: What Corporate AI Training Should Look Like in 2026
Key Questions Answered
Why revisit archiving at all?
For decades, archiving was considered a closed topic: classic compression algorithms such as ZIP, RAR, and gzip have been polished to the limit, and few people expected new breakthroughs in the field. The author opens with the history of the subject: how the first compression algorithms emerged, and why a topic many consider long solved is gaining momentum again, specifically because of neural networks.
How inference helps compress data?
The idea is to use the model's predictions as a source of probabilities for entropy coding: the more accurately the network guesses the next character or token, the fewer bits it takes to encode the actual data. The principle is universal. In theory, any language model or other generative model will work, as long as you can query it in inference mode and get a probability distribution as output.
What it means?
The piece is another example of off-the-shelf large models finding uses far beyond chatbots: in data compression, anomaly detection, and text quality assessment. The line between "AI applications" and ordinary engineering utilities keeps blurring, and model inference is turning into a universal building block that can be embedded almost anywhere, as long as someone is willing to take an existing neural network and write the glue code around it.
Ship AI Faster with Founders, Engineers & Weekly Architecture Reviews
Inside Vibe Club (hamidun.com/club) — weekly live masterminds with Zhemal Khamidun, Tech Radar, full LMS access, and 370+ production Claude Code skills.
The AI world, distilled — once a week
Seven stories that actually mattered, hand-picked. No noise, no reposts, no press releases.
Done! Check your inbox for a confirmation.