Keyhunt - development requests - bug reports - page 12.

BS0D

newbie

Activity: 29

Merit: 0

Quote from: nomachine on July 16, 2023, 08:42:38 AM

Quote from: BS0D on May 04, 2023, 11:28:11 AM

Will there be any speed improvement using AVX2 and hugepages for CPUs? As well as L3 cache usage of ryzen cpus which in some cases may replace ram reads increasing the speed by times.

It is happen to be using a xmrig on the same machine as Keyhunt.

Is it possible to boost command from here increase the number of keys per second on AMD EPYC

https://raw.githubusercontent.com/xmrig/xmrig/dev/scripts/randomx_boost.sh

I have strange results. Grin

You may start xmrig with any randomx coin using --randomx-no-rdmsr command or rdmsr: false in config file. It would keep the msr mod enabled on exit. Quit xmrig when you see msr mod was applied and start keyhunt or whatever cpu app you want. Check the performance difference with earlier results.

Redcoinn

newbie

Activity: 14

Merit: 0

The whole thing is confusing and I think I need a simple language to understand this. I think this development gonna be interesting if well explain, am new here thanks

albert0bsd

hero member

Activity: 862

Merit: 662

Quote from: kewa07 on July 18, 2023, 08:24:48 AM

Is it possible to change the search step, for example, not 00001 - 00002 - 00003, but 01000 - 02000 - 03000 Huh

Not yet.

About the xmrig I never heard about it, I think that it can't be used for this purposes

kewa07

newbie

Activity: 7

Merit: 5

Quote from: albert0bsd on July 13, 2023, 03:37:34 PM

There is an example of the address format in the documentation, please check it.

About the speed, the hashing process for eth it is more slow than the process for Bitcoin. Also there are some calculations that can't be avoided for eth, and those calcs can be avoided for Bitcoin address then it will be more slow for eth than bitcoin

Thank you
Is it possible to change the search step, for example, not 00001 - 00002 - 00003, but 01000 - 02000 - 03000 Huh

nomachine

member

Activity: 503

Merit: 38

Quote from: BS0D on May 04, 2023, 11:28:11 AM

Will there be any speed improvement using AVX2 and hugepages for CPUs? As well as L3 cache usage of ryzen cpus which in some cases may replace ram reads increasing the speed by times.

It is happen to be using a xmrig on the same machine as Keyhunt.

Is it possible to boost command from here increase the number of keys per second on AMD EPYC

https://raw.githubusercontent.com/xmrig/xmrig/dev/scripts/randomx_boost.sh

I have strange results. Grin

NonFungibleUser

newbie

Activity: 37

Merit: 0

Alberto: https://github.com/albertobsd/keyhunt/issues/241

Also, any hints how I can make this faster?

Code:

./keyhunt -m rmd160 -f tests/unsolvedpuzzles.rmd -r 20000000000000000:ffffffffffffffffffffffffffffffffffffffff -l compress -s 5 -S -q -c btc -k 2048 -t 128 -S
[+] Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
[+] Mode rmd160
[+] Search compress only
[+] Stats output every 5 seconds
[+] Quiet thread output
[+] K factor 2048
[+] Threads : 128
[+] N = 0x100000000
[+] Range
[+] -- from : 0x20000000000000000
[+] -- to : 0xffffffffffffffffffffffffffffffffffffffff
[+] Reading file data_b7aecab7.dat
[+] Bloom filter for 10000 elements.
[+] Allocating memory for 84 elements: 0.00 MB
[+] Total 9923289088 keys in 30 seconds: ~330 Mkeys/s (330776302 keys/s)

albert0bsd

hero member

Activity: 862

Merit: 662

There is an example of the address format in the documentation, please check it.

About the speed, the hashing process for eth it is more slow than the process for Bitcoin. Also there are some calculations that can't be avoided for eth, and those calcs can be avoided for Bitcoin address then it will be more slow for eth than bitcoin

kewa07

newbie

Activity: 7

Merit: 5

Tell me how to use eth mode, when reading addresses from a file, it does not find the necessary addresses when searching, and why is the speed so low?
are there any other programs that work with address databases for ethereum? Thank you.

