05-27-2020, 12:46 AM
Would it ever be viable to use Hashcat and the hash of a wallet.dat and cover every option within a word space. For example, what kind of processing power would it take to target every one of the 218,340,105,584,896 options for 62^8 (a-zA-Z0-9)?
I mean - it's possible to rent supercomputers...
I mean - it's possible to rent supercomputers...