Am I correct that addresses are hashed to compress a huge text-represented coprime into something of manageable size?
Am I also correct that transactions are hashed for the same reason and also because:
To create RSA signature keys, generate an RSA key pair containing a modulus N that is the product of two large primes, along with integers e and d such that e d ≡ 1 (mod φ(N)), where φ is the Euler phi-function. The signer's public key consists of N and e, and the signer's secret key contains d.
To sign a message m, the signer computes σ ≡ md (mod N). To verify, the receiver checks that σe ≡ m (mod N).
As noted earlier, this basic scheme is not very secure. To prevent attacks, one can first apply a cryptographic hash function to the message m and then apply the RSA algorithm described above to the result.
I cannot find a reason for blocks being hashed except to slow the rate that transactions are verified thus new supply is mined. Is this correct? If not, why are blocks hashed?