stack_chad

Using a CPU with 180GB RAM and 192 threads. It’s a beast.

You gotta grasp how BSGS operates. You’re just creating a huge key database and searching through it it's way more memory intensive than thread count. I built a faster version called keyhuntBSGS for GPUs, but it’s not…

Here’s an example I’m working with: d1=(k1*s1-z1)/r1 d1=000000000000000000000000000000000000000000000000000000000000000e k1=000000000000000000000000000000000000000000000000000000000000000f…

Actually, I think if we have an inverse, we can write it like this: d2=k1^(n-2)-1 k2=k1^(n-2) r2=(k2*s2-z2)/d2 s2=(d2*r2+z2)/k2 z2=k2*s2-d2*r2 Still not sure how to calculate k from 1/k though.

So I’ve got these two signatures and trying to figure out the nonce. Here’s what I got: d1=(k1*s1-z1)/r1 k1=(d1*r1+z1)/s1 r1=(k1*s1-z1)/d1 s1=(d1*r1+z1)/k1 z1=k1*s1-d1*r1 If we have another signature, how do I find k?