🤣 Dude its for when you know the public key you get twice the vectors and double the chance of a collision
Wait please tell me people here are not wasting theyre time using kangaroo or pollards or jean luc pons on keys with only the address because god damn if so that is a special kind of stupid and just proves my point that this is the fucking kiddy pool and your right i need to go back to the grown ups to have a decent conversation
Yes, you should do that, instead of posting non-sense. No, having the public key does not double anything up. GLV is simply an efficient computational optimization of a k*G operation, and has nothing to do with either brute-force, Kangaroo, or BSGS, as it does not simplify anything on any of those front-ends.
Optimizing k*G is irelevant to either Puzzle 71 or 135, since neither of those kind of puzzles actually require computing more than one, initial, starting public key from a known scalar.
Yes, you have much to learn. Maybe not via LLM though, unless you want to become the dumb idiot you think the rest of us (not using AI) are.
You stupid dumb fuck do you even know what brute force searching is? Its computing candidate PRIVATE KEYS trying to find a match the GLV method lets you COMPUTE PRIVATE KEY 2 TIMES FASTER! Double the speed fucking know what your talking about before speaking you fucking moron k*g is exactly what an efficient search optimizes van oorschot weiner makes it even better because now were doing that same thing in parallel you fucking ignorant uneducated simpleton if you are just fucking with me it still doesnt change the fact that even with the best optimizations you have at your disposal you dont have the key or know how to get it you just keep telling me im correct and verify what im saying in the most stupidest sounding way possible your just embarrassing yourself at this point grow the fuck up and actually pay attention to what your saying
No need for such a offensive language... It's out of line, complitely, regardless if someone is right or not, in this case you are simply wrong.
It is true that GLV spliting let's you speed up computation of k*G, but it's not true and usefull for this specific case (challenge addresses, bruteforcing for a private key).. kTimesG explained to you very well, "Optimizing k*G is irelevant to either Puzzle 71 or 135, since neither of those kind of puzzles actually require computing more than one, initial, starting public key from a known scalar."
Simply, most basic interpertation: you compute once private key -> public key and that is it, no more k*G needed, after you do point addition, adding points whitin elliptic curve space, once you added enough points and you get a match, private key recovery is simple, you know how many times you added points on the starting point aka starting private key, private key space and public key space corelate 1:1 with each other. Private key 1 -> 1*G, you add on it 20*G, that is 21*G that = private key 21.
That is it, that is the most efficient way, no way around it. And only speed up you can get is purely how effective your gpu computes, less gpu instructions = faster execution. Better and faster multiplication, squaring, subtraction. Inversion that is armortised over 512 points becomes basicly free. If you want speed, write a better multiplication on a gpu, that calculates "256*256 -> reduction" in least amount of instructions. Simple, but complicated. Kangaroo, BSGS, what ever else there is, is simply a mathematical shortcut that reduce required amount of operations needed to get to the solution, none applicable to addresses that don't have exposed public key. Both have their pros and cons, and they simply solve the problem "this is exposed public key that is located within A and B, pick a private key(compute k*G to get public key) within that search space and find where stepping from private key(compute k*G to get public key) crosses steping from exposed public key".. Or if you wish to break Secp256k1 curve, find a "better shortcut", of the said problem, that requires less operations.
