https://nalar.dev/tags/uuid/ Recent content in UUID on Nalar Hugo en-us Tue, 08 Sep 2026 00:00:00 +0700 https://nalar.dev/generate-time-ordered-ids-with-python-uuid7/ Tue, 08 Sep 2026 00:00:00 +0700 https://nalar.dev/generate-time-ordered-ids-with-python-uuid7/ <p>Random UUIDs are convenient identifiers: they can be generated without coordinating with a database, and the probability of collision is tiny. But a UUIDv4 primary key has one awkward property for ordered indexes: newly generated values are spread across the key space instead of tending toward the end of the index.</p> <p>UUID version 7 keeps the decentralized 128-bit UUID shape while putting a Unix-epoch millisecond timestamp at the front. Python 3.14 adds <code>uuid.uuid7()</code> to the standard library, so applications no longer need a third-party package just to generate RFC 9562 UUIDv7 values.</p> https://nalar.dev/use-uuid7-for-time-ordered-identifiers-in-python/ Tue, 08 Sep 2026 00:00:00 +0700 https://nalar.dev/use-uuid7-for-time-ordered-identifiers-in-python/ <p>Python 3.14 added <code>uuid.uuid7()</code>, giving applications a standard-library way to generate UUID version 7 identifiers defined by RFC 9562.</p> <p>UUIDv7 is useful when an application wants a globally shaped 128-bit identifier while also putting creation time near the front of the identifier. That property can make newly generated values naturally cluster by time in systems that sort UUIDs by their binary or canonical value.</p> <p>It is tempting to summarize UUIDv7 as &ldquo;a sortable UUID.&rdquo; That is directionally useful but incomplete. The timestamp has millisecond resolution, Python adds a counter for monotonicity within a millisecond, clocks can move, and separate processes do not become a distributed sequence generator merely because they all use UUIDv7.</p>