Bitcoin puzzle transaction ~32 BTC prize to who solves it

[Alpaste]

Puzzle 64 is insane. like i've been running my GPU 2080ti 24/7 and still not getting luck. even though it's only 16 HEX characters.
i'm suspecting, that the address of the puzzle 64 is not in the range that is suppose to be.
What you think guys?

[heribertoX]

Puzzle 64 is insane. like i've been running my GPU 2080ti 24/7 and still not getting luck. even though it's only 16 HEX characters.
i'm suspecting, that the address of the puzzle 64 is not in the range that is suppose to be.
What you think guys?

quizas los programas que usas saltaron la direccion n64 hay programas con errores

[wipall]

I have revised this code for 64 bit, this code changes the starting point every 1000000 counters..
the problem in this code, is the truncation of the "zeros" what causes the skipping...it has pros and cons...
the advantage is that you can use it as a filter, the average of the zeros for the address you are looking for is between 22 and 43...

!! zeros = bina.count("100") .. this function only counts the zeros in binary code!!! also zeros = bina.count("0") or you count the ones ... ones = bina.count("1") !!

It's important to understand the functions so that you know what the code does and you can make conscious changes that work...

Code:

from bit import *
import random
from time import sleep

count=0

while True:
    a = random.randint(2**63, 2**64)
 #  while a <= 2**64:
    for x in range(1000000):
        x = x
        bina = bin(a)[2:]
        zeros = bina.count("0")
     #  if x in range(1):
        if x == 0:
            print(" !!!NEW LOOP!!!")
            sleep(2)
        if zeros >= 1:     # "00000000000000000000000000000011111111111111111111111111"
            if zeros <= 63: # "00000000000000000000000000000011111111111111111111111111"
                key = Key.from_int(a)
                addr = key.address
                count+=1
                print (hex(a), bina, zeros, str(count))
                
                if addr.startswith('16jY7qLJnxb'):
                    print(' '+hex(a)+'|'+ addr)
                    file=open(u"16jY.Info.txt","a")
                    file.write('\n '+hex(a)+' | '+ addr)
                    file.close()
                    sleep(3)
                    wait = input("Press Enter to continue.")
                    print(" continue...")
                    sleep(1)
             #  else:
             #      print (' Scan Nr.: ', str(count), end='\r') #pass
        a = a +1
    pass

Thank you very much for your attention, my friend.

always a pleasure dude!!

i managed to run the code sequentially.
I scan an average of 500,000,000 addresses a day.
and although the computer is very old

do you think it's too slow?

How many addresses do you scan on average per day?

[cbdcbf]

кинь кoд пocлeдoвaтeльнo

[Jolly Jocker]

The problem with Python is the "print" output, which costs time/processing power, without this, 12000 to 13500 keys/s are generated.. (12000/s = 1036800000 keys/24 hr)
With the print output only 1455.26it/s are generated, which is much too slow.. even 50000 or 100000 keys/s are too slow with a range of 9223372036854775807 possible keys..
Even GPU scanners with more than 150000000 keys/s need more than 1000 years ( 1949.80 ) for this range... (4730400000000000 keys/ year)

[Newbienewnewcoin]

I have nothing but free time on my hands lately and I've been like obsessed with it, it's fascinating. I was trying to take a jab at it with some computer experience and I find that all (well most) of the tools out there for cracking aren't compatible with my macbook air (lastest m1 model). I was wondering if anyone had any recommendations fo software or anything  considering my circumstance and using a macbook air, I know it's nothing compared to what's out there but it's all I have. Any recommendations  because I'm all ears!

[PrivatePerson]

I have nothing but free time on my hands lately and I've been like obsessed with it, it's fascinating. I was trying to take a jab at it with some computer experience and I find that all (well most) of the tools out there for cracking aren't compatible with my macbook air (lastest m1 model). I was wondering if anyone had any recommendations fo software or anything  considering my circumstance and using a macbook air, I know it's nothing compared to what's out there but it's all I have. Any recommendations  because I'm all ears!

I've used MacOS before, I've never had any compatibility issues with these programs:
Parallels Desktop - https://www.parallels.com/
Homebrew - https://brew.sh/

[Newbienewnewcoin]

I’ve tried to use bitcrack and kangaroo and a few other windows based apps. I never thought about parallels but thanks so! You’re talking about M1 Mac right? I obviously should utilize the time to learn lol

