[HN Gopher] Every UUID Dot Com
___________________________________________________________________
Every UUID Dot Com
Author : LorenDB
Score : 517 points
Date : 2024-12-06 18:11 UTC (4 hours ago)
(HTM) web link (everyuuid.com)
(TXT) w3m dump (everyuuid.com)
| mpeg wrote:
| Very useful! I'll refer to it when I forget my UUIDs, I use this
| site all the time to remember my bitcoin private key [0]
|
| [0]: https://privatekeys.pw/keys/bitcoin/1
| manmal wrote:
| Thanks for this, I didn't know that people create weak BTC keys
| for fun. I guess some are also used as bot honeypots?
| therein wrote:
| Back in the day people used to SHA256 a passphrase and create
| a Bitcoin private key from it.
| wild_pointer wrote:
| Nice one.
|
| Random key: balance is zero.
|
| Real key: balance is (now) zero
| animal_spirits wrote:
| Damn, looks like my db has been leaked
| swyx wrote:
| my ref notes on UUID for those interested
| https://github.com/swyxio/brain/blob/master/R%20-%20Dev%20No...
| LCoder wrote:
| Jumped to the bottom and the page locked up. Console shows:
| Uncaught Error: Index out of range - must be less than 2^122
| eieio wrote:
| oh hm, i thought I had fixed every case where that popped up. I
| can't reproduce the issue on any browser on my machine - how
| did you jump to the bottom (hotkey, scrollbar, scrolling for a
| trillion years) and what platform are you on (if you don't mind
| sharing)?
| LCoder wrote:
| Chome on Windows. Grab the right scroll bar and pull to the
| very bottom. Once at the bottom try to scroll down with mouse
| scroll wheel. Screen goes blank and the error appears in the
| console.
| eieio wrote:
| OH! Thanks for the precise reproduction steps, I had done
| my testing with a trackpad and had missed that! Writing a
| little fix now (I'd hate for you to not be able to see the
| last UUID)
| jonny_eh wrote:
| > I'd hate for you to not be able to see the last UUID
|
| No spoilers, but the last one's a doozy!
| efdee wrote:
| Number #553752677 will surprise you!
| blahyawnblah wrote:
| Same for me on Firefox windows
| eieio wrote:
| alright, a fix that I think covers this crash and a few
| others I found as a result is rolling out now.
|
| for a while I thought I had an off by one error, which was
| pretty funny to think about in the context of trillions of
| items. but in fact I was just doing some bad react state
| management.
| rel_ic wrote:
| fixed for me! Brave MacOS
| gabeio wrote:
| use the scroll bar to get to the "end" then use scroll wheel.
| that's how I managed to hit it reliably.
| xyst wrote:
| Every uuid dot com except if greater than 2^122 -1 doesn't have
| the same ring ;)
| anamexis wrote:
| There aren't more than 2^122 UUIDv4s.
| CodeWriter23 wrote:
| It's the void that comes after the last particle in the known
| universe.
| epistasis wrote:
| I took the first one, nobody else take it or it will no longer be
| a UUID.
| fmbb wrote:
| You can sell it as an NFT. That way it is still unique but you
| can pass it along.
| all2 wrote:
| The creator should add a button to mint an nft on his custom
| side chain.
| Eikon wrote:
| Want to find the actual UUIDs that are a dot com?
|
| https://www.merklemap.com/search?query=*-*-*-*-*.com&page=0
|
| Well, some of them are :)
| sureglymop wrote:
| Does it index subdomains by certs issued? What about wildcard
| certs? Or sites that accept all possible subdomains?
| ekzy wrote:
| Nice. I've added a few favourites just to keep track of them, you
| never know!
|
| It would be great if there was an API because I'm working on an
| UI that needs UUID autocomplete. Thank you!
| dylan604 wrote:
| They should set up a reservation database and sell vanity UUIDs
| for trendy LA people
| chis wrote:
| This is funny I like it. Basically just captures the scroll input
| and iterates through int128s and their UUIDs on a static page to
| fake a scroll. My feature request would be to add smooth
| scrolling.
| worble wrote:
| And support autoscroll too, if possible (where you click middle
| mouse to scroll)
| Aachen wrote:
| I use this all the time but someone decided to disable it by
| default. For those who haven't turned it on after a reinstall
| yet, or haven't discovered the setting: about:preferences ->
| search autoscrolling
| manmal wrote:
| > iterates through int128s
|
| Have you read the blog post? I wouldn't summarize it like that,
| it's a little more involved than just iterating. I learned
| something today.
| perdomon wrote:
| I think we broke it :(
| rosmax_1337 wrote:
| The ability to bookmark your favorite ones, now that's art.
| buremba wrote:
| damn, my password is here
| lxgr wrote:
| Seems like I got lucky - I have a "G" in mine!
| atonse wrote:
| that's ok, just add a "1" and an exclamation to the end,
| that'll make it super secure, the hackers won't figure that one
| out.
| Aachen wrote:
| Oh my. Brings me back to my internship at a web development
| firm in Venlo. Someone "hacked" the company (somehow knew the
| master password used for everything) and deleted half the
| websites. Could restore from backup iirc but you know what
| the solution was?
|
| Add an exclamation mark to the password
|
| --
|
| Which in turn reminds me of another internship where a
| computer upstairs got "hacked". Everything on the desktop was
| messed up, icons moved, random programs open, some files
| moved into folders at random... why'd anyone do that? The
| boss left it as-is for me to take a look at how this could
| happen--yes, including the thematic porn sites hinting
| 17-year-old me at what happened to his marriage. Not finding
| any hints, I started sorting the stuff back out and business
| continued as usual
|
| Come afternoon, I was working on the computer when the mouse
| moved. Like, not me, I didn't move it. Was it the hacker? How
| are they connected? After a bit it moved again, but it didn't
| make any sense. I don't remember how I put 2 and 2 together
| but, going downstairs and seeing him at the media station
| using a wireless mouse downstairs, I got a dark suspicion
|
| Yes of course it was an insider threat =) We bought a
| different wireless receiver for the mouse that day
| jherskovic wrote:
| Looks like the end boss of yak shaving. Very fun, silly idea and
| a great implementation.
| croes wrote:
| Seems like some hacker leaked all UUIDs.
|
| Check if your UUIDs are part of the leak.
| sureIy wrote:
| Wait till someone files a CVE
| Traubenfuchs wrote:
| I am sure our IT security department would jump right on to
| that if informed of it...
| kibwen wrote:
| This is the biggest hack since every ATM PIN was leaked:
| https://pastebin.com/SmJRB8eQ
| tombert wrote:
| Holy shit, my PIN is on there. How the hell did that get
| that?? I was told it was a 1/10,000 chance of someone
| guessing it.
| ethanjstark wrote:
| Mine too.
|
| Takes me back to when my password was leaked:
|
| https://github.com/danielmiessler/SecLists/pull/155
| 0xbadcafebee wrote:
| could we fix this by adding '\n' to the password? then it
| wouldn't be guessed, the hackers would just think it was
| the end of the password
| Y_Y wrote:
| That's why I put a newline in my username.
| hk1337 wrote:
| Don't worry, I already checked your account and there
| wasn't anything there to take.
| quietbritishjim wrote:
| PINs can be up to 6 digits (at least here in the UK, but I
| doubt it's country specific), even though the ones they give
| you by default are only ever 4. So that's only a leak of 1%
| of them.
| extraduder_ire wrote:
| Does that not cause problems on some card machines? I've
| come across a few that definitely don't let you put in more
| than four digits.
| jiggawatts wrote:
| That provides very valuable information: DO NOT TRUST
| this machine to be secure!
|
| Similarly, any web site or app that can't correctly
| handle a space character at the end of the password
| should never be trusted with anything of consequence.
| quietbritishjim wrote:
| Are you really worried that a card machine is going to
| leak your PIN? That doesn't seem to be a common attack
| vector compared to a third-party skimmer being attached
| or someone just mugging you and demanding your PIN under
| threat of physical violence.
|
| To answer the actual question: I don't know because I
| left my PIN at 4 digits, despite knowing I could use
| more, precisely because I didn't think it would really
| make my life any more secure.
| tomtomtom777 wrote:
| It helps, but only temporary. I wouldn't be surprised if
| all 6 digit PINs will be leaked within a few decades.
| banku_brougham wrote:
| No with the rate of development of quantum computers that
| estimate is down to the next few years.
| bookstore-romeo wrote:
| My card doesn't even let me include repeating digits in its
| PIN. I suppose it can make a one-off guess more likely than
| one in a thousand to correctly guess my PIN.
| hamburglar wrote:
| Haha, I have a file in my home directory that has every
| possible SSN because I wanted to be able to tell a friend "I
| have your SSN in a file on my computer."
| layer8 wrote:
| I hope this gets incorporated into haveibeenpwned.com.
| banku_brougham wrote:
| With the way things are at work right now I simply don't have
| time to mitigate this leak in my personal data security. I've
| officially given up.
| TZubiri wrote:
| Nerd hacker politics, but SSN leaks are no joke.
| tobyjsullivan wrote:
| The fact that the search works impressed me more than anything.
| Of course, like every great magic trick, it seems so simple once
| it is explained.
|
| For the curious, here's the linked blog post describing how the
| project works: https://eieio.games/blog/writing-down-every-uuid/
|
| Edit to add: I'd only tried searching for an exact UUID when I
| wrote this comment. I didn't realize it supports full text
| search! Now I'm even more impressed.
| writtenAnswer wrote:
| Cool Blogpost
| InsideOutSanta wrote:
| Yeah, I at first, I though I knew exactly how it worked. Then I
| saw the search field, and I suddenly had no idea what the hell
| was going on. Now, the big question, do I want to spoil the
| magic trick and read how this was done, or should I keep being
| astonished and flabbergasted?
| manmal wrote:
| As with any magic trick, reading the explanation might leave
| you a little disappointed here.
| sameoldtune wrote:
| I disagree with my sibling comment. The trick is beautiful.
| If you generate UUIDs such that each bit in the result can be
| reliably traced back to a single bit in the input, then you
| can take a substring of the UUID and use that to infer which
| bits of the input integer must be set to produce that
| substring. So you can produce a whole list of input bytes
| that meet the criteria and those become your search results.
|
| The real magic trick here is that the uuids on the page only
| look random to us because of some bit twiddling and XOR
| trickery. If we had a better intuition for such things we
| would notice that successive UUIDs are just as correlated as
| successive integers.
|
| Elegant stuff
| kirubakaran wrote:
| If you're an Everettian, roll
| https://www.jrussellhuffman.com/quantumdice/ and read it only
| if the die is odd. You can have your cake and eat it too.
| eieio wrote:
| I'm really happy that the trick was magical to you - I was so
| surprised and delighted when I realized that this was possible,
| and I wasn't really sure if anyone else would feel the same
| way!
|
| And of course, I'm proud to be providing so much utility here -
| finally we can find and use UUIDs tailor-fit to our needs
| lxgr wrote:
| Memorable UUIDs? I think you're on to something here! (Also,
| dibs on 00000000-0000-4321-abcd-000000000001!)
| Nihilartikel wrote:
| We can just make an NFT of each one to make sure they stay
| unique too!
| cubefox wrote:
| Can we make one that says something funny? "B00B" could be
| included.
| srockets wrote:
| Searching is very similar to a common approach for building a
| naive spellchecker: given an input, generate all the possible
| matches it can be part of. You're not searching in a corpus,
| you're using the input to generate indices into the corpus
| (list of UUIDs here, list of words in the dictionary in a
| spellchecker).
| lilyball wrote:
| The explanation for full-text search was actually slightly more
| intelligent than what I initially assumed. I figured it just
| generated UUIDs until it found one that was in the correct
| direction of search (for the next/previous button), since I had
| observed that walking forwards and backwards in search results
| was giving different results each time, but in fact the author
| did the slightly better thing which is to just generate a bunch
| of possible results and then pick the best (I wonder how many
| results it generates for this?).
| re wrote:
| The full text search is a little confusing because it doesn't
| actually search them in order, though it appears to at first.
| And if you click "next" a few times and then "prev" the same
| number of times, you don't necessarily end up back at the same
| UUID you were at before. It's a neat-seeming trick though.
| cyanmagenta wrote:
| It's an interesting question whether that could be fixed. I
| think the answer is Yes. If the author didn't do any
| scrambling, and just displayed UUIDs in numeric order, then
| it's trivial to enumerate search results in order. Likewise,
| if you do something like adding a constant mod 16 to each hex
| digit, you could do the same thing when you generate UUIDs
| matching a substring. So the question becomes whether you
| could find something like that that gives a sufficiently
| convincing illusion of entropy but is still reversibile when
| you hold a subset of the digits constant. And it seems like
| it should be.
| eieio wrote:
| FWIW I am super interested in this question but feel like I
| don't know how to derive a satisfying answer, maybe because
| the one of my goals here (add "enough" entropy) is a real
| fuzzy "I know it when I see it" sort of thing.
|
| But I'm gonna try to get a few more crypto-knowledgeable
| friends to chat with me about this and write up what I
| learn!
| lxgr wrote:
| A great example of Teller's observation that "sometimes magic
| is just someone spending more time on something than anyone
| else might reasonably expect."
| Terr_ wrote:
| > Ninety per cent of most magic merely consists of knowing
| one extra fact.
|
| -- _Night Watch_ by Terry Pratchett
| instalabs wrote:
| Awesome - this will be my new coding interview question
| Freedom2 wrote:
| Agreed. Everyone love puzzles that are worthy of an entire
| section in a blogpost for their interview questions, rather
| than stuff actually relevant to the job.
| moritzwarhier wrote:
| Love both the project idea and the writing!
|
| The way that post explains each step in a unique laconic tone
| is very enjoyable to read.
| c0nsumer wrote:
| When I hit print in Firefox it only is one page long. :(
| schoen wrote:
| We may be lucky that it didn't work. It appears from GNU units
| that printing this all out on paper would be about a hundred
| solar masses. Maybe about fifty solar masses if you print
| double-sided.
| cbsmith wrote:
| Only has type 4 UUIDs. ;-)
| CodesInChaos wrote:
| Looks like they just changed the subtitle from "In case you
| forgot one" to "Well, only the V4 ones".
| cbsmith wrote:
| :-)
|
| Actually, it looks like it alternates between those two
| phrases.
| junek wrote:
| Sometimes I feel bad when I generate a UUID without using it for
| anything. Like I've wasted it.
| evan_ wrote:
| You're not the only one who feels this way:
| https://wasteaguid.info/
| extraduder_ire wrote:
| There's enough of them that you're saving a scarcer resource by
| not recording it anywhere.
| netcraft wrote:
| how bad do you feel about all the uuids you didnt generate so
| were never born?
| banku_brougham wrote:
| At work our clickstream data carries an 'event_uuid' column
| which combines uuid, bigint, account numbers and about 10 other
| identifiers. It makes joining really convenient when you don't
| know what column to use.
| kk3 wrote:
| Finally a use case for creating a table with a million rows in
| React.
| anyfoo wrote:
| You're going to need a smidge more than that.
| nom wrote:
| now sort them alphabetically
| CodesInChaos wrote:
| Sorting them lexically would be trivial. Just calculate the
| index via the reverse permutation, similar to how search works.
| wavemode wrote:
| Compression is now so advanced, we can browse web pages weighing
| over 340 undecillion bytes.
|
| We truly live in an age of wonders.
| 55873445216111 wrote:
| I am pretty sure this sets a new record for highest Weissman
| score
| impish9208 wrote:
| Middle-out truly is revolutionary
| function_seven wrote:
| Meh. Years ago I had my bakeries churning out undecillions of
| units no problem in Cookie Clicker. No big deal!
| xg15 wrote:
| They just don't make em like they used to...
| Devasta wrote:
| This is excellent.
|
| 29113161-136d-411e-9efd-5b24a910c307
|
| I'm going to take this one if no one minds, please select
| something else for your purposes.
| worble wrote:
| Typical, I'm always late and the good ones are already taken
| ticulatedspline wrote:
| reminds me of https://libraryofbabel.info/ (which seems to be
| down at the moment try Archive
| https://web.archive.org/web/20241112121646/https://libraryof...).
|
| It's a fun implementation inspired by the short story
| https://en.wikipedia.org/wiki/The_Library_of_Babel and "At
| present it contains all possible pages of 3200 characters,"
| though the character set is limited (no dash) so you won't find
| these UUIDs there.
| RGamma wrote:
| I was gonna mention that so people have something to read when
| they finished the UUIDs.
| noncoml wrote:
| You fool! You destroyed the universal uniqueness now!
| NBJack wrote:
| You were so preoccupied with whether you could, you never
| stopped to ask if you should.
|
| This will be the goto reference for hackers everywhere. Think
| of how much faster they'll compromise my McDonald's order with
| all 2^122 possibilities already computed!
| CodesInChaos wrote:
| For the implementation of the core logic, I probably would have
| gone for the lazy solution of iterating AES until the output is
| <2^122 (64 times on average).
|
| Alternatively just use standard Format-Preserving-Encryption,
| which is usually a Feistel Network, similar to what they ended up
| with, but built on a standard algorithm, instead of a homebrew
| round function.
| AlotOfReading wrote:
| Thank you for finally giving me a name for this concept. I've
| run into lots of code implementing them badly, but there's a
| bit of a semantic hill for others when you don't have a better
| name than "1-cycle permutation".
| lxgr wrote:
| Oof, mine are on there. Guess I'll have to rotate them now :/
| a12k wrote:
| Super weird coincidence but I spotted a UUID in here that I had
| previously used!
| atonse wrote:
| Hey, one of my database passwords is in here. How the heck did
| you get access to it????????
|
| Who do I contact about this breach? I want names and addresses.
| LeifCarrotson wrote:
| The name and address is at everyUTF8string.com. You might have
| to scroll a while, though...
| atonse wrote:
| Thank you. I started scrolling 4 hours ago and am yet to
| encounter my first address.
| eieio wrote:
| I'm so sorry - we'll start working on a feature to redact UUIDs
| after we figure out how to handle GDPR compliance
| n42 wrote:
| this brings me joy.
| lxgr wrote:
| Neat idea, excellent implementation!
|
| Now I kind of want to do this for "every 12 character
| password"...
| sidcool wrote:
| This is beautiful.
| sidcool wrote:
| Can someone ELI5? How's he ensuring uniqueness of a UUID when
| they are randomly generated?
| ARandumGuy wrote:
| UUIDs aren't technically unique, they're just designed in such
| a way that the chance of collisions is very small.
|
| A big part of this is that the possibility space is very large,
| so the chance of collisions is low. Many UUID versions also
| determine parts of the UUID via MAC addresses and timestamps,
| to ensure that different servers are highly unlikely to
| generate the same UUID.
| charlieboardman wrote:
| They are not, 100% strictly speaking, "ensured". But they are
| 128bit numbers, so you have realistically no chance of
| generating a uuid that someone else has already. Age-of-the-
| universe type chances of duplicating one.
| function_seven wrote:
| They're not randomly generated. They're generated using a
| Feistel cipher. [1]
|
| He's ensuring the uniqueness by indexing from 0, and applying
| the cipher to come up with a more "random" looking UUID.
|
| [1] https://eieio.games/blog/writing-down-every-
| uuid/#toc:feiste...
| Lammy wrote:
| UUID is a 128-bit value, of which 122 bits are available for
| actual data. UUID was conceived as a way to mark an
| intersection point between two dimensions, originally for
| Apollo Computer's RPC system where the two dimensions were time
| and hardware identifier ( _originally_ originally Apollo
| hardware serial number, later commonly 802.3 address). The
| additional bits are metadata telling you that a particular
| 128-bit value is a UUID, not just a coincidental jumble of
| bits, and which type of UUID.
|
| This site is specifically about "V4" UUIDs where the two
| dimensions are random and also-random. If you scroll all the
| way to the bottom you will see that the last table row is
| numbered the same value as the maximum 122-bit number, so the
| site is flipping every possible bit-combination within that
| space combined with the metadata bits that say "Hello I am a V4
| UUID": irb> ::Array::new(122, 0b1).reduce { (_1
| << 1) | _2 } => 5316911983139663491615228241121378303
| Tuna-Fish wrote:
| He has a writeup of it here: https://eieio.games/blog/writing-
| down-every-uuid/
|
| He's using a bijection between the number on the left (which
| are ordered) and the UUID that's designed to produce something
| random-looking. The simple fact that bijection cannot produce
| the same output out of two inputs (or it's not a bijection)
| means that all the UUIDs are unique.
| jonny_eh wrote:
| I thought this was going to be a list of every .com domain that
| is a valid uuid. Now I'm wondering how many of those exist?
|
| Update: Another commenter already shared:
| https://news.ycombinator.com/item?id=42342653
| netcraft wrote:
| for a minute I thought this was a domain reseller that was
| offering .com uuid domains
| layer8 wrote:
| This needs an "I'm Feeling Lucky" button.
| a3w wrote:
| I looked for deadbeef-f00d-f00d-deadbeef**
|
| but did not find it. Search is just on active page, that gets
| ever longer?
| Aachen wrote:
| I don't think f is a valid UUID version. One of these positions
| should be 1-6 or so (not sure who's the authority on which
| version works how, IETF maybe?)
| s4i wrote:
| That's not a valid UUID? The version and variant parts are
| missing.
| osamagirl69 wrote:
| deadbeef-f00d-f00d-deadbeef isn't a valid UUID v4
|
| Aside from missing a grouping in the middle, you need the
| version and variant bits, ie:
|
| XXXXXXXX-XXXX-4XXX-VXXX-XXXXXXXXXXXX
|
| where V is 8, 9, A, or B
|
| searching for deadbeef-f00d-400d-a00d-deadbeef does return the
| expected matches
| cdfuller wrote:
| Please add a button to export to Excel.
| dumbfounder wrote:
| At first I thought this was a list of all the domain names that
| were in UUID form. Which would be equally as useful to many
| people.
| sergiotapia wrote:
| I'm going to take these, please mark them as taken
|
| ec971907-4564-46ec-b28b-d76f1a2233c8
|
| 58737c1a-9294-4ffa-8082-b5364923a59c
|
| ba6ca980-b405-48b9-9770-252611d40ef1
|
| Thanks!
| sjm wrote:
| np, I'm taking deadbeef-beef-4000-beef-deadbeefdead
| efitz wrote:
| I'm writing a script that scrolls through the site, scrapes the
| UUIDs, and stores them in an AWS S3 bucket. I'll let you know
| when it finishes.
| chrisandchris wrote:
| Something tells me S3 was not designed for that and will break,
| and then everything will break.
|
| And because StackOverflow broke too, there's nobody available
| to fix it.
| zaptheimpaler wrote:
| OMG thank you!! I was looking for one that goes well with my
| shoes and I finally found the one -
| 346c7747-a421-4073-881e-7a7282b6150b.
|
| EDIT: That one is MINE. PLEASE DO NOT USE IT.
| xg15 wrote:
| Who needs infinite scroll when you can have technically finite
| scroll!
| xg15 wrote:
| This is amazing! I can finally get that vanity UUID I was
| dreaming of for so long!
| gavinsyancey wrote:
| The search seems to be missing
| `c12a7328-f81f-11d2-ba4b-00a0c93ec93b`
| tln wrote:
| That's a version 1 UUID, site only has version 4's
| senko wrote:
| This only contains V4 UUIDs. Disappointed.
| modeless wrote:
| Seems like the only feature missing (besides social sharing
| mentioned in the blog post) is deep linking to specific UUIDs.
| jvanderbot wrote:
| Tangentially related:
|
| HN recently (last few months) had an article explaining how large
| a number was. The number was something like busy beaver or 128
| bit integers or something else.
|
| It illustrated how large the number was by creating activities
| you would do, incrementing the counter as you did them. The
| sequence went something like this: Walk, and
| every time you take a step. Add 1 After you have
| circled the earth, place a sheet of paper on a pile, and start
| walking again. Continue, until the paper pile
| reaches the sun, then place a grain of sand in the Grand Canyon
| and start over. Continue until you have filled the
| Grand Canyon, etc etc
|
| It continued for a lot of such steps until you finally counted up
| to the number in question.
|
| What was the number? What were the steps?
| booleandilemma wrote:
| Jeff Bezos' net worth?
| redundantly wrote:
| The number you're thinking of is 52! (52 factorial) and how
| long it would take for 52! seconds to pass by.
|
| Vsauce has a great video on this, and might be where that
| example was taken from.
|
| https://www.youtube.com/watch?v=ObiqJzfyACM
|
| That example starts 16 minutes into the video:
|
| https://www.youtube.com/watch?v=ObiqJzfyACM&t=964s
|
| But it's worth watching the whole thing.
| jvanderbot wrote:
| Yes! Nice find thank you.
| tempestn wrote:
| And that number is relevant because it's the number of
| possible ordering of a standard deck of 52 cards. There
| are... a lot of them.
| tln wrote:
| https://www.tiktok.com/@mrgeemath/video/7353832903404490027?...
| concerndc1tizen wrote:
| And then do that in parallel for 10 billion people. And for
| each of their devices, and servers or other supporting
| infrastructure. And do it multiple times per second (e.g. for
| every log message, every datapoint, ...)
|
| That's why we need 128 bit numbers.
| delecti wrote:
| I've seen "thought experiments" (not sure they're quite that,
| but close enough) like that for a variety of things. The big
| numbers I've seen that done for most often are: unique
| shufflings of a deck of playing cards (about 10^68), atoms in
| the universe (about 10^80), and a googol (10^100). I've
| definitely seen the playing card one involve the walk around
| the world, pile of paper, grand canyon, etc (also drain the
| ocean a drop at a time, IIRC).
| skrause wrote:
| It was 52!, the number of possible permutations of 52 cards:
| https://czep.net/weblog/52cards.html
| Arch-TK wrote:
| Wow, it's a website which has more than a screen-full of stuff on
| it at one time and scrolling doesn't introduce a seconds-long
| loading animation.
|
| I wonder if modern web developers of modern web applications
| could somehow harness this technology.
| gibibit wrote:
| 100% this. I thought the same thing immediately, "wow, this is
| fast and smooth and responsive!!"
|
| It's ludicrous how our computer hardware is 1000x faster than
| it was 30 years ago in 1995, but software is so bloated that it
| is still slower!
|
| Relevant: "Will Software Stop Getting Slower?" Jonathan Blow
| https://www.youtube.com/watch?v=4ka549NNdDk
| zellyn wrote:
| You can also use something like DES3 to get a bijection. Easier
| if it fits in 64 bits so you only need one block.
| bicx wrote:
| I'd like to announce my new `npm` package called `get-uuid`.
| Behind the scenes, it loads `everyuuid.com`, picks a random row
| number, and returns that UUID.
| switch007 wrote:
| Please, only try to break the library's api 5 times a month,
| otherwise it's just too much
|
| And look forward to my realising your package doesn't quite do
| want I want and forking it
| peterpost2 wrote:
| That's a terrific idea, I'll also create a npm package, that
| consumes yours and returns the Guid but without the '-' between
| the digits. Go code reuse!
| pie_flavor wrote:
| I found a good UUID but immediately lost it because the custom
| scroll also interprets left and right scroll :(
|
| (this also breaks browser forward and backward trackpad gestures)
| theonewolf wrote:
| I found the Pi UUID:
|
| 185e45bc-750b-43d7-91ee-314159265358
| theonewolf wrote:
| I found the Pi UUID: 185e45bc-750b-43d7-91ee-314159265358
| empty_space wrote:
| I spent far too much time being childish with this, but I am
| quite pleased that:
|
| 69420694-2069-4206-9420-694206942069
|
| is a valid UUID.
| atulvi wrote:
| wow. this is so cool
|
| TIL aaaaaaaa-aaaa-4aaa-aaaa-aaaaaaaaaaaa is a valid uuid
| NathanaelRea wrote:
| It seems to skip a lot for substring search. For example if you
| search for 'aaaa' there's maybe 100 jumps to get to the bottom.
| So i'd assume that it's just a uniform random over the entire
| range to some limit, then filter idx > cur. But I feel like you
| could constrain the search more. The 'close next' should have
| exactly the same characters at the front. Like in your example
| '4AAB-' you would search valid position 14 first.
|
| edit: actually this doesn't work because having the same start
| does not mean they are close together.
| grahamj wrote:
| Love it! I can't help but think there's still a way to use native
| scrolling though. You could start with a tall document, say, 10k
| pixels and grab the scroll position and multiply it out when it
| moves to get sort of a macro scroll position. That would handle
| the arrows and clicking or grabbing the scroll box.
|
| But the wheel would be tricky because you want to scroll by only
| one or a few items, not items/10k. With a static viewport-sized
| DIV set to overflow-y:scroll and large vertical content size,
| positioned so you don't see the scroll bar, when the mouse is
| over it it should capture wheel movement which you could
| translate to an offset from your macro scroll position.
|
| Just a thought. Either way, love the thinking here, fun work :)
| retr0grad3 wrote:
| I'm now the proud owner of
| 69ac8bd2-4ca0-4dd9-82b5-60fabec0b404.com
| sam0x17 wrote:
| lol I misunderstood, I thought someone had searched for every
| domain name that happens to be a valid UUID
| Cotterzz wrote:
| What percentage of the 100+ Zettabytes of data now on the
| internet does this page take up?
| ForHackernews wrote:
| Shoutout `deadbeef-91c5-4ef3-b6d9-0a1c95775b4d`
| jongjong wrote:
| UUIDs are the best.
| TZubiri wrote:
| There's a fine line between a hacker's cool personal project and
| a schizophrenic's magnum opus
| layer8 wrote:
| This could use a "scrubbing" control, where when scrolling by
| dragging vertically, the scrolling speed depends exponentially on
| the horizontal position. (Meaning, for example, dragging 10
| screen units vertically when the pointer is at horizontal
| position _x_ would scroll by 10^( _x_ /10) entries.)
| NautilusWave wrote:
| For some reason, I was expecting the search to filter the results
| instead of just work like Ctrl+F. It'd be nifty if it could
| collapse non-matching UUIDs.
| shayonj wrote:
| > Scrolling through a list of UUIDs should be exciting! I wanna
| see bb166283-2e09-4b72-ba32-70a43521c70e, not
| 00000000-0000-4000-8000-000000000000!
|
| This was my favorite bit and speaks a lot about the craft behind
| this page! v cool <3
| chamomeal wrote:
| Holy shit it's a real life library of babel!!
___________________________________________________________________
(page generated 2024-12-06 23:00 UTC)