flâneur — a map of the web's best reading

Proof of Meow: how ZK-VM works — Taiko Labs

taiko.mirror.xyz · 937 words · saved by 1 readers

If you have ever wondered how a ZK-VM works, below we explain it in one diagram, with an example of “Proof of Meow.” For more serious people, in the second section, we redraw this diagram to prove EVM instead of meow. Disclaimer: In this explanation, we use some mental models to provide intuition behind “how ZK-EVM works.” In fact, there are more details and nuances, check a series of articles by the PSE group on ZK-EVM to explore it in a more technical context. For those who are here for Proof of Meow – let’s start. “The program” is any program. In our case, “meow” is a program. The program is usually written in user-friendly languages like Solidity, Rust, Noir, etc. To prove the program, it should be compiled to bytecode. The compiler converts the source code (i.e., written by the developer) to bytecode (i.e., readable for the computer). Bytecode looks more cryptic than high-level languages: However, as we can see above, bytecode is just a set of instructions explaining to the Virtua

TL;DR If you have ever wondered how a ZK-VM works, below we explain it in one diagram, with an example of “Proof of Meow.” For more serious people, in the second section, we redraw this diagram to prove EVM instead of meow. Section 1: for those who love kitties Disclaimer: In this explanation, we use some mental models to provide intuition behind “how ZK-EVM works.” In fact, there are more details and nuances, check a series of articles by the PSE group on ZK-EVM to explore it in a more technical context. For those who are here for Proof of Meow – let’s start. ZK-VM stands for Zero-Knowledge V

Explore this link on the map →

related reading