Each minor can determine whether or not there will be a transaction in a block. The greater the number of transactions in a block, the greater the amount of computational capacity required to solve that block.
A node must verify a new transaction after receiving it; In particular, one has to make sure that no input of the transaction has ever been spent before. Then you have to check the nodes required to enter the blockchain. If a user cannot rely on his or her network neighbors, he or she must leave a full copy of the blockchain so that any input can be verified.
As written in Nakamoto's white paper, it is possible to verify Bitcoin payments without running a full network node (called Simplified Payment Verification). This method requires only a copy of the block headers of a user's longest chain - which can be found by searching the network node until the longest chain is found. The Merkel branch is then found by attaching the transaction to the designated block. If the transaction can be attached to any part of the chain, it is understood that the network node has accepted it and the blocks added after it give further confirmation. ♥
Thanks for reading ♥️💕
I'm getting to know this for the first time. Though I don't really do much btc transactions.