Secp256k1: Solving Partial WIF vs Decimal
I have a question that I can’t seem to find an answer to, although I have an idea of what the answer might be.
Context: I have the public key.
I have a missing part of the private key in decimal, for example:
1234567891011121314151617\*\*\*\*\*\*\*\*\*00000000000000000
The WIF will show me the beginning, but the end will be uncertain since the missing digits are in the middle.
However, in decimal, I know that the ending 00000000000000000 means that the number is a multiple of 10¹⁷.
Is there any way to reduce the number of possible candidates for the ending of the WIF? Or does that information not help at all?
And yes, I already know which method would be much faster for recovering the missing part of my private key, but I’m specifically testing and having fun comparing decimal vs. WIF.
My example private key is intentionally very small to make it easier to digest
[link] [comments]
from Bitcoin - The Currency of the Internet https://ift.tt/WHNKCQc