benchmark~snip~ - GeForce RXT 2080 TI = both = 631.57 MKeys/s
- Tesla V100 = compressed = 603 MKeys/s (with 40k targets) (config)
I am quite surprised that the Tesla V100 has a lower search rate than the 2080 TI considering that the V100 is meant to be a CUDA-optimized compute GPU, even though this isn’t an apples-to-apples comparison because the 2080 Ti was searching for both types of keys. I’ll keep that in mind when I rent GPUs. Is there a ready built version available somewhere? Win 64bit
Yep, here are the Windows binaries for v0.31: https://github.com/brichard19/BitCrack/releases/tag/0.31sorry bro here is card spec Tesla V100S PCIe 32 GB GV100 Nov 26th, 2019 PCIe 3.0 x16 32 GB, HBM2, 4096 bit 1245 MHz 1106 MHz 5120 / 320 / 128 GeForce RTX 2080 Ti TU102 Sep 20th, 2018 PCIe 3.0 x16 11 GB, GDDR6, 352 bit 1350 MHz 1750 MHz 4352 / 272 / 88 you can understand whats difrence, here in bitcrack you need to adjust proper setting for -b -t -p this will tell you what you get highest speed, others are calc speed wrong |
|
|
|
benchmark- GeForce GT 640 = 9.11 MKeys/s
- GeForce GTX 1060 3GB = compressed = 60.61 MKeys/s
- GeForce GTX 1060 3GB = both = 46.93 MKeys/s
- GeForce GTX 1070 = compressed = 109 MKeys/s
- GeForce GTX 1070 = compressed = 85 MKeys/s (with 40k targets)
- GeForce GTX 1070 TI = compressed = 80 MKeys/s (with 87k targets)
- GeForce GTX 1080 TI = compressed = 1030 MKeys/s (with 40k targets)
- GeForce GTX 1080 TI = compressed = 350.28 MKeys/s (-b 224 -t 128 -p 1024)
- GeForce GTX 1080 TI = compressed = 350.28 MKeys/s
- GeForce GTX 2070 TI = compressed = 805 MKeys/s (with 200 targets)
- GeForce RXT 2080 TI = both = 631.57 MKeys/s
- GeForce RXT 2080 XC ULTRA EVGA = both = 174.92 MKeys/s (with 40k targets) -b 42 -t 512 -p 2500
- GeForce GTX 1050 TI = 64 MKeys/s (with 81 targets)
- Tesla K80 = compressed = 39.76 MKeys/s
- Tesla K80 = compressed = 68.21 MKeys/s (config)
- Tesla P100 = compressed = 76 MKeys/s
- Tesla P100 = compressed = 251 MKeys/s (config)
- Tesla V100 = compressed = 174 MKeys/s
- Tesla V100 = compressed = 603 MKeys/s (with 40k targets) (config)
- Tesla V100 = compressed = 715 MKeys/s (with 40k targets) (config = -b 72 -t 512 -p 1024) =
           ./cuBitCrack -b 7 -t 512 -p 1156 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN -o new2020.txt-c --keyspace 8000000000000000:fffffffffffffffe --stride xxxxxxx [2020-11-06.13:53:49] [Info] Compression: compressed [2020-11-06.13:53:49] [Info] Starting at: 0000000000000000000000000000000000000000000000008000000000000000 [2020-11-06.13:53:49] [Info] Ending at: 000000000000000000000000000000000000000000000000FFFFFFFFFFFFFFFE [2020-11-06.13:53:49] [Info] Counting by: 00000000000000000000000000000000000000000000000000000000024C538B [2020-11-06.13:53:49] [Info] Initializing GeForce GTX 460 [2020-11-06.13:53:49] [Info] Generating 4,143,104 starting points (158.0MB) [2020-11-06.13:53:51] [Info] 10.0% [2020-11-06.13:53:52] [Info] 20.0% [2020-11-06.13:53:52] [Info] 30.0% [2020-11-06.13:53:53] [Info] 40.0% [2020-11-06.13:53:53] [Info] 50.0% [2020-11-06.13:53:53] [Info] 60.0% [2020-11-06.13:53:53] [Info] 70.0% [2020-11-06.13:53:53] [Info] 80.0% [2020-11-06.13:53:54] [Info] 90.0% [2020-11-06.13:53:54] [Info] 100.0% [2020-11-06.13:53:54] [Info] Done GeForce GTX 460 408/964MB | 1 target 44.79 MKey/s (239,139,962,880 total) [01:28:55][2020-11-06.15:22:54] [Info] Reached end of keyspace load of 20m addresses for compressed check its take 33.92Mkey/s -b -p -t are too much important for design full speed gpu |
