Finding K Nonce More Efficiently

Hey folks, been trying to calculate K nonce using a method from ecdsa123. Took me 6 weeks but finally got the right 256-bit K. Is there any quicker way to figure this out? Like, can we calculate it directly from given values?

Check this out, it talks about nonce.

6 weeks? That's impressively fast! Did you use actual data from a BTC transaction?

What results did you get for the 256-bit nonce?

You might wanna break down the code, add in the formulas for r, s, z, and then throw it at OpenAI. It helped me find quicker solutions in my case.

Oh wow.

Yeah, I tried that too but it led me down a rabbit hole. Wasted two days on calculations that were totally off.

Yep, the results I got came from a wallet that had been dormant for 8 years.

Hey dude, check your DMs.

Running this on a GPU will definitely speed things up. I could whip up a CUDA program for it.

Nice, thanks! But still, 6 weeks feels like a lot. I just got lucky with my timing.

Right now, I'm using an i9 processor alongside a Nvidia 3090 GPU.

If you need the full code I used in SageMath, let me know.

Thanks a ton for sharing your code, really appreciate it!

@COBRAS @krashfire Can you provide an example of rsz if your code is accurate? Like, r=0x, s=0x, z=0x. And if two signatures match, how long should it take to find K nonce?

Edit: ran into an error with public_key1. This is what I’ve got: public_key1 (372314...: 967636...: 1) pub1_x= 0x52503c... public_key2 (847735...: 215042....

@krashfire took 6 weeks, which seems kind of lucky. You should check out his previous posts for rsz info.

Can you explain the logic behind using a GPU? This could cut it down to a few days. Happy to discuss in DMs.