I also think it is unfair to say its malware or scam with warning so early.
Maybe Etar can say what his intentions are for creating this topic here?
Topic: brute-forcing public keys at amazing speed 2.2 PH/s on CPU [malware warning] - page 11. (Read 3490 times)
April 08, 2020, 04:21:35 PM
April 08, 2020, 01:31:33 PM
It is known that due to pollard kanagaroo method it is possible to perform less bruteforce operations. And roughly it is square root from the total length.
This is actually an interesting concept so I looked it up. It basically computes two sets of numbers, one set for each side of the xy = m equation. Later elements in the set are derived from earlier elements, and sometimes this will not find a collision between two elements in the same position of the two sets. I wonder if the regions/domains of x that will be missed is known, or at least if there have been studies about this.
April 08, 2020, 09:47:44 AM
Etar, you are funny person.
Yes, you just overestimate the rate. It is known that due to pollard kanagaroo method it is possible to perform less bruteforce operations. And roughly it is square root from the total length.
You just count the operations which are not actually performed. You use the method which is good due to birthday paradox. However, due to this methond you just need less operations.
So, your actual speed is not 2.2Ph/s but the square root from this amount, i.e. approx. 47 Mh/s in total.
Yes, you just overestimate the rate. It is known that due to pollard kanagaroo method it is possible to perform less bruteforce operations. And roughly it is square root from the total length.
You just count the operations which are not actually performed. You use the method which is good due to birthday paradox. However, due to this methond you just need less operations.
So, your actual speed is not 2.2Ph/s but the square root from this amount, i.e. approx. 47 Mh/s in total.
This is what we try to explain since the beginning of this post.
April 08, 2020, 09:47:05 AM
Etar, you are funny person.
Yes, you just overestimate the rate. It is known that due to pollard kanagaroo method it is possible to perform less bruteforce operations. And roughly it is square root from the total length.
You just count the operations which are not actually performed. You use the method which is good due to birthday paradox. However, due to this methond you just need less operations.
So, your actual speed is not 2.2Ph/s but the square root from this amount, i.e. approx. 47 Mh/s in total.
You can write your vision of speed in example#2 in https://bitcointalksearch.org/topic/m.54181362Yes, you just overestimate the rate. It is known that due to pollard kanagaroo method it is possible to perform less bruteforce operations. And roughly it is square root from the total length.
You just count the operations which are not actually performed. You use the method which is good due to birthday paradox. However, due to this methond you just need less operations.
So, your actual speed is not 2.2Ph/s but the square root from this amount, i.e. approx. 47 Mh/s in total.
If we start from private key 0x01 with my algorithm and you with your algorithm where hashrate is 66Mg/s than i found same public key in million times faster than you. Do you agree with me?
V=S/t If i passed the range S in 2315681358314736639 privatkey values and T=8411seconds i can easy get V = 2315681358314736639/8411 = 275315819559474 keys/s
Or you have a different vision of this formula, different from the rest of the world
April 08, 2020, 09:41:52 AM
Etar, you are funny person.
Yes, you just overestimate the rate. It is known that due to pollard kanagaroo method it is possible to perform less bruteforce operations. And roughly it is square root from the total length.
You just count the operations which are not actually performed. You use the method which is good due to birthday paradox. However, due to this methond you just need less operations.
So, your actual speed is not 2.2Ph/s but the square root from this amount, i.e. approx. 47 Mh/s in total.
Yes, you just overestimate the rate. It is known that due to pollard kanagaroo method it is possible to perform less bruteforce operations. And roughly it is square root from the total length.
You just count the operations which are not actually performed. You use the method which is good due to birthday paradox. However, due to this methond you just need less operations.
So, your actual speed is not 2.2Ph/s but the square root from this amount, i.e. approx. 47 Mh/s in total.
April 08, 2020, 09:37:24 AM
There is no computer processor in existence that has a rate of Petahertz per second, because of Moore's law. All modern processors today have a max turbo speed of around 5GHz per thread and even that can only be sustained for a short amount of time and then it reverts to it's base speed of around 2.5 GHz per thread. Since you're assuming this can be done on personal computers, even if you have say 8 cores then that's only a combined base speed of a little more than 16GHz per second.
And even then these numbers are just for CPU instructions, the process of finding a SHA256(SHA256(x)) hash has severely lower rates than what I posted.
Look at this table here https://en.bitcoin.it/wiki/Non-specialized_hardware_comparison. Look at the Mhash/s column, every processor listed only has megahash speed.
No, it doesn't. According to the link I just posed, double Xeon E5-2690 processors (in the same family as 2680, since 2680 isn't on the list) has a listed hashrate of 66 Mhash/s. So it's safe to assume a single Xeon E5-2680 can do 33 Mhash/s for the entire processor.
This screenshot looks like you hacked up a visual basic program and coded it to print sketchy results. 55 TH/s sounds very dodgy, like you're using an Antminer S17 with 56 TH/s as the mining source instead.
And even then these numbers are just for CPU instructions, the process of finding a SHA256(SHA256(x)) hash has severely lower rates than what I posted.
Look at this table here https://en.bitcoin.it/wiki/Non-specialized_hardware_comparison. Look at the Mhash/s column, every processor listed only has megahash speed.
You know that CPU XEON 2680v2 can brute-force public key (secp256k1 curve) at speed 55TH/s per thread
No, it doesn't. According to the link I just posed, double Xeon E5-2690 processors (in the same family as 2680, since 2680 isn't on the list) has a listed hashrate of 66 Mhash/s. So it's safe to assume a single Xeon E5-2680 can do 33 Mhash/s for the entire processor.
This screenshot looks like you hacked up a visual basic program and coded it to print sketchy results. 55 TH/s sounds very dodgy, like you're using an Antminer S17 with 56 TH/s as the mining source instead.
Move away from gigahertz, look more abstractly...
if you need, for example, to get 2^2 and then 2^3 .. you can of course go by adding or multiplying or even raising to a power)) and spend a lot of processor time on it.
Or you can just shift the bit to the left.
In both case you get the same result. but spend a miserable resource on it.
And ofcourse i will say that second way will much more efficiency and speed is faster!
April 08, 2020, 09:13:18 AM
Not clear from that post, sorry.
Is your "one operation" the EC calculation of the public key for one private key or EC points addition?
It looks like you just overestimate your calculation power adding the operations that are not really performed.
I will give a final explanation of how this works.
***************************************
Imagine a house with 5 rooms. Each room has 200 people. All people have different non-repeating names.
Your task is to find David. You can go around every room, go up to every person and ask his name David or not.
In this way, you will find David by tomorrow's best.
Or you can do otherwise. Shout the whole name David to the whole room; if David responds, then he is found; if not, then go to another room.
For example, you spent 1 second on the first, second, third and fourth rooms and there was no David anywhere.
You go to the fifth room, shout out a name and get a response from David. in 1 second
A total of 5 seconds of time was spent. 1 second per room. there were a total of 1000 people.
V=1000/5=200person/s
***************************************
Resul the same in both way - We found Devid. in first way in a day, in second way in 5s.
If you do not agree, then write what speed for the second example according to your
You can tell anything, that this speed is impossible and so on. I say that if we need found private key of known public key than my algoritm will fast than algorithm where hashrate of 66 Mhash/s )) in millions times. And that is final explanation
April 08, 2020, 09:08:06 AM
There is no computer processor in existence that has a rate of Petahertz per second, because of Moore's law. All modern processors today have a max turbo speed of around 5GHz per thread and even that can only be sustained for a short amount of time and then it reverts to it's base speed of around 2.5 GHz per thread. Since you're assuming this can be done on personal computers, even if you have say 8 cores then that's only a combined base speed of a little more than 16GHz per second.
And even then these numbers are just for CPU instructions, the process of finding a SHA256(SHA256(x)) hash has severely lower rates than what I posted.
Look at this table here https://en.bitcoin.it/wiki/Non-specialized_hardware_comparison. Look at the Mhash/s column, every processor listed only has megahash speed.
No, it doesn't. According to the link I just posed, double Xeon E5-2690 processors (in the same family as 2680, since 2680 isn't on the list) has a listed hashrate of 66 Mhash/s. So it's safe to assume a single Xeon E5-2680 can do 33 Mhash/s for the entire processor.
This screenshot looks like you hacked up a visual basic program and coded it to print sketchy results. 55 TH/s sounds very dodgy, like you're using an Antminer S17 with 56 TH/s as the mining source instead.
And even then these numbers are just for CPU instructions, the process of finding a SHA256(SHA256(x)) hash has severely lower rates than what I posted.
Look at this table here https://en.bitcoin.it/wiki/Non-specialized_hardware_comparison. Look at the Mhash/s column, every processor listed only has megahash speed.
You know that CPU XEON 2680v2 can brute-force public key (secp256k1 curve) at speed 55TH/s per thread
No, it doesn't. According to the link I just posed, double Xeon E5-2690 processors (in the same family as 2680, since 2680 isn't on the list) has a listed hashrate of 66 Mhash/s. So it's safe to assume a single Xeon E5-2680 can do 33 Mhash/s for the entire processor.
This screenshot looks like you hacked up a visual basic program and coded it to print sketchy results. 55 TH/s sounds very dodgy, like you're using an Antminer S17 with 56 TH/s as the mining source instead.
April 08, 2020, 07:50:51 AM
-snip-
I told that programm can brutforce keys to find public key with speed 2.2Ph on xeon.
-snip-
I told that programm can brutforce keys to find public key with speed 2.2Ph on xeon.
-snip-
Can you please explain pelease what kind of operation you mean by 1 hash?
2.2Ph/s means 2,200,000,000,000,000 h/s
So what is your "one operation"?
And you will understand what "one operation" mean. Thanks!
Not clear from that post, sorry.
Is your "one operation" the EC calculation of the public key for one private key or EC points addition?
It looks like you just overestimate your calculation power adding the operations that are not really performed.
April 08, 2020, 07:42:25 AM
-snip-
I told that programm can brutforce keys to find public key with speed 2.2Ph on xeon.
-snip-
I told that programm can brutforce keys to find public key with speed 2.2Ph on xeon.
-snip-
Can you please explain pelease what kind of operation you mean by 1 hash?
2.2Ph/s means 2,200,000,000,000,000 h/s
So what is your "one operation"?
And you will understand what "one operation" mean. Thanks!
April 08, 2020, 07:41:28 AM
I am not talking that programm can found public key with criteria like 192 leading zeros or something.
If your program could actually do what you claimed-- evaluate 2.2 petakeys per second, then it could find keys whos pubkeys have 60-bit leading zeros quite quickly. Quote
Read carefully!
I told that programm can brutforce keys to find public key with speed 2.2Ph on xeon.
if you know public key than YES program can found private key from this public key after some time...
But this time depends only how far the starting private key from the desired..
Do you see the difference in your task and what I write?
I told that programm can brutforce keys to find public key with speed 2.2Ph on xeon.
if you know public key than YES program can found private key from this public key after some time...
But this time depends only how far the starting private key from the desired..
Do you see the difference in your task and what I write?
But instead you demand a starting point _and_ a public key (rather than, e.g. a key hash). Which means you cannot actually do what you claim, because you need to compute a point difference in order to use a precomputed table. One we consider that, instead what you claim is not impressive-- it is outright slow.
Assuming that the pubkey isn't available for that challenge payment-- go solve it. It's worth several thousand dollars, so if you could actually operate at the speed you could you wouldn't be wasting my time, you'd be collecting the bounty.
Or go start at key 1, within 2^64 operations you will find a pubkey that begins with 60 zero bits with very high likelihood.
April 08, 2020, 07:38:40 AM
-snip-
I told that programm can brutforce keys to find public key with speed 2.2Ph on xeon.
-snip-
I told that programm can brutforce keys to find public key with speed 2.2Ph on xeon.
-snip-
Can you please explain pelease what kind of operation you mean by 1 hash?
2.2Ph/s means 2,200,000,000,000,000 h/s
So what is your "one operation"?
April 08, 2020, 07:33:05 AM
Seems you realy do not understand))
I talk about brutforce (you know what is this?) and you are trying to impose a search for an incomprehensible pubkey that I can look for years.
No I am talking about finding the private key for ANY pubkey which matches a particular criteria: one where the first 60 bits are zero, so that it will take on average 2^60 operations to find it.I talk about brutforce (you know what is this?) and you are trying to impose a search for an incomprehensible pubkey that I can look for years.
I told that programm can brutforce keys to find public key with speed 2.2Ph on xeon.
if you know public key than YES program can found private key from this public key after some time...
But this time depends only how far the starting private key from the desired..
Do you see the difference in your task and what I write?
April 08, 2020, 07:24:47 AM
1Ph/s speed is roughly 2^66 per 24 hours.
There is a bitcoin address with 0.64BTC and 64bit private key. You need 2^63 operations to bruteforce it.
If you have real speed 2^66 per 24 hours, so you can perform 2^63 operations juts for 24/(2^3)=3 hours.
So, welcome to prove your speed: just take 0.64BTC from this address: https://www.blockchain.com/btc/address/16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
The private key for this address is in the range: 0x8000000000000000 - 0xffffffffffffffff (64bit key, i.e. with 192 leading zeros)
There is a bitcoin address with 0.64BTC and 64bit private key. You need 2^63 operations to bruteforce it.
If you have real speed 2^66 per 24 hours, so you can perform 2^63 operations juts for 24/(2^3)=3 hours.
So, welcome to prove your speed: just take 0.64BTC from this address: https://www.blockchain.com/btc/address/16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
The private key for this address is in the range: 0x8000000000000000 - 0xffffffffffffffff (64bit key, i.e. with 192 leading zeros)
Funny challenge
but the public key is not exposed there ? If no, you need to hash... April 08, 2020, 07:22:43 AM
Seems you realy do not understand))
I talk about brutforce (you know what is this?) and you are trying to impose a search for an incomprehensible pubkey that I can look for years.
No I am talking about finding the private key for ANY pubkey which matches a particular criteria: one where the first 60 bits are zero, so that it will take on average 2^60 operations to find it.I talk about brutforce (you know what is this?) and you are trying to impose a search for an incomprehensible pubkey that I can look for years.
Quote
look at fist post, i talk about brutforce speed, i am not talking that i can found ANY public key for 1hour or 1day
Your first post said a speed of 2.2 PH/s.Quote
and what does 60 bit have to do with it?
1 day with speed 1ph it is 10^15*86400 points total = 86400000000000000000
2^60 it is 1152921504606846976 you see difference between numbers?
86400000000000000000 79 times bigger than 2^60
And I suggested two days.1 day with speed 1ph it is 10^15*86400 points total = 86400000000000000000
2^60 it is 1152921504606846976 you see difference between numbers?
86400000000000000000 79 times bigger than 2^60
You should be able to find a key matching the property I described in about 2 days at 2.2PH/s.
April 08, 2020, 07:20:21 AM
1Ph/s speed is roughly 2^66 per 24 hours.
There is a bitcoin address with 0.64BTC and 64bit private key. You need 2^63 operations to bruteforce it.
If you have real speed 2^66 per 24 hours, so you can perform 2^63 operations juts for 24/(2^3)=3 hours.
So, welcome to prove your speed: just take 0.64BTC from this address: https://www.blockchain.com/btc/address/16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
The private key for this address is in the range: 0x8000000000000000 - 0xffffffffffffffff (64bit key, i.e. with 192 leading zeros)
Give me public key of this address (64bytes) There is a bitcoin address with 0.64BTC and 64bit private key. You need 2^63 operations to bruteforce it.
If you have real speed 2^66 per 24 hours, so you can perform 2^63 operations juts for 24/(2^3)=3 hours.
So, welcome to prove your speed: just take 0.64BTC from this address: https://www.blockchain.com/btc/address/16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
The private key for this address is in the range: 0x8000000000000000 - 0xffffffffffffffff (64bit key, i.e. with 192 leading zeros)
April 08, 2020, 07:18:55 AM
1Ph/s speed is roughly 2^66 per 24 hours.
There is a bitcoin address with 0.64BTC and 64bit private key. You need 2^63 operations to bruteforce it.
Man, why you gotta tell me this at 5am when I'm too tired to go actually attempt collect it. I'm going to guess the pubkey isn't available, or otherwise this would have already been solved. There is a bitcoin address with 0.64BTC and 64bit private key. You need 2^63 operations to bruteforce it.
April 08, 2020, 07:13:40 AM
1Ph/s speed is roughly 2^66 per 24 hours.
There is a bitcoin address with 0.64BTC and 64bit private key. You need 2^63 operations to bruteforce it.
If you have real speed 2^66 per 24 hours, so you can perform 2^63 operations juts for 24/(2^3)=3 hours.
So, welcome to prove your speed: just take 0.64BTC from this address: https://www.blockchain.com/btc/address/16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
The private key for this address is in the range: 0x8000000000000000 - 0xffffffffffffffff (64bit key, i.e. with 192 leading zeros)
There is a bitcoin address with 0.64BTC and 64bit private key. You need 2^63 operations to bruteforce it.
If you have real speed 2^66 per 24 hours, so you can perform 2^63 operations juts for 24/(2^3)=3 hours.
So, welcome to prove your speed: just take 0.64BTC from this address: https://www.blockchain.com/btc/address/16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
The private key for this address is in the range: 0x8000000000000000 - 0xffffffffffffffff (64bit key, i.e. with 192 leading zeros)
April 08, 2020, 07:01:29 AM
I think yo do not understand what are you talking...
Clearly you're looking to fool people who don't, sadly for you I'm not one of them. Though the fact that you don't recognize that I do is odd...Quote
Give me public key what ever you whant and give me start private key with whom I can find public key for 1 day with speed 1Ph/s
This is exactly the same as what you offered above-- you just offset the starting position of the interior step.In what you describe, I choose x and y so that their difference is 60-ish bits. Then I give you y and xG. You would compute yG - xG and begin adding steps of the 2 x table_size * G to it and looking up the result in the table. Once you find a hit, you add the table position, the loop offset, and the y value to yield x.
What I described to you -- finding a private key whos pubkey begins with a long fixed string is an actual test of performance. To make it a better test, instead of zeros (which you could have precomputed over weeks or months) it would be better to use the hash of a recent block hash to bound the starting time.
But zeros would be good enough for the discussion here.I'm sure if you got anywhere near a 68 bit chosen prefix in two days you'd be setting a world record in "purebasic" computation for sure.
I talk about brutforce (you know what is this?) and you are trying to impose a search for an incomprehensible pubkey that I can look for years.
look at fist post, i talk about brutforce speed, i am not talking that i can found ANY public key for 1hour or 1day
and what does 60 bit have to do with it?
1 day with speed 1ph it is 10^15*86400 points total = 86400000000000000000
2^60 it is 1152921504606846976 you see difference between numbers?
86400000000000000000 79 times bigger than 2^60
April 08, 2020, 06:53:42 AM
@Etar
Your tests does not prove anything.
If you want to prove your key rate, follow the test given by gmaxwell.
If you manage to get 275313 GKey/s , you should be able to find a public key (and its corresponding private key) with a X starting with ~60 zero bits in 1 hour, (~64 bits in 1 day)
And to be sure that you didn't make any precomputation we should choice a random starting key.
Your tests does not prove anything.
If you want to prove your key rate, follow the test given by gmaxwell.
If you manage to get 275313 GKey/s , you should be able to find a public key (and its corresponding private key) with a X starting with ~60 zero bits in 1 hour, (~64 bits in 1 day)
And to be sure that you didn't make any precomputation we should choice a random starting key.
Jump to: