Bitcoin puzzle transaction ~32 BTC prize to who solves it

[brainless]

70 was found in minutes becouse of Pubkey availability. 69 was found fast becouse Privkey was at very begining of range.

BR
Damian

70 was not solve in minutes
People's were around 46 puzzle, when pubkey was released
And first telaurist found way of pollard kangaroo method and apply at CPU level, and takes days and month when he pick keys, till 70 bit range, later he applied gpu and slowly reach at 100 bit and stop, remember that time 1080 ti were highest gpu
Today etc 5090 found 80 bit in minutes at kangaroo method for pubkey
Those time frame were still same as today,

[kTimesG]

0,001 is almost zero and 0,00001 is almost zero. To be precise, if You have RTX 5090 and good software and You run it all day long (24h) Your chance to solve 71st puzzle is 0,0000002. In other words, You need 5.500.000 days / 15.000 Years to be 100% sure that You solve it (or 7.500 Years to have 50% chance )

135 is even worse.

If 135 is "even worse" then how come it's around 6 to 7 times computationally more cheap to solve it then 71?

I'd say it will go down by this summer, if not sooner.

[Bram24732]

0,001 is almost zero and 0,00001 is almost zero. To be precise, if You have RTX 5090 and good software and You run it all day long (24h) Your chance to solve 71st puzzle is 0,0000002. In other words, You need 5.500.000 days / 15.000 Years to be 100% sure that You solve it (or 7.500 Years to have 50% chance )

135 is even worse.

If 135 is "even worse" then how come it's around 6 to 7 times computationally more cheap to solve it then 71?

I'd say it will go down by this summer, if not sooner.

As soon as someone works on it 😮

[Bitcoin71]

Any new updates?

This puzzle is harder trickier than what we all thought!

Does anyone have a useful method or anyone thought or any suggestions for a useful method?

[ArtificialLove]

I still didn't get an answer, the question was not whether they are close or not, the question was what you guys would have done if you were suspecting some similar addresses are close to the key, scan the space between, avoid the space, etc. I don't have a 5090 and I randomly do random searches whenever I feel like it, so I'd appreciate your thoughts, and again, someone else talked about patterns, but however, based on your very own logic there's no way for any of you to believe (and so strongly) that those two are not or cannot be close, just saying.

[0xastraeus]

Long time lurker, first time poster.

I see alot of new people joining in, I'm gonna clear things up.

I still didn't get an answer, the question was not whether they are close or not, the question was what you guys would have done if you were suspecting some similar addresses are close to the key, scan the space between, avoid the space, etc. I don't have a 5090 and I randomly do random searches whenever I feel like it, so I'd appreciate your thoughts, and again, someone else talked about patterns, but however, based on your very own logic there's no way for any of you to believe (and so strongly) that those two are not or cannot be close, just saying.

Search the whole space buddy don't skip, there's no way of knowing if the key is right next to the address or at the far end of the space. The avalanche effect takes place, one small change in the input (i.e. the private key) will result in a completely different output (i.e. the address) https://ieeexplore.ieee.org/document/9923931. But sure there's logical exclusions you can make like it's most likely not gonna be in 400000010000000000:40000001FFFFFFFFFF but you never know truly.

Prefix search mean nothing, we had a whole discussion on this already and there's still an on going one in the development area, it's just random search with extra steps but I can see it being good for lower end computers to jump around the large keyspace. Your best bet is to generate a starting point and scan sequentially:
here's a quick way to generate a 8-char prefix

Code:

import random

# Generate 8-char prefix
prefix = random.getrandbits(30) | (1 << 30)

# Generate range
addr_range = f"{prefix:0<18x}:{prefix:F<18x}"
print(addr_range)

output:
57e913510000000000:57e91351FFFFFFFFFF

In terms of puzzle 71 and puzzle 135 - 135 time complexity is O(sqrt(N)) due to pub exposure meaning its sqrt(2¹³⁵) so the complexity of 135 is 2^67.5

There's plenty of programs you can use:
FixedPaul's: https://github.com/FixedPaul/VanitySearch-Bitcrack
RCKangaroo: https://github.com/RetiredC/RCKangaroo
Keyhunt: https://github.com/manyunya/KeyHunt-Cuda
WanderingPhilosopher's: https://github.com/WanderingPhilosopher/VanBitCrackenRandom2 (Not open-source)
BitCrack: https://github.com/djmuratb/BitCrack2
Cyclone: https://github.com/Dookoo2/Cyclone
CUDACyclone: https://github.com/Dookoo2/CUDACyclone

Time to disappear and go fishing

[fixedpaul]

I still didn't get an answer, the question was not whether they are close or not, the question was what you guys would have done if you were suspecting some similar addresses are close to the key, scan the space between, avoid the space, etc. I don't have a 5090 and I randomly do random searches whenever I feel like it, so I'd appreciate your thoughts, and again, someone else talked about patterns, but however, based on your very own logic there's no way for any of you to believe (and so strongly) that those two are not or cannot be close, just saying.

Some crazy person around here would tell you to stay away from that space
The reasonable people have already made it clear: it doesn’t change anything, you don’t have any information

[GinnyBanzz]

