voyagerlife
commented
5 years ago @sqsezs @SatoshiNakamotoBitcoins @TheRealLordFractal @hamnaz Thanks to you all for this hard work and sharing. You guys are all experts and I unfortunately don't have that much skills. But I'm just wondering and thinking that there should be a modification of this project https://github.com/Isaacdelly/Plutus to brute force certain wallet addresses instead random ones?
Efficiency: _It takes 0.0032457721 seconds for this progam to brute force a single Bitcoin address. However, through multiprocessing.Process() a concurrent process is created for every CPU your computer has. So this program can brute force addresses at a speed of 0.0032457721 ÷ cpucount() seconds.
SatoshiNakamotoBitcoins
hamnaz
TheRealLordFractal
prodnet
OSoup
Hello, what if the search gets a wordlist. I mean, if we have a wordlist with 4 digits created with crunch for every possibility for 0123456789ABCDEF, and we divide all of the digits in the private number on a components 4 digits long. First will cycle at the end, when it does the second will change with one row, when the second one cycle the third pars with 4 digits will cycle. 0000...000014F2 when this four cycle all possibilities it goes to 0000...00010001. If we do this, in a clear math, you could crack almost any bitcoin wallet in a month with 200Mkeys/s. This is a way around … no need to wait 100 years to crack a private key, it still checks every possibility, it still wont miss anything, but will be at least 4 times faster. if the digits are 3, it may be even faster, just because the possibilities from 000 to FFF are much less. Think about it. what do you think of my idea?