Bitcoin Forum
January 06, 2026, 01:26:42 PM *
News: Latest Bitcoin Core release: 30.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: « 1 ... 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 [488] 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 ... 624 »
  Print  
Author Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it  (Read 361432 times)
bitcoinpuzzles621
Newbie
*
Offline Offline

Activity: 15
Merit: 0


View Profile
May 02, 2025, 03:40:10 AM
 #9741

Maybe someone has had a breakthrough and finally found a method that exists that doesnt rely on bruteforce.  Wouldnt that be the only thing to explain that most recent puzzle being solved so fast?   Unless many of you just believe it was bruteforce with dumb luck.
nxtime
Newbie
*
Offline Offline

Activity: 7
Merit: 0


View Profile
May 02, 2025, 03:53:11 AM
 #9742

I have some great ideas, but my only problem is converting the private key to hash160 using CUDA. I have various algorithms in mind. Can someone explain to me how to convert a private key to hash160 using CUDA?
All brute-forcing programs do it already. Hash160 is the same as the address, just a different representation of it.


They're all doing the classic stuff — strip, rstrip, and the usual. I'm thinking of different things. I do some of those partially, but what I need is CUDA code that will convert a set of private keys (which are different from each other — not sequential, more like random) into hash160. I don't fully understand CUDA and I get lost in the code. If you help me, I believe I can solve most of the puzzles.
nochkin
Member
**
Offline Offline

Activity: 88
Merit: 14


View Profile
May 02, 2025, 03:54:01 AM
 #9743

Unless many of you just believe it was bruteforce with dumb luck.
Brute-force is always a luck. No matter if you start at the beginning, the end or random.

They're all doing the classic stuff — strip, rstrip, and the usual.
Nope. They do convert from private key to h160, not just strip, rstrip.
nxtime
Newbie
*
Offline Offline

Activity: 7
Merit: 0


View Profile
May 02, 2025, 04:01:59 AM
 #9744

Unless many of you just believe it was bruteforce with dumb luck.
Brute-force is always a luck. No matter if you start at the beginning, the end or random.

They're all doing the classic stuff — strip, rstrip, and the usual.
Nope. They do convert from private key to h160, not just strip, rstrip.


but not exactly the way I want. Still, I'll take a closer look. The program I have in mind is something like BSGS, but without a public key. Also, I had generated the first 36 bits of puzzle number 69 using AI, but someone else found the solution before I could reach it.
nightdreams
Newbie
*
Offline Offline

Activity: 5
Merit: 0


View Profile
May 02, 2025, 04:26:57 AM
 #9745

Maybe someone has had a breakthrough and finally found a method that exists that doesnt rely on bruteforce.  Wouldnt that be the only thing to explain that most recent puzzle being solved so fast?   Unless many of you just believe it was bruteforce with dumb luck.

Not only 1 ppl is cracking this. There are thousand of people cracking this. Some of them have thousand of GPU, I think it is possible crack it within 1 month with some luck for puzzle 69
AlanJohnson
Member
**
Offline Offline

Activity: 185
Merit: 11


View Profile
May 02, 2025, 06:50:10 AM
 #9746

the key was found after 0.7206% of the range.

So someone solved puzzle 69 using a modified Cyclone in 20 days?  Huh
Hi all! Modified version with jumps and partial match: https://github.com/Dookoo2/Cyclone
Try your luck:)

It seems shady...

The "updated" version of Dookoo2 Cyclone is only available as compiled Windows binary file (.exe)  without source code available. The source code available on dookoo's github is old and it isn't probably the same code  that was used to compile the new windows .exe file.

I suggest to be very careful here ...
Akito S. M. Hosana
Jr. Member
*
Offline Offline

Activity: 406
Merit: 8


View Profile
May 02, 2025, 07:09:25 AM
 #9747

Dookoo2/Cyclone.exe DON'T WORK random!!!

