BitCrack - A tool for brute-forcing private keys - page 53.

WanderingPhilospher

full member

Activity: 1050

Merit: 219

Shooters Shoot...

Quote from: Markzuberg64 on March 23, 2021, 11:17:33 AM

Quote from: WanderingPhilospher on March 22, 2021, 01:12:45 PM

Quote

2 min if speed of 15 billion achieved and if i write private key and corresponding public key

Are you looking for uncompressed or compressed?
Since I do not know your purpose in this, I can't help you to shorten the pubs.
Regardless, 20 million priv keys and corresponding pubkeys should only take up about 2.5Gb in storage space.

The purpose is to make precomputed tables , nothing else. 😁 . Uncompressed pubkeys are fine since i found that it would be beneficial to store them as hash only which eventually will save space too and private keys can be found later by index. No need to save them. I learned it from jean Bsgs Code. It uses 25 bits to save the baby steps. And i think its same as sequential pubkeys if the sole purpose is for making a hash table.

But still i didnt get any idea of how the 15 billion per min speed can be achieved.

I have no idea either...no way to write 15 billion in one minute, IMO, at least not on my hardware. Best I could do was about 200K a minute. Let me better explain. Normally when I do a search/look for keys, whether random or sequential, one of my GPUs will get 200MKey/s, but when I try to write the results, it drops to 0.1MKey/s because of the writing to file/RAM. So the bottleneck to me, is all in the CPU writing to file.

WanderingPhilospher

full member

Activity: 1050

Merit: 219

Shooters Shoot...

Quote from: sp_ on March 23, 2021, 08:15:16 AM

Quote from: fxsniper on March 23, 2021, 05:46:14 AM

my test
VanitySearch is faster
I am not sure can compare or not with method search for bitcrack and vanitysearch
VanitySearch-bitcrack ==> 70 MK/s

I tested Vanitysearch_bitcrack on the gtx 1070ti and the speed was: 287Mkey. The hashrate started better at around 300MKey, and then dropped after a few seconds down to 287..

bitcrack sp-mod#2 is 404Mkey. (+40%)

Here's the thing there _sp, yours is still stone age, single gpu and can't use with newer cards. Please update when yours can run multi gpu and 30xx cards.

WanderingPhilospher

full member

Activity: 1050

Merit: 219

Shooters Shoot...

Quote

C/C++/Python and most of the other 'commonly' known languages are readily available in CentOS/Ubuntu. How is PureBasic one of those and how on earth do you compile this in a CentOS7/8 VPS.

He was referring to the 64 bit pool, not the link I posted

WanderingPhilospher

full member

Activity: 1050

Merit: 219

Shooters Shoot...

Quote

problem
VanitySearch fast but it search full key 265bits
can not search by keyspace for puzzle #64

You are using wrong VanitySearch

Markzuberg64

jr. member

Activity: 35

Merit: 2

Quote from: WanderingPhilospher on March 22, 2021, 01:12:45 PM

Quote

2 min if speed of 15 billion achieved and if i write private key and corresponding public key

Are you looking for uncompressed or compressed?
Since I do not know your purpose in this, I can't help you to shorten the pubs.
Regardless, 20 million priv keys and corresponding pubkeys should only take up about 2.5Gb in storage space.

The purpose is to make precomputed tables , nothing else. 😁 . Uncompressed pubkeys are fine since i found that it would be beneficial to store them as hash only which eventually will save space too and private keys can be found later by index. No need to save them. I learned it from jean Bsgs Code. It uses 25 bits to save the baby steps. And i think its same as sequential pubkeys if the sole purpose is for making a hash table.

But still i didnt get any idea of how the 15 billion per min speed can be achieved.

renedx

jr. member

Activity: 36

Merit: 3

Quote from: WanderingPhilospher on March 22, 2021, 09:38:22 PM

Quote

Even if he is able to 2x the openCL speed on the Ampere cards, it would take my spare -/+20 cards 74 days to crack 10% of the puzzle 64. Could be enough, but prob. still would take a lot of time.

Btw _sp
I can remote access you a RTX card if it helps

