WIF-Key based scanner for the 66 bit range.. ...happy Hunting!!

your code is the most inefficient way to search the puzzle.
Your way:
WIF->Private Key->Publickey->Sha256->rmd160->Address.
Why not only?
Publickey->Sha256->rmd160
In this way you avoid some steps that need a lot of calculation.
Regards!
simple answer...
the area that is random consists of only 6 letters from the Wif-key...
and the secp256k1 from (ice) is super fast...
Speed test with 4 cores: [ Speed : 301444.62 Keys/s ]
the calculation takes place one after the other, not at the same time, which would take time...
Using python or any high level language to do heavy computations is trouble .. cracking is better coded with c/cpp/golang/java .. but thank you a lot for sharing your code