I wonder if 20, 30 years ago there was any incentive for the math guy to try things harder, but you know even if Newton hadn't discovered gravity we would still be living our lives, just because no one has found the solution doesn't mean the solution doesn't exist.

---

But that going around the curve happens when you try division or + - with very large keys, if you limit your range of operation to a certain bit range, you could eventually find a check point.

For simplicity :

E.g. subtracting 200 from 1700 = 1500, subtracting 200 from 1500 = 1300, subtracting 1000 from 1300 = 300, subtracting 1700 from 2000 = *300!

* see how we reached our checkpoint so fast just with a few normal elementary math operations?

What makes it difficult is the size of the actual keys we are looking for, and what we are looking for is not even 0.1% of 2^256 range which most of the people's keys reside in.

So far this 0.xxxxxxxx% of the curve order has kicked our asses collectively. 🤣

This will never happen .. even on 160 bit range .. will never happen .. i am more likely to become the president of the US without having its nationality than we breaking the elliptic curve .. you're dealing with numbers as much as almost the number of atoms of the known universe .. but for solving puzzles, it can happen, good luck everyone.

Come down friend. There are not mathematically is just Random. I try many theory mathematics and found some rule of puzzle. There are never complete.
If you like lottery of bitcoin. Try your luck.

Oh right, it is endomorphism, the point is multiplied by some constant

0x5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72

I write about it on the README of Keyhunt

https://github.com/albertobsd/keyhunt#endomorphism

He mean the Negative Point.

The curve is like a mirror,  in the X axis, every X value have two Y values.

Guys, I hope you are all doing great!
Can anyone please refer some python script that can apply point halving on public keys and calculates its half?
https://bitcointalk.org/index.php?topic=4455904.0
Here it is explained but there is no python script there that can calculate it by taking the public key in question

If he has such a script 125 would be gone at 75 which can be done by kangaroo or bsgs in an hour or less. of course you can reduce by 50 keyspaces with pubdiv.py it is just you need to generate 1,125,899,906,842,624 keys which should take a year to generate

I wrote a 190 line algorithm using python this morning. It reduces private keys in high bits to the range I want. For example, I reduced the 80-bit pubkey to 31-bit, this took 3 seconds and it took me 0 seconds to find it with bsgs. It found it while opening the program. My algorithm seems to be working. Just for mathematics, this is mathematics, I have been following this forum for 1 year and read articles on secp256k1 and tried to understand, then a month ago, lightning flashed in my head and I thought about the algorithm until today, finally I decided to write, as you said, faith moves mountains. I think bitcoin is not secure.

you are the hero of the day. The forum has been waiting for its messiah and finally you are here. Satoshi is already trembling. Thank you for this enlightment.

What hint do you need more than having such amounts which are directly pointing to the exact bit range where the keys reside? It is a game and a test, we play this game and they use our feedback to analyze the system.

Have you missed the recent movements and the signs of improving the old tools to make them faster?
If it wasn't for the latest prize increase, we'd be scratching our heads and using the old stuff without any serious improvements being done.

Don't sit around and wait for others to come up with a solution, try 50 methods, if all of them failed try 50 more, we never achieve anything in life if we stop trying when we hit a dead end, finding a way around it is the challenge and that should be entertaining to find without frustration, don't worry no one is going to collect all the puzzles any time soon, we have time and we need to focus without stressing ourselves.😉

Faith will move mountains, but knowledge will move them faster. The keys position within its range are randomly. You can proof yourself, just check the keys and calculate its position. That's no rocket science. Hint: look at puzzle 25, 31, 60, 63 to get a feeling of what a high position is and puzzles 38, 50, 85 to understand what a low position means There is no "narrowing the search range solution" for this. You wouldn't have solve the mentioned puzzle otherwise. The key positions for the known keys of today for this puzzle vary from 0.069 (puzzle 38) to 0.97 (puzzle 60), while disregarding puzzles 1-10.

Believe nothing, no matter where you read it, or who said it, no matter if I have said it, unless it agrees with your own reason and your own common sense.

A solution, sort of a hint.
Have any of you studied G point throughly? It has some interesting characteristics, it was generated by someone we don't know anything about, other than that, N also is interesting and you should research both N and G.

One other thing is the concept of adding and multiplying G by k, which obviously is not what I thought, I always assumed that if G is 5, and k is 20, we'd just multiply 5*20=100 =p. Well that was a misconception from my part.

Now instead of wasting your time doing useless stuff, start doing some research and experiment on elliptic curve.

Worth mentioning that almost 99% of you are unaware that bitcoin elliptic curve is a mirror. Now that you know, you should study the mirror verse to see what cool stuff are lurking there. Good luck and happy hunting.


I just wanted to shock Satoshi for a second. Are you shocked?🤣 .

Dear doc! We don't need a spaceship to go fetch the gold, there is a teleportation portal we could use to teleport and grab them all, it's called mathematics. Now I'm nervous.😉

Just mathematicians - they say that there is no such teleport - you invented it in your head - and sincerely hope for a miracle! There are no miracles in mathematics!!))

2500 years? I have estimated with the help of my mentor, that I need around 40,000 years to brute force 66. So you are way ahead of me.
I guess the point of this "crap" is to show off, here some free bitcoins in the easiest bit ranges for grab, collect them if you can.

It also is an indication to warn people why using addresses more than once is not a good practice, as we all know exposed public keys can endanger the security of private key exponentially.

A solution, sort of a hint.
Have any of you studied G point throughly? It has some interesting characteristics, it was generated by someone we don't know anything about, other than that, N also is interesting and you should research both N and G.

One other thing is the concept of adding and multiplying G by k, which obviously is not what I thought, I always assumed that if G is 5, and k is 20, we'd just multiply 5*20=100 =p. Well that was a misconception from my part.

Now instead of wasting your time doing useless stuff, start doing some research and experiment on elliptic curve.

Worth mentioning that almost 99% of you are unaware that bitcoin elliptic curve is a mirror. Now that you know, you should study the mirror verse to see what cool stuff are lurking there. Good luck and happy hunting.


I just wanted to shock Satoshi for a second. Are you shocked?🤣 .