Bitcoin puzzle transaction ~32 BTC prize to who solves it

[nomachine]

for a couple of seconds it gave 1000 Mkeys/sec, and then the speed dropped 

test1

# ./mutagen -p 38 -f 3

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 38 (38-bit)
Target HASH160: b190e2d40c...9e7ba39364
Base Key: 0x1757756A93
Flip count: 3 (override, default was 21)
Total Flips: 8436
Using: 12 threads
Progress: 100.000000%
Processed: 385330
Speed: 23.05 Mkeys/s
Elapsed Time: 00:00:00


No solution found. Checked 386575 combinations
Time: 0.14 seconds (00:00:00)
Speed: 22.98 Mkeys/s

test2

# ./mutagen -p 34 -f 14

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 34 (34-bit)
Target HASH160: f6d67d7983...ab265f1bfa
Base Key: 0x1A96CA8D8
Flip count: 14 (override, default was 16)
Total Flips: 1391975640
Using: 12 threads
Progress: 3.592017%
Processed: 50000000
Speed: 34.18 Mkeys/s
Elapsed Time: 00:00:11
=======================================
=========== SOLUTION FOUND ============
=======================================
Private key: 0x34A65911D
Checked 55182106 combinations
Bit flips: 14
Time: 13.13 seconds (00:00:13)
Speed: 30.94 Mkeys/s
Solution saved to puzzle_34_solution.txt

https://github.com/NoMachine1/Mutagen/blob/main/mutagen.cpp

Only this was added.

Code:

