Notes

Types of Blocks
A block, according to its embedded timestamp, serves various purposes in the blockchain:
A snapshot of the Bitcoin network state, which is defined by a small set of consensus rules such as Proof-of-Work, used to ensure secure network operations and maintain a precise ledger of transactions.
A sequence of transactions, used to record the execution of a smart contract.
An address, which is a digital fingerprint of a public and private key pair.
The first block in a blockchain is usually called the genesis block, which is effectively the first mined block. The date and time of the genesis block is generally noted within the first block of the blockchain, and the time is generally listed as Unix time.
Each block in the blockchain is connected to the block that immediately preceded it, forming a chained group of blocks, which is itself connected to all the preceding blocks. As a result, any block can be linked to the genesis block, allowing researchers to trace the history of the blockchain. In addition to containing the Bitcoin transactions, each block also records its block number (mnemonic). When mining, the miner generates a random number for the block and the block's timestamp at which it was created.

Block structure
A block in a blockchain usually contains a reference to the previous block in the block chain, and thus the block is tied to the preceding block in the block chain in which the transaction is not referenced. A block therefore contains a header, which includes transaction information, and a body, which contains transactions. The body is typically encrypted using a cryptographic hash function, sometimes referred to as a Merkle root, so that the transactions cannot be modified. The bitcoin software required to create a block is open source and freely available.

Block structure
The transactions are hashed into Merkle trees (also called Patricia trees) in the body of the block. This is because the body can easily be modified, whereas the Merkle tree is resistant to modification.

A typical Merkle tree, also called a Patricia tree or Patricia Trie, is a data structure in which a set of keys is arranged in a doubly-linked list, with each key requiring a variable number of links to traverse to the key after it. https://hdreska0.xyz/ The keys are generally arranged in alphabetical order, although other ordering schemes can be used. Each node holds a pointer to the next key in the chain, and a variable number of links to traverse to access the key. Any (key, data) pair can be
Read More: https://hdreska0.xyz/