ziskvm

EthCC[9] is made possible by the generous support of our sponsors. Thank you @ziskvm for supporting us this year as a SAPPHIRE sponsor! 💙❤️🩵

🚀 Take your project further with ZisK, a first-in-class prover. Feel free to reach out and launch!

📍Road to v1.0 v0.16 marks an important milestone as ZisK moves closer to its v1.0 release. From this point on, our focus shifts to: - Developer experience - Documentation - Code cleanup - Internal security audit

🚀 ZisK v0.16 is live! This release brings major performance improvements and new architectural capabilities as we move closer to ZisK v1.0. 🔗 Release notes: github.com/0xPolygonHerme… Highlights 👇

Real-time proving makes synchronous composability practical. With ZisK, rollups can interact within the same block — no async bridges, no waiting. This is how we move toward a truly composable multi-rollup Ethereum. youtu.be/1PRnm4qomKA?si…

Recent zkGas profiling benchmarks (1M gas, 4 GPUs) show very strong performance for ZisK. Across most EVM opcode categories, ZisK delivers the fastest proving times, often by a wide margin, especially on heavy workloads. Full results: zkgas-profiling.vercel.app/benchmark-resu… #zkVM #ZK #Ethereum

Meet the speaker @0xAbix 🎤 Ayush is currently a growth engineer at @ziskvm, and has previously worked in growth, strategy and developer relations at @0xPolygon.

This release also includes additional optimizations in MODEXP. The MODEXP circuit was refined to reduce constraint overhead and improve execution efficiency, contributing to stable proving times under the higher security target. Link to the release : github.com/0xPolygonHerme…

Besides the Keccak improvements, reaching the new security target required reengineering the recursion circuit: • Merkle tree arity changed from 3-to-1 to 4-to-1. Each internal node now hashes four children. • All recursive circuits were rewritten to support the new Merkle structure; functional behavior remains unchanged. • Grinding added at the protocol level to increase the cost of adversarial proof generation, without modifying prover or verifier interfaces. • Introduced last_level_verification: the prover provides all nodes at a selected Merkle level; the verifier checks the sibling path up to that level and verifies correct root reconstruction from that level upward. • The final circuit now uses a standard binary Merkle tree. This change applies only to the last layer and reduces overall proof size. The resulting proof size is approximately 240 KB.

ZisK v0.15.0 moves the system to 128-bit proven security without increasing proving time. This is enabled primarily by a new Keccak arithmetization. The Keccak optimization offsets the additional cost introduced by stronger recursion and verification constraints, allowing end-to-end proving performance to remain comparable to v0.14.0, while reducing the final proof size to ~240 KB. Link to the release: github.com/0xPolygonHerme…

📺 Ethproofs day Panel Discussion: Real-Time Proving moderated by @_sophiagold_ , Ethereum Foundation w/: @jbaylina w/ @ziskvm @portport255 w/ @zksync @tamirhemo w/ @SuccinctLabs @no89thkey w/ @brevis_zk @theyisun w/ @axiom_xyz youtu.be/8b3BMrlyA80