Hash Indexesare only useful for equality comparisons, but you pretty much never want to use them since they are not transaction safe, need to be manually rebuilt after crashes, and are not replicated to followers, so the advantage over using a B-Tree is rather small.
Could anyone explain about why is it not transaction safe as compared to B-Tree index.