The document contains a 10 question assignment on blockchain consensus algorithms. The questions cover topics like proof of work, proof of stake, consensus in the presence of failures, and Bitcoin difficulty adjustment. The solutions provided indicate that proof of stake uses virtual resources for mining, proof of work would add the block with the most work, difficulty is adjusted upwards, permissioned blockchains assume a closed network with no malicious miners, and the nonce is used to solve for difficulty in proof of work. Traditional consensus algorithms face challenges in blockchain networks due to their asynchronous nature and large number of users.
The document contains a 10 question assignment on blockchain consensus algorithms. The questions cover topics like proof of work, proof of stake, consensus in the presence of failures, and Bitcoin difficulty adjustment. The solutions provided indicate that proof of stake uses virtual resources for mining, proof of work would add the block with the most work, difficulty is adjusted upwards, permissioned blockchains assume a closed network with no malicious miners, and the nonce is used to solve for difficulty in proof of work. Traditional consensus algorithms face challenges in blockchain networks due to their asynchronous nature and large number of users.
The document contains a 10 question assignment on blockchain consensus algorithms. The questions cover topics like proof of work, proof of stake, consensus in the presence of failures, and Bitcoin difficulty adjustment. The solutions provided indicate that proof of stake uses virtual resources for mining, proof of work would add the block with the most work, difficulty is adjusted upwards, permissioned blockchains assume a closed network with no malicious miners, and the nonce is used to solve for difficulty in proof of work. Traditional consensus algorithms face challenges in blockchain networks due to their asynchronous nature and large number of users.
1. Which of the following consensus algorithms consider virtual resources or digital
coins for participating in the mining activity? a) Proof of Stake b) Raft Consensus c) Proof of Burn d) Proof of Work 2. Say, three independent miners propose the following three blocks (containing the transactions enclosed in []) B1=[T91, T92, T93, T94], B2=[T88,T89,T91], and B3=[T88, T89,T91,T92,T93]. Considering the consensus algorithm is Proof of Work (PoW). Once the network achieves consensus, which of the following blocks is likely to get added to the main chain, given the last block in the blockchain has transactions T86, T87 and T90? a) B1 b) B2 c) Each of these blocks have equal chances to get added to the blockchain d) Either B2 or B3 3. Suppose at a given instance, the difficulty set by the BitCoin network is 63, with the last 2016 blocks mined in 10 days. What will be the next computed value of the difficulty [use ceiling to round off to the next integer]? a) 75 b) 63 c) 87 d) 89 4. Which of the following is considered as the primary assumption for a permissioned blockchain: a) Closed network b) Chosen miners c) No malicious miners d) All of the above 5. Which of the following variable among the components of the block header is computed (or rather obtained) to achieve the difficulty posed by the blockchain network? a) Merkle tree root b) Nonce c) Timestamp d) Previous block hash 6. Considering the Proof of Elapsed Time (PoET) adapted in Hyperledger Sawtooth framework, which of the following mechanisms is used to ensure that the miner (or block leader) is a legitimate participant and not an attacker and has waited for the random amount of time assigned by the network? a) By verifying the acquired stake that the user has obtained by consuming the given random amount of time b) By verifying the amount of bitcoins sent to a verifiable un-spendable address c) By ensuring that the trusted regions of the code are run in Trusted Execution Environment (TEE) and the user cannot tamper it d) By ensuring that the nonce is very difficult to obtain and the user wastes enough time for it 7. Suppose in a distributed network, running Paxos as the underlying consensus algorithm, has 3 proposers and 5 acceptors and 1 learner. Say, 3 of the acceptors have failed, which of the following is true about the network? a) A value gets accepted by default b) Someone else becomes proposer c) None of the proposers get a reply d) A new value gets proposed 8. Which of the following strategy is adapted by the Bitcoin network to control the inflow of bitcoins in the network: a) Increasing the nonce b) Lower the mining reward c) Increasing the block size d) All of the above
9. Which of the following challenges make the application of traditional distributed
consensus algorithms to blockchain-based systems difficult over the Internet? a) Large number of users b) Global accessibility of the internet c) Asynchronous nature of the internet d) All of the above 10. Suppose a mining pool has obtained a block reward of 334 bitcoins and the pool fee is 115 bitcoins. Considering the difficulty of the block as 824, what is the amount of reward each miners in the pool will obtain with pay per share scheme? a) 2.817391300 bitcoins b) 0.265776699 bitcoins c) 0.139563107 bitcoins d) 0.003524693 bitcoins