Basically protocol that including proof of work to

Basically a node in a bitcoin network that wants to create a
new block must follow all of this steps:

Collect all information about transactions from the network
that have been published since the previous block was generated. Sender of transactions
to the network set up transaction fees for miners so that they have the
motivation to confirm them as soon as possible and enclose them in the next
block. The block has a specific capacity that fits around 1500 transactions, so
the node can give priority to transactions where higher fees are declared and
the remaining ones to be confirmed later. This however might end on blocking
transaction because the fee will be so low that no one will be happy to confirm
transaction.

We Will Write a Custom Essay Specifically
For You For Only $13.90/page!


order now

Verify transactions according to the requirements of the
Bitcoin protocol that including proof of work to check if there is no attempts
of double spending.

Generate block hash. This value is the result of a one-way
hash function that has specific properties. The result of this function is a
string of characters generated randomly. Even a small change to one of the
function arguments results in a completely different hash. Changing one
character means that the hash is completely different. It is important that the
result of the hash function cannot be recovered its arguments in a different
way than by checking different combinations of characters.

The block hash is generated based on transactions that are in
that block, hash of the previous block and an additional element called nonce.
In order for the hash to be accepted by other nodes in the Bitcoin network
block need to be stamped on, closed and it must meet the important requirement that
is having the right number of zeros at the beginning. The miner must then try
different nonce values ??successively and check that the received hash meets
the condition. If not, the operation is repeated. In practice, this task
requires the use of significant computing power calculated in hash rate and the
level of difficulty of the task, the algorithm of block generation periodically
adjusts to the power that all nodes have at the same time, so that a new block
will be generated approximately every 10 minutes.

After generating a hash that is meeting the requirements, it
sends a new block to the remaining nodes, giving the value nonce. Each of the
miners can easily check whether a task has been done, by self-calculating the
hash.