774
submitted 1 day ago by [email protected] to c/[email protected]
you are viewing a single comment's thread
view the rest of the comments
[-] [email protected] 12 points 19 hours ago

A UUID v4 has 122 bits of randomness. Do you know how long that would take to brute-force, especially with network limitations?

[-] [email protected] 5 points 18 hours ago

It taking a long time doesn't make it an impossibility. The fact that it has a limit of 122 bits, in and of itself, makes the possibility of a bruteforce a mathematical guarantee.

[-] [email protected] 9 points 18 hours ago

For all practical purposes, it's impossible.

[-] [email protected] 2 points 17 hours ago

It's not, though. And thinking that it is impossible is why DES, for example, was "translatable" by the NSA for decades. Never assume something is impossible just because it's difficult.

[-] [email protected] 9 points 16 hours ago

It is. It is practically impossible to guess the file names. You telling otherwise means you don't have sufficient knowledge on the matter.

[-] [email protected] 7 points 15 hours ago

@01189998819991197253 @ConstantPain

Security isn't binary, it's a spectrum. You apply the level of security that is appropriate for each situation.

Of course it's *possible* to brute force it, but by the same logic you could brute force jwt tokens, or api keys, or even ssl certs.

It's literally *impossible* to apply "max security" to everything, so you have to prioritize.

What happened was unconscionable, but insisting uuid are mathematically breakable isn't helpful, and can make it worse.

[-] [email protected] 6 points 17 hours ago

UUIDs are essentially random numbers, crypto schemes are not, they're not comparable.

[-] [email protected] 1 points 17 hours ago

The scope isn't if they're crackable (which, if course, they're not, since they're not encrypting anything). The scope is if using UUIDs as filenames in this publicaly accessible db a good way to hide the files. And the answer is: no it is not, because a computer powerful enough can guess all possibilities in a matter of minutes, and query them all against the db to discover all files stored within.

[-] [email protected] 14 points 16 hours ago

The powerful enough computer doesn't exist, and will not exist for some time. And even if it exists, it can't query the web server fast enough to have meaningful effectiveness.

So, for all intents and purposes, it's impossible. Period.

[-] [email protected] 7 points 15 hours ago

Thank you for bringing sanity to this thread. At this point, I have to assume that this person is trolling? That or they've been vibecoding too long?

[-] [email protected] 4 points 12 hours ago

Aside from the fact that a strong enough supercomputer won't exist for decades, you're not limited by the speed of UUID generation. Even if you had an infinitely fast supercomputer, it wouldn't speed up your brute force attempts, since you're limited by the speed of the backend. Wherever Tea stores their images, that server has only a limited capacity for responding to requests, far less than the speed with which you can generate UUIDs. That's a hard cap - you won't try guesses faster than that.

[-] [email protected] 1 points 4 hours ago

Even assuming 0 latency on their backend, if you wanted to check each UUIDv4 value again their database during your lifetime, you would need to check 1.686 x 10^27 UUIDv4 per second for 100 years straight. Supercomputers are measured in exaflops, which is 10^18 operations per second, so even distributing the work across many machines, you would need about 1 billion of super computers to be able to have a chance of checking every UUIDv4 value within 100 years.

load more comments (5 replies)
load more comments (10 replies)
load more comments (10 replies)
this post was submitted on 26 Jul 2025
774 points (100.0% liked)

Programmer Humor

25276 readers
702 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 2 years ago
MODERATORS