Project overview:
- FinderOuter public program logic change
Purpose of request:
- The purpose is to improve search speed
Target open source:
- https://github.com/Coding-Enthusiast/FinderOuter
Development environment/output:
- C#, modified source code
Requirements:
(* Please read the contents below in detail! )
Download the program and select 12 samples from the Missing Base58 item. You can find out the function of this running program
Bitcoin private key hexadecimal
0000000000000000000000000000000000000000000000003703cd141a6925b1a
When changing to compressed Base58, it is as follows
KwDiBf89QgGbjEh KnhXJuH7LrciVrZi3qZzzzurTvh1E nciUjwwC
If the private key When changing 3703cd141a6925b1a => 3703cd141a6925b10, when changing the last a ==> to 0
Base58 nciUjwwC ===> hduCAu62 You can see that 8 characters are changed
00000000000000000000000000000000000 0000000000003703cd141a6925b10
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZzzzurTvh1E hduCAu62
If you run the program directly, if you try to substitute all of the last 8 characters, the number of cases will be
52 characters * (*marked 8 characters) = 128,063,081,718,016
, but you can see that the result comes out in less than 1 second. There is
############## Execution result##############
Compressed private key missing 8 characters was detected.Total number of permutations to check: 128,063,081,718,016
Running compressed loop. Please wait.
Using an optimized method checking only 117 keys.
Total number of permutations to check: 117
Running in parallel.
Found the key: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZzzzurTvh1DzoarvwL8
Elapsed time: 00:00 :00.0567280
If you execute the following 11 characters with an * mark,
the number of cases increases exponentially. You can see that the result is output.
################11 character execution result##########
Compressed private key missing 11 characters was detected.
Total number of permutations to check: 24,986,644,000,165,537,792
Running compressed loop. Please wait.
Using an optimized method checking only 22,725,221 keys.
Total number of permutations to check: 22,725,221
Running in parallel.
Found the key: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZzzzurTuzzzzkSoB3pW
Found the key: KwDiBf8 9QgGbjEhKnhXJuH7LrciVrZi3qZzzzurTv3Z2hYW2ZTb5Found the key: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZzzzurTv674QLUafKXm
Elapsed time: 00:00:00.0017792
Then, when using 12 characters, it should come out in just a few minutes, but from 12 characters, the logic requires 52 characters and 12 * mark parts. Since the results do not come out even after a day because all
are executed, the purpose of requesting this is to correct this.
Compressed private key missing 12 characters was detected.
Total number of permutations to check : 1,449,225,352,009,601,191,936
Running compressed loop. Please wait.
Running in parallel.
• When there are 12 tables, 22,725,221 keys. * Since there are 10, the number of searches is not large, but
the current program cannot output the calculation results because it substitutes a total of 52 characters.
Even if this part is 12 characters, the goal is to complete the program by searching within 5 minutes. Watching.
I think, this working take 3 days.
It is better to share exe file that fixed this problems. Then I will pay soon after checking your exe file.
I really need your source code not exe file.
Thank you
