hexxagone

6 ms·

1.
by hexxagone 7mo ago
Then you should take a look at https://github.com/flanglet/kanzi-cpp : it is optimized for fast roundtrips, multi-threaded by design and produces a seekable bitstream.
2.
by hexxagone 7mo ago
In the LZ high compression regime where LZ can compete in terms of ratio, BWT compressors are faster to compress and slower to decompress than LZ codecs. BWT compressors are also more amenable to parallelization (check bsc and kanzi for mod
3.
by hexxagone 7mo ago
Notice that bzip3 has close to nothing to do with bzip2. It is a different BWT implementation with a different entropy codec, from a different author (as noted in the GitHub description "better and stronger spiritual successor to BZip2
4.
by hexxagone 2y ago
There are experts working at the commission.
5.
Show HN: Kanzi, fast lossless data compression(github.com)
15 points by hexxagone 2y ago|3 comments
6.
by hexxagone 3y ago
Is BFMTV also biased when reporting words directly from the mouth of Piotr Tolstoi or are you just trolling ?
7.
by hexxagone 3y ago
You mean like Piotr Tolstoi talking about nuking Paris on BFMTV just today ? ( https://fr.yahoo.com/news/calcule-proche-vladimir-poutine-%C... ).
8.
by hexxagone 4y ago
It is not. Just look at the frequencies in the data (histogram) and compute the order 0 entropy. Then you know if your data is compressible.
9.
by hexxagone 4y ago
Go does not have threads but something like "tasks". The fact that no thread handle is exposed allows for transparently moving these tasks across threads if the scheduler decides so. "go makes concurrency a first-class concep
10.
by hexxagone 4y ago
the "god particle" was actually the "goddamn particle" https://www.businessinsider.com/why-the-higgs-is-called-the-...
11.
by hexxagone 5y ago
"Ukraine did not behave reasonably" UH ?
12.
by hexxagone 5y ago
"Turns out a good arith coder is much faster". Citation needed.
13.
by hexxagone 5y ago
In data compression, inverting a BWT with large blocks or using Context Mixing to compress large blocks (which requires huge context maps). These 2 cases require a lot of random memory accesses.
14.
by hexxagone 5y ago
I am sure the Scotts and Irish are thrilled by the change.
15.
by hexxagone 5y ago
Arguably the EU is enforcing the rights of their citizens more than in many other places (eg. GDPR). Ultimately the EU citizens should vote when there are parliament elections instead of complaining about the bureaucrats afterwards. Only 50
16.
by hexxagone 5y ago
If you knew anything about the EU institutions, you would know that the Commission's role is only to enforce rules that member states have agreed upon but it has _no_ power. Of course facts do not fit with the Brexiters' rhetoric.
17.
by hexxagone 5y ago
No mention of Louis Pasteur ? Odd.
18.
by hexxagone 5y ago
Isn't it how free markets work ?
19.
by hexxagone 5y ago
The Huffman encoding loop is 2 lines and decoding loop is 4 lines of branchless code. Do you have an example of branchless arithmetic encoder or decoder ?
20.
by hexxagone 5y ago
pigz is no match for zstd...
21.
by hexxagone 5y ago
"Arithmetic coding is much, much simpler." Let us agree to disagree. "And decompression speed is not a limiting factor in most applications of data compression like this". It depends on the application. Zstd and Brotli
22.
by hexxagone 5y ago
"FSE achieves markedly higher compression ratio". I do not thin it is true, FSE/ANS achieves slightly better ratios in general. Zstd uses both Huffman (for large alphabets) and FSE (for small alphabets).
23.
by hexxagone 5y ago
PAQ and PPM are not fast, certainly not in the same category as LZ codecs.
24.
by hexxagone 5y ago
Huffmann is rather simple and hard to beat in decompression speed.
25.
by hexxagone 5y ago
You mean like zstd and brotli ? Is there any new LZ codec not using Huffman ?