Bitcoin puzzle transaction ~32 BTC prize to who solves it

[Denevron]

@nomachine
Do you still have a version of Cyclone that runs on CPU that does not have avx2? i think when you first uploaded was working also on that machines and now after the updates and modifications it doesnt.
thank you

maybe you mean this version?)
by the way, on this version, there was very good speed 

https://bitcointalk.org/index.php?topic=1306983.msg65173186#msg65173186

Unfortunately, it does not calculate the speed correctly, along with other bugs. Only the latest version on GitHub works properly. I have now updated all my posts containing the code to direct users to GitHub to avoid confusion and prevent false hopes about unrealistic speeds. It is impossible to exceed 5 Mkeys/s per core with this configuration and compilation method. Higher speeds are only doable with the Clang AOCC compiler for specific AMD processors—but that method also causes a thermal disturbance. You’d need a half-meter cooler for it!. 

ahh, so that's why the speed is so good 
I wanted to ask you, if I show you the code (it's in Python), could you transfer it to Cyclone, as another new mode? It differs from the search options presented here, and copes well up to puzzle 55, and then there is simply not enough speed)  I can't add it myself because I don't know C++, I'm more of a Javascript fan) Sorry for my broken English, it's not my native language 

I replied to you in a private message, but I don’t know if it will reach you, since I’m a “newbie”, and it seems like there are restrictions)

[nomachine]

I replied to you in a private message, but I don’t know if it will reach you, since I’m a “newbie”, and it seems like there are restrictions)

I received a private message with a red warning. The idea is good, but the Python code is not well-written. I will send you my version so you can see how it works—after I have carefully thought through this idea. 

[Denevron]

I replied to you in a private message, but I don’t know if it will reach you, since I’m a “newbie”, and it seems like there are restrictions)

I received a private message with a red warning. The idea is good, but the Python code is not well-written. I will send you my version so you can see how it works—after I have carefully thought through this idea. 

Yes, it is crooked, made quickly so that the theory could be tested, and it turned out to work) Thank you very much, I will wait)   

[nomachine]

I replied to you in a private message, but I don’t know if it will reach you, since I’m a “newbie”, and it seems like there are restrictions)

I received a private message with a red warning. The idea is good, but the Python code is not well-written. I will send you my version so you can see how it works—after I have carefully thought through this idea. 

Yes, it is crooked, made quickly so that the theory could be tested, and it turned out to work) Thank you very much, I will wait)   

# python3 test.py
Predicted flip count for Puzzle 68: 40 bits

Searching Puzzle 68 (256-bit)
Base Key: 00000000000000000000000000000000000000000000000730fc235c1942c1ae
Target: 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
Predicted Flip Count: 40 bits
Total Possible Combinations: 2^63
Using 12 workers...

You will see that we need a speed 2²³ times higher to compensate for this method.

[Denevron]

I replied to you in a private message, but I don’t know if it will reach you, since I’m a “newbie”, and it seems like there are restrictions)

I received a private message with a red warning. The idea is good, but the Python code is not well-written. I will send you my version so you can see how it works—after I have carefully thought through this idea.  

Yes, it is crooked, made quickly so that the theory could be tested, and it turned out to work) Thank you very much, I will wait)  

# python3 test.py
Predicted flip count for Puzzle 68: 40 bits

Searching Puzzle 68 (256-bit)
Base Key: 00000000000000000000000000000000000000000000000730fc235c1942c1ae
Target: 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
Predicted Flip Count: 40 bits
Total Possible Combinations: 2^63
Using 12 workers...

You will see that we need a speed 2²³ times higher to compensate for this method.

but the key will be found before all options are tried)

I replied to you in a private message, but I don’t know if it will reach you, since I’m a “newbie”, and it seems like there are restrictions)

I received a private message with a red warning. The idea is good, but the Python code is not well-written. I will send you my version so you can see how it works—after I have carefully thought through this idea.  

Yes, it is crooked, made quickly so that the theory could be tested, and it turned out to work) Thank you very much, I will wait)  

# python3 test.py
Predicted flip count for Puzzle 68: 40 bits

Searching Puzzle 68 (256-bit)
Base Key: 00000000000000000000000000000000000000000000000730fc235c1942c1ae
Target: 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
Predicted Flip Count: 40 bits
Total Possible Combinations: 2^63
Using 12 workers...

You will see that we need a speed 2²³ times higher to compensate for this method.

if you make this method in C++, it will be much more fun and faster  

[nomachine]

if you make this method in C++, it will be much more fun and faster 

I don't have enough time. I'm currently adding Endomorphism to Cyclone.

[Akito S. M. Hosana]

I don't have enough time. I'm currently adding Endomorphism to Cyclone.

Another 30% speedup? 

[POD5]

I don't have enough time. I'm currently adding Endomorphism to Cyclone.

Does endomorphism also work with small ranges, like P68, P69 etc?

[kTimesG]

I don't have enough time. I'm currently adding Endomorphism to Cyclone.

Does endomorphism also work with small ranges, like P68, P69 etc?

No, by definition. Endo and symmetry are useless for range scans, only vanity.

[Denevron]

if you make this method in C++, it will be much more fun and faster 

I don't have enough time. I'm currently adding Endomorphism to Cyclone.

I understand, but thanks anyway

[nomachine]

Endo and symmetry are useless for range scans, only vanity.

Endomorphism creates non-sequential key jumps (k, kλ, kλ² mod n).

Breaks the contiguous memory access pattern crucial for performance.

Causes cache thrashing as you jump around the keyspace...

But I'm doing something else here. I don't always have to explain what.

[kTimesG]

Endo and symmetry are useless for range scans, only vanity.

Endomorphism creates non-sequential key jumps (k, kλ, kλ² mod n).

Breaks the contiguous memory access pattern crucial for performance.

Causes cache thrashing as you jump around the keyspace...

But I'm doing something else here. I don't always have to explain what.

I don't get what you mean.

Once you have a pubKey (for example, one produced by sequential iteration), you can simply hash the other 5 options, without having to mess with anything related to key jumps.

Simply adjust the pubKey first byte, and multiply the X by beta and beta**2.

[Akito S. M. Hosana]

But I'm doing something else here. I don't always have to explain what.

Cool, cool… so it’s illegal?  

[nomachine]

I don't get what you mean.

Cool, cool… so it’s illegal?  

Point endoPoints[3];
Int endoKeys[3];

endoPoints[0] = startPoint;
endoKeys[0].Set(&currentBatchKey);

// (λ)
endoPoints[1].x.ModMulK1(&startPoint.x, &beta);
endoPoints[1].y.Set(&startPoint.y);  // Y remains same (sign flips handled later)
endoKeys[1].ModMulK1(&currentBatchKey, &lambda);

// (λ²)
Int beta2;
beta2.ModMulK1(&beta, &beta);
endoPoints[2].x.ModMulK1(&startPoint.x, &beta2);
endoPoints[2].y.Set(&startPoint.y);  // Y remains same
endoKeys[2].ModMulK1(&currentBatchKey, &lambda2);

// 6 total - 3 points × 2 parity
uint8_t pubKeyVariants[6][33];
for (int i = 0; i < 3; i++) {
    // Positive Y
    pointToCompressedBin(endoPoints, pubKeyVariants[i*2]);
   
    // Negative Y
    pubKeyVariants[i*2+1][0] = pubKeyVariants[i*2][0] ^ 0x01;
    memcpy(pubKeyVariants[i*2+1]+1, pubKeyVariants[i*2]+1, 32);
}

computeHash160BatchBinSingle(10, pubKeyVariants, hashResults);

for (int i = 0; i < 10; i++) {
    if (memcmp(hashResults, targetHash160.data(), g_prefixLength) == 0) {
        // Handle match
        Int foundKey;
        foundKey.Set(&currentBatchKey);
        return foundKey;
    }
}

[kTimesG]

Point endoPoints[3];
Int endoKeys[3];

endoPoints[0] = startPoint;
endoKeys[0].Set(&currentBatchKey);

// (λ)
endoPoints[1].x.ModMulK1(&startPoint.x, &beta);
endoPoints[1].y.Set(&startPoint.y);  // Y remains same (sign flips handled later)
endoKeys[1].ModMulK1(&currentBatchKey, &lambda);

// (λ²)
Int beta2;
beta2.ModMulK1(&beta, &beta);
endoPoints[2].x.ModMulK1(&startPoint.x, &beta2);
endoPoints[2].y.Set(&startPoint.y);  // Y remains same
endoKeys[2].ModMulK1(&currentBatchKey, &lambda2);

// 6 total - 3 points × 2 parity
uint8_t pubKeyVariants[6][33];
for (int i = 0; i < 3; i++) {
    // Positive Y
    pointToCompressedBin(endoPoints, pubKeyVariants[i*2]);
   
    // Negative Y
    pubKeyVariants[i*2+1][0] = pubKeyVariants[i*2][0] ^ 0x01;
    memcpy(pubKeyVariants[i*2+1]+1, pubKeyVariants[i*2]+1, 32);
}

computeHash160BatchBinSingle(10, pubKeyVariants, hashResults);

for (int i = 0; i < 10; i++) {
    if (memcmp(hashResults, targetHash160.data(), g_prefixLength) == 0) {
        // Handle match
        Int foundKey;
        foundKey.Set(&currentBatchKey);
        return foundKey;
    }
}

Here's some tips to make it faster (besides getting rid of the obvious overhead of the Int wrappers):

1. beta**2 is constant, no need to recompute it by beta*beta.
2. You don't need to compute k*lambda or k*lambda**2 unless you have a hash match. I think you also have some bugs around the returned key.

[Akito S. M. Hosana]

This is like you talking to me about deciphering Egyptian writing. 

[nomachine]

This is like you talking to me about deciphering Egyptian writing. 

You'll learn in time... 

Cyclone has been updated with some cosmetic changes and optimizations. Nothing drastic. 

[b0dre]

This is like you talking to me about deciphering Egyptian writing. 

You'll learn in time... 

Cyclone has been updated with some cosmetic changes and optimizations. Nothing drastic. 

Just a bit changes 

[filo1992]

Hi, I've been testing your Cyclone for a few days now.

I have a question, can the progress made be used so that I don't always have to start the search from the beginning?

[Akito S. M. Hosana]

Cyclone has been updated with some cosmetic changes and optimizations. Nothing drastic. 

You removed Xoshiro256plus why ?  


https://github.com/NoMachine1/Cyclone/commit/e507ff3c6c9ed435c183dd626aef4946bc15080a