以太坊 vs. Polygon：创始人在数据存储争论中就 Verkle 树集成发生冲突

以太坊联合创始人 Vitalik Buterin 和 Polygon 联合创始人 Mihailo Bjelic 就 Verkle Trees 与以太坊的整合进行了争论。 Bjelic 质疑此举的必要性，并引用了即将到来的以太坊“zk-fication”和 Polygon 的 zkEVM 功能。 Buterin 反驳说，Verkle Trees 对 zk 友好的性质使其适合以太坊的数据存储增强。

Ethereum and Polygon Founders Clash over Verkle Trees Integration, Sparking Concerns about Data Storage Capabilities

以太坊和 Polygon 创始人就 Verkle Trees 集成发生冲突，引发对数据存储能力的担忧

Vitalik Buterin, the visionary co-founder of Ethereum (ETH), and Mihailo Bjelic, the co-founder of Polygon (MATIC), have ignited a heated debate over the integration of Verkle Trees into Ethereum's architecture. Bjelic's skepticism has raised questions about Ethereum's future data storage capabilities and its potential impact on its performance.

以太坊 (ETH) 富有远见的联合创始人 Vitalik Buterin 和 Polygon (MATIC) 联合创始人 Mihailo Bjelic 引发了关于将 Verkle Trees 集成到以太坊架构中的激烈争论。 Bjelic 的怀疑引发了人们对以太坊未来数据存储能力及其对其性能的潜在影响的质疑。

The Verkle Tree Controversy

Verkle树争议

Verkle Trees are an innovative data structure that promises to enhance Ethereum's data storage efficiency by reducing the size of cryptographic proofs and increasing bandwidth. Proponents argue that this could significantly improve the network's scalability and lower transaction costs.

Verkle Trees 是一种创新的数据结构，有望通过减少加密证明的大小和增加带宽来提高以太坊的数据存储效率。支持者认为，这可以显着提高网络的可扩展性并降低交易成本。

However, Bjelic has expressed concerns about the viability of transitioning Ethereum to Verkle Trees. He contends that the Ethereum network is already on track to implement zk-SNARKs, a different scaling solution, which he believes is more efficient and practical.

然而，Bjelic 对将以太坊过渡到 Verkle Trees 的可行性表示担忧。他认为以太坊网络已经走上了实施 zk-SNARKs 的轨道，这是一种不同的扩展解决方案，他认为这种解决方案更加高效和实用。

Clash over zk-Friendliness

zk 冲突-友好

Bjelic's primary objection stems from the fact that the current Merkle Patricia trees, used in Ethereum's data structure, are not inherently zk-friendly. This means that using them in conjunction with zk-SNARKs would require larger witness sizes, potentially compromising the network's scalability.

Bjelic 的主要反对意见源于这样一个事实：以太坊数据结构中当前使用的 Merkle Patricia 树本质上并不是 zk 友好的。这意味着将它们与 zk-SNARK 结合使用将需要更大的见证规模，可能会损害网络的可扩展性。

Buterin, on the other hand, argues that Verkle Trees were specifically designed to be zk-friendly. He asserts that they can operate with smaller witness sizes, making them a more suitable solution for Ethereum's long-term scalability goals.

另一方面，Buterin 认为 Verkle 树是专门为 zk 友好而设计的。他断言，它们可以以较小的见证人规模运行，这使它们成为更适合以太坊长期可扩展性目标的解决方案。

Polygon's zkEVM Capabilities

Polygon 的 zkEVM 功能

In a bid to further support his argument, Bjelic points to Polygon's zkEVM, which he claims can handle the 300MB witness size proposed by Buterin in just 12 seconds of block time. However, he acknowledges that this would require approximately ten server-class CPUs, raising concerns about the practicality of such a solution for Ethereum's decentralized network.

为了进一步支持他的论点，Bjelic 提到了 Polygon 的 zkEVM，他声称它可以在短短 12 秒的出块时间内处理 Buterin 提出的 300MB 见证大小。然而，他承认这将需要大约十个服务器级 CPU，这引起了人们对以太坊去中心化网络的这种解决方案的实用性的担忧。

Ethereum's Data Storage Challenges

以太坊的数据存储挑战

Ethereum's current data storage mechanism, Merkle Patricia trees, faces significant limitations. They are inherently larger and less efficient than Verkle Trees, leading to scalability issues and higher transaction costs.

以太坊当前的数据存储机制 Merkle Patricia 树面临着重大限制。它们本质上比 Verkle 树更大且效率更低，从而导致可扩展性问题和更高的交易成本。

The implementation of Verkle Trees has been proposed as a potential solution to these challenges. Their smaller proof sizes and increased bandwidth promise to significantly improve Ethereum's performance, making it more scalable and cost-effective.

Verkle Trees 的实施被提议作为应对这些挑战的潜在解决方案。它们更小的证明大小和增加的带宽有望显着提高以太坊的性能，使其更具可扩展性和成本效益。

Implications for Ethereum's Future

对以太坊未来的影响

The ongoing debate between Buterin and Bjelic highlights the complexities and challenges involved in Ethereum's evolution. While zk-SNARKs offer a promising solution for improving scalability, the integration of Verkle Trees could potentially enhance data storage efficiency even further.

Buterin 和 Bjelic 之间持续不断的争论凸显了以太坊发展过程中的复杂性和挑战。虽然 zk-SNARK 为提高可扩展性提供了一个有前景的解决方案，但 Verkle Trees 的集成可能会进一步提高数据存储效率。

The outcome of this debate will have profound implications for Ethereum's future. If Verkle Trees are successfully integrated, it could significantly boost the network's scalability and solidify its position as a leading blockchain platform. However, if alternative solutions, such as Polygon's zkEVM, prove to be more viable, Ethereum may have to explore different avenues to address its data storage challenges.

这场辩论的结果将对以太坊的未来产生深远的影响。如果 Verkle Trees 成功集成，它将显着提高网络的可扩展性并巩固其作为领先区块链平台的地位。然而，如果 Polygon 的 zkEVM 等替代解决方案被证明更可行，以太坊可能必须探索不同的途径来解决其数据存储挑战。

Conclusion

结论

The ongoing debate between Vitalik Buterin and Mihailo Bjelic over Verkle Trees integration has sparked an important dialogue about Ethereum's data storage capabilities and its future trajectory. The potential benefits of Verkle Trees in terms of scalability and efficiency are undeniable, but concerns about their practicality and zk-friendliness need to be carefully considered. As Ethereum continues to evolve, the outcome of this debate will shape its future and determine its ability to remain at the forefront of blockchain innovation.

Vitalik Buterin 和 Mihailo Bjelic 之间关于 Verkle Trees 集成的持续争论引发了关于以太坊数据存储能力及其未来发展轨迹的重要对话。 Verkle Trees 在可扩展性和效率方面的潜在优势是不可否认的，但需要仔细考虑对其实用性和 zk 友好性的担忧。随着以太坊的不断发展，这场辩论的结果将塑造其未来，并决定其保持在区块链创新前沿的能力。