论文标题
基于POW的区块链和区块的可扩展共识协议
Scalable Consensus Protocols for PoW based Blockchain and blockDAG
论文作者
论文摘要
在本文中，我们提出了两个模型，以扩展基于工作证明（POW）的区块链网络中的交易吞吐量。在第一种方法中，为基于POW的最长链规则区块链的最佳交易吞吐量而得出了数学模型。在这种方法中，区块链对等（P2P）网络被视为Erdös-rényi随机网络拓扑。但是，这种方法受块创建率的限制，结果表明，超出最佳点的速率可能导致系统不公平。第二种方法是一种新的共识协议，该协议将分类账视为一个有向的无环图（DAG），称为BlockDag而不是块链。在此框架中，我们遵循两步策略，该策略使系统足够强大以处理双重攻击。第一步涉及开发无监督的学习图集群算法，用于分离攻击者创建的块。在第二步中，攻击者块被消除，其余块按讲台的客户按顺序排列，这使BlockDag系统适合于物联网（IoT）服务中发现的智能合同应用程序。模拟结果表明，与比特币相比，交易吞吐量有显着改善。
In this paper, we propose two models for scaling the transaction throughput in Proof-of-Work (PoW) based blockchain networks. In the first approach, a mathematical model has derived for optimal transaction throughput for PoW based longest chain rule blockchain. In this approach, the blockchain Peer-to-Peer (P2P) network is considered as Erdös-Rényi random network topology. This approach is however limited by the block creation rate, the results suggest that the rate beyond an optimal point can result in unfairness in the system. The second approach is a new consensus protocol proposed by considering the ledger as a Directed Acyclic Graph (DAG) called blockDAG instead of a chain of blocks. In this framework, we follow a two-step strategy that makes the system robust enough to handle the double-spend attacks. The first step involves the development of an unsupervised learning graph clustering algorithm for separating the blocks created by an attacker. In the second step, the attackers blocks are eliminated and the remaining blocks are arranged in topological order by honest clients which makes the blockDAG system suitable for smart contract applications found in Internet of Things (IoT) services. The Simulation results demonstrate a significant improvement in the transaction throughput compared to bitcoin.
