<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Distributed-Systems on Signal &amp; Syntax</title><link>https://signal-and-syntax.com/tags/distributed-systems/</link><description>Recent content in Distributed-Systems on Signal &amp; Syntax</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 28 Nov 2025 06:00:00 -0700</lastBuildDate><atom:link href="https://signal-and-syntax.com/tags/distributed-systems/index.xml" rel="self" type="application/rss+xml"/><item><title>The Birthday Paradox in Production: When Random IDs Collide</title><link>https://signal-and-syntax.com/posts/birthday-paradox/</link><pubDate>Fri, 28 Nov 2025 06:00:00 -0700</pubDate><guid>https://signal-and-syntax.com/posts/birthday-paradox/</guid><description>You generate a UUID. It&amp;rsquo;s 128 bits total, with 122 bits of randomness ( Davis et al., 2024 ). That&amp;rsquo;s 340 undecillion possible values. Collision-proof, right? Your system generates a million IDs per second. Still safe? What about a billion?
As I like to say, common sense and intuition are the enemies of science. Common sense tells you that with 340,000,000,000,000,000,000,000,000,000,000,000,000 possible values, you&amp;rsquo;d need to generate at least trillions before worrying about duplicates.</description></item></channel></rss>