Search result

[alexfs1179]

Tell me please... I still don't get it. If the program finds a key pair, how will I know about it? Where they can be seen. In which folder, in which file? You could explain in detail and show.

[alexfs1179]

From the questions and answers described below, I still did not understand exactly where the record of the find would be made.

[bernardladenthin]

Hi, it will be shown in the console. If you are using a console pipe to a file, as shown in my examples, the output will be redirected to a file: https://github.com/bernardladenthin/BitcoinAddressFinder/blob/a8306f2dca3abc1f97cdce479a599aa98249c626/examples/run_Find_1OpenCLDevice.bat#L14

Remove the pipe and the channel forward, and you'll see everything in the console. But please keep in mind that if you have a hit and it is only in the console, it will be lost if you close the console or no longer have access to it.

[alexfs1179]

Thanks, I'll try to figure it out. Is it possible to limit the CPU usage using some settings? I would like him to complete the task with a load of 50%. Let it take longer, but in a calm mode. The result in this case is more influenced by luck, not speed. I don't use a video card, I don't want to download it. i5 8400 processor, 6 cores, 3.7 GHz.

[bernardladenthin]

You can't easily limit the CPU load. If you are using Windows, you can use the power settings to change the maximum power to something like 99% to prevent a clock burst and high energy consumption. If you just want to limit the amount, you can reduce producer threads. The consumer threads will sleep if the consumer doesn't produce key pairs fast enough.

[alexfs1179]

Thanks!

[alexfs1179]

If you can make a small clarification.. Yes, I run the program through the file " run_Find_6 CPU Producer.bat" . So you mean that in this case the result will not be written to some text file, but simply displayed in a window? I'm sorry for being stupid, I'm not a programmer..

[bernardladenthin]

You are welcome!

If you are using a run-file like this: https://github.com/bernardladenthin/BitcoinAddressFinder/blob/a8306f2dca3abc1f97cdce479a599aa98249c626/examples/run_Find_8CPUProducer.bat#L14

you are seing this line: config_Find_8CPUProducer.js >> log_Find_8CPUProducer.txt 2>&1

You can change the line to: config_Find_8CPUProducer.js

You will see every output in the console and not in the file log_Find_8CPUProducer.txt

Thats how you can switch between direct output on the console or pipe to a file.

[alexfs1179]

One last question, and I'll stop torturing you). Yes, I see these lines and I won't change anything. I will leave the recording channel in the file log_Find_8CPUProducer.txt . But earlier you said that when the keys are detected, the program continues to work. This means that this file continues to be filled with data and increases in size. Is there any understanding where exactly to look for this record, or will it be made at the very beginning?

[bernardladenthin]

Your questions are welcome. Exactly, the program is searching all the time until you stop it. You see a hit counter all the time: [Hits: 0]

For testing purposes, you can provoke a hit because there exist some addresses in the lower bit range:

https://github.com/bernardladenthin/BitcoinAddressFinder/blob/a8306f2dca3abc1f97cdce479a599aa98249c626/examples/config_Find_8CPUProducer.js#L24

As an example, change to 20 bit "privateKeyMaxNumBits" : 20

Do you see hits in your console/log?

[alexfs1179]

Thanks, I'll try to do it a little later and write the resul

[alexfs1179]

privateKeyBigInteger: [198669] privateKeyBytes: [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 8, 13]] privateKeyHex: [000000000000000000000000000000000000000000000000000000000003080d] WiF: [KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFyWkjT5fywW] publicKeyAsHex: [020ce4a3291b19d2e1a7bf73ee87d30a6bdbc72b20771e7dfff40d0db755cd4af1] publicKeyHash160Hex: [ad1e852b08eba53df306ec9daa8c643426953f94] publicKeyHash160Base58: [1GnNTmTVLZiqQfLbAdp9DVdicEnB5GoERE] Compressed: [true] Mnemonic: [abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, abandon, account, cage, predict]

Here is the result, the detection record is performed in order. This means that in a text file, which at some point will be large, I will have to try very hard to check for such an entry manually among a large array of monotonous data. I found the answer to the question that was bothering me). Thanks.

[alexfs1179]

Although it is possible to reduce the time interval for writing a report to a file. Not after 10 seconds, but for example 120.

[bernardladenthin]

Great news, you are right, just change this parameter: https://github.com/bernardladenthin/BitcoinAddressFinder/blob/a8306f2dca3abc1f97cdce479a599aa98249c626/examples/config_Find_8CPUProducer.js#L13

[alexfs1179]

Thank you, good luck to us)!

[alexfs1179]

Hi. There is such a task https://privatekeys.pw/puzzles/bitcoin-puzzle-tx Tell me, if I need to scan the private key space in the 66-bit range, do I just need to change the 256 settings to 66 in the file? And whether the lightweight address database affects the search. It's probably better to download the full version. Is your program suitable for this at all?

[bernardladenthin]

The lightweight is enough. Exactly, you can change the address range to e.g., 64 to look in 1 up to 64 bits only, where puzzle transactions will be found. Start with a range of 20 bits or smaller to test your setup first.