R.x Equals Public Key X: Can We Solve It?

k*G = r.x == d*G = d.x I’m not super good at English, but I think I got the idea. If R is Publickey x, then we can find a solution. Here’s an example: R = 0x7362f4d6ce57b70f0fc9781dbc92010f709ea60bee3b43bdfd763e860d6eff2f S = 0xbb5739e3279db95257555a571a8a8c1cb36be86c1423b92a46137afa0600fceb Z = 0x119c63b888b501a28c1e3902b65a8499a7d1bddcbc14120906c1e00a64f7ada5 Publickey = 0x7362f4d6ce57b70f0fc9781dbc92010f709ea60bee3b43bdfd763e860d6eff2f, f1f4569c03bc6c0defa5a84b8ebe26a433504a0847b971aa55c8071b7f36ba18 If R.x == Publickey.x, I can prove it if someone shares.

It’s actually pretty simple to solve. If you have the z-value, r-value, and s-value, you can just do "z/(s-r)" to get the private key. But honestly, I doubt there are many cases of this out there. Anyone could just take these coins if they found them. So like, it's not a big deal, right?

+1, makes sense to me But I wonder if there are any real-world examples of this happening. Can you share any? Also, is it really safe to assume that no one’s gonna find those transactions? Sounds risky to me.