zkEVM (Zero-Knowledge Ethereum 가상 머신)
zkEVM은 EVM 호환 실행 환경으로 제로 지식 증거를 활용하여 계산 오프 체인의 정확성을 검증하여 확장 가능한 개인 Ethereum 거래를 가능하게합니다.
zkEVM은 제로 지식 증명을 생성하면서 Ethereum 트랜잭션과 스마트 계약을 실행하도록 설계되었습니다. 이러한 증명은 기본 데이터를 공개하지 않고도 트랜잭션 유효성을 검증할 수 있도록 합니다. 이 접근 방식은 메인 Ethereum 체인에서 계산을 오프로드하고 트랜잭션 비용을 줄여 확장성을 크게 향상시킵니다. 다양한 유형의 zkEVM은 EVM과의 호환성이 다르며, 기존 애플리케이션 마이그레이션의 용이성에 영향을 미칩니다.
graph LR
Center["zkEVM (Zero-Knowledge Ethereum 가상 머신)"]:::main
Pre_cryptography["cryptography"]:::pre --> Center
click Pre_cryptography "/terms/cryptography"
Rel_ethereum["ethereum"]:::related -.-> Center
click Rel_ethereum "/terms/ethereum"
Rel_evm_ethereum_virtual_machine["evm-ethereum-virtual-machine"]:::related -.-> Center
click Rel_evm_ethereum_virtual_machine "/terms/evm-ethereum-virtual-machine"
Rel_scalability["scalability"]:::related -.-> Center
click Rel_scalability "/terms/scalability"
classDef main fill:#7c3aed,stroke:#8b5cf6,stroke-width:2px,color:white,font-weight:bold,rx:5,ry:5;
classDef pre fill:#0f172a,stroke:#3b82f6,color:#94a3b8,rx:5,ry:5;
classDef child fill:#0f172a,stroke:#10b981,color:#94a3b8,rx:5,ry:5;
classDef related fill:#0f172a,stroke:#8b5cf6,stroke-dasharray: 5 5,color:#94a3b8,rx:5,ry:5;
linkStyle default stroke:#4b5563,stroke-width:2px;
🧠 지식 테스트
🧒 5살도 이해할 수 있게 설명
Imagine [Ethereum](/ko/terms/ethereum) is a busy city, and a zkEVM is like a super-fast train station built nearby. It processes lots of passenger requests (transactions) really quickly off to the side, and then sends a single, tiny report back to the main city saying everything was done correctly, without slowing down the main city.
🤓 Expert Deep Dive
zkEVMs represent a sophisticated application of zero-knowledge proof technology to enhance blockchain scalability, particularly for Ethereum. The fundamental challenge is bridging the gap between the EVM's execution model and the algebraic structures required by ZK-proof systems (like SNARKs or STARKs). Different zkEVM designs employ distinct strategies to achieve EVM compatibility while enabling ZK-proof generation. Type 1 zkEVMs aim for full EVM equivalence, meaning any valid EVM execution is also a valid zkEVM execution, often requiring complex circuit designs to represent EVM opcodes and state transitions. Type 2 and Type 3 zkEVMs relax strict EVM equivalence for greater ZK-friendliness, potentially sacrificing some compatibility for improved proof efficiency. Type 4 zkEVMs focus on abstracting the computation into a general arithmetic circuit, requiring a transpilation step from EVM bytecode. Key technical considerations include the efficient representation of EVM's Merkle Patricia Trie for state storage, handling of complex opcodes (e.g., hashing, precompiles), and managing the proof generation overhead. The security of a zkEVM relies on the soundness of the underlying ZK-proof system and the correctness of the EVM emulation within the ZK-friendly domain. Trade-offs involve the degree of EVM compatibility versus the efficiency and complexity of proof generation.