Bitcoin Forum
May 13, 2024, 10:52:50 PM *
News: Latest Bitcoin Core release: 27.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: [1]
  Print  
Author Topic: IBM Article: miners to use resource intense calcs to verify tx?  (Read 376 times)
pebwindkraft (OP)
Sr. Member
****
Offline Offline

Activity: 257
Merit: 343


View Profile
October 17, 2017, 01:58:51 AM
 #1

In the IBM article on

https://www.ibm.com/blogs/blockchain/2017/05/the-difference-between-bitcoin-and-blockchain-for-business/?social_post=1099763016&linkId=43090982

it says:

Quote
How does the Bitcoin blockchain work?

The Bitcoin blockchain in its simplest form is a database or ledger comprised of Bitcoin transaction records. However, because this database is distributed across a peer-to-peer network and is without a central authority, network participants must agree on the validity of transactions before they can be recorded. This agreement, which is known as “consensus,” is achieved through a process called “mining.”

After someone uses Bitcoins, miners engage in complex, resource-intense computational equations to verify the legitimacy of the transaction.

I was wondering if this statement is correct. Isn't every full node checking conformity to the rules of a transaction? And for the miners the ressource intensive thing is to then find the nonce?
What would the mempool be in this scenario?

1715640770
Hero Member
*
Offline Offline

Posts: 1715640770

View Profile Personal Message (Offline)

Ignore
1715640770
Reply with quote  #2

1715640770
Report to moderator
The Bitcoin network protocol was designed to be extremely flexible. It can be used to create timed transactions, escrow transactions, multi-signature transactions, etc. The current features of the client only hint at what will be possible in the future.
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction.
1715640770
Hero Member
*
Offline Offline

Posts: 1715640770

View Profile Personal Message (Offline)

Ignore
1715640770
Reply with quote  #2

1715640770
Report to moderator
pebwindkraft (OP)
Sr. Member
****
Offline Offline

Activity: 257
Merit: 343


View Profile
October 17, 2017, 11:16:02 AM
Merited by ABCbits (1)
 #2

I'll answer based on the doc in Andreas' book "mastering bitcoin":

Each full node in the bitcoin network verifies every transaction against a long checklist of criteria. This can be time consuming, when a specially crafted tx is used. But usually tx are checked within milli seconds.

Mining nodes will also validate transactions, they are then added to the mempool, where transactions wait until they can be included into a block. The mining node will aggregate these transactions into a candidate block. The block becomes valid only if the miner succeeds in finding a solution to the proof-of-work algorithm. Usually a hardware mining rig is used to find a solution to the proof-of-work algorithm that makes the block valid. The proof of work is the intensive calculation step.
Once the candidate block is filled with transactions, the hash of this block's header is calculated, until the hash is less than a predefined target. At the current difficulty in the bitcoin network, miners have to try quadrillions of times before finding a nonce that results in a low enough block header hash.
And this is the calculation/computing power intensive step. Not validating transactions.
Pages: [1]
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!