Bitcoin puzzle transaction ~32 BTC prize to who solves it

[WanderingPhilospher]

I think you misunderstood my point, if I was able to know the second character easily ecc would be broken.
just my script takes

pk1=20540573305730573

and convert it for example to

pk2= 3305730573

to know the first digits you would need to know pk2.

all this without the need to save millions of results.
  my problem is that my computer basically runs out of power to reduce more. due to stress and hangs

I think everyone misunderstands what you are talking about because you have not given a clear and concise definition of what you are doing/talking about.

It would even be better if you can show an example. Not of your code, but an example of how your code works.

Example:

I start with private key x or public key b and do this
Then I do this
Next I do this

etc.

[mcdouglasx]

Ok, lets test your script without you revealing it to the public, just drop the first 2 characters on the left for this public key's private key :

03cefd304a9a8da40666e97b2d9650e31a71a9a9fcd29a24724d31a2fabbc8ea0e

Do you need the exact range or not? It has 32 characters and it starts with F, just drop the second character and give me the public key for it to verify, that could help a lot for others to believe you.

I did not understand your proposal very well regarding the range of your pk

but for example if you eliminate the first 2 digits of your pk in decimal and generate another pubkey you will possibly get a pubkey that starts (although I recommend explaining the range better):

1= 03941029...
2=02caf96e4..

After I know what your pubkey is, I get the rest of the digits.

without the need to generate millions of keys.

Only hex, I don't work with decimal or binary.

Mathematical problems are solved in decimals, if you work in hex or binary you will only confuse your research, once you get results you apply the conversions, if you work in hex or binary you overlook important details such as the sum of the Y coordinates of a mirrored pubkey (negative) Y+(-Y) always equals

P= 2**256 - 2**32 - 2**9 - 2**8 - 2**7 -2**6 - 2**4 - 1
In
03cefd304a9a8da40666e97b2d9650e31a71a9a9fcd29a24724d31a2fabbc8ea0e
02cefd304a9a8da40666e97b2d9650e31a71a9a9fcd29a24724d31a2fabbc8ea0e

or why? these pk share the same X coordinates.

57896044618658097711785492504343953926418782139537452191302581570759080747172

57896044618658097711785492504343953926418782139537452191302581570759080747165

[mcdouglasx]

I think you misunderstood my point, if I was able to know the second character easily ecc would be broken.
just my script takes

pk1=20540573305730573

and convert it for example to

pk2= 3305730573

to know the first digits you would need to know pk2.

all this without the need to save millions of results.
  my problem is that my computer basically runs out of power to reduce more. due to stress and hangs

I think everyone misunderstands what you are talking about because you have not given a clear and concise definition of what you are doing/talking about.

It would even be better if you can show an example. Not of your code, but an example of how your code works.

Example:

I start with private key x or public key b and do this
Then I do this
Next I do this

etc.

if I have a pub key that represents an unknown pk1
pk1=957273957373958372947

my script reduces the bits for example to

pk2=958372947
that is, remove the first 12 numbers for the example.

Among approximately 1500 keys there is one of them true that corresponds, I look for the key by brute force and once I get pk2 it is easy to deduce the private key of pk1

[batareyka]

Ok, lets test your script without you revealing it to the public, just drop the first 2 characters on the left for this public key's private key :

03cefd304a9a8da40666e97b2d9650e31a71a9a9fcd29a24724d31a2fabbc8ea0e

Do you need the exact range or not? It has 32 characters and it starts with F, just drop the second character and give me the public key for it to verify, that could help a lot for others to believe you.

I did not understand your proposal very well regarding the range of your pk

but for example if you eliminate the first 2 digits of your pk in decimal and generate another pubkey you will possibly get a pubkey that starts (although I recommend explaining the range better):

1= 03941029...
2=02caf96e4..

After I know what your pubkey is, I get the rest of the digits.

without the need to generate millions of keys.

