How to find the first 35 digits of bitcoin private key

[seoincorporation]

This is a tricky question, but i think i have an answer for you...

If you compare the hex key:

Code:

0000000000000000000000000000000000000000000000000000000000000000

vs

Code:

0000000000000000000000000000000000000000000000000000000000000001

You will get the next Uncompressed WIF - Base58 keys:

5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAbuatmU

5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAnchuDf

As you can see the first chars are the same, so, if you want the first 35 chars to brute force the next 17 you could start from:

Code:

5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4

I have to say that not all the keys you get will be valid ones, and this is a terrible method to bruteforce the privatekeys, you should learn about softwares like brainflayer.

[1715525493]

1715525493

[1715525493]

1715525493

[1715525493]

1715525493

[pooya87]

Code:

0000000000000000000000000000000000000000000000000000000000000000

It's nitpicking but 0 is not a valid private key.

I have to say that not all the keys you get will be valid ones, and this is a terrible method to bruteforce the privatekeys, you should learn about softwares like brainflayer.

It is actually a good method although you are on the correct path but not quite there yet. What they do is to first find the minimum base58 key by setting the digits to min value and convert it to an integer. Then repeat it for the maximum to have a range. Now you can search inside that range without worrying about the base58 encoding.
This limits the search space while skipping the encoding altogether. The problem here is that 17 characters is too much. If it were around 13, it would be easily recoverable in less than an hour using this method.

[PrimeNumber7]

This is a tricky question, but i think i have an answer for you...

If you compare the hex key:

Code:

0000000000000000000000000000000000000000000000000000000000000000

vs

Code:

0000000000000000000000000000000000000000000000000000000000000001

You will get the next Uncompressed WIF - Base58 keys:

5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAbuatmU

5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAnchuDf

As you can see the first chars are the same, so, if you want the first 35 chars to brute force the next 17 you could start from:

Code:

5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4

I have to say that not all the keys you get will be valid ones, and this is a terrible method to bruteforce the privatekeys, you should learn about softwares like brainflayer.

The private key is passed through a hash function in order to calculate the address. Given the output of a hash function, it is not possible to calculate the prefix of the input. If this were possible, the hash function would be broken.

[NotATether]

You have missed the first 35 characters of your private key and now you want to calculate them? Am I getting you correctly? If so, there is no solution for that.
If you had missed a few characters, you could find them through brute-force method. But there is no way to brute-force a private key with 35 missing characters.

No - I want to know the calculation of first 35 characters in wif (compress or uncompressed) format remaining 17 will be find with brute force.

The WIF and the private key hex are not entirely congruent which means that with a given set of hex characters, you will get slightly more WIF characters than you expected to influence (think eg. The first N base58 characters and part of the next one, so:

If you have M hex characters, then you should only count on the first

floor(M*58/16)

Base58 characters on being correct.