Bitcoin puzzle transaction ~32 BTC prize to who solves it

[WanderingPhilospher]

I do not know about another way to build in OpenSSL.

So all of those mods are for just trying to generate starting keys, in different ways?

I like your work alek, but just to generate a starting key differently, that's a no from me. It's not about the starting key to me, but about the 2^64 ones after those starting keys

It's solid work/code. Was it all for trying to generate starting keys differently? I thought there was something in there about trying to crack deterministic wallets, no?

You're caught No, this is not a hack. This is a generation method. We need approximately the same algorithm as deterministic wallets.
It is also possible that we need a correct way to generate SEED, which includes its entropy - according to a different principle. The space is very large. And we need life somewhere nearby in the starting keys.

It's all because of nomachine , how it went and went with these seed receipts... But, he's great

I hear ya man!

I guess it has its advantages in some aspects. Can you not program it to land on the correct priv key every time, in every range? (joke)

I'm still trying to figure out a stride function; it has gotten the better of me, off and on, for 2+ years lol.

A stride that strides each GPU thread, by x amount. I could find one of these challenges much quicker, but to no avail; I stick with Kangaroo for larger puzzles; 512 RTX 4090s would solve 130 in roughly 246 days

[mcdouglasx]

I have developed a new method!
I have studied it 100% and it works.
My calculations tell me that before the end of January 2024 I will have unlocked puzzle #130 (if someone else doesn't solve it before).
For registration, I will send it to this address BTC bc1qxs47ttydl8tmdv8vtygp7dy76lvayz3r6rdahu

This message will not have edits for its validity.

If you want to question it, do it on February 1, 2024 if I don't send it to that address.

happy new year in advance, see you in February!, if life allows me.

blessings for all.

[alek76]

I'm still trying to figure out a stride function; it has gotten the better of me, off and on, for 2+ years lol.

A stride that strides each GPU thread, by x amount. I could find one of these challenges much quicker, but to no avail; I stick with Kangaroo for larger puzzles; 512 RTX 4090s would solve 130 in roughly 246 days

Not everyone has such resources. But the probability can be different, and for this you need a good chance. Again we need a good random. Here, depending on your luck, it’s possible to win 130 in a month. I’m trying to increase the maximum jump size to 2^105. It's just a matter of chance

[WanderingPhilospher]

I have developed a new method!
I have studied it 100% and it works.
My calculations tell me that before the end of January 2024 I will have unlocked puzzle #130 (if someone else doesn't solve it before).
For registration, I will send it to this address BTC bc1qxs47ttydl8tmdv8vtygp7dy76lvayz3r6rdahu

This message will not have edits for its validity.

If you want to question it, do it on February 1, 2024 if I don't send it to that address.

happy new year in advance, see you in February!, if life allows me.

blessings for all.

Go get that bag mcdouglas!!!

Rooting for you even though I am a 130 searcher as well.

[alek76]

Go get that bag mcdouglas!!!

Rooting for you even though I am a 130 searcher as well.

Puzzle 130 will not be solved soon, around February 1, 2025

[nomachine]

Is there another way to build OpenSSL?

Yep....If you use Linux....

Code:

sudo apt-get install libgmp-dev libssl-dev build-essential

[FlleOWA]

Happy New Year everyone. I only read here but didn’t write anything.

What did I find? I found a number that, if subtracted or added to the public key. Returns the same public key, regardless of whether the private key is large or small. A number was also found that, if subtracted or added to the public key, produces a key that is not on the curve.

I don't know to be honest. Has anyone found this already or not? But I’m still deciding what to do with it next. Because, in my opinion, this is the vulnerability of the curve. I've been working on the puzzle for 2 weeks. So far I've only found this. Sorry for broken English. I wrote through a translator.

[citb0in]

Happy New Year everyone. I only read here but didn’t write anything.

What did I find? I found a number that, if subtracted or added to the public key. Returns the same public key, regardless of whether the private key is large or small. A number was also found that, if subtracted or added to the public key, produces a key that is not on the curve.

I don't know to be honest. Has anyone found this already or not? But I’m still deciding what to do with it next. Because, in my opinion, this is the vulnerability of the curve. I've been working on the puzzle for 2 weeks. So far I've only found this. Sorry for broken English. I wrote through a translator.

Nothing-To-Share-Useless-As-Usual-Digaran
ignore list just increased by 1

[FlleOWA]

