If it is possible to generate different type of hashes for same plain text words and store it for cross-reference .ie. get the hashes ready for the target hash by using OCLHashcat. Then in spare time we can run the hash generator and at show time all we need to have is to find the hash in pre generated list.
Is there a way to do that ?
Please share a view
What you are describing sounds like a rainbow table, that is a completely different concept then what atom has in mind for hashcat.
Hashcat's purpose is to be the most efficient candidate calculator and comparison device.
Theoretically possible, but hashcat doesn't support this approach, which is very inefficient due to tremendous amounts of data(pseudohashes) per password AND deliberately redundancy(wasting resources on all hashes when a hash of a single type will be attacked).
What's more, the majority of rainbow tables got deprecated when swift hash cracking on GPUs got common and with the introduction of salted & heavily iterated hashing algorithms.
Like Kartan said, hashcat software focuses on the most efficient ways to crack hashes.