Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 183. (Read 215414 times)

Let's be honest, there are only a handful of people/groups looking for 125 using Kangaroo or random BSGS (hoping to get lucky), and no, I do not include you because I doubt you are putting in the work; besides playing with numbers lol. Which is fine, to learn and try applying your trampoline math to the challenge/curve. I'm not knocking you.

To be more honest, I could give people a 1/8,192 chance of solving #125, and earning 5 BTC, and they would not take it. People are strange creatures. We have a me me me and only me kinda vibe. People think they will get lucky and solve without helping or doing a lot of work, but even with a 1/8,192 chance of solving, they would not take it.

1/8,192 chance....

The sentence above is a puzzle of it's own, it keeps me up at nights ever since it was posted. lol.
What I would like to know, what quiet and calm? My man, you are a billionaire and one of the greatest inventors of all time, you should only have quiet and calm plus young virgins crawling around your palace! lol^2.

---

Ok now back to business, anybody here knows what happens to G when we multiply it by 1? I mean why is G multiplied by 1 is not G itself?

By the way fellow hunters, I have figured out that puzzle 125 is most likely between 65% and 85% of 125 bit range, according to my awful calculations, I am 90% certain it resides in 75% of 125 bit range area.  When it's solved we will know for sure, till then hang tight and keep looking hopelessly, not sure if we could even see it's private key though, unless the solver is a real gentle man unlike some people cough 120 solver cough.

If you modify the SECP256K1 curve, for Bitcoin you obtain:
1. Non -valid addresses.
2. Valid addresses but with invalid private keys.

Sorry to give you the bad news this way son! But you just posted the same keys with different encodings, they don't have the exact same hash.

You see, this key
Has only 1 uncompressed key which is : There are no valid key such as

Or

Whatever they are feeding you over at that site you linked, is not proper secp256k1, elliptic curve cryptography.

Though if you are fond of public keys with a lot of zeros, I can give you one.


Next time when you try to spread information, make it legit and verifiable. Posting some random invalid keys and insisting they are valid is not a way to go around these woods, you need to change your supplier I mean tool, what you are using is broken.

play a little with the application below and convince yourself

https://iancoleman.io/bitcoin-key-compression/

all keys are 100% valid

(for uncompressed keys remove the spaces after copy/paste from here)

Did you change the keys somehow? It seems most of them are invalid, I don't know where you got them, but you should put each public key inside a code bracket to better identify them.
To be exact, the number of compressed and uncompressed keys are exactly 50-50.
You don't happen to have any of their private keys do you? For a second I thought you just found hash collisions.🤣

From  
addr: c.   1MRxjnjFDhZfjtjgpxBNczsMGVEtYqfFyS    u.  1Jy6aHcRTWjiPN9DpjZztk2F8xY9iNsaj2
020000000000000000000000000000000000000000000000000000000000000001
040000000000000000000000000000000000000000000000000000000000000001483ada7726a3c 4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
```````
```````all hex range of x
```````
```````
to
addr: c.  1LCQXAGayRCWdAGrh7NKWEcyQNfbbxPdtw    u.   1F18os1CipgxyUj9wBMY4yK1HEVUaub2Nr
02ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
04ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff483ada7726a3c 4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8

there are addresses with public keys where the coordinate y is the same.

More interesting is the fact that, the public key 02ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff is the correspondence for the same addresses  1LCQXAGayRCWdAGrh7NKWEcyQNfbbxPdtw as 0200000000000000000000000000000000000000000000000000000001000003d0 and continuing like this, if we change the value of the y-coordinate of the public key, for each even/odd value it seems the compressed address is the same:
1LCQXAGayRCWdAGrh7NKWEcyQNfbbxPdtw
0400000000000000000000000000000000000000000000000000000001000003d00000000000000 000000000000000000000000000000000000000000000000002

1KmKgQHBMbequmyi9uP1yfa1vsNjdsjyEz
0400000000000000000000000000000000000000000000000000000001000003d00000000000000 000000000000000000000000000000000000000000000000003

1LCQXAGayRCWdAGrh7NKWEcyQNfbbxPdtw
0400000000000000000000000000000000000000000000000000000001000003d00000000000000 000000000000000000000000000000000000000000000000004

1KmKgQHBMbequmyi9uP1yfa1vsNjdsjyEz
0400000000000000000000000000000000000000000000000000000001000003d00000000000000 000000000000000000000000000000000000000000000000005
`````
`````an so on
1LCQXAGayRCWdAGrh7NKWEcyQNfbbxPdtw
0400000000000000000000000000000000000000000000000000000001000003d0fffffffffffff fffffffffffffffffffffffffffffffffffffffffffffffffff

I could conclude from here that any compressed public address exists as many times as there are for each uncompressed address and vice versa, and the mathematical space of the corresponding keys that generate them is much larger and can be treated as a three-dimensional space.

Albert0bsd, what do you mean you can't get exact speed with kangaroo? Do you mean in general or with Iceland's kangaroo? I do not know much about Iceland's version.
When I look at that info displayed, it doesn't seem right to me. Like a bad copy and paste job. If you look at the numbers:


First, there is no way it found 2^29.29 DPs in 6 seconds. Even if it was DP 1. And I am quite sure 2^29.29 would eat up more than 53MB of RAM.

But generally speaking, if you are using GPU Kangaroo by JLP or another GPU version, the speed shown, is accurate. My benchmarks are easy to follow. I have a display (so does JLPs) of total keys checked and number of DPs found. If you are running DP 25 and have completed 2^42 ops (GPU speed * number of cards = keys checked/operations) then you will normally have around 2^17 DPs. 2^42-2^25=2^17.

in 3 months maximum it will be discovered

Proof what you said of GTFO.

Iceland tools are 100% trusted.

About the speed of kangaroo from that tool it is a calculated speed more o less about the expected speed, remember kangaroo it is a probabilistic algorithm and it can't give you exact speed only a near speed based on some math.

Regards

Thanks for the response guys, I was just more curious than anything.

To add to it...
Yes, first you would have to generate 2^75 pubkeys, and then run the kangaroo program, 2^75 times, once for each pubkey generated.

Firstly it would take at least a year and a very large hard drive to generate that many keys. but if you did and somehow found the key on 75 then you  convert that key to decimal and multiply this by 1,125,899,906,842,624 and convert back to hex for the 125 key.

Yeah, most people don't know that Beating Satoshi is impossible without quantum devices

Going back to this... So you drop it 50 bit... Get your insane number of public keys. Theoretically if you then Kangaroo it and get the private key in the range of 75...What's the following process?

I understand that!))) but you see - not everyone here thinks so! They probably want to discover new mathematics!

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.

Did I understand correctly? We are engaged in breaking elliptical curves - it's really fascinating! As soon as we do this, all cryptocurrencies will be worth - zero! People are a strange animal!))

I know all build with math. Hard to find the formula of puzzle but the private key is really exist.
Nice explain. Thanks.