Bitcoin Forum
March 10, 2026, 12:07:24 AM *
News: Latest Bitcoin Core release: 30.2 [Torrent]
 
   Home   Help Search Login Register More  
Pages: « 1 ... 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 [373] 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 ... 639 »
  Print  
Author Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it  (Read 372744 times)
nomachine
Full Member
***
Offline Offline

Activity: 798
Merit: 134



View Profile
February 21, 2025, 05:30:16 PM
 #7441

A random number is a random number.

I can solve puzzle 40 in a reasonable amount of time using random numbers and a brute-force approach, whether I use Rust, C++, or any other programming language.

However, puzzle 68 is 268,435,456 times larger than puzzle 40 in terms of the range of numbers that must be generated.

Generating numbers in such a large range is not at all the same as generating numbers for puzzle 40. The computational complexity increases exponentially, making brute-force methods impractical for puzzle 68.

The other methods, such as the Kangaroo method, are very effective. However, if there is no public key, this approach becomes a dead end for ordinary computer users.

BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
WanderingPhilospher
Sr. Member
****
Offline Offline

Activity: 1484
Merit: 285

Shooters Shoot...


View Profile
February 21, 2025, 05:36:37 PM
 #7442

I have zero interest whether you read or understand my posts. Why are you replying to them, what good does it do to you, or anyone? You have ZERO merit after well a hundred posts, which indicates that if there was a downvote button, your merit would be a triple digit, but with a big minus in front of it. So what are you trying to do, nobody cares about your prefixes, methods, or anything. Well, maybe mcdouglas, but hopefully I already proved to him in a very empirical and practical way what his fallacy was, in trying to somehow acknowledge your ideas.

Also your last statement makes zero sense. You do realize that brute force / guessing means that after you scan 50% of some range you go above more chances of success than not, right? Actually, I don't need you to respond, so please don't bother.

False information is always false information.
You said they scan 57%.

Be careful too. Don't give people wrong directions or information. I said they scan 57% of what they consider PROBABILITY.

Again, by giving wrong information, you are ignoring PROBABILITY.
I have said many times before that it is possible to be between 6D-77.
I also said I am not interested in the rest.

I don't need support from anyone with a value or a button. Do you need it?

Stats say, on average, you will find the key at 50%. It may take you 1% one time, and 99% the next time. I have seen the last 2, 66 and 67, both solved around the average of 50%.
deep_seek
Newbie
*
Offline Offline

Activity: 23
Merit: 0


View Profile
February 21, 2025, 05:37:56 PM
 #7443


Be careful too. Don't give people wrong directions or information. I said they scan 57% of what they consider PROBABILITY.


https://www.talkimg.com/images/2025/02/21/qkDOG.png

There are no probability or anything in cryptography only a wishful thinking..
Akito S. M. Hosana
Jr. Member
*
Offline Offline

Activity: 420
Merit: 8


View Profile
February 21, 2025, 05:43:15 PM
 #7444

A random number is a random number.

I can solve puzzle 40 in a reasonable amount of time using random numbers and a brute-force approach, whether I use Rust, C++, or any other programming language.

However, puzzle 68 is 268,435,456 times larger than puzzle 40 in terms of the range of numbers that must be generated.

Generating numbers in such a large range is not at all the same as generating numbers for puzzle 40. The computational complexity increases exponentially, making brute-force methods impractical for puzzle 68.

The other methods, such as the Kangaroo method, are very effective. However, if there is no public key, this approach becomes a dead end for ordinary computer users.

If Puzzle 67 was solved , it was likely achieved using a combination of ASICs, optimized algorithms, and possibly distributed computing. They certainly don't have potatoes. Smiley
Baskentliia
Jr. Member
*
Offline Offline

Activity: 75
Merit: 1


View Profile
February 21, 2025, 07:28:52 PM
 #7445

Can anyone share how to create the raw tx for MARA step by step and what code I need to create this tx?
dastic
Jr. Member
*
Offline Offline

Activity: 35
Merit: 1


View Profile
February 21, 2025, 07:42:30 PM
 #7446

Can anyone share how to create the raw tx for MARA step by step and what code I need to create this tx?

You can use even electrum, or ask chat gpt he will make you a script. Have you found the key ? Cause you asking like you have found it already.
Baskentliia
Jr. Member
*
Offline Offline

Activity: 75
Merit: 1


View Profile
February 21, 2025, 08:26:22 PM
 #7447

