基于结构化有向无环图的一致性机制设计
Consensus Mechanism Design based on Structured Directed Acyclic Graphs
摘要:
我们介绍了一种结构的有向无环图(DAG)和机制设计的基础上,该结构,使同行可以在大规模的工作量证明(PoW)的基础上达成共识。我们还设计了一种基于DAG结构的内存池事务分配方法,使得一个事务被多个矿工处理的概率可以忽略不计。其结果是,在不牺牲安全和权力下放的情况下,能力得到了显著提升。
英文摘要:
We introduce a structure for the directed acyclic graph (DAG) and a mechanism design based on that structure so that peers can reach consensus at large scale based on proof of work (PoW). We also design a mempool transaction assignment method based on the DAG structure to render negligible the probability that a transaction being processed by more than one miners. The result is a significant scale-up of the capacity without sacrificing security and decentralization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。