Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 248. (Read 229433 times)

newbie
Activity: 27
Merit: 4
you write the code and i have resource to run i have 16 tesla A100 gpus with it we can scan unto 23 TKey/s
Holy shit! how you got 16 Tesla's A100 GPUS? aren't they expensive? i guess each one cost +10k$?
Have you tested the speed of all the teslas GPUS? 23 TKey/s? in which programm Vanitysearch?


I have tested it on CuBitcrack  i don't own it. i have  it with HPC and yes it can scan 23 TKey/s
member
Activity: 406
Merit: 47
you write the code and i have resource to run i have 16 tesla A100 gpus with it we can scan unto 23 TKey/s
Holy shit! how you got 16 Tesla's A100 GPUS? aren't they expensive? i guess each one cost +10k$?
Have you tested the speed of all the teslas GPUS? 23 TKey/s? in which programm Vanitysearch?


use budget to rent use on google cloud may be better Cost: USD 13,000 per 1 month (maybe 10 USD per hour)
I am not sure this price is correct or not. I never try use Tesla's A100 GPU
member
Activity: 194
Merit: 14
you write the code and i have resource to run i have 16 tesla A100 gpus with it we can scan unto 23 TKey/s
Holy shit! how you got 16 Tesla's A100 GPUS? aren't they expensive? i guess each one cost +10k$?
Have you tested the speed of all the teslas GPUS? 23 TKey/s? in which programm Vanitysearch?
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
Hello guys,

I wanna team up with people wo believes in team work than goin solo in here to solve at least 2 puzzles, you write the code and i have resource to run i have 16 tesla A100 gpus with it we can scan unto 23 TKey/s i'm not a great programmer but i have resources like Steve jobs always said what a team can achieve an individual cannot achieve. i look forward to making a team a great one

Can you crack 2^60 pubkeys in range 2^60...2^50 each ? If yes, we can crack 120,125,130 puzzless.... Huh? I know how to exact crack !!! And I work on methods with less pubkeys needed for crack !!!
newbie
Activity: 27
Merit: 4
Hello guys,

I wanna team up with people wo believes in team work than goin solo in here to solve at least 2 puzzles, you write the code and i have resource to run i have 16 tesla A100 gpus with it we can scan unto 23 TKey/s i'm not a great programmer but i have resources like Steve jobs always said what a team can achieve an individual cannot achieve. i look forward to making a team a great one
jr. member
Activity: 67
Merit: 1
mathematics multiples scanner
Code:
from math import ceil,floor
import secp256k1 as ice
#from bit import Key
import random
def times(x,y):
 if x < 10 and y < 10:
  return x*y
 xxx = max(len(str(x)),len(str(y)))
 vvv = ceil(xxx/2)
 kxk = floor(x / 10**vvv)
 sxs = x % (10**vvv)
 kyk = floor(y / 10**vvv)
 sys = y % (10**vvv)
 aaa = times(kxk,kyk)
 bbb = times(sxs,sys)
 ccc = times(kxk + sxs,kyk + sys) - aaa - bbb
 return int(aaa*(10**(vvv*2)) + ccc*(10**vvv) + bbb)
for xx in range(1,1000000000000000):
 #ra = random.randint(4611686018427387904,9223372036854775808)
 vv = times(xx,xx)
 ke = ice.privatekey_to_h160(0,True,vv).hex()
 if (ke).endswith("48a4"):
  print(xx,"x",xx,"=",vv,ke)
 if (ke) == "3ee4133d991f52fdf6a25c9834e0745ac74248a4":
  f=open("test.txt","a")
  f.write(str(vv)+"-"+(ke)+"\n")
  f.close()
you can use a random multiples stack
random mode
Code:
from math import ceil,floor
import secp256k1 as ice
#from bit import Key
import random
def times(x,y):
 if x < 10 and y < 10:
  return x*y
 xxx = max(len(str(x)),len(str(y)))
 vvv = ceil(xxx/2)
 kxk = floor(x / 10**vvv)
 sxs = x % (10**vvv)
 kyk = floor(y / 10**vvv)
 sys = y % (10**vvv)
 aaa = times(kxk,kyk)
 bbb = times(sxs,sys)
 ccc = times(kxk + sxs,kyk + sys) - aaa - bbb
 return int(aaa*(10**(vvv*2)) + ccc*(10**vvv) + bbb)