|
|
|
the owner of that wallet was afraid of our topic, today he transferred everything to another address from which the public key is unknown  which one address ? |
|
|
|
Specify the range of keys to search. For example, if you want to search in a specific range of private keys you can specify it in hex or decimal in the format START:END with a specified stride/increment size.
+1 need this function too , with keyspace start: end , with a specified stride/increment size.
like stride 10000:10000, with user define in stride and checkkeys
example user define
check keys 10000
stride keys 10000
this func make Vanitysearch more attractive and chances of probability build up
Can you give an example of the cmd line example ./VanitySearch -t 0 -gpu -i input.txt -o result.txt --keyspace 1:FFFFFFFFFFFFFFFF --stride 500:10000 ./VanitySearch -t 0 -gpu 1LqJ9cHPKxPXDRia4tteTJdLXnisnfHsof -o result.txt --keyspace 1:FFFFFFFFFFFFFFFF --stride 500:10000 check keys 500 bypass/stride 10000 ./VanitySearch -t 0 -gpu -i input.txt -o result.txt --keyspace 1:FFFFFFFFFFFFFFFF --stride 10000 --check 500 ./VanitySearch -t 0 -gpu 1LqJ9cHPKxPXDRia4tteTJdLXnisnfHsof -o result.txt --keyspace 1:FFFFFFFFFFFFFFFF --stride 10000 --check 500 |
|
|
|
|
Specify the range of keys to search. For example, if you want to search in a specific range of private keys you can specify it in hex or decimal in the format START:END with a specified stride/increment size.
+1 need this function too , with keyspace start: end , with a specified stride/increment size.
like stride 10000:10000, with user define in stride and checkkeys
example user define
check keys 10000
stride keys 10000
this func make Vanitysearch more attractive and chances of probability build up
|
|
|
|
|
hello all
still no news from zeiler and Jluc, long time silent, can they confirm, what % work left from there side, and any new development, we little discus about point multiplication at gpu powered, still no comment and concern shown by Jluc and other developer, can we hear some news about level of finding puzzle 120bit
|
|
|
|
Thanks brainless
The reason I chose Jean_Luc's project
it can run its own uint_64 (own integer class) with GPU, I'm trying to understand this issue.
Source code includes AddDircet, DoubleDirect and ComputePublicKey (G * int). But EccMultipy (Point x int) does not exist.
I was just in the beginning, I guess this is not the right place to discuss. But even if I only use CPU it is much faster than python. I don't know if it is with a GPU.
I'm not sure what I'm learning, I am not aware of C or C ++ right now, for now (:
" ComputePublicKey (G * int) (G * int). But EccMultipy (Point x int) does not exist. " G = point G * int = its eccmultiply (Point x int) only developer need to design as per above command for easy input/output at gpu work, let see who design it for community JLuc code Pubkey = ComputePublicKey (int); (G in this funciton, and G has some hash algroithm) brainless Is it possible to control -2**35 to 2**35 point operation in 3 seconds on CPU? few sec on gpu so I want to test a GPU-powered ECC operation with the GPU running at full performance. I have a few studies that I have tested with Sage, I'm looking for a library that works with GPU where I can create functions and loops it in C or C ++. Thanks for your interest brainless you need to wait, for Jluc , maybe he come with some free time and mood, to create repo for community, where like above command for point multiplication at GPU btw all community members read our chats, but they know best gpu developer and understand technology is Jluc and all will wait for his reply regading this subject, Bitcrack developer brichard also can develop GPU based Point multiplication, but i feel he is no more interested for community to help due to some reason |
|
|
|
Thanks brainless
The reason I chose Jean_Luc's project
it can run its own uint_64 (own integer class) with GPU, I'm trying to understand this issue.
Source code includes AddDircet, DoubleDirect and ComputePublicKey (G * int). But EccMultipy (Point x int) does not exist.
I was just in the beginning, I guess this is not the right place to discuss. But even if I only use CPU it is much faster than python. I don't know if it is with a GPU.
I'm not sure what I'm learning, I am not aware of C or C ++ right now, for now (:
" ComputePublicKey (G * int) (G * int). But EccMultipy (Point x int) does not exist. " G = point G * int = its eccmultiply (Point x int) only developer need to design as per above command for easy input/output at gpu work, let see who design it for community JLuc code Pubkey = ComputePublicKey (int); (G in this funciton, and G has some hash algroithm) brainless Is it possible to control -2**35 to 2**35 point operation in 3 seconds on CPU? few sec on gpu |
|
|
|
Thanks brainless
The reason I chose Jean_Luc's project
it can run its own uint_64 (own integer class) with GPU, I'm trying to understand this issue.
Source code includes AddDircet, DoubleDirect and ComputePublicKey (G * int). But EccMultipy (Point x int) does not exist.
I was just in the beginning, I guess this is not the right place to discuss. But even if I only use CPU it is much faster than python. I don't know if it is with a GPU.
I'm not sure what I'm learning, I am not aware of C or C ++ right now, for now (:
" ComputePublicKey (G * int). But EccMultipy (Point x int) does not exist. " G = point G * int = its eccmultiply (Point x int) only developer need to design as per above command for easy input/output at gpu work, let see who design it for community |
|
|
|
-snip- I have some functions in Python and it runs very slow compared to C. The sage I want to do with the GPU is as follows Pr = 115792089237316195423570985008687907853269984665640564039457584007908834671663
E = EllipticCurve (GF (P), [0,7])
N = E.order ()
G = E(55066263022277343669578718895168534326250603453777594175500187360389116729240,32670510020758816978083085130507043184471273380659243275938904335757337482424) # on E
T = E(26864879445837655118481716049217967286489564259939711339119540571911158650839,29571359081268663540055655726653840143920402820693420787986280659961264797165) # on E
numInt = 5646546546563131314723897429834729834798237429837498237498237489273948728934798237489723489723984729837489237498237498237498237498273493729847
numMod = numInt %N
numInv = pow(numMod ,N-2,N) # detail -> https://stackoverflow.com/questions/59234775/how-to-calculate-2-to-the-power-of-a-large-number-modulo-another-large-number
numMod * G
numMod * T
(T-G) * numInv
print (5*T)
print (2*G)
print (numMod * G)
print (numMod * (-G))
print (numMod * T)
print ((numMod-3) * (T-G)) Do you have any suggestions? What should I do ? I wrote my question here because it is indirectly related to this project. Please forgive. Hi! The slowest part in your python is inverse function. Try to implement gmpy2 inverse function (included in gmpy2) - it is C-based and very fast: https://www.lfd.uci.edu/~gohlke/pythonlibs/#gmpyYou can find the details here: https://bitcointalk.org/index.php?topic=5245379.msg55214449#msg55214449When using Python, I use FastEcdsa( https://github.com/AntonKueltz/fastecdsa) library and mathematics similar to Sage. But can I do the math faster? I want to understand. The FastEcdsa Library is fast, but I don't know if it uses the gmpy2 you suggested. My python script uses 17% of the CPU as a result. I wanted to write with Anaconda (for GPU), but I could not find a gpu running as fast as C or I could not. Thank you MrFreeDragon . No. you can't be faster then GPU on your CPU. if i explain your word in easy example commands for new gpu based develop application/repo, by jean luc or other developer, could be develop, or if any one know already developed can post links and refferance here are some example aspected commands ./vs-pub -c -gpu -input in.txt -output out.txt -add 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 #pubkey ./vs-pub -c -gpu -input in.txt -output out.txt -mul 123456789 # its privatekey in num (not hex) ./vs-pub -c -gpu -input in.txt -output out.txt -sub 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 #pubkey ./vs-pub -c -gpu -input in.txt -output out.txt -sub 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 -r (reverse like 02508... pubkey substract to all listed pubkey inside in.txt -c is compressed pubkey -u is uncompressed pubkey -input is load of compressed/uncompressed pubkeys list -output is results output to file -r is reverse of sub ( listed pubkey in command minus(-) in.txt (pubkeys) |
|
|
|
when --count is coming ?
developer is missing, hope he is enjoying cracked address and now forget his community |
|
|
|
No it's a brainless application.
You need fast indexing of the targets and a more directional approach.
Filter off the dust and the file will be ~120 Megs.
In it's current state it's just a heater and it's not going to find anything, not now not ever.
bro hope you have car, which one model/year you have ? |
|
|
|
|
currently bitcrack running features like if stride is 100
count+stride+count+stride = 1+100+1+100 = total 202
looking update with new switch --count as define by user ( --count 200) and stride 100 ( user count is checking keys)
user-count + stride + user-count+ stride + user- count = 300+100+300+100+300 = total 1100
addons if --keyspace is 1:3000, new switch --loop --count 2000 --stride 100
user-count + stride + user-count+ stride + user- count = 2000+100+2000(its reach at end but still countin in loop from 1(startkey))+100+2000 continue loop
--count will be keys need to be check and stride
hope this feature will make bitcrack more effective and attractive
Thankx
|
|
|
|
hi @BitCrack
Will you consider releasing a server-client version of bitcrack ?
Yes, I have been working on it for a little while. Great news  don't forget to merge this https://github.com/brichard19/BitCrack/issues/256 if it is not already done. And thanks a lot. anyone have study bitcrack codes, and have commands in hand to modifiy/add/update some features if yes, then these feature, work fast then kangaroo for find 120 puzzle, pls check and update us all community --stride 1000:52000 where 1000 key check, and 52000 key bypass(no check) --loop 500 count total keys of --keyspace * 500 = total keys example 1 to 100 + 1 to 100 + 1 to 100 cuurent stride work only fixed like --stride 1:52000 or 1:123456 Brichard19 refuse to further work at bitcrack I'm trying to follow what you are saying/wanting the program to do. It checks 1000 keys, and then skips 52000 keys? I didn't know the current stride function could be used as --stride1:52000; I only used --stride and a single number. But I do know the stride function is broken when you try to use it with the continue function. If you use a number higher than 9, say --stride 11 with --continue, it works first time around but changes the stride second time around. It doesn't parse/calculate numbers above 10(A) correctly. actual func is --stride 52000, 52000 define by user, its skip 52000 and check 1 key, as i think its fixed inside first key and next key, in program by default only 1 is fixed for check, should be create func for check keys define by user and loop function i design reverse kangaroo inside bitcrack, mean i created pubkeys inside bit range, as per kangaroo jump and checking and skips calculation will find solution in loop, in this senerio, no need highest rams, and hdd spaces, and no dead kangaroo, and by default save/continuous func save your work just 1 click |
|
|
|
hi @BitCrack
Will you consider releasing a server-client version of bitcrack ?
Yes, I have been working on it for a little while. Great news don't forget to merge this https://github.com/brichard19/BitCrack/issues/256 if it is not already done. And thanks a lot. anyone have study bitcrack codes, and have commands in hand to modifiy/add/update some features if yes, then these feature, work fast then kangaroo for find 120 puzzle, pls check and update us all community --stride 1000:52000 where 1000 key check, and 52000 key bypass(no check) --loop 500 count total keys of --keyspace * 500 = total keys example 1 to 100 + 1 to 100 + 1 to 100 cuurent stride work only fixed like --stride 1:52000 or 1:123456 Brichard19 refuse to further work at bitcrack |
|
|
|
You are using a too small DP, too much DPs enter in the HashTable and slow down the search.
The expected RAM to reach 50% probability is 60GB.
And last but not least, you CPU work also and prevent the other threads to work.
Try DP17 or 18 and use -t 0 (no CPU) option.
Kangaroo.exe -d 17 -t 0 -gpu -gpuId 0,1,2,3 -g 136,128,136,128,136,128,136,128 in.txt
if i am not wrong, you win 115bit puzzle in 13 days, and you count 120 puzzle is more hard as 32 time its mean 13 x 32 = 416 days you need to win or ? |
|
|
|
MY SOFT NOT FINED LIKE YOU, LOOOK AT THIS SH.... 10 MINUTES AND NO RESULT !!! [code]
.EXe -t 0 -gpu -g 136,256,136,256 -gpuId 0,1 -o result.txt
test40.txt
angaroo v2.0
Start:1
Stop :FFFFFFFFFF
Keys :1
Number of CPU thread: 0
Range width: 2^40
Jump Avg distance: 2^19.97
Number of kangaroos: 2^23.09
Suggested DP: -3
Expected operations: 2^21.40
Expected RAM: 857.8MB
DP size: 64 [0xFFFFFFFFFFFFFFFF]
GPU: GPU #1 GeForce RTX 2080 Ti (68x64 cores) Grid(136x256) (347.0 MB used)
SolveKeyGPU Thread GPU#1: creating kangaroos...
GPU: GPU #0 GeForce RTX 2080 Ti (68x64 cores) Grid(136x256) (347.0 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
SolveKeyGPU Thread GPU#0: 2^22.09 kangaroos [13.3s]
SolveKeyGPU Thread GPU#1: 2^22.09 kangaroos [14.6s]
[1324.32 MK/s][GPU 1190.21 MK/s][Count 2^32.39][Dead 0][04s (Avg 00s)][2.0/4.0MB
[1942.10 MK/s][GPU 1807.99 MK/s][Count 2^33.35][Dead 0][08s (Avg 00s)][2.0/4.0MB
[1903.15 MK/s][GPU 1813.75 MK/s][Count 2^33.88][Dead 0][12s (Avg 00s)][2.0/4.0MB
[1718.04 MK/s][GPU 1662.16 MK/s][Count 2^34.34][Dead 0][17s (Avg 00s)][2.0/4.0MB
[
[1391.96 MK/s][GPU 1391.96 MK/s][Count 2^39.73][Dead 0][12:31 (Avg 00s)][2.0/4.0
[1390.44 MK/s][GPU 1390.44 MK/s][Count 2^39.74][Dead 0][12:36 (Avg 00s)][2.0/4.0
[1395.04 MK/s][GPU 1395.04 MK/s][b][Count 2^39.75][Dead 0][12:40 (Avg 00s)][2.0/4.0[/b]
MB] ^CЗaвepшить выпoлнeниe пaкeтнoгo фaйлa [Y(дa)/N(нeт)]?
[/code] Bro, whot version you use ? What is your command line settings ? HELP PLEASE BRO  ? !!!! I ran the test on the latest version, Windows. I posted my bat file above - but just Kangaroo -t 4 -dp 12 rangetest.txt (CPU only) edit: something isn't right with your version or something. With all that GPU power you have in this small range, if it's not finding, you would have 43 billion dead kangaroos. dp of negative 3?? never seen a negative number maybe probelms in his Suggested DP: -3 try use -d 12 in your command |
|
|
|
Kangaroo -t 0 -d 14 -gpu -gpuId 1 -ws -w 65save.txt -wi 30 -o 64save.txt 65.txt pause (did as they wrote, after launching the bat file it starts and it says “click any button” in the working window, everything closes after clicking) What should I do to fix the error ?? for window click start, then click in searchbar then type cmd click commamd prompt when black winodw of command prompt apear, go to your folder where your kangaroo files, then run your program commands |
|
|
|
Sorry me for offtop. Can someone share me compiled Ubuntu 16. CUDA 10 version of Kangaroo ? Very needed. Try compile latest from GitHub but get trebles. in PM if someone can this doing.
make gpu=1 ccap=20 all
cd obj && mkdir -p SECPK1
g++ -DWITHGPU -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -I. -I/usr/local/cuda-10.0/include -o obj/SECPK1/IntGroup.o -c SECPK1/IntGroup.cpp
SECPK1/IntGroup.cpp: In constructor 'IntGroup::IntGroup(int)':
[b]SECPK1/IntGroup.cpp:24:42: error: 'malloc' was not declared in this scope[/b]
subp = (Int *)malloc(size * sizeof(Int));
^
SECPK1/IntGroup.cpp: In destructor 'IntGroup::~IntGroup()':
[b]SECPK1/IntGroup.cpp:28:12: error: 'free' was not declared in this scope[/b]
free(subp);
^
Makefile:80: recipe for target 'obj/SECPK1/IntGroup.o' failed
make: *** [obj/SECPK1/IntGroup.o] Error 1
?? Your gpu model ? |
|
|
|
|
Show Posts
