Payment Junkyards: 
Each miner can determine whether there is no transaction in a block. The number of transactions in a single block is not the same as the higher level of computational power required to solve the block.
After receiving a new transaction information, a node must verify it; Especially the transaction has to be sure that no input has been spent before. Then, the nodes needed to access the blockchain are also to be checked. If a user can not rely on the neighbors of his network, then he must keep a full copy of the blockchain, as any input can be verified. 
As the white paper in Nakamatu is written - it is possible to verify Bitcoin payment (which is called simplified payment verification) without a full network node. In this process, a user's longest chain block headers require only a copy - to find network nodes until they get the longest chain. The mercklays branch is then connected to the fixed block by linking it. In relation to linking the transaction in the chain, it is understood that the network node has accepted it, and the added blocks further guarantee it.
Thank you. Have a Good Life....
I am very interesting about this post. #almumu steemians new in this site peace from #indonesia
and make sure to join our Discord Server
Congratulations! This post has been upvoted from the communal account, @minnowsupport, by sahagi from the Minnow Support Project. It's a witness project run by aggroed, ausbitbank, teamsteem, theprophet0, someguy123, neoxian, followbtcnews, and netuoso. The goal is to help Steemit grow by supporting Minnows. Please find us at the Peace, Abundance, and Liberty Network (PALnet) Discord Channel. It's a completely public and open space to all members of the Steemit community who voluntarily choose to be there.
If you would like to delegate to the Minnow Support Project you can do so by clicking on the following links: 50SP, 100SP, 250SP, 500SP, 1000SP, 5000SP.
Be sure to leave at least 50SP undelegated on your account.