r/compression • • 1d ago

A "zero-prior" context-mixing compressor

1 Upvotes

I built UCZ (v0.1.0-beta.1), a personal TypeScript research project, to explore a question: many high-performance compressors—paq8px, zstd with dictionaries, domain-specific tools—rely on built-in world knowledge such as word lists, pretrained weights, magic numbers, or format-specific preprocessors. What if a compressor is strictly forbidden any external prior knowledge and told only that “the input is a raw byte sequence”?

To test this, I defined a “9-Point Constitution” (no built-in dictionaries, pretrained tables, filename/magic-number sniffing, or format-specific preprocessing) and implemented an online context-mixing engine that discovers structure at runtime:

For tabular/vertical-text streams, it learns delimiter density and tracks row/column alignment.

For 2D binary rasters, it searches the decoded prefix for causal scanline autocorrelations—e.g., locking onto the 216-byte scanline structure of the Canterbury ptt5 fax image and reaching 5.25% compression without header parsing.

For multi-channel/periodic signals, it tries de-interleaving with strides s=2–64, plus delta encoding and bit-plane decomposition.

For incompressible inputs (e.g., .png, since it may not re-inflate DEFLATE), an “error-EMA gate” freezes context training and reverts to STORE mode to avoid learning from noise.

To separate “general online learning” from “algorithmic priors,” every structural assumption is documented in PRIOR_REGISTRY.md, and two modes measure their impact.

UCZ --max includes online delimiters/column alignment, stride de-interleaving for s∈[2,64], causal 2D scanline detection, relative jump transforms, and the error-EMA freeze gate:

Canterbury Corpus (11 files): 369,447 B (13.14%; xz -9e: 17.54%)

UCI Tabular Corpus (6 files): 375,359 B (5.73%; xz -9e: 8.80%)

Complete E. coli genome: 1.951 bits/input-byte (~1.990 bits/base)

UCZ --strict / --strict-zero-prior disables ASCII character-class partitioning, relative jump transforms, 2D scan-period detection, and arithmetic delta/gradient specifications; it also tests a random permutation π(X) of the byte alphabet:

Canterbury Corpus: 375,283 B (13.35%; 1.58% higher than --max)

For structured binary data (9.H: +6.3%), tabular floating-point data (+14.5%), and 2D fax rasters (ptt5: +62.5%), these results quantify each structural operator’s gains.

Because the model tracks prequential predictive code cost (−log2 P(x_t|x_<t)) every 512 bytes, I built two utilities:

ucz inspect: a “residual microscope” showing where the online model is surprised—useful for high-entropy pockets in unknown blobs or regime shifts.

ucz ncd: a conditional-complexity dissimilarity matrix that keeps the context table “warm” across file boundaries.

Caveats: it is slow and memory-intensive—the 2.8 MB Canterbury Corpus takes ~105 s and ~1.9 GiB RAM, roughly 100× slower than xz -9e; README lists wall-clock time and peak RSS with each ratio. Even in --strict mode, exact alphabet-bijection invariance C(π(X))=C(X) holds only within an empirical ~3.4% drift, due to 24-bit hash-bucket collisions and APM quantization; details are in CONSTITUTION.md. The codebase (src/lib/codec.ts, coder.ts) evolved over ~37 iterations and is not elegant.