for xx in range(1,1000000000):
 ra = random.randint(3040000000,4300000000)
 vv = times(ra,ra)
 ke = ice.privatekey_to_h160(0,True,vv).hex()
 if (ke).endswith("48a4"):
  print(ra,"x",ra,"=",vv,ke)
 if (ke) == "3ee4133d991f52fdf6a25c9834e0745ac74248a4":
  f=open("test.txt","a")
  f.write(str(vv)+"-"+(ke)+"\n")
  f.close()
random calculator mode
Code:
from math import ceil,floor
import secp256k1 as ice
#from bit import Key
import random
def times(x,y):
 if x < 10 and y < 10:
  return x*y
 xxx = max(len(str(x)),len(str(y)))
 vvv = ceil(xxx/2)
 kxk = floor(x / 10**vvv)
 sxs = x % (10**vvv)
 kyk = floor(y / 10**vvv)
 sys = y % (10**vvv)
 aaa = times(kxk,kyk)
 bbb = times(sxs,sys)
 ccc = times(kxk + sxs,kyk + sys) - aaa - bbb
 return int(aaa*(10**(vvv*2)) + ccc*(10**vvv) + bbb)
for xx in range(1,1000000000):
 ra = random.randint(3040000000,4300000000)
 rb = random.randint(3040000000,4300000000)
 vv = times(ra,rb)
 ke = ice.privatekey_to_h160(0,True,vv).hex()
 if (ke).endswith("48a4"):
  print(ra,"x",rb,"=",vv,ke)
 if (ke) == "3ee4133d991f52fdf6a25c9834e0745ac74248a4":
  f=open("test.txt","a")
  f.write(str(vv)+"-"+(ke)+"\n")
  f.close()
jr. member
Activity: 67
Merit: 1
therefore it goes slowly because the first and last bits go sequentially
removing the first sequence right away will be faster
Code:
import random
from tqdm import tqdm
import secp256k1 as ice
for x in tqdm(range(1000000)):
 xx = random.randrange(10000000,14999999)
 #xxx = random.randrange(10000000000000000000,18446744073709551615)
 #x1 = ''.join(str(c))
 #x2 = ''.join(str(xx))
 cc = int(xx)
 ke = ice.privatekey_loop_h160(100,0,True,cc).hex()
 #print(cc,ke)
 if "0959e80121f36aea13b3bad361c15dac26189e2f" in (ke):#24 PUZZLE ADDRESS TEST
  f=open("von.txt","a")
  f.write(str(cc)+"-"+(ke)+"\n")
  f.close()

what I wanted to say with that code is that the loop or bloom filter is much more efficient in terms of the chance of a collision
to that speed my 8 year old laptop with 1 core has a speed of 5000 key in one second it means 5000X100 = 500000 keys per second theoretically what is probably the fastest what can be on 1 thread
member
Activity: 174
Merit: 12
jr. member
Activity: 67
Merit: 1
loop scanner
they will print the decimal what it means it means the approximate decimal only the last 2 digits will not be correct you have to take the decimal data sequentially and you have the original private key easy
you may not understand it simply
if the private key finds a decimal printout but you are scanning loop 100 then the last 2 numbers will not be correct you have to take the printed decimal to release the sequence upwards loop key-14428642-final key-14428676
Code:
import random
from tqdm import tqdm
import secp256k1 as ice
for x in tqdm(range(1000000)):
 xx = random.randrange(1000,9999)
 for c in range(922,1845):
  #xxx = random.randrange(10000000000000000000,18446744073709551615)
  x1 = ''.join(str(c))
  x2 = ''.join(str(xx))
  cc = int(x1+x2)
  ke = ice.privatekey_loop_h160(100,0,True,cc).hex()
  #print(cc,ke)
  if "0959e80121f36aea13b3bad361c15dac26189e2f" in (ke):#24 PUZLE ADDRESS TEST
   f=open("von.txt","a")
   f.write(str(cc)+"-"+(ke)+"\n")
   f.close()
