Ayyy some good news. Random Aztec memory: one of my favourite ever conference talks was at @zeroknowledgefm ZK10 in London. @Zac_Aztec bounced onto the stage, performed what i can only describe as a standup routine, shot t-shirts from a cannon, then announced a public devnet.

🎙️This past week, @AnnaRRose & @nico_mnbl spoke w Alex Ozdemir, Assistant Professor at Georgia Tech, about the formal verification/ZK connection — covering SMT solvers, Lean, zkPi and why verifiable software matters.

Flock exceeds the hashing throughput required for 3,500 Ethereum transactions per second. It can prove a Bitcoin block in under 2.5 seconds. @benediktbuenz runs the numbers on what Flock means for the post-quantum transition on @zeroknowledgefm.

🎙️This week, @AnnaRRose chats with @sergey_nog from @circle about @arc and its TEE-based Privacy Sector. They discuss why they chose TEEs, the tradeoffs between hardware trust and composability, his recent debate w @secparam and more!

zkMesh for June landed yesterday. zkMesh is our monthly human-curated newsletter covering the latest in advanced privacy-enhancing cryptography, distributed protocol development, and zero-knowledge systems research. cc: @__zkhack__

Flock does one thing: prove the same computation many times, like hashing. That focus may sound like a restraint, but it's what makes Flock the fastest SNARK prover ever built. And batch hashing covers most workloads that matter in practice. @benediktbuenz on @zeroknowledgefm:

🎙 @AnnaRRose & @kobigurk chat with @benediktbuenz, from @EspressoSys & @nyuniversity. They catch up on Espresso, his research on hash-based folding, DKGs for threshold signatures, and Flock, a fast batch-proof system built almost entirely with AI-written code.

🎙️ "ZK's vintage is ripe" @wyatt_benno of @icme_labs joins @AnnaRRose & @nico_mnbl to make the case. They cover ICME Preflight (ZK guardrails for agents), Jolt Atlas (verifiable ML inference), and what's next: lattices and isogenies for post-quantum succinctness.

How do you actually formally verify the code underpinning Ethereum's future? In this episode (the finale of the @leanEthereum miniseries), @nico_mnbl sits down with Alex Hicks (@alexanderlhicks), lead of Protocol Snarkification at the @ethereumfndn, to break down formal verification from first principles. They cover: – What formal verification actually is and the trust boundaries between proof assistants, SMT solvers, and kernels – The full verification stack for RISC-V ZKVMs: from SAIL specs to constraint extraction to soundness proofs – Why writing constraints directly in Lean makes proofs 10–100x more ergonomic – How AI is now proving hard theorems in hours for $200 — and what that unlocks for the whole pipeline They also explore the boundaries problem, why specs can have bugs too, and the end goal of a full Lean stack that bypasses Rust and LLVM entirely. Listen to the full episode ------------------------------------------------------------ TIMECODES: 09:16 – What is formal verification? Proof assistants vs SMT solvers 18:33 – Formal verification of code: specs, semantics, and trust boundaries 29:30 – Formally verifying the Lean Ethereum stack: RISC-V ZKVMs in focus 33:02 – Extracting ZKVM constraints into Lean and proving soundness 36:35 – Writing constraints directly in Lean: 10–100x better proof ergonomics 44:02 – Proving Polishchuk–Spielman in 8 hours for $200 with AI 51:01 – The end goal: a full Lean stack bypassing Rust and LLVM