Hashing

Process of transforming data into a fixed-size value.

hash function

In computer science, hashing is a process of transforming data of arbitrary size into a fixed-size value. This value, known as a hash or hash code, serves as an index to quickly locate the original data in a hash table. Hashing algorithms are widely used for data storage, retrieval, and integrity verification.

Pronunciation

/ˈhæʃɪŋ/

Etymology

Hashing comes from the practice of using hash marks (#) to represent numbers.

Explain Like I’m 5

Hashing is like using a special machine to turn any amount of information into a short, unique code – think of it like turning a long book title into a single number.

Fun Facts

Different inputs can produce the same hash value, known as a collision
Hash functions are used to quickly check if files have been altered
MD5 and SHA-256 are common hashing algorithms

FAQ

What is hashing? It's a one-way function that converts data into a fixed-size value
How is it used? It's used for password storage, data indexing, and verifying file integrity
Is hashing reversible? No, it's designed to be a one-way process

Synonyms — Similar or Related Terms

hash function hash code

Hypernyms — Broader Categories

algorithm data structure

Hyponyms — Specific Examples

MD5 SHA-256 CRC32

Holonyms — Wholes or Groups

hash table data storage

Indexes

computational method data structure security

Built by Tim Jones