Professional Documents
Culture Documents
Learning Objectives:
In this module, you will learn the following:
Cryptographic Components
Blockchain Protocol
`Tech and banking have a tight association for a long time. This relationship has
benefited greatly both, innovations that leverage technology unusually by definition
have a strong potential to destabilize standard systems. However, in this process, we
win, but the fact that such inventions are painful for society is not unusual. Therefore, it
is essential to carefully analyze the advantages and contras, to consider the risks, to carry
out a more thorough pilot study before the scale-up is taken and to fine-tune them on
the basis of feedback.
-R. Gandhi (Deputy Governor, Reserve Bank of India, Chairman, IDRBT)
Researching beyond the coverage of this module is highly encouraged to
supplement your understanding of the topics covered. Always, think and see beyond the
box.
The citation provided is a guideline. Please check each citation for accuracy
before use.
So, what are we waiting for? Let us now explore the Introduction to Blockchain
Technology in Banking.
FINT-6207 INTRODUCTION TO BLOCKCHAIN TECHNOLOGY IN BANKING
INTRODUCTION TO BLOCKCHAIN TECHNOLOGY Page |2
Introduction
Cryptographic Components
It's worth noting that if any block in the blockchain is tampered with
or contains an unintended error, the block holding the hash reference of
the erroneous block will no longer match. This can trace any unintended
inaccuracy in a blockchain. The opponent will be needed to fix the hatch
pointer in all the succeeding blocks to verify the whole blockchain if the
tampering is intentional. However, if someone retains a commitment to the
last block of the blockchain, it is easy to validate any effort to distort
everywhere in the network. As a result, we have a manipulative data
structure in the form of this blockchain that allows a continuous size
commitment. When a network of entities monitors the final block of the
blockchain at a time, a really decentralized platform is automatically in
place to record the commitment and a decentralized network to ensure that
blockchain manipulation is proven.
It is possible to expand the chain easily by establishing a new block
with a hash pointer on the previous block in the chain which then adds the
newly produced block to the existing chain. In the chain, however, it is more
complex to insert a new block between two existing blocks. When an inner
hash point is updated, the following hash points and therefore all blocks
are modified. The same goes for the removal of a block from the blockchain.
In a blockchain with n blocks, insertion and deletion are O(n) procedures,
however adding is O(1), or a constant time process.
Insertion and deletion will not be feasible if a decentralized network
parallels the blockchains since it is not conceivable to alter O(n) blocks in
the network by one entity in the network without other network members.
Note that it's OK to add the chain and a network entity may potentially add
a new block to the last block of the chain. A block added activity does not
require all network entities to participate. To ensure consistency of
recording, the attached block needs to be broadcast over the network so
that any entity can update its copy of the blockchain, in particular the last
block, as an undertaking. This feature of blockchain is useful for building a
decentralized records ledger across the network.
Merkle Tree: Tamper-evident Binary Tree
A Merkle Tree can be created by constructing a binary tree and
substituting the regular pointers with hash pointers, similar to the
blockchain. The blocks of data are saved in a Merkle tree's leaf nodes, while
the cumulative hash points are stored in the intermediary nodes of the
relevant subtrees. The hash pointer to the root node (top hash) of the
Merkle Tree is like blockchains and is a continuous commitment in size to
the entire tree.
FINT-6207 INTRODUCTION TO BLOCKCHAIN TECHNOLOGY IN BANKING
INTRODUCTION TO BLOCKCHAIN TECHNOLOGY Page |4
Unlike blockchains, the Merkle Tree can insert and add nodes that
are O(log n) operating, where n is the total number of nodes in the tree, and
merely change the shortest route of the Leaf Node to the root to attach a
data block.
Anyone holding the hash point to the root node will note any
inadvertent error or deliberate handling that causes any tree node content
to be altered. For the network, the root node hash reference can be saved
as a distributed commitment for each entity, with the decentralized
tamper-obvious data storage functioning of the Merkle Tree being used in
this scenario.
As adding to the tree corresponds to inserting a node, it is much
more like a generic set than a list in this nonlinear structure. Merkle Trees
also provides a proof of membership O(log n) for every leaf node, can be
used to check the consistency of the data block or to validate evidence. All
that is needed to demonstrate that each node in a Merkle Tree is a member
is O(log n) evidence in the shape of sibling hash references from the leaf
node to the root of the tree on the shortest path. Evidence that a data block
collection is a subset of another set can be utilized in the same way.
FINT-6207 INTRODUCTION TO BLOCKCHAIN TECHNOLOGY IN BANKING
INTRODUCTION TO BLOCKCHAIN TECHNOLOGY Page |5
Blockchain Protocol
represented as the Boolean logic and executable script. Smart Contracts are
the generic name for these blockchain transactions. The transactions in a
blockchain protocol are the atomic components, and the protocol's other
structures are built on top of them. A blockchain platform can be thought
of as a distributed ledger of transactions that is impenetrable to tampering.
Ledger
A Merkle Tree is utilized in a network of blockchain transactions to
ensure that the transactions set are proven through constant commitment
to size (hash pointer to the root of the tree). Each of such transactions will
be recorded in the blockchain ledger (as seen in Figure 4) in a chronological
way (as per their timestamps).
.
Verification
Blockchain was meant to be a decentralized transaction directory
right from the beginning. Therefore, instead of being an unbiased
arbitrator, the network itself must inspect or approve each transaction or
contract between two (or more) members. A protocol verification
mechanism is used to accomplish this. This verification method is generally
used as an executable script in genuine blockchain systems as part of the
transaction, which entails either the acceptance or reject of each
transaction.
The method of verification also links the present operation to
previously existing blockchain transactions, which have been confirmed as
inputs for certain practical blockchain applications. In Figure 4, dotted lines
have been used to show these linkages. The verification method can be
constructed to allow for public verification or, depending on the
application, it can be fully permitted.
Consensus
To aggregate the transactions, a Merkle Tree is employed, and the
block containing this tree is recorded in the blockchain ledger. It's worth
emphasizing that in a distributed network, the task of creating a block and
linking it to the ledger should be organically decentralized. The blockchain
technology is flexible enough to allow for a decentralized adding method,
FINT-6207 INTRODUCTION TO BLOCKCHAIN TECHNOLOGY IN BANKING
INTRODUCTION TO BLOCKCHAIN TECHNOLOGY Page |7
far more versatile, which allows for payments after a specified length of
time (defined by a time lock).
Mining: Bitcoin has a competing mining method based on hash puzzles.
Miners must compete with each other utilizing their access to computer
resources in order to add a new block to the blockchain record. Bitcoin uses
a smart system of incentives to ensure that miners are honest and to
regulate the number of Bitcoins entering the market. In order to further
govern the flow of Bitcoins, the hash puzzle is built to create new Bitcoin
blocks (mined) every 10 minutes on the average. Also known as a
demonstration-of-work consensus approach to the Hash Puzzle mining
competition.
Consensus: Bitcoin utilizes a standard majority consensus mechanism in
which each miner decides to add to which block of the chain and finally
survive the longest chain. The longest chain is usually anticipated to
increase and outperform alternative forks while honest parties are
controlling the majority of processing power.
Ethereum: Is a common cryptocurrency that allows platform users to
improve the fundamental flow of transactions by adding a richer control
flow known as an intelligent contract. Ethereum currently implements the
ETHash work proof technique that is intended to prevent pool mining
utilizing integrated Application Specific Chips (ASIC). The current block
latency is 12 seconds, compared to 10 minutes for bitcoin, so GPUs can be
used for mining. There are plans to convert from this proof of work
approach to proof of the stake in a next version of the Ethereum Consensus
algorithm. Ethereum gives a 5 Ether incentive, like Bitcoin (Coins in
Ethereum).
Solution
What is a Blockchain?
FINT-6207 INTRODUCTION TO BLOCKCHAIN TECHNOLOGY IN BANKING
INTRODUCTION TO BLOCKCHAIN TECHNOLOGY P a g e | 12