I have nothing but free time on my hands lately and I've been like obsessed with it, it's fascinating. I was trying to take a jab at it with some computer experience and I find that all (well most) of the tools out there for cracking aren't compatible with my macbook air (lastest m1 model). I was wondering if anyone had any recommendations fo software or anything  considering my circumstance and using a macbook air, I know it's nothing compared to what's out there but it's all I have. Any recommendations  because I'm all ears!

I've used MacOS before, I've never had any compatibility issues with these programs:
Parallels Desktop - https://www.parallels.com/
Homebrew - https://brew.sh/

[Jolly Jocker]

Test Code for the 64 bit range... ca. 310000000 keys/hr...

Code:

import random
from threading import Thread
import secp256k1 as ice
from time import sleep
print('\n ========= ================= ==ADDRESS HUNTER== ================= ==========\n\n')
y=1000000
count=-2000000
def process1(number):
    line_count=0
    num = random.randrange(0x8000000000000000,0xffffffffffffffff)
    for i in range(number):
        num+=i
        addr = ice.privatekey_to_address(0, True, num)
        lineA = (addr, hex(num))
        line_count+=1
                    
        if '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN' in lineA:
            file=open(u"BTH.Target.Info.txt","a")
            file.write('\n ' + str(lineA))
            file.close()
            wait = input("Press Enter to Exit.")
            exit()
                        
        if line_count == y:
            print(' current line: ', str(lineA))
            line_count=0
                    
while True:
    count+=(2*y)
    number = y
    threads = []
    print('\n Total Scanned Lines: ' + str(count) + '\n')
    for n in range(0,2):
        t = Thread(target=process1, args=(number,))
        threads.append(t)
        t.start()
        
    for t in threads:
        t.join()

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

[willi9974]

how can i start the script and what do i need?

[Jolly Jocker]

start the scrypt with double click .. simply to use in Python...
You need:
faster "bit" there is a library from "ice" https://github.com/iceland2k14/secp256k1 there it is necessary to throw its libraries into the folder with the script.

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

[brainless]

start the scrypt with double click .. simply to use in Python...
You need:
faster "bit" there is a library from "ice" https://github.com/iceland2k14/secp256k1 there it is necessary to throw its libraries into the folder with the script.

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

you dont have GPU ? any GPU ?

[Jolly Jocker]

start the scrypt with double click .. simply to use in Python...
You need:
faster "bit" there is a library from "ice" https://github.com/iceland2k14/secp256k1 there it is necessary to throw its libraries into the folder with the script.

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

you dont have GPU ? any GPU ?

This code is only for CPU, working with two Threads...

Sure, I use GPU too, but I don't can coding for Cuda applications like, vanitygen, Kangaroo, etc...

[brainless]

start the scrypt with double click .. simply to use in Python...
You need:
faster "bit" there is a library from "ice" https://github.com/iceland2k14/secp256k1 there it is necessary to throw its libraries into the folder with the script.

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

you dont have GPU ? any GPU ?

This code is only for CPU, working with two Threads...

Sure, I use GPU too, but I don't can coding for Cuda applications like, vanitygen, Kangaroo, etc...

i will sugggest same working your code at c and gpu, above link use git scripts, working 10005 better then you python code , ttoal same function,
even if your cpu have gpu inside, like i3-6100 process have gpu, its also work on this rotar, and auto use gpu at cpu based command,
https://github.com/phrutis/Rotor-Cuda, for fully random at gpu like bitcrack is BitCrack2, use that, you will forget python
dont forget merit me....

[walletrecovery]

Bitcoin Puzzle creators already have all private keys.
https://bitcointalk.org/index.php?topic=5389596.0

[Jolly Jocker]

start the scrypt with double click .. simply to use in Python...
You need:
faster "bit" there is a library from "ice" https://github.com/iceland2k14/secp256k1 there it is necessary to throw its libraries into the folder with the script.

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

you dont have GPU ? any GPU ?

This code is only for CPU, working with two Threads...

Sure, I use GPU too, but I don't can coding for Cuda applications like, vanitygen, Kangaroo, etc...

i will sugggest same working your code at c and gpu, above link use git scripts, working 10005 better then you python code , ttoal same function,
even if your cpu have gpu inside, like i3-6100 process have gpu, its also work on this rotar, and auto use gpu at cpu based command,
https://github.com/phrutis/Rotor-Cuda, for fully random at gpu like bitcrack is BitCrack2, use that, you will forget python
dont forget merit me....

