Dropbox Open Sources DivANS: a Compression Algorithm In Rust Compiled To WASM (dropbox.com)
Slashdot reader danielrh writes: DivANS is a new compression algorithm developed at Dropbox that can be denser than Brotli, 7zip or zstd at the cost of compression and decompression speed. The code uses some of the new vector intrinsics in Rust and is multithreaded. It has a demo running in the browser.
One of the new ideas is that it has an Intermediate Representation, like a compiler, and that lets developers mashup different compression algorithms and build compression optimizers that run over the IR. The project is looking for community involvement and experimentation.
One of the new ideas is that it has an Intermediate Representation, like a compiler, and that lets developers mashup different compression algorithms and build compression optimizers that run over the IR. The project is looking for community involvement and experimentation.
It's not mentioned in the article but DivANS is released under the Apache License.
Frost ladies
Its main upside appears to be being written in rust. Well done, chaps, for such astounding relevance in your rust movement community contributions.
They're using spaces...
YOU FAIL IT!
What's the Weissman score?
I like Dropbox and I'm sure they have a nice algorithm, but . . .
Does nobody remember the ultimate compression algorithm from 1995 that could scrunch any amount of data to less than 1024 bytes. The DataFiles/16 program got quite a lot of publicity for WEB Technologies.
As I recall there were some inconveniences; for instance for really serious compression one had to run the software multiple times- compress, then compress the resulting file, then compress that resulting file. Nevertheless that was a lot of compression! There were minor technical glitches. For example, the decompressed file was quite unlike the original.
...omphaloskepsis often...
Hard Drive Cost Per Gigabyte — July 2017
Looks like we're on track for $20/TB, if you purchase in bulk.
Let's monetize a "huge difference" at $1000 (which I regard as the smallest available value for a "huge difference").
Thus, your 1% extra compression needs to save 50 TB to make a "huge difference" of one large.
Correct me if I'm wrong, but I'm thinking your dataset needs to be on the order of 5 PB for a 1% compression improvement to shave 50 TB.
5 PB works out to 200,000 single-layer Blu-ray disks.
Nice home library. (I think we can already safely assume it's not mostly drama, unless you're Pacman-ratting a good half of the entire IMDB movie list, behind the darknet spider from hell.)
And no petty-authoritarian Progressive "code of conduct"! So us deplorable straight men are free to contribute. Good call, Dropbox, good call.
Storage costs are negligible. Itâ(TM)s the cost and speed of transmission.
The more a compression algorithm can compress one file, there has to be another file that it actually makes larger. Entropy is a bitch.
Some drink at the fountain of knowledge. Others just gargle.