uuid6-ietf-draft VS uuid7

Compare uuid6-ietf-draft vs uuid7 and see what are their differences.

uuid7

UUID version 7, which are time-sortable (following the Peabody RFC4122 draft) (by stevesimmons)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
uuid6-ietf-draft uuid7
7 3
182 68
1.6% -
5.7 0.0
6 months ago 4 months ago
HTML Python
- MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.

uuid6-ietf-draft

Posts with mentions or reviews of uuid6-ietf-draft. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2024-04-11.

uuid7

Posts with mentions or reviews of uuid7. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-05-08.
  • Sequential UUID in snowflake
    2 projects | /r/snowflake | 8 May 2023
    Snowflake does not support UUID 7. What you could do is import UUID7 Python module and implement a Python UDF.
  • New UUID Formats from IETF
    12 projects | news.ycombinator.com | 12 Jun 2022
  • Understanding UUIDs, ULIDs and String Representations
    6 projects | news.ycombinator.com | 4 Jan 2022
    To summarise the differences:

    * UUIDv6 - sortable, with a layout matching UUIDv1 for backward compatibility, except the time chunks have been reordered so the uuid sorts chronologically

    * UUIDv7 - sortable, based on nanoseconds since the Unix epoch. Simpler layout than UUIDv6 and more flexibility about the number of bits allocated to the time part versus sequence and randomness. The nice aspect here is the uuids sort chronologically even when created by systems using different numbers of time bits.

    * UUIDv8 - more flexibility for layout. Should only be used if UUIDv6/7 aren't suitable. Which of course makes them specific to that one application which knows how to encode/decode them.

    UUIDv7 is thus the better choice in general.

    (I recently wrote Python and C# implementations - https://github.com/stevesimmons/uuid7 and https://github.com/stevesimmons/uuid7-csharp)

What are some alternatives?

When comparing uuid6-ietf-draft and uuid7 you can also consider the following projects:

Ulid - Fast .NET C# Implementation of ULID for .NET and Unity.

uuid7-csharp - UUIDv7 for C#. Time-ordered UUIDs with up to 50ns resolution and 48 bits of randomness.

spec - The canonical spec for ulid

ksuid - K-Sortable Globally Unique IDs

ulid-mssql - Implementation of ULID generator For Microsoft SQL Server

Hashids.java - Hashids algorithm v1.0.0 implementation in Java

dart-uuid - Generate RFC4122(v1,v4,v5,v6,v7,v8) UUIDs

uulid.go - ULID-UUID compatibility library for generating and parsing ULIDs.

ulid - Universally Unique Lexicographically Sortable Identifier (ULID) in Python 3

shortuuid.rb - Convert UUIDs & numbers into space efficient and URL-safe Base62 strings, or any other alphabet.

tiny_id - Rust library for generating non-sequential, tightly-packed short IDs.