void worker(Secp256K1* secp, int bit_length, int flip_count, int threadId, AVXCounter start, AVXCounter end) {
    const int fullBatchSize = 2 * POINTS_BATCH_SIZE;
    alignas(32) uint8_t localPubKeys[HASH_BATCH_SIZE][33];
    alignas(32) uint8_t localHashResults[HASH_BATCH_SIZE][20];
    alignas(32) int pointIndices[HASH_BATCH_SIZE];

    // Precompute target hash for comparison
    __m256i target16 = _mm256_loadu_si256(reinterpret_cast<const __m256i*>(TARGET_HASH160_RAW.data()));
    
    // Precompute points with AVX2-aligned storage
    alignas(32) Point plusPoints[POINTS_BATCH_SIZE];
    alignas(32) Point minusPoints[POINTS_BATCH_SIZE];
    for (int i = 0; i < POINTS_BATCH_SIZE; i++) {
        Int tmp; tmp.SetInt32(i);
        plusPoints[i] = secp->ComputePublicKey(&tmp);
        minusPoints[i] = plusPoints[i];
        minusPoints[i].y.ModNeg();
    }

Aligned loads/stores (_mm256_load_si256) are faster than unaligned ones (_mm256_loadu_si256).

[Denevron]

for a couple of seconds it gave 1000 Mkeys/sec, and then the speed dropped 

test1

# ./mutagen -p 38 -f 3

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 38 (38-bit)
Target HASH160: b190e2d40c...9e7ba39364
Base Key: 0x1757756A93
Flip count: 3 (override, default was 21)
Total Flips: 8436
Using: 12 threads
Progress: 100.000000%
Processed: 385330
Speed: 23.05 Mkeys/s
Elapsed Time: 00:00:00


No solution found. Checked 386575 combinations
Time: 0.14 seconds (00:00:00)
Speed: 22.98 Mkeys/s

test2

# ./mutagen -p 34 -f 14

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 34 (34-bit)
Target HASH160: f6d67d7983...ab265f1bfa
Base Key: 0x1A96CA8D8
Flip count: 14 (override, default was 16)
Total Flips: 1391975640
Using: 12 threads
Progress: 3.592017%
Processed: 50000000
Speed: 34.18 Mkeys/s
Elapsed Time: 00:00:11
=======================================
=========== SOLUTION FOUND ============
=======================================
Private key: 0x34A65911D
Checked 55182106 combinations
Bit flips: 14
Time: 13.13 seconds (00:00:13)
Speed: 30.94 Mkeys/s
Solution saved to puzzle_34_solution.txt

https://github.com/NoMachine1/Mutagen/blob/main/mutagen.cpp

Only this was added.

Code:

void worker(Secp256K1* secp, int bit_length, int flip_count, int threadId, AVXCounter start, AVXCounter end) {
    const int fullBatchSize = 2 * POINTS_BATCH_SIZE;
    alignas(32) uint8_t localPubKeys[HASH_BATCH_SIZE][33];
    alignas(32) uint8_t localHashResults[HASH_BATCH_SIZE][20];
    alignas(32) int pointIndices[HASH_BATCH_SIZE];

    // Precompute target hash for comparison
    __m256i target16 = _mm256_loadu_si256(reinterpret_cast<const __m256i*>(TARGET_HASH160_RAW.data()));
    
    // Precompute points with AVX2-aligned storage
    alignas(32) Point plusPoints[POINTS_BATCH_SIZE];
    alignas(32) Point minusPoints[POINTS_BATCH_SIZE];
    for (int i = 0; i < POINTS_BATCH_SIZE; i++) {
        Int tmp; tmp.SetInt32(i);
        plusPoints[i] = secp->ComputePublicKey(&tmp);
        minusPoints[i] = plusPoints[i];
        minusPoints[i].y.ModNeg();
    }

Aligned loads/stores (_mm256_load_si256) are faster than unaligned ones (_mm256_loadu_si256).

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 68 (68-bit)
Target HASH160: e0b8a2baee...7451fc8cfc
Base Key: 0x730FC235C1942C1AE
Flip count: 30 (override, default was 34)
Total Flips: 17876288714431443296
Using: 32 threads
Progress: 0.000000%
Processed: 30000000
Speed: 12861.49 Mkeys/s
Elapsed Time: 00:00:00


But then it quickly falls 

[Dontbeatool2]

I saw you discussing this and there are a couple issues. You do realize you are searching a puzzle and range that was solved.

I appreciate the concern. This is how I test the software before it goes onto a large cluster to make sure it is actually working and produces known result. Consider this being a sanity check like 2+2 should produce 4.

It is possible to get billions of keys per sec on midrange store bought pc. There are way better methods than what you are using. If you are interested in getting involved in the puzzle there are much better ways with much better results even using cpu. To hit billions you need to use a GPU a 3060 or equivalents will hit billion+ per second. If advanced you can get it up to 10 billion with more advanced methods. Look at kangaroo and bitcrack and vanitysearch.

I appreciate the concern #2! None of the machines that run the code have the GPUs in them, the hardware is quite old. However, the cluster size is currently 985 systems, each has 2x 2650v4.

Code:

CPU Threads   : 48
Mkeys/s       : 76.83

This is (76.83 * 985) / 1000 = ~75.67 Gkeys/s

I gave the maker the raw code. It uses same functions but math lets you do less. Kangaroo allows scanning 100,000 every million and allows doing it faster kangaroo with 3 jump and sota+ were included. So its functions its the math that allows you to skip parts and cover it faster.
https://github.com/RetiredC/RCKangaroo

[MrHorse]

@nomachine:

Current cyclone version from github is not working

# ./Cyclone -b 4 -h f92044c7924e5525c61207972c253c9fc9f086f7 -r 6bd20000000:6bdffffffff -S

================= WORK IN PROGRESS =================
Puzzle/Bits   : 32
Target Hash160: f92044c7924e552...c253c9fc9f086f7
Prefix length : 4 bytes
Mode          : Sequential
CPU Threads   : 12
Mkeys/s       : 36.27
Total Checked : 725503488
Elapsed Time  : 00:00:20
Start Range   : 6bd20000000
End Range     : 6bdffffffff
Progress      : 19.3 %
Progress Save : 0
Stride        : 1
================== FOUND MATCH! ====================
Private Key   : 000000000000000000000000000000000000000000000000000006BD3B27C591
Public Key    : 02A631F9BA0F28511614904DF80D7F97A4F43F02249C8909DAC92276CCF0BCDAED
Total Checked : 856310784
Elapsed Time  : 00:00:23
Speed         : 31.1849 Mkeys/s


It works the same here as in the previous version.

It works with -t 12:

Code:

$ time ./Cyclone -b 4 -h f92044c7924e5525c61207972c253c9fc9f086f7 -r 6bd20000000:6bdffffffff -S -t 12

================= WORK IN PROGRESS =================
Puzzle/Bits   : 32
Target Hash160: f92044c7924e552...c253c9fc9f086f7
Prefix length : 4 bytes
Mode          : Sequential
CPU Threads   : 12
Mkeys/s       : 18.44
Total Checked : 461110784
Elapsed Time  : 00:00:25
Start Range   : 6bd20000000
End Range     : 6bdffffffff
Progress      : 12.3 %
Progress Save : 0
Stride        : 1
================== FOUND MATCH! ====================
Private Key   : 000000000000000000000000000000000000000000000000000006BD3B27C591
Public Key    : 02A631F9BA0F28511614904DF80D7F97A4F43F02249C8909DAC92276CCF0BCDAED
Total Checked : 745232896
Elapsed Time  : 00:00:28
Speed         : 17.6145 Mkeys/s

real    0m28.031s
user    5m35.574s
sys     0m0.010s

It doesn't with -t 20:

Code:

$ time ./Cyclone -b 4 -h f92044c7924e5525c61207972c253c9fc9f086f7 -r 6bd20000000:6bdffffffff -S -t 20

================= WORK IN PROGRESS =================
Puzzle/Bits   : 32
Target Hash160: f92044c7924e552...c253c9fc9f086f7
Prefix length : 4 bytes
Mode          : Sequential
CPU Threads   : 20
Mkeys/s       : 29.35
Total Checked : 1761153024
Elapsed Time  : 00:01:00
Start Range   : 6bd20000000
End Range     : 6bdffffffff
Progress      : 46.9 %
Progress Save : 0
================= NO MATCH FOUND =================
No match found in range: 6bd20000000:6bdffffffff
Total Checked : 1886423040
Elapsed Time  : 00:01:04
Speed         : 29.37 Mkeys/s
No match found after processing all ranges.

real    1m4.224s
user    21m9.593s
sys     0m0.189s

-t 17:

Code:

================= WORK IN PROGRESS =================
Puzzle/Bits   : 32
Target Hash160: f92044c7924e552...c253c9fc9f086f7
Prefix length : 4 bytes
Mode          : Sequential
CPU Threads   : 17
Mkeys/s       : 26.94
Total Checked : 1885659648
Elapsed Time  : 00:01:10
Start Range   : 6bd20000000
End Range     : 6bdffffffff
Progress      : 50.2 %
Progress Save : 0
================= NO MATCH FOUND =================
No match found in range: 6bd20000000:6bdffffffff
Total Checked : 1886417920
Elapsed Time  : 00:01:10
Speed         : 26.84 Mkeys/s
No match found after processing all ranges.

real    1m10.295s
user    17m58.008s
sys     0m0.092s

-t 48:

Code:

================= WORK IN PROGRESS =================
Puzzle/Bits   : 32
Target Hash160: f92044c7924e552...c253c9fc9f086f7
Prefix length : 4 bytes
Mode          : Sequential
CPU Threads   : 48
Mkeys/s       : 29.62
Total Checked : 1777531904
Elapsed Time  : 00:01:00
Start Range   : 6bd20000000
End Range     : 6bdffffffff
Progress      : 47.3 %
Progress Save : 0
================= NO MATCH FOUND =================
No match found in range: 6bd20000000:6bdffffffff
Total Checked : 188642918400000000000000000000000000000000000000000006BDEAB5AE23
Elapsed Time  : 00:01:0331D5BDB540E84A7D02BDBA43AF6191ABB3852963325F50DD53AE129B73
Speed         : 29.59 Mkeys/s3b04bd5a32b9bf971e0bb7a2134
No match found after processing all ranges.53c9fc9f086f7
Matched bytes : f92044c7
real    1m3.756s
user    20m55.335s
sys     0m0.166s

-t 8:

Code:

================= WORK IN PROGRESS =================
Puzzle/Bits   : 32
Target Hash160: f92044c7924e552...c253c9fc9f086f7
Prefix length : 4 bytes
Mode          : Sequential
CPU Threads   : 8
Mkeys/s       : 19.35
Total Checked : 1644794880
Elapsed Time  : 00:01:25
Start Range   : 6bd20000000
End Range     : 6bdffffffff
Progress      : 43.8 %
Progress Save : 0
Stride        : 1
================== FOUND MATCH! ====================
Private Key   : 000000000000000000000000000000000000000000000000000006BD3B27C591
Public Key    : 02A631F9BA0F28511614904DF80D7F97A4F43F02249C8909DAC92276CCF0BCDAED
Total Checked : 1832219136
Elapsed Time  : 00:01:27
Speed         : 19.1314 Mkeys/s

real    1m27.718s
user    11m40.716s
sys     0m0.024s

[nomachine]

Speed: 12861.49 Mkeys/s
Elapsed Time: 00:00:00


But then it quickly falls 

Try now

https://github.com/NoMachine1/Mutagen/blob/main/mutagen.cpp

[Denevron]

Speed: 12861.49 Mkeys/s
Elapsed Time: 00:00:00


But then it quickly falls 

Try now

https://github.com/NoMachine1/Mutagen/blob/main/mutagen.cpp

yes, the speed stopped jumping, it's a pity that it wasn't constant 

[kTimesG]

I appreciate the concern #2! None of the machines that run the code have the GPUs in them, the hardware is quite old. However, the cluster size is currently 985 systems, each has 2x 2650v4.

Code:

CPU Threads   : 48
Mkeys/s       : 76.83

This is (76.83 * 985) / 1000 = ~75.67 Gkeys/s

You're wasting electricity.

985 systems * 105W = 103425 W

That kinda power can run 230 RTX 4090s.

230 RTX 4090s produce 1610 Gkeys/s

That's 21x faster. And a much less headache managing the machines. Whatta gonna do if you wanna step up to the real deal, like hashing 7 trillion keys per second? Millions of CPUs? Good luck with that.

I'm gonna take a break from here, for real this time, I'm honestly tired of being flooded with huge /code/ posts, you guys need some separate thread for spooning out water from the ocean. And now it seems that we're talking about kangaroos for address-only puzzles, which is just great! Keep it up guys.

[Dontbeatool2]

I appreciate the concern #2! None of the machines that run the code have the GPUs in them, the hardware is quite old. However, the cluster size is currently 985 systems, each has 2x 2650v4.

Code:

CPU Threads   : 48
Mkeys/s       : 76.83

This is (76.83 * 985) / 1000 = ~75.67 Gkeys/s

You're wasting electricity.

985 systems * 105W = 103425 W

That kinda power can run 230 RTX 4090s.

230 RTX 4090s produce 1610 Gkeys/s

That's 21x faster. And a much less headache managing the machines. Whatta gonna do if you wanna step up to the real deal, like hashing 7 trillion keys per second? Millions of CPUs? Good luck with that.

I'm gonna take a break from here, for real this time, I'm honestly tired of being flooded with huge /code/ posts, you guys need some separate thread for spooning out water from the ocean. And now it seems that we're talking about kangaroos for address-only puzzles, which is just great! Keep it up guys.

Puzzles gives public key on some and it only requires ec searching.

[kTimesG]

Puzzles gives public key on some and it only requires ec searching.

Thank you for the heads up.

[WanderingPhilospher]

@nomachine:

Current cyclone version from github is not working

# ./Cyclone -b 4 -h f92044c7924e5525c61207972c253c9fc9f086f7 -r 6bd20000000:6bdffffffff -S

================= WORK IN PROGRESS =================
Puzzle/Bits   : 32
Target Hash160: f92044c7924e552...c253c9fc9f086f7
Prefix length : 4 bytes
Mode          : Sequential
CPU Threads   : 12
Mkeys/s       : 36.27
Total Checked : 725503488
Elapsed Time  : 00:00:20
Start Range   : 6bd20000000
End Range     : 6bdffffffff
Progress      : 19.3 %
Progress Save : 0
Stride        : 1
================== FOUND MATCH! ====================
Private Key   : 000000000000000000000000000000000000000000000000000006BD3B27C591
Public Key    : 02A631F9BA0F28511614904DF80D7F97A4F43F02249C8909DAC92276CCF0BCDAED
Total Checked : 856310784
Elapsed Time  : 00:00:23
Speed         : 31.1849 Mkeys/s


It works the same here as in the previous version.

It works with -t 12:

Code:

$ time ./Cyclone -b 4 -h f92044c7924e5525c61207972c253c9fc9f086f7 -r 6bd20000000:6bdffffffff -S -t 12

================= WORK IN PROGRESS =================
Puzzle/Bits   : 32
Target Hash160: f92044c7924e552...c253c9fc9f086f7
Prefix length : 4 bytes
Mode          : Sequential
CPU Threads   : 12
Mkeys/s       : 18.44
Total Checked : 461110784
Elapsed Time  : 00:00:25
Start Range   : 6bd20000000
End Range     : 6bdffffffff
Progress      : 12.3 %
Progress Save : 0
Stride        : 1
================== FOUND MATCH! ====================
Private Key   : 000000000000000000000000000000000000000000000000000006BD3B27C591
Public Key    : 02A631F9BA0F28511614904DF80D7F97A4F43F02249C8909DAC92276CCF0BCDAED
Total Checked : 745232896
Elapsed Time  : 00:00:28
Speed         : 17.6145 Mkeys/s

real    0m28.031s
user    5m35.574s
sys     0m0.010s

It doesn't with -t 20:

Code:

$ time ./Cyclone -b 4 -h f92044c7924e5525c61207972c253c9fc9f086f7 -r 6bd20000000:6bdffffffff -S -t 20

================= WORK IN PROGRESS =================
Puzzle/Bits   : 32
Target Hash160: f92044c7924e552...c253c9fc9f086f7
Prefix length : 4 bytes
Mode          : Sequential
CPU Threads   : 20
Mkeys/s       : 29.35
Total Checked : 1761153024
Elapsed Time  : 00:01:00
Start Range   : 6bd20000000
End Range     : 6bdffffffff
Progress      : 46.9 %
Progress Save : 0
================= NO MATCH FOUND =================
No match found in range: 6bd20000000:6bdffffffff
Total Checked : 1886423040
Elapsed Time  : 00:01:04
Speed         : 29.37 Mkeys/s
No match found after processing all ranges.

real    1m4.224s
user    21m9.593s
sys     0m0.189s

Hasn't been tested enough. But you are doing some good testing. I would not trust it 100%, ever, lol. Even if it did 100 MK/s per CPU thread. It seems buggy depending on OS and type of CPU.

[nomachine]

It doesn't with -t 20:

Try now

https://github.com/NoMachine1/Cyclone/blob/main/Cyclone.cpp

[WanderingPhilospher]

It doesn't with -t 20:

Try now

https://github.com/NoMachine1/Cyclone/blob/main/Cyclone.cpp

A lot of try nows lol. I thought you were fishing for a big ole flathead catfish...maybe even noodling one!

I can only see the speed of Cyclone in random mode beating out the old tried and true programs. And that's just because no one has really messed with old programs and thread randomness.

I got less speed on Cyclone, sequential, versus using an off the shelf program like KeyHunt-Cuda in CPU mode, sequential. True, or am I missing something lol?

[b0dre]

New version uses AVX2 for fast partial hash comparisons

https://github.com/NoMachine1/Mutagen/blob/main/mutagen.cpp

First checks 4 bytes using AVX2

               for (int j = 0; j < HASH_BATCH_SIZE; j++) {
                    // Load candidate hash
                    __m256i cand = _mm256_loadu_si256(reinterpret_cast<const __m256i*>(localHashResults[j]));
                   
                    // Compare first 4 bytes using AVX2
                    __m256i cmp = _mm256_cmpeq_epi8(cand, target16);
                    int mask = _mm256_movemask_epi8(cmp);
                   
                    if ((mask & 0x0F) == 0x0F) {  // First 4 bytes match
                        // Full comparison
                        bool fullMatch = true;
                        for (int k = 0; k < 20; k++) {
                            if (localHashResults[j][k] != TARGET_HASH160_RAW[k]) {
                                fullMatch = false;
                                break;
                            }
                        }

                        if (fullMatch) {

Only does full comparison if first 4 bytes match.

I think I'll go fishing now.   

faster 

[nomachine]

I thought you were fishing for a big ole flathead catfish...maybe even noodling one!

I think you are quite right. 

[Akito S. M. Hosana]

I thought you were fishing for a big ole flathead catfish...maybe even noodling one!

I think you are quite right.  

Now, he really went fishing  

Try now

https://github.com/NoMachine1/Mutagen/blob/main/mutagen.cpp

./mutagen -p 68 -t 1 -p 37
terminate called after throwing an instance of 'std::invalid_argument'
  what():  stoul
Aborted (core dumped)

./mutagen -p 68 -t 1 -f 37
=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 68 (68-bit)
Target HASH160: e0b8a2baee...7451fc8cfc
Base Key: 0x730FC235C1942C1AE
Flip count: 37 (override, default was 34)
Total Flips: 21912870037044995008
Using: 1 threads
Progress: 0.000000%
Processed: 10000000
Speed: 4.75 Mkeys/s
Elapsed Time: 00:00:17

[POD5]

Sorry, I was using a false command.

Code:

./mutagen -p 68 -t 1 -f 37

Starting puzzle: 68 (68-bit)
Target HASH160: e0b8a2baee...7451fc8cfc
Base Key: 0x730FC235C1942C1AE
Flip count: 37 (override, default was 34)
Total Flips: 21912870037044995008
Using: 1 threads
Progress: 0.000000%
Processed: 70000000
Speed: 4.12 Mkeys/s
Elapsed Time: 00:02:15

[Akito S. M. Hosana]

Sorry, I was using a false command.

Code:

./mutagen -p 68 -t 1 -f 37

Starting puzzle: 68 (68-bit)
Target HASH160: e0b8a2baee...7451fc8cfc
Base Key: 0x730FC235C1942C1AE
Flip count: 37 (override, default was 34)
Total Flips: 21912870037044995008
Using: 1 threads
Progress: 0.000000%
Processed: 70000000
Speed: 4.12 Mkeys/s
Elapsed Time: 00:02:15

I just saw that he updated again. This shit is faster than a Cyclone now...

[POD5]

Yeah, but if you can't resume work or start from a specific point in the universe of 1 to 21912870037044995008 in Mutagen...
Nevertheless, I'm still getting more speed with the Cyclone version from 28 March, 4.7 to 5,1 Mk/s using 1 thread (actually I'm using 2 different instances)

[MrHorse]

It doesn't with -t 20:

Try now

https://github.com/NoMachine1/Cyclone/blob/main/Cyclone.cpp

It is working. I tried with -t {1..24} and observed

Code:

=== FOUND MATCH! ===

each time.

Thank you

[Akito S. M. Hosana]

It is working. I tried with -t {1..24} and observed

Code:

=== FOUND MATCH! ===

each time.

Imagine how fast this would be if he weren’t fishing. He doesn’t care. This is just entertainment for him when he’s full of money.