> gHash runs in about 5−10 milliseconds on x86; tested on both Intel and AMD processors.
Implementing this function on an ASIC would be a nightmare, and it is designed to be. The
resource consumption is vast in logic and memory
Making gHash super complex and hard to verify runs counter to the design principles for a good PoW.
If vast resource consumption is the goal, then this can be achieved without high complexity and slow verification.
E.g. replace gHash by Cuckoo Cycle [1], the simplest possible memory hard puzzle, or by Equihash.
[1]
https://github.com/tromp/cuckoo