Ha...ha...ha...unless I am reading what you are saying wrong. You have 20 cards, round about 20? And you think you would crack 10%? The pool has been running pretty non stop for over a year. With Zielar's big push at times with 256 to 512 V100, and they are barely above 10%. Yes. 256 up to 512 V100s at times...over a year running, and barely above 10%.

You're right, I didn't modify the suspected keyspace we ran. My bad. In that case, its gonna be a long bumpy ride Grin

fxsniper

member

Activity: 406

Merit: 45

Quote from: sp_ on March 23, 2021, 08:35:50 AM

You probobly need to reduce the number of points as well. Play with the settings. I am sure will run faster. The gtx 1050 laptop is not the target for the optimizations here.

Error: out of memory

I try change to -b 20 -t 256

it is works

cuBitCrack.exe -d 0 -b 20 -t 256 --keyspace 8000000000000000:+1000000000000000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN

GeForce GTX 1050 2634 / 4096MB | 1 target 78.97 MKey/s (3,376,414,720 total) [00:00:40]

sp_

legendary

Activity: 2898

Merit: 1087

Team Black developer

You probobly need to reduce the number of points as well. Play with the settings. I am sure will run faster. The gtx 1050 laptop is not the target for the optimizations here.

fxsniper

member

Activity: 406

Merit: 45

Quote from: sp_ on March 23, 2021, 08:19:37 AM

Quote from: fxsniper on March 23, 2021, 05:46:14 AM

Bitcrack-spmod2 ==> 50 MK/s

On the gtx 1050 laptop try with the launch config -b 40 -t 512 in the bat file.

my memory is 32GB

cuBitCrack.exe -d 0 -b 40 -t 512 --keyspace 8000000000000000:+10000000000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN

Bitcrack sp-mod #2 (https://github.com/sp-hash)

[2021-03-23.19:29:09] [Info] Compression: compressed
[2021-03-23.19:29:09] [Info] Starting at: 0000000000000000000000000000000000000000000000008000000000000000
[2021-03-23.19:29:09] [Info] Ending at: 0000000000000000000000000000000000000000000000008000010000000000
[2021-03-23.19:29:09] [Info] Counting by: 0000000000000000000000000000000000000000000000000000000000000001
[2021-03-23.19:29:09] [Info] Initializing GeForce GTX 1050
[2021-03-23.19:29:10] [Info] Generating 83,886,080 starting points (3200.0MB)
[2021-03-23.19:29:13] [Info] Error: out of memory
Execution time = 4 seconds

sp_

legendary

Activity: 2898

Merit: 1087

Team Black developer

Quote from: fxsniper on March 23, 2021, 05:46:14 AM

Bitcrack-spmod2 ==> 50 MK/s

On the gtx 1050 laptop try with the launch config -b 40 -t 512 in the bat file.

sp_

legendary

Activity: 2898

Merit: 1087

Team Black developer

Quote from: fxsniper on March 23, 2021, 05:46:14 AM

my test
VanitySearch is faster
I am not sure can compare or not with method search for bitcrack and vanitysearch
VanitySearch-bitcrack ==> 70 MK/s

I tested Vanitysearch_bitcrack on the gtx 1070ti and the speed was: 287Mkey. The hashrate started better at around 300MKey, and then dropped after a few seconds down to 287..

bitcrack sp-mod#2 is 404Mkey. (+40%)

chrysophylax

legendary

Activity: 2814

Merit: 1091

--- ChainWorks Industries ---

Quote from: fxsniper on March 23, 2021, 03:53:13 AM

Quote from: chrysophylax on March 23, 2021, 12:44:47 AM

Oh No ...

Is this 'pool' Windows based only?

Is there a linux based version, as we mainly use CentOS7 CentOS8 for our servers, which we would gladly setup for the community.

Windows is a no go for us at CWI. Never will be. EVER.

#crysx

64 bit pool have support both windows and Linux ( Ubuntu 64 bit 14.04.2 LTS and 18.04.3 LTS.)

support only bitcrack no BSGS

How? ...

