Cover photo

Crypto 101 | e26: How the network decides what to believe

Consensus mechanisms explained

Ten thousand computers, scattered across every continent, run by people who have never met and do not trust each other. Yet every few seconds they all agree on exactly the same version of events. No CEO issued a command. No central server broke the tie. The math did.

Crypto 101 is an educational series designed to make complex blockchain and decentralized infrastructure concepts accessible to everyone. Each edition explores a specific topic in depth, combining foundational knowledge with practical examples from the real world and from the Nodle ecosystem.

The question at the heart of blockchain

In e25, we explored how your wallet proves things to the network. Your digital signature is mathematical evidence that you authorized a transaction. Validators check it, and if the math holds, they accept it.

But this raises a deeper question: how do all those validators actually agree with each other? What stops one validator from accepting a transaction that another rejects? What prevents a bad actor from bribing half the network to write a false history?

The answer is a consensus mechanism — the rulebook that lets a decentralized network of strangers arrive at one shared truth, every block, every time, without anyone in charge.

Understanding consensus mechanisms is not just theoretical. It explains why your NODL balance cannot be faked, why transactions cannot be reversed once confirmed, and what makes a blockchain fundamentally different from a database that one company controls.

The Byzantine Generals Problem

To understand why consensus mechanisms exist, you first need to understand the problem they solve.

In 1982, computer scientists described what they called the Byzantine Generals Problem. Imagine a group of generals surrounding a city, each commanding their own army from a different position. To succeed, they must all coordinate: either attack together or retreat together. If even one general sends a conflicting message — whether through treachery or a garbled signal — the whole plan collapses.

Now replace the generals with computers on a blockchain network. Each node needs to agree on the same version of the transaction ledger. Some nodes might be slow, offline, or deliberately malicious. The network must reach agreement anyway.

Byzantine Fault Tolerance (BFT) is the property of a system that keeps functioning correctly even when some of its participants fail or lie. The rule that most blockchain systems build around is simple: as long as at least two-thirds of participants behave honestly, the network stays stable. A consensus mechanism is the practical implementation of that principle.

post image
Byzantine Generals Problem — from trust failure to blockchain consensus

What a consensus mechanism actually does

A consensus mechanism is a protocol — a shared set of rules — that determines how a blockchain network agrees on which transactions are valid and in what order they happened.

In a traditional bank, there is a single ledger managed by one institution. You trust the bank to write the correct numbers. In a blockchain, there is no single ledger keeper. Thousands of copies of the ledger exist simultaneously, held by different validators around the world. The consensus mechanism is what keeps all those copies in sync and makes it mathematically expensive to lie.

Without consensus, the same coin could be spent twice. Transaction history could be rewritten. The entire system would collapse into chaos. The consensus mechanism is, in that sense, the invisible backbone of everything blockchain promises.

Proof of Work: the original competition

The first consensus mechanism ever deployed at scale was Proof of Work (PoW), introduced by Bitcoin in 2009.

In a Proof of Work system, validators — called miners — compete to solve a computationally difficult puzzle. The puzzle involves finding a specific number (called a nonce) that, when combined with the transaction data and run through a hash function, produces an output that meets a certain target. This is pure trial and error. There is no shortcut. Millions of guesses are attempted per second.

The first miner to find the correct nonce broadcasts their solution to the network. Other nodes verify it instantly — checking the answer is trivially easy even though finding it was extremely hard. If the solution is correct, the block is accepted, the miner receives a reward in cryptocurrency, and the next race begins.

What makes PoW secure is the cost of cheating. To rewrite even a single past block, an attacker would need to redo all the computational work for that block and every block added since — faster than the rest of the network continues to add new blocks. On Bitcoin's network today, that would require an almost incomprehensible amount of electricity and hardware. The attack costs more than any possible gain.

The drawback is that same cost. PoW consumes enormous amounts of energy, is slow by modern standards, and over time mining has concentrated in the hands of industrial operations with access to cheap electricity — which creates pressure on the decentralization that PoW was designed to protect.

Proof of Stake: replacing energy with skin in the game

Proof of Stake (PoS) was developed to address PoW's limitations. Ethereum switched to it in September 2022, and most modern blockchains — including those that underpin ZKsync — rely on it.

In a Proof of Stake system, there is no mining race. Instead, validators lock up — or "stake" — a quantity of the network's cryptocurrency as collateral. The protocol uses a randomized selection process, weighted by the size of each validator's stake, to choose who gets to propose the next block.

The security logic shifts from energy to economics. A validator who tries to cheat risks having a portion of their staked funds destroyed — a penalty called slashing. Honest behavior is rewarded with transaction fees and newly issued tokens. Dishonest behavior is punished with direct financial loss.

This creates what economists call aligned incentives. Validators have significant skin in the game. The more valuable the network becomes, the more expensive it is to attack it — because doing so would destroy the very asset the attacker holds as stake.

Compared to Proof of Work, Proof of Stake requires a fraction of the energy, processes transactions faster, and scales more effectively to high transaction volumes.

post image
Proof of Work vs Proof of Stake side-by-side comparison

Finality: when a transaction cannot be undone

One concept that consensus mechanisms produce — and that matters enormously for users — is finality: the point at which a transaction is considered permanently settled and cannot be reversed.

In Proof of Work, finality is probabilistic. A transaction becomes increasingly difficult to reverse with every subsequent block added on top of it. By convention, Bitcoin users often wait for six confirmations before treating a transaction as settled, though the probability of reversal after even one confirmation is already very low on a large network.

In Proof of Stake, finality can be made explicit and protocol-level. Ethereum's PoS system uses a checkpoint mechanism: once two-thirds of validators have voted on a checkpoint and it passes, everything before that checkpoint is considered finalized by the protocol itself. It is mathematically impossible to revert without burning more than one-third of all staked ETH — an economic catastrophe that would be self-defeating for any attacker.

For ZKsync specifically, finality combines two layers: transactions receive near-instant soft confirmation on Layer 2 (making them usable immediately for everyday purposes), and hard finality is achieved when the zero-knowledge proof for their batch is verified and settled on Ethereum mainnet — typically within a few hours. You get the speed of Layer 2 and the security guarantees of Layer 1.

post image
Transaction finality: from soft confirmation on ZKsync to hard finality on Ethereum

The 51% attack: what happens when consensus breaks

No discussion of consensus mechanisms is complete without addressing their theoretical weak point: the 51% attack.

In a Proof of Work network, if a single actor gains control of more than 50% of the network's total computing power, they could theoretically rewrite recent transaction history — spending the same coins twice and preventing other transactions from being confirmed. In a Proof of Stake network, the equivalent would require acquiring and staking more than 50% of all coins staked on the network.

On large, established networks, both scenarios are effectively impossible in practice. The cost of acquiring 51% of Bitcoin's hash rate — or 51% of staked ETH — would run into the hundreds of billions of dollars, and executing the attack would crash the value of the very asset the attacker needed to acquire in such quantities. Smaller networks are more exposed, and some have been attacked successfully in the past.

The lesson for users is that network size and stake distribution matter. The more decentralized and widely staked a network is, the more expensive and self-defeating any attempt to subvert it becomes.

How this connects to the Nodle Network

Nodle operates on ZKsync, which inherits its security from Ethereum's Proof of Stake consensus. This matters for the Nodle ecosystem in two specific ways.

Every NODL transaction you make — sending rewards, transferring tokens, interacting with Nodle's smart contracts — is ultimately settled under the security guarantees of Ethereum's PoS consensus. The validators securing Ethereum have collectively staked tens of billions of dollars in ETH. That economic weight is what makes your transactions final and tamper-proof.

The Click app adds a second layer of trust that works alongside blockchain consensus. When you capture a photo or video with Click, the app runs inside a secure enclave on your device — a protected hardware environment that keeps the signing key isolated from the rest of the operating system. The capture is signed at the exact moment it is taken, from inside that enclave, so neither the device metadata nor the media content can be altered after the fact. The authentication step happens on-device, before the signature is ever created: the app verifies the device environment and integrity first, and only then produces the cryptographic proof.

