🚀 Excited to share our position paper: "Formal Mathematical Reasoning: A New Frontier in AI"! 🔗 arxiv.org/abs/2412.16075 LLMs like o1 & o3 have tackled hard math problems by scaling test-time compute. What's next for AI4Math? We advocate for formal mathematical reasoning,

Must-watch 38C3 CCC Events talk on low entropy vulnerabilities Props to Milk Sad team (John Naulty, Christian Reitter & team) for their groundbreaking research 🔍 Proud our Trust Wallet research w/ outoflegend SECBIT got featured 🎥: media.ccc.de/v/38c3-dude-wh…

🚀 f(x) v2.0 is LIVE! After extensive development and testing, we're revolutionizing leverage trading and yield generation in DeFi. ​ fx.aladdin.club ​ Here's why you shouldn't look anywhere else for yield on stables or leverage trading from now on: ​ Fixed, Zero-Stress

Just a week ahead! Let's meet up in Guangzhou to talk about ZK and Ethereum in the New Year🫡

see u in Guangzhou

🚀Big news! Irreducible launches alpha-ready Binius library and its first application, an Ethereum state proving service. Here’s what it means: 🧵

✨ BIG NEWS! We’re thrilled to announce our rebranding: Antalpha Labs is now #Coset! 🚀 🤔 Curious about the story behind the rebrand? Check out the details here👉mirror.xyz/antalpha-labs.… TL;DR Let’s dive in! 🧵👇

🚨Quantum computers pose a threat to cryptocurrencies. How do we transition into a post-quantum era? For Bitcoin, solutions exist. For Ethereum? Not yet—until now. poqeth: Efficient, post-quantum signature verification on Ethereum 🔗eprint.iacr.org/2025/091.pdf 🧵1/12

📢 ZKVM Hacker House in Suzhou is on the way! In April, we’re hosting a ZK Hacker House in Suzhou, China with SECBIT , focusing on ZK technology and applications. 🛠️ We’re still looking for co-hosts, so if you’re passionate about ZK, feel free to DM me for details! 💡

Excited to share our new work, DewTwo! DewTwo is the smallest known transparent pcs (with a 4.5 KB eval proof) built solely from falsifiable assumptions in groups of unknown order. A joint work with Benedikt Bünz ☕️, Tushar, and Sriram. Link: eprint.iacr.org/2025/129.pdf

The Accidental Computer with guille on prover acceleration via DA encodings In short, proofs-of-encoding (such as ZODA) perform much of the work of a code-based PCS, making it cheap to “embed” verifiable computations over data posted to a DA layer

Our team's ongoing work on the Halo2 extractor is making great progress toward the formal verification of a zkEVM's Keccak-256 circuit. This effort is crucial for ensuring the cryptographic integrity and security of the system, reinforcing its correctness.

Wrote a barebone FRI implementation a while ago, mostly for my own understanding, but hopefully also could be helpful to others! github.com/eerkaijun/fri-…

In addition to this post, I curated this repo : github.com/surfer05/zk-no… 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

Uploaded a revision of the note on adding zk to STARK, eprint.iacr.org/2024/1037. Should be much more readable now, hopefully, and it adds a short discussion on perfect zero-knowledge in permutation arguments.

Introducing Zinc 🪨: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers (eprint.iacr.org/2025/316)

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: ia.cr/2025/329 The FS transformation is used to convert public-coin interactive protocols to non-interactive ones.

Amazing new work by Gal Arnon and Eylon Yogev on how to securely instantiate the Fiat-Shamir transformation and avoid the recent brilliant diagonalization attack of Ron Rothblum, 🏴 levochka.eth 🏴 💙💛🇮🇱☀️🦁🗡️ and Dmitry Khovratovich!

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 Harsha , Kumar, Saptharishi, and Shankar. A fascinating read. arxiv.org/pdf/2502.14358…

In a new blog post at decentralizedthoughts.github.io/2025-02-14-ver…, 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.