Selecting block proposers (2 marks): In a protocol like Algorand, participants privately compute a VRF output using thei

[answerhappygod]

Selecting Block Proposers 2 Marks In A Protocol Like Algorand Participants Privately Compute A Vrf Output Using Thei 1 (386.24 KiB) Viewed 62 times

Selecting block proposers (2 marks): In a protocol like Algorand, participants privately compute a VRF output using their private key, which you can assume is a random real number between 0 and 1. For block b;, for each coin c; the coin's owner computes the following (using the private key k; assigned to the coin): VRF(bi-1, Cj, k;) <t/W Assume that all coin owners compute and check the VRF for each coin they own. W is the total number of coins currently in circulation. In the limit as W grows to infinity: a. In terms of t what is the expected number of coins per round which satisfy the above inequality, enabling their owner to act as block proposer for the round? b. In terms of t, what is the probability in a given round that no participant will be able to propose a block? C. In terms of t, what is the probability in a given round that there will be more than one coin which satisfies the above inequality and hence multiple blocks can be proposed? d. In practical deployments, what problems are caused in a round if no block is proposed? What about a round where multiple blocks are proposed? Given this, should designers favor one type of failure over the other?