That signed capture — with its embedded C2PA metadata including device identity, timestamp and location — becomes immutable proof on-chain. Not "probably real." Provably real.

Consensus, in the end, is not just a technical feature. It is what allows a global network of people who have never met to act as if they share a single trusted ledger — and in Nodle's case, a single trusted record of physical reality — without trusting each other at all.

post image
How Nodle connects consensus — NODL transactions and Click secure enclave signing

What is coming in e27

Over the last four editions, we have traced a complete arc: what a wallet is, how it is created, how it proves ownership, and now how the network decides what to believe.

In e27, we will zoom out further and explore smart contracts — the self-executing programs that live on blockchains and power everything from DeFi protocols to Nodle's own reward distribution logic. How do they work? What can they do? And why does code running on a blockchain behave so differently from code running on a server?

Stay curious, stay in control, keep Clicking and Nodle on! 🧠

This content is for educational purposes only and does not constitute financial, investment or legal advice. Always conduct your own research and consult with qualified professionals before making any financial decisions.


Glossary

Consensus mechanism
A shared set of rules that lets a decentralized network agree on which transactions are valid and in what order they happened, without a central authority.

Byzantine Generals Problem
A classic thought experiment about how different parties can coordinate a plan when some messages may be delayed, corrupted, or sent by attackers. Blockchains solve a real-world version of this problem.

Byzantine Fault Tolerance (BFT)
The property of a system that can keep working correctly even if some participants fail or act maliciously, as long as most participants follow the rules.

Proof of Work (PoW)
A consensus mechanism where miners compete to solve hard computational puzzles. The winner adds the next block and earns a reward. Very secure but energy-intensive and slower.

Miner
A participant in a Proof of Work system who uses computing power to solve puzzles, validate transactions, and add new blocks to the chain in exchange for rewards.

Proof of Stake (PoS)
A consensus mechanism where validators lock up (stake) coins as collateral. The protocol randomly selects stakers to create and verify new blocks. Much more energy-efficient than PoW.

Staking
Locking up cryptocurrency in a Proof of Stake network to help secure the chain. Honest validators earn rewards; dishonest ones risk losing part of their stake.

Slashing
The penalty in many Proof of Stake systems where a validator’s staked funds are partially destroyed if they cheat or break the protocol rules.

Finality
The point at which a transaction is considered irreversible. After finality, the network will not reorganize the chain in a way that removes or changes that transaction.

51% attack
A theoretical attack where one entity controls more than half of the network’s consensus power (hash rate or staked coins) and can try to rewrite recent transaction history or censor new transactions.

Hash rate
The total combined computing power used to secure a Proof of Work network. Higher hash rate makes it more expensive and harder to attack.

Validator
A node that actively participates in consensus by proposing and verifying blocks. In Proof of Stake, validators stake coins and are rewarded or penalized based on their behavior.

Node
Any computer running blockchain software that stores a copy of the ledger and helps relay transactions. Not all nodes are validators, but all validators are nodes.

ZKsync
A Layer 2 scaling network that uses zero-knowledge proofs to batch many transactions off-chain and then settle them securely on Ethereum.

Zero-knowledge proof (ZKP)
A cryptographic method that lets someone prove a statement is true (for example, that all transactions in a batch are valid) without revealing the underlying data.

zk-rollup
A type of Layer 2 network that processes transactions off-chain, then posts a compressed batch plus a zero-knowledge proof to a Layer 1 blockchain like Ethereum.

Secure enclave
A protected hardware area inside your phone that can generate and store cryptographic keys so that private key material never leaves that safe environment.

Click app
Nodle’s camera app that signs photos and videos at the moment of capture, using a secure enclave and C2PA metadata to create verifiable, on-chain proof of when, where, and on which device content was recorded.

Deep Real
A Click-captured photo or video with cryptographic proof and C2PA metadata that shows it was created by a real person, on a real device, at a real time and place.

DePIN (Decentralized Physical Infrastructure Network)
A network where real-world infrastructure and data collection are contributed by everyday participants and coordinated through blockchain, with rewards paid in tokens like NODL.