I was very clear, I gave you my public key, and my private key has 32 hex characters starting with F, I just want you to drop the second character with your first try since there are only 16 possible answers, if your script works, you should be able to drop the second char from my private key.

Only hex, I don't work with decimal or binary.

I think you misunderstood my point, if I was able to know the second character easily ecc would be broken.
just my script takes

pk1=20540573305730573

and convert it for example to

pk2= 3305730573

to know the first digits you would need to know pk2.

all this without the need to save millions of results.
  my problem is that my computer basically runs out of power to reduce more. due to stress and hangs

It is not necessary to reduce by so much pk2= 3305730573
Even one character is enough if you can reduce it clearly by 1 digit.
pk2= 3 this is more than enough.

[WanderingPhilospher]

I think you misunderstood my point, if I was able to know the second character easily ecc would be broken.
just my script takes

pk1=20540573305730573

and convert it for example to

pk2= 3305730573

to know the first digits you would need to know pk2.

all this without the need to save millions of results.
  my problem is that my computer basically runs out of power to reduce more. due to stress and hangs

I think everyone misunderstands what you are talking about because you have not given a clear and concise definition of what you are doing/talking about.

It would even be better if you can show an example. Not of your code, but an example of how your code works.

Example:

I start with private key x or public key b and do this
Then I do this
Next I do this

etc.

if I have a pub key that represents an unknown pk1
pk1=957273957373958372947

my script reduces the bits for example to

pk2=958372947
that is, remove the first 12 numbers for the example.

Among approximately 1500 keys there is one of them true that corresponds, I look for the key by brute force and once I get pk2 it is easy to deduce the private key of pk1

Ok, so what is needed for you to test this at larger bits? You mentioned 103 bit range, can you run there or do you need additional resources? If so, what are you using, Bitcrack, Kangaroo, BSGS, or a mere python code?

[sssergy2705]

There is even a way to find out the range in which the key is located, ...

Really? So tell us what the range is where #66 is lying

I apologize for not providing clarification.
You can find out the range from the public key.

Then it will not be difficult for you to determine in what range this public key is located.
0359c777fb4a0bf9c16ba308259eb4f5ef2abfd2928a8f499cbdc47300f9dcb8d5

What strange people.
You don't take my word for it, you always want confirmation.
And then this and this.

I regret that I again fell into the trap I fell into a year ago on the same forum. Everyone laughed at me.
No more comments.
Good luck to everyone.





1000000000000000000000000000000000000000
F000000000000000000000000000000000000000

8000000000000000000000000000000000000023

I don't understand how, but you're absolutely right.
But could you share a way to determine the range?
At least a hint.

[ripemdhash]

@batareyka:

hi can you explain how can you calculate the range of public keys?

and please setup allowed for received messages from all

[GoldTiger69]

There is even a way to find out the range in which the key is located, ...

Really? So tell us what the range is where #66 is lying

I apologize for not providing clarification.
You can find out the range from the public key.

Then it will not be difficult for you to determine in what range this public key is located.
0359c777fb4a0bf9c16ba308259eb4f5ef2abfd2928a8f499cbdc47300f9dcb8d5

What strange people.
You don't take my word for it, you always want confirmation.
And then this and this.

I regret that I again fell into the trap I fell into a year ago on the same forum. Everyone laughed at me.
No more comments.
Good luck to everyone.





1000000000000000000000000000000000000000
F000000000000000000000000000000000000000

8000000000000000000000000000000000000023

I don't understand how, but you're absolutely right.
But could you share a way to determine the range?
At least a hint.

If you can determine the range of the private key from it's public key, ECC is broken. So, I don't believe that, yet.

[albert0bsd]

If you can determine the range of the private key from it's public key, ECC is broken. So, I don't believe that, yet.

Exactly, to determine the range, it mean determine one single bit position and that with the correct math operations can solve any key, so it is hard to believe

[sssergy2705]

If you can determine the range of the private key from it's public key, ECC is broken. So, I don't believe that, yet.

