palaiologos

5 ms·

1.
Automake-1.19 Released [Stable](lists.gnu.org)
2 points by palaiologos 24d ago|0 comments
2.
by palaiologos 27d ago
Hi Ivan, Please send me an e-mail! Perhaps we can figure something out.
3.
by palaiologos 27d ago
Tool author here. Sure, out of all bait in this thread I will bite this one. Curiously, it seems like Konstantinos has opened this ticket, i.e. https://github.com/iczelia/bzip3/issues/177 , and open-sourced
4.
by palaiologos 27d ago
Tool author here. bzip2 also has this clause, in fact it has been lifted from its dist tarball README verbatim. So does lzma, xz, or in practice any open source program that you use.
5.
by palaiologos 29d ago
I use the PAQ terminology as it is likely to be familiar to other compression experts. However, the lineage to PAQ is very, very limited, and many other compressors also re-use its common ideas.
6.
Balrogg: Demonically compacting (up to 15%) lossless Vorbis/Opus recompressor(github.com)
108 points by palaiologos 1mo ago|20 comments
7.
by palaiologos 2y ago
Hi, tool author here. Huffman coding is a static minimum-redundancy code. What this means is that it finds an optimal assignment of bit sequences to letters in the input alphabet (commonly US-ASCII or extensions). This however means that Hu
8.
by palaiologos 2y ago
Hi, tool author here! Thank you for your benchmark! As you may be aware, different compression tools fill in different data type niches. In particular, less specialised statistical methods (bzip2, bzip3, PPMd) generally perform poorly on va
9.
by palaiologos 2y ago
Hi, tool author here! Regarding your first remark: high ratio data compression has its time and place, and I personally understand that to many people it is not very desirable. In a lot of scenarios something as plain and simple as LZ4 gene
10.
by palaiologos 2y ago
Hi! Tool author here. Almost every single open source compression tool contains a clause like this. For example, the one in the README that you see has been directly lifted from the bzip2 README. Almost all open source projects come with su
11.
by palaiologos 2y ago
they're looking for a compressor that can do more than 200MB/s on a 10mW machine (that's including radio, so it has to run on a CPU clocked like original 8086) and yield 200x size improvement. speaking from the perspective of
12.
by palaiologos 3y ago
Yeah, I can kind of relate, actually! Now I am 19, have a job and attend a somewhat demanding university, outside of (more useful?) real world research I am currently doing. I wrote the code when i was c.a. 15 - 16, I could definitely impro
13.
by palaiologos 3y ago
Thank you for the kind comments! Unfortunately, the BLC interpreter is much slower than MalbolgeLISP, even when using fast20 (with a lot of optimisations coined by dzaima). My memory is a bit hazy, but one of the main roadblocks that made B
14.
by palaiologos 4y ago
hi, most of the code in my repository has to work around various C problems (e.g. no generics), so match32 and match64 are the same functions that work on differently sized buffers - if I had generics and RAII, the diffing and patching sour
15.
by palaiologos 4y ago
I'm sharing a tool that I have been working on in hopes that someone finds it useful. The tool serves the purpose of binary patching in game updates and personal incremental backups. Thanks to a different SA-IS algorithm and parallel c
16.
Qbdiff – building and applying patches to binary files(github.com)
26 points by palaiologos 4y ago|4 comments
17.
by palaiologos 4y ago
I haven't figured a libsais fix and my LZP fix changes the functionality a little (removes chunking for better compression at a rather small runtime cost), so I don't think the author would like me to submit it. I have opened tick
18.
by palaiologos 4y ago
You've literally tested it on a single file, enwik8. That's not enough to extrapolate valuable results. One of the benchmarks: time ./bsc e ../linux.tar linux.bsc -e2 -b16 -T 68.69s user 1.14s system 99% cpu 117M m
19.
by palaiologos 4y ago
Consider using `-c`, which makes the compressor use standard streams, or pull the main branch because I had just pushed a tiny patch that automatically enables it when no positional arguments are given.
20.
by palaiologos 4y ago
lies. not specifying -e displays an error message: % bzip3 -e -j 6 -b 50 corpus/calgary.tar % bzip3 -j 6 -b 50 corpus/calgary.tar bzip3 - A better and stronger spiritual successor to bzip2. Copyright (C) by Kamila Szewcz
21.
by palaiologos 4y ago
it's `bzip3 -e -j 6`. you need a space.
22.
by palaiologos 4y ago
no compressor tests the output while compressing as it hurts the performance. you can do it after compressing, though, using `bzip3 -t`.
23.
by palaiologos 4y ago
zstd -19 linux.tar 462.58s user 0.76s system 100% cpu 217M memory 7:42.56 total % wc -c linux.tar.zst linux.bz3 134980904 linux.tar.zst 129255792 linux.bz3
24.
by palaiologos 4y ago
Frankly, same holds for gzip. I've been planning to relicense bzip3 with the more permissive LGPLv3.
25.
by palaiologos 4y ago
it's fairly common, at least in the circles i usually dwell in, to call compression ratio "compression _strength_". bzip3 is _better_ than bzip2 since it uses a better technological model as outlined in one of my replies.
26.
by palaiologos 4y ago
bzip3 usually operates on bigger block sizes, up to 16 times bigger than bzip2. additionally, bzip3 supports parallel compression/decompression out of the box. for fairness, the benchmarks have been performed using single thread mode,
27.
Bzip3 – A better and stronger spiritual successor to bzip2(github.com)
158 points by palaiologos 4y ago|104 comments
28.
by palaiologos 5y ago
... maybe :). A while ago I published a writeup on programming in the Seed language ( https://esolangs.org/wiki/Seed ) and made the best Mersenne Twister cracking program to date (which is described, alongside source cod
29.
by palaiologos 5y ago
yes!
30.
by palaiologos 5y ago
I think that you never touched Malbolge yourself. > anything can be trivially transpiled to any turing-complete language regardless of the "difficulty" of the language once basic operators are established Yes! It already was. T

More ›