BLOCKCHAIN SIMULATION

Change a single character in a block sitting in the middle of the chain and its hash changes almost entirely, the next block’s prev-hash no longer matches, and everything from the edit to the tip breaks along with it. Repairing means re-mining block after block, and mining means hunting for a nonce until the hash begins with the required run of zeros; one more zero in that condition multiplies the average number of tries many times over. When two branches sprout from a shared block, the network follows the longest valid chain rule, the loser is discarded and the transactions inside it are orphaned.

▸ Building the genesis block & ledger…
▸ Loading the 32-bit hash (avalanche)
▸ Linking prev-hash between blocks
▸ Starting the miner (Proof-of-Work)
▸ Calibrating difficulty & the nonce counter…
▸ Ready — Online. ✅
0%
⌂ Mind & Machine

Simulation room Blockchain

Blockchain & Distributed ledger
Online
block · hash · PoW · immutable
Mining & chain progress
✅ Healthy chain
Chain length—
Difficulty (zeros)—
Current nonce—
Total tries—
Hash rate—
Chain valid?—
Last block hash—
Notes
A blockchain is a ledger of blocks linked into a chain: each block’s hash includes the previous block’s prev-hash. Mining (PoW) = searching for a nonce until the hash has enough leading zeros. Edit one block → the chain breaks for all later blocks ⇒ immutable. The basis of Bitcoin & distributed finance.
—
Pick a ‘Scenario’ to change the scene (mine · raise difficulty · tamper · re-mine · fork) · 🔀 change data · click a structure for details
Your browser has canvas disabled.
Nonce tries (log) & difficulty over time nonces trieddifficulty
About Blockchain

Change a single character in a block sitting in the middle of the chain and its hash changes almost entirely, the next block’s prev-hash no longer matches, and everything from the edit to the tip breaks along with it. Repairing means re-mining block after block, and mining means hunting for a nonce until the hash begins with the required run of zeros; one more zero in that condition multiplies the average number of tries many times over. When two branches sprout from a shared block, the network follows the longest valid chain rule, the loser is discarded and the transactions inside it are orphaned.

Related topics in Mind & Machine