🔥The 9th Round of Easy Loan, Earn $40 Reward is in progress❗️ ⏰ Promotion Period: January 15th - Feburary 15th, 2025 👉 Register now and check more details at gate.io/campaigns/358

A few weeks ago, zkStudy Club hosted William Wang presenting ARC: Accumulation for Reed-Solomon Codes Video is below 👇 do subscribe to see more videos like this!

Join us tomorrow for a dive into zero knowledge proving systems based on vector oblivious linear evaluation (VOLE), presented by Xiao Wang ! VOLE-based ZK systems offer impressive prover performance and low memory overhead, making them an interesting candidate for client

Zinc: arguments for integer/rational arithmetic. Presented at zkProof 7 in Sofia. The conference was a blast! youtu.be/6BYQUist2vE

eprint.iacr.org/2025/620.pdf Exciting paper by Benedikt Bünz ☕️ and his NYU colleagues that achieves 801× faster Hyperplonk proof generation over CPUs.

Recently summarized how NeutronNova improves on prior work—thought it’d be useful to share it. Whether you're working on recursive proofs, zkVMs, or just want a modern folding scheme—NeutronNova is worth watching. It achieves the best of prior work—without their downsides.🧵👇

1/9 Happy to open-source joint work with guille— CryptoUtilities.jl, a set of Julia packages that brings fast and easy support for binary extension fields, Merkle trees, Reed-Solomon codes over binary extensions, and many more.

Thrilled to share our IEEE S&P '25 work "Myco 🌳🍄: Unlocking Polylogarithmic Accesses in Metadata-Private Messaging" with Deevashwer, Bhargav Annem | In Tokyo 🇯🇵, Raluca Ada Popa. We break a decade-old asymptotic barrier in cryptographic metadata-private messaging. eprint.iacr.org/2025/687👇

#award The 2025 IACR Test-of-Time Award for Eurocrypt goes to: "On Ideal Lattices and Learning with Errors over Rings", by V. Lyubashevsky, C. Peikert & O. Regev. More info at: iacr.org/testoftime Congratulations!

🪄✨ And for our next trick, choose a code, any code! Introducing WARP 🌀, the first linear-time accumulation scheme. Brought to you by Benedikt Bünz ☕️, Alessandro Chiesa, William and myself. 📚: ia.cr/2025/753 🧑‍💻: (soon)

WARP feels like the natural conclusion to the hash-based accumulation schemes I've been working on since the start of my PhD, so I'm really happy to have it out! Let me quickly highlight our new straightline extraction technique which uses erasure (not error) correction.

Catch Jessica Chen's talk from last month's zkSummit! Her work introduces a 3-round sumcheck protocol that achieves almost linear runtime without additional commitment costs. youtube.com/watch?v=_G-B0w…

So, if you are at SBC in August (sbc-conference.com/2025/), come hear about it from Trisha Datta's and Kamilla Nazirkhanova's talk!

My latest paper on optimizing the sum-check protocol is out! eprint.iacr.org/2025/1117 Joint work with Justin Thaler and Ingonyama (Suyash & Yuval). This combines and extends results from two prior papers, leading to 2-3x speedups in Spartan within Jolt! Quick thread...🧵 1/

ECC saved the security of the Internet, and where we moved from the DH method with discrete logs to an EC version. Satoshi Nakamoto selected ECDSA for Bitcoin. This event celebrates the 40th birthday of ECC: eccworkshop.org/2025/index.html

New work with the wonderful Noga and Noor continuing the line of work on efficient proofs for Boolean circuits. We reduce the round complexity from log all the way down to logstar, and also simplify our prior work [RR22] along the way. eprint.iacr.org/2025/1269

We updated our paper on Fiat-Shamir! We now take a closer look at the gap between what symmetric cryptography has focused on for over 10 years (indifferentiability) and what is actually needed for the soundness of ZKPs and SNARKs (something stronger!). eprint.iacr.org/2025/536