1. Consensus in Adversarial Networks

Consensus protocols enable distributed nodes to agree on a single sequence of blocks, even when some participants are faulty or malicious. In public blockchains, we assume:

• Open membership (anyone can join).
• Partial synchrony (network delays may vary but are eventually bounded).
• Byzantine behaviour (nodes can deviate arbitrarily from the protocol).

Consensus must provide:

• Safety: honest nodes do not diverge on finalised history.
• Liveness: new valid transactions are eventually included.

2. Nakamoto Consensus: Core Ideas

Nakamoto consensus, introduced in Bitcoin, combines:

• Proof-of-work as a Sybil resistance and leader election mechanism.
• Longest (or heaviest) chain rule as a fork choice rule.
• Probabilistic finality based on depth of confirmations.

The key idea is that it is computationally expensive to rewrite history, so an attacker must control a large fraction of the network’s mining power to sustain a conflicting chain.

3. Proof-of-Work: Mechanics and Security

In PoW, miners repeatedly compute hash puzzles:

• Given a candidate block header, find a nonce such that H(header) < target.
• The target encodes difficulty; lower target ⇒ more work expected.
• Hash computation is assumed to be unpredictable and uniformly distributed.

3.1 Difficulty Adjustment

To maintain a target block interval, the network periodically adjusts difficulty based on observed block times. This feedback stabilises throughput but reacts slowly to sudden changes in hash power.

3.2 Energy and Resource Considerations

PoW ties security to external resource consumption (electricity, hardware). This yields:

• High operational cost.
• Robust Sybil resistance.
• Debates about environmental impact and capital efficiency.

4. Proof-of-Stake: Capital-Based Consensus

Proof-of-stake replaces energy expenditure with economic stake:

• Validators lock tokens as collateral.
• Block proposal and voting rights are weighted by stake.
• Misbehaviour can be penalised by slashing staked funds.

4.1 Advantages

• Lower ongoing energy cost.
• Potentially faster finality.
• Security derived from capital rather than hardware.

4.2 Challenges

• Nothing-at-stake problems (validators can sign multiple forks at low cost).
• Complex incentive design for slashing and rewards.
• Potential centralisation around large staking providers.

5. Fork Choice Rules and Finality

A fork choice rule determines which chain is considered canonical when multiple candidates exist. Examples include:

• Longest chain: chain with the most blocks.
• Heaviest chain: chain with highest cumulative difficulty or stake weight.
• LMD-GHOST and variants: recursively selecting the branch with most supporting votes.

Finality can be:

• Probabilistic: deeper blocks become increasingly unlikely to be reverted (e.g., Bitcoin).
• Economic / cryptoeconomic: reverting a finalised block implies slashable misbehaviour.

6. Security Thresholds and Attack Models

In PoW systems, security is usually analysed under an assumption such as: the attacker controls < 50% of total hash power and network delays are bounded.

6.1 Double-Spend Attacks

An attacker attempts to reverse a transaction by mining a competing chain where the payment never occurred, then overtaking the honest chain.

6.2 Selfish Mining

An attacker withholds discovered blocks to gain a disproportionate share of rewards, exploiting protocol incentives.

6.3 Long-Range Attacks in PoS

In PoS, if old keys are compromised or stake can be recreated, attackers might forge an alternative long history. Mitigations include:

• Finality checkpoints.
• Weak subjectivity assumptions.
• Periodic key rotation and slashing rules.

7. Incentive Design: Rewards, Fees and Slashing

Consensus protocols must align rational participants’ incentives with protocol objectives. Mechanisms include:

• Block rewards: new token issuance for block producers.
• Transaction fees: compensation for inclusion and prioritisation.
• Slashing conditions: penalties for equivocation or inactivity (in PoS).

Misaligned incentives can lead to centralisation, low participation, or exploit strategies such as MEV extraction.

8. Finality Gadgets and Hybrid Protocols

Many modern blockchains combine:

• Nakamoto-style chain growth for liveness.
• BFT-style voting for fast finality.

Finality gadgets run on top of the block production mechanism, confirming specific checkpoints irreversibly under defined honesty assumptions (e.g., > 2/3 of stake honest).

9. Performance Tuning: Block Size, Interval and Network Latency

Parameters such as block size and block interval strongly influence:

• Throughput (transactions per second).
• Propagation delay.
• Fork rate.
• Finality time.

Increasing block size or decreasing interval improves raw throughput but raises the probability of forks, which can harm security and increase stale blocks.

10. Module Summary

This module dissected consensus mechanisms underpinning public blockchains, focusing on Nakamoto consensus, proof-of-work, and proof-of-stake. We studied fork choice rules, security thresholds, attack models, and incentive structures. These foundations are essential for understanding more advanced Byzantine Fault Tolerant protocols and scalability-focused designs, which we explore in Module 3.