I know Rotor-Cuda... and many more cuda programs... but I enjoy coding myself...

I do not have enough sendable merit. Sorry Dude!

[Alpaste]

Never give up on puzzle 64 guys!
it's only damn 16 HEX characters!

[Feron]

Test Code for the 64 bit range... ca. 310000000 keys/hr...

Code:

import random
from threading import Thread
import secp256k1 as ice
from time import sleep
print('\n ========= ================= ==ADDRESS HUNTER== ================= ==========\n\n')
y=1000000
count=-2000000
def process1(number):
    line_count=0
    num = random.randrange(0x8000000000000000,0xffffffffffffffff)
    for i in range(number):
        num+=i
        addr = ice.privatekey_to_address(0, True, num)
        lineA = (addr, hex(num))
        line_count+=1
                    
        if '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN' in lineA:
            file=open(u"BTH.Target.Info.txt","a")
            file.write('\n ' + str(lineA))
            file.close()
            wait = input("Press Enter to Exit.")
            exit()
                        
        if line_count == y:
            print(' current line: ', str(lineA))
            line_count=0
                    
while True:
    count+=(2*y)
    number = y
    threads = []
    print('\n Total Scanned Lines: ' + str(count) + '\n')
    for n in range(0,2):
        t = Thread(target=process1, args=(number,))
        threads.append(t)
        t.start()
        
    for t in threads:
        t.join()

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

I tested your code, but the wrong ddd code doesn't collide even with 2 hex, which is a big problem


this is what your code should look like which works at 100% delete tqdm slowing code 10%
import random
from tqdm import tqdm
import secp256k1 as ice
for x in tqdm(range(100000000)):
 num = random.randrange(0xd2c00,0xd2cff)
 add = ice.privatekey_to_address(0,True,num)
 if "1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum" in (add):
  f=open("von.txt","a")
  f.write(str(num)+"-"+(add)+"\n")
  f.close()

[Jolly Jocker]

Test Code for the 64 bit range... ca. 310000000 keys/hr...

Code:

import random
from threading import Thread
import secp256k1 as ice
from time import sleep
print('\n ========= ================= ==ADDRESS HUNTER== ================= ==========\n\n')
y=1000000
count=-2000000
def process1(number):
    line_count=0
    num = random.randrange(0x8000000000000000,0xffffffffffffffff)
    for i in range(number):
        num+=i
        addr = ice.privatekey_to_address(0, True, num)
        lineA = (addr, hex(num))
        line_count+=1
                    
        if '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN' in lineA:
            file=open(u"BTH.Target.Info.txt","a")
            file.write('\n ' + str(lineA))
            file.close()
            wait = input("Press Enter to Exit.")
            exit()
                        
        if line_count == y:
            print(' current line: ', str(lineA))
            line_count=0
                    
while True:
    count+=(2*y)
    number = y
    threads = []
    print('\n Total Scanned Lines: ' + str(count) + '\n')
    for n in range(0,2):
        t = Thread(target=process1, args=(number,))
        threads.append(t)
        t.start()
        
    for t in threads:
        t.join()

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

I tested your code, but the wrong ddd code doesn't collide even with 2 hex, which is a big problem


this is what your code should look like which works at 100% delete tqdm slowing code 10%
import random
from tqdm import tqdm
import secp256k1 as ice
for x in tqdm(range(100000000)):
 num = random.randrange(0xd2c00,0xd2cff)
 add = ice.privatekey_to_address(0,True,num)
 if "1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum" in (add):
  f=open("von.txt","a")
  f.write(str(num)+"-"+(add)+"\n")
  f.close()

I see you didn't understand the principle of my code...

This code (slightly modified) for the search for that Pubkey of 16jY7.... with 4 Threads make more as 380000000 Keys in 30 minutes...
I'll keep working on it... I'm sure there's more to come^^

Code:

import time
import random
import secp256k1 as ice
from time import sleep
from threading import Thread
from multiprocessing import Value
t = time.ctime()
print('',t)
print('\n |========== ========== ==========! PUBKEY HUNTER !========== ========== ==========||============\n\n')
print(' [*] create privkeys....', end='\r')

