🔥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

Say hello to STIR 🥣! STIR is an IOPP for RS which, compared to FRI, has shorter arguments (~2x) and a faster verifier (~1.2x) that performs fewer hashes (~2x). Joint work with Gal Arnon, Alessandro Chiesa and Eylon Yogev. ia.cr/2024/390 - gfenzi.io/papers/stir

Blendy🍹 is out! We present a new concretely efficient algorithm for multilinear sumcheck proving which uses linear time and sublinear memory. Joint work with Alessandro Chiesa, Elisabetta Fedele and Andrew Zitek-Estrada ia.cr/2024/524 - gfenzi.io/papers/blendy-…

The recording of the talk me and Gal Arnon gave at #zksummit11 is now out! youtu.be/OLklJjp8KB4 (slides at gfenzi.io/presentations/…) The "bi-annual zk church" does not disappoint and is great for followups 🏎️ (4th pic) Thanks Zero Knowledge Podcast for an amazing organisation!

The 3rd talk on the mainstage at zk11 was about STIR w @giacomoFenzi and Gal Arnon youtu.be/OLklJjp8KB4?fe…

This week @annarrose & Kobi Gurkan chat with Gal Arnon from Weizmann Institute & Giacomo Fenzi from EPFL. They discuss how their research led them to work on their latest paper ‘STIR: Reed–Solomon Proximity Testing with Fewer Queries’. They talk about the history of FRI and the

We did a podcast on STIR 🥣! Listen for: anatomy of STARKs, strong opinions on what STARK should mean, history of FRI, overview of STIR, and where you should use STIR over FRI (spoiler: ~always)! Thanks Anna Rose and Kobi Gurkan for having us, it was a lot of fun!

There's some serious cooking ongoing in #ProjectIdeasTeams channel on ZK Hack Discord! Go & the STIR paper by Gal Arnon Alessandro Chiesa Giacomo Fenzi and Eylon Yogev are on the menu... 𝒁𝑲 𝑯𝒂𝒄𝒌 𝑲𝒓𝒂𝒌𝒐́𝒘 is gonna be lit... Don't miss it! #ZkHackKrakow

Get ready for #ZKProof 2024! Eylon Yogev from Bar-Ilan University will talk about STIR: Reed-Solomon Proximity Testing with Fewer Queries. Join us in Berlin on May 22-24 to discuss the future of ZKP standardization, its impact on security, identity, & more.

🎙️This week @annarrose and Nico | ge⬡metry research catch up with Alessandro Chiesa and Eylon Yogev to discuss their recent publication Building Cryptographic Proofs from Hash Functions listen in full here 👇 zeroknowledge.fm/329-2/

We (Gal Arnon, Ale, Eylon, and I) are delighted to share that that STIR 🥣 won Best Paper at CRYPTO 2024! In the immortal words of one of the co-authors: "This is amazing!"

WHIR 🌪️: a IOP of proximity and multilinear polynomial commitment scheme with exceptionally fast verification time. Joint work with Gal Arnon, Alessandro Chiesa and Eylon Yogev. 📚: ia.cr/2024/1586 📄: gfenzi.io/papers/whir 🧑🏻‍💻: github.com/WizardOfMenlo/…

Blazing SNARKs! Cool new work by Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron Rothblum, and Hadas Zeilberger. Hadas Zeilberger Ron Rothblum Binyi Chen eprint.iacr.org/2024/1609

Zero Knowledge Podcast Srinath Setty Abhiram Kothapalli RISC Zero 🟡 Gal Arnon Giacomo Fenzi Geometry Research Mina Protocol (httpz) 🪶 Celestia vlayer ⛛ Misha Komarov Gal Arnon, Giacomo Fenzi, Alessandro Chiesa and Eylon Yogev published a paper on WHIR, a commitment scheme combining Basefold and STIR to yield an efficient multilinearPCS with the best of both constructions. Tweet: x.com/GiacomoFenzi/s… Paper: eprint.iacr.org/2024/1586

Modulus Labs Join us for two joint seminars with Nexus featuring Giacomo Fenzi from EPFL on: STIR: Reed–Solomon Proximity Testing with Fewer Queries. Oct 16. WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification. Nov 8.