以太坊 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 友善性的擔憂。隨著以太坊的不斷發展，這場辯論的結果將塑造其未來，並決定其保持在區塊鏈創新前沿的能力。