Chapter 3
Chapter 3
Proof of Stake (PoS) is a consensus mechanism where validators are chosen to create new blocks based
on how much cryptocurrency (stake) they lock (stake) in the network — not by computing power, like in
Proof of Work (PoW).
✅ In simple terms: “The more coins you lock, the more responsibility you get — and the more reward
you can earn.”
2. The protocol selects one validator from the stakers to propose the next block.
5. The network confirms and adds the block through validator votes.
Hardware need Specialized mining rigs (ASICs) Just a normal computer or node
✅ Advantages of PoS
♻️Energy-efficient (eco-friendly)
❌ Limitations of PoS
🤑 “Rich get richer”: Bigger stakers have higher chances of being selected
🧠 Nothing at Stake problem: Validators might sign multiple chains without penalty (though
modern PoS includes slashing to prevent this)
🔐 Security in PoS
🔍 Real-World Examples
🧠 In Case Studies:
👉 Recommend Proof of Stake and explain staking, validator selection, and slashing mechanisms.
Proof of Burn is a blockchain consensus mechanism where participants gain the right to validate blocks
and earn rewards by “burning” coins — meaning they send cryptocurrency to an address where it’s
permanently unusable.
1. A user burns coins (destroys them) by sending to a verifiably unspendable wallet address.
3. The more coins a user burns, the higher their chances of being selected as a block validator.
🔥 Once coins are burned, they’re gone forever — which also creates deflation and scarcity.
Advantage Description
Limitation Description
The more coins burned, the longer a user can mine blocks
👉 You can propose Proof of Burn as a solution, with optional hybrid models (PoB + PoS or PoB + PoW).
Proof of Elapsed Time (PoET) is a lottery-based consensus mechanism where each participant waits for
a random amount of time, and the first to finish waiting wins the right to create the next block.
5
🕒 The “waiting time” is enforced and verified using a Trusted Execution Environment (TEE) — typically
Intel’s SGX (Software Guard Extensions).
1. Each validator (node) requests a random wait time from its TEE.
3. The node whose timer expires first wakes up and creates the next block.
4. The block includes proof that it won fairly (verified by the TEE).
✅ Advantages of PoET
💼 Enterprise-ready Ideal for permissioned blockchains where all validators are known
❌ Limitations of PoET
Limitation Description
🤔 Trusted setup You must trust the TEE provider (e.g., Intel)
🛠️Less suitable for public chains PoET is not commonly used in open, permissionless networks
6
Limitation Description
Nodes run in SGX-enabled environments and validate blocks based on elapsed time proofs.
🧠 In Case Studies
💡 Introduction to Ethereum
Ethereum is a decentralized, open-source blockchain platform that enables developers to build and
deploy smart contracts and decentralized applications (DApps).
7
✅ Unlike Bitcoin (which is mainly for peer-to-peer currency), Ethereum is programmable — it’s a
blockchain with a built-in virtual computer.
Feature Description
🔁 Ethereum Virtual Machine (EVM) Executes smart contracts on every Ethereum node
💸 Ether (ETH) Native cryptocurrency used for transactions and gas fees
♻️Transitioned to PoS Ethereum now uses Proof of Stake after "The Merge" (2022)
5. Transactions and smart contract logic are processed by the EVM, ensuring all nodes reach the
same state.
Used to:
o NFT marketplaces
🧠 In Case Studies:
If a question asks:
Programmable blockchain
Goerli
Sepolia
You get test ETH from something called a faucet — a free service that gives you test tokens.
A faucet is a web-based tool that gives out free test ETH to developers.
Examples:
Goerli Faucet
Sepolia Faucet
Alchemy Faucet
Chainlink Faucet
3. Click "Request"
🚫 Note:
10
Reason Description
🧠 In Case Studies:
If asked:
👉 Mention:
✅ In simple terms: DApps are like regular apps (e.g., Twitter, Uber, Facebook) — but without a central
authority or owner.
11
1. Frontend (UI) – Just like any app, built with HTML, CSS, JavaScript, etc.
Feature Description
🧠 Smart contract-powered Logic and rules are enforced by code, not humans
🌍 Interoperable – DApps can connect and share data through smart contracts
12
Challenge Explanation
🧠 In Case Studies
If a case asks:
A smart contract is a self-executing program stored on the Ethereum blockchain that runs automatically
when certain conditions are met.
✅ It’s like a digital version of “If this, then that” — with no human or third party needed to enforce it.
Each contract runs exactly the same on every node → ensures consensus and trustlessness.
13
releaseFundsToProjectOwner();
} else {
refundContributors();
Once the funding deadline hits, the smart contract automatically handles the logic — no admin
required.
Property Description
⚖️Deterministic Given the same input, it always gives the same output
🔒 Tamper-proof Cannot be changed once deployed (unless designed with upgrade logic)
Advantage Description
Risk Explanation
🧠 In Case Studies:
If a case involves:
Removing intermediaries
The Ethereum Virtual Machine (EVM) is a runtime environment that executes smart contracts on the
Ethereum blockchain. It acts like a global decentralized computer that every Ethereum node runs.
✅ It ensures that all nodes agree on the outcome of smart contract execution — even though they’re
distributed across the world.
3. Handles:
o Storage
o Transactions
o Contract interactions
o Gas metering
Every node in the Ethereum network runs the same instructions in the EVM → This is what makes
blockchain consensus possible.
3. Deployed on-chain
4. When called, the EVM runs the bytecode and updates the blockchain state
🧰 Features of EVM
Feature Description
Component Role
✅ Benefits of EVM
🔐 Safe & sandboxed Bugs in one contract don’t crash the network
❌ Limitations of EVM
17
Limitation Explanation
🧠 In Case Studies:
💻 What is Solidity?
✅ It’s inspired by JavaScript, Python, and C++, and is optimized for writing logic that runs on the
blockchain.
o ✅ DeFi apps
o ✅ DAOs
o ✅ NFTs
o ✅ Voting systems
Feature Description
// SPDX-License-Identifier: MIT
contract SimpleStorage {
storedData = x;
return storedData;
🔍 Explanation:
1. State Variables
2. Functions
o view: read-only
3. Modifiers
modifier onlyOwner() {
require(msg.sender == owner); _; }
4. Events
5. Constructor
constructor() {
owner = msg.sender;
Benefit Explanation
❌ Challenges / Risks
🧠 In Case Studies:
21
If you're asked:
👉 Mention Solidity, its structure, and how it interacts with the EVM.
Validate transactions
✅ Because all participants are pre-verified, we don’t need high-cost mechanisms like PoW or PoS.
Hence, permissioned blockchains use different consensus algorithms than public chains.
Limitation Description
Limitation Description
🧠 In Case Studies:
State Machine Replication is a method of achieving distributed consensus by ensuring that all nodes
(replicas) in a network:
✅ If everyone sees and applies the same inputs in the same order, they all reach the same result — even
in a distributed setting.
1. All nodes have a copy of the state machine (e.g., a database, a ledger).
Example: If node A processes transactions [T1, T2, T3], and node B does the same, they will both have
the same final state.
Account balances
Token ownership
So, when nodes agree on the order of transactions, they can all independently execute and update their
copy of the ledger.
Reason Description
📦 Consistency Ensures all nodes have the same version of the truth
25
Reason Description
These protocols differ in their way of achieving ordering and commitment, but all aim to ensure correct
state replication.
❌ Challenges
Challenge Description
🙈 Leader failures Can slow down consensus if leader crashes (depends on algorithm)
🧠 In Case Studies
26
How blockchain ensures all peers have the same ledger state
👉 Mention State Machine Replication as the core principle, supported by consensus algorithms like
PBFT or Raft.
🧠 What is PAXOS?
27
PAXOS is a fault-tolerant consensus algorithm that ensures a group of nodes (called replicas) can agree
on a single value, even if some nodes fail or behave unexpectedly.
✅ It is used to replicate state machines in a way that maintains consistency across all nodes in a
distributed system.
Nodes may crash or disconnect, but not act maliciously (Crash Fault Tolerant)
Role Responsibility
1. Proposer sends a proposal number (n) to all Acceptors (saying “Will you promise to reject any
proposals lower than n?”)
o And if they already accepted a value, they share that value and its number.
🔹 Phase 2: Accept
28
o Proposal number n
o The value from the highest-numbered prior accepted proposal (or a new value if none
were accepted)
✅ Value is Chosen
Once a majority of Acceptors accept the same value, that value is chosen and communicated to
Learners.
This process repeats for each step in a sequence to build consensus across multiple operations (e.g.,
transactions or blocks).
✅ Advantages of PAXOS
❌ Limitations of PAXOS
Limitation Explanation
👑 Leader bottleneck Needs a stable leader for fast performance (in multi-PAXOS)
🔍 Variations of PAXOS
🧠 In Case Studies:
If asked:
👉 Mention PAXOS, its prepare/accept phases, and use cases in databases, file systems, or permissioned
blockchains.
🛑 Unlike crash faults (where a node just stops), Byzantine faults can lie, cheat, or behave inconsistently
— like a traitor in the network.
Imagine a group of generals surrounding a city. They must agree on whether to attack or retreat, but:
The challenge:
How can the loyal generals reach consensus, despite the presence of traitors?
🤖 In Blockchain Systems
Public blockchains must assume some nodes may be dishonest, which is why Byzantine Fault Tolerance
(BFT) is so important.
Example Description
🛑 Selective behavior Follows protocol with some nodes, breaks it with others
🧠 General rule: Most Byzantine Fault Tolerant systems can tolerate up to f < n/3 faulty nodes, where n is
the total number.
✅ Summary Table
Crash Fault Node goes offline Yes – handled by CFT (like Raft)
Byzantine Fault Node lies or misleads others Yes – with BFT protocols like PBFT, PoW, PoS
🧠 In Case Studies:
If you're asked:
👉 Explain Byzantine Faults as malicious or inconsistent behavior, and how consensus protocols detect,
tolerate, or punish it.
“How can multiple distributed nodes reach agreement on a decision, even if up to one-third of them
act maliciously or inconsistently?”
They are algorithms designed to solve the Byzantine Agreement Problem, ensuring:
These protocols are designed to work even when nodes send false or conflicting messages.
2. Validity: If all honest nodes propose the same value, that value must be chosen
🔶 5. HotStuff Protocol
✅ Advantages
Benefit Explanation
❌ Challenges
34
Limitation Explanation
🧠 In Case Studies:
If asked:
🧠 What is PBFT?
PBFT (Practical Byzantine Fault Tolerance) is a consensus protocol that allows a group of nodes
(replicas) to reach agreement on the state of a system — even if some of them are malicious (Byzantine
faulty).
It’s efficient and well-suited for permissioned environments, tolerating up to (n – 1)/3 faulty nodes in a
network of n total nodes.
Safety means:
All honest (non-faulty) nodes will agree on the same sequence of committed operations or blocks.
35
📌 Key Idea:
If a value (block/transaction) is committed by one honest node, no other honest node will ever commit
a different one for the same sequence number.
Liveness means:
The system will eventually reach consensus and make progress — i.e., new blocks or transactions get
committed.
📌 Key Idea:
As long as the network is functioning and a quorum of honest nodes exists, the system won't get stuck —
it will continue to process transactions.
Safety No two honest nodes decide differently Prevents data inconsistency or forks
📌 So even if the current leader is faulty, the network doesn't stall forever.
🧠 In Case Studies:
If you're asked:
Enterprise Blockchain is a type of blockchain designed for companies and institutions to:
Unlike public blockchains (e.g., Bitcoin, Ethereum), enterprise blockchains are usually permissioned and
customized for business needs.
🧱 Key Characteristics
Feature Description
Feature Description
🛠️Modular and customizable Tailored consensus, identity, privacy, and access control
📊 Scalable and efficient Higher performance, lower latency than public blockchains
💼 Use cases Crypto, NFTs, open DeFi Supply chain, finance, healthcare
🚚 Supply Chain Track origin and movement of goods (e.g., IBM Food Trust)
Platform Description
Platform Description
Benefit Explanation
❌ Challenges
Challenge Explanation
🧠 In Case Studies:
If you're asked:
"How can blockchain help streamline operations in an industry like banking or healthcare?"
Permissioned access
Hyperledger Fabric is a modular, permissioned blockchain platform designed for enterprise use. It was
developed under the Hyperledger Project (hosted by the Linux Foundation) and is designed for building
private and secure blockchain networks between known participants.
Feature Description
🔄 Endorsement policy Defines who must approve a transaction before it’s accepted
🔎 Private data Certain data can be shared only between authorized parties
Feature Description
Component Role
2. Endorsing peers simulate the transaction (no ledger update yet) and return signed responses.
4. Ordering service creates a block and delivers it to all peers in the channel.
🔐 Only after all endorsement policies and validation rules are satisfied is a transaction recorded.
JavaScript (Node.js)
Java
Advantage Benefit
🧠 In Case Studies:
If asked:
“Which blockchain platform suits an enterprise use case where participants are known and
privacy is required?”