Session 05.1
Consensus Layer
Algorand

ALGORAND
CONSENSUS.

Algorand didn't tweak Proof-of-Stake. It redesigned validator selection itself — using cryptographic self-selection to achieve true decentralization with instant finality.

01

The PoS Problem

The Identity Exposure

Most Proof-of-Stake systems solved energy efficiency but created a new attack surface: known validators = predictable targets.

"PoS removed wasted energy, but it exposed identities."

Known Validator Sets

Fixed or semi-fixed validator sets with public identities. Leads to targeted DDoS, cartel coordination, and regulatory pressure.

Predictable Leaders

When the next block proposer is known in advance, MEV extractors can front-run and attackers can prepare.

Probabilistic Finality

Ethereum-style PoS says "wait N blocks to be safe". Not acceptable for finance, payments, or institutions.

Cartel Coordination

Known validators can cooperate to extract value or coordinate attacks. Democracy becomes plutocracy.

02

Private Self-Selection

Algorand's Philosophical Shift

Instead of the network choosing validators, validators choose themselves — secretly.

→ "In Algorand, leadership is discovered after it's exercised."

Randomness

No predictability in who gets selected

Privacy

No early exposure of leadership

Verifiability

Cryptographic proof prevents cheating

03

Verifiable Random Functions

VRFs solve a fundamental problem: how do you prove you won a lottery without revealing you entered until you've won?

How It Works

  • Each node uses its private key
  • Combined with the previous block hash
  • Computes a local VRF output
  • No messages. No coordination. No announcement.
  • Only if the node wins does it speak

Stake-weighted probability: More ALGO → more lottery tickets. But every round is fresh randomness — no permanent validator elites.

VRF Self-Selection Process

Node uses its private key — never revealed.

VRF Mathematical Intuition

A VRF is essentially a keyed hash function with a twist: you can prove the output was computed honestly without revealing your key.

// Simplified VRF concept
output = VRF(private_key, seed)
proof = cryptographic_proof(output)
// Anyone can verify without knowing key
verify(public_key, seed, output, proof)
Randomness

Output looks random and unpredictable to anyone without the private key.

Uniqueness

For a given key and input, only ONE valid output exists. Cannot cherry-pick.

Verifiability

Anyone can check the proof using only the public key.

04

Stake-Weighted Selection

Stake ≠ Control, Stake = Probability

A common misconception: more stake means you control consensus. In reality, stake represents probability mass — like having more lottery tickets.

Fresh Randomness

Every round uses new randomness. Past wins don't influence future selection.

No Lock-In

No minimum staking periods or unbonding delays. Liquid participation.

Democratic

Even small holders can be selected. No permanent validator elites.

Selection Probability Distribution

15%
25%
8%
35%
12%
5%

Stake distribution affects probability, but random selection prevents predictability.

05

The Consensus Round

A single round of Algorand consensus involves three phases, each with a freshly selected committee that exists only briefly and disappears.

Block Finality Timeline
0s
Block N produced
~2.5s
Proposal phase complete
~3.5s
Soft vote complete
~4.5s
Block certified & FINAL
Instant Finality

Once certified, blocks cannot be reverted. No "longest chain" logic. No waiting for confirmations.

06

Fork Prevention

Forks require competing leaders and sustained disagreement. Algorand structurally prevents both.

Ephemeral Committees

Committees are small, random, and change every step. They exist briefly and disappear.

No Stable Attack Surface

By the time an attacker identifies committee members, they're no longer relevant.

Byzantine Agreement

Even with malicious actors, honest majority ensures consensus without forks.

Traditional PoS (e.g., Ethereum)

Block N: Published
Wait... Wait... Wait...
~33 epochs (~12 minutes)
Block N+32: ~99.9% Finality
⚠️ Probabilistic — reorgs possible

Algorand Pure PoS

Block N: Published
~4.5 seconds...
Block N: CERTIFIED & FINAL ✓
✓ Deterministic — no forks possible
"There is no 'longest chain' logic in Algorand."

This single sentence captures the fundamental difference between Algorand and every other blockchain. Once a block is certified, it's final — forever.

Core Principles

VRFs enable private self-selection of validators

Leadership is discovered after it's exercised

Stake = probability mass, not guaranteed control

Blocks are final in ~4.5 seconds with no forks

Think About It

"If you had to process a $1M payment, would you accept Ethereum's 15-minute finality or want Algorand's 4.5-second guarantee?"

This is the institutional pain point Algorand solves — real-time settlement for finance, payments, and enterprises that can't afford reorg risk.