Home> web3.0> body text

Vitalik Buterin's keynote speech in Hong Kong: The agreement has developed rapidly in the past 10 years, but there are two major problems: efficiency and security.

WBOY
Release: 2024-04-09 15:22:15
forward
1005 people have browsed it

2024 During the Hong Kong Web3 Carnival, Ethereum co-founder Vitalik Buterin delivered a keynote speech "Reaching the Limits of Protocol Design" at the "Web3 Scholar Summit 2024" hosted by DRK Lab.

He introduced that in the 2010s, protocols based on basic cryptography were hashing and signatures. Subsequently, the agreement developed rapidly. In the 2020s, protocols based on advanced cryptography include ZK-SNARKS, 2PC, MPC, FHE (fully homomorphic encryption), aggregation (including through IVC, ICD, etc.), and advanced P2P networks.

Vitalik said that the current ZK-SNARKs, MPC, FHE and other technologies have efficiency and security issues. Among them, the Ethereum Slot block time is 12 seconds, the "ordinary" block verification time is about 400 milliseconds, and ZK -SNARK proof time is about 20 minutes, Ethereum’s goal is to achieve real-time proof. There are several solutions to the efficiency problem, including parallelization (Parallelization), aggregation trees (aggregation trees), improving efficiency (using SNARK algorithm and hashing), and ASIC accelerated hardware solutions.

Vitalik Buterin香港主旨演讲:协议过去10年迅速发展,但存在效率、安全两大问题

The ZK-SNARKs circuit vulnerability problem can be solved by the security committee and multi-provers. In the future, AI can help with debugging and further solving problems.

"I think an interesting future direction is to use artificial intelligence tools, potentially using new tools for formal verification. Like proving that there are no vulnerabilities in zkEVM." He said, "Maybe we might actually be able to implement one in the future A world without bugs. It’s a bit crazy.”

In addition, when talking about signature aggregation efficiency, Vitalik Buterin pointed out that the current situation is about 30,000 signatures per slot, which requires high node demand. The desired goal is to support as many validators as possible while reducing node requirements and adopting a relatively simple protocol. According to theoretical limitations, each participant requires 1 bit of data per time slot, and there is no lower limit in calculation.

"So the conclusion is, basically, what we need to think about is we need protocols to reach the limits of what you can do with cryptography, and we've gotten to the point where our cryptography is stronger than it was decades ago Much more, but it can be more powerful, and at this point I think we really need to start thinking about what the ceiling is and how we can actually get to it," Vitalik said in closing.

The above is the detailed content of Vitalik Buterin's keynote speech in Hong Kong: The agreement has developed rapidly in the past 10 years, but there are two major problems: efficiency and security.. For more information, please follow other related articles on the PHP Chinese website!

Related labels:
source:panewslab.com
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Latest Downloads
More>
Web Effects
Website Source Code
Website Materials
Front End Template
About us Disclaimer Sitemap
php.cn:Public welfare online PHP training,Help PHP learners grow quickly!