🛠️ Developer Tools
Noir's BB Prover Delivers 29ms Proofs—But Can It Conquer EVM Gas Wars?
You've compiled your Noir circuit. Now prove it cryptographically and slam it on Ethereum. But at what gas cost? This tutorial reveals the numbers.
Open Source Beat
Apr 07, 2026
3 min read
⚡ Key Takeaways
-
Barretenberg proves Noir circuits in 29ms for simple checks, generating tiny 7.5KB proofs.
𝕏
-
EVM-targeted verifiers use precompiles for ~200k gas on L2s—deploy once, verify forever.
𝕏
-
VK reuse across proofs makes Noir scalable for production ZK apps, but watch memory on big circuits.
𝕏
The 60-Second TL;DR
- Barretenberg proves Noir circuits in 29ms for simple checks, generating tiny 7.5KB proofs.
- EVM-targeted verifiers use precompiles for ~200k gas on L2s—deploy once, verify forever.
- VK reuse across proofs makes Noir scalable for production ZK apps, but watch memory on big circuits.
Published by
Open Source Beat
Community-driven. Code-first.
Worth sharing?
Get the best Open Source stories of the week in your inbox — no noise, no spam.