You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Honestly, I’m not very familiar with this I just wanted to clarify: what if I already know the exact checksum? The characters I’m looking for are the first nine in a row, like in the compressed WIF: L?????????5ipgK234…including the checksum I know. I thought that knowing the exact checksum might narrow down the number of possibilities. Or does your program not support filtering by checksum?
Sorry, my English is poor I’m using a translator.
The text was updated successfully, but these errors were encountered:
The problem is the size of the search-space that is massive. The program computes the double SHA256 hash of each permutation then compares it with the checksum. It has to do it 7.4 quadrillion times (9 missing) which makes it impractical.
You can check out other projects on GitHub that use a different approach that doesn't involve checksum and also use the GPU.
Honestly, I’m not very familiar with this I just wanted to clarify: what if I already know the exact checksum? The characters I’m looking for are the first nine in a row, like in the compressed WIF: L?????????5ipgK234…including the checksum I know. I thought that knowing the exact checksum might narrow down the number of possibilities. Or does your program not support filtering by checksum?
Sorry, my English is poor I’m using a translator.
The text was updated successfully, but these errors were encountered: