Let us recall the Shared Coin protocol from the lecture on the consensus problem. Consider the case where n=4, f=1 and that an adversary can:
• pick a node to fail,
• determine the ordering in which the messages are delivered.
Show that always the value of the coin will be the same for all correct nodes. Estimate the probability of getting the shared coin value 0.
译文:让我们回顾一下关于共识问题那一讲中的共享币协议。考虑n=4, f=1的情况,对手可以:
•选择一个失败的节点,
•确定消息传递的顺序。
显示所有正确节点的硬币值总是相同的。估计得到共享硬币值为0的概率。
希望能详尽一些,正确与否无所谓