Post
Topic
Board Development & Technical Discussion
Re: BitCrack - A tool for brute-forcing private keys
by
Zipp_1199
on 07/11/2023, 16:16:52 UTC
Hi guys,

I was reading this thread and found it interesting. Just a few questions get in my mind:
What if I find a zero-bit privkey address? How long would it take me to find a private key for this address, knowing only the address? Is it a million years, assuming that I don't have a public key?
Can you show us what you mean by zero bit private key? If it has "zero" bits then how can you derive an address from it? But there is a solution for you, it's not related to zero or 256, you can find 2^96 different private keys for every single address out there, under one condition, you'd have to brute force 2^80 keys to find one collision.(in theory)
Without public key, only having the address and knowing the exact range, you can go ahead and try puzzle #66, even if you halve the range, you'd still need to grind 2^65 keys.😉
Sorry for confusion. I just try to understand the whole thing, that is why i am asking. For instance a wallet 1BgGZ9tcN4rm9KBzDn7KprQz87SZ26SAMH had a very simple private key of 0x0000000000000000000000000000000000000000000000000000000000000001? This means it is easy to crack it as the only thing is needed is checksum?
So if i would ever find an address with a privkey of 0x0000000000000000000000000000000000000000000000000000000000000001 but no public key - is it something i would have to run 2^65 keys to open it?