Can anyone share how to create the raw tx for MARA step by step and what code I need to create this tx?

You can use even electrum, or ask chat gpt he will make you a script. Have you found the key ? Cause you asking like you have found it already.



puzzle 66 was found by a newbie and stolen by bots.
Now Mara has been discovered. But there are not many people who know how to use it. So helping people
If anyone knows how to use Mara. A detailed explanation would be helpful. Maybe someone lucky will find it, don't let the bots lose it.
gygy
Newbie
*
Offline Offline

Activity: 24
Merit: 0


View Profile
February 21, 2025, 08:56:23 PM
 #7448

Can anyone share how to create the raw tx for MARA step by step and what code I need to create this tx?

You can use even electrum, or ask chat gpt he will make you a script. Have you found the key ? Cause you asking like you have found it already.



puzzle 66 was found by a newbie and stolen by bots.
Now Mara has been discovered. But there are not many people who know how to use it. So helping people
If anyone knows how to use Mara. A detailed explanation would be helpful. Maybe someone lucky will find it, don't let the bots lose it.

Mara was already a well-known thing when puzzle 66 was stolen. You definitely need to use Mara. And it is confirmed that you can somewhat trust them. Using Mara is easy. You sing the transaction but DO NOT broadcast. Export it and copy it to Mara Slipstream. That's all. Solving the puzzle is the hard part.
bibilgin
Newbie
*
Offline Offline

Activity: 276
Merit: 0


View Profile
February 21, 2025, 09:21:40 PM
 #7449

puzzle 66 was found by a newbie and stolen by bots.
Now Mara has been discovered. But there are not many people who know how to use it. So helping people
If anyone knows how to use Mara. A detailed explanation would be helpful. Maybe someone lucky will find it, don't let the bots lose it.

1- First, you perform the transaction here. You take raw TX out.
https://bitcoin.stackexchange.com/questions/103452/how-to-create-a-signed-transaction-offline-using-electrum

2- Go to slipstream.mara.com and paste it, and follow what is given to you.

It's that simple. Smiley
Menowa*
Newbie
*
Offline Offline

Activity: 53
Merit: 0


View Profile
February 21, 2025, 10:30:02 PM
 #7450

Lets see how long its gonna take to solve 68
hoanghuy2912
Newbie
*
Offline Offline

Activity: 60
Merit: 0


View Profile
February 22, 2025, 04:36:39 AM
 #7451

To be able to use keyhunt's bsgs mode to scan and solve puzzle 135 as fast as possible, how many CPU threads and RAM are needed at the same time? How long does it take to scan the range 4000000000000000000000000000000000:4ffffffffffffffffffffffffffffffffffff?
Jorge54PT
Newbie
*
Offline Offline

Activity: 45
Merit: 0


View Profile
February 22, 2025, 05:16:51 AM
 #7452

Many Teras of RAM Smiley
Baskentliia
Jr. Member
*
Offline Offline

Activity: 75
Merit: 1


View Profile
February 22, 2025, 08:28:23 AM
 #7453

Hello, can you share the bech32 address for puzzle 68?
1MVDYgVaSN6iKKESbzRUAYFrYJadLYZvvZ
elPato85
Newbie
*
Offline Offline

Activity: 14
Merit: 12


View Profile
February 22, 2025, 08:43:42 AM
 #7454

What is your speed with Keyhunt BSGS? And what hardware do you use to run it?
tmar777
Newbie
*
Offline Offline

Activity: 33
Merit: 0


View Profile
February 22, 2025, 09:03:15 AM
 #7455

This puzzle is very strange. If it's for measuring the world's brute forcing capacity, 161-256 are just a waste (RIPEMD160 entropy is filled by 160, and by all of P2PKH Bitcoin). The puzzle creator could improve the puzzle's utility without bringing in any extra funds from outside - just spend 161-256 across to the unsolved portion 51-160, and roughly treble the puzzle's content density.

If on the other hand there's a pattern to find... well... that's awfully open-ended... can we have a hint or two? Cheesy

I am the creator.

You are quite right, 161-256 are silly.  I honestly just did not think of this.  What is especially embarrassing, is this did not occur to me once, in two years.  By way of excuse, I was not really thinking much about the puzzle at all.

