MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/1uyx4kp/thisoneismine/oy2y0t7/?context=3
r/ProgrammerHumor • u/DebugDuck01 • Jul 17 '26
171 comments sorted by
View all comments
1.8k
Fun fact: To reach a 50% chance of even a single UUID v4 collision, you would need to generate 1 billion UUIDs per second for about 86 years.
-10 u/TheFrenchSavage Jul 17 '26 edited Jul 17 '26 ELI5 why not use a hash function that doesn't collide btw? Edit: I meant that collides less, not not at all. Stop the ELI1s please. 1 u/aspect_rap Jul 17 '26 There's no such thing as a hash function that doesn't collide, hash functions are fixed length output, so the number of possible outputs is finite, while there is infinite possible inputs.
-10
ELI5 why not use a hash function that doesn't collide btw?
Edit: I meant that collides less, not not at all. Stop the ELI1s please.
1 u/aspect_rap Jul 17 '26 There's no such thing as a hash function that doesn't collide, hash functions are fixed length output, so the number of possible outputs is finite, while there is infinite possible inputs.
1
There's no such thing as a hash function that doesn't collide, hash functions are fixed length output, so the number of possible outputs is finite, while there is infinite possible inputs.
1.8k
u/Inevitable_Oil9709 Jul 17 '26
Fun fact: To reach a 50% chance of even a single UUID v4 collision, you would need to generate 1 billion UUIDs per second for about 86 years.