Specialized tools with domain priors still win in their domains (paq8px for English prose, AC2 for proteins, GeCo3 for DNA); documenting this gap was the main objective. If you have unusual binary blobs, telemetry logs, or edge-case files for round-trip integrity tests or the “microscope” tool (npm run bench:quick gives a ~10 s, 6-stream check; a local single-file Web UI via npm run build:web), I welcome bug reports, critiques, and mathematical/code suggestions.(https://github.com/no-nova/UCZ)


r/compression • • 1d ago

3MF Data Compression utility

Post image
0 Upvotes

I have a Github with all of the code and the exe here. You can test it as you desire, the code is also available there, as well as methods and more.

The biggest point is that it does not need a new decoder. The files can be read anywhere a 3MF file can be currently read at.

This has no speed cost we were able to identify, there is zero known downsides for this method.

This means better storage space for users on their thumb drives and hard drives, especially the companies with large directories and the websites with thousands of files listed.

This is free for use, modification, or other use, so long as you provide my name as the developer of the concept and/or code. It is under an MIT License.

Any and all such companies should examine it and implement it, honestly this is a no-brainer.

I put up an EXE file, please feel free to test, provide feedback, and I will update as I can.


r/compression • • 2d ago

Windowless Random-Access LZSS for Constrained Microcontrollers

6 Upvotes

Hello r/compression
I'd like to share a project that I've been working on for the last couple of months.

On microcontrollers with only a few kilobytes of Flash and SRAM, heatshrink [1] and tamp [2] are widely used for decompressing static assets. They are small, configurable, and produce good compression ratios.

However, for random-access workflows (like reading a single entry from a config table, font, or devicetree), sliding-window decoders still require allocating the full window and sequentially decoding from the start of a block. To get small-slice random access with heatshrink or tamp, you either pay that full sequential decode cost or split the asset into small independently compressed blocks (which hurts compression ratio).

==============

blaris is a windowless LZSS format/decompressor - meaning it does not allocate a sliding window at all. This lets it match (or sometimes beat) the compression ratios of high-window heatshrink and tamp configurations while keeping total SRAM usage fixed at 104–112 B regardless of lookback range or file size.

Typical LZ77/LZSS resolves matches by copying from a RAM sliding window. blaris instead resolves matches directly inside the compressed payload, following the chain of matches backward until it lands on a literal run token.

To make bidirectional traversal fast and deterministic, tokens are split into 3 streams:

Because each control byte fixes the exact number of literal bytes or distance bits consumed, the decoder can step forward and backward across all 3 streams in lockstep.

A few optimizations make this practical:

On small random-access slices (1–32 B), blaris significantly outperforms ratio-matched, block-indexed heatshrink and tamp (e.g., >500× faster on 1 B reads at ~36% ratio on a 15.2 KiB devicetree blob). For larger sequential reads, streaming decoders overtake blaris around 64–128 B slices since blaris's work scales linearly with slice length. Testing on physical ESP32-C3FN4 quad-SPI XIP Flash also showed that Flash wait states don't disproportionately penalize backward token walking (~1.30–1.33× overhead vs. zero-wait-state simulation for slices ≥ 4 B).

Memory footprints compiled with Clang (-Os) for RV32IMC (including common adapter):

GitHub repo with the C implementation, host compressor, benchmarking suite, and full results: https://github.com/lis05/blaris

[1] https://github.com/atomicobject/heatshrink
[2] https://github.com/BrianPugh/tamp
[3] https://github.com/lis05/lzmpo

AI-enhanced post.


r/compression • • 2d ago

Mac Image Compression Comparison App

Thumbnail
reddit.com
1 Upvotes

r/compression • • 2d ago

TurboBench, the Compression Lie Detector, 100 Codecs, Daily Update

Post image
3 Upvotes

r/compression • • 3d ago

Big Comparison Test

1 Upvotes

I tested myself against Silesia, Canterbury, Calgary, Kodak, enwik8, Squash Snappy, Maximum Compression, Lukas 2D 16-bit DICOM, Large Canterbury, Mahoney UIQ2, Lukas 2D 8-bit TIF, Canterbury artificial, DNA corpus, Lukas 2D 16-bit TIF, Lukas 3D DICOM with a number of other encoding compression utilities.

The comparison software included zstd 1.5.6, Brotli 1.2.0, xz 5.6.3, 7-Zip 26.06, gzip (libdeflate 1.26), bzip2 (libbz2 1.1), bzip3 1.5.1, BSC 3.4.0, kanzi 2.6.0, LZ4 1.11.0, Snappy 1.3.1 and LZAV 7.1, alongside my own HX Fast, HX Complete, hs_zstd 1.3, rd-zstd, xz-hi, bzip2-hi and lzav-hi.

https://github.com/CombaryMaker/Harringtons_Insights/blob/main/hx-competition/HX-Competition-Test-1.0.zip

Using some custom speed tier (rules, highly enforced) methods https://github.com/CombaryMaker/Harringtons_Insights/blob/main/docs/Speed-Tier-Standard-Tier-1-Split.txt I was able to defeat Kanzi and a number of other compressors in the various speed categories

HX Complete beat Kanzi on 12 of 15 corpora, it was 5.11% smaller overall. Across all 15 corpora, my tools won 121 of 195 speed tiers, a 62% win rate.

The primary competition was Kanzi at anything except the fastest speeds, inside the fastest speeds and in this category, out of 60 possible real wins, I won 33 (55%) of the contests and the competitors won 27 (45%) of the contests. The absolute best software here was HX Fast at 16 wins (26.7%) and second place was Brotli at 9 wins (15%). xz-hi took 3rd place with 8 wins (13.3%) and zstd came in fourth (5 at 8.3%) with rd-zstd tied with LZAV and kanzi -l 7 (4 at 6.7% each, three-way tie) in fifth. My modifications for zstd, zstd-hi, is built into HX Fast and is part of that software suite.

Full results are at https://github.com/CombaryMaker/Harringtons_Insights/blob/main/hx-competition/HX-Competition-FULL-RESULTS-2026-11-13.txt

This was made with a mix of open source and patent pending technologies.


r/compression • • 5d ago

ZXC hits 1.0.0: the format is frozen

7 Upvotes

Hi all,

I posted about ZXC here a few months ago, and the feedback I got shaped a good part of what came next. So I wanted to share this one here first: 1.0.0 is out.

Quick reminder: ZXC is an LZ codec for write-once, read-many data. You compress once, at build time, and decode everywhere, so I tuned everything for decode speed.

For me, 1.0 is mostly a promise:

  • The format is frozen. A file written today will be readable by every future release. It's fully specified, with public conformance vectors.

  • The API and ABI are stable across 1.x.

  • I'm in this for the long run. Fixes and performance work will continue, without breaking either of the above.

Where it stands (Silesia, single thread, lzbench):

  • levels -1 to -6 decode 1.1x to 2.1x faster than LZ4 / LZ4HC at an equal or better ratio

  • level -7 compresses better than zstd -1 and decodes up to 3x faster

The price is compression speed: -6 and -7 are slow, and that's a choice I made. If you need fast compression, LZ4 and ZSTD are still the right tools.

It also has seekable archives, in-place decompression, dictionaries for small data, and bindings for Rust, Python, Node.js, Go and WASM. BSD-3-Clause.

What's next, and where I could use a hand:

  • SIMD for RISC-V 64 (RVV) and LoongArch 64 (LSX/LASX). I'm thinking about dedicated code paths for both, but I have no hardware to run benchmarks in CI. If you know of runners, a board farm, or any other way to get reliable numbers on these, I'm all ears.

  • Native ports in C# and Java. Not bindings, real ports. The format spec and the conformance vectors should make that doable without reading my C. If that sounds like fun to you, let's talk.

https://github.com/hellobertrand/zxc

If you try it on your own data or hardware, I'd love to see the numbers, good or bad. And thanks to everyone who commented last time.

https://libzxc.org


r/compression • • 5d ago

HALAC 1.0.0 (High Availability Lossless Audio Compression)

6 Upvotes

HALAC 1.0.0 is ready...
For details and downloads: https://github.com/Hakan-Abbas/HALAC-High-Availability-Lossless-Audio-Compression/releases/tag/1.0.0

AMD Ryzen 5 9600X - Single Thread Results

KARNOKKOROK 01.wav (Thank you Marco - forart.eu)
Single track · 32 channels · 32-bit float · 48 kHz · 3.96 GB

Version    Level    Size (%)    Size (MB)    Encoding (s)    Decoding (s)
HALAC 0.6.6    0    36.90       1,460.10       8.31          8.27
HALAC 0.6.6    1    35.99       1,424.17       7.34          7.71
HALAC 0.6.6    2    34.23       1,354.48       7.63          8.48
HALAC 0.6.6    3    33.46       1,323.81       8.12          8.94
HALAC 0.6.6    4    33.37       1,320.44      10.08         11.13
HALAC 0.6.6    5    33.38       1,320.86      10.79         11.50

HALAC 1.0.0    0    34.25       1,354.97       4.17          3.84
HALAC 1.0.0    1    33.84       1,339.01       4.58          4.05
HALAC 1.0.0    2    31.69       1,253.95       5.03          4.58
HALAC 1.0.0    3    31.64       1,251.68       7.61          4.80
HALAC 1.0.0    4    31.61       1,250.70       8.63          4.88
HALAC 1.0.0    5    31.59       1,250.08       9.26          4.97
HALAC 1.0.0    6    31.54       1,248.07      12.00          5.17

BIP TUNIA (Thank you Michael)
6 tracks · 24-bit · 2 ch · 5.62 GB · 44.1 kHz

Version    Level    Size (%)    Size (MB)    Encoding (s)    Decoding (s)
HALAC 0.6.6    0    76.23       4,283.02       5.20          6.58
HALAC 0.6.6    1    76.00       4,269.93       5.96          7.18
HALAC 0.6.6    2    73.52       4,130.85       6.47          8.62
HALAC 0.6.6    3    72.62       4,080.34       7.41          9.67
HALAC 0.6.6    4    72.19       4,056.35      10.07         12.55
HALAC 0.6.6    5    72.05       4,047.99      12.42         13.27

HALAC 1.0.0    0    75.72       4,254.41       4.84          6.07
HALAC 1.0.0    1    74.57       4,189.79       5.21          6.56
HALAC 1.0.0    2    72.29       4,061.91       6.40          7.51
HALAC 1.0.0    3    72.07       4,049.44       7.94          8.43
HALAC 1.0.0    4    71.63       4,024.64      10.99          9.76
HALAC 1.0.0    5    71.54       4,019.36      13.09          9.78
HALAC 1.0.0    6    70.94       3,985.77      23.77         11.71

YURI KORZUNOV
6 tracks · 24-bit · 2 ch · 192 kHz · 1.90 GB

Version    Level    Size (%)    Size (MB)    Encoding (s)    Decoding (s)
HALAC 0.6.6    0    56.61     1,077.27       1.80          2.20
HALAC 0.6.6    1    43.24       822.74       1.92          2.48
HALAC 0.6.6    2    32.38       616.23       2.09          2.96
HALAC 0.6.6    3    28.87       549.35       2.32          3.23
HALAC 0.6.6    4    27.47       522.65       3.90          4.21
HALAC 0.6.6    5    27.17       517.07       4.40          4.44

HALAC 1.0.0    0    56.08     1,067.16       1.97          2.08
HALAC 1.0.0    1    42.43       807.32       1.77          2.67
HALAC 1.0.0    2    27.00       513.71       2.05          2.46
HALAC 1.0.0    3    24.96       474.89       3.23          2.82
HALAC 1.0.0    4    22.98       437.24       5.82          3.59
HALAC 1.0.0    5    22.97       437.12       6.36          3.58
HALAC 1.0.0    6    22.42       426.57      14.02          3.85

AMVIZO 5.1
20 tracks · 16-bit · 48 kHz · 5.1 channels · 2.77 GB

Version    Level    Size (%)    Size (MB)    Encoding (s)    Decoding (s)
HALAC 0.6.6    0    48.90       1,355.75       3.05          3.57
HALAC 0.6.6    1    49.62       1,375.89       3.56          3.97
HALAC 0.6.6    2    45.59       1,264.12       3.80          4.97
HALAC 0.6.6    3    43.09       1,194.70       4.32          5.62
HALAC 0.6.6    4    42.81       1,187.06       6.44          7.38
HALAC 0.6.6    5    42.60       1,181.17       7.38          7.85

HALAC 1.0.0    0    48.21       1,336.80       2.96          3.15
HALAC 1.0.0    1    47.34       1,312.52       3.06          3.55
HALAC 1.0.0    2    43.32       1,201.27       3.92          4.21
HALAC 1.0.0    3    38.75       1,074.37       6.38          4.75
HALAC 1.0.0    4    38.05       1,055.11       8.34          5.62
HALAC 1.0.0    5    37.81       1,048.41      10.00          5.49
HALAC 1.0.0    6    37.84       1,049.22      15.25          5.84

r/compression • • 6d ago

I built a lossless compressor for GGUF files: 9 Hub models tested, 8.66% smaller overall

Thumbnail gallery
0 Upvotes

Useful if you archive a lot of models, share them over slow or metered connections, or keep them on a phone or small SSD.


r/compression • • 6d ago

ZyFlate DEFLATE benchmark v2.0.0 — binary included, run it on your own data

2 Upvotes

I've been working on a DEFLATE compressor/decompressor called ZyFlate. I built a benchmark that tests it head-to-head against two widely deployed DEFLATE implementations and I'd like people who know compression to look at the numbers.

Full disclosure: I'm a solo developer, I use AI tools in my workflow, and I'm new to this community. No connections, no team. For all I know this could be some cruel hallucination and I'm completely wrong about everything.

But the benchmark is real. Download it. Run it on your own files.

Decompression throughput (100 MB test data, same compressed stream, all three decompress it):

LevelZyFlate MB/sLibrary A MB/sLibrary B MB/s
L11,091380890
L61,021387867
L121,2914741,044

Library A and B are two of the most widely deployed DEFLATE implementations. The benchmark output describes each one.

Parallel compress + decompress (2 threads):

Level1-core compress2-core compress1-core decompress2-core decompress
L1180 MB/s337 MB/s (1.9x)1,112 MB/s1,684 MB/s (1.5x)
L662 MB/s105 MB/s (1.7x)1,286 MB/s1,985 MB/s (1.5x)
L121.3 MB/s2.0 MB/s (1.6x)1,037 MB/s1,735 MB/s (1.7x)

Library A and B have no parallel API. ZyFlate splits input into independent 1 MiB chunks. All parallel outputs verified byte-exact against single-core.

Download:

https://github.com/GodlessVVanderer/slain-releases/releases/tag/zyflate-bench-v2.0.0

Windows x86-64. Supply any file as input (10+ MB recommended).

This isn't the finished version. The compressor is still being worked on — these numbers are mostly about the decompressor. There's an update coming that I think will change the conversation. If this doesn't impress you, the next one will.

I'm building this as part of something larger. If you work in compression and want to talk, my inbox is open.

AGPL-3.0-only. Commercial licensing available — [email protected].


r/compression • • 6d ago

How to compress images and videos while maintaining metadata?

1 Upvotes

hi i hope everyone is doing good.
a few months back i successfully downloaded all my snapchat videos and images and manually added their dates, however i want to be able to save them on free cloud storages i have like dropbox, google photos, etc. but its about 20gb

i wanted to know if there’s a website or ios app that lets me bulk compress images and videos without removing their metadata, its been hard to find one that works efficiently.

any help would be appreciated!!

also any recommendations on free cloud services online would also be greatly appreciated! would like save it in multiple website since it contains a lot of my memories


r/compression • • 6d ago

A 0.4% to 0.5% gain on Wikipedia Test and normal text with Context based Compressors

1 Upvotes

This has been released under the creative commons license so that anyone can work on it, but no one can claim credit for the core concept alone.

The basis for this improvement was being able to identify the purpose or type of paragraph in a book or webpage. The code is up on github as well as some educational materials.

For critics, there is a prize called the Hutter Prize for a 1% gain that keeps the compressor and compressed data smaller. This gain is not near that level, yet it is a real gain that could be used by a team to meet the requirement. Please take it in context and do not think a mere 0.4% to 0.5% gain in an already mostly maximized field of compression is small.

Now this is open for all to try, to test, to advance, to do whatever with. https://github.com/CombaryMaker/Harringtons_Insights/tree/main/mode-context

I do not code, I have an AI code for me. I do math, theory, and heavy thinking. I am an aspergers type autistic but nothing like Rainman or Good Will Hunting. That said, I looked at text roughly at 2:30pm today, had a working solution for books by 4:50pm, and now at 5:35pm we had it adjusted properly for Wikipedia files as well. This is my first foray in text since Feb and this is a new and novel solution. There were nine concepts tested and this is the final version. Yes I came up with ideas in a hurry, iterated them, moved from unsuccessful ideas to successful ones.

The path started with trying to see if the use of sentence ending symbols could help, then sentence based understanding of the context of the sentence. Then a realization that all books have a thing in common, paragraphs often modify context at least lightly. This could be change of characters speaking, change of actions, change in narration, or many other things. Paragraphs in different formats also do this.

For example in Wikipedia we see an introduction, history, examples, graphs and mathematics, and the closing section with urls to support things. This is just the beginning of what we see in those. The same goes for text books, non-fiction, and more. Paragraphs change context a lot and by understanding that context we can find better ways to compress the data.


r/compression • • 6d ago

Are this sites claims real? They say the 3D chess board and pieces are 3kb gzipped, but I just don't believe it

Thumbnail
chess.es3d.org
2 Upvotes

So, I always found compression really interesting, but I came across this and some of the claims are unreal. Im just going to point to the demo site just so some reddit warrior can check their claims in the comments

https://es3d.org/demo/

On it they claimed a megacastle is 64KB and the glTF is MBs. Are they compressing the files or? What are they actually doing

I am mainly curious to hear an expert"s opinion cause I haven't figured out what it is


r/compression • • 7d ago

I built an open-source, on-device photo compressor for iOS and Android

Post image
1 Upvotes

I’m the developer of minimo (photo), a free app for compressing photos on your phone. It handles batches and lets you choose a preset or adjust quality, maximum dimensions, and EXIF settings.

You can compare the output with the original before saving or sharing it. Processing stays on the device. On iOS, HEIC sources keep HEIC output; the app uses existing platform compression tools rather than a new codec.

Source code · iOS · Android


r/compression • • 7d ago

Codec I found, L1C

Thumbnail
github.com
4 Upvotes

I saw this image codec and I've been testing it a bunch.

I find this to be very, very interesting, especially because I've been working on QLIC Lite.

This codec in my tests achieves low effort JXL level density, like JXL effort 3-7 depending on the image data and effort setting you use, and yet it encodes and decodes very quickly.

Great ram usage, very fast speeds, good file sizes for those speeds, decodes faster than PNG on average while encoding around the same speed as it decodes on average, it really is something.

It honestly made me stop my developments temporarily because it had basically achieved my initial goal on its own. It's also a very unique idea and I really like it. It even has two papers about it if you're interested.

I hope you guys find it as interesting as I did. That's all.


r/compression • • 8d ago

VideoDryer: Free local video compressor (iOS)

Post image
0 Upvotes

r/compression • • 9d ago

Can we efficiently encode decimal digits using smaller number of bits?

9 Upvotes

(the idea is completely mine, but took some help from AI to write the post in a coherent language)

I was exploring this question and thought of a simple variable-length encoding scheme for decimal digits:

  • Digits 0–3 use 3 bits: 000, 001, 010, 011.

  • Digits 4–9 use 4 bits: 1001, 1010, 1011, 1100, 1101, 1110.

Decoding is straightforward:

  • If the first bit is 0, read next 2 bits and convert to decimal.

  • If the first bit is 1, read next 3 bits and convert to decimal and add 3.

  • Then go to the next block.

For the sequence 0123456789, this requires 36 bits instead of 40 bits in Packed BCD or 80 bits in ASCII.

The drawback is "Variable-Length Random Access Overhead": there is no way to access nth digit from the memory, without counting from the beginning again.

My questions:

  1. Is this or similar encoding already known and used?

  2. Are there better alternatives?

  3. Can random access be improved without sacrificing storage efficiency?

I'd appreciate your thoughts and technical feedback.


r/compression • • 9d ago

Tinycodec/TCOM v1.1

Post image
2 Upvotes

GitHub is here: https://github.com/OzzyMitchell/tinycodec

I found that I focused too heavily on whether or not TCOM was tiny, or low lines of code, or compact source, and all that, and so I decided to move away from that obsession a bit because I realized that the benefit of TCOM was not really in whether or not it was the smallest practical codec.

The codec itself is still under 8 kb in terms of the actual size of the core codec. The cli and otherwise is larger of course but the codec itself is still very, well, tiny.

Besides that, I also made it easier for independent benchmarks to be done by making an interactive benchmark terminal of sorts! The full corpus was too large to fit into GitHub practically so I decided to make an image set of 640 images and benchmark on those, so people can benchmark this much easier, plus it's smaller so you don't need a 9950x3d to benchmark it in a practical amount of time.

You can decide which of the 5 codecs to benchmark against, which libpng levels, file/io included or excluded, how many in memory repetitions you'd like to do, and run the test. You can also use any folder of images you want by posting the folder path or individual images if you really want.

That's all. Just wanted to mention the release here.


r/compression • • 10d ago Bravo

Zlib 1.4 Released With More Than One Dozen Security Fixes

Thumbnail
phoronix.com
10 Upvotes

r/compression • • 11d ago

290 categories, I am best in 120 of them

0 Upvotes

I have done some stuff, then filed a pending patent on it.

The short end, I made a 1,2,5 chart with 10 speed categories over 29 different data types. In that I am first place in 120 of the categories, or 41.4%

https://github.com/CombaryMaker/harringtons_insights/blob/main/HX/results/Top_Performers.pdf

https://github.com/CombaryMaker/harringtons_insights/blob/main/HX/

I intend HX to be free for individuals, and to have a price policy for commercial usage. This is all very new, the result of about 5 days research and quick development. The methods, the code, the everything is up for scientific and peer review. Nothing was held back in those regards.

I am willing to answer questions, I can test some software when asked but this week I am running out of time with Claude for the tests.

The short answer for how? I made the most efficient sorting system of them all. Truly a good one. It sorts to types of data, and sometimes it sorts inside the type of data when appropriate. Some other steps, you can peek under the hood so if you are smart enough you will understand.

Look, before you try to troll me, yes it is slow to compress. The tradeoff is the decompress is awesome and so is the compression rate. For places like Steam, Microsoft, Antrhopic, and the likes, this tradeoff is amazingly good. If it takes 100 times the speed, it takes 100 files opened to make it work and that is easy enough to happen. Just consider how many people are looking up old elections right now that were stored in compressed files and are decompressed each time a search is made.


r/compression • • 11d ago

I’ve created a video compressor and audio extractor that requires no configuration—perfect for those who don’t want to deal with complex settings.

Thumbnail reddit.com
0 Upvotes

r/compression • • 11d ago

Would it be possible to compress a lot of images together using a video compression algorithm?

3 Upvotes

to my understanding, video compression works by finding common patters in a video and storing them as just one pattern that gets restored every time the frame is loaded.

So with that in mind, if i had to store something like 50K images, could you hypothetically make a program that uses that video compression algorithm to kinda make a video of 50K frames and stores them in a single file?

Then you would just need to store the metadata in another section of the file witch can be already compressed easily.

Would it be a better way of storing large amount of images? I haven't done much research about any of these topics so you can clown on me, i understand


r/compression • • 12d ago

LZAV 7.1: Improved compression ratio and speed. Achieved complete C/C++ pointer arithmetic compliance. Fast Data Compression Algorithm (inline C/C++).

Thumbnail
github.com
5 Upvotes

r/compression • • 12d ago

Help

0 Upvotes

Trying to compress an 11h videos audio to 10mb, for discord sending purposes, pls help this very necessary file, fr fr trust

Video: https://youtu.be/tvO-LTGIrXo?is=Cv5FjDBfzGUOV6i4