iiinova — where your digital self keeps evolving

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 12/03/2025

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)

133

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 10/03/2025

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 👇

131

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 06/03/2025

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...

121

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 06/03/2025

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?...

youtu.be

Ais of TACEO @ ZK Hack Meetup in Denver, 24 Feb 2025

In this presentation recorded at ZK Hack Meetup in Denver on 2025, February 24th, Ais Connolly of TACEO talked about Private Shared State, how Collaborative ...

153

zkgaylord.bsky.social @zkgaylord.bsky.social · 05/03/2025

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

010

zkgaylord.bsky.social @zkgaylord.bsky.social · 04/03/2025

That was fun! (At least for the first 20h 😭)

010

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 03/03/2025

🎬 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)! 🧵👇

131

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 14/02/2025

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

buff.ly

ZK Mesh | Zero Knowledge Podcast | Substack

A monthly newsletter sharing the latest in decentralised privacy-preserving technologies, privacy protocol development and Zero Knowledge systems. Click to read ZK Mesh, a Substack publication with th...

011

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 14/02/2025

🔔 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 🧵👇

111

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 01/02/2025

𝗭𝗞 𝗠𝗲𝘀𝗵: 𝗝𝗮𝗻𝘂𝗮𝗿𝘆 𝟮𝟬𝟮𝟱 𝗥𝗲𝗰𝗮𝗽 It came out yesterday! Don't forget to subscribe to get it directly in your inbox every month.

open.substack.com

ZK Mesh: January 2025 Recap

Welcome to ZK Mesh, a monthly newsletter covering the latest in advanced privacy-enhancing cryptography, distributed protocol development, and zero-knowledge systems research.

021

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 31/01/2025

zkmesh.substack.com

ZK Mesh | Zero Knowledge Podcast | Substack

011

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 31/01/2025

🔔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 🧵👇

121

zkgaylord.bsky.social @zkgaylord.bsky.social · 31/01/2025

This is my favourite one from the whole series, what a pic, what a catchphrase <3

000

Reposted by @zkgaylord.bsky.social

Nico @nmohnblatt.me · 29/01/2025

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...

0117

Reposted by @zkgaylord.bsky.social

ePrint Updates @eprint.ing.bot · 27/01/2025

How to Prove False Statements: Practical Attacks on Fiat-Shamir (Dmitry Khovratovich, Ron D. Rothblum, Lev Soukhanov) ia.cr/2025/118

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.

03817

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 27/01/2025

The t̶i̶c̶k̶e̶r̶ 𝒑𝒓𝒐𝒑𝒆𝒓𝒕𝒚 is ̶E̶T̶H̶ ̶ 𝒁𝑲

122

Reposted by @zkgaylord.bsky.social

ZK Hack @zkhack.dev · 24/01/2025

🔔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 🧵👇

142