Topic: BitCrack - A tool for brute-forcing private keys - page 80. (Read 77647 times)

#110 solved!!!

https://www.blockchain.com/btc/address/12JzYkkN76xkwvcPT6AWKZtGX6w2LAgsJg

https://bitcointalksearch.org/topic/m.54531616

Any one can help me to compile the Cuda version for my Nvidia GT 620m (compute_cap=30) and  Nvidia GTX 750?
I try to compile the Cuda version for my Nvidia GT 620m, I have change the compute_cap to 30, but still make 'invalid device symbol' error

Hello everybody! My program does not work on Sapphire Nitro+ RX 570 8gb Open CL 2,0 (((Version ready for work downloaded the compiled program 0.31 does not work can't find keys. I don’t know how to compile files, someone already has a working file.

Of course not, WIF has way more permutations than the possible priv keys.

But 'alphabetical' checking of WIFs is not this same as 'alphabetical' checking hex pkey....

WIF is just another representation of the private key (In other words, they are the same thing)

Is there a plan to modify the program to work on WIF instead of private key?

1050Ti
-b 90 -t 512 -p 512
86-88 MKeys

Rx488
-b 72 -t 256 -p 2048
172-176 Mkeys

Rx574 itx Pulse
-b 100 -t 128 -p 2000
132-134 Mkeys

Yes there is a bug for opencl ... the fix is here: https://github.com/brichard19/BitCrack/issues/223

Hey Everyone ,

It's my first post here so just wanna say quick Hello.

I'm using the CUDA version of BitCrack with the following specs :

Intel Xeon CPU E3-1275 v5 @ 3.60GHZ
16gb ram
GeForce GTX 1050Ti
30'000 Target list

I'm getting around 60-61Mkey/s is anyone know better configuration for -b -t -p

Currently use the following :
blocks=300
threads=128
points=512
 
Thanks

Hey Fellas,
If anyone can provide some assitance in regards to my nightmare lol... please let me know and send me a PM. Its not a hopeless senario but i am at a impasse hence why i am reaching out....
Besdies this,....


I feel as if im missing a % or somethng.... does this seem correct in terms of output?
which is better the CL or CU ....

Instance 1
>cubitcrack.exe -t 512 -p  1024
Compression: compressed
Starting at: 0000000000000000000000000000000000000000000000000000000000000001
Ending at:   FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE***********************
Counting by: 0000000000000000000000000000000000000000000000000000000000000001
Generating 16,777,216 starting points (640.0MB)
[Info] 100.0%
[Info] Done
GeForce GTX 1070 2956 / 8192MB | 1 target 227.58 MKey/s (6,393,411,141,632 total) [07:46:27]


Instance 2
clbitCrack.exe  -c -u  -b  128 -t 384 -p 1024  --continue sess.txt

 Compression: both
[2020-04-15.12:57:56] [Info] Starting at: **********************************43937452  (edited)
[2020-04-15.12:57:56] [Info] Ending at:   FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDC************************ (edited)
[2020-04-15.12:57:56] [Info] Counting by: 0000000000000000000000000000000000000000000000000000000000000001
[2020-04-15.12:57:56] [Info] Compiling OpenCL kernels...
[2020-04-15.12:57:57] [Info] Initializing GeForce GTX 1070 Ti
[2020-04-15.12:58:07] [Info] Generating 50,331,648 starting points (1920.0MB)
GeForce GTX 1070 4608 / 8192MB | 1 target 101.48 MKey/s (3,516,003,613,671,424 total) [07:04:35][2020-04-15.13:40:54] [Info] Checkpoint
GeForce GTX 1070 4608 / 8192MB | 1 target 98.35 MKey/s (3,516,009,049,489,408 total) [07:05:29]]

BitCrack does not authorize private messages from noobies like me, I allow myself to send him my request here ^^ which incidentally and always the same as before (I don't let anything go - lol)

Hello,

First of all I want to apologize for my English which is not necessarily at the top.

I had the opportunity to try your program and I want to congratulate you because it is really effective.
On the other hand I would have liked that this one seeks only the coordinate of x and not the bitcoin address in its base58 form.
I think that after all this must be faster (I can be wrong) because it is the first thing that this one calculates after having given him the private key. So instead of providing a list of addresses
(eg: 173g6UwTFYWKrks6h4waxNdCewsPWeLuUo), I would like to be able to provide him a list of coordinates x (ex: d41255c006185d9dd1ab6eccef02bf8a6b8cc7e20cffbe84b8e0b6) and that the program in the same principle as currently checks the correspondence. Unfortunately after consulting the source code I am unable to make the changes. If I understood correctly, the modification should take place in the function:

void KeyFinder :: setTargets (std :: string targetsFile)

where the addresses are converted to hash160 before being checked. this function would therefore not be necessary for my use as well as the others (base58 - sha256 etc ..) only the ECSDA function interests me in this case. My knowledge of C ++ is close to zero and I am unable to modify anything (it is not for lack of trying ^^). Ok, would you be kind enough to modify it or at least provide me with a piece of code or some details that could allow me to modify it?

I will understand if you do not have the time or the will and would be grateful for the work already done by sharing Bitcrack.

Your biggest fan ^^

this request having become public, any charitable soul is of course welcome. thank you in advance

first of all thank you for your answer, I knew all these utilities and I have already had the opportunity to test them. The problems that I encountered with Pollard kangoroo are that on the one hand it does not use the GPU and that I do not wish to search for the private keys with their prefixes (02 or 03) but only the coordinate of x which is elsewhere calculated in the first step before check if y is odd or even. The ideal would be a model like bitcrack which randomizes a private key in a range and submits it to the elliptical curve and checks only the coordinate of x. I think it must be possible right? thank you again for being interested in my problem.

Bitcrack is not made for that but you can use this for what you're talking about but the speed is not with an gpu though.


https://github.com/Telariust/pollard-kangaroo

https://bitcointalksearch.org/topic/m.52473992

https://bitcointalksearch.org/topic/m.52318676

Hello, would it be possible for someone to modify the program so that instead of searching for the bitcoin address he searches for the public key (compressed) in its hexadecimal form without the prefix (02 or 03).

Example: we know that for private key N°1 (1BgGZ9tcN4rm9KBzDn7KprQz87SZ26SAMH) the compressed public address corresponds to: 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
I would like BitCrack to search for this public key without the prefix 02 at the start (basically it searches for the X coordinate only)

 My goal here is not to find the private key of an address but to search (try ^^) to find a correlation between private key and public key. I know that at the moment of today certain think that it is impossible (and they are certainly right) but I would like all the same to carry out certain research and that is why I will need to modify the program. Unfortunately my skills in C ++ and even in python for that matter leave something to be desired. Thank you in advance for the help you could give me or any external link not too complicated to implement. Thank you

Hi, i have a problem, i have a wallet which i saved private keys but i can't find the last part. if don't know the last 17 characters of private keys can i use this software and which command i should use?

Great ! new version

2080 - 188.16 MKey/s (old 155)

466,284 addresses loaded (8.9MB)
GeForce RTX 2080 4937 / 8192MB | 466284 targets 188.16 MKey/s (215,884,623,360,000 total) [15:23:48:58][2020-02-13.22:33:11] [Info] Checkpoint

why deleted -r  from last version?

https://github.com/brichard19/BitCrack/releases

this : Improve OpenCL performance

No one answers? !!!
Answer at least my question:
I've overclocked my graphics card
Has it affected my graphics card?
And the output?

He can only use the buggy clBitcrack with amd gpu.