We consider blockchain in dynamic networks. We define the Blockchain Decision Problem. It requires miners that maintain the blockchain to confirm whether a particular block is accepted. We establish the necessary conditions for the existence of a solution. We, however, prove that the solution, even under these necessary conditions is, in general, impossible. We then present two algorithms that solve the Blockchain Decision Problem under either the knowledge of the maximum source pool propagation time or the knowledge of the source pool membership. We evaluate the performance of the two algorithms.
翻译：我们考虑动态网络中的链条。我们定义了“链链决定问题 ” 。 它要求保留“链链”的矿工确认是否被接受。 我们为存在解决方案创造了必要的条件。 然而,我们证明,即使在这些必要条件下,解决方案一般也是不可能的。 然后,我们提出两种算法来解决“链链决定问题 ”, 两种算法要么是了解最大源集合传播时间,要么是了解源集合成员的知识。我们评估两种算法的性能。
相关内容
微信扫码咨询专知VIP会员