The Every UUID Website Explained

Exceptional use of free will

we need an NPM package for generating UUIDs that sends a fetch request to this website which has 2 million weekly downloads

How do i file a takedown request for my UUID? I don't want it in public.

Great, so you're telling me that every UUIDv4 I generate is not Universally Unique, because it is there?

this guy now has two successful ideas for sites that triggered tons of traffic. Looks like it’s pretty clear why. he takes into account EVERYTHING

I have bad news for you Prime, I know places that have business critical applications that rely on IE7.

14:29 As a math PhD student that teaches undergraduate math, I absolutely love when stuff like this comes up. The author just discovered a really interesting property (one that's not too bad to prove if you're willing to sit down with it). The author is saying that taking the composition of two bijective functions, is itself a bijective function. It kind of translates to when you are solving an equation for x (like x^3-1 = 0) you are performing actions to both sides of this equation that are just applying functions! (and why when you have an even power for something like x^2-1=0, you can get multiple answers because it's not a bijective function on your entire domain and co-domain you're applying) Edit: I must also add that chat is wrong. 1-1 is just half of the requirement. You also need to be able to achieve every output possible (onto). 1-1 means each output is reached only once, and onto means you can actually get every output that you want to be able to get.

Before he got into search, it was a matter of solving problems. But with search it became a matter of creativity, and that's how you get infinite work.

I'm fresh after graduating a CS degree so things like bijectivity, ciphers and enthropy make sense. I love reading about projects like this, it reminds me that programming is a mixture of creativity and math and it's beautiful

2^128 is 5 undecillion. I'm really surprised it cleared a decillion.