Why Blockchain Matters: From Hash Functions to Decentralized Ledgers

Overview

Blockchain is a distributed, append‑only ledger that records transactions without a trusted third party. It achieves trust‑minimized exchange by combining cryptographic hash functions, hash pointers, Merkle trees, proof‑of‑work (PoW) and digital signatures.

Cryptographic hash functions

A hash function maps an input of arbitrary size to a fixed‑size output. Cryptographic hash functions must satisfy three properties:

Collision resistance – it is computationally infeasible to find two distinct inputs that produce the same hash.

Deterministic hiding – the same input always yields the same hash, but the hash reveals no information about the input.

Puzzle friendliness – given a target value, it is hard to find an input whose hash meets the target, which is the basis of PoW.

Example using SHA‑256 (256‑bit output):

Input: "I like ice cream"
SHA‑256: 138F4504A873C01D0864343FAD3027F03CA9BEA2F0109005FA4FC8C7DCC12634

Input: full text of "War and Peace" (≈587 k words)
SHA‑256: 57027F5B3877ABBE43ACB101D59E963BC2CC0E86A6EBCCC34DFD035BBF83B096

Even a single‑bit change in the input produces a completely different hash, illustrating the three properties above.

Transitive hashing and hash pointers

By repeatedly hashing data and chaining the resulting hashes, a *transitive hash* is obtained: the hash of a block implicitly contains the hashes of all preceding blocks. A hash pointer stores the hash of another data structure (e.g., the previous block) instead of its raw contents, enabling efficient integrity verification.

Merkle trees

When a block contains many transactions, hashing each transaction individually and then combining them in a binary tree yields a single *Merkle root* hash. The root uniquely represents the entire set of transactions; any change to a single transaction alters the root, allowing fast inclusion proofs.

Proof‑of‑Work (PoW)

In Bitcoin, miners must solve a computational puzzle: find a nonce such that the SHA‑256 hash of the block header is below a network‑wide difficulty target. The puzzle is deliberately hard (puzzle friendliness) but easy to verify. The miner who finds a valid nonce appends the block, receives a block reward, and adds its work to the chain’s cumulative difficulty. The chain with the most cumulative PoW is considered the canonical ledger.

Digital signatures

Each participant holds a private key (sk) and a corresponding public key (pk = SHA‑256(sk)). A transaction is signed with sk; anyone can verify the signature using pk. The public key (or its hash) becomes the address to which funds can be sent. Because the hash function is deterministic hiding, publishing an address does not reveal the private key.

private key → hash → public key → hash → address

Illustrative coin models

GoofyCoin is a naïve system where a user creates a coin by signing a unique identifier. Without a shared ledger, the same coin can be spent twice (double‑spending).

ScroogeCoin introduces a central validator that records every transaction, preventing double‑spending but re‑introducing centralization.

The blockchain solves this by linking blocks with hash pointers and Merkle roots, creating an immutable, distributed ledger that all participants can verify.

Public vs private blockchains

Public (permissionless) blockchains such as Bitcoin and Ethereum allow anyone to join, submit transactions and run consensus nodes. Security relies on economic incentives (PoW or PoS) and cryptographic guarantees.

Private (permissioned) blockchains restrict participation to known entities. Examples include Hyperledger Fabric, R3 Corda and MultiChain. Consensus is achieved among a predefined set of validators, offering higher throughput at the cost of reduced decentralization.

Key takeaways

Cryptographic hash functions provide collision resistance, deterministic hiding and puzzle friendliness.

Hash pointers and Merkle trees enable compact, tamper‑evident representation of large data sets.

Proof‑of‑Work secures the ledger by making block creation computationally expensive and verifiable.

Digital signatures bind transactions to owners while keeping private keys secret.

Combining these primitives yields a trust‑minimized, immutable ledger that can be either public or private depending on the governance model.

Source: https://hackernoon.com/how-does-blockchain-technology-work-ceeeee47eaba