Pages:
Author

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

member
Activity: 93
Merit: 16
Launched it on one video card.
Code:
[i] Upload work file: Work_Kangaroos_128.txt
[i] File Work_Kangaroos_128.txt: 255590400 bytes 1317476 lines

[i] Get Keys time: 24549.068 msec From file: Work_Kangaroos_128.txt Size: 255590400 bytes
[i] GPU Use Start Keys from work file: Work_Kangaroos_128.txt

[+] Runing Comparator every: 300 sec
[i] Save Work_Kangaroos_id.txt file every: 600 sec

[i] WILD Check Distance: 8D206E8B3814706BABF1C3A693EE7A0
[i] TAME Check Distance: 3E23F093957C9DD9A3D9AB48B3482F85C
[|][  0: 0:36 ;   0.0  j/s; [GPU 0.00 Mj/s]   0.0 j   0.0%; dp/kgr=0.0;   1.0Ty  2m 22d 14: 0:32 ]  
[i] Write work Kangaroos in file: Work_Kangaroos_128.txt
[i] Save Work file OK
[/][  0: 0:38 ;   0.0  j/s; [GPU 0.00 Mj/s]   0.0 j   0.0%; dp/kgr=0.0;   1.0Ty  2m 22d 14: 0:32 ]  
[i] Load Work file to Drive
[|][  0:11:48 ; 460.8M j/s; [GPU 460.83 Mj/s] 311.0Gj   0.0%; dp/kgr=0.0;   2.0Ky 10m 28d 19:52:16 ]  
Python Comparator time: 708831.895 msec
[-][  0:12:40 ; 461.3M j/s; [GPU 461.26 Mj/s] 335.0Gj   0.0%; dp/kgr=0.0;   2.0Ky  6m  1d 10:52: 6 ]  
[i] WILD Check Distance: 8D206EC1A13D020EFECB550DA146C3D
[i] TAME Check Distance: 3E23F093CC220F1301640B64F086A15D5
[|][  0:13:24 ;   0.0  j/s; [GPU 0.00 Mj/s] 335.0Gj   0.0%; dp/kgr=0.0;   1.0Ty  7m 14d  3:41:52 ]  
[i] Write work Kangaroos in file: Work_Kangaroos_128.txt
[i] Save Work file OK
[-][  0:13:28 ;   0.0  j/s; [GPU 0.00 Mj/s] 335.0Gj   0.0%; dp/kgr=0.0;   1.0Ty  7m 14d  3:41:52 ]  
[i] Load Work file to Drive
[|][  0:13:56 ; 461.1M j/s; [GPU 461.14 Mj/s] 348.0Gj   0.0%; dp/kgr=0.0;   2.0Ky  2m  0d 10:55:49 ]  
[i] Copy tame and wild files in My Drive
[-][  0:24:16 ; 461.1M j/s; [GPU 461.09 Mj/s] 634.0Gj   0.0%; dp/kgr=0.0;   2.0Ky  5m  9d  9:27:12 ]  

And leave it like that until January 1, 2025   Roll Eyes
sr. member
Activity: 322
Merit: 300
Duelbits.com
someone solved it ?
hero member
Activity: 630
Merit: 731
Bitcoin g33k
Subtraction, multiplication, addition.....

This is like the movie Groundhog Day.
About a man reliving the same day over and over and over.
In this case trying to break the ECDSA. Grin

Tirelessly digaran tries again and again, OMG
ignore list updated and increased by 1
member
Activity: 462
Merit: 24
Subtraction, multiplication, addition.....

This is like the movie Groundhog Day.
About a man reliving the same day over and over and over.
In this case trying to break the ECDSA. Grin
newbie
Activity: 13
Merit: 0
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.
newbie
Activity: 13
Merit: 0
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.
hero member
Activity: 862
Merit: 662
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.
newbie
Activity: 24
Merit: 4
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 ?
newbie
Activity: 28
Merit: 0
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. Grin

Sorry mate but you don't seem to understand what I asked, read again my post.
HI
Quote from: CryptoMaster84
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
hero member
Activity: 630
Merit: 731
Bitcoin g33k
Happy New Year  Wink

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! 🥳🎆🎉
member
Activity: 462
Merit: 24

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

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

LOL  ... That is ridiculous.  Grin

Happy New Year  Wink
member
Activity: 122
Merit: 11

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

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

LOL  ... That is ridiculous.  Grin
member
Activity: 462
Merit: 24

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

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. Grin
jr. member
Activity: 82
Merit: 2
Agreed. Ignore list count increased. Just in time to increase the year count...Happy New Year


<<>>

Nothing-To-Share-Useless-As-Usual-Digaran
ignore list just increased by 1
jr. member
Activity: 40
Merit: 1
Just Happy New Year to every one !!!)))
newbie
Activity: 13
Merit: 0
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.
hero member
Activity: 630
Merit: 731
Bitcoin g33k
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
newbie
Activity: 13
Merit: 0
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.
member
Activity: 462
Merit: 24
Is there another way to build OpenSSL?

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

Code:
sudo apt-get install libgmp-dev libssl-dev build-essential
Grin
member
Activity: 93
Merit: 16
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 Smiley
Pages:
Jump to: