deleted by author
This paradox also helps illustrate the bitcoin difficulty.
If enough hash attempts are in the room, one will show up that is above the difficulty. Even though there’s 2^256 possibilities (an impossibly high amount) the birthday paradox explains that only a relatively small amount of total hashes are needed before we find “collisions.” And in this case, because the difficulty is a threshold, there are many possible hash collisions.
reply
TIL... thanks for sharing.
reply
Fun fact. I have the same birthday as my ex wife.
reply
Also a fun fact. I have a brother born the day after my birthday but 20 years younger. I moved out before he was born.
reply
reply
deleted by author
reply
That must come in handy. Get it all over with in one month.
reply
reply
Reading this I understood why the probability increases so dramatically. If you've got n people, adding a person actually adds n chances of their birthday repeating.
reply
A bit more information about the assumption of uniformity of the distribution of birthdays in a calendar year (American perspective)
An examination of the histogram shows significant seasonal variations. The months July - October show higher than expected births and March - May show the most significant decline in births. Perhaps the most reasonable explanation is that conceptions are up in the months of October through January and down in June through August. You be the judge.
The implications for the original questions are that slightly fewer persons are needed to get a single match and slightly more persons are needed to have every day covered if the distribution is not uniform.
reply
The kind of useless data that is good to know 👍
reply
21 sats \ 1 reply \ @ek 10 Sep 2023
Knowledge about the Birthday Paradox is important to understand probability of hash collisions :)
You just need to know where to apply this information
reply
deleted by author
reply