Professional Documents
Culture Documents
Lecture 3
Module 1
Introduction
Dr. Soumik Podder
Assistant Professor
Electronics and Communication
Engineering
Guru Nanak Institute of
Email: Technology
soumik.podder@gnit.ac.in
Syllabus
Block in Block Chain
A block in a blockchain network is like a link in a chain. In the field of
cryptocurrency, blocks are like records that store valid transactions like a
page of a record book and are hashed and encrypted into a hash tree or
Merkle tree.
Blocks are like the building blocks of any blockchain and they are
distinguishable from one another as they have different characteristics.
When a block is completed, it makes room for the following block in
the blockchain. A block is very secure and is impossible to hack
virtually.
Operation:
This consensus algorithm is used to select a miner for the next block
generation. Bitcoin uses this PoW consensus algorithm. The central idea
behind this algorithm is to solve a complex mathematical puzzle and
easily give out a solution. This mathematical puzzle requires a lot of
computational power and thus, the node who solves the puzzle as soon as
possible gets to mine the next block
Proof of Stake (PoS):
This is the most common alternative to PoW. Ethereum has shifted from PoW to
PoS consensus. In this type of consensus algorithm, instead of investing in
expensive hardware to solve a complex puzzle, validators invest in the coins of the
system by locking up some of their coins as stake. After that, all the validators will
start validating the blocks. Validators will validate blocks by placing a bet on it if
they discover a block which they think can be added to the chain. Based on the
actual blocks added in the Blockchain, all the validators get a reward proportionate
to their bets and their stake increase accordingly. At the end, a validator is chosen to
generate a new block based on their economic stake in the network. Thus, PoS
encourages validators through an incentive mechanism to reach to an agreement.
Proof of Burn (PoB):
Coin burning reduces supply thus increasing the price (in theory)
PoET is one of the fairest consensus algorithms which chooses the next
block using fair means only. It is widely used in permissionned
Blockchain networks. In this algorithm, every validator on the network
gets a fair chance to create their own block. All the nodes do so by
waiting for random amount of time, adding a proof of their wait in the
block. The created blocks are broadcasted to the network for others
consideration. The winner is the validator which has least timer value in
the proof part. The block from the winning validator node gets appended
to the Blockchain. There are additional checks in the algorithm to stop
nodes from always winning the election, stop nodes from generating a
lowest timer value.
Distributed Consensus
A procedure to reach a common agreement in a distributed
or decentralized multi-agent platform. It is important for
the message passing system.
Features :
It ensures reliability and fault tolerance in distributed
systems.
In the presence of faulty individuals, it is Ensure correct
operations.
Examples –
Commit a transaction in a database, State machine replication, Clock
synchronization.
How to achieve distributed consensus :
There are some conditions that need to be followed in order to achieve
distributed consensus.
Termination –
Every non-faulty process must eventually decide.
Agreement –
The final decision of every non-faulty process must be identical.
Validity –
Every non-faulty process must begin and ends with the same value.
Integrity –
Every correct individual decides at most one value, and the decided value
must be proposed by some individual.
Application of Distributed Consensus :
Leader election in a fault-tolerant environment for initiating
some global action without introducing a single point of failure.
Maintaining consistency in a distributed network. Suppose you
have different nodes monitoring the same environment. If one of
the nodes crashes, a consensus protocol ensures robustness
against such faults.
Problems in Distributed Consensus
Nodes might crash or might be malicious.
The network is highly imperfect: it's a peer-to-peer system and not all
pairs of nodes are connected to each other.
In this type of blockchain anyone can join the network and read, write, or
participate within the blockchain.
There are one or more entities which control the network and this leads
to reliance on third-parties to transact.