Hacker Newsnew | past | comments | ask | show | jobs | submit | spyc's commentslogin

Please report any build errors in the GitHub issue tracker so that the isseu can be fixed for everyone. Thank you!

How is this source code the original source and which parts? Please elaborate.

Source of agiannis_text. He probably decompiled it.

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 his algorithm here -- https://codeberg.org/kagiannis/gdcc-2021. As the allegation is very serious, I will also copy the edited version of this response to my website.

I have not seen his tool before, or even was aware of it. However, once you take a closer look, you notice that these two tools could not be more dissimilar. Agiannis' compressor uses a compact context representation to group bytes, followed by RLE and prefix coding. Bzip3 combines repetition removal (here via a run-length code -- prior to the BWT -- and LZP of Charles Bloom), a full Burrows–Wheeler transform, and a richer (thus slower) statistical arithmetic coder. The use of RLE for post-coding the BWT output dates as far back to Julian Seward, perhaps even further. The RLE and LZP are applied before the Burrows-Wheeler transform (as opposed to the implementation in `text', which makes a big difference). Bzip3 uses a proper SAIS library for the forward and backward transforms. Konstantinos' entropy coder seems to use FPC (bytewise prefix codes over adaptively selected subblocks), bzip3 uses an idea similar to this of bcm, which itself descends from Mahoney and ancient work of JS Vitter on arihtmetic coding, where a bitwise arihtmetic coder is input mixed probability estimates from exponential-moving averages with probability refinement.

You are welcome to conduct your own analysis, but this is the gist of it -- perhaps Konstantinos has convinced himself that he had invented run-length coding?


sorry palaiologos. I just looked into the code and it is different enough from my compressor. I just looked the description and it looked similar sorry. Just tested it with enwik9

agiannis_text enc 0m16,319s dec 0m15,594s size 270365918

bzip3 enc 1m36,544s dec 1m43,699s size 169990721


I think he meant to say "prioritize" so that availability related work sees results sooner — "acceleration" — than it would without an increase in priority.


That's a great question!


Both libexpat ("Expat") and uriparser are following the curl security vacation and will not accept new vulnerability reports before 2026-08-01, starting today.

[1] https://github.com/libexpat/libexpat/issues/1277

[2] https://github.com/uriparser/uriparser/issues/323


The current implementation breaks semantics of functions with tail recursion from within loops: https://github.com/raaidrt/tacopy/issues/1


Potentially the movie itself is also or more of interest. The related thread is: https://news.ycombinator.com/item?id=45056377


Both implementations of doas for Linux have (the same) unfixed security issue:

- https://github.com/Duncaen/OpenDoas/issues/106

- https://github.com/slicer69/doas/issues/110

I have a hard time recommending doas over sudo on Linux when the issue has been fixed in sudo but not in doas.


Those should be closed WONTFIX. Neither doas nor sudo can protect you from the consequences of running untrusted code and must not attempt to do so because it adds needless complexity to safety-critical software.


Which distros still have TIOCSTI enabled in their kernel? I just checked for Arch and it's disabled.


Lost trust for sure. Who knows if Redis would be AGPL now if Valkey did not exist.


If anyone wonders what atop looks like at runtime or what it would be useful for, there's a video dedicated to the tool at https://www.youtube.com/watch?v=27AtCR5ftyM .


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: