Scribd
Upload
39 views

Block Header: A Block Header Is What The Miners Hash To Try and Make The Block Valid. This

The block header contains metadata like the time and difficulty of when the block was mined, the Merkle root of transactions, and the nonce. The Merkle root is a hash of all transaction hashes in the block, and is used to verify the integrity of the transaction data. Miners hash the block header rather than the entire block to validate it more efficiently since blocks can contain thousands of transactions.

Uploaded by

aryan mehta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
39 views

Block Header: A Block Header Is What The Miners Hash To Try and Make The Block Valid. This

The block header contains metadata like the time and difficulty of when the block was mined, the Merkle root of transactions, and the nonce. The Merkle root is a hash of all transaction hashes in the block, and is used to verify the integrity of the transaction data. Miners hash the block header rather than the entire block to validate it more efficiently since blocks can contain thousands of transactions.

Uploaded by

aryan mehta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Block Header: A block header is what the miners hash to try and make the block valid.

This
is a lot more efficient than hashing the entirety of the block, which can be made up of
thousands of transactions.

The block header is a section in a block that serves as a summary of the rest of the block. It’s
made up of all the metadata – such as the time and difficulty when the block was mined,
the Merkle Root of the included transactions, and the nonce .

Merkle Root: A Merkle root is the hash of all the hashes of all the transactions that are part
of a block in a blockchain network.

Things to know about Merkle Root:

 A Merkle root is a simple mathematical way to verify the data on a Merkle tree.
 Merkle roots are used in cryptocurrency to make sure data blocks passed between
peers on a peer-to-peer network are whole, undamaged, and unaltered.
 Merkle roots are central to the computation required to maintain cryptocurrencies like
bitcoin and ether.

Hash: A hash is a function that converts an input of letters and numbers into an encrypted
output of a fixed length. A hash is created using an algorithm and is essential to blockchain
management in cryptocurrency.

 A hash is a function that meets the encrypted demands needed to solve for a
blockchain computation.
 A hash, like a nonce or a solution, is the backbone of the blockchain network.
 Hashes are of a fixed length since it makes it nearly impossible to guess the length of
the hash if someone was trying to crack the blockchain.
 A hash is developed based on the information present in the block header.

Block Reward: Bitcoin block reward refers to the new bitcoins that are awarded by
the blockchain network to eligible cryptocurrency miners for each block they mine
successfully.

 A block reward refers to the number of bitcoins you get if you successfully mine a
block of the currency.
 The amount of the reward halves every 210,000 blocks, or roughly every four years.
 The amount is expected to hit zero around 2140.

Merkle Tree: Merkle tree also known as hash tree is a data structure used for data
verification and synchronization.
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.

https://www.geeksforgeeks.org/introduction-to-merkle-tree/

Binary Tree: A tree whose elements have at most 2 children is called a binary tree. Since
each element in a binary tree can have only 2 children, we typically name them the left and
right child.
https://www.geeksforgeeks.org/binary-tree-data-structure/

Hashing Algorithms: A hashing algorithm is a cryptographic hash function. It is a


mathematical algorithm that maps data of arbitrary size to a hash of a fixed size. ... It should
be infeasible to find two messages with the same hash (a collision); Every change to a
message, even the smallest one, should change the hash value.

There are many different types of hash algorithms such as RipeMD, Tiger, xxhash and
more, but the most common type of hashing used for file integrity checks are MD5, SHA-2
and CRC32. ... MD5 is often used as a checksum to verify data integrity.

Deterministic: A deterministic algorithm is an algorithm which, given a particular input, will


always produce the same output, with the underlying machine always passing through the
same sequence of states.
DID NOT UNDERSTAND

Child Nodes: The childNodes property returns a collection of a node's child nodes, as a


NodeList object. The nodes in the collection are sorted as they appear in the source code and
can be accessed by index numbers.

Any subnode of a given node is called a child node, and the given node, in turn, is the
child’s parent.

SHA: Secure Hash Algorithms, also known as SHA, are a family of cryptographic functions
designed to keep data secured. It works by transforming the data using a hash function s: an
algorithm that consists of bitwise operations, modular operations , and compression function.
The hash function then produces a fixed-size string that looks nothing like the original.

A common application of SHA is to encrypting passwords, as the server side only needs to
keep track of a specific user’s hash value, rather than the actual password. This is helpful in
case an attacker hacks the database, as they will only find the hashed functions and not the
actual passwords, so if they were to input the hashed value as a password, the hash function
will convert it into another string and subsequently deny access.

You might also like