2) Quantum computers allegedly could still provide a route to quicker collision finding in hash functions anyway. Perhaps not as much of a difference as for Shor' s algo or for ECDSA, but still worth pointing out.
Use 384-bit hashing, a QC will need 2^192 operations to crack it (subject to P=NP problem).