You have to decide which version to use: NoMachine or Dookoo2.

NoMachine has a random option but no jumps.


It seems shady...

The "updated" version of Dookoo2 Cyclone is only available as compiled Windows binary file (.exe)  without source code available. The source code available on dookoo's github is old and it isn't probably the same code  that was used to compile the new windows .exe file.

I suggest to be very careful here ...

Yes, a strange situation. Tongue
FrozenThroneGuy
Member
**
Offline Offline

Activity: 72
Merit: 43


View Profile
May 02, 2025, 07:17:29 AM
 #9748

the key was found after 0.7206% of the range.

So someone solved puzzle 69 using a modified Cyclone in 20 days?  Huh
Hi all! Modified version with jumps and partial match: https://github.com/Dookoo2/Cyclone
Try your luck:)

It seems shady...

The "updated" version of Dookoo2 Cyclone is only available as compiled Windows binary file (.exe)  without source code available. The source code available on dookoo's github is old and it isn't probably the same code  that was used to compile the new windows .exe file.

I suggest to be very careful here ...
The source code of WIN is the same as Linux version, you can compile you own .exe with mingw (in the end of readme - it has an instruction, use WSL2 on Windows and a few command in WSL2 Ubuntu for installing mingw compiler).

And I also add “random”, but it is less efficiency than sequential search.
By the way, for random scanning you can use distributed cyclone, srv and client could be at the same PC (it is no affect to speed of scanning). Distributed cyclone splits the whole range into small sub ranges and the client gives random sub range to scan.
nomachine
Full Member
***
Offline Offline

Activity: 784
Merit: 127



View Profile
May 02, 2025, 07:23:02 AM
 #9749

Maybe someone has had a breakthrough and finally found a method that exists that doesnt rely on bruteforce.  Wouldnt that be the only thing to explain that most recent puzzle being solved so fast?   Unless many of you just believe it was bruteforce with dumb luck.

If that method exists and brute force does not have to be used, all puzzles can be solved immediately. For example, if someone guessed the random seed for all puzzles—unless they intend to solve one puzzle per month while pretending to use brute force. Another possibility is that someone hacked the puzzle creator, so they also pretend to use brute force to avoid detection. A third possibility is that the creator is joking with us. There's no such thing as dumb luck.  Grin

BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
papiro08
Newbie
*
Offline Offline

Activity: 15
Merit: 0


View Profile
May 02, 2025, 07:33:00 AM
 #9750

It seems very strange and very soon for someone to discover the code of 69, and all this happened at a time that is suspicious. Huh  Grin
Akito S. M. Hosana
Jr. Member
*
Offline Offline

Activity: 406
Merit: 8


View Profile
May 02, 2025, 07:34:15 AM
 #9751

There's no such thing as dumb luck.  Grin


how exactly is dumb luck suddenly working this year when it hasn’t worked for the past four years?  Tongue
nomachine
Full Member
***
Offline Offline

Activity: 784
Merit: 127



View Profile
May 02, 2025, 07:47:08 AM
 #9752

There's no such thing as dumb luck.  Grin


how exactly is dumb luck suddenly working this year when it hasn’t worked for the past four years?  Tongue

Who knows? Maybe last year, the private key for Puzzle 69 wasn’t at 0.7206% of the range.  Grin

BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
Feron
Jr. Member
*
Offline Offline

Activity: 69
Merit: 1


View Profile
May 02, 2025, 07:48:09 AM
Last edit: May 02, 2025, 10:29:15 AM by hilariousandco
 #9753

Even if you had a miracle code, you still need the computing power of at least a few graphics cards or 1000 cores.if you want to solve it before the competition
By the way, the fewer people solving this puzzle, the better.
because it is now increasingly difficult for those who do not have computing power

64 took so long to solve because a few people were trying to solve it, when you compare it to 63 which Zielar solved in 3 days, it must have been frustrating.
and now a whole army of people are cracking it
by the way 63 Zielar solved it with 3 graphics cards
nomachine
Full Member
***
Offline Offline

Activity: 784
Merit: 127



View Profile
May 02, 2025, 08:17:13 AM
 #9754

64 took so long to solve because a few people were trying to solve it, when you compare it to 63 which Zielar solved in 3 days, it must have been frustrating.
and now a whole army of people are cracking it
by the way 63 Zielar solved it with 3 graphics cards

Statistically speaking, there must be another puzzle within 0.7% of the starting range—specifically, between 71 and 160. But which one? Grin

BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
yxlm2003
Newbie
*
Offline Offline

Activity: 8
Merit: 0


View Profile
May 02, 2025, 08:30:50 AM
 #9755

64 took so long to solve because a few people were trying to solve it, when you compare it to 63 which Zielar solved in 3 days, it must have been frustrating.
and now a whole army of people are cracking it
by the way 63 Zielar solved it with 3 graphics cards

Statistically speaking, there must be another puzzle within 0.7% of the starting range—specifically, between 71 and 160. But which one? Grin
       

It will be resolved within a month
AlanJohnson
Member
**
Offline Offline

Activity: 185
Merit: 11


View Profile
May 02, 2025, 08:39:50 AM
 #9756

64 took so long to solve because a few people were trying to solve it, when you compare it to 63 which Zielar solved in 3 days, it must have been frustrating.
and now a whole army of people are cracking it
by the way 63 Zielar solved it with 3 graphics cards

Statistically speaking, there must be another puzzle within 0.7% of the starting range—specifically, between 71 and 160. But which one? Grin
       

It will be resolved within a month

No ... 160 will be not solved even in few years...
HABJo12
Newbie
*
Offline Offline

Activity: 21
Merit: 0


View Profile
May 02, 2025, 08:51:10 AM
 #9757

Guys Please try to make your own creative code whether C++ or python or if you are using even others code try to analyze it before running it on your device , being eager to get the prize may lead you to not getting after even getting the hex .
yxlm2003
Newbie
*
Offline Offline

Activity: 8
Merit: 0


View Profile
May 02, 2025, 09:02:53 AM
 #9758

Guys Please try to make your own creative code whether C++ or python or if you are using even others code try to analyze it before running it on your device , being eager to get the prize may lead you to not getting after even getting the hex .

Offline Scan
bibilgin
Newbie
*
Offline Offline

Activity: 275
Merit: 0


View Profile
May 02, 2025, 09:37:03 AM
 #9759

ok first send me a declaration with    you name
                                                                                   last name
                                                                                   birth day
                                                                                   who you leave  and dont forget you id to scan and put on that file can you send me PDF ON ME EMAIL  
                                                                                   and write that you accept this just for education ok and i make oficial with video

Okay, let's do it like this.
I'll open Teamviewer, Anydesk, Anyviewer or RDP for you, it'll be faster. Okay? lol

Come on kid, to another playground. Don't talk nonsense without knowing who the other person is.
nomachine
Full Member
***
Offline Offline

Activity: 784
Merit: 127



View Profile
May 02, 2025, 09:56:39 AM
 #9760

I think I’ve approached all of this the wrong way.

I’m offering a 0.1 BTC bounty for the formal proof of any traversal method that provides a statistical edge over a linear scan for puzzle 69. By statistical edge I mean that this new traversal method running on a statistically significant number of executions requires significantly fewer checks (let’s put the threshold at 5%) to find the key.

Conditions :
- Has to be written using math semantics. Not “where does John lives” metaphors.
- Has to be empirically validated using a python / nodeJS script.
- First one posting it to this thread will be recipient of the bounty.

I can show you my method—it has nothing to do with random or sequential search or patterns. It's pure statistics. But it would be stupid to make it public for obvious reasons. This has to be a private message. Grin

BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
Pages: « 1 ... 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 [488] 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 ... 624 »
  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!