Extending binary Byzantine agreement to multivalued Byzantine agreement 将二元拜占庭式协议延伸至多值拜占庭协议
A binary Byzantine agreement algorithm can be extended to produce a multivalued Byzantine agreement algorithm. The resulting multivalued algorithm is cheaper than previously published algorithms when the cost of transmie values from the multivalued domain is significant. 可以扩展二进制拜占庭协议算法以产生多值拜占庭协议算法。 多值域的传输成本显著低于先前公布的算法。。