|
Everyone knows that bitcrack only goes by consecutive keys. You can make your own program it you want to go random but it will be much slower vs consecutive keys/incremental.
|
|
|
|
How how long will it take brute force
64 Bytr privatekey ?
65 Byte privatekey ?
70 Byte privatekey ?
If GPU power = 6 000 Mkeys/sec
2^64 = 98 years 2^65 = 195 years 2^70 = 6,239 years You confused bits with bytes. Also, those are worst case. The average times are half. Using a naive search: Average time (in seconds) = 2 bytes x 8 - 1 / 6x10 964 bytes = 3.54x10 136 years 65 bytes = 9.06x10 138 years 70 bytes = 9.97x10 150 years 256 bits = 3.06x10 59 years If you use have a huge amount of memory you can use the method discussed here: https://bitcointalk.org/index.php?topic=5244940.0, and theoretically reduce the average times to: Average time (in seconds) = 2 bytes x 4 / 6x10 964 bytes = 6.12x10 59 years 65 bytes = 9.78x10 60 years 70 bytes = 1.03x10 67 years 256 bits = 1.80x10 21 years As you can see, attempting to crack a private key by brute force guessing is quite hopeless. No, he meant bits not bytes, he always call bits bytes |
|
|
|
Good day ! How how long will it take brute force 64 Bytr privatekey ? 65 Byte privatekey ? 70 Byte privatekey ? If GPU power = 6 000 Mkeys/sec Big Thank you  2^64 = 98 years 2^65 = 195 years 2^70 = 6,239 years |
|
|
|
Can someone throw off the working version of pikachunakapika / bitcrack??? I searched the Internet and cannot find anywhere. need a random function. on https://github.com/ deleted. Please friends help. Your best bet is to create a batch file that does the random for you. The random function in the version you are speaking about is slower because it takes more time to regen the randomness than to just go in sequential order. A batch function lets you jump in and out of ranges randomly. I have python script that writes batch script with random ranges. You can select the low and high of the range for example: Low: 8B00000 High: 8BFFFFF So the script will randomly generate a start and end range inside of that range. Or, use the --share option for "randomness" Share the script. Itself could not write as it should. Here is the python script (I run python 2.7 on Windows): # Randomizer for BitCrack
# Amateur Coding by the Wandering Philosopher
import os
import random
from datetime import datetime
random.seed(datetime.now())
arq1 = open('RandomBitCrack.bat', 'w')
y = ("FFFFF")
Y1 = int(y, 16)
arq1.write(":while1" + '\n')
for x in range(20):
low = 0x000000000000000000000000000000000000000000000000ED00000000000000
high = 0x000000000000000000000000000000000000000000000000EDFFFFFFFFFFFFFF
blah1 = random.randrange(low, high)
blah = str( hex( random.randrange( low, high ) ) ).rstrip("L").replace("0x", "00000000000000000000000000000000000000000000000")
eazy = hex(blah1 + Y1).rstrip("L").lstrip("0x")
arq1.write("start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace " + hex(blah1).rstrip("L").lstrip("0x") +":" + eazy + " -i 64.txt -o FOUNDTHEPRIVATEKEY.txt" + '\n' + "timeout /t 6 /nobreak" + '\n' + "taskkill /im cb1.exe /f" + '\n' + "timeout /t 1 /nobreak" + '\n')
arq1.close()
Batch file produced: :while1
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed5f9f957a417cae:ed5f9f957a517cad -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed5ce1cdf696c89f:ed5ce1cdf6a6c89e -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ede87bf0498ffc93:ede87bf0499ffc92 -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed4482d8f1e25b9e:ed4482d8f1f25b9d -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace edbd36f37234898c:edbd36f37244898b -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed8511d049941d6f:ed8511d049a41d6e -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed5f9b5cd289b8ef:ed5f9b5cd299b8ee -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed8a07e85d77b716:ed8a07e85d87b715 -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed91263ac5f6d2ca:ed91263ac606d2c9 -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed1d4a9023dd6bfb:ed1d4a9023ed6bfa -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed72d72cee1da3ca:ed72d72cee2da3c9 -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed1b50d6fc437042:ed1b50d6fc537041 -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed71ac3573476040:ed71ac357357603f -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed2ac546cac9806e:ed2ac546cad9806d -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace eddf6d5744433345:eddf6d5744533344 -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace edb5ca5f89c2c400:edb5ca5f89d2c3ff -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace edbaa4935a4fda3e:edbaa4935a5fda3d -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace edbe2cbe32f92f56:edbe2cbe33092f55 -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ede9ad4e751e6975:ede9ad4e752e6974 -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
start cb1 -d 1 -b 64 -t 256 -p 256 --keyspace ed7484d8f9fb1ee7:ed7484d8fa0b1ee6 -i 64.txt -o FOUNDTHEPRIVATEKEY.txt
timeout /t 6 /nobreak
taskkill /im cb1.exe /f
timeout /t 1 /nobreak
If you want to produce more than 20 random ranges, adjust the "for x in range(20):" in the code for however many you want. I normally run 1000. If your bitcrack .exe file is named something else (which it probably is) change the "cb1" in both spots to the name of your bitcrack .exe file. If your device number is something different, change it from -d 1 to whatever yours is, example -d 0. You can adjust the time the script runs in each range by changing the "timeout /t 6 /nobreak" example, if you want each range to be searched for 60 seconds, change it to "timeout /t 60 /nobreak". If you want to have different gpu settings other than "-b 64 -t 256 -p 256" adjust them. If your input file is named something else besides "64.txt" change it to whatever your input file is (input file of what addresses you are searching for). If you want your output file to be something other than "FOUNDTHEPRIVATEKEY.txt" change it to your desired output name. Once you've made any changes, run the python script and it will automatically generate the batch file. Place the batch file inside your bitcrack folder, with the bitcrack.exe file, and your input file, and let it rip. It's nothing fancy, just a low down and dirty python script that allows me to search random ranges without modifying/hacking the code inside bitcrack code and slowing it down any. Edit: one last thing, I have it set up to randomly generate a range of "FFFFF", change that if you want a larger or smaller range. Change the "y = ("FFFFF")" option. I chose that range b/c my GPU can get through that range within the 6 seconds. WanderingPhilospher Hi there, is this also available for jl's kangaroo or alek's. thanks man again for great piece there. What would you want it to do? I can generate different variations. A few thoughts with kangaroos... If you use the same setup for either of the kangaroo, you either have to use a timer or the -m x.x option for Jean Luc's kangaroo. Alek's doesn't have that option. The thing that isn't good using the -m x.x option, is you have to go 6 times the expected op for a 99% verification that the key isn't in the range. BSGS (baby step giant step) gives a 100 percent check that key is or is not in a certain range. I was playing around with BSGS last night, with a FFFFFF range (2^ 24 range) and it was checking about 7 ranges per second with a 200000 baby step size. The last but obvious requirement, you have to have pub keys for any kangaroo program. Do you use BSGS with any server? |
|
|
|
What do you mean you can't find any keys from 1-80? 2^1 to 2^80? It's posted on github this program only searches up to 125 bits. If you don't know the range or the known range is above 125 bits, then this program isn't for you/won't help you. Jean Luc says it's an easy mod to increase the program to search up to 256 bit range, but if you don't know the range, it's still not going to help. Do you know the mod to increase the program to search up to 256 bit range? |
|
|
|
you can not find private key or even its range from an address or from its public key. that is simply impossible. what vanitysearch and similar tools do is that they give you as many possible private keys as you want that could generate an address that has a small number of predefined characters. for example you can find lots and lots of private keys that could give you an address that start with "1ABC"
what exactly are you trying to do?
Well actually you're wrong, you can find a private key or even its range from its public key. You should already know what he is trying to do. |
|
|
|
 They're both just going back and forth. |
