Bitcoin puzzle transaction ~32 BTC prize to who solves it

[fixedpaul]

Bro thanks!!! but does support start and stop range thank you

Yes you can use -start and -range. It checks from start to start+2^range-1

[Tony8989]

Great will check it now thanks

[stwenhao]

Did the puzzle creator specify what "real solving" means?

No.

A grinding solver broadcasting a vulnerable transaction in the public doesn't own the coins until the transaction is actually confirmed. Am I wrong with this? I'd love to hear why, seriously!

Then, it is similar to this puzzle: https://asktom.cf/index.php?topic=293382.0

Exposing a vulnerable public key in public mempools opens the opportunity to use faster methods than brute-force grinding of the private key. If a real grinding solver ignores this, whoes fault is this, seriously?

Of course it is solver's fault. However, there are ways to do it in trustless way, they are just not used, because trusting centralized pools is sufficient in practice, at least for now. But it can be done differently, if needed.

What exactly is wrong or unethical or whatnot to use publicly available data to find a private key faster that allows you to sign a transaction to move coins that are "controlled" by such a vulnerable low entropy private key?

1. The puzzle creator can always sweep all coins, at any time. There are other puzzles, where it is not the case.
2. People have to trust, that private keys have N leading zero bits, and that someone really solved it, and the creator didn't sweep it just to raise some panic. If DLEQ proofs would be available, or other similar proofs, then everyone could validate it, without trusting anyone.
3. When it comes to hashed puzzles, there is a trustless way to prove, that N-bit hashed keys are no longer safe. It is currently done by using vanity addresses, but it could be potentially improved, by wrapping it into Script somehow (I don't know yet, how exactly, because this feature is not supported directly; but technically, it can be done).

How do we define "ownership" of coins?

By looking at the Script. There is nothing else. If someone can break ECDSA, then that person owns almost all coins, which have known public keys (almost, because it is possible to make a Script, where knowing the private key is not enough to move it).

[Niekko]

Did the puzzle creator specify what "real solving" means?

No.

No, but he was hoping for a united community that would collaborate on finding a solution. Instead, we have a community that creates bots to steal from each other. Quite a success, I’d say.

[analyticnomad]

How long does it take to NOT be a "newbie" anymore on this forum?

[crytoestudo]

Kowalla could present us with his code. I believe it must be the best code ever written. but he will never do that, I believe.

Guys im using BitCrack$ on vast.ai but the speed he give me is target 3079.36 MKey/s  how you guys manage to push at 4090 7 GK?  thank you

Check out my GitHub (Vanitysearch-bitcrack), 6.8/6.9 bk/s on a 4090.

I’m working on a version without prefixes and other useless stuff, plus some optimizations. It’ll hit 7.1 bk/s, and I’m planning to release it in the next few weeks

[uvindele]

Kowalla could present us with his code. I believe it must be the best code ever written. but he will never do that, I believe.

Guys im using BitCrack$ on vast.ai but the speed he give me is target 3079.36 MKey/s  how you guys manage to push at 4090 7 GK?  thank you

Check out my GitHub (Vanitysearch-bitcrack), 6.8/6.9 bk/s on a 4090.

I’m working on a version without prefixes and other useless stuff, plus some optimizations. It’ll hit 7.1 bk/s, and I’m planning to release it in the next few weeks

He's the man who won’t tell you where he found $50, because he’s saving the spot for tomorrow — and he’s already calculated the odds are better for him.

[analyticnomad]

Kowalla could present us with his code. I believe it must be the best code ever written. but he will never do that, I believe.

Guys im using BitCrack$ on vast.ai but the speed he give me is target 3079.36 MKey/s  how you guys manage to push at 4090 7 GK?  thank you

Check out my GitHub (Vanitysearch-bitcrack), 6.8/6.9 bk/s on a 4090.

I’m working on a version without prefixes and other useless stuff, plus some optimizations. It’ll hit 7.1 bk/s, and I’m planning to release it in the next few weeks

He's the man who won’t tell you where he found $50, because he’s saving the spot for tomorrow — and he’s already calculated the odds are better for him.

He would absolutely tell you where and how he found $50 but he's not going to fly you out first class and give you a piggy back ride to the spot.

[crytoestudo]

But it would be really cool if he released the code, because FixedPaul, Alberto, Benjade Jean Lucas, RC, and several colleagues did this for the community and cryptography's knowledge. But it's his right not to share it. Who knows, maybe one day we'll have the pleasure of seeing this code. And I say this as someone curious about computing.

Kowalla could present us with his code. I believe it must be the best code ever written. but he will never do that, I believe.

Guys im using BitCrack$ on vast.ai but the speed he give me is target 3079.36 MKey/s  how you guys manage to push at 4090 7 GK?  thank you

Check out my GitHub (Vanitysearch-bitcrack), 6.8/6.9 bk/s on a 4090.

I’m working on a version without prefixes and other useless stuff, plus some optimizations. It’ll hit 7.1 bk/s, and I’m planning to release it in the next few weeks

He's the man who won’t tell you where he found $50, because he’s saving the spot for tomorrow — and he’s already calculated the odds are better for him.

He would absolutely tell you where and how he found $50 but he's not going to fly you out first class and give you a piggy back ride to the spot.

[analyticnomad]

But it would be really cool if he released the code, because FixedPaul, Alberto, Benjade Jean Lucas, RC, and several colleagues did this for the community and cryptography's knowledge. But it's his right not to share it. Who knows, maybe one day we'll have the pleasure of seeing this code. And I say this as someone curious about computing.

Kowalla could present us with his code. I believe it must be the best code ever written. but he will never do that, I believe.

Guys im using BitCrack$ on vast.ai but the speed he give me is target 3079.36 MKey/s  how you guys manage to push at 4090 7 GK?  thank you

Check out my GitHub (Vanitysearch-bitcrack), 6.8/6.9 bk/s on a 4090.

I’m working on a version without prefixes and other useless stuff, plus some optimizations. It’ll hit 7.1 bk/s, and I’m planning to release it in the next few weeks

He's the man who won’t tell you where he found $50, because he’s saving the spot for tomorrow — and he’s already calculated the odds are better for him.

He would absolutely tell you where and how he found $50 but he's not going to fly you out first class and give you a piggy back ride to the spot.

People contribute in their own ways. He certainly has, along with quite a few other people on here. Honestly, its our fault for playing a game we don't completely understand. Just keep trying to learn and/or hire a dev on Upwork.

[crytoestudo]

As I said, I'm curious about computers, but I have my own code that makes it very fast. I improved the vanity. I won't need to hire anyone. Anyway, thanks for your help.

But it would be really cool if he released the code, because FixedPaul, Alberto, Benjade Jean Lucas, RC, and several colleagues did this for the community and cryptography's knowledge. But it's his right not to share it. Who knows, maybe one day we'll have the pleasure of seeing this code. And I say this as someone curious about computing.

Kowalla could present us with his code. I believe it must be the best code ever written. but he will never do that, I believe.

Guys im using BitCrack$ on vast.ai but the speed he give me is target 3079.36 MKey/s  how you guys manage to push at 4090 7 GK?  thank you

Check out my GitHub (Vanitysearch-bitcrack), 6.8/6.9 bk/s on a 4090.

I’m working on a version without prefixes and other useless stuff, plus some optimizations. It’ll hit 7.1 bk/s, and I’m planning to release it in the next few weeks

He's the man who won’t tell you where he found $50, because he’s saving the spot for tomorrow — and he’s already calculated the odds are better for him.

He would absolutely tell you where and how he found $50 but he's not going to fly you out first class and give you a piggy back ride to the spot.

People contribute in their own ways. He certainly has, along with quite a few other people on here. Honestly, its our fault for playing a game we don't completely understand. Just keep trying to learn and/or hire a dev on Upwork.

[analyticnomad]

As I said, I'm curious about computers, but I have my own code that makes it very fast. I improved the vanity. I won't need to hire anyone. Anyway, thanks for your help.

But it would be really cool if he released the code, because FixedPaul, Alberto, Benjade Jean Lucas, RC, and several colleagues did this for the community and cryptography's knowledge. But it's his right not to share it. Who knows, maybe one day we'll have the pleasure of seeing this code. And I say this as someone curious about computing.

Kowalla could present us with his code. I believe it must be the best code ever written. but he will never do that, I believe.

Guys im using BitCrack$ on vast.ai but the speed he give me is target 3079.36 MKey/s  how you guys manage to push at 4090 7 GK?  thank you

Check out my GitHub (Vanitysearch-bitcrack), 6.8/6.9 bk/s on a 4090.

I’m working on a version without prefixes and other useless stuff, plus some optimizations. It’ll hit 7.1 bk/s, and I’m planning to release it in the next few weeks

He's the man who won’t tell you where he found $50, because he’s saving the spot for tomorrow — and he’s already calculated the odds are better for him.

He would absolutely tell you where and how he found $50 but he's not going to fly you out first class and give you a piggy back ride to the spot.

People contribute in their own ways. He certainly has, along with quite a few other people on here. Honestly, its our fault for playing a game we don't completely understand. Just keep trying to learn and/or hire a dev on Upwork.

Well I do. You for hire? lol jk

[crytoestudo]

lol cool friend! knowledge is really cool and you can never have too much.

As I said, I'm curious about computers, but I have my own code that makes it very fast. I improved the vanity. I won't need to hire anyone. Anyway, thanks for your help.

But it would be really cool if he released the code, because FixedPaul, Alberto, Benjade Jean Lucas, RC, and several colleagues did this for the community and cryptography's knowledge. But it's his right not to share it. Who knows, maybe one day we'll have the pleasure of seeing this code. And I say this as someone curious about computing.

Kowalla could present us with his code. I believe it must be the best code ever written. but he will never do that, I believe.

Guys im using BitCrack$ on vast.ai but the speed he give me is target 3079.36 MKey/s  how you guys manage to push at 4090 7 GK?  thank you

Check out my GitHub (Vanitysearch-bitcrack), 6.8/6.9 bk/s on a 4090.

I’m working on a version without prefixes and other useless stuff, plus some optimizations. It’ll hit 7.1 bk/s, and I’m planning to release it in the next few weeks

He's the man who won’t tell you where he found $50, because he’s saving the spot for tomorrow — and he’s already calculated the odds are better for him.

He would absolutely tell you where and how he found $50 but he's not going to fly you out first class and give you a piggy back ride to the spot.

People contribute in their own ways. He certainly has, along with quite a few other people on here. Honestly, its our fault for playing a game we don't completely understand. Just keep trying to learn and/or hire a dev on Upwork.

Well I do. You for hire? lol jk

[farou9]

why does it feel unbelievable and so hard to believe kangaroos jumping will land on the same poinjt i have been trying for a year now to understand it but it still wont represent it self clearly

[kTimesG]

why does it feel unbelievable and so hard to believe kangaroos jumping will land on the same poinjt i have been trying for a year now to understand it but it still wont represent it self clearly

If it took you a year to grasp why the method works, and still don't get it, I suggest maybe spending your time on more productive things. If it's still unclear after all the diagrams, pictures, and the dozens of academic papers, not sure what more you'd expect (except some magic software that finds solution of 135 in less than 20 seconds maybe).

[farou9]

why does it feel unbelievable and so hard to believe kangaroos jumping will land on the same poinjt i have been trying for a year now to understand it but it still wont represent it self clearly

If it took you a year to grasp why the method works, and still don't get it, I suggest maybe spending your time on more productive things. If it's still unclear after all the diagrams, pictures, and the dozens of academic papers, not sure what more you'd expect (except some magic software that finds solution of 135 in less than 20 seconds maybe).

i just couldnt find a paper i could understand i know it work but how howw , if i could get the concept and implement it in numbers rather then points maybe it could be easier to understand , what do we need to make lets say k=20 and the range upper bound 32 collide ,what do we doo in here?

 

[uvindele]

why does it feel unbelievable and so hard to believe kangaroos jumping will land on the same poinjt i have been trying for a year now to understand it but it still wont represent it self clearly

If it took you a year to grasp why the method works, and still don't get it, I suggest maybe spending your time on more productive things. If it's still unclear after all the diagrams, pictures, and the dozens of academic papers, not sure what more you'd expect (except some magic software that finds solution of 135 in less than 20 seconds maybe).

i just couldnt find a paper i could understand i know it work but how howw , if i could get the concept and implement it in numbers rather then points maybe it could be easier to understand , what do we need to make lets say k=20 and the range upper bound 32 collide ,what do we doo in here?

 

Is this easy enough for you?

Range: 0..63
Key: 20
Tame starts at 32
Jumps: even → +2

Tame:
32 → 34 → 36 → 38 → 40 → …

Wild (20):
20 → 22 → 24 → 26 → 28 → 30 → 32

Meeting point: 32.

Total wild jumps = 12.

k = 32 − 12 = 20

[farou9]

why does it feel unbelievable and so hard to believe kangaroos jumping will land on the same poinjt i have been trying for a year now to understand it but it still wont represent it self clearly

If it took you a year to grasp why the method works, and still don't get it, I suggest maybe spending your time on more productive things. If it's still unclear after all the diagrams, pictures, and the dozens of academic papers, not sure what more you'd expect (except some magic software that finds solution of 135 in less than 20 seconds maybe).

i just couldnt find a paper i could understand i know it work but how howw , if i could get the concept and implement it in numbers rather then points maybe it could be easier to understand , what do we need to make lets say k=20 and the range upper bound 32 collide ,what do we doo in here?

 

Is this easy enough for you?

Range: 0..63
Key: 20
Tame starts at 32
Jumps: even → +2

Tame:
32 → 34 → 36 → 38 → 40 → …

Wild (20):
20 → 22 → 24 → 26 → 28 → 30 → 32

Meeting point: 32.

Total wild jumps = 12.

k = 32 − 12 = 20

your example doesnt implement anything towards the main logic the kangaroos depends on which is the birthday paradox , but thanks anyway this makes a little improvement in my view of understanding the key is the sum of the jumps minus the starting tame k

[mjojo]

why does it feel unbelievable and so hard to believe kangaroos jumping will land on the same poinjt i have been trying for a year now to understand it but it still wont represent it self clearly

your example doesnt implement anything towards the main logic the kangaroos depends on which is the birthday paradox , but thanks anyway this makes a little improvement in my view of understanding the key is the sum of the jumps minus the starting tame k

Did you read paper form Matthew Musson?
the title is "Attacking the elliptical curve discrete logarithm problem"

[brainless]

Today I am uploading 400 million addresses list, which u guy can use with bitcrack pinkachunka ver, and their method to find puzzle 135, these list I generate with manual calculation as per kangaroo method, and believe could find key better then 1 key by rckangaroo etc
Let me up upload list rest discussion how to use later