Hashids.java
xxHash
Hashids.java | xxHash | |
---|---|---|
31 | 28 | |
1,012 | 8,462 | |
0.3% | - | |
0.0 | 8.4 | |
6 months ago | 8 days ago | |
Java | C | |
MIT License | 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.
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
xxHash
-
The One Billion Row Challenge in CUDA: from 17 minutes to 17 seconds
> GPU Hash Table?
How bad would performance have suffered if you sha256'd the lines to build the map? I'm going to guess "badly"?
Maybe something like this in CUDA: https://github.com/Cyan4973/xxHash ?
- ETag and HTTP Caching
-
Day 64: Implementing a basic Bloom Filter Using Java BitSet api
Examples of fast, simple hashes that are independent enough includes murmur, xxHash, Fowler–Noll–Vo hash function and many others
- Closed-addressing hashtables implementation
-
NIST Retires SHA-1 Cryptographic Algorithm
If you're only using the hash for non-cryptographic applications, there are much faster hashes: https://github.com/Cyan4973/xxHash
-
Does the checksum algorithm crc32c-intel support AMD Ryzen series 3000 or newer?
I found the benchmark result of AMD ryzen 5950X
-
[Study Project] A memory-optimized JSON data structure
But what's the catch, you're thinking ? Well, it is a bit slower than its counterparts when it comes to deserializing (and marginally faster for serializing). To achieve smaller footprint, it uses a few tricks and notably a custom hash table to deduplicate strings. This comes at a cost of course (even when featuring xxHash to speed things up), but keeps the slowdown reasonable (I think).
-
What do you typically use for non-cryptographic hash functions?
Non cryptographic hashes has collisions, for example, assume you having content like "abcdefg" which hashed value is "123", in case of weak hash algorithm some other content like "abcdefZ" can also have a hash "123" which basically means such hash function is failed to be unique fingerprint of particular content. BLAKE3 for example can do 6-7Gb/s which make it pretty fast and secure. If your requirement accepts collision with defined error rate, I would advise you to take a look at XXH3 if you need very snappy hash algorithm, which can run at pace or RAM access (30GB/s+), but again, run tests at particular equipment you targeting, may be AES hardware accelerated MeowHash will serve you better.
- C++ gonna die😥
- rsync, article 3: How does rsync work?
What are some alternatives?
BLAKE3 - the official Rust and C implementations of the BLAKE3 cryptographic hash function
uuid7 - UUID version 7, which are time-sortable (following the Peabody RFC4122 draft)
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash
Guava - Google core libraries for Java
xxh - 🚀 Bring your favorite shell wherever you go through the ssh. Xonsh shell, fish, zsh, osquery and so on.
JGit - JGit project repository (jgit)
blake3 - An AVX-512 accelerated implementation of the BLAKE3 cryptographic hash function
Embulk - Embulk: Pluggable Bulk Data Loader.
smhasher - Hash function quality and speed tests
JADE - a pug implementation written in Java (formerly known as jade)
swift-crypto - Open-source implementation of a substantial portion of the API of Apple CryptoKit suitable for use on Linux platforms.