C/C++/Python and most of the other 'commonly' known languages are readily available in CentOS/Ubuntu. How is PureBasic one of those and how on earth do you compile this in a CentOS7/8 VPS.

I suppose it is one thing to say it works, another to make it work in such environments. Windows will never be an OS we use.

So if you can point to a link that shows how to compile this in CentOS/Ubuntu - I may be able to work it out without taking any of my developers off the projects they are already inundated with.

#crysx

_Counselor

member

Activity: 107

Merit: 61

Quote from: fxsniper on March 23, 2021, 05:46:14 AM

yes, it faster

my test
VanitySearch is faster

I am not sure can compare or not with method search for bitcrack and vanitysearch

brichard19 BitCrack ==> 11 MK/s

Bitcrack-sp-mod1 ==> 50 MK/s (full memory)
Bitcrack-spmod2 ==> 50 MK/s

VanitySearch-bitcrack ==> 70 MK/s

VanitySearch ==> 149 MK/s

command test
VanitySearch.exe -gpu 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN

VanitySearch-bitcrack
GPU: GPU #0 GeForce GTX 1050 (5x128 cores) Grid(40x512)
80.121 MK/s (GPU 70.098 MK/s) (2^29.91) [00:00:12 lost_TIME_left infinity][0]

VanitySearch
GPU: GPU #0 GeForce GTX 1050 (5x128 cores) Grid(40x128)
[169.91 Mkey/s][GPU 149.29 Mkey/s][Total 2^29.95][Prob 0.0%][50% in 1.89065e+32y][Found 0]

problem
VanitySearch fast but it search full key 265bits
can not search by keyspace for puzzle #64

Original VanitySearch uses endomorphisms to perform fast additional checks for each key generated.
For each key it checks K, K*lambda, K*lambda*lambda, -K, -K*lambda, -K*lambda*lambda - total 6 possible addresses.
So, for original VanitySearch speed means addresses per second, not keys per second.
These checks are not needed to find addresses in the range. That is why BitCrack and Vanity with bitcrack mode is much slower.

fxsniper

member

Activity: 406

Merit: 45

Quote from: A-Bolt on March 22, 2021, 07:19:48 PM

Quote from: fxsniper on March 22, 2021, 02:37:17 AM

and for puzzle # 120-#160 how can I change it to can use with puzzle #160

Okay, but it looks pointless for me.
This code is for arbitrary puzzle output number (n):

Code:

const Int32 n = 120; // Output number of the puzzle tx

Byte[] rnd256 = new Byte[32];
var random = new Random();
random.NextBytes(rnd256); // Get 256-bit random sequence

Int32 nBytes = (n - 1) / 8;
Int32 nBits = (n - 1) % 8;
Byte mask = (Byte)(0xFF >> (8 - nBits));

for (UInt32 i = 0; i < 32 - nBytes - 1; i++) rnd256[i] = 0; // Zeroing unused bytes
rnd256[32 - nBytes - 1] &= mask; // Zeroing unused bits
rnd256[32 - nBytes - 1] |= (Byte)(mask + 1); // Most significant bit is always 1.

String rndHex = BitConverter.ToString(rnd256).Replace("-", String.Empty);

Console.WriteLine(rndHex);

Thank you A-Bolt

Just hobby do after works or free time (Only during this time interest not yet give up)

fxsniper

member

Activity: 406

Merit: 45

Quote from: WanderingPhilospher on March 22, 2021, 08:57:59 AM

Quote

Really? ...

Do you have the links to the faster ones?

The groundwork was laid a long time ago.

https://github.com/Telariust/VanitySearch-bitcrack

Faster, with multi gpu support. Take existing code and make the tweaks one wants/needs. Much easier to understand and tweak vs bitcrack, IMO. Pool operator can verify that it is faster as well. It also supports the newer cards, 30xx series.

yes, it faster

my test
VanitySearch is faster

I am not sure can compare or not with method search for bitcrack and vanitysearch

brichard19 BitCrack ==> 11 MK/s

Bitcrack-sp-mod1 ==> 50 MK/s (full memory)
Bitcrack-spmod2 ==> 50 MK/s