Somehow aggressive in your topic here. Or many people simply don’t want someone else to try to hack it. Or, they're just people like that. In general, I understand that the puzzle was created not to try brute force, but to test the elliptic curve itself. In order for you to try to hack it, the public keys were revealed to you.
One could calmly answer that there are a lot of numbers on the curve that it accepts as 0. That there are also numbers that it does not accept at all. I’m not good at it myself, but now I’m reading the documentation and studying it. And one thing I see is that there cannot be a number that she will not accept. But such numbers exist precisely in 256k1; in others I checked there are no such numbers. This means that this error was inherent from the very beginning.
Well, I won’t post the numbers themselves just yet, since there will be a smarter person than me who will just quickly hack everything himself. And if this really poses a threat to the curve, then the disclosure of this information will collapse the entire crypt to 0. But I don’t want to just invest effort, I want to save a little money before that.

New Year's dreams of a rich life.

[Kpot87]

Just Happy New Year to every one !!!)))

[Woz2000]

Agreed. Ignore list count increased. Just in time to increase the year count...Happy New Year

<<<deleted>>>

Nothing-To-Share-Useless-As-Usual-Digaran
ignore list just increased by 1

[nomachine]

Puzzle 130 will not be solved soon, around February 1, 2025

I am running custom BSGS with 128 GB RAM on AMD EPYC

bpfile size ~704 GB
bloom size ~110.47 GB

According to my calculation, it should end sometime in the middle of 2028. And all this if the server does not blink and there is no power outage.

[AlanJohnson]

Puzzle 130 will not be solved soon, around February 1, 2025

I am runung custom BSGS with  128 GB RAM on AMD EPYC

bpfile size ~704 GB
bloom size ~110.47 GB

According to my calculation, it should end sometime in the middle of 2028. And all this if the server does not blink and there is no power outage.

LOL  ... That is ridiculous. 

[nomachine]

Puzzle 130 will not be solved soon, around February 1, 2025

I am runung custom BSGS with  128 GB RAM on AMD EPYC

bpfile size ~704 GB
bloom size ~110.47 GB

According to my calculation, it should end sometime in the middle of 2028. And all this if the server does not blink and there is no power outage.

LOL  ... That is ridiculous. 

Happy New Year  

[citb0in]

Happy New Year  

As we kick off another trip around the sun, I wanted to drop also a note to wish you all a fantastic New Year! 🌟 Here's to leaving the craziness of the past year behind and diving headfirst into 2024 with a fresh perspective. May this year bring you tons of laughter, epic moments, and all the good stuff. Whether you're chasing dreams, crushing goals, or just taking it one day at a time – I hope it's a blast! Cheers to new opportunities, new friendships, and all the little victories along the way. Let's make this year one to remember. Happy New Year, everyone! 🥳🎆🎉

[mangocoinproject]

How do you know if PubKey prefix = 02?

I think it's a waste of time to guess whether it's 02 or 03 prefix. Whatever the script is, it must pass all the private keys. It is impossible to accelerate this way. It can be filtered, but filtering is not acceleration.

Sorry mate but you don't seem to understand what I asked, read again my post.

HI

I wanted to ask you a question by sending a message but i can't due to i am "newbie", please contact me so we can discuss.
Thanks

[shelby0930]

Hey Guys i have a question.. well lets say we subtract a target public key puzzle (130) using key subtractor with 1000000000000000000000000000 continuously at some point it movies from the additive inverse to the negative inverse right? are there any ways we could possible know at what point the reset point happened ?

[albert0bsd]

Hey Guys i have a question.. well lets say we subtract a target public key puzzle (130) using key subtractor with 1000000000000000000000000000 continuously at some point it movies from the additive inverse to the negative inverse right? are there any ways we could possible know at what point the reset point happened ?

No there is no way to know that, that break ECDSA, any method  to get single bit leak information of the privatekey break the ECDSA.

[FlleOWA]

Hey Guys i have a question.. well lets say we subtract a target public key puzzle (130) using key subtractor with 1000000000000000000000000000 continuously at some point it movies from the additive inverse to the negative inverse right? are there any ways we could possible know at what point the reset point happened ?

You can reduce each range 16 times, and then reduce all the results obtained by 16. And so you can go all the way to 0. But the lower you decrease, the more your number of public keys will grow. But 100% them will have 1 working key.
There is another option, a little simpler. Make the G point the 130 range key. Then generate new keys in the 130 range. And then simply subtract 1 from all these keys. If successful, you will get a key in the lower range, and then it’s a matter of little things.

[FlleOWA]

Here are the numbers I found out of boredom.
This is the minimum number
16492674416640
And this is the Maximum
115792089237316195423570985008687907853269984665640564039457584006813618012160
With these numbers, nothing is possible on the curve. Subtraction, multiplication, addition does not work with them. Perhaps they are simply 0 on the curve. If you change the number at the end to +, you get one.

The curve does not accept these numbers at all.
789842187514178900234385207627528242391713215504118334407332331520
394921093757089450117192603813764121195856607752059167203666165760
197460546878544725058596301906882060597928303876029583601833082880
I couldn’t find this information about these numbers at all on the forum. Maybe someone will find this information useful. I have already done everything that came into my head with these numbers.