This should allow easier generation of attempts at the puzzles using generated hex ranges, converted to WIFs. I am working on the output generation currently but have a few inferior working models. I've been going through multiple builds an hour and am only really updating when it seems key.
In Python?? You need the fastest hashlib and Base58 implementation in the world—written in C or CUDA C—capable of achieving 35 million WIFs per second using AVX2 and SHA-NI, or up to 3.5 billion WIFs per second with GPU acceleration. Anything else is child's play when it comes to WIFs for me.