I will make up for two years of stupidity.  I will spend from 161-256 to the unsolved parts, as you suggest.  In addition, I intend to add further funds.  My aim is to boost the density by a factor of 10, from 0.001*length(key) to 0.01*length(key).  Probably in the next few weeks.  At any rate, when I next have an extended period of quiet and calm, to construct the new transaction carefully.

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

Finally, I wish to express appreciation of the efforts of all developers of new cracking tools and technology.  The "large bitcoin collider" is especially innovative and interesting!

I've been analyzing the puzzle formation algorithm for two years. Just look at this information. After you figure this out, I'm ready for further dialogue.
https://i.postimg.cc/dVHh5k8h/XLS.jpg

It's part of the algorithm, there's another part, but what's the point of it all if the bots take the entire reward?

DM me, I may help further.
mjojo
Newbie
*
Offline Offline

Activity: 87
Merit: 0


View Profile
February 22, 2025, 09:51:43 AM
 #7456

Hello, can you share the bech32 address for puzzle 68?
1MVDYgVaSN6iKKESbzRUAYFrYJadLYZvvZ
bc1quzu29whwrdmlcup52hee6528w3gler8u2ha9xa
ronin445
Newbie
*
Offline Offline

Activity: 30
Merit: 0


View Profile
February 22, 2025, 10:17:13 AM
 #7457

congrats to the puzzlesolver 67
kTimesG
Full Member
***
Offline Offline

Activity: 756
Merit: 236


View Profile
February 22, 2025, 11:06:31 AM
 #7458

To be able to use keyhunt's bsgs mode to scan and solve puzzle 135 as fast as possible, how many CPU threads and RAM are needed at the same time? How long does it take to scan the range 4000000000000000000000000000000000:4ffffffffffffffffffffffffffffffffffff?

Puzzle 135 range size: 2134

BSGS requirements:

1. Fast memory baby table: sqrt(N) items = 267 items
Item size: 256 bits in full; let's assume we only need the first 67 bits and ignore hash collision overhead

Total memory required: 267 * 67 bits = somewhere between 273 to 274 bits

The total amount of data stored on Earth in 2018 was 33 zettabytes. That is, 278 bits.

Estimates for 2025 are around 175 zettabytes. That s, all of the hard drives that exist on Earth have some total capacity of around 280 bits.

The amount of RAM is less than a fraction of all that (if you don't believe this, check any PC: what's the ratio between RAM and storage capacity?)

2. How many threads?

EC operations required at most: sqrt(N) for baby steps + sqrt(N) for giant steps = 2 * sqrt(N) steps

That is, 268 elliptic curve group operations.

A high-end CPU can do around 15 to 20 Mo/s per thread. However, we also need to check the table after every giant step. I will ignore this and assume it is a no-op (it's not).

Total threads needed to solve in one second: 268 / 20.000.000 = 14,757,395,258,968

In summary:

RAM: 1 to 2 zettabytes
CPU threads: 14.8 trillion (for 1 second of total work)

Off the grid, training pigeons to broadcast signed messages.
Akito S. M. Hosana
Jr. Member
*
Offline Offline

Activity: 420
Merit: 8


View Profile
February 22, 2025, 02:08:11 PM
Last edit: February 22, 2025, 02:23:41 PM by Akito S. M. Hosana
 #7459

The numbers involved are so large and abnormal that half the people in this thread believe it’s a conspiracy whenever someone claims BTC from a puzzle. Some even think the creator is taking the prize for themselves Grin
mitkopasa
Newbie
*
Offline Offline

Activity: 7
Merit: 0


View Profile
February 22, 2025, 02:15:46 PM
 #7460

puzzle 66 was found by a newbie and stolen by bots.
Now Mara has been discovered. But there are not many people who know how to use it. So helping people
If anyone knows how to use Mara. A detailed explanation would be helpful. Maybe someone lucky will find it, don't let the bots lose it.

1- First, you perform the transaction here. You take raw TX out.
https://bitcoin.stackexchange.com/questions/103452/how-to-create-a-signed-transaction-offline-using-electrum

2- Go to slipstream.mara.com and paste it, and follow what is given to you.

It's that simple. Smiley

Thanks for the info. but according to the link you gave, won't the publickey be exposed when I sign raw tx in my electrum? in this way, aren't we actually broadcasting the transaction? Also, I didn't see such a step in the new version electrum. the question I asked may seem simple and funny to you, but I am trying to understand how people like me who don't know much can achieve this.
Pages: « 1 ... 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 [373] 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 ... 639 »
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!