Bitcoin puzzle transaction ~32 BTC prize to who solves it

[batareyka]

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.

[Unplugged Taste]

You can find out the range from the public key.

This is serious stuff, you probably didn't realize what you said... HOW ON EARTH YOU FIGURE THE RANGE FROM PUBLIC KEY?

[batareyka]

You can find out the range from the public key.

This is serious stuff, you probably didn't realize what you said... HOW ON EARTH YOU FIGURE THE RANGE FROM PUBLIC KEY?

To believe in a word or not is your right.

PS Everything will go to society together when the work is completed.
Best regards.

[digaran]

You can find out the range from the public key.

This is serious stuff, you probably didn't realize what you said... HOW ON EARTH YOU FIGURE THE RANGE FROM PUBLIC KEY?

To believe in a word or not is your right.

PS Everything will go to society together when the work is completed.
Best regards.

If I tell you a certain key exist in a certain range, and if you know the first character of the private key, you might be able to get close to validating the authenticity of my claim, but without that information, there is no other way than brute forcing all the possible ranges one by one, but it would be great to learn something new before you decide to bring all the societies into the action, so share and care, right?😉

[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

[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.

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

[batareyka]

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.

[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!.