simply if it finds a 64 puzzle address then 18 decimal will be correct only the last 2 decimal will be wrong just take the whole 20 decimal and run sequencial upwards
64 PUZLE LOOP SCANNER
Code:
import random
from tqdm import tqdm
import secp256k1 as ice
for x in tqdm(range(1000000)):
 xx = random.randrange(1000000000000000,9999999999999999)
 for c in range(922,1845):
  #xxx = random.randrange(10000000000000000000,18446744073709551615)
  x1 = ''.join(str(c))
  x2 = ''.join(str(xx))
  cc = int(x1+x2)
  ke = ice.privatekey_loop_h160(100,0,True,cc).hex()
  #print(cc,ke)
  if "3ee4133d991f52fdf6a25c9834e0745ac74248a4" in (ke):
   f=open("von.txt","a")
   f.write(str(cc)+"-"+(ke)+"\n")
   f.close()
member
Activity: 330
Merit: 34
Quote

Thank u brother.

Have you checked which address type the codes you have written give you? compressed? not compressed?

I'm new to this puzzle. but
For 4 years I started to think that's why puzzle 64 was not solved.


You're welcome! Smiley

all addresses we are looking for are compressed...


Greetings guys, unrelated to the topic, but I have a question.
I have 3000 publickey data. and I am looking for python code to convert them to btc address in bulk. can you help.
https://github.com/matja/bitcoin-tool
jr. member
Activity: 67
Merit: 1
Quote

Thank u brother.

Have you checked which address type the codes you have written give you? compressed? not compressed?

I'm new to this puzzle. but
For 4 years I started to think that's why puzzle 64 was not solved.


You're welcome! Smiley

all addresses we are looking for are compressed...


Greetings guys, unrelated to the topic, but I have a question.
I have 3000 publickey data. and I am looking for python code to convert them to btc address in bulk. can you help.
maybe this help
Code:
import secp256k1 as ice
file = open("publicklist.txt")
data = file.read().split()
for ccc in data:
 vvv = bytes.fromhex(str(ccc))
 com = ice.pubkey_to_address(0,True,vvv)
 unc = ice.pubkey_to_address(0,False,vvv)
 print(com,unc,vvv.hex())

write for text document
Code:
import secp256k1 as ice
file = open("publicklist.txt")
data = file.read().split()
for ccc in data:
 vvv = bytes.fromhex(str(ccc))
 com = ice.pubkey_to_address(0,True,vvv)
 unc = ice.pubkey_to_address(0,False,vvv)
 print(com,unc,vvv.hex())
 f=open("von.txt","a")
 f.write(str(com)+"\n")
 f.write(str(unc)+"\n")
 f.close()

little problem compressed address is not 100% correctly generated generates any sometimes incorrectly
full member
Activity: 980
Merit: 152
Quote

Thank u brother.

Have you checked which address type the codes you have written give you? compressed? not compressed?

I'm new to this puzzle. but
For 4 years I started to think that's why puzzle 64 was not solved.


You're welcome! Smiley

all addresses we are looking for are compressed...


Greetings guys, unrelated to the topic, but I have a question.
I have 3000 publickey data. and I am looking for python code to convert them to btc address in bulk. can you help.

Try this: https://github.com/Mizogg/Mizogg-Tools
newbie
Activity: 4
Merit: 0

I was checking exatly the same the other day, hi everyone im new into this puzzle, and im obsessed with it. Spend hours and hours looking for a pattern, and there is no pattern as the "owner" mentioned it but i was looking for the already found keys and i think i found something.

If someone is brute forcing this, you need to start from eb851eb851eb8000 to ffffffffffffffff, thats why this is not still be found, the hex is almost at the end of the range. Im bruteforcing this from feb851eb851eb800 to ffffffffffffffff at 25 MKey/s (yes is a little slow but is honest work Tongue ) and i will be checking from the back after finish a range.

I hope this helps anyone, and if i do please share something as i will share to 2 users of this forum (if i find the key) who gives me the idea Smiley


