Hash-based SNARKs are fast, PQ secure, and transparent.
But they have a major flaw: they historically lack ZK properties without massive overhead.
Enter ZO0k: a true minimal overhead ZK IOP framework presented by the local Italian star @GiacomoFenzi at ZK Summit. 🧵👇
We present Tensorswitch🧮:
a new nearly optimal hash-based polynomial commitment scheme from tensor codes!
Joint work with @benediktbuenz, @ronrothblum and @kleptographic!
📚: 2025/2065
Arkworks 0.6.0 is out 🎉
The headline isn't BabyBear, KoalaBear, Mersenne31, Goldilocks.
It's `SmallFp` — a macro for any prime up to 64 bits that picks the optimal layout + arithmetic at compile time.
Drop-in. Non-breaking. Up to 30% speedup.
READ:
See you in Rome for the Jubilee of proof systems 🇮🇹 🇻🇦:
zkSummit (cc @zeroknowledgefm) on May 7th
IOPFest on May 9th (don't forget to register
ZKProof on May 9th-10th (see below)
And dulcis in fundo, @IACReurocrypt 10-14th!
(+ Lazio-Inter 13th of May)
🔥🔥🔥 Get ready for #ZKProof# 2026!
Speaker: Giacomo Fenzi @GiacomoFenzi from @EPFL
Join us in Rome, May 9-10 to discuss the latest in ZKPs and applications, the Quantum threat, formal verification in ArkLib, IOPs & more.
For more details - link in the first comment.
🔥🔥🔥 Get ready for #ZKProof# 2026!
Speaker: Anubhav Baweja from University of Pennsylvania
Join us in Rome, May 9-10 to discuss the latest in ZKPs and applications, the Quantum threat, formal verification in ArkLib, IOPs & more.
For more details - link in the first comment.
🔥🔥🔥 Get ready for #ZKProof# 2026!
Speaker: Ziyi Guan @ziyiguan99 from @EPFL
Join us in Rome, May 9-10 to discuss the latest in ZKPs and applications, the Quantum threat, formal verification in ArkLib, IOPs & more.
For more details - link in the first comment.
🔥🔥🔥 Get ready for #ZKProof# 2026!
Speaker: William Wang @kleptographic from @nyuniversity
Join us in Rome, May 9-10 to discuss the latest in ZKPs and applications, the Quantum threat, formal verification in ArkLib, IOPs & more.
For more details - link in the first comment.
We have an update on the proximity prize: a 1m$ initiative to prove or disprove coding theoretic conjectures, with applications to shorter quantum-secure proof systems.
We have released the first draft:
cc @GalArnon42 and @danboneh
We present Tensorswitch🧮:
a new nearly optimal hash-based polynomial commitment scheme from tensor codes!
Joint work with @benediktbuenz, @ronrothblum and @kleptographic!
📚: 2025/2065