|
|
|
0x64 - CC C0 83 23 FA CC 7D 51  It is a joke. It is not the key 64. -snip- Lol ) It was no joke as I see. The key is 64bit But another one, not from the target address LOL exactly, he was so serious posting that. I see him using an vanitygen script.  |
|
|
|
|
Where is the program or is this person trying to sell it as usual?
|
|
|
|
As I understand it, you can’t leave links to other resources here? I saw a channel on Patreone called Bitcoin Riches, where they talk about a script that you can solve a puzzle.
Inbox me the links so I can see what you spamming about |
|
|
|
|
Well y'all always can get a job since its not much money being made. Just move on instead of constantly complaining about it every week.
|
|
|
|
If you starts like this:
VanitySearch.exe 1BTC
At each startup, the base key is choosen randomly.
VanitySearch.exe -s "My Seed" 1BTC
In this case,it will compute the same thing each time, the base key is computed from the seed.
Merci beaucoup Jean Luc How many bits is "1BTC"? |
|
|
|
Hello, would it be possible for someone to modify the program so that instead of searching for the bitcoin address he searches for the public key (compressed) in its hexadecimal form without the prefix (02 or 03).
Example: we know that for private key N°1 (1BgGZ9tcN4rm9KBzDn7KprQz87SZ26SAMH) the compressed public address corresponds to: 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
I would like BitCrack to search for this public key without the prefix 02 at the start (basically it searches for the X coordinate only)
My goal here is not to find the private key of an address but to search (try ^^) to find a correlation between private key and public key. I know that at the moment of today certain think that it is impossible (and they are certainly right) but I would like all the same to carry out certain research and that is why I will need to modify the program. Unfortunately my skills in C ++ and even in python for that matter leave something to be desired. Thank you in advance for the help you could give me or any external link not too complicated to implement. Thank you
Bitcrack is not made for that but you can use this for what you're talking about but the speed is not with an gpu though. https://github.com/Telariust/pollard-kangaroohttps://bitcointalk.org/index.php?topic=5173445.msg52473992#msg52473992https://bitcointalk.org/index.php?topic=5166284.msg52318676#msg52318676 |
|
|
|
I have a question.
Is there any ready script e.g. in PHP or JavaScript which I could check the number of all BTC addresses starting with the prefix indicated? Suppose I would like to know the number of all addresses starting with "1Bitcoin". I mean the total number resulting from ECDSA rules (so regardless of balance).
The number of all BTC addresses starting with a prefix indicated is: 2^160 / (difficulty of that vanity address). Then you need a software to compute the difficulty. example: prefix 1A --> difficulty = 22 --> number of all BTC addresses starting with 1A = 2^160 / 22 = 66431892605950132645622037850740137257087842862Here some details: https://bitcoin.stackexchange.com/questions/48586/best-way-to-calculate-difficulty-of-generating-specific-vanity-addressDifficulty is basically number_of_all_possible_addresses / number_of_addresses_with_vanity_prefix rate.
Here a old software: https://github.com/fordhurley/vanitycalcOf this number 66431892605950132645622037850740137257087842862 how many of those keys are compressed? |
|
|
|
so why not 1FFFFFFFFFFFFFFFF or just 1A838B13505B26867 as end of keyspace or i am seeing this wrong.?
anyone care to enlighten.? i say that cause most threads around the 32 or 100 btc puzzle are so silent recently.
still thinking the FFF thing is wrong, only one left with pubkey 110 bits,
vanitygen not fast enough, and ndv is paid only for upgrades? bitcrack not fast enough but great i guess,
so these programs to use for all this, and all the others i know are for public key search. no one giving updates,
Telariust hi, any news soon? Zielar, maybe sample of app with gpu pollard ready somewhere.?
So nooby where's you'r app. Finished already with the memory issues.
Of course they're all not fast enough and slow, because you're trying to brute force it, what do you expect. By the time someone else comes up with a new or modified program, the next key will be cracked by then. |
|
|
|
|
Based off Vanitygen:
The number of all BTC addresses starting with a prefix indicated is:
2^160 / (difficulty of that vanity address).
Then you need a software to compute the difficulty.
12c6 --> difficulty = 77178 --> number of all BTC addresses starting
12c6 --> 2^160 / 77178 =
18,936,764,846,600,105,188,054,689,584,030,203,162,247,435 that begins with 12c6
|
|
|
|
|
Y'all do know there is no such things as 2 different private keys going to the same BTC address. That's just like saying 2 different passwords going to the same email account. A BTC collision (Finding a private key to an address with BTC) can still happen.
|
|
|
|
|
Show Posts
