BitCrack - A tool for brute-forcing private keys

[fxsniper]

Can anyone help to fix about random function can not using large number
problem  random.Next not work with 9223372036854775808 to 18446744073709551616

random.Next(9223372036854775808, 18446744073709551616)

Code:

UInt64 Base = 0x7FFFFFFFFFFFFFFF;
            
var random = new Random();

UInt64 high32Rnd = (UInt64)random.Next();
UInt64 low32Rnd = (UInt64)random.Next();

UInt64 rnd64 = (high32Rnd << 32) | low32Rnd;
rnd64 >>= 1;
rnd64 += Base;

Console.WriteLine(rnd64);

Thank you A-Bolt

I will try use this code

and if for puzzle #120
664613997892457936451903530140172287             
1329227995784915872903807060280344575           

and puzzle #160
730750818665451459101842416358141509827966271232
1461501637330902918203684832716283019655932542464

how to apply use same code?

[zahid888]

save as .bat file place it in same folder with clbitcrack.. double click in .bat file and enjoy

@echo off
:loop
setlocal EnableDelayedExpansion
set /a "i1 = 0, i2 = 0" &for /l %%i in (0,1,23) do set /a "i1 = (i1 << 1) | (!random! & 1), i2 = (i2 << 1) | (!random! & 1)"
cmd /c exit /b %i1%
set "GO=%=exitcode:~2%
cmd /c exit /b %i2%
set "GO=%GO%%=exitcode:~2%
endlocal &set "GO=%GO:~2,7%%"
echo %GO%
start clBitCrack.exe  -i C:/Users/pc/Desktop/keys.txt -b 128 -t 256 -p 1024 -o C:/Users/pc/Desktop/found.txt --keyspace 800000000%GO%:ffffffffffffffff --stride 10000000
timeout /t 50
taskkill /f /im clBitCrack.exe
timeout /t 0
goto loop

[fxsniper]

I try to compile BitCrack

using Visual Studio 2019

but found error

Severity   Code   Description   Project   File   Line   Suppression State
Error   C1083   Cannot open include file: 'CL/cl.h': No such file or directory   clUtil   \BitCrack\clUtil\clutil.h   8   

How I can fix it?

[dex1]

Hi guys ,

Can this tool or any modification of this be modified to write all private keys and respective uncompressed private keys and addresses) in range 1 to 56BC75E2D630FFFFF as a csv file . Since it generates 700 to xxxx million keys /s in some of its versions , so it will take many years on a single machine. But still looking for solutions. Writing regular outputs will consume too much time
So better it will save several millions or billions in some sort of memory operation and then write them once ,  till then next batch will find its space in memory to be written again.

Just before you set out on your endeavor it's just wise to do some planning.

Even assuming that time needed to complete your task is of no significance to you, it is worth a while to think about a storage capacity you will need to write results of your work to.
Basically you are asking for a csv file like this:

Code:

P.K. hex format   Private Key WIF(uncompressed)                      Bitcoin Address(uncompressed)

00000000000000001,5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAnchuDf,1EHNa6Q4Jz2uvNExL497mE43ikXhwF6kZm
00000000000000002,5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAvUcVfH,1LagHJk2FyCV2VzrNHVqg3gYG4TSYwDV4m
	.			.						.
	.			.						.
	.			.						.
56BC75E2D630FFFFE,5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ipWyAZRoQaWUwNpPfbk,1KxoAem9qcEgf9naPk7ETaWvx379Hw2YZX
56BC75E2D630FFFFF,5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ipWyAZRoQaWUwZy1EeS,1MCzMYUdD68jXjtXtyv82uVRUvsHW7cNN9

This file is bound to have 99,999,999,999,999,999,999 plus 1 (56BC75E2D630FFFFFh=99999999999999999999) lines of roughly 104 characters each. So to put it another way
one hundred quintillion lines times 104 bytes equals to 10,400,000,000,000,000,000,000 bytes. Using a conversion tool you end up with these numbers:

Code:

10,400,000,000,000,000,000,000 bytes (B) = 9685754776000.98 gigabytes (GB)
10,400,000,000,000,000,000,000 bytes (B) =    9458744898.44 terabytes (TB)
10,400,000,000,000,000,000,000 bytes (B) =       9237055.56 petabytes (PB)

To make it easier for you to grasp all of what I stated above I'll paraphrase it:
To complete your task you have to be a rather affluent person. According to this wiki page 1 TB of storage costs $50 so you'd have to fork out $472,937,244,922.
But please worry NOT because I've got some good news for you. The wiki page I've just mentioned must be outdated and I found this little device of which you need 525,485,827 of them.
And that will ONLY set you back mere $209,936,843,020.

Good luck and all the best to you.

PS
Remember: PLANNING IS CRUCIAL

[NotATether]

I try to compile BitCrack

using Visual Studio 2019

but found error

Severity   Code   Description   Project   File   Line   Suppression State
Error   C1083   Cannot open include file: 'CL/cl.h': No such file or directory   clUtil   \BitCrack\clUtil\clutil.h   8   

How I can fix it?

You don't have OpenCL headers installed. They should be available from CUDA toolkit or AMD's OpenCL SDK.

This file is bound to have 99,999,999,999,999,999,999 plus 1 (56BC75E2D630FFFFFh=99999999999999999999) lines of roughly 104 characters each. So to put it another way
one hundred quintillion lines times 104 bytes equals to 10,400,000,000,000,000,000,000 bytes. Using a conversion tool you end up with these numbers:

Code:

10,400,000,000,000,000,000,000 bytes (B) = 9685754776000.98 gigabytes (GB)
10,400,000,000,000,000,000,000 bytes (B) =    9458744898.44 terabytes (TB)
10,400,000,000,000,000,000,000 bytes (B) =       9237055.56 petabytes (PB)

I'm starting to think that even Google's combined storage capacity across all its services doesn't have 9 zettabytes of storage space. Youtube only has a mere couple exabytes of capacity for example.

[sp_]

I played around with the code and managed a 50% increase in speed on pascal cards.


I forked this repository:

https://github.com/BoGnY/BitCrack

speed without sp-mod: 267MHASH. after, 400MHASH

[fxsniper]

I played around with the code and managed a 50% increase in speed on pascal cards.


I forked this repository:

https://github.com/BoGnY/BitCrack

speed without sp-mod: 267MHASH. after, 400MHASH

How can I compile bitcrack on windows?

I use windows 10 and Visual Studio 2019

I install CUDA Toolkit 11.2 already
https://developer.nvidia.com/cuda-downloads

CUDA SDK and CUDA Toolkit is same right?

[sp_]

This fork needs cuda 10.2

[fxsniper]

You don't have OpenCL headers installed. They should be available from CUDA toolkit or AMD's OpenCL SDK.
 

I install CUDA Tools kits

https://developer.nvidia.com/cuda-downloads

and Intel® SDK For OpenCL, still not work

Where can I download correct OpenCL SDK

[fxsniper]

Windows can install multiple CUDA Toolkit right?

CUDA Toolkit 11.2
CUDA Toolkit 10.2

[WanderingPhilospher]

Windows can install multiple CUDA Toolkit right?

CUDA Toolkit 11.2
CUDA Toolkit 10.2

Yes

[fxsniper]

ok, now I can compile some bitcrack



test compile with version
https://github.com/brichard19/BitCrack

still can not compile
have some problem


same machine with version
compile
https://github.com/BoGnY/BitCrack
result compile success with many warning yellow line

when using bitcrack this fork version
program waiting to generate point long time more than brichard19  (waiting before show 10% to 100%)


my result is reverse  BoGnY run only  1M/s  and brichard19 11M/s

[fxsniper]

I am not sure why debug is use time very long
but release version result is better

BoGnY/BitCrack debug = 1 M/s
BoGnY/BitCrack release = 58 M/s