list=[]
a=2
y=1048576
counter = Value('L')
def process1(counter,number,n):
    ran = random.randrange(0x8000000000000001,0xffffffffffffffff)
    for i in range(number):
        ran+=1
        pub = ice.privatekey_to_h160(0, True, ran).hex()
        lineA = pub, hex(ran)
        list.append(lineA)
        if len(list)==y:
            for line in list:
                line!='\n'
                with counter.get_lock():
                    counter.value += 1
            
                if '3ee4133d991f52fdf6a25c9834e0745ac74248a4' in line:
                    threads.clear()
                    a=0
                    f=open("16jY7.txt","a")
                    f.write(str(line) +"\n")
                    f.close()
                    print('\n\n Target found!! \n' + str(line))
                    exit()
                
                if (counter.value)%y == 0:
                    print(' [ Recent-Line:', str(line),'] Total:', str(counter.value))#, end='\r')
                    list.clear()
                        
while len(list)<=y:
    number = y
    threads = []
    for n in range(a):
        t = Thread(target=process1, args=(counter,number,n))
        threads.append(t)
        t.start()

    for t in threads:
        t.join()

[Feron]

Test Code for the 64 bit range... ca. 310000000 keys/hr...

Code:

import random
from threading import Thread
import secp256k1 as ice
from time import sleep
print('\n ========= ================= ==ADDRESS HUNTER== ================= ==========\n\n')
y=1000000
count=-2000000
def process1(number):
    line_count=0
    num = random.randrange(0x8000000000000000,0xffffffffffffffff)
    for i in range(number):
        num+=i
        addr = ice.privatekey_to_address(0, True, num)
        lineA = (addr, hex(num))
        line_count+=1
                    
        if '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN' in lineA:
            file=open(u"BTH.Target.Info.txt","a")
            file.write('\n ' + str(lineA))
            file.close()
            wait = input("Press Enter to Exit.")
            exit()
                        
        if line_count == y:
            print(' current line: ', str(lineA))
            line_count=0
                    
while True:
    count+=(2*y)
    number = y
    threads = []
    print('\n Total Scanned Lines: ' + str(count) + '\n')
    for n in range(0,2):
        t = Thread(target=process1, args=(number,))
        threads.append(t)
        t.start()
        
    for t in threads:
        t.join()

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

I tested your code, but the wrong ddd code doesn't collide even with 2 hex, which is a big problem


this is what your code should look like which works at 100% delete tqdm slowing code 10%
import random
from tqdm import tqdm
import secp256k1 as ice
for x in tqdm(range(100000000)):
 num = random.randrange(0xd2c00,0xd2cff)
 add = ice.privatekey_to_address(0,True,num)
 if "1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum" in (add):
  f=open("von.txt","a")
  f.write(str(num)+"-"+(add)+"\n")
  f.close()

I see you didn't understand the principle of my code...

This code (slightly modified) for the search for that Pubkey of 16jY7.... with 4 Threads make more as 380000000 Keys in 30 minutes...
I'll keep working on it... I'm sure there's more to come^^

Code:

import random
import secp256k1 as ice
from time import sleep
from threading import Thread
from multiprocessing import Value

print('\n            ========== ==========! PUBKEY HUNTER !========== ==========      \n\n')
print(' [*] create privkeys....', end='\r')

list=[]
y=1000000
counter = Value('L')
def process1(counter,number,n):
    ran = random.randrange(0x8000000000000001,0xffffffffffffffff)   
    for i in range(number):
        ran+=i
        pub = ice.privatekey_to_h160(0, True, ran).hex()
        PubKey = pub
        list.append(PubKey)
        if len(list)==y:
            for line in (list):
                line!='\n'
                with counter.get_lock():
                    counter.value += y
                
                if '3ee4133d991f52fdf6a25c9834e0745ac74248a4' in line:
                    f=open("16j.txt","a")
                    f.write(str(line) + "-" + (hex(ran)) + "\n")
                    f.close()
                    wait = input("Press Enter to Exit.")
                    sleep(1)
                    exit()
                    
                if (counter.value)%y == 0:
                    print(' [+] Recent PubKey: ', str(line), ' | Total:', str(counter.value), end='\r')
                    list.clear()
                    

while True:
    number = y
    threads = []
    for n in range(0,4):
        t = Thread(target=process1, args=(counter,number,n))
        threads.append(t)
        t.start()

    for t in threads:
        t.join()

ok i take it back, I won't go into that anymore there are only 2 options 64 address has total epic fail hex or in this range is not at all happy hunting