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

Ahhhh...you have to account for the start being at key 1, because there is no key 0. So you'd have to subtract 1 from your target and then calculate new stride.
I did it for you, see below:
What bitcrack version are you using? Seems like one modified by KH...

[2023-01-11.00:06:39] [Info] Compression : compressed
[2023-01-11.00:06:39] [Info] Seach mode  : ADDRESS
[2023-01-11.00:06:39] [Info] Starting at : F000000000000000 (64 bit)
[2023-01-11.00:06:39] [Info] Ending at   : FFFFFFFFFFFFFFFF (64 bit)
[2023-01-11.00:06:39] [Info] Range       : FFFFFFFFFFFFFFF (60 bit)
[2023-01-11.00:06:39] [Info] Stride      : 307DF29 (your giving hex)
[2023-01-11.00:06:39] [Info] Initializing NVIDIA GeForce RTX 3060 Ti
[2023-01-11.00:06:39] [Info] Generating 33,554,432 starting points (1280.0MB)
[2023-01-11.00:06:43] [Info] 10.0%  20.0%  30.0%  40.0%  50.0%  60.0%  70.0%  80.0%  90.0%  100.0%
[2023-01-11.00:06:46] [Info] Done
[DEV: NVIDIA GeForce R 6173/8191MB] [K: FF1B3C505C000000 (64 bit), C: 94.414932 %] [I: 307DF29 (26 bit), 1] [T: 1] [S: 899.43 MK/s] [21,407,727,616 (35 bit)] [00:00:21]
[2023-01-11.00:07:11] [Info] Reached end of keyspace

[2023-01-11.00:00:51] [Info] Compression : compressed
[2023-01-11.00:00:51] [Info] Seach mode  : ADDRESS
[2023-01-11.00:00:51] [Info] Starting at : F000000000000000 (64 bit)
[2023-01-11.00:00:51] [Info] Ending at   : FFFFFFFFFFFFFFFF (64 bit)
[2023-01-11.00:00:51] [Info] Range       : FFFFFFFFFFFFFFF (60 bit)
[2023-01-11.00:00:51] [Info] Stride      : 307DF28
[2023-01-11.00:00:52] [Info] Initializing NVIDIA GeForce RTX 3060 Ti
[2023-01-11.00:00:52] [Info] Generating 33,554,432 starting points (1280.0MB)
[2023-01-11.00:00:55] [Info] 10.0%  20.0%  30.0%  40.0%  50.0%  60.0%  70.0%  80.0%  90.0%  100.0%
[2023-01-11.00:00:57] [Info] Done
[DEV: NVIDIA GeForce R 6173/8191MB] [K: FF090D1070000000 (64 bit), C: 93.970972 %] [I: 307DF28 (26 bit), 1] [T: 1] [S: 888.86 MK/s] [21,307,064,320 (35 bit)] [00:00:21]
[2023-01-11.00:01:23] [Info] Reached end of keyspace


[2023-01-11.00:01:23] [Info] Compression : compressed
[2023-01-11.00:01:23] [Info] Seach mode  : ADDRESS
[2023-01-11.00:01:23] [Info] Starting at : 1 (1 bit)
[2023-01-11.00:01:23] [Info] Ending at   : FFFFFFFFFFFFFFFF (64 bit)
[2023-01-11.00:01:23] [Info] Range       : FFFFFFFFFFFFFFFE (64 bit)
[2023-01-11.00:01:23] [Info] Stride      : 10D05C837BFD14 (hex format of your giving number 4732695388880148)
[2023-01-11.00:01:23] [Info] Initializing NVIDIA GeForce RTX 3060 Ti
[2023-01-11.00:01:23] [Info] Generating 33,554,432 starting points (1280.0MB)
[2023-01-11.00:01:26] [Info] 10.0%  20.0%  30.0%  40.0%  50.0%  60.0%  70.0%  80.0%  90.0%  100.0%
[2023-01-11.00:01:29] [Info] Done
[2023-01-11.00:01:29] [Info] Reached end of keyspace


[2023-01-11.00:01:29] [Info] Compression : compressed
[2023-01-11.00:01:29] [Info] Seach mode  : ADDRESS
[2023-01-11.00:01:29] [Info] Starting at : 1 (1 bit)
[2023-01-11.00:01:29] [Info] Ending at   : FFFFFFFFFFFFFFFF (64 bit)
[2023-01-11.00:01:29] [Info] Range       : FFFFFFFFFFFFFFFE (64 bit)
[2023-01-11.00:01:29] [Info] Stride      : 10D05C837BFD13
[2023-01-11.00:01:29] [Info] Initializing NVIDIA GeForce RTX 3060 Ti
[2023-01-11.00:01:30] [Info] Generating 33,554,432 starting points (1280.0MB)
[2023-01-11.00:01:33] [Info] 10.0%  20.0%  30.0%  40.0%  50.0%  60.0%  70.0%  80.0%  90.0%  100.0%
[2023-01-11.00:01:36] [Info] Done
[2023-01-11.00:01:36] [Info] Reached end of keyspace

No result at all

but its working when i put known hex as stride may be i am confused how stride works

