falcon2019

I think you might be mixing up group scalars and field values. x can be zero and still give valid points on the curve if there's a square root to find for y. If y is zero, it's a similar deal, provided x satisfies the…

You can optimize this all you want, but BSGS isn't gonna handle anything over 80 bits. Your example solved a 40-bit DLP, dude. That's super fast on a normal CPU, not even a GPU. Seriously, there’s not enough memory on…

You keep insisting your code is flawless when it’s already been pointed out that it’s not. Like, why ask for help if you think you’re right? Public keys for private keys -1 and N-1 look the same, yet your program can’t…

1. Negative public keys don’t exist. 2. The bits of the private key and public key are unrelated. If they were, we’d have a huge problem with ECC security. Your code has some serious misconceptions.

Also, should we include Electrum 2FA versions in the discussions? It could help if users at least remember one address for checking!

I think we should clarify that this tool is meant for cracking a limited number of missing words from mnemonics. Checked out the GitHub but not sure if everything there is ready for public use.

Nice work on the puzzle hint, but that’s not the missing character.

There's a missing character in the second code from the first post. I’ll correct it once someone cracks it. Everything else is spot on and there’s a prize involved. If you’re thinking it’s unsolvable, you might be…

The specs mention clearly that what’s encoded is the BIP32 seed which comes after those 2048 PBKDF2 rounds, meaning it uses the initial entropy bits for the master seed. I’m sticking to my guns here SLIP39 security, at…

The word count isn't just about the dictionary size or error checks. If the master secret is encrypted and it’s actually the BIP-32 seed, then what’s the point of that encryption? Does it really secure the seed?

I read that converting from BIP39 to SLIP39 uses 59 words. Kinda weird, right? The specs say SLIP39 encodes the BIP32 master seed. BIP39 does all these PBKDF rounds to get a seed. But SLIP39 skips that and just uses the…

That's a fortunate case. I asked it to count 1 to 100 and it skipped 6. It also repeated lots of numbers and skipped random gaps after them, so that must be a clue to the secrets of the multiverse. So what I get, is…

I've scanned up to 100 billion points, looking for patterns or anomalies. The results were just random. Nothing stood out, all seemed typical to me.

I still don’t see your point. Just select any point where x % 27 == 0, compute an r', and claim it's special because it fits this equation. What's stopping you from doing that for any point?

Nah, it’s still 1 in 27, always. Just pick any integer and you’ll see that any of them will show this rule. This is true regardless of the curve.

First, D is a constant and divisible by 27, that’s 100%. Also, if two numbers share a factor, their mod will always divide. This math has been known forever.

Nope, your ‘discovery’ is basically saying G.x is divisible by 27 because you picked 27 deliberately since D is also divisible by it. Your r' is just a byproduct, so it’s not surprising that G.x satisfies the equation.

Nah, that’s overthinking it. OP just found that G.x is a multiple of 27, which means it shows up about 3.71% of the time. No need to complicate things with advanced math.

There’s still potential. An M2 with some power should work fine.

Last time I ran on an i7 8700, it took like 3 seconds on average. Yours could be quicker with the same setup. Just so you know, I used a version from GitHub that’s like the standard script.