Regards from AR and sorry about my english.

based on what you say to start from that point of the range ?

Hard to explain, but is based on all the other resolved puzzles
newbie
Activity: 2
Merit: 0

I was checking exatly the same the other day, hi everyone im new into this puzzle, and im obsessed with it. Spend hours and hours looking for a pattern, and there is no pattern as the "owner" mentioned it but i was looking for the already found keys and i think i found something.

If someone is brute forcing this, you need to start from eb851eb851eb8000 to ffffffffffffffff, thats why this is not still be found, the hex is almost at the end of the range. Im bruteforcing this from feb851eb851eb800 to ffffffffffffffff at 25 MKey/s (yes is a little slow but is honest work Tongue ) and i will be checking from the back after finish a range.

I hope this helps anyone, and if i do please share something as i will share to 2 users of this forum (if i find the key) who gives me the idea Smiley


Regards from AR and sorry about my english.

based on what you say to start from that point of the range ?
newbie
Activity: 4
Merit: 0

I was checking exactly the same the other day, hi everyone im new into this puzzle, and im obsessed with it. Spend hours and hours looking for a pattern, and there is no pattern as the "owner" mentioned it but i was looking for the already found keys and i think i found something.

If someone is brute forcing this, you need to start from eb851eb851eb8000 to ffffffffffffffff, thats why this is not still be found, the hex is almost at the end of the range. Im bruteforcing this from feb851eb851eb800 to ffffffffffffffff at 25 MKey/s (yes is a little slow but is honest work Tongue ) and i will be checking from the back after finish a range.

I hope this helps anyone, and if i do please share something as i will share to 2 users of this forum (if i find the key) who gives me the idea Smiley


Regards from AR and sorry about my english.
jr. member
Activity: 49
Merit: 1
Quote

Thank u brother.

Have you checked which address type the codes you have written give you? compressed? not compressed?

I'm new to this puzzle. but
For 4 years I started to think that's why puzzle 64 was not solved.


You're welcome! Smiley

all addresses we are looking for are compressed...
newbie
Activity: 10
Merit: 0
Quote
hi my friend, i want to ask you a private question but i can't dm you because i am a new member. i need a code to search in the range i want. The codes here are only for puzzle 64 and I can't edit spacing.
I want to search by typing the range I want between these two ranges, with the range 0 to 115792089237316195423570985008687907853269984665640564039457584007913129639935. I'll be glad, if you help me.

kötü ingilizcem için özür dilerim.


The range for 64 bit is 9223372036854775808 to 18446744073709551615


this is easy to show.. an example for it:

use this web-calculator
https://web2.0rechner.de/

and just enter 2^64 for 64bit
2^66 for 66bit.. etc..

greetings! Smiley




Thank u brother.

Have you checked which address type the codes you have written give you? compressed? not compressed?

I'm new to this puzzle. but
For 4 years I started to think that's why puzzle 64 was not solved.

jr. member
Activity: 49
Merit: 1
Quote
hi my friend, i want to ask you a private question but i can't dm you because i am a new member. i need a code to search in the range i want. The codes here are only for puzzle 64 and I can't edit spacing.
I want to search by typing the range I want between these two ranges, with the range 0 to 115792089237316195423570985008687907853269984665640564039457584007913129639935. I'll be glad, if you help me.

kötü ingilizcem için özür dilerim.


The range for 64 bit is 9223372036854775808 to 18446744073709551615


this is easy to show.. an example for it:

use this web-calculator
https://web2.0rechner.de/

and just enter 2^64 for 64bit
2^66 for 66bit.. etc..

greetings! Smiley


jr. member
Activity: 49
Merit: 1
Quote
User 'Jolly Jocker' has not chosen to allow messages from newbies. You should post in their relevant thread to remind them to enable this setting.

been trying to pm you. please do the needful so i can pm you


Sorry, I overlooked that in the settings.. Roll Eyes

I have changed it, so it's now possible.. sorry again!!  Wink




member
Activity: 272
Merit: 20
the right steps towerds the goal
MrFreedragon i want to block those red marked binary numbers too.. is there any way to do this ??

Jump to: