The birthday paradox says we have a double chance of finding the same birthday date in given group of people.

Now let's apply this paradox on n-bit hashes, then it says: We find n-bit hash in 2n ops, but the first match can be found in 2n/2 ops. Please see my self explanatory picture ^^^

Source: I am trying to draw some words from Hackin9 newspaper ;)

Btw thanks for materials and tips from unknown ghost called: acuzeuvrtx on net 👍

Simply said: You are being born in 2 moments, but dying in 1 moment in time.

Of course if you think I am hacking the ciphering of the banks with this idea, you are wrong, I am trying to shorten the DNA deciphering in biology. I need to bring ideas for saving of my sperm, where DNA is probably hurt now.

---