Gmaxwel could you more explain ?
Imagine that you have a generator that randomly chooses a single letter.
Imagine that you want to run the generator until you get the letter "R".
Every time the generator generates a new letter, you have a 1 out of 26 chance of generating the letter R.
The average amount of time you might need to run the generator is 13 generations to get that "R" (sometimes sooner, sometimes longer).
If you are unlucky, it could take you hundreds of generations until you happen to get the letter "R".
If you want to generate the letter R twice, it will take even longer since you will first need to go through all the generations to get the first "R" and then do it all over again.
Imagine instead that you just want to run the generator until you get the same letter twice (you don't care what letter it is).
This will happen much faster.
On the first generation, you will have a 0 out of 26 chance of getting two of the same letter (since you will only get 1 letter).
On the second generation, you will have a 1 out of 26 chance of getting two of the same letter (since you must match the first generation).
On the third generation, you will have a 2 out of 26 chance of getting two fo the same letter (since you can match EITHER of the first 2 generations).
On the fourth generation, you will have a 3 out of 26 chance of getting two of the same letter (since you can match any of the first 3 generations).
On the fifth generation, you will have a 4 out of 26 chance of getting two of the same letter (since you can match any of the first 4 generations).
Notice that your chances keep getting better and better with each new generation since you have more and more letters from past generations that you can match with your next generation.
Also notice that you are GUARANTEED to get a match within 27 generations, since after 26 generations you will either already have gotten a match OR ALL POSSIBLE letters will have been generated (so the next one must be a match to one of them).
The same effect applies to generation addresses (but on a larger scale). If you want to search SPECIFICALLY for an address that starts with 188888888, that's going to take quite a while since each character position has 58 different possible characters, and you require one specific character for each of them. However, if you just want to search for two address that start with the same first 8 characters as each other, and you don't care what those characters are, it will happen MUCH faster. Each time you generate ANY address, that's one additional address added to the list of addresses that can be matched by the next address generation.
)
