Big thanks to @ingonyamazk.bsky.social & zkVerify for coming as partners of our ZK Hack Meetup in Sofia!
If you're in town for @zkproof.org or @rwc.iacr.org , join us to mingle with other zk-enthusiasts & listen to (en)lightning talks on March 26 from 5PM!
(for registration link, check out below)
Couldn't make it to Denver & sad you missed our talks?
One last time, we got you!
Talk #4
Designing [Project Untitled]: A Cost-efficient, Scalable, Decentralized State Management Solution for Web3
with Brandon Kase & Austin Baggio of @o1labs.bsky.social
👇 link in next tweet 👇
Earlier this week on our Discord (link in bio), we hosted the first session of the latest Study Group cohort dedicated to "FRI and Proximity Proofs".
Based on the ZK Whiteboard Sessions modules by @danboneh.bsky.social, we covered background on linear / MDS / Reed-Solomon codes...
Couldn't make it to Denver & sad you missed our talks?
We got you!
Talk #3:
"coSNARKs and Private Shared State"
with @aisconnolly.bsky.social of @taceo.bsky.social
Link to the recording:
youtu.be/9jdQ2uk2WWg?...
what a title 😆
The event was reeally nice, great vibe (ok I'm biaised but still)
This is talk 1 of 4, 2nd one coming out today, 3rd one tomorrow, 4th one Friday – check it out
That was fun!
(At least for the first 20h 😭)
🎬 ZKWS S2: The Full Journey 🎬
How did the second season of ZK Whiteboard Sessions come to life – a thread.
TLDR: Check out the 8-module series on YouTube (link in bio), and the "FRI edition" Study Group starting on Tuesday March 4 on ZK Hack Discord (link in bio)!
🧵👇
Hope you liked this week’s #ZKMeshMini!
Subscribe to our newsletter for the full #ZKMesh capturing all the research, articles, announcements, and more from this month and the last ones – and keep track of the many developments happening in the zk-space!
buff.ly/42Tbf4o
🔔 Time for #ZKMeshMini, join us to unpack the top developments from this past week in the zk-space.
Featuring SuccinctLabs' testnet, Brevis' zkVM Pico, PSE's Summa lookback, Sophon & WebProofs, Zac Williamson of Aztec & @ethereum.org
#BigWeek
🧵👇
America big
😆 imo Anna speaks faster IRL so you’re good — although you might wanna notch it down to 1.5x or 1.25x to be on the safe side 😂
𝗭𝗞 𝗠𝗲𝘀𝗵: 𝗝𝗮𝗻𝘂𝗮𝗿𝘆 𝟮𝟬𝟮𝟱 𝗥𝗲𝗰𝗮𝗽
It came out yesterday!
Don't forget to subscribe to get it directly in your inbox every month.
Hope you liked this week’s #ZKMeshMini!
Subscribe to our newsletter for the full #ZKMesh capturing all the research, articles, announcements, and more from this month and the last ones – and keep track of the many developments happening in the zk-space!
zkmesh.substack.com
🔔Time for #ZKMeshMini, let’s unpack the top zk-developments from this week – and it was a big week!
Featuring Ron Rothblum, Lev Soukhanov, Dmitry Khovratovich #FiatShamir #Attack Benedikt Bünz #DA Alireza Shirzad #DewTwo EthResearch, Kakarot #zkPIG Zellic #ZKHackV
🧵👇
This is my favourite one from the whole series, what a pic, what a catchphrase <3
and it’s only Wednesday!
These two lectures by @danboneh.bsky.social for @zkhack.bsky.social are the best explanation of IOPPs, FRI and its variants by a country mile. Cannot recommend them enough
zkhack.dev/whiteboard/s...
zkhack.dev/whiteboard/s...
Abstract. The Fiat-Shamir (FS) transform is a prolific and powerful technique for compiling public-coin interactive protocols into non-interactive ones. Roughly speaking, the idea is to replace the random coins of the verifier with the evaluations of a complex hash function. The FS transform is known to be sound in the random oracle model (i.e., when the hash function is modeled as a totally random function). However, when instantiating the random oracle using a concrete hash function, there are examples of protocols in which the transformation is not sound. So far all of these examples have been contrived protocols that were specifically designed to fail. In this work we show such an attack for a standard and popular interactive succinct argument, based on the GKR protocol, for verifying the correctness of a non-determinstic bounded-depth computation. For every choice of FS hash function, we show that a corresponding instantiation of this protocol, which was been widely studied in the literature and used also in practice, is not (adaptively) sound when compiled with the FS transform. Specifically, we construct an explicit circuit for which we can generate an accepting proof for a false statement. We further extend our attack and show that for every circuit C and desired output y, we can construct a functionally equivalent circuit C^(*), for which we can produce an accepting proof that C^(*) outputs y (regardless of whether or not this statement is true). This demonstrates that any security guarantee (if such exists) would have to depend on the specific implementation of the circuit C, rather than just its functionality. Lastly, we also demonstrate versions of the attack that violate non-adaptive soundness of the protocol – that is, we generate an attacking circuit that is independent of the underlying cryptographic objects. However, these versions are either less practical (as the attacking circuit has very large depth) or make some additional (reasonable) assumptions on the underlying cryptographic primitives.
Image showing part 2 of abstract.
How to Prove False Statements: Practical Attacks on Fiat-Shamir (Dmitry Khovratovich, Ron D. Rothblum, Lev Soukhanov) ia.cr/2025/118
The t̶i̶c̶k̶e̶r̶ 𝒑𝒓𝒐𝒑𝒆𝒓𝒕𝒚 is ̶E̶T̶H̶ ̶ 𝒁𝑲
🔔For the first time on 🦋 let’s unpack the top zk-developments from this week in #ZKMeshMini!
Featuring #ZKWhiteboardSessions @danboneh.bsky.social #Stanford #FRI #JustinThaler #SrinathSetty #Twist #Shout #powdr #AutoAccCircuits #Bagel #ZKLoRA #FabricCrypto #Skyscraper
🧵👇
