falc0n100

Thanks for the detailed critique solid points, and the branch count made me double-check the code. You're right, the toy example has more branches than ideal (around 21 in the expanded form), but that's expected for…

In the toy example (p=79, order 67), the successful tree had only ~10-15 nodes not 67 leaves. The depth was logarithmic, and the branching factor was binary (Legendre symbol → +1/-1/0). The "magic numbers" aren't…

The claim that "there is no adaptive method for SECP256K1" is just an assumption. It's assumed to be so because no one has done it to date. I asked about a new example curve before you did. I'll wait a while. If no one…

First of all, for the curve p=79, the ratio is 100. And yes, I didn't solve it, it was a joke. You're right Okay, I'll issue a challenge. Since it's possible to do this for toy curves, try creating a 100% successful…

If I can assure you of this, my kidnapping won't take two days. It's essential that I appear to be a joker, as I mentioned above.

If any generator is unsafe, then no generator is safe. This is a mathematical and concrete fact. Therefore, discussing generator selection is entirely due to a lack of sufficient information.

✅ Completed in Step 128. Calculation String: ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (…

"One million dollars" is a ridiculously small figure compared to the discovery we're talking about. That discovery is capable of solving a problem with a magnitude of 2 to the power of 256. The first thing someone with…

Do you think if this worked, the person who discovered it would use it for low-level and inexpensive tasks like solving puzzles?

I didn't say that. I was trying to explain that if anyone had doubts about the election, even the doubt itself was invalid.

Suppose I were a malicious curve designer, and suppose there existed some generator that enabled a backdoor. I would not choose that generator as the public standard generator. I would choose a generator that appears…

I've developed a version that works within secp256k1.

If you can figure out whether the scalar for a point is below half its order, it basically breaks the curve. That's because the whole point of elliptic curve cryptography is that solving the elliptic curve discrete…

If one of the 3 public keys with the same Y value is solved, can the other 2 also be solved?

Is there a possibility of having two distinct scalars on secp256k1 that result in points sharing the same y-coordinate?

I also searched for the point x1 = 1 in time. My conclusion: The points you mentioned are unknown to anyone. They are also very difficult to find.

wallet must remain secure. There are many patterns in R values, I am sharing some patterns for better understanding. https://prnt.sc/hHPWbppNhfvl

should be lower. hexadecimal number. 16 possibilities and 7 characters in its character. 2^16 = 268,435,456 possibilities are also 1. everyone can learn by scanning. But I did not scan. I went in the opposite direction…

no that's not the address, that was just to say I'm not new to the r topic. and I purposely chose the example address from a topic you responded to. I'm not writing the actual address because it still has a lot of btc.…

yes, I am an expert in these areas and I develop software that performs mass vulnerability scanning. Let me give you the full statistics; - There are less than 200 outgoing Tx. - In 32 pairs, 5 characters match in the…