🔥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

Never thought my work would be covered by Lean’s official account!

🚨 New tool & paper! 🚨 We’re excited to introduce Veil, a framework for verifying distributed & concurrent systems both automatically and interactively — all inside the Lean proof assistant. 🧵

🪄✨ And for our next trick, choose a code, any code! Introducing WARP 🌀, the first linear-time accumulation scheme. Brought to you by Benedikt Bünz ☕️, Alessandro Chiesa, William and myself. 📚: ia.cr/2025/753 🧑‍💻: (soon)

If you are smart, competent, a fast learner and willing to really throw yourself into something, you can answer a question to which our civilization does not have an answer with weeks to months of work. You can become an expert in months to years.

0. Announcing the Trillion Dollar Security (1TS) initiative: an ecosystem-wide effort to upgrade Ethereum’s security to help bring the world onchain.

Real-Time Ethereum Proving is here. INTRODUCING: SP1 Hypercube

Last month, moodle zoup gave a great explanation for Twist and Shout, the new memory-checking arguments co-authered by Srinath Setty and Justin Thaler, and there usage in Jolt. youtube.com/watch?v=nEEFjy…

Jolt is getting faster and the underlying techniques we’ve been advocating for — sumcheck, GKR, lookups — are becoming more popular. It’s not a coincidence.

🔥 When can a network prove an object is where it says it is, even if it lies? We nail down the answer in our new paper on DePIN with Jens Ernstberger Joseph Bonneau Scott Kominers Tim Roughgarden. More below. 1/n 👇

Today, we’re introducing the Terminal. Pay anyone and any project on Github.

An attack on a fundamental proof technique reveals a glaring security issue for blockchains and other digital encryption schemes. Erica Klarreich reports: quantamagazine.org/computer-scien…

New work with the wonderful Noga and Noor continuing the line of work on efficient proofs for Boolean circuits. We reduce the round complexity from log all the way down to logstar, and also simplify our prior work [RR22] along the way. eprint.iacr.org/2025/1269

[New] Gdel in Cryptography: Effectively Zero-Knowledge Proofs for NP with No Interaction, No Setup, and Perfect Soundness (Rahul Ilango) ia.cr/2025/1296

1/N I’m excited to share that our latest OpenAI experimental reasoning LLM has achieved a longstanding grand challenge in AI: gold medal-level performance on the world’s most prestigious math competition—the International Math Olympiad (IMO).