Presents Alternatives

Similar projects and alternatives to presents

spec

62 8,627 0.0 presents VS spec

The canonical spec for ulid
Hashids.java

31 1,010 0.0 Java presents VS Hashids.java

Hashids algorithm v1.0.0 implementation in Java
WorkOS

workos.com sponsored

The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
brain

9 1,530 7.5 JavaScript presents VS brain

Swyx's second brain! (by swyxio)
uuid7

3 64 0.0 Python presents VS uuid7

UUID version 7, which are time-sortable (following the Peabody RFC4122 draft)
uuid

6 943 8.3 Rust presents VS uuid

Generate and parse UUIDs. (by uuid-rs)
uuid6-python

1 92 7.0 Python presents VS uuid6-python

New time-based UUID formats which are suited for use as a database key
ulid

4 644 0.0 Python presents VS ulid

Universally Unique Lexicographically Sortable Identifier (ULID) in Python 3 (by ahawker)
InfluxDB

www.influxdata.com sponsored

Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
dart-uuid

1 329 7.5 Dart presents VS dart-uuid

Generate RFC4122(v1,v4,v5,v6,v7,v8) UUIDs
prototypes

2 45 6.0 Python presents VS prototypes

Draft Prototypes and Tests for UUIDv6 and beyond
vanity-uuid

1 6 10.0 Shell presents VS vanity-uuid

Create "readable" UUIDs such as "5eedbed5-f05e-b055-ada0-d15ab11171e5" for all your UUID needs!

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better presents alternative or higher similarity.

Suggest an alternative to presents

presents reviews and mentions

Posts with mentions or reviews of presents. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-06-12.

New UUID Formats from IETF
12 projects | news.ycombinator.com | 12 Jun 2022

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.)