paniker
Newbie
Offline
Activity: 49
Merit: 0
|
|
September 11, 2019, 11:21:57 AM |
|
can anyony told me how to use --continue to save a result of scan private and addr? or mb show a command?
|
|
|
|
Darmont33
Newbie
Offline
Activity: 18
Merit: 0
|
|
September 11, 2019, 03:44:27 PM |
|
can anyony told me how to use --continue to save a result of scan private and addr? or mb show a command?
use first time - xxBitCrack -c -u -i target.txt -o finish.txt --keyspace 1:FFFFFFFFFFF -continue step.txt and after - xxBitCrack -c -u -i target.txt -o finish.txt -continue step.txt How do u guys convert hex to wif? offline?
|
|
|
|
paniker
Newbie
Offline
Activity: 49
Merit: 0
|
|
September 11, 2019, 04:11:46 PM |
|
can anyony told me how to use --continue to save a result of scan private and addr? or mb show a command?
use first time - xxBitCrack -c -u -i target.txt -o finish.txt --keyspace 1:FFFFFFFFFFF -continue step.txt and after - xxBitCrack -c -u -i target.txt -o finish.txt -continue step.txt How do u guys convert hex to wif? offline? -target.txt - this is must be? -continue step.txt - wtf this? thanks
|
|
|
|
vimp666
Jr. Member
Offline
Activity: 37
Merit: 1
|
|
September 11, 2019, 04:32:59 PM |
|
can anyony told me how to use --continue to save a result of scan private and addr? or mb show a command?
use first time - xxBitCrack -c -u -i target.txt -o finish.txt --keyspace 1:FFFFFFFFFFF -continue step.txt and after - xxBitCrack -c -u -i target.txt -o finish.txt -continue step.txt How do u guys convert hex to wif? offline? -target.txt - this is must be? -continue step.txt - wtf this? thanks -i target.txt(-i IN)*(target.txt)a text file with your addresses, you can name it whatever you like. -continue step.txt(also can name whatever) here the program will record your progress and after restarting it will start from the place where it stopped.-continue does not work if the -r(random) flag is enabled.
|
|
|
|
paniker
Newbie
Offline
Activity: 49
Merit: 0
|
|
September 11, 2019, 04:34:34 PM |
|
can anyony told me how to use --continue to save a result of scan private and addr? or mb show a command?
use first time - xxBitCrack -c -u -i target.txt -o finish.txt --keyspace 1:FFFFFFFFFFF -continue step.txt and after - xxBitCrack -c -u -i target.txt -o finish.txt -continue step.txt How do u guys convert hex to wif? offline? -target.txt - this is must be? -continue step.txt - wtf this? thanks -i target.txt(-i IN)*(target.txt)a text file with your addresses, you can name it whatever you like. -continue step.txt(also can name whatever) here the program will record your progress and after restarting it will start from the place where it stopped.-continue does not work if the -r(random) flag is enabled. Great! Thanks, go test it
|
|
|
|
|
Darmont33
Newbie
Offline
Activity: 18
Merit: 0
|
|
September 11, 2019, 06:08:11 PM |
|
can anyony told me how to use --continue to save a result of scan private and addr? or mb show a command?
use first time - xxBitCrack -c -u -i target.txt -o finish.txt --keyspace 1:FFFFFFFFFFF -continue step.txt and after - xxBitCrack -c -u -i target.txt -o finish.txt -continue step.txt How do u guys convert hex to wif? offline? download one of two or both and convert offline. click on the bitaddress.org.html,index.html in the folder and here’s your offline local site. https://github.com/pointbiz/bitaddress.org click-Wallet Details https://github.com/brainwalletX/brainwalletX.github.io click-converter Thanks for answering, but I already downloaded them. But I just can’t understand how I can do this from 0x01 this is KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU73sVHnoWn hmmmm brainwallet Converter-> HEX to B58Check 000000000000000000000000000000000000000000000000000000000000000101 to KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU73sVHnoWn cool! thx! naively, I thought I could only use "1". About "0" did not think at all Habit from here http://gobittest.appspot.com/VanityAll But something I’m scared to enter "good" data here
|
|
|
|
Raj Lassi
Newbie
Offline
Activity: 17
Merit: 1
|
|
September 11, 2019, 10:36:24 PM |
|
can anyony told me how to use --continue to save a result of scan private and addr? or mb show a command?
use first time - xxBitCrack -c -u -i target.txt -o finish.txt --keyspace 1:FFFFFFFFFFF -continue step.txt and after - xxBitCrack -c -u -i target.txt -o finish.txt -continue step.txt How do u guys convert hex to wif? offline? this converts lots of stuff. save and run offline. https://www.mobilefish.com/services/cryptocurrency/cryptocurrency.html
|
|
|
|
D3XTR
Newbie
Offline
Activity: 4
Merit: 0
|
|
September 12, 2019, 08:29:45 PM |
|
Hey ! I'm getting this error. I got a video card Gefore GTX 760, any clue why this is happening? I tried to change from default 30 ,to 60, to 50, to 90 and nothing is working out. What am I doing wrong?? https://imgur.com/x4Wj4j4
|
|
|
|
bulleteyedk
Jr. Member
Offline
Activity: 85
Merit: 1
|
|
September 12, 2019, 09:22:39 PM |
|
try running cudaInfo.exe at first... you need to identify your ID of that GTX 660 card, which you will have to use as parameter with cuBitCrack.exe --device xx
make sure you also have Nvidia CUDA 9.xx or 10.xx installed according to what version of BitCrack you are running
|
|
|
|
D3XTR
Newbie
Offline
Activity: 4
Merit: 0
|
|
September 13, 2019, 12:23:24 AM |
|
Nothing changed. I keep still having the same issue
|
|
|
|
D3XTR
Newbie
Offline
Activity: 4
Merit: 0
|
|
September 13, 2019, 02:43:47 PM |
|
The Cuda version is 10.1. When I used Cuda 9.0 the BitCrack was not being able to launch, and I don't know how to change the script itself to use other Cuda version + on Github it's written that you need Cuda 10.1 and Visual Studio ? Or anyway to resolve this
|
|
|
|
paniker
Newbie
Offline
Activity: 49
Merit: 0
|
|
September 16, 2019, 07:13:39 AM |
|
-o, --out FILE Append private keys to FILE, one per line
can bitcrack save adresses in file or only private keys?
|
|
|
|
vimp666
Jr. Member
Offline
Activity: 37
Merit: 1
|
|
September 16, 2019, 09:27:06 AM Last edit: September 16, 2019, 09:46:34 AM by vimp666 |
|
-o, --out FILE Append private keys to FILE, one per line
can bitcrack save adresses in file or only private keys?
to this file bitcrack record found addresses with keys.one per line.can also be called as you want -o 1out.txt, -o myrich.txt ,etc.
|
|
|
|
paniker
Newbie
Offline
Activity: 49
Merit: 0
|
|
September 16, 2019, 10:04:06 AM |
|
-o, --out FILE Append private keys to FILE, one per line
can bitcrack save adresses in file or only private keys?
to this file bitcrack record found addresses with keys.one per line.can also be called as you want -o 1out.txt, -o myrich.txt ,etc. try to use this function, but don't see files that bitcrack record, where is it saves, in bin??
|
|
|
|
vimp666
Jr. Member
Offline
Activity: 37
Merit: 1
|
|
September 16, 2019, 10:34:04 AM |
|
-o, --out FILE Append private keys to FILE, one per line
can bitcrack save adresses in file or only private keys?
to this file bitcrack record found addresses with keys.one per line.can also be called as you want -o 1out.txt, -o myrich.txt ,etc. try to use this function, but don't see files that bitcrack record, where is it saves, in bin?? in windows it saves in the same folder where the bitcrack is located. the file is created as soon as at least 1 key is found.
|
|
|
|
paniker
Newbie
Offline
Activity: 49
Merit: 0
|
|
September 16, 2019, 10:56:34 AM |
|
-o, --out FILE Append private keys to FILE, one per line
can bitcrack save adresses in file or only private keys?
to this file bitcrack record found addresses with keys.one per line.can also be called as you want -o 1out.txt, -o myrich.txt ,etc. try to use this function, but don't see files that bitcrack record, where is it saves, in bin?? in windows it saves in the same folder where the bitcrack is located. the file is created as soon as at least 1 key is found. maybe i sad wrong, i need all keys and adresses which bitcrack goes to save
|
|
|
|
MrFreeDragon
|
|
September 16, 2019, 12:54:41 PM |
|
maybe i sad wrong, i need all keys and adresses which bitcrack goes to save
No, bitcrack saves only the address to the found private key. It does not save all the generating keys. But the code is opensource, you can add the file saving to the code and make the compilation. What is your reason to save all the generated keys and addresses?
|
|
|
|
racminer
Member
Offline
Activity: 245
Merit: 17
|
|
September 16, 2019, 03:44:47 PM |
|
Here is the code with my changes import time import random import gmpy2 import math import sys
modulo = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F order = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 Gx = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798 Gy = 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
class Point: def __init__(self, x=0, y=0): self.x = x self.y = y
PG = Point(Gx,Gy) Z = Point(0,0) # zero-point, infinite in real x,y - plane
# return (g, x, y) a*x + b*y = gcd(x, y) def egcd(a, b): if a == 0: return (b, 0, 1) else: g, x, y = egcd(b % a, a) return (g, y - (b // a) * x, x)
def rev(b, n = modulo): while b < 0: b += modulo g, x, _ = egcd(b, n) if g == 1: return x % n def mul2(P, p = modulo): R = Point() # c = 3*P.x*P.x*rev(2*P.y, p) % p c = 3*P.x*P.x*gmpy2.invert(2*P.y, p) % p R.x = (c*c-2*P.x) % p R.y = (c*(P.x - R.x)-P.y) % p return R
def add(P, Q, p = modulo): R = Point() dx = Q.x - P.x dy = Q.y - P.y c = dy * gmpy2.invert(dx, p) % p #c = dy * rev(dx, p) % p R.x = (c*c - P.x - Q.x) % p R.y = (c*(P.x - R.x) - P.y) % p return R # 6 sub, 3 mul, 1 inv
def mulk(k, P = PG, p = modulo): if k == 0: return Z elif k == 1: return P elif (k % 2 == 0): return mulk(k/2, mul2(P, p), p) else: return add(P, mulk( (k-1)/2, mul2(P, p), p), p)
def X2Y(X, p = modulo): if p % 4 != 3: print ('prime must be 3 modulo 4') return 0 X = (X**3+7)%p pw = (p + 1) // 4 Y = 1 for w in range(256): if (pw >> w) & 1 == 1: tmp = X for k in range(w): tmp = (tmp**2)%p Y *= tmp Y %= p return Y
def comparator(): A, Ak, B, Bk = [], [], [], [] with open('tame.txt') as f: for line in f: L = line.split() a = int(L[0],16) b = int(L[1],16) A.append(a) Ak.append(b) with open('wild.txt') as f: for line in f: L = line.split() a = int(L[0],16) b = int(L[1],16) B.append(a) Bk.append(b) result = list(set(A) & set(B)) if len(result) > 0: sol_kt = A.index(result[0]) sol_kw = B.index(result[0]) print ('total time: %.2f sec' % (time.time()-starttime)) d = Ak[sol_kt] - Bk[sol_kw] print ('SOLVED: %64X' % d + '\n') file = open("results.txt",'a') file.write(('%X'%(Ak[sol_kt] - Bk[sol_kw])) + "\n") file.write("---------------\n") file.close() return True else: return False
def check(P, Pindex, DP_rarity, file2save): if P.x % (DP_rarity) == 0: file = open(file2save,'a') file.write(('%064X %064X'%(P.x,Pindex)) + "\n") file.close() return comparator() else: return False P = [PG] for k in range(255): P.append(mul2(P[k])) print ('P-table prepared')
def search(a,b): global solved s=(a+b)>>1 d=(b-a) problem=int(math.log(d,2)) # print(a,b,s,d,'\n') DP_rarity = 1 << ((problem - 2*kangoo_power)//2 - 2) hop_modulo = ((problem-1)// 2) + kangoo_power T, t, dt = [], [], [] W, w, dw = [], [], [] for k in range(Nt): qtf= s qtr= random.randint(1,d) # print('tame\n',qtf,qtr) qt=qtf+qtr t.append(qt) T.append(mulk(t[k])) dt.append(0) for k in range(Nw): qw=(random.randint(1, d)) # print('wild\n',qw) w.append(qw) W.append(add(W0,mulk(w[k]))) dw.append(0) print ('tame and wild herds are prepared') oldtime = time.time() starttime = oldtime Hops, Hops_old = 0, 0 t0 = time.time() oldtime = time.time() starttime = oldtime while (1): for k in range(Nt): Hops += 1 pw = T[k].x % hop_modulo dt[k] = 1 << pw solved = check(T[k], t[k], DP_rarity, "tame.txt") if solved: break t[k] += dt[k] T[k] = add(P[pw], T[k]) if solved: break for k in range(Nw): Hops += 1 pw = W[k].x % hop_modulo dw[k] = 1 << pw solved = check(W[k], w[k], DP_rarity, "wild.txt") if solved: break w[k] += dw[k] W[k] = add(P[pw], W[k]) if solved: break t1 = time.time() if (t1-t0) > 5: print ('%.3f h/s'%((Hops-Hops_old)/(t1-t0))) t0 = t1 Hops_old = Hops hops_list.append(Hops) print ('Hops:', Hops) return 'sol. time: %.2f sec' % (time.time()-starttime)
s=sys.argv[1] sa = sys.argv[2] sb = sys.argv[3] sk = sys.argv[4] a = int(sa, 16) b = int(sb, 16) kangoo_power = int(sk, 10) Nt = Nw = 2**kangoo_power X = int(s, 16) Y = X2Y(X % (2**256)) if Y % 2 != (X >> 256) % 2: Y = modulo - Y X = X % (2**256) W0 = Point(X,Y) starttime = oldtime = time.time() Hops = 0 random.seed()
hops_list = []
solved = False open("tame.txt",'w').close() open("wild.txt",'w').close() search(a,b)
Example (case 32) python kang.py 0387dc70db1806cd9a9a76637412ec11dd998be666584849b3185f7f9313c8fd28 80000000 FFFFFFFF 3 (the last number 3 is the kangooro_power) P-table prepared tame and wild herds are prepared total time: 0.21 sec SOLVED: 7D4FE747 ('Hops:', 23072) python 2.py 03d2063d40402f030d4cc71331468827aa41a8a09bd6fd801ba77fb64f8e67e617 0xaf55fc59c335c8e0000000000 0xaf55fc59c335c8f0000000000 3 P-table prepared tame and wild herds are prepared 220012.055 h/s 229034.780 h/s total time: 11.90 sec SOLVED: AF55FC59C335C8EC67ED24826 ('Hops:', 2691957) Nice I see you reproduce the example I mentioned here https://bitcointalk.org/index.php?topic=5173445.msg52376505#msg52376505(If you are using windows, you might get the wrong answer for case > 60 bit) I've optimized the code. Hopping speed improved about 50% per core. with 4 cores I've reached 850000 h/s. Timing: Case # time (sec) 50 148.46 51 120.88 52 189.33 53 204.99 54 674.51 55 441.58 56 945.33 57 1509.22 58 2685.02 59 2300.80 60 4389.98 61 2958.66 62 7802.91 63 10239.27
|
|
|
|
vimp666
Jr. Member
Offline
Activity: 37
Merit: 1
|
|
September 16, 2019, 04:16:12 PM |
|
Here is the code with my changes import time import random import gmpy2 import math import sys
modulo = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F order = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 Gx = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798 Gy = 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
class Point: def __init__(self, x=0, y=0): self.x = x self.y = y
PG = Point(Gx,Gy) Z = Point(0,0) # zero-point, infinite in real x,y - plane
# return (g, x, y) a*x + b*y = gcd(x, y) def egcd(a, b): if a == 0: return (b, 0, 1) else: g, x, y = egcd(b % a, a) return (g, y - (b // a) * x, x)
def rev(b, n = modulo): while b < 0: b += modulo g, x, _ = egcd(b, n) if g == 1: return x % n def mul2(P, p = modulo): R = Point() # c = 3*P.x*P.x*rev(2*P.y, p) % p c = 3*P.x*P.x*gmpy2.invert(2*P.y, p) % p R.x = (c*c-2*P.x) % p R.y = (c*(P.x - R.x)-P.y) % p return R
def add(P, Q, p = modulo): R = Point() dx = Q.x - P.x dy = Q.y - P.y c = dy * gmpy2.invert(dx, p) % p #c = dy * rev(dx, p) % p R.x = (c*c - P.x - Q.x) % p R.y = (c*(P.x - R.x) - P.y) % p return R # 6 sub, 3 mul, 1 inv
def mulk(k, P = PG, p = modulo): if k == 0: return Z elif k == 1: return P elif (k % 2 == 0): return mulk(k/2, mul2(P, p), p) else: return add(P, mulk( (k-1)/2, mul2(P, p), p), p)
def X2Y(X, p = modulo): if p % 4 != 3: print ('prime must be 3 modulo 4') return 0 X = (X**3+7)%p pw = (p + 1) // 4 Y = 1 for w in range(256): if (pw >> w) & 1 == 1: tmp = X for k in range(w): tmp = (tmp**2)%p Y *= tmp Y %= p return Y
def comparator(): A, Ak, B, Bk = [], [], [], [] with open('tame.txt') as f: for line in f: L = line.split() a = int(L[0],16) b = int(L[1],16) A.append(a) Ak.append(b) with open('wild.txt') as f: for line in f: L = line.split() a = int(L[0],16) b = int(L[1],16) B.append(a) Bk.append(b) result = list(set(A) & set(B)) if len(result) > 0: sol_kt = A.index(result[0]) sol_kw = B.index(result[0]) print ('total time: %.2f sec' % (time.time()-starttime)) d = Ak[sol_kt] - Bk[sol_kw] print ('SOLVED: %64X' % d + '\n') file = open("results.txt",'a') file.write(('%X'%(Ak[sol_kt] - Bk[sol_kw])) + "\n") file.write("---------------\n") file.close() return True else: return False
def check(P, Pindex, DP_rarity, file2save): if P.x % (DP_rarity) == 0: file = open(file2save,'a') file.write(('%064X %064X'%(P.x,Pindex)) + "\n") file.close() return comparator() else: return False P = [PG] for k in range(255): P.append(mul2(P[k])) print ('P-table prepared')
def search(a,b): global solved s=(a+b)>>1 d=(b-a) problem=int(math.log(d,2)) # print(a,b,s,d,'\n') DP_rarity = 1 << ((problem - 2*kangoo_power)//2 - 2) hop_modulo = ((problem-1)// 2) + kangoo_power T, t, dt = [], [], [] W, w, dw = [], [], [] for k in range(Nt): qtf= s qtr= random.randint(1,d) # print('tame\n',qtf,qtr) qt=qtf+qtr t.append(qt) T.append(mulk(t[k])) dt.append(0) for k in range(Nw): qw=(random.randint(1, d)) # print('wild\n',qw) w.append(qw) W.append(add(W0,mulk(w[k]))) dw.append(0) print ('tame and wild herds are prepared') oldtime = time.time() starttime = oldtime Hops, Hops_old = 0, 0 t0 = time.time() oldtime = time.time() starttime = oldtime while (1): for k in range(Nt): Hops += 1 pw = T[k].x % hop_modulo dt[k] = 1 << pw solved = check(T[k], t[k], DP_rarity, "tame.txt") if solved: break t[k] += dt[k] T[k] = add(P[pw], T[k]) if solved: break for k in range(Nw): Hops += 1 pw = W[k].x % hop_modulo dw[k] = 1 << pw solved = check(W[k], w[k], DP_rarity, "wild.txt") if solved: break w[k] += dw[k] W[k] = add(P[pw], W[k]) if solved: break t1 = time.time() if (t1-t0) > 5: print ('%.3f h/s'%((Hops-Hops_old)/(t1-t0))) t0 = t1 Hops_old = Hops hops_list.append(Hops) print ('Hops:', Hops) return 'sol. time: %.2f sec' % (time.time()-starttime)
s=sys.argv[1] sa = sys.argv[2] sb = sys.argv[3] sk = sys.argv[4] a = int(sa, 16) b = int(sb, 16) kangoo_power = int(sk, 10) Nt = Nw = 2**kangoo_power X = int(s, 16) Y = X2Y(X % (2**256)) if Y % 2 != (X >> 256) % 2: Y = modulo - Y X = X % (2**256) W0 = Point(X,Y) starttime = oldtime = time.time() Hops = 0 random.seed()
hops_list = []
solved = False open("tame.txt",'w').close() open("wild.txt",'w').close() search(a,b)
Example (case 32) python kang.py 0387dc70db1806cd9a9a76637412ec11dd998be666584849b3185f7f9313c8fd28 80000000 FFFFFFFF 3 (the last number 3 is the kangooro_power) P-table prepared tame and wild herds are prepared total time: 0.21 sec SOLVED: 7D4FE747 ('Hops:', 23072) python 2.py 03d2063d40402f030d4cc71331468827aa41a8a09bd6fd801ba77fb64f8e67e617 0xaf55fc59c335c8e0000000000 0xaf55fc59c335c8f0000000000 3 P-table prepared tame and wild herds are prepared 220012.055 h/s 229034.780 h/s total time: 11.90 sec SOLVED: AF55FC59C335C8EC67ED24826 ('Hops:', 2691957) Nice I see you reproduce the example I mentioned here https://bitcointalk.org/index.php?topic=5173445.msg52376505#msg52376505(If you are using windows, you might get the wrong answer for case > 60 bit) I've optimized the code. Hopping speed improved about 50% per core. with 4 cores I've reached 850000 h/s. Timing: Case # time (sec) 50 148.46 51 120.88 52 189.33 53 204.99 54 674.51 55 441.58 56 945.33 57 1509.22 58 2685.02 59 2300.80 60 4389.98 61 2958.66 62 7802.91 63 10239.27
but in your post the old code.
|
|
|
|
|