{"repo":"orderlykit/orderlyid","free":true,"listed":false,"github":"https://github.com/orderlykit/orderlyid","clone":"git clone https://github.com/orderlykit/orderlyid.git","description":"OrderlyID — Typed, time-sortable 160-bit identifiers with optional checksum, tenant, and shard fields. Safer than UUIDv4, more ergonomic than ULID/TypeID.","language":"Go","stars":53,"topics":["checksum","developer-tools","distributed-systems","dynamodb","golang","id-generation","identifier","k-sortable","multi-tenant","postgresql"],"license":"Apache-2.0","category":"databases-storage","readme_excerpt":"OrderlyID OrderlyID is a typed, time-sortable, globally unique identifier format with optional checksums and built-in fields for tenancy and sharding. It is designed for distributed systems, developer ergonomics, and safer use in public APIs. Status: Draft v0.1 — stable enough for experimentation. Spec + reference implementation in Go. Feedback and contributions welcome. --- TL;DR OrderlyID = [- ] - Typed : human-readable type prefix ( order ... , user ... ) - K-sortable : lexicographic order ≈ creation time (UUIDv7-style) - Globally unique : safe to mint in any service/region - DX-friendly : great in logs, APIs, and distributed systems - Optional extras : checksum to catch copy/paste errors; fields for tenant/shard/sequence If you currently use AUTO INCREMENT or UUIDv4, OrderlyID improves safety, scale, and developer ergonomics with minimal fuss. --- Why not just INT IDs or UUIDv4? vs AUTO INCREMENT - Needs DB round-trips / central sequences - Predictable & leaks volume (bad for public APIs) - Harder to shard or generate offline vs UUIDv4 - Not time-sortable (needs extra timestamp/index) - No type context in logs - Chunky hex; weaker DX OrderlyID - App-side generation, K-sortable, self-describing ( order ... ) - Works across services/regions/edge; fits SQL & NoSQL (DynamoDB) alike - Optional checksum for fat-finger protection --- Developer use cases - Greppable logs : shipment ... vs random hex → faster triage - Cursor pagination : WHERE id ) Binary layout (160 bits total) -","default_branch":null,"files":null,"tree":[],"storefront":"/r/orderlykit","claimed":false,"request_supported":{"post":"https://gitbuyer.com/r/orderlykit/orderlyid/request-supported","requests":0},"note":"indexed from public GitHub; nothing is for sale on this page. Clone it from GitHub. Paid listings live at /search."}