A fixed-length string of characters produced by a cryptographic hash function, serving as a practically unique digital fingerprint for any input data.
Detailed Explanation
Hash functions take any input (a file, transaction, or text) and produce a fixed-size output that appears random but is deterministic. The same input always produces the same hash, but even a tiny change in input produces a completely different hash. In blockchain, hashes link blocks together (each block contains the previous block's hash), verify transaction integrity, and power Proof of Work mining. SHA-256 is Bitcoin's hash algorithm.
Why It Matters
Hashing is what ties blocks together. Altering any past transaction would change every later block hash, which makes tampering impractical. Transaction hashes serve as IDs on block explorers, and Merkle trees use hashes to check large sets of transactions efficiently.
Key Considerations
Different blockchain networks use different hash algorithms with varying security properties. SHA-256 (Bitcoin) and Keccak-256 (Ethereum) are both well studied. When evaluating a new blockchain, check whether its hash algorithm has been widely reviewed by cryptographers.
Example
A Bitcoin transaction ID is a hash of the transaction's data, made by running SHA-256 twice. It is a 64-character hexadecimal string, such as "a1b2c3d4..." It serves as the transaction ID, which anyone can look up on a block explorer to verify the transfer details.
Related Terms
Frequently Asked Questions
A fixed-length string of characters produced by a cryptographic hash function, serving as a practically unique digital fingerprint for any input data.
Hashing is what ties blocks together and gives each transaction an ID.
No, cryptographic hash functions are one-way by design. Given a hash output, it is computationally infeasible to determine the input. This one-way property is why hashes are used for password storage, transaction verification and mining.