Exactly, to determine the range, it mean determine one single bit position and that with the correct math operations can solve any key, so it is hard to believe

But he correctly identified the range.
https://privatekeys.pw/key/0000000000000000000000008000000000000000000000000000000000000023#public

[GoldTiger69]

If you can determine the range of the private key from it's public key, ECC is broken. So, I don't believe that, yet.

Exactly, to determine the range, it mean determine one single bit position and that with the correct math operations can solve any key, so it is hard to believe

But he correctly identified the range.
https://privatekeys.pw/key/0000000000000000000000008000000000000000000000000000000000000023#public

Then he must be the one who solved #120 and #125; otherwise, he is missing on the "prizes"

[ripemdhash]

or what is more trully:

batareyka and sssergy2705 -> two nicks but one person

[GoldTiger69]

if I have a pub key that represents an unknown pk1
pk1=957273957373958372947

my script reduces the bits for example to

pk2=958372947
that is, remove the first 12 numbers for the example.

Among approximately 1500 keys there is one of them true that corresponds, I look for the key by brute force and once I get pk2 it is easy to deduce the private key of pk1

@mcdouglasx: Hey man, please don't be offended by my request, but can you please give me the pubkeys that your script generate out of this pubkey?  

0343b7d69e8372746596980d678d6cdecbffb2927916b3dbd3bc3d27bf5366b166

You can send me a DM with the results, I'm trying to make a test.

Thanks in advance, cheers!.

[citb0in]

you ignored my question, which proves that you cannot answer it plausibly.

There is even a way to find out the range in which the key is located, ...

Really? So tell us what the range is where #66 is lying

I apologize for not providing clarification.
You can find out the range from the public key.

There is even a way to find out the range in which the key is located, ...

Really? So tell us what the range is where #66 is lying

Currently you are just one of hundreds of messiahs and wannabe bitcoin crackers who just post nonsense. Probably on top of that an awkwardly programmed forum bot. Until you prove otherwise, you remain a "smartass". Here are some posts of you before Jan/19th/2021:

https://bitcointalk.org/index.php?action=profile;u=3342959;sa=showPosts

Just as an aside, here are your posts: other than the current one since yesterday, you last posted in January 2019. One read through your questions 2.5 years of radio silence before you speak up again here in this thread. A rogue who thinks evil

Not meening offending, just being honest. Good luck in improving your chat bot algorithm

[vhh]

There is even a way to find out the range in which the key is located, ...

Really? So tell us what the range is where #66 is lying

Not to be a smart pants, but the question is silly and the answer will follow the question :  #66 lies somewhere between 0x20000000000000000 and 0x3ffffffffffffffff .

If you can determine the range of the private key from it's public key, ECC is broken. So, I don't believe that, yet.

Exactly, to determine the range, it mean determine one single bit position and that with the correct math operations can solve any key, so it is hard to believe

Totally agree with GoldTiger69 and albert0bsd here! One single bit position will break ECC!

[batareyka]

you ignored my question, which proves that you cannot answer it plausibly.

There is even a way to find out the range in which the key is located, ...

Really? So tell us what the range is where #66 is lying

I apologize for not providing clarification.
You can find out the range from the public key.

There is even a way to find out the range in which the key is located, ...

Really? So tell us what the range is where #66 is lying

Currently you are just one of hundreds of messiahs and wannabe bitcoin crackers who just post nonsense. Probably on top of that an awkwardly programmed forum bot. Until you prove otherwise, you remain a "smartass". Here are some posts of you before Jan/19th/2021:

https://bitcointalk.org/index.php?action=profile;u=3342959;sa=showPosts

Just as an aside, here are your posts: other than the current one since yesterday, you last posted in January 2019. One read through your questions 2.5 years of radio silence before you speak up again here in this thread. A rogue who thinks evil

Not meening offending, just being honest. Good luck in improving your chat bot algorithm

