BLAKE3
Hashids.java
Our great sponsors
BLAKE3 | Hashids.java | |
---|---|---|
36 | 31 | |
4,566 | 1,010 | |
2.0% | 0.1% | |
8.1 | 0.0 | |
17 days ago | 6 months ago | |
Assembly | Java | |
GNU General Public License v3.0 or later | MIT License |
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
Hashids.java
- Hashids: Generate short unique ids from integers
-
Auto Generate Sequential UIID
You basically want Hashids but sequential? Why not simple convert a base 10 (0-9) number to hex? (0-F)
-
Features I'd Like in PostgreSQL
I found hashids [1] to be a great compromise between integer ids in the database and copyable non-enumerable strings on the client.
[1] https://hashids.org/
- Short, friendly base32 slugs from timestamps
-
We Chose NanoIDs for PlanetScale’s API
I wonder how this might compare to just storing regular autoincrementing ints in the database, and converting to/from hashids (https://hashids.org/) at the edge. It eliminates the collision concern and stores more compactly at the cost of a tiny amount of encode/decode when processing requests. You’d want to push it down as close to the database layer as possible to avoid inadvertent int ID leaks; I added native hashids support to clickhouse but I’m not sure what other database support might entail.
-
How can I generate truly unique slugs?
Since hashids are not really hashes and are not secure at all this is not even achieved. Hashids can be easily decoded without the salt by a simple brute-force attack described by the authors of hashid themselves right on their website: https://hashids.org/
-
How to handle id-based routes with UUID
You don't necessarily need to use UUIDs. You could use something like Hashids to generate random strings from your sequential IDs in a reversible way, so that users can't predict what their values will be, but you can decode them as needed.
-
All of my database models have id replaced with UUID4s. Is there any risk to using these in URLs?
You should not use UUIDv4 as a primary key. You can use normal int values and then use hashids to make them safe for URL. UUIDv7 might be good to use as well once they are more widely supported as well.
- What’s Django’s argument for using 64-bit int as default pk over uuid. Can anyone point me to something I can read?
- Library for generating string IDs from number IDs
What are some alternatives?
xxHash - Extremely fast non-cryptographic hash algorithm
uuid7 - UUID version 7, which are time-sortable (following the Peabody RFC4122 draft)
highwayhash - Fast strong hash functions: SipHash/HighwayHash
Guava - Google core libraries for Java
libsodium - A modern, portable, easy to use crypto library.
JGit - JGit project repository (jgit)
STM32-Bootloader - STM32 bootloader example that can jump to 2 apps.
Embulk - Embulk: Pluggable Bulk Data Loader.
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash
JADE - a pug implementation written in Java (formerly known as jade)
smhasher - Hash function quality and speed tests
CRaSH - The shell for the Java Platform