coin_diamond

Example: d1=(k1*s1-z1)/r1 d1=000000000000000000000000000000000000000000000000000000000000000e (secret) k1=(d1*r1+z1)/s1 k1=000000000000000000000000000000000000000000000000000000000000000f (secret) r1=(k1*s1-z1)/d1…

Added new information 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 Any ideas if we have a signature another signature d2=k1^(n-2)-1 k2=k1^(n-2) r2=(k2*s2-z2)/d2 s2=(d2*r2+z2)/k2…

So here's the deal: We got two signatures here. d is the private key, k is the nonce, r is the public key, s is the signature, z is the hash. The equations we have are: d1=(k1*s1-z1)/r1 k1=(d1*r1+z1)/s1 r1=(k1*s1-z1)/d1…

Came across this hilarious pic on X, had to share it. Crypto, stocks, everything is taking a hit, and everyone’s hoping for a soft landing. Then I spotted this counter image, so I thought I’d share it too... at least if…

CPU 180gb ram, 192 processor threads

You need to understand how the BSGS algorithm works. In your example, you create a 2^33 key database and search through them. BSGS is more memory-intensive than the number of device threads. I made a program…