A short blogpost explaining our result on the optimality of optimistic responsiveness: decentralizedthoughts.github.io/2020-06-12-opt… with Nibesh, Ittai Abraham, Ling

Looking forward to speak at the Science and Engineering of Consensus workshop on Sunday in Berkeley. I'll talk about recent work with Kartik Nayak and Nibesh Shrestha on our "Pipes" model for analysing blockchain protocols. One of the advantages of the model is that it actually

Announcing the Financial Cryptography 2026 call for papers. Paper deadline is Sep 16 (not a ton of time!) w/ Co-chair Stefanie Roos (RPTU) fc26.ifca.ai/cfp.html

Excited to present our new work on Data Availability Sampling (DAS) with repair tomorrow at SBC! #sbc25 With Joachim Neu , Dan Boneh & Valeria Nikolaenko. We tackle a key open problem: how to repair missing data chunks in DAS. 1/5

If you missed any of the sessions, or are interested in learning more - you can play back the livestream - youtube.com/watch?v=_2gnJj…

There are only 14 hours left to submit your best research work on Distributed Computing or Networking to ICDCN 2026, that will take place in Nara, Japan in January. sites.google.com/view/icdcn2026/

In fact you can get the optimal 5f-1 (or more generally 3f+2p-1) decentralizedthoughts.github.io/2025-08-06-5fm…

Follow up work accepted to DISC: multi-valued asynchronous byzantine agreement with perfect security and optimal resilience given binary ABA in O(nL+n^2 log n)

What are some of the conceptual contributions made in the DAG consensus line of work? Read our post on Decentralized Thoughts: decentralizedthoughts.github.io/2025-08-08-DAG…

Excited to share our latest work “Optimistic, Signature-Free Reliable Broadcast and Its Applications”, accepted to ACM CCS 2025! Reliable Broadcast (RBC) is a key building block for BFT protocols. We present the first signature-free RBC that: ✅ Tolerates up to f < n/3 Byzantine

PBFT is to *Paxos* as Dolev–Strong is to *non-uniform broadcast with omission failures* with Gilad Stern decentralizedthoughts.github.io/2025-08-12-non…

1/ Jolt just got a 6× speedup. We now prove over 1,000,000 RISC-V cycles/sec on a 32-core CPU and over 500,000 cycles/sec on a MacBook, with proofs of about 50 KB. Here’s what’s new 🧵

A preliminary draft of “Minimmit: Fast Finality with Even Faster Blocks” is now available on arXiv! TL;DR trading the “slow path fallback” for a ~19.7% reduction in transaction confirmation latency 🏎️

What does list decoding have to do with asynchronous byzantine agreement?