Scribd
Upload
63 views1 page

Block: Contents of A Block Block Structure

Each block contains a record of recent transactions, a reference to the prior block, and a difficult-to-solve puzzle. The collection of blocks forms a chain. A block contains a block header with fields like the previous block hash, a timestamp, and difficulty target. It also contains a record of transactions since the last block. New blocks require solving a mathematical problem to be added to the blockchain network.

Uploaded by

Varun Khosla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
63 views1 page

Block: Contents of A Block Block Structure

Each block contains a record of recent transactions, a reference to the prior block, and a difficult-to-solve puzzle. The collection of blocks forms a chain. A block contains a block header with fields like the previous block hash, a timestamp, and difficulty target. It also contains a record of transactions since the last block. New blocks require solving a mathematical problem to be added to the blockchain network.

Uploaded by

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

BLOCKCHAIN

# B L O C K C H AI N

Block
# T R AN S AC T I O N S

# M E R K L E T R E E

# H AS H I N G
EXPLAINER

Each block contains a record of recent transactions, a reference to


the prior block and a difficult-to-solve puzzle to be mined. The
collection of all blocks can be said to form a chain.

Contents of a Block Block Structure


A block is a container data structure
Block Header
that aggregates transactions for
The Block Header contains six fields that contain the reference to the inclusion in a blockchain.
prior block and a difficult-to-solve puzzle to be mined.
1. Version – Specifies the block version number to track Size Field Description
2. Previous Block Hash – A reference to the hash of the previous
block in the chain
4 bytes Block Size The size of the
3. Merkle Root– A hash of the root of the merkle tree of this block’s block
transactions
4. Timestamp – The creation time of this block 80 bytes Block Several fields
Header form the block
5. Difficulty Target – The proof-of-work algorithm difficulty target for
header
this block
6. Nonce – A counter used for the proof-of-work algorithm 1-9 bytes Transaction How many
Counter transactions
follow
R e c e n t Tr a n s a c t i o n s R e c o r d Variable Transactions The transactions
Each block contains a record of all recent transactions since the last recorded in this
block
block was solved and submitted to the blockchain network. New
blocks cannot be submitted to the network without the correct hash
solution as defined in the Block Header. To find the correct hash
solution, a difficult-to-solve mathematical problem must be solved.
Once a valid solution is found; however, it is very easy for the rest of
the network to confirm that the solution is correct. Related Explainers

How Blockchain Works


• Transaction – link
• Consensus Mechanisms – link

Blockchain Components
• Cryptography 101 – link
• Hashing – link
• Proof of Work – link
• Timestamps – link
• Merkle Trees – link

FSS Blockchain Forum


• All Other Explainers – link
Simplified Bitcoin Blockchain

Sources: https://en.bitcoin.it/wiki/Block
https://en.bitcoin.it/wiki/Block_hashing_algorithm
http://chimera.labs.oreilly.com/books/1234000001802/ch07.html#_introduction_2

You might also like