atiedebee

6 ms·

31.
by atiedebee 3mo ago
Except that brotli uses Huffman coding. It's main claim to fame is using higher order statistics to select a Huffman table and its built-in dictionary. This class of compression programs sees larger differences due to the way the data
32.
by atiedebee 3mo ago
Which slice? The large text compression benchmark uses enwik8 for a "smaller" input that is easily reproducible. The predictability of enwik9 can vary significantly depending on where in the file you are, as shown by Matt Mahoney
33.
by atiedebee 4mo ago
It depends on the format. Brotli switches the Huffman codes used based on the previously decoded bytes, but gzip and bzip2 for example use the same Huffman codes for a bigger block of data. But even then, there might be some more details th
34.
by atiedebee 4mo ago
I imagine you would want to test "idiomatic" code for these comparisons. It doesn't make much sense to compile with C++ and write everything in C.
35.
by atiedebee 5mo ago
Another interesting one is the ZPAQ compression program[1]. It is one of the top performers on the large text compression benchmark[2] and uses the bytecode to specify how to model the data. [1]: https://en.wikipedia.org/wik
36.
by atiedebee 5mo ago
I hope the brakes in my car don't need developers
37.
by atiedebee 5mo ago
Does HN randomly charge you money for using these phrases?
38.
by atiedebee 6mo ago
I made a program with some inline assembly and tried O3 with clang once. Because the assembly was in a loop, the compiler probably didn't have enough information on the actual code and decided to fully unroll all 16 iterations, making
39.
by atiedebee 7mo ago
> I don't know about survival bias. LLMs are well suited to this task of taking in this cloud of soft data like a description of symptoms and spitting out a potential diagnosis. And it will do so confidently and incorrectly. A singl
40.
by atiedebee 7mo ago
A lot of them are better in many areas. JPEG is just good enough (tm)
41.
by atiedebee 7mo ago
I read a while back that bzip2 is named that way because the original bzip used arithmetic coding. The person who made bzip then made bzip2 to use Huffman coding due to patent problems with arithmetic coding.
42.
by atiedebee 7mo ago
bzip3 is very different from bzip2. It is not even made by the same person and is not nearly as ubiquitous.
43.
by atiedebee 7mo ago
> I know this position is wrong, but it feels hard to spend my time on something that someone else might not have spent the time to create I don't think that position is wrong. I felt similarly when tutoring a high-school student re
44.
by atiedebee 8mo ago
ISO C99 actually defines multiple types of deviating behaviour. What you're describing is closer to implementation-defined behaviour than anything else. The three behaviours relevant in this discussion, from section 3.4: 3.4.1 impl
45.
by atiedebee 8mo ago
Recompiling the dependencies should only really happen if you change the file with the implementation include (usually done by defining <library>_IMPLEMENTATION or something like that.
46.
by atiedebee 9mo ago
I checked the spec and Scheme R5RS does have lazy evaluation in the form of promises using "delay" and "force", but I can see why explicitly having to put those everywhere isn't a good solution.
47.
by atiedebee 9mo ago
Im very familiar with Nix or the language, but why would interpreting guile scheme for package management be expensive? What are guix and nix doing that would require evaluating everything lazily for good enough performance?
48.
by atiedebee 9mo ago
Ran the tests again with some more files, this time decompressing the pdf in advance. I picked some widely available PDFs to make the experiment reproducable. file | raw | zstd (%) | brotli (%) |
49.
by atiedebee 9mo ago
I wasn't sure. I just went in with the (probably faulty) assumption that if it compresses to less than 90% of the original size that it had enough "non-randomness" to compare compression performance.
50.
by atiedebee 9mo ago
I thought the same, so I ran brotli and zstd on some PDFs I had laying around. brotli 1.0.7 args: -q 11 -w 24 zstd v1.5.0 args: --ultra -22 --long=31 | Original | zstd | brotli RandomBook.pdf | 15M | 4.6M
51.
by atiedebee 9mo ago
> There is no common word for Queen in Germanic languages Correct me if I am misunderstanding what you meant, but Dutch has koningin and German has Königin? They are basically a feminized version of king.
52.
by atiedebee 9mo ago
Wait, how is that different from WhatsApp?
53.
by atiedebee 10mo ago
I think they meant the gameplay side of things instead of the engine
54.
by atiedebee 10mo ago
Its interesting how early programming languages are mentioned as having proper names. In the 60s we went from BCPL to B to C. B and C are not descriptive at all. Should they have been named "operating systems language" or "po
55.
by atiedebee 11mo ago
Does it support C99 with VLAs yet?
56.
by atiedebee 11mo ago
I used vim for about one year before switching to kakoune. Using vim motions in Intellij or just vim hasn't been a problem for me at all. I don't use very advanced shortcuts (the most complicated motions I ever use are ciw and the
57.
by atiedebee 1y ago
It's used for vector quantization which can be used for color quantization
58.
by atiedebee 1y ago
In C I've personally always just done 'a' + x, no table needed
59.
by atiedebee 1y ago
Except that ripgrep isn't actually a drop-in replacement for grep as it behaves differently. It is a nice program don't get me wrong, but it is not interchangeable with grep.
60.
by atiedebee 1y ago
Yea so overflow/underflow are a problem with signed integers, not unsigned ones. Promotion rules might be the only candidate for hidden complexity here I guess

More ›