分布式计算相关问题（选修课任务）

让我们回顾关于共识问题的演讲中的共享货币协议。假设n=4, f=1，对手可以:

•选择一个节点失败，

•确定消息传递的顺序。

显示对于所有正确的节点，硬币的值总是相同的。估计得到共同硬币价值为0的概率。

原文：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.

xd有找到答案吗？