# unique Published articles for unique. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## Efficient Distributed Unique Timestamp Identifier Generation DevFeed: [Efficient Distributed Unique Timestamp Identifier Generation]() Original publisher: [Read original article]() Author: Peter Lawrey (noreply@blogger.com) Published: 2024-12-08T19:51:00Z Content type: tutorial Language: en Sources: [Vanilla Java]() Topics: [identifier](), [systems](), [Microservice](), [Concurrency](), [ordering](), [Latency]() Tags: [benchmarks](), [concurrent](), [distributed](), [identifier](), [latency](), [microservices](), [ordering](), [performance](), [precision](), [unique]() ### AI overview The article presents a distributed identifier scheme that embeds a host identifier into a nanosecond-resolution timestamp. It describes the resulting 64-bit identifiers as globally unique, human-readable, chronologically sortable, and suitable for high-concurrency, latency-sensitive systems. ### Source excerpt Distributed unique timestamp identifiers provide a powerful means of generating globally unique, human-readable 64-bit values at sub-microsecond speeds. By embedding a host identifier directly into a nanosecond-resolution timestamp, you gain a simple, chronologically sortable, and intuitive scheme for correlating events across multiple hosts. This approach offers significant benefits in latency-sensitive systems where even small delays can become expensive at scale. Introduction In a world of horizontally scaled microservices, ensuring that each event or message receives a unique identifier across multiple machines can be challenging. Traditional approaches often rely on UUIDs, which--while easy to use--lack intuitive readability and can be relatively expensive to generate in ultra-low-latency scenarios. Our solution builds upon nanosecond-resolution timestamps combined with a host identifier embedded directly into the lower-order digits of the timestamp. This technique, inspired by previous work on system-wide unique nanosecond timestamps, creates identifiers that are compact, human-interpretable, and extremely fast to produce. In essence, we treat time itself as the source of uniqueness. By carefully structuring the timestamp and assigning a unique hostId per machine (or per logical partition), we can scale to produce up to one billion unique 64-bit identifiers per second. These identifiers repeat only after centuries, making them suitable for long-running systems and distributed architectures that demand both precision and high performance. Concurrent identifier generation in a distributed system In distributed environments, colliding identifiers can lead to data corruption, misrouted requests, or difficulty in debugging. Although UUIDs solve uniqueness issues, they do not inherently convey temporal ordering or machine origin. More subtle forms of identifiers, such as database sequence numbers or custom counters, often need to be more convenient when synchronising ## Tabletop Games Based on Math Problems DevFeed: [Tabletop Games Based on Math Problems]() Original publisher: [Read original article]() Published: 2024-03-09T04:06:19Z Content type: article Language: en Sources: [Jeremy Kun]() Topics: [math](), [Mathematics](), [Math and Logic](), [Hugo](), [LaTeX](), [WordPress]() Tags: [card-games](), [color](), [games](), [math](), [mathematics](), [problems](), [projective-plane](), [set](), [tabletop-games](), [unique](), [value](), [vector]() ### AI overview A short list of tabletop games whose mechanics are directly based on nontrivial mathematical structures or problems. It discusses games including SET and Spot It!, along with related questions in finite geometry, vector spaces, and combinatorics. ### Source excerpt There's a family of tabletop games that are based directly on a nontrivial mathematics problem. As a casual and fun way to inaugurate my new blog (migrated from Wordpress to Hugo, after my work on getting better LaTeX mathmode support in Hugo), I thought I'd write a short listicle about them, so that I have a place to add more as I find them, as well as give the shortest canonical description of the associated math problem. ## Post-Mortem: LinkedIn Talent Intelligence Experience DevFeed: [Post-Mortem: LinkedIn Talent Intelligence Experience]() Original publisher: [Read original article]() Author: andrew@nystudio107.com (Andrew Welch) Published: 2018-06-20T13:37:00Z Content type: article Language: en Sources: [nystudio107 | Articles on modern web development.]() Topics: [Post Mortem](), [Content Management System](), [GraphQL](), [vuejs](), [Front end](), [App](), [DevOps]() Tags: [app](), [cms](), [covers](), [craft](), [create](), [devops](), [experience](), [frontend](), [graphql](), [intelligence](), [interactive](), [linkedin-s](), [post-mortem](), [post-mortems](), [project](), [talent](), [unique](), [vuejs](), [web]() ### AI overview This post-mortem explains how Craft CMS 3, GraphQL, and VueJS were used to build an interactive tablet-and-projection-wall experience for LinkedIn's Talent Intelligence events. It focuses on the project's planning, architecture, DevOps, and core application design. ### Source excerpt This project post-mortem covers a unique use of Craft CMS 3, GraphQL, and VueJS to create an interactive experience for LinkedIn's Talent Intelligence Experience