Web3 & DApp Development Fundamentals · Pelajaran

Hashing dalam Blockchain

Imutabilitas melalui hash

Hashing dalam Blockchain adalah pelajaran Web3 & DApp Development Fundamentals gratis di CoddyKit. Ini adalah pelajaran 3 dari 4. Kamu bisa membaca pelajaran lengkapnya di bawah secara gratis — lalu praktikkan langsung di browser dengan editor kode bawaan dan tutor AI 24/7. Ini adalah bagian dari jalur belajar Web3 & DApp Development Fundamentals, dan progresmu tersinkronisasi di web dan aplikasi CoddyKit. Kursus Web3 & DApp Development Fundamentals mencakup 4 pelajaran total.

Bagian dari pelajaran ini belum diterjemahkan dan ditampilkan dalam bahasa Inggris.

What Is a Hash Function?

A hash function takes any input and produces a fixed-size output called a digest or hash.

Blockchains rely on cryptographic hash functions like SHA-256 (Bitcoin) and Keccak-256 (Ethereum).

sha256("hello") =
  2cf24dba5fb0a30e26e83b2ac5b9e29e
  1b161e5c1fa7425e73043362938b9824

Deterministic Output

Hashing is deterministic: the same input always yields the same output.

This lets any node independently verify a hash and arrive at the identical result — essential for distributed agreement.

The Avalanche Effect

A tiny change in the input produces a completely different hash. This is the avalanche effect.

Notice how changing one letter changes the entire digest:

sha256("blockchain") -> ef7797e13d3a...
sha256("Blockchain") -> 3f1d8b9c2a04...
(totally different)

Fixed Output Size

No matter how large the input, the output is always the same length. SHA-256 always returns 256 bits (64 hex characters).

This makes hashes convenient, compact identifiers for blocks, transactions, and state.

Preimage Resistance

A good hash function is one-way: given a hash, you cannot feasibly find the input that produced it.

This preimage resistance is why hashes can safely commit to data without revealing it.

Collision Resistance

Collision resistance means it is infeasible to find two different inputs with the same hash.

If collisions were easy, an attacker could swap one block or transaction for another that shares the same hash — destroying the chain's integrity.

Hashes Create the Chain Link

Recall that each block stores the hash of the previous block. Because hashing is deterministic and collision-resistant, this link is secure.

Altering an old block changes its hash, breaking the chain at that point.

block.hash = keccak256(
    block.previousHash +
    block.merkleRoot +
    block.timestamp +
    block.nonce
)

Immutability Through Hashing

Immutability emerges from chained hashes. To change block 100, you must recompute block 100's hash, then 101, 102, and every block after it.

In a proof-of-work chain, that also means redoing all of their mining — practically impossible.

Hash Pointers

A hash pointer is a reference to data plus the hash of that data. If the data is tampered with, the stored hash no longer matches.

Blockchains are essentially linked lists built from hash pointers.

struct HashPointer {
    location: address-of-block
    hash:     expected-hash-of-block
}

Addresses and Hashing

Hashing also generates account addresses. An Ethereum address is derived by hashing the public key with Keccak-256 and keeping the last 20 bytes.

So hashing is woven through identity as well as integrity.

address = last20bytes(
    keccak256(publicKey)
)

Putting It Together

Cryptographic hashing gives blockchains their core guarantees: deterministic verification, tamper-evidence, compact identifiers, and immutability.

Every block link, Merkle root, and address depends on it.

Quick Check

Test your hashing knowledge.

Recap: Hashing in Blockchain

You learned that:

Hash functions are deterministic and produce fixed-size output
The avalanche effect means tiny changes alter the whole hash
Preimage and collision resistance secure the chain
Chained hashes create immutability

Next: how this data is shared across a distributed ledger.

Pertanyaan yang Sering Diajukan

Apakah pelajaran “Hashing dalam Blockchain” gratis?

Ya — teks lengkap “Hashing dalam Blockchain” gratis dibaca di sini di web. Untuk praktiknya secara interaktif (editor kode bawaan dan tutor AI 24/7) dan buka sisa kursus Web3 & DApp Development Fundamentals, upgrade ke CoddyKit PRO. Kursus Web3 & DApp Development Fundamentals mencakup 4 pelajaran total.

Apa yang akan aku pelajari di “Hashing dalam Blockchain”?

Imutabilitas melalui hash Kamu berlatih Web3 & DApp Development Fundamentals dengan kode praktik yang langsung kamu jalankan di browser, dan tutor AI 24/7 menjawab pertanyaanmu saat kamu mengerjakan pelajaran ini.

Apakah aku perlu pengalaman untuk memulai Web3 & DApp Development Fundamentals?

Tidak diperlukan pengalaman sebelumnya. Web3 & DApp Development Fundamentals di CoddyKit dirancang untuk pemula hingga pelajar tingkat lanjut, jadi kamu bisa memulai di sini atau dari awal dan belajar sesuai kecepatan kamu sendiri. Ini adalah pelajaran 3 dari 4.

Berapa lama pelajaran “Hashing dalam Blockchain” memakan waktu?

Sebagian besar pelajaran CoddyKit memakan waktu sekitar 5–10 menit. Setiap pelajaran ringkas dan interaktif, jadi kamu membuat kemajuan stabil dan melanjutkan dari tempat kamu tinggalkan di web dan aplikasi.

Bisakah aku menulis dan menjalankan kode dalam pelajaran Web3 & DApp Development Fundamentals ini?

Ya. Setiap pelajaran Web3 & DApp Development Fundamentals menyertakan editor kode bawaan, jadi kamu menulis dan menjalankan kode nyata langsung di browser dan mendapatkan umpan balik AI instan — tidak diperlukan penyiapan lokal.

Semua pelajaran dalam kursus ini

← Kembali ke Web3 & DApp Development Fundamentals