Topic: BitCrack - A tool for brute-forcing private keys - page 26. (Read 74618 times)
you can use binary search for this, it will be faster than " all software"
I have a question. Recently there was a flood and a notebook containing a offline wallet was damage and it destroyed part of a WIF private key, so now I basically have:
Kw**********(I have the next 40 characters, just not posting for obvious reasons), so I am missing 10 characters in all.
I also have the public key. Is it possible to use this software to start a search at Kw... and iterate over the missing 10 characters with the known 40 characters also in the key.
For example : 1GuqEWwH5iRZ89oo5xw26FqmyZFMWZrtPi - is the public address
and for the WIF private key I'd have Kw**********JzXaqU2rcFSoaLaehAQHqoQX1cWCo92tAA3ihLJ7
Any advice is appreciated and examples are even more appreciated
Thank you,
S.
Kw**********(I have the next 40 characters, just not posting for obvious reasons), so I am missing 10 characters in all.
I also have the public key. Is it possible to use this software to start a search at Kw... and iterate over the missing 10 characters with the known 40 characters also in the key.
For example : 1GuqEWwH5iRZ89oo5xw26FqmyZFMWZrtPi - is the public address
and for the WIF private key I'd have Kw**********JzXaqU2rcFSoaLaehAQHqoQX1cWCo92tAA3ihLJ7
Any advice is appreciated and examples are even more appreciated
Thank you,
S.
Hi all,
I've been working on a tool for brute-forcing Bitcoin private keys.
.....
The performance is good, but can likely be improved. On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed.
....
Thoughts?
Thanks!
I've been working on a tool for brute-forcing Bitcoin private keys.
.....
The performance is good, but can likely be improved. On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed.
....
Thoughts?
Thanks!
what I am going to say is purely theoretical, as I have never tried to brute force private keys.
I don´t think you will have any success doing this.
If you have enough hash power, you would probably make more money working as an honest node, mining.
Bitcoin protocol is secure enough. If it were brute force-able, bitcoin wouldn't be worth anything.
What i think you could do is to find a collision. If someone made an insecure private key, by just hashing some passphrase... maybe you could have some luck. I tried to do this once, but never found anything. I tried those terms like "wallet" "bitcoin". I found some addresses which used to have balances, but not anymore. But I was doing manually, like 1 address/3 minutes lol
If you could somehow at the same time check if any of those 9.4 million keys/sec have any balance in btc/bch/btg etc...
But I don't think any of that will work, and will be a waste of time and resources.
Some addresses may have no collisions at all.
It is unbelievable, but each address exists approximately 2^96 times in the whole 2^256 bit space. (2^256 / 2^160 = 2^96)So the chances that an address has no collisions at all are ~ 1 to 2^96, that means nearly zero.
We can be sure, that there are always collisions for an address.
You are right they are and there are many of them.
Some addresses may have no collisions at all.
It is unbelievable, but each address exists approximately 2^96 times in the whole 2^256 bit space. (2^256 / 2^160 = 2^96)So the chances that an address has no collisions at all are ~ 1 in 2^96, that means nearly zero.
We can be sure, that there are always collisions for an address.
I am very grateful to you for your answer
Let's say I'm still in superposition and can be at two points at the same time.
I will return to my question.
Could it be easier to find a private key when you know the twin brothers?
I don't need glory.
One way or another, everything will become the property of mankind. (or it won't.)
No. Collisions still randomly distributed throughout whole keyspace. Some addresses may have no collisions at all. I will return to my question.
Could it be easier to find a private key when you know the twin brothers?
I don't need glory.
One way or another, everything will become the property of mankind. (or it won't.)
If you find one collision, it will not help you find another collision or solve the ECDLP.
Let's say I'm still in superposition and can be at two points at the same time.
I will return to my question.
Could it be easier to find a private key when you know the twin brothers?
I don't need glory.
One way or another, everything will become the property of mankind. (or it won't.)
I will return to my question.
Could it be easier to find a private key when you know the twin brothers?
I don't need glory.
One way or another, everything will become the property of mankind. (or it won't.)
Hi to all.
I have this question.
Suppose I knew private keys and their mirrors.
Example
Key
00000000000000000000000000000000000000000000000000001234567890
His address
18CmidJphhs7WYXR4jskcHaEF8sqHXbY2Q
And his twin brother
0000000000000000000000000000000000000000000000000000XXXXXXXXXX
His address
18CmidJphhs7WYXR4jskcHaEF8sqHXbY2Q
Can this help in some way in solving and finding the private key algorithm?
Could this be a relief in finding any other way to find a private key?
I have this question.
Suppose I knew private keys and their mirrors.
Example
Key
00000000000000000000000000000000000000000000000000001234567890
His address
18CmidJphhs7WYXR4jskcHaEF8sqHXbY2Q
And his twin brother
0000000000000000000000000000000000000000000000000000XXXXXXXXXX
His address
18CmidJphhs7WYXR4jskcHaEF8sqHXbY2Q
Can this help in some way in solving and finding the private key algorithm?
Could this be a relief in finding any other way to find a private key?
You assumption is imposible, unless this would be first known collision known that two different private keys produce the same hash. So the question does not make sense, like you would asking what would be if you are at the same time at two different palces.
If this is the case, just publish this "twin brother" and you would become famous as a finder of the first collision of the Bitcoin hashes.
Hi to all.
I have this question.
Suppose I knew private keys and their mirrors.
Example
Key
00000000000000000000000000000000000000000000000000001234567890
His address
18CmidJphhs7WYXR4jskcHaEF8sqHXbY2Q
And his twin brother
0000000000000000000000000000000000000000000000000000XXXXXXXXXX
His address
18CmidJphhs7WYXR4jskcHaEF8sqHXbY2Q
Can this help in some way in solving and finding the private key algorithm?
Could this be a relief in finding any other way to find a private key?
I have this question.
Suppose I knew private keys and their mirrors.
Example
Key
00000000000000000000000000000000000000000000000000001234567890
His address
18CmidJphhs7WYXR4jskcHaEF8sqHXbY2Q
And his twin brother
0000000000000000000000000000000000000000000000000000XXXXXXXXXX
His address
18CmidJphhs7WYXR4jskcHaEF8sqHXbY2Q
Can this help in some way in solving and finding the private key algorithm?
Could this be a relief in finding any other way to find a private key?
So is this project real or fake?? I thought maybe they calculated the addresses they will find in the future and then they sent money to them and then show those addresses like "trophies"
I wasn't there at the time but others around here have reported something suspicious with them, so I wouldn't touch it with a 10-foot pole if I were you.
nah its legit whenever im short on rent i mine me some hash collisions
weeeeeIs it even still running?
So is this project real or fake?? I thought maybe they calculated the addresses they will find in the future and then they sent money to them and then show those addresses like "trophies"
I wasn't there at the time but others around here have reported something suspicious with them, so I wouldn't touch it with a 10-foot pole if I were you.
nah its legit whenever im short on rent i mine me some hash collisions
weeeee So is this project real or fake?? I thought maybe they calculated the addresses they will find in the future and then they sent money to them and then show those addresses like "trophies"
I wasn't there at the time but others around here have reported something suspicious with them, so I wouldn't touch it with a 10-foot pole if I were you.
I saw Large Bitcoin Collider project and I saw that they found their 1st address after "only" 7400 billions of keys
6bd3b27c591 = 7409811047825
So is this project real or fake?? I thought maybe they calculated the addresses they will find in the future and then they sent money to them and then show those addresses like "trophies"
Quote
The pool found a private key to f92044c7924e5525c61207972c253c9fc9f086f7 (1PiFuqGpG8yGM5v6rNHWS3TjsG6awgEGA1) as 0x6bd3b27c591. At the time of the find, there were 0 BTC on that address. This is #43 of the puzzle transaction.
I think they found 0 BTC because in the moment of collision the balance was already spent 6bd3b27c591 = 7409811047825
So is this project real or fake?? I thought maybe they calculated the addresses they will find in the future and then they sent money to them and then show those addresses like "trophies"
I think we are not scanning 2^256 but 2^160... There are 2^160 of addresses not 2^256
I took range like this
24 random 0 to F + 40 x 0
like this
e3b2c44298fc1c149afbf4c80000000000000000000000000000000000000000
I took range like this
24 random 0 to F + 40 x 0
like this
e3b2c44298fc1c149afbf4c80000000000000000000000000000000000000000
Thats a private key range not an address range.
Vanitysearch is currently the only program that scans an address space.
All other programs are searching based on private keys (which means that privkeys getting the same address is possible).
You are technically correct about this search being 2^160 though, because intricate details about public key spending mean that only the HASH160 has to match for the spend to work.
I think we are not scanning 2^256 but 2^160... There are 2^160 of addresses not 2^256
I took range like this
24 random 0 to F + 40 x 0
like this
e3b2c44298fc1c149afbf4c80000000000000000000000000000000000000000
I took range like this
24 random 0 to F + 40 x 0
like this
e3b2c44298fc1c149afbf4c80000000000000000000000000000000000000000
I use sp-hash 5
I have 2 PCs and I have around 23.800.000 targets...
Have Asus 1060 and Zotac 1060 both NVIDIA
I have a speed of 100Milions keys per second on each... so 200MKeys/s against 23.800.000 addresses
I am doing this for like few weeks.. not 24/7 but 24/6 and I scanned
371,524,951,867,394 addresses
So what do you think - should I stop doing this???
I have 2 PCs and I have around 23.800.000 targets...
Have Asus 1060 and Zotac 1060 both NVIDIA
I have a speed of 100Milions keys per second on each... so 200MKeys/s against 23.800.000 addresses
I am doing this for like few weeks.. not 24/7 but 24/6
and I scanned 371,524,951,867,394 addresses
So what do you think - should I stop doing this???
371,524,951,867,394 = 2^48.4 so I'd agree you should just stop it.
In 2^256 space you will hit on average 4865213833500680479981974160028903691313864901917670757960402689408114 unrelated addresses before you find one of your targets.
I use sp-hash 5
I have 2 PCs and I have around 23.800.000 targets...
Have Asus 1060 and Zotac 1060 both NVIDIA
I have a speed of 100Milions keys per second on each... so 200MKeys/s against 23.800.000 addresses
I am doing this for like few weeks.. not 24/7 but 24/6 and I scanned
371,524,951,867,394 addresses
So what do you think - should I stop doing this???
I have 2 PCs and I have around 23.800.000 targets...
Have Asus 1060 and Zotac 1060 both NVIDIA
I have a speed of 100Milions keys per second on each... so 200MKeys/s against 23.800.000 addresses
I am doing this for like few weeks.. not 24/7 but 24/6
and I scanned 371,524,951,867,394 addresses
So what do you think - should I stop doing this???
0x
For now, very rare to find one high-end graphics card
Does anyone use a graphics card Nvidia GTX 1650 4GB, How many key can search by bitcrack both original and sp-mod 5?
GTX 1650 better than GTX 1050Ti Right?
Does anyone use a graphics card Nvidia GTX 1650 4GB, How many key can search by bitcrack both original and sp-mod 5?
GTX 1650 better than GTX 1050Ti Right?
Jump to: