A thread summarizing research on the good-case latency and resilience of partial synchrony protocols. Lower bound 1 (DLS): It is impossible to solve agreement under partial synchrony against a Byzantine adversary if f >= n/3. (decentralizedthoughts.github.io/2019-06-25-on-…) Lower bound 2 (Good-case

Fast finality for reliable broadcast,  asynchronous verifiable secret sharing (AVSS), asynchronous verifiable information dispersal (AVID), and blockchains while maintaining optimal fault tolerance of 33%! paper: arxiv.org/abs/2505.02761 Now, all these primitives can be

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

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

What connects MPC, blockchain scalability, and post-quantum security? Find out at ACM CCS 2025, starting tomorrow in Taiwan, where we’re presenting two awesome projects! Tomorrow Akhil Bandarupalli will present Velox, PQ-secure MPC that is ready for real-world use. (paper:

Excited that our paper Optimistic, Signature-Free Reliable Broadcast and Its Applications received a distinguished paper award at ACM CCS 2025. with Nibesh Shrestha, Qianyu Yu, Giuliano Losa, Aniket Kate, Xuechao Wang

ZK lets you prove something without revealing anything… But today we're revealing our gratitude. Aniket Kate, Gregory Zaverucha & Ian Goldberg won the IACR Test-of-Time Award. Thank you for building the foundation of ZK in 2010. #ZKProofs