unfortunately, there is a possibility of missing the desired value.
That said all no? The possibility of missing the target value with bigger keys is great.
many test was. real steps to find was different.
22-bit at this test is:
1011011110010000001111
777854but anyway its better vs range(2**21, 2**22-1)
Lets say this is a private key, 3857991093436143 and you only know it starts with 3, that's all. Now that you have no other knowledge about the key other than what it starts with, can you give us a %100 working method to reduce the size of that key and still finding it successfully?
If you can do that, congratulations because you just partially broke elliptic curve.
Can I express my opinion on this?
I have examined this in most of the solved puzzles and I think it can be used to filter ranges. Multiply the decimal equivalent address of the target address's checksum by the number 3 and repeat this multiplication until the calculated number reaches the range of the desired puzzle. With a high probability, we can eliminate the range before that number from the search because most of the puzzles had their keys near the number obtained with this calculation or were located after that number. Perhaps it will help filter ranges.