[2023-01-11.00:14:39] [Info] Compression : compressed
[2023-01-11.00:14:39] [Info] Seach mode  : ADDRESS
[2023-01-11.00:14:39] [Info] Starting at : F0000000009112D4 (64 bit)
[2023-01-11.00:14:39] [Info] Ending at   : FFFFFFFFFFFFFFFF (64 bit)
[2023-01-11.00:14:39] [Info] Range       : FFFFFFFFF6EED2B (60 bit)
[2023-01-11.00:14:39] [Info] Stride      : 10000000
[2023-01-11.00:14:39] [Info] Initializing NVIDIA GeForce RTX 3060 Ti
[2023-01-11.00:14:40] [Info] Generating 33,554,432 starting points (1280.0MB)
[2023-01-11.00:14:43] [Info] 10.0%  20.0%  30.0%  40.0%  50.0%  60.0%  70.0%  80.0%  90.0%  100.0%
[2023-01-11.00:14:45] [Info] Done
[DEV: NVIDIA GeForce R 6173/8191MB] [K: F6400000009112D4 (64 bit), C: 39.062500 %] [I: 10000000 (29 bit), 1] [T: 1] [S: 910.32 MK/s] [1,677,721,600 (31 bit)] [00:00:00]
[2023-01-11.00:14:47] [Info] Found key for address '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN'. Written to 'Found.txt'
[2023-01-11.00:14:47] [Info] Address     : 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
                             Private key : F7051F27B09112D4
                             Compressed  : yes
                             Public key  : 03100611C54DFEF604163B8358F7B7FAC13CE478E02CB224AE16D45526B25D9D4D

Lol, this is silly. It would depend on your stride and your starting position/key, I could say that 1 added to 1 continuously would eventualy equal 17799667357578236628, or 2 added to 2 would eventually equal 17799667357578236628.
But a number close to your number of: 4345621913471249; would be the number 4732695388880148. Run that as stride and see what happens...let me know.
Or you can try: 50847529 (in hex = 307DF29), if you need 32 bit or less.

Hex - f7051f27b09112d4 dec - 17799667357578236628

17799667357578236628 / 2 = in loop

result -

8.899833678789118e+18
4.449916839394559e+18
2.2249584196972795e+18
1.1124792098486397e+18
5.562396049243199e+17
2.7811980246215994e+17
1.3905990123107997e+17
6.952995061553998e+16
3.476497530776999e+16
1.7382487653884996e+16
8691243826942498.0
4345621913471249.0 (only this 2 decimal number are integer format others are float till zero)
2172810956735624.5

if i plus this integer numbers 4345621913471249 + 4345621913471249 (in loop) until reach 17799667357578236628 (f7051f27b09112d4)

the closest hex i reach

count: 4097 | found: 0 hex: 000000000000000000000000000000000000000000000000f7051f27b0911000

INT: 17799667357578235904

BTC comp:      1JcfWxUhWPCvTPYRs3J56sRefVKcppjqar

how can i get the exact decimal number which deliver me this hex   00000000000000000000000000000000000000000000000f7051f27b09112d4

it is 4345621913471249 (52 bit) but still not exact i need 32 bit or less to plus as --stride in Bitcrack until hit targeted hex..

in simple words. Someone knows such a number that when added continuously, 17799667357578236628 (f7051f27b09112d4) is obtained.

Can you explain better? thanks.

how can i know 32 bit or smaller --stride of  f7051f27b09112d4 i tried to divide these hex but result are always in float..

I don't know what do you mean by "mask generation", but for .txt file you could create .bat file to parse/loop parameter on  .txt file and then execute BitCrack.


You could create a thread on Services to seek people who can do the job.


To be more specific, those algorithm (such as Pollad's Kangoroo and BSGS) have time complexity lower than O(2^bits). For example, Pollad's Kangoroo time complexity O(sqrt(2^bits)).

HI, Who can rewrite the program so that it search for the privat keys from the file .txt ?

or mask generation


i pay....

The author of the puzzles release the publickey by doing some small spending in those puzzles. Those were solved with kangaroo or some other tools. The 120 bit puzzle and above are really big and the cost to solve those puzzles is bigger than they worth.

how is possible that high puzzles already cracked in this high bit range

70 , 75 , 80 , 85 , 90 , 95 , 100 , 105 , 110 , 115

and why 120 and 125 and 130 unsolved

thank you

It leaves out the leading zeros. So if you are looking for the longer version of this private key, it is:

00000000000000000000000000000000000000000000000000000153869ACC5B

Congratulations. You have successfully found the private key for puzzle #41.

hi
i was testing this and it found private key.
what does 153869ACC5B mean? doesn't look like a private key, its too short.


[2023-01-04.16:57:39] [Info] Found key for address '1L5sU9qvJeuwQUdt4y1eiLmquFxKjtHr3E'. Written to 'Found.txt'
[2023-01-04.16:57:39] [Info] Address     : 1L5sU9qvJeuwQUdt4y1eiLmquFxKjtHr3E
Private key : 153869ACC5B
Compressed  : yes
Public key  : 03B357E68437DA273DCF995A474A524439FAAD86FC9EFFC300183F714B0903468B

It is easy, make a python script to keep track of the ranges, and use os.system to call keyhunt with new ranges.

Regards.

i also can test keyhunt, if you tell me how to setup on windows and for #66 address. use python to keep track of your ranges, how to?

Some may use bitcrack because of the --continue option, however, a simple python script could be used instead, using keyhunt-cuda. keyhunt-cuda allows for multiple GPUs to be used together, and the speed is faster so I do not know why others use bitcrack, unless for the stride function.

I think keyhunt-cuda is the best option for #66...use python to keep track of your ranges ran or to continue. Someone just has to get lucky and land in the right zone to find the key.

puzzle 66 Address  13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so compressed or Uncompressed ??

https://github.com/albertobsd/keyhunt

i did think albertobsd developed keyhunt - sorry.
in my tests keyhunt-cuda is always showing higher performance and rate so i do not understand why some people still use bitcrack or bitcrack2

what is the best tool in term of performance rate in your opinion to use for trying to crack puzzle 66 where no pubkey is known?

If you are referring to keyhunt-cuda, albertobsd did not program it.

Why people still use bitcrack, maybe for the stride function...I'm not sure.