People should treat the puzzle like the lottery, Depending on your hardware, you can calculate that a given time frame (in my case, a few hours) is the equivalent to buying a single ticket for the euro millions.

Chances are, you're not going to find it, but it's not impossible.

[damiankopacz87]

70 was not solve in minutes

Yes, I know, I was checking if you would want to distract readers from the main plot - searching the puzzle with one GPU is gambling.

If 135 is "even worse" then how come it's around 6 to 7 times computationally more cheap to solve it then 71?

I'd say it will go down by this summer, if not sooner.

It is even worse for "Kowalsky" who wants to brake it with RTX5090 - 0.0000000001 chance that he will breake it in one month. As I said above, its gambling.

Eurojackpot 1st prize win is 0.000000007 probable. Max first prize is 120.000.000 euro. Cost of running/degradation RTX5090 for one month is much higher than one eurojackpot ticket. Prize is higher. Go home folks, nothing to find here.

BR
Damian

[JackMazzoni]

If I have 1 4090. What is my chance of solving puzzle 71 and solving puzzle 135 and compared chance to lottery?

[GinnyBanzz]

If I have 1 4090. What is my chance of solving puzzle 71 and solving puzzle 135 and compared chance to lottery?

Puzzle 71 is 2.36 sextillion possibilities.

Lets assume euromillion odds, that 1 in 140 million.

A 4090 should be capable of 6 billion keys/second.

That means, if you run it constantly, then approx every 47 minutes you have the equivalent chances of a single euro millions ticket.

[damiankopacz87]

Puzzle 71 is 2.36 sextillion possibilities.

Lets assume euromillion odds, that 1 in 140 million.

A 4090 should be capable of 6 billion keys/second.

That means, if you run it constantly, then approx every 47 minutes you have the equivalent chances of a single euro millions ticket.

1/140.000.000=7e^-9
2^70/6.000.000.000 /28s =7e^-9

47 minutes? Am I doing something wrong? It shows 28 seconds...

Anyway, it has to be caled gambling

BR
Damian

[GinnyBanzz]

Puzzle 71 is 2.36 sextillion possibilities.

Lets assume euromillion odds, that 1 in 140 million.

A 4090 should be capable of 6 billion keys/second.

That means, if you run it constantly, then approx every 47 minutes you have the equivalent chances of a single euro millions ticket.

1/140.000.000=7e^-9
2^70/6.000.000.000 /28s =7e^-9

47 minutes? Am I doing something wrong? It shows 28 seconds...

Anyway, it has to be caled gambling

BR
Damian

Ahhh, maths is not my strong point, think I miscalculated somewhere lol.

Well, 28seconds is far better odds, still gambling, but some semblance of a chance.

However, you'd need to calculate power costs to determine if its more financially feasible to try to crack the puzzle or just buy a bunch of euro millions tickets every week.

[damiankopacz87]

However, you'd need to calculate power costs to determine if its more financially feasible to try to crack the puzzle or just buy a bunch of euro millions tickets every week.

Ah, You nasty boot, You did it right, I was just checking.

Anyway, none of this is reasonable, logical nor clever I call it TAX from stupidity.

BR
Damian

[GinnyBanzz]

However, you'd need to calculate power costs to determine if its more financially feasible to try to crack the puzzle or just buy a bunch of euro millions tickets every week.

Ah, You nasty boot, You did it right, I was just checking.

Anyway, none of this is reasonable, logical nor clever I call it TAX from stupidity.

BR
Damian

Ahh haha, I just assume I'm wrong when it comes to maths usually.

It kind of is stupid when you think about it long enough, but it can be fun, it can help people learn new things (the power of cryptography, coding, etc), and, gives you a tiny bit of hope checking on your cracking instance to see if the message "KEY FOUND!" has appeared!

[Redni]

I made a Rust library that includes all b1000 puzzle data: https://github.com/oritwoen/boha

Code:

$ boha list b1000 --unsolved
$ boha show b1000/71
$ boha balance b1000/71

All 256 puzzles with addresses, solved keys (hex + WIF), transaction history, solver attribution where known. Data compiled into binary - no external API needed.
Might be useful for anyone building tools around these puzzles.

[hoanghuy2912]

How many graphics processing units (GPUs) are needed to solve puzzle 135 using the RC Kangaroo in the shortest time?

[gygy]

How many graphics processing units (GPUs) are needed to solve puzzle 135 using the RC Kangaroo in the shortest time?

The shortest possible time is the Planck time, but it’s completely impossible for you to solve it in that amount of time, no matter how many GPUs you have.

[filo1992]

I tested pool 135 t.me/puzzle135, and after winning the 115-bit reward, I was not paid the reward.

If someone can explain to me how to attach files I'll attach the whole conversation with the administrator.

PLEASE BE CAREFUL

[ee1234ee]

I tested pool 135, and after winning the 115-bit reward, I was not paid the reward.

If someone can explain to me how to attach files I'll attach the whole conversation with the administrator.

PLEASE BE CAREFUL

What kind of pool is it?What scanning software are they using for the pool you mentioned? How many GPUs did you use to find puzzle 115?
Are you sure it's a puzzle with a known public key? Nowadays, online public pools are all address based puzzle pools.



You can use   imgbb.com