Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 197. (Read 229812 times)

copper member
Activity: 205
Merit: 1
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.
full member
Activity: 1162
Merit: 237
Shooters Shoot...
Quote
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?
jr. member
Activity: 38
Merit: 1
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.

member
Activity: 239
Merit: 53
New ideas will be criticized and then admired.
Quote
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
member
Activity: 239
Merit: 53
New ideas will be criticized and then admired.
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
full member
Activity: 1162
Merit: 237
Shooters Shoot...
Quote
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.
jr. member
Activity: 38
Merit: 1
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.







member
Activity: 239
Merit: 53
New ideas will be criticized and then admired.
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
copper member
Activity: 205
Merit: 1
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
copper member
Activity: 1330
Merit: 899
🖤😏
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?😉
jr. member
Activity: 38
Merit: 1
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.
newbie
Activity: 18
Merit: 1
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?
jr. member
Activity: 38
Merit: 1
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.
copper member
Activity: 1330
Merit: 899
🖤😏
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.
hero member
Activity: 630
Merit: 731
Bitcoin g33k
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
jr. member
Activity: 38
Merit: 1
It all lies in computing power, currently I can reduce the range of puzzle #130 to the equivalent of looking for the public key of puzzle #103 without slowing down the search (my resources aren't useful for looking for a public key in range 103 anyway), I could reduce more but I do not have the necessary resources for it and the search becomes slow, therefore it is my "acceptable" range. It doesn't seem unreasonable to me that more puzzles will continue to be found this year by comparing what I can do with basic resources with others who have many .

in short, a puzzle for rich people
Well, if you can really reduce the range down to 103 bits, there are already a few hunters with decent rigs willing to help you out and then you could use an escrow to split the prize, you could also divide the 103 bit range into 100 small ranges and search each one per day, after 100 days or even less, you will find the key, but the question is, are you really sure you can lower the range to 103 or even lower? What if the key you are looking for is not there?

You need to provide a reasonable solution to prove that the target is in the said range.

Good luck though, I'm off this puzzle till I see the private keys for #120 and especially #125, I might work on other puzzles here and there, but won't engage in sharing my findings and talk about possible solutions, as it seems we could spend more than 120 days 24/7 just to have nothing at the end, and I don't mean money, who ever solved it they deserve it and I hope the best for them, but not being able to have the answer ( private key ) of the puzzle, even an empty key, is a deal breaker.
I am completely sure of it because I tested it with public keys that I know the pk and I was able to know that the script work

My problem is that I lack computing power and at this time I do not have how to invest in it. I have thought about sharing the script but we would return to the same starting point where someone with a lot of computer power takes advantage of the script, take the money and then do not even have the decency to thank the developers or reveal the key.



You can eliminate as many numbers as you like.
for example, I can reduce the key by 4 digits from 32 to 28, but for this there will be 65,000 open keys, which I count is a lot.
5 and 6 digits can also be eliminated.
 Smiley
member
Activity: 239
Merit: 53
New ideas will be criticized and then admired.
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.
member
Activity: 239
Merit: 53
New ideas will be criticized and then admired.
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.
32 Characters hex?
copper member
Activity: 1330
Merit: 899
🖤😏
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.
member
Activity: 239
Merit: 53
New ideas will be criticized and then admired.
It all lies in computing power, currently I can reduce the range of puzzle #130 to the equivalent of looking for the public key of puzzle #103 without slowing down the search (my resources aren't useful for looking for a public key in range 103 anyway), I could reduce more but I do not have the necessary resources for it and the search becomes slow, therefore it is my "acceptable" range. It doesn't seem unreasonable to me that more puzzles will continue to be found this year by comparing what I can do with basic resources with others who have many .

in short, a puzzle for rich people
Well, if you can really reduce the range down to 103 bits, there are already a few hunters with decent rigs willing to help you out and then you could use an escrow to split the prize, you could also divide the 103 bit range into 100 small ranges and search each one per day, after 100 days or even less, you will find the key, but the question is, are you really sure you can lower the range to 103 or even lower? What if the key you are looking for is not there?

You need to provide a reasonable solution to prove that the target is in the said range.

Good luck though, I'm off this puzzle till I see the private keys for #120 and especially #125, I might work on other puzzles here and there, but won't engage in sharing my findings and talk about possible solutions, as it seems we could spend more than 120 days 24/7 just to have nothing at the end, and I don't mean money, who ever solved it they deserve it and I hope the best for them, but not being able to have the answer ( private key ) of the puzzle, even an empty key, is a deal breaker.
I am completely sure of it because I tested it with public keys that I know the pk and I was able to know that the script work

My problem is that I lack computing power and at this time I do not have how to invest in it. I have thought about sharing the script but we would return to the same starting point where someone with a lot of computer power takes advantage of the script, take the money and then do not even have the decency to thank the developers or reveal the key.
Jump to: