Quote from: kTimesG on Today at 12:30:51 PM

Quote from: brainless on Today at 11:56:39 AM

Quote from: kTimesG on October 16, 2024, 02:34:36 PM

On Nov. 1st 2024 at 0:00 AM UTC I will post here a BTC P2PKH address (compressed) associated with an 80-bits secure private key.

The address owns 0.005 BTC (~340 $)

Starting from that time, at some point during the next 24 hours an outgoing transaction, containing unspent outputs from that address, will be broadcasted on the BTC network (public mempool, not Mara).

Let's see who breaks it. I only ask one thing if that happens: what method was used to break the key.

Together with the target address I will also provide the range of the search interval.

This will be in the form (just an example):

Code:

minKey = 0xf2e542b46066c4e6f91abc80000000000000000000185e689447431d74c5b133
maxKey = 0xf2e542b46066c4e6f91abcbfffffffffffffffffffd85e689447431d74c5b133

The Hamming length of the range will therefore be 80 contiguous bits, but they may start anywhere.

If your first instinct is to yell "this is not a 80-bits secure private key", please note this competition is NOT for you, do not expect a response from me.

Get your tools ready boys.

Don't mind KtimesG
If I think about your mention line

"Let's see who breaks it. I only ask one thing if that happens: what method was used to break the key.
"
If some one break, there will no money till they explain you about breaking method, then you will release money
If it's Yes
May I think
It's same old strategy, like happen at telegram groups, some one post challenge with 10k, one guy pick message and post at discord groups for 200 bucks, upon solution finding, result some one break, and person ask write him for post method in private message, for release his award
Maybe this is similar game

The only strategy is the one explained in my post, there are no hidden tricks, it just needs to be read very very carefully - all the people here failed to 100% correctly see that, I will explain why after it is over. If someone cracks the key, replaces the TX, wins the competition. It would be nice though to let me/us know what method he used (I only care about the algorithm).

One last hint: secp256k1 is a modular group. Don't expect that all existing tools take this into consideration fully.

For solving this challenge required simple math and 1 gpu 4xxx,
5 second for math and max 15 min at gpu