Currently we implement three different 'hash' functions for going from strings to elliptic curve elements. https://github.com/arkworks-rs/crypto-primitives/tree/main/src/crh
- Pedersen
- Bowe-Hopwood
- Injective map (I'm not really sure what this one is)
It'd probably be a handy reference to provide a table in the README for that directory explaining when to use each hash / what the different properties of each one is.