BLAKE3
smhasher
Our great sponsors
BLAKE3 | smhasher | |
---|---|---|
36 | 30 | |
4,566 | 1,690 | |
2.0% | - | |
8.1 | 7.1 | |
18 days ago | about 2 months ago | |
Assembly | C++ | |
GNU General Public License v3.0 or later | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
BLAKE3
-
Reasons to Prefer Blake3 over Sha256
> might be easier with a public domain license instead of the current ones
There reference implementation is public domain (CC0) or at your choice Apache 2.0
https://github.com/BLAKE3-team/BLAKE3/blob/master/LICENSE
-
Google abandons work to move Assistant smart speakers to Fuchsia
Fyi, blake3 was released in 2019 and should probably be used over blake2 unless you have some strong reason not to. It's basically a reimplementation of blake2 with performance tweaks.
https://github.com/BLAKE3-team/BLAKE3
-
Six times faster than C
Many people will argue that today's compilers are so smart/optimized that you'd be a fool to try to outsmart the compiler with asm. I'm not 1 of them, but I know some. IMO it's all a bunch of bullshit, there's a goddamn reason all the cryptocurrency mining CPU/GPU code is all hand-written asm. there's a reason blake3 is written in asm ( https://github.com/BLAKE3-team/BLAKE3/blob/master/c/blake3_sse41_x86-64_windows_msvc.asm ) - but the thing is, 99.99% of the time, life is too short to outsmart the compiler (unless you're Alexander Yee)
-
[QUESTION] Low speeds when creating blake3 checksum?
I have been trying to optimize my code to create a fast hashing function to create and check b3 file integrity but b3sum is way way faster than my aproach, i have been trying to modify my code acordingly to https://github.com/BLAKE3-team/BLAKE3/blob/master/b3sum/src/main.rs with no luck, so if anyone can give me some tips/clues on how to achieve better speeds it would be incredible. Thx!!
-
A good hash function for DEFLATE?
BLAKE3 might be faster than KangarooTwelve and is also an XOF. It doesn't have the benefit of getting a working RFC draft proposal however.
-
PoxHash, a bespoke denovo hashing algorithm implemented dep-free in Rust and 5 other languages. Rust compiled with rustc with -O is faster than GCC-compiled C with -O3!
You're saying the hash speed is 133 kB/s? That's extremely slow, for example BLAKE3 achieves 6.8 GB/s which is over 50000 times faster. Nobody wants to use such a slow hash function.
-
What's everyone working on this week (4/2023)?
Try this one if you want a smaller, and particularly interesting crate: https://github.com/BLAKE3-team/BLAKE3
-
New Ryzens and Chia plotters
blake3 is a cryptographic hashing function, which is used during plotting's "forward propagation" step
-
Image displays its own MD5 hash
BLAKE3 claims to be faster and more secure than both MD5 and SHA1.
-
Good hasher for 256-byte keys?
More information: https://github.com/BLAKE3-team/BLAKE3
smhasher
-
GxHash - A new (extremely) fast and robust hashing algorithm 🚀
The algorithm passes all SMHasher quality tests and uses rounds of AES block cipher internally, so it is quite robust! For comparison XxH3, t1ha0 and many others don't pass SMHasher (while being slower).
-
The PolymurHash universal hash function
Confirmed, I tested it. https://github.com/rurban/smhasher
-
Show HN: Discohash – simply, quality, fast hash
There's lots of great hash functions out there: some are super fast, like xxhash and highly optimized, others are also super fast umash and based on interesting math ideas from finite fields^1, while maintaining high quality (according to SMHasher). Others are also fast and interesting (tabulation hash, that may sometimes be seemingly universal), one of the main originators of those ideas are Mikkel Thorup^2. Anyway, a couple of years ago I also tried my hand at building hashes and created a few that passed SMHasher (tifuhash ~ a floating point hash, beamsplitter - a seemingly-universal tabulation style hash, and this one discohash - a "more traditional" ARX-based design (addition rotation xor)^3 ).
0: https://github.com/rurban/smhasher/blob/master/xxh3.h
1: https://pvk.ca/Blog/2022/12/29/fixing-hashing-modulo-alpha-e...
2: https://arxiv.org/abs/1505.01523
3: https://eprint.iacr.org/2018/898.pdf https://crypto.polito.it/content/download/480/2850/file/docu...
4: https://en.wikipedia.org/wiki/BLAKE_(hash_function)
Discohash (posted here) is the fastest one I made, it's simple and doesn't rely on any arch-specific optimizations or vector instructions (AVX etc ~ tho I suppose...they could be added? I'm definitely no expert in them, I barely get away with doing the C/C++ implementations!)
The main mixing round function is:
mix(const int A) {
-
A Vulnerability in Implementations of SHA-3, Shake, EdDSA
ubsan, asan, valgrind tests are missing. some do offer symbolic verification of the algo, but not the implementations.
See my https://github.com/rurban/smhasher#crypto paragraph, and
-
Academic Urban Legends
The spinach story reminds me a lot on the false recommendation of siphash for hash table DDOS prevention. https://github.com/rurban/smhasher#security
The authors came up in their widely cited paper with a proper solution to spread the random hash seed into the inner loop, vastly enhancing its security by avoiding trivial hash collision attacks. But a secure, slow hash function can never prevent from normal hash seed attacks, when the random seed is known somehow. esp. with dynamic languages it's trivial to get the seed externally.
Other trivial countermeasures must be used then, which also don't make hash tables 10x slower, keeping them practical.
- SHA-1 is out. NIST recommends switching to the SHA-2 and SHA-3 groups of hash algorithms as soon as possible, with an official deadline of Dec. 31, 2030.
- Adventures in Advent of Code
-
New ScyllaDB Go Driver: Faster Than GoCQL and Its Rust Counterpart
This is the best, most comprehensive hash test suite I know of: https://github.com/rurban/smhasher/
you might want to particularly look into murmur, spooky, and metrohash. I'm not exactly sure of what the tradeoffs involved are, or what your need is, but that site should serve as a good starting point at least.
-
What do you typically use for non-cryptographic hash functions?
Here is a good comparison table, as you can see, BLAKE can perform in secure way much faster than crc32, so my original point, - to use non weak hashes unless you really have a reason/requirement not to do so
-
What hash function you use for hash maps / hash tables?
smhasher is a great place to testing results for a massive number of hash algorithms.
What are some alternatives?
xxHash - Extremely fast non-cryptographic hash algorithm
Hashids.java - Hashids algorithm v1.0.0 implementation in Java
wyhash - The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.
highwayhash - Fast strong hash functions: SipHash/HighwayHash
libsodium - A modern, portable, easy to use crypto library.
png-decoder - A pure-Rust, no_std compatible PNG decoder
STM32-Bootloader - STM32 bootloader example that can jump to 2 apps.
rustls - A modern TLS library in Rust
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash
Halide - a language for fast, portable data-parallel computation