Brevis Research Report: ZKVM and the Infinite Trustworthy Computing Layer of Data Coordination Processors

Brevis has built an initial moat on both “performance reproducibility” and “business feasibility,” constructing a general verifiable computing infrastructure centered around zero-knowledge computation. (Background: Ethereum faced backlash with “Vitalik Buterin praises Polygon” to quell the flames: significant contributions to ZK, not just boring finance) (Additional context: Vitalik Buterin wrote a long article: GKR cryptographic protocol can quickly prove Ethereum, zk-ML is accelerating AI LLM) Brevis has established an initial moat on both “performance reproducibility” and “business feasibility”: Pico/Prism has secured the top tier in the L1 RTP track, while zkCoprocessor opens up high-frequency, reusable commercialization scenarios. The trusted computing (Verifiable Computing) paradigm of “off-chain computation + on-chain verification” has become the universal computing model for blockchain systems. It allows blockchain applications to achieve almost infinite computational freedom while maintaining decentralization and trust minimization (trustlessness) security. Zero-knowledge proof (ZKP) is the core pillar of this paradigm, with applications primarily focused on three foundational directions: scalability, privacy, and interoperability & data integrity. Among these, scalability is the earliest scenario for ZK technology implementation, achieving high TPS and low-cost trusted scaling by moving transaction execution off-chain and verifying results on-chain with short proofs. The evolution of ZK trusted computing can be summarized as L2 zkRollup → zkVM → zkCoprocessor → L1 zkEVM. The early L2 zkRollup migrated execution to layer two and submitted validity proofs on layer one, achieving high throughput and low-cost scaling with minimal changes. zkVM subsequently expanded to a general verifiable computing layer that supports cross-chain verification, AI inference, and encryption computing (notable projects: Risc Zero, Succinct, Brevis Pico). zkCoprocessor developed in parallel as a scenario-based verification module, providing plug-and-play computing and proof services for DeFi, RWA, risk control, etc. (notable projects: Brevis, Axiom). In 2025, the zkEVM concept extends to L1 Realtime Proving (RTP), constructing verifiable circuits at the EVM instruction level, allowing zero-knowledge proofs to be directly integrated into Ethereum mainnet execution and verification processes, becoming a natively verifiable execution mechanism. This context reflects the technical leap of blockchain from “scalable” to “verifiable,” opening a new phase of trusted computing. 1. Ethereum zkEVM's scaling path: from L2 Rollup to L1 Realtime Proving Ethereum's zkEVM scaling path undergoes two phases: Phase One (2022–2024): L2 zkRollup moves execution to layer two and submits validity proofs on layer one; significantly reducing costs and increasing throughput, but leading to liquidity and state fragmentation, L1 is still constrained by N-of-N re-execution. Phase Two (2025–): L1 Realtime Proving (RTP) replaces re-execution with “1-of-N proof + lightweight validation across the network,” improving throughput without sacrificing decentralization; it is still evolving. L2 zkRollup Phase: Balancing compatibility and scalability performance In 2022, during a flourishing stage of the Layer 2 ecosystem, Ethereum founder Vitalik Buterin proposed four types of ZK-EVM classifications (Type 1–4), systematically revealing the structural trade-offs between compatibility and performance. This framework established a clear coordinate for subsequent zkRollup technology routes: Type 1 fully equivalent: consistent with Ethereum bytecode, lowest migration cost, slowest proof. Taiko. Type 2 fully compatible: minimal underlying optimization, strongest compatibility. Scroll, Linea. Type 2.5 quasi-compatible: slight changes (gas/precompiled, etc.) in exchange for performance. Polygon zkEVM, Kakarot. Type 3 partially compatible: larger changes, can run most applications but difficult to fully reuse L1 infrastructure. zkSync Era. Type 4 language level: abandons bytecode compatibility, directly compiles from high-level languages to circuits, best performance but requires ecosystem reconstruction (notable: Starknet / Cairo). Currently, the L2 zkRollup model has matured: by migrating execution to layer two and submitting validity proofs on layer one, it follows the Ethereum ecosystem and toolchain with minimal changes, becoming a mainstream scaling and cost reduction solution. Its proof targets L2 blocks and state transitions, while settlement and security still anchor on L1. This architecture significantly enhances throughput and efficiency while maintaining high compatibility for developers, but also brings liquidity and state fragmentation, and L1 is still limited by the N-of-N re-execution bottleneck. L1 zkEVM: Realtime proving reshapes Ethereum's lightweight verification logic In July 2025, the Ethereum Foundation published an article titled “Shipping an L1 zkEVM #1: Realtime Proving” officially proposing the L1 zkEVM route. The L1 zkEVM upgrades Ethereum from N-of-N re-execution to 1-of-N proof + rapid validation across the network: a few provers generate short proofs for the entire EVM state transition, and all validators only perform constant time verification. This solution achieves L1-level real-time proving (Realtime Proving) without sacrificing decentralization, enhancing the mainnet gas limit and throughput, and significantly lowering the hardware threshold for nodes. Its implementation plan is to replace traditional execution clients with zk clients, running in parallel initially, and gradually becoming the new norm for the protocol layer as performance, security, and incentive mechanisms mature. The old N of N paradigm: all validators repeatedly execute the entire transaction for verification, secure but limited throughput, high peak fees. The new 1 of N paradigm: a few provers execute the entire block and produce short proofs; the entire network only performs constant time verification. The verification cost is far lower than re-execution, safely increasing the L1 gas limit and reducing hardware requirements. The L1 zkEVM roadmap has three main lines Realtime proving: complete the whole proof within 12 seconds of slot time by compressing latency through parallelization and hardware acceleration; Client and protocol integration: standardize the proof verification interface, initially optional, then default; Incentives and security: establish a prover market and cost model, strengthening anti-censorship and network vitality. Ethereum's L1 Realtime Proving (RTP) uses zkVM to re-execute the entire transaction off-chain and generate cryptographic proofs, allowing validators to avoid recalculating and only needing to verify in 1…