News to me, but a guy named Sam Russell came up with a new software only CRC32 algorithm that is competitive with hardware accelerated implementations. It's a surprisingly elegant solution.
What are the units on the vertical axes for figures 1 and 2? I might have guessed seconds per TiB but the braiding line doesn't seem to match what's in figure 3.
> This implementation is named after the Serbian singer
Bora Đorđević (also known as Bora Čorba) who was born
in 1952 and died in 2024. His birth year matches the
number of the GZIP standard RFC 1952 that describes
a common CRC32 implementation, and the original proof
of concept for this method used the polynomial x21 +x15 +
x14 + x11 + x10 + x7 + x3 which is x1952×8 mod G(x).
This repo's readme gives a great overview of the previous-best approaches (as of ~6 years ago): https://github.com/komrad36/CRC
Anyone can replicate the results? In any case, works like this give me moments of epiphany when I start to believe the humanity is not totally lost.
News to me, but a guy named Sam Russell came up with a new software only CRC32 algorithm that is competitive with hardware accelerated implementations. It's a surprisingly elegant solution.
What are the units on the vertical axes for figures 1 and 2? I might have guessed seconds per TiB but the braiding line doesn't seem to match what's in figure 3.
In Spain, "chorba" is very informal slang for "gal" [0]. Not vulgar, just very informal vernacular.
[0] https://dle.rae.es/chorbo
Chorba is also soup in Eastern European languages like Bulgarian and Romanian.
https://en.wikipedia.org/wiki/Chorba
All this talk of soup making me wonder if these are Arabic/ME derivatives.
Then again there are like 10 different ways to refer to soup in the various dialects.
and is a traditional Tunisian soup
/Edit: actually in all North Africa https://en.wikipedia.org/wiki/Chorba
> Dedication
> This implementation is named after the Serbian singer Bora Đorđević (also known as Bora Čorba) who was born in 1952 and died in 2024. His birth year matches the number of the GZIP standard RFC 1952 that describes a common CRC32 implementation, and the original proof of concept for this method used the polynomial x21 +x15 + x14 + x11 + x10 + x7 + x3 which is x1952×8 mod G(x).
That is indeed dedication.