Professional Documents
Culture Documents
Bitcoin
MODULE 3
Merkley Tree
It is a tree data structure where each non-leaf node is a hash of it’s
child nodes. All the leaf nodes are at the same depth and are as far left
as possible.
It maintains data integrity and uses hash functions for this purpose.
Hash Functions
So before understanding how Merkle trees work, we need to
understand how hash functions work. A hash function maps an
input to a fixed output and this output is called hash.
Within the bitcoin networks, there are a group of people known as Miners. In miners, there was a process and
confirm transactions. Anybody can apply for a minor, and you could run the client yourself. However, these
minors use very powerful computers that are specifically designed to mine bitcoin transaction. They do this by
actually solving math problems and resolving cryptographic issues because every transaction needs to be
cryptographically encoded and secured. These mathematical problems ensure that nobody is tampering with that
data.
Additionally, for this task, the minors are paid in bitcoins, which is the key component in bitcoin. In Bitcoin, you
cannot create money as like you create regular fiat currencies such as Dollar, Euro, and Yuan. The bitcoin is
created by rewarding these minors for their work in solving the mathematical and cryptographical problems.
Transaction verifiability - anonymity
The delayed implementation of a Bitcoin Core update by a small number of the network's
miners resulted in the addition of invalid transaction blocks to the bitcoin blockchain this
weekend.
The result was a fork in the network that created two versions of the bitcoin blockchain,
which continued for six blocks on 4th July. An additional three invalid blocks were added to
the blockchain in a repeat of the issue the following day.
Elliptic curves:
Elliptic curves have useful properties. For example, a non-vertical line intersecting two non-tangent points on the
curve will always intersect a third point on the curve. A further property is that a non-vertical line tangent to the curve
at one point will intersect precisely one other point on the curve.
We can use these properties to define two operations: point addition and point doubling.
Elliptic curve cryptography