presents
vanity-uuid
presents | vanity-uuid | |
---|---|---|
1 | 1 | |
7 | 6 | |
- | - | |
10.0 | 10.0 | |
over 5 years ago | about 4 years ago | |
Go | Shell | |
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.
presents
-
New UUID Formats from IETF
I’ve been working on a robust scheme for encrypted sequential IDs, which is done, including implementations in Rust, JavaScript and Python, pending just a smidgeon more writing about it and reviewing a decision on naming. You store an integer in the database, then encrypt it with a real block cipher, and stringify with Base58. I have three modes: one for 32-bit IDs, using Speck32/64 and producing 4–6 character IDs; one for 64-bit IDs, using Speck64/128 and producing 8–11 character IDs; and one hybrid, using the 32-bit mode for IDs below 2³² and the 64-bit mode above that, providing both a forwards-compatibility measure and a way of producing short IDs as long as possible. Contact me (see my profile) if you’re interested, or I’ll probably publish it in another day or two. Trouble is that I’ve been getting distracted with other related concepts, like optimally-short encoding by using encryption domains [0, 58¹), [58¹, 58²), …, [58¹⁰, 2⁶⁴) (this is format-preserving encryption; the main reputable and practical choices I’ve found are Hasty Pudding, which I’ve just about finished implementing but would like test vectors for but they’re on a dead FTP site, and NIST’s FF1 and FF3, which are patent-encumbered), and ways of avoiding undesirable patterns (curse words and such) by skipping integers from the database’s ID sequence if they encode to what you don’t want, and check characters with the Damm algorithm. If I didn’t keep getting distracted with these things, I’d have published a couple of weeks ago.
(I am not aware of any open-source library embodying a scheme like what I propose—all that I’ve found have either reduced scope or badly broken encryption; https://github.com/yi-jiayu/presents is sound, but doesn’t stringify; Hashids is broken almost beyond belief and should not be considered encryption; Optimus uses an extremely weak encryption.)
vanity-uuid
-
New UUID Formats from IETF
With the introduction of UUIDv8, my fun script to generate vanity uuids[0] can finally be spec comfortant!
[0]:https://github.com/operator-name/vanity-uuid
What are some alternatives?
uuid7 - UUID version 7, which are time-sortable (following the Peabody RFC4122 draft)
uuid6-python - New time-based UUID formats which are suited for use as a database key
dart-uuid - Generate RFC4122(v1,v4,v5,v6,v7,v8) UUIDs
uuid - Generate and parse UUIDs.
prototypes - Draft Prototypes and Tests for UUIDv6 and beyond
spec - The canonical spec for ulid
brain - Swyx's second brain!
Hashids.java - Hashids algorithm v1.0.0 implementation in Java