the_oracle

yeah, AI has its limits. I’m comparing AI’s code results with mine that doesn’t require d or k, and guess what? they match. but solving that equation "doubler = ((z2*s1 z1*s2) * modinv(r2*(s2-s1),n) % n)" is still a…

I checked out your method a bit more, and it looks like you’re hitting that same r with random pubkey Q and yeah, without d or k, recreating it is a no-go. my code works for u1 known and method 2 with u2 known.…

if you wanna double R, you gotta consider the original k and add z into the mix. so s_add can be whatever you want. like, k = your_k, then z_add = k * s_add. the equations would look like this: r2 = r1, s2 = s1 + s_add,…

Official links are all over the place. Website, testnet, GitHub it’s a bit much. I get it’s all new, but can we simplify this? Also, whitepaper's there. How about just focusing on the tech?

Here’s a quick Python snippet for the math: from fastecdsa.curve import secp256k1 from fastecdsa.point import Point def extended_gcd(aa, bb):... Just gotta adjust for the inverse.