Hash pertains to both the function and the process of performing a hash function. Referring to the process, it is the act of performing a hash function on input data of a tentative size. This bears an output with a length that is already fixed and appears random. Here, no data can be recovered without a cipher.
One of the most important properties of a hash is that its output of hashing a particular document will remain to be the same upon using the same algorithm.
The values that are returned by a hash function are duly called, “hash values”, “hash codes”, “hash digests”, or just “hashes”. These values are used so as to index a fixed-sized table that is aptly called, “hash table”.