I know how and what is generated. I need this for my experiment, but at this rate it's a perversion. And my hardware is quite powerful, 72 cores and 128GB of RAM. The same keyhunt, when brute force, produces 350 million keys at maximum load. But I need exactly this algorithm, hex separately from the public key. So that when I found a public key from the list, I knew its hex.
Producing hex numbers is fast. But converting them to public keys is not. You use SHA256 here, mostly twice. This is resource demanding and it is not only adding two numbers.
Second: you need to look up the public key in a table, good if it will be in RAM, but still you need to search at least a b-tree, complexity O(log(N)).