brichard19/BitCrack = 11 M/s

[fxsniper]

I played around with the code and managed a 50% increase in speed on pascal cards.


I forked this repository:

https://github.com/BoGnY/BitCrack

speed without sp-mod: 267MHASH. after, 400MHASH

 

sp_ link

I found some problem
I use batch file run group of command cubitcrack

first time run fast but after that 3-5 set look like slow or struck
it  Reached end of keyspace very fast feel 2-3 set but faster 2-3 it not pass to next order
(each set 2,000,000)

[sp_]

I have released a faster binary of bitcrack.

https://github.com/sp-hash/Bitcrack/releases/tag/sp-mod1

The build require Compute 61 or newer (pascal). Please test. What hashrates are you getting?

[sp_]

You said that your performance is 9 million BTC-addresses per second, i.e. approximately 2²³ BTC-addresses per second. Thus the brute forcing will take 2^160-23 = 2¹³⁷ seconds! I guess it is more than septillion (10²⁴) years!

Note that this calculating is very approximate, because actually the private key length is 2²⁵⁶, but I think it is enough to stop making an attempts to crack Bitcoin-addresses.

The 1070ti was released in 2017

bitcrack can be set up to search for private keys in all 31million known bitcoin adresses with money in them at the same time.
That gives 400 * 31 million BTC-addresses per second for the 1070ti with bitcrack sp-mod.


2^160 - (2^25 + (2^29 * gpus))


1 gpu (2017) will use around 2^104 seconds.
10 000 gpu's (2017) will use around 2^90 seconds

And then there is more's law, and then there is luck.

[chrysophylax]

I have been watching for some time now ...

There are only a few ways of endeavoring to do this in any meaningful time frame, and what you are showing here is not one of them.

However, it is a start.

Still a VERY long way off, but a start.

#crysx

[fxsniper]

I test both version
https://github.com/sp-hash/Bitcrack/releases/tag/sp-mod1
up speed from 11 to 50

and
https://github.com/BoGnY/BitCrack
up speed from 11 to 30

very good work for very fast than normal

I testing fine to works
generate address each 1000 million address to in.txt and testing search
it is work correct found key when scan over 1000 million found key each 1000 million as generate key




high bits with fast speed not answer for high bits brute force
because still use a lot of time
I think strategy or algorithm calculate key space target and scan that keyspace for fast found key

[fxsniper]

some detail
both version optimize GPU
both use memory a lot for calculate it made continue search will struck when search over memory used
if run only one time not a problem
may be possible about free memory after used
I solve that problem by open new windows or new process
example batch file modify code to open new windows
or program lunch by open new windows (when finish and windows close with close memory)

[NotATether]

I have released a faster binary of bitcrack.

https://github.com/sp-hash/Bitcrack/releases/tag/sp-mod1

The build require Compute 61 or newer (pascal). Please test. What hashrates are you getting?

[img ]https://i.ibb.co/prM8c7S/bitcrack.png[/img]

Great job!

I will try this on my T4, so compute 75 (it's taking some time to compile as usual). [EDIT - I just did, unfortunately that idiot misaligned address error is still there but since I sorta found what is being misaligned I think it's just a matter of making a couple of 32-bit pointer arrays 64-bit.]

I also noticed you fixed the bug that made clBitCrack skip way too many points than it should - I remember there was someone here complaining that the search finished too quickly.

You should probably change the COMPUTE_CAP variable in the Makefile though - It's still at the default 30 although it will not compile on that compute cap.

I can give you a bash script that autodetects the CUDA version using the deviceQuery example program. I'm using it in my Makefile for another project (custom Kangaroo) that I haven't released yet.


Wait an idea just hit me. All of the 256bit numbers are stored in 32-bit bits so if all of that gets upgraded to 64-bits then we will have just doubled the speed of this program while also destroying the misaligned access error (because I suspect that Volta/Turing/Ampere will no longer align array elements across 32-bits, only 64 or 128).