15 digits ~= 88 bits
Chance to find 2 in a row: once in ~176 bits
Curve order: ~256 bit.
Okay how bout 10 digit ?
So do you think my idea..
Brute... if find prefix ... skip ... trlion key and continue brute.. repeat .. is feseable or not ? 😅🙏
🚀 Go for it. Scanning 3000 trillion keys just to get to a 10-char match, and then skipping 1 trillion keys. Totally feseable and you save on the energy bill too. But why not skip 10 trillion? Or 100 trillion? Ouch, at some point the calculation precision of the events likely to happen starts to not show up as "0.0000000% chances of this shit ever to be seen"? Well, I guess that might mean there is no safe jump size, except maybe a jump of 1 (go to next key). Otherwise, it's as scientific as playing hide and seek.