I will break my word and answer once and only to you because you resorted to insults that are not justified.
In order .
1. I told you that it is impossible to assign a range to the 66th key with hash160 (I do not know such a technique). And there is no open key to number 66.
2. You want to get an algorithm, because you think that there is a grail behind it. There is no grail behind him either.
3. You resorted to searching for my messages for the entire period in order to slander me and justify your supremacy, that you are right and I am still a fraud, which will very much calm your dryness.
It is your right to do so.
But if you read my messages, you noticed that I asked there if I know two different private keys that form the same public key and everything is the same up to the address, whether it is possible to damage the integrity of the curve. I received the answer that no. But everyone immediately, as now, was bombarded with questions, how did you find it, tell us and things like that, when I refused, everyone started calling me a fraud, just like now. Surely the human essence, if it does not get what it wants, then it resorts to insults.
Then I had to ask the moderator to delete the message because there was a very large amount of slander and insults. Now it turns out that this is exactly what should be done.
4. As for why I didn't write for so long, everything is simple.
After the slander, I took a break and had lunch on my soul.
and if you notice again, my last message was January 19, 2022, a month later, the war began.
So I live in a country where war has been going on for more than 500 days.
Somehow it was not as written between shelling and bombs.
Now I have calmed down a bit, so I decided to look at the forum and write, and everyone has already seen what happened.
On the one hand, you are being bombarded, on the other hand, they are insulting you. An ideal picture of the universe.

PS
There will be no further answers. Anyone who wants can write anything, even insults in my direction, if it will make him feel better and he will please his pride, please.
If the moderator deems it necessary, he can delete my posts so that they do not give rise to further insults in my direction and deviation of the forum topic from the main goal.

Thank you to everyone who understood my answer.
All my posts written above in no way intended to offend or humiliate any of the forum members or visitors.
Thanks for the peace everyone.

[btcmitko]

There is even a way to find out the range in which the key is located, ...

Really? So tell us what the range is where #66 is lying

Not to be a smart pants, but the question is silly and the answer will follow the question :  #66 lies somewhere between 0x20000000000000000 and 0x3ffffffffffffffff .

If you can determine the range of the private key from it's public key, ECC is broken. So, I don't believe that, yet.

Exactly, to determine the range, it mean determine one single bit position and that with the correct math operations can solve any key, so it is hard to believe

Totally agree with GoldTiger69 and albert0bsd here! One single bit position will break ECC!

Here is a pubkey 03995B8A5AD00A205BFB9837014E2978273B816CFB29CA9644AB6D44977C006C64

The first bit of the private key is 1

I will even give you range 2^144-2^145

Come on break the ECC with that bit.....

[vhh]

There is even a way to find out the range in which the key is located, ...

Really? So tell us what the range is where #66 is lying

Not to be a smart pants, but the question is silly and the answer will follow the question :  #66 lies somewhere between 0x20000000000000000 and 0x3ffffffffffffffff .

If you can determine the range of the private key from it's public key, ECC is broken. So, I don't believe that, yet.

Exactly, to determine the range, it mean determine one single bit position and that with the correct math operations can solve any key, so it is hard to believe

Totally agree with GoldTiger69 and albert0bsd here! One single bit position will break ECC!

Here is a pubkey 03995B8A5AD00A205BFB9837014E2978273B816CFB29CA9644AB6D44977C006C64

The first bit of the private key is 1

I will even give you range 2^144-2^145

Come on break the ECC with that bit.....

Sure : follow the same logic / algorithm that you applied when you discovered that the first bit is 1.
Nobody poses such an algorithm as we speak, modular math on prime fields forbids it.

[vhh]

guys, we don't talk about knowing the first bit, but finding it using an algorithm. It's pointless to spit out a public key when you know the private key that generates it. Take the pub key of puzzle #120 and post the first bit (discard the 0s MSB , of course). If you manage to find that bit you can extend the algo to find out all the other remaining bits.

[vsv68]

@batareyka
If you really have a way to find out the range in which the private key is from the public key, then contact me.  I will show you how using this method of yours you can get a private key from any public.