VanitySearch-bitcrack ==> 70 MK/s

VanitySearch ==> 149 MK/s

command test
VanitySearch.exe -gpu 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN

VanitySearch-bitcrack
GPU: GPU #0 GeForce GTX 1050 (5x128 cores) Grid(40x512)
80.121 MK/s (GPU 70.098 MK/s) (2^29.91) [00:00:12 lost_TIME_left infinity][0]

VanitySearch
GPU: GPU #0 GeForce GTX 1050 (5x128 cores) Grid(40x128)
[169.91 Mkey/s][GPU 149.29 Mkey/s][Total 2^29.95][Prob 0.0%][50% in 1.89065e+32y][Found 0]

problem
VanitySearch fast but it search full key 265bits
can not search by keyspace for puzzle #64

fxsniper

member

Activity: 406

Merit: 45

Why Kangaroo high than bitcrack?

my bitcrack on GTX 1050 (laptop)

cuBitCrack normal 11 MKey
cuBitCrack modify1 50 MKey
cuBitCrack modify2 30 MKey
and
Kangaroo with gpu 100Mkey

That mean max cuBitCrack can do only 50 MKey
cuBitCrack complete calculate have multiple step to convert from private key to address make it slow right
and
Kangaroo do short calculate from private key to public key is less step more that bitcrack make it count Mkey higher correct?

if not how possible make bitcrack high power like Kangaroo (gpu) up to 100Mkey

Kangaroo show
SolveKeyGPU Thread GPU#0: 2^18.32 kangaroos [4.2s]
[127.82 MK/s][GPU 107.38 MK/s][Count 2^36.52][Dead 0][18:31 (Avg 76.1711y)][2.0/4.0MB]

fxsniper

member

Activity: 406

Merit: 45

Quote from: sp_ on March 22, 2021, 04:03:42 PM

gtx 1050: 50 Mkey (laptop?)

yes laptop

I not have PC desktop

fxsniper

member

Activity: 406

Merit: 45

Quote from: chrysophylax on March 23, 2021, 12:44:47 AM

Oh No ...

Is this 'pool' Windows based only?

Is there a linux based version, as we mainly use CentOS7 CentOS8 for our servers, which we would gladly setup for the community.

Windows is a no go for us at CWI. Never will be. EVER.

#crysx

64 bit pool have support both windows and Linux ( Ubuntu 64 bit 14.04.2 LTS and 18.04.3 LTS.)

support only bitcrack no BSGS

WanderingPhilospher

full member

Activity: 1050

Merit: 219

Shooters Shoot...

Quote

Oh No ...

Is this 'pool' Windows based only?

I'm not sure. I know Etar used windows, but don't know if you can compile in Linux. Man was a coding genius, could put something together that he or someone needed fairly quickly, all in PureBasic.

Maybe you or one of your 'coders' can look at the code and build something for Linux. If I had the know how, I would have set up BSGS pool long ago. Zero experience with network, sockets, etc.

chrysophylax

legendary

Activity: 2814

Merit: 1091

--- ChainWorks Industries ---

Quote from: chrysophylax on March 22, 2021, 11:33:28 AM

Quote from: WanderingPhilospher on March 22, 2021, 11:12:54 AM

Quote

Till then, is there any Pool Software at all that could be setup for complete transaprency of what is being done?

Easy to setup, open source

https://github.com/Etayson/BC_server-client

Even has checks and balances of "fake" shares/submits by creating a key in each range that is checked/verified. Same as other pool.

Quote

There are ways to increase the compute power by levels of magnitude, and I know what some of those are, but need the coders to do the coding to bring these things to life.

Interested in ideas...always.

Thanks ...

Will have a look at this over the coming week.

As for connection - Skype is the best way to get me. Alternately, the CWI Discord Server in the Details Page of the Main CWI BCTThread in my Sig.

Skype - chrysophylax69

#crysx

Oh No ...

Is this 'pool' Windows based only?

Is there a linux based version, as we mainly use CentOS7 CentOS8 for our servers, which we would gladly setup for the community.

Windows is a no go for us at CWI. Never will be. EVER.

#crysx

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