Ovixx

newbie

Activity: 30

Merit: 0

Quote from: NonFungibleUser on July 10, 2023, 07:17:23 AM

Where can I find these public key puzzles?

Sorry, very new in this.

#130:::::#160

Code:

03633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
02145d2611c823a396ef6712ce0f712f09b9b4f3135e3e0aa3230fb9b6d08d1e16
031f6a332d3c5c4f2de2378c012f429cd109ba07d69690c6c701b6bb87860d6640
03afdda497369e219a2c1c369954a930e4d3740968e5e4352475bcffce3140dae5
03137807790ea7dc6e97901c2bc87411f45ed74a5629315c4e4b03a0a102250c49
035cd1854cae45391ca4ec428cc7e6c7d9984424b954209a8eea197b9e364c05f6
02e0a8b039282faf6fe0fd769cfbc4b6b4cf8758ba68220eac420e32b91ddfa673

albert0bsd

hero member

Activity: 862

Merit: 662

Quote from: NonFungibleUser on July 10, 2023, 08:30:43 AM

Any output transaction? Aren't the new transaction scripts protocols avoiding exposing public keys at all? I had the idea that only in very old transactions outputs could you find public keys.

Yes any output Transaction expose the Publickey (a set of data TX script, R,S and "P" where P is the publickey ), I've not checked new Transaactions but all need to expose publickey, if the publickeys is not there maybe there is enough information to calculate the possible Keys (a set of data TX script, R,S and V, where V is some byte that can calculate the P value, just like the Ethereum network), but that is beyond of this topic.

NonFungibleUser

newbie

Activity: 37

Merit: 0

Quote from: albert0bsd on July 10, 2023, 08:16:58 AM

Quote from: NonFungibleUser on July 10, 2023, 07:17:23 AM

Where can I find these public key puzzles?

Sorry, very new in this.

Not all puzzles have it available only those that have some Output transaction.

Any output transaction? Aren't the new transaction scripts protocols avoiding exposing public keys at all? I had the idea that only in very old transactions outputs could you find public keys.

albert0bsd

hero member

Activity: 862

Merit: 662

Quote from: NonFungibleUser on July 10, 2023, 07:17:23 AM

Where can I find these public key puzzles?

Sorry, very new in this.

Not all puzzles have it available only those that have some Output transaction.

NonFungibleUser

newbie

Activity: 37

Merit: 0

Quote from: digaran on July 10, 2023, 06:59:50 AM

Quote from: NonFungibleUser on July 10, 2023, 06:36:57 AM

Quote from: GR Sasa on July 10, 2023, 06:22:53 AM

You cant use BSGS for 66. Public key is not visible. You can only use BSGS for known public keys, and the source you provide, you arent using BSGS, you are using normal -m address which refers to normal bruteforce. You need to use the -m -bsgs commandline. for BSGS fast speed

I see, thanks for explaining.

What would you recommend using in #66? -m address with 66.txt or -m rmd160 with 66.rmd? Any pros and cons of each vs the other?

Can I leverage my RAM in -m address or -m rmd160 to make it faster, or only BSGS has that benefit?

Why would you wanna waste time and energy on address only puzzles when you can spend the same time and use the same resources to search for puzzles with known public keys, either learn how to utilize bsgs for public keys or use kangaroo.

Where can I find these public key puzzles?

Sorry, very new in this.

digaran

copper member

Activity: 1330

Merit: 899

🖤😏

Quote from: NonFungibleUser on July 10, 2023, 06:36:57 AM

Quote from: GR Sasa on July 10, 2023, 06:22:53 AM

You cant use BSGS for 66. Public key is not visible. You can only use BSGS for known public keys, and the source you provide, you arent using BSGS, you are using normal -m address which refers to normal bruteforce. You need to use the -m -bsgs commandline. for BSGS fast speed

I see, thanks for explaining.

What would you recommend using in #66? -m address with 66.txt or -m rmd160 with 66.rmd? Any pros and cons of each vs the other?

Can I leverage my RAM in -m address or -m rmd160 to make it faster, or only BSGS has that benefit?

Why would you wanna waste time and energy on address only puzzles when you can spend the same time and use the same resources to search for puzzles with known public keys, either learn how to utilize bsgs for public keys or use kangaroo.

NonFungibleUser

newbie

Activity: 37

Merit: 0

Quote from: GR Sasa on July 10, 2023, 06:22:53 AM

You cant use BSGS for 66. Public key is not visible. You can only use BSGS for known public keys, and the source you provide, you arent using BSGS, you are using normal -m address which refers to normal bruteforce. You need to use the -m -bsgs commandline. for BSGS fast speed

I see, thanks for explaining.

What would you recommend using in #66? -m address with 66.txt or -m rmd160 with 66.rmd? Any pros and cons of each vs the other?

Can I leverage my RAM in -m address or -m rmd160 to make it faster, or only BSGS has that benefit?

GR Sasa

member

Activity: 194

Merit: 14

You cant use BSGS for 66. Public key is not visible. You can only use BSGS for known public keys, and the source you provide, you arent using BSGS, you are using normal -m address which refers to normal bruteforce. You need to use the -m -bsgs commandline. for BSGS fast speed

NonFungibleUser

newbie

Activity: 37

Merit: 0

Quote from: tgfx on June 05, 2023, 12:10:26 PM

another question haunts me, about the two modes:
- - normal search over the entire 66 range (./keyhunt -m rmd160 -f tests/66.rdb 66 -l compress -R -q)
- - or still bsgs by public key (./keyhunt -m bsgs -f tests/125.txt -b 125 -q -s 10 -R)
on the one hand, the 66 range is less than (total) 73786976294838206463 and the 125th is already 42535295865117307932921825928971026431
it turns out 66 I can take the number of possible keys and divide by the speed, then I will understand how much I need to search for the key.
but on the other hand, the public key search algorithm is not a simple search, how to estimate how many possible steps in bsgs?

Where did you get that 66.rdb?

NonFungibleUser

newbie

Activity: 37

Merit: 0

Hello guys, noob here, sorry:

Why don't we have a 66.pub file? So I can use BSGS?

This is my command line, and outputs, does this look good? Is it a good speed?

Code:

$ ./keyhunt -m address -f tests/66.txt -b 66 -t 128 -S
[+] Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
[+] Mode address
[+] Threads : 128
[+] Setting search for btc adddress
[+] N = 0x100000000
[+] Bit Range 66
[+] -- from : 0x20000000000000000
[+] -- to : 0x40000000000000000
[+] Reading file data_8cf4f3dc.dat
[+] Bloom filter for 10000 elements.
[+] Allocating memory for 1 elements: 0.00 MB
[+] Total 507962254336 keys in 5250 seconds: ~96 Mkeys/s (96754715 keys/s)

If I stop it does it continue where it left? What is the data_8cf4f3dc.dat file for?

JDScreesh

jr. member

Activity: 47

Merit: 13

Hello there again

Congratulations to the solver (or solvers) of the puzzle #125 Wink

12.5 BTC is an excellent prize

Now, the destination address is the same as the puzzle #120 (https://bitaps.com/3Emiwzxme7Mrj4d89uqohXNncnRM15YESs)

That make me think a lot of thinks Cheesy

tgfx

newbie

Activity: 4

Merit: 0

another question haunts me, about the two modes:
- - normal search over the entire 66 range (./keyhunt -m rmd160 -f tests/66.rdb 66 -l compress -R -q)
- - or still bsgs by public key (./keyhunt -m bsgs -f tests/125.txt -b 125 -q -s 10 -R)
on the one hand, the 66 range is less than (total) 73786976294838206463 and the 125th is already 42535295865117307932921825928971026431
it turns out 66 I can take the number of possible keys and divide by the speed, then I will understand how much I need to search for the key.
but on the other hand, the public key search algorithm is not a simple search, how to estimate how many possible steps in bsgs?

Topic: Keyhunt - development requests - bug reports - page 12. (Read 15242 times)