Search content
Sort by
Showing 12 of 12 results by indoarts
thank you for the reply , well i did what you had to tell me to take the known wif to test my rigs , just need more challenge , it doesnt need 40 strong GPUs to crack only 12 lost wif character with this program , if this coins have an owner , let the owner talk to me and maybe we can make collaboration.
I'm sure if this key was real, the owner would have already found the key by now, there is no evidence suggesting this address corresponds to that WIF. And I believe there is much more to improve on this tool, as I believe there is a way to up the speed by ten folds.
thank you for the reply , i m just asking do you have more data like that so i can test my rigs with that data , you just answer yes or no
For keys starting with 5J:
Code:
5J1111111115bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPGL3vBS
5Jzzzzzzzzz5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPFNXqkb
5Jzzzzzzzzz5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPFNXqkb
For keys starting with 5K:
Code:
5K1111111115bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPES53YJ
5Kzzzzzzzzz5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPFaZr5u
5Kzzzzzzzzz5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPFaZr5u
For compressed ones if you needed help let me know.😅which commme with
Thank you for the reply , i am wondering are those data coralated to address 1PfNh5fRcE9JKDmicD2Rh3pexGwce1LqyU ??
also i doubt the data that you gave to me . According to the info above its missing 12 characters infront of other characters . so if we add up the number becomes 52 characters it will be compressed wiff , it will Kw or Kz in front of those characters. . btw thanks again for the reply and the data .
thank you for the reply , well i did what you had to tell me to take the known wif to test my rigs , just need more challenge , it doesnt need 40 strong GPUs to crack only 12 lost wif character with this program , if this coins have an owner , let the owner talk to me and maybe we can make collaboration.
I'm sure if this key was real, the owner would have already found the key by now, there is no evidence suggesting this address corresponds to that WIF. And I believe there is much more to improve on this tool, as I believe there is a way to up the speed by ten folds.
thank you for the reply , i m just asking do you have more data like that so i can test my rigs with that data , you just answer yes and no
Hello @PawGo,
There's a diary that has a missing 12 WIF private key character and holds 500 BTC, $11Million. Do you think that this challenge a legit one? 1PfNh5fRcE9JKDmicD2Rh3pexGwce1LqyU
I'm just wondering because this challenge has been going around for months now. I doubt it.
Last 12 characters or in the middle? Post the key for everyone to see. You won't get any where alone.😉There's a diary that has a missing 12 WIF private key character and holds 500 BTC, $11Million. Do you think that this challenge a legit one? 1PfNh5fRcE9JKDmicD2Rh3pexGwce1LqyU
I'm just wondering because this challenge has been going around for months now. I doubt it.
do you have any other data like That ? i need to test my GPUs using wif solver cuda ?
regards
If you are interested to test your rigs, just take a known WIF, and remove a few characters to see how it works, this tool is the kangaroo for keys without known public keys but with known partial private keys!
thank you for the reply , well i did what you had to tell me to take the known wif to test my rigs , just need more challenge , it doesnt need 40 strong GPUs to crack only 12 lost wif character with this program , if this coins have an owner , let the owner talk to me and maybe we can make collaboration.
do you have any other data like That ? i need to test my GPUs using wif solver cuda ?
regards
regards
The simplest way to test performance of your card would be to launch examples from /docs/ folder. You may easily adapt them for your needs to calculate the performance and estimated time needed for solving the given problem.
Thank you for your kind reply
I already test all your test examples ,i need real wif solver case , my rigs is not much but if your program is good as your advertise here i wold like to try them with my rigs
regards
Hello @PawGo,
There's a diary that has a missing 12 WIF private key character and holds 500 BTC, $11Million. Do you think that this challenge a legit one? 1PfNh5fRcE9JKDmicD2Rh3pexGwce1LqyU
I'm just wondering because this challenge has been going around for months now. I doubt it.
Last 12 characters or in the middle? Post the key for everyone to see. You won't get any where alone.😉There's a diary that has a missing 12 WIF private key character and holds 500 BTC, $11Million. Do you think that this challenge a legit one? 1PfNh5fRcE9JKDmicD2Rh3pexGwce1LqyU
I'm just wondering because this challenge has been going around for months now. I doubt it.
do you have any other data like That ? i need to test my GPU using wif solver cuda ?
regards
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
noobs question and Just wondering , if you find the private key from one of those private keys puzzle , you just input the pv key to core wallet , or another wallet , or there is another step we should do l?
That's it, you just import the private key in WIF to core wallet and the BTC are yours.
Cheers.
thank you for your kind reply
cheers
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
noobs question and Just wondering , if you find the private key from one of those private keys puzzle , you just input the pv key to core wallet , or another wallet , or there is another step we should do l?
0368c52337698581d2509522b7e0cbeb500bb613b6ad0c27cda7e86988c796ee90
Keyrange 2: 1000000000000000000000000000
With who will find a private key we share 1.2 btc 50/50%
Find a privkey and post privkey in this thread.
ASAP privkey needed !!!
Regard
WonderPhilosofer, try find this puzzle ? We share 1.2 btc 50/50 ? You have so many keyrate power, help solve the this please
this public key have compressed address 19Ko3AotUnnkQmoScaMuKP1MLJcJj2ZsKH ,uncompressed adderess 12RpCH9REh9zDH6ges3kP5RDnv4KwnnC9s p2sh segwit 35fYJv6Eh3jgJNmziBwxXtZKmGhUFRXNpo and bc1qtd8wcatktkjnl096racpp3zvxrgyj7wk9lct0v for segwit address , i can not found any balance on those addreses , are you sure thats the right pub key ?
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
How many characters are in the private key in binary?
https://www.rapidtables.com/ convert/number/ binary-to-hex.html
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
@fxsniper
Here is the code I told you I would upload. It's not the exact one I was looking for but it is based on the same principle. Easy to change the range you want to search through. I modified my code to search for the RIPEMD of the address I was looking for. Shaves a few milliseconds off versus processing all the way to the address. I created this probably 6 months ago and I am sure it is not the most efficient coding. Hopefully it gives you some ideas on how to tweak and make exactly what you are wanting.
Here is the code I told you I would upload. It's not the exact one I was looking for but it is based on the same principle. Easy to change the range you want to search through. I modified my code to search for the RIPEMD of the address I was looking for. Shaves a few milliseconds off versus processing all the way to the address. I created this probably 6 months ago and I am sure it is not the most efficient coding. Hopefully it gives you some ideas on how to tweak and make exactly what you are wanting.
Code:
#Amateur, very amateur coding by the Wandering Philosopher
#Tested with Python 2.7
import binascii, hashlib, base58, sys, ecdsa, codecs, os, random
import time
import timeit
#Enter the RIPEMD160 of the address you want to search for; make sure it is in LOWERCASE
ripetofind = '3ee4133d991f52fdf6a25c9834e0745ac74248a4'
def compressed_RIPEMD(privkey):
start_time = timeit.default_timer()
pvk_to_bytes = codecs.decode (privkey, 'hex')
#Generates the public key
key = ecdsa.SigningKey.from_string (pvk_to_bytes, curve=ecdsa.SECP256k1).verifying_key
key_bytes = key.to_string()
key_hex = codecs.encode(key_bytes, 'hex')
if(ord(bytearray.fromhex(key_hex[-2:])) % 2 == 0):
#If the last byte of Y is Even, add '02'
public_key_compressed = '02' + key_hex[0:64]
#Making SHA-256 of compressed pubkey and then RIPEMD-160
public_key_in_bytes = codecs.decode(public_key_compressed, 'hex')
sha256_public_key_compressed = hashlib.sha256(public_key_in_bytes)
sha256_public_key_compressed_digest = sha256_public_key_compressed.digest()
ripemd160 = hashlib.new('ripemd160')
ripemd160.update(sha256_public_key_compressed_digest)
ripemd160_digest = ripemd160.digest()
ripemd160_hex = codecs.encode(ripemd160_digest, 'hex')
else:
#If the last byte of Y is Odd, add '03'
public_key_compressed = '03' + key_hex[0:64]
#Making SHA-256 of compressed pubkey and then RIPEMD-160
public_key_in_bytes = codecs.decode(public_key_compressed, 'hex')
sha256_public_key_compressed = hashlib.sha256(public_key_in_bytes)
sha256_public_key_compressed_digest = sha256_public_key_compressed.digest()
ripemd160 = hashlib.new('ripemd160')
ripemd160.update(sha256_public_key_compressed_digest)
ripemd160_digest = ripemd160.digest()
ripemd160_hex = codecs.encode(ripemd160_digest, 'hex')
elapsed = timeit.default_timer() - start_time
#Prints status and numbers on screen. Comment out both sys.stdout lines below if not wanted and the countall +=1 ; I liked to know it was working/running.
sys.stdout.write("\r" + " Key every: " + str(elapsed)[:7] + " seconds " + " Random RIPEMD160s: " + ripemd160_hex + " # of Keys: " + str(countall))
sys.stdout.flush()
fwrite = open('KEYSFOUND.txt', 'a')
if ripemd160_hex == ripetofind:
fwrite.write('Key: ' + randomprivkey + ' ' + ripemd160_hex + '\n' )
#Always leave countall = 0 below. If you want the program to run unlimited, comment out the countall +=1 down below
countall = 0
while (countall < 100000000000000):
if __name__== "__main__":
#Enter the range you want to search through below
low = 0x8000000000000000
high = 0xFFFFFFFFFFFFFFFF
#high = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140
randomprivkey = hex( random.randrange( low, high ) ).lstrip("0x").rstrip("L").zfill(64)
countall +=1
compressed_RIPEMD(randomprivkey)
#Tested with Python 2.7
import binascii, hashlib, base58, sys, ecdsa, codecs, os, random
import time
import timeit
#Enter the RIPEMD160 of the address you want to search for; make sure it is in LOWERCASE
ripetofind = '3ee4133d991f52fdf6a25c9834e0745ac74248a4'
def compressed_RIPEMD(privkey):
start_time = timeit.default_timer()
pvk_to_bytes = codecs.decode (privkey, 'hex')
#Generates the public key
key = ecdsa.SigningKey.from_string (pvk_to_bytes, curve=ecdsa.SECP256k1).verifying_key
key_bytes = key.to_string()
key_hex = codecs.encode(key_bytes, 'hex')
if(ord(bytearray.fromhex(key_hex[-2:])) % 2 == 0):
#If the last byte of Y is Even, add '02'
public_key_compressed = '02' + key_hex[0:64]
#Making SHA-256 of compressed pubkey and then RIPEMD-160
public_key_in_bytes = codecs.decode(public_key_compressed, 'hex')
sha256_public_key_compressed = hashlib.sha256(public_key_in_bytes)
sha256_public_key_compressed_digest = sha256_public_key_compressed.digest()
ripemd160 = hashlib.new('ripemd160')
ripemd160.update(sha256_public_key_compressed_digest)
ripemd160_digest = ripemd160.digest()
ripemd160_hex = codecs.encode(ripemd160_digest, 'hex')
else:
#If the last byte of Y is Odd, add '03'
public_key_compressed = '03' + key_hex[0:64]
#Making SHA-256 of compressed pubkey and then RIPEMD-160
public_key_in_bytes = codecs.decode(public_key_compressed, 'hex')
sha256_public_key_compressed = hashlib.sha256(public_key_in_bytes)
sha256_public_key_compressed_digest = sha256_public_key_compressed.digest()
ripemd160 = hashlib.new('ripemd160')
ripemd160.update(sha256_public_key_compressed_digest)
ripemd160_digest = ripemd160.digest()
ripemd160_hex = codecs.encode(ripemd160_digest, 'hex')
elapsed = timeit.default_timer() - start_time
#Prints status and numbers on screen. Comment out both sys.stdout lines below if not wanted and the countall +=1 ; I liked to know it was working/running.
sys.stdout.write("\r" + " Key every: " + str(elapsed)[:7] + " seconds " + " Random RIPEMD160s: " + ripemd160_hex + " # of Keys: " + str(countall))
sys.stdout.flush()
fwrite = open('KEYSFOUND.txt', 'a')
if ripemd160_hex == ripetofind:
fwrite.write('Key: ' + randomprivkey + ' ' + ripemd160_hex + '\n' )
#Always leave countall = 0 below. If you want the program to run unlimited, comment out the countall +=1 down below
countall = 0
while (countall < 100000000000000):
if __name__== "__main__":
#Enter the range you want to search through below
low = 0x8000000000000000
high = 0xFFFFFFFFFFFFFFFF
#high = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140
randomprivkey = hex( random.randrange( low, high ) ).lstrip("0x").rstrip("L").zfill(64)
countall +=1
compressed_RIPEMD(randomprivkey)
can we put additional code like " with open("my_ripemd _key.txt", "r") ? " cause i have tons of Ripemd address here ?
Regards
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Can this tools use for solve puzzle very old python code?
may be slow than bitcrack
https://github.com/Xefrok/BitBruteForce-Wallet/blob/master/seekanddestroy.py
may be need to modify to can use with custom keyspace for puzzle #64
done have other python script recommend to use better than?
all python code use random method right not calculate not pattern
I looking to bitcrack version python code
I would like to try use for puzzle #64 by random keyspace set it each 1000000 key and scan it and do random next keyspace
I can't not code c++ but python is easy more than. I can modify on python code
Sure it can , but in 3000000000 years ? OMG
