I have a script in C++, but it's not 200x faster—it doesn't use AVX2 hashing or the JLP SECP256K1.
It uses OpenSSL.

But what are you going to do with it?

To generate the number of possible combinations between "ecrA1gh" and "kW1gt2H" (7 missing characters for puzzle 69) using the Base58 character set, there are approximately 1.54 trillion combinations.

• WIFRotator
• Starting WIF: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q
• Middle range: ecrA1gh to kW1gt2H
• Missing chars: 12
• Target: 61eb8a50c86b0584bb727dd65bed8d2400d6d5aa
• Cores: 12
• Initial middle: f9FtYtY
• New middle section activated: ipNX8dr
• Speed: 16,2 MKeys/sec | Total: 6,404 MKeys
• New middle section activated: hGnuha8
• Speed: 16,2 MKeys/sec | Total: 6,304 MKeys
• New middle section activated: gxN4jE6
• Speed: 15,7 MKeys/sec | Total: 6,204 MKeys
• New middle section activated: fT9yPyt
• Speed: 15,9 MKeys/sec | Total: 6,404 MKeys
• New middle section activated: hM42ZDc
• Speed: 16,2 MKeys/sec | Total: 6,304 MKeys
• New middle section activated: h5KwaZ5
• Speed: 16,2 MKeys/sec | Total: 6,300 MKeys
• New middle section activated: jSaH3oc
• Speed: 16,2 MKeys/sec | Total: 6,301 MKeys
• New middle section activated: iHgzCdB

This means your script will rotate through ~1.54 trillion different middle sections (each taking about 1–8 minutes), while brute-forcing the last 12 characters for each one.  

Cyclone last update
By default 6 prefix, thats reduce speed to half
Even we select or not prefix,
This area effect speed

You're here for fun, who would be foolish enough to use common sense to solve this problem?

67 was solved via vast.ai + automated scripts to rent instances.

You'd need a dedicated nuclear power plant + a modest neighborhood full of RTX 4090 in each home if you intend to solve such a puzzle at home in less than a few months.

quick question for y'all...

I have a PC with no GPU, a CPU capable of running 32 threads, and 64GB of RAM...

I've been playing with Keyhunt recently, and if I try it in address mode on a lower number puzzle I get speeds somewhere in the Mkeys/s range (I forget the exact number)... And when I try it in BSGS mode for a higher puzzle (one with a known public key, like 135) I'm getting around 880 Pkeys/s...

The problem is that I know how to calculate how big the search space is when trying to solve by address, but I have no idea how to do the same for BSGS... If the math for BSGS is completely different from calculating addresses, then is the puzzle's key range still relevant...?

Basically, I know it'll take me a gazillion years to search an entire key space either way, but I don't know if I should try my luck at addresses on a lower puzzle or BSGS on a higher one... Which one is better odds for my setup, any ideas?

Thanks.

? Can you give a link to the program and .BAT file with the correct command line for puzzle 68

https://btcpuzzle.info/puzzle/67
It's hard to believe that Puzzle 67 was opened by simple enthusiasts and not by the creators themselves, since the pool was often attacked by DDOS and 6,69% of the range was already passed, and since the creators of the puzzles know the private key, they can easily monitor how close the pool participants got, so they could easily take their coins themselves under the guise of someone finding them, so this is most likely a scam than some kind of honest competition. Who wants to give strangers more than half a million dollars, it's unrealistic! Let's think about it. Does anyone doubt that this is how things are or do you think everything is honest?

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.

Someone please notify bib, he is still searching for prefixes 

We must be fully aware that sometimes we see what we want to see, and differentiate between an idea with logic and coincidences.

An example of a coincidence:


#66

000000000000000000000000000000000000000000000002832ed74f2b5e35ee

h160: 20d45a6a762535700ce9e0b216e31994335db8a5

prefix  "2"

#67

00000000000000000000000000000000000000000000000730fc235c1942c1ae

h160: 739437bb3dd6d1983e66629c5f08c70e52769371

prefix  "73"

#68

00000000000000000000000000000000000000000000000exxxxxxxxxxxxxxx ??

h160: e0b8a2baee1b77fc703455f39d51477451fc8cfc

prefix  "e"

Coincidences occur when two or more events seem significantly related, but do not have a real causal connection.