Up your coding game and discover issues early. SonarLint is a free plugin that helps you find & fix bugs and security issues from the moment you start writing code. Install from your favorite IDE marketplace today. Learn more →
BLAKE3 Alternatives
Similar projects and alternatives to BLAKE3
-
-
-
InfluxDB
Access the most powerful time series database as a service. Ingest, store, & analyze all types of time series data in a fully-managed, purpose-built database. Keep data forever with low-cost storage and superior data compression.
-
-
-
-
-
SonarLint
Clean code begins in your IDE with SonarLint. Up your coding game and discover issues early. SonarLint is a free plugin that helps you find & fix bugs and security issues from the moment you start writing code. Install from your favorite IDE marketplace today.
-
STM32-Bootloader
STM32 bootloader example that can jump to 2 apps. (by viktorvano)
-
BLAKE3-specs
The BLAKE3 paper: specifications, analysis, and design rationale
-
blake3
A pure-Go implementation of the BLAKE3 cryptographic hash function (by lukechampine)
-
pocorgtfo
a "Proof of Concept or GTFO" mirror with an extensive index with also whole issues or individual articles as clean PDFs.
-
-
bls-signatures
BLS signatures in C++, using the relic toolkit BLS12-381 (by madMAx43v3r)
-
ripgrep
ripgrep recursively searches directories for a regex pattern while respecting your gitignore
-
chia-blockchain
Chia blockchain python implementation (full node, farmer, harvester, timelord, and wallet)
-
-
-
-
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
BLAKE3 reviews and mentions
-
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.
-
Use Fast Data Algorithms
> However, it must be kept in mind that BLAKE3 is much faster than any other cryptographic hash only because it distributes the computation on all CPU cores.
Surprisingly, this is incorrect. The red bar chart above the fold at https://github.com/BLAKE3-team/BLAKE3 is a single-threaded measurement. What you see there is that BLAKE3 can take better advantage of SIMD parallelism than other hashes, and the C and Rust library implementations do this by default. Multithreading isn't enabled by default, but if you do use it (and you have enough input to feed it) the benefits are multiplicative.
> only 1 cryptographic hash is faster: BLAKE3
SIMD implementations of KangarooTwelve are also about as fast as BLAKE3, given enough input.
-
Linux's getrandom() Sees A 8450% Improvement With Latest Code
BLAKE3 is much faster than blake2s though.. https://github.com/BLAKE3-team/BLAKE3/blob/master/media/speed.svg
-
Rust is more portable than C for pngquant/libimagequant
Everything under c/blake3_c_rust_bindings/ is used for testing the code in c/. In this case the bindgen output is copied in and committed, but in other projects I've run Bindgen inside build.rs, which is what Bindgen folks recommend.
-
Linux Kernel RNG is now Blake2 instead of SHA1 and 3x faster
https://github.com/BLAKE3-team/BLAKE3/blob/master/media/spee... argues BLAKE2s is twice as fast compared to SHA256.
One aspect switching from SHA1 to BLAKE2s does is it increases the total entropy a single compression operation adds to ChaCha20. This increases speed when folded BLAKE2s adds 128 bits per operation instead of folded SHA-1 that adds 80 bits. So that's two calls instead of four (I'm assuming they kept the folding). Another speedup comes from the fact the hash function constants aren't being filled with RDRAND inputs for every call.
Finally, I'm not completely sure if increasing the hash size itself adds computational security against an attack where the internal state is compromised once, and the attacker tries to brute force the new state based on new output; My conjecture is the reseeding operation is atomic, i.e. that ChaCha20 won't yield anything until the reseed is complete. There shouldn't thus be any difference in this regard. I'd appreciate clarification wrt this.
https://www.blake2.net/ says: "CONSIDER USING BLAKE3, faster than BLAKE2, see https://github.com/BLAKE3-team/BLAKE3"
I'm glad we're on Blake2 and seeing the benefits, but why not go straight to Blake3?
What are the differences and why do they matter in this instance?
-
A note from our sponsor - SonarLint
www.sonarlint.org | 26 Mar 2023
Stats
BLAKE3-team/BLAKE3 is an open source project licensed under GNU General Public License v3.0 or later which is an OSI approved license.