Sitting on the shoulders of giants, I am glad to announce the following paper with Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, and Shubhangi Saraf: https://t.co/nFRLncl14t On the one hand, we improve the existing decoder analysis from Ben-Sasson, Carmon, Ishai, Kopparty and

@Arvolear correction: it's 3% larger 𝘢𝘵 𝘣𝘦𝘴𝘵, not at worst. it could be up to 2x larger.

I recently went through the exercise of applying logup* (Soukhanov) to implement Twist and Shout (Setty & Thaler). As a result, we can have memory checking arguments with very cheap commitment costs using hash-based commitment schemes! ↓

An exciting update from myself and @benediamond ( https://t.co/bKwowXYcMB). We show that the 𝘶𝘱-𝘵𝘰-𝘤𝘢𝘱𝘢𝘤𝘪𝘵𝘺 proximity gaps conjecture is 𝗳𝗮𝗹𝘀𝗲. More precisely, given any pair c, d we construct codes whose error grows faster than nᶜ / (q ⋅ (ρ η)ᵈ).

People talk about the need for standards in snarks. My (biased as an author) opinion is the thing to standardzie is plonk as in the paper. It has been through more scrutiny than any other construction, with several papers, from three separate research groups, proving the

🔥 Ethereum on Tour is landing at Shanghai Jiao Tong University & East China Normal University! 🇨🇳 Don't miss this chance to explore the future of cryptography and blockchain with top academic minds! 🧠 🎙️ Featuring: · EF Co-Executive Director Tomasz @tkstanczak with

📢【Ethereum on Tour：以太坊基金会高校行】将走进上海交大和华东师大！ 🔥不要错过与顶尖学者们一起探索密码学和区块链未来的机会！ 🎙️活动亮点： · 以太坊基金会联合执行董事 Tomasz @tkstanczak独家分享以太坊最前沿研究。 · 来自上海交大和华东师大的教授学者们，将分享

Excited to share https://t.co/PhHBgrv7Eo, which rethinks the usage of folding in succinct proof systems. We provide a new framework to build folding-based SNARKs, by eliminating the need to prove Fiat-Shamir inside circuits and by introducing a high-arity lattice folding scheme

Excited to share our new paper: https://t.co/EIsfIsZAW4! We made Groth16 dynamic - proofs can now be efficiently updated when the witness changes slightly. Amazing that after 10 years, we still have new insights of Groth16 and Pinocchio. Joint work with two brilliant new students

There's an elegantly simple way to embed base-field inner products into an degree d extension field with no memory overhead and only O(d) computation overhead. I finally did a proper write-up. Very keen to try this for M31 in WHIR. Link in reply.

Lattice and FHE broken? In 2024, Yilei Chen claimed that lattice-based cryptography was broken. https://t.co/YsdyFOCLV2 However, there was a bug in the attack, and the claim did not hold. This new paper by Yifan Zhang claims to fix that error. https://t.co/PpncwzUlVq Let's

Actually never took notice of Lev Soukhanov's logup* construction. Such a beautiful idea, to keep looked-up columns entirely virtual, and prove their value at the random point by duality, translating the lookup consistency to the Lagrange function (the eq).

In a new blog post at https://t.co/QHsycKqYLm, we present a method for verifying multi-exponentiations and multi-scalar multiplications (MSMs) to facilitate outsourcing these computations. This allows the prover to perform the computation typically done by the verifier.

I've enjoyed this excellent exposition of the recent progress in the combinatorial list-size bounds of Folded Reed Solomon codes and multiplicity codes by Garg, @prahladh , Kumar, Saptharishi, and Shankar. A fascinating read. https://t.co/LxCaOjCtEF

Delighted to share my new paper with Eylon Yogev presenting a new Fiat-Shamir (FS) transformation that aims to be secure against recent white-box attacks: https://t.co/yoa6z1lnqw The FS transformation is used to convert public-coin interactive protocols to non-interactive ones.

Amazing new work by @GalArnon42 and Eylon Yogev on how to securely instantiate the Fiat-Shamir transformation and avoid the recent brilliant diagonalization attack of @ronrothblum, @levs57 and @Khovr!

Introducing Zinc 🪨: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers ( https://t.co/ucd8t9Vgpg)

Uploaded a revision of the note on adding zk to STARK, https://t.co/Uf3ZPnhBok. Should be much more readable now, hopefully, and it adds a short discussion on perfect zero-knowledge in permutation arguments.

In addition to this post, I curated this repo : https://t.co/azB3J6xeHm I've added a new folder named papers! It contains PDFs where I've jotted down my own understanding and explanations while reading key research papers. I hope it can be helpful in fostering more collaborative

Wrote a barebone FRI implementation a while ago, mostly for my own understanding, but hopefully also could be helpful to others! https://t.co/qtkYs7twvx