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

Looking forward to speak at the Science and Engineering of Consensus workshop on Sunday in Berkeley. I'll talk about recent work with @kartik1507 and @nibeshrestha2 on our "Pipes" model for analysing blockchain protocols. One of the advantages of the model is that it actually allows to compare max throughput for different protocols...

[UPDATE] We are collaborating with @AndrewLewisPye on a formal specification (and proofs of both liveness and safety) for Minimmit. 👀

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. ( Lower bound 2 (Good-case latency): For partially synchronous Byzantine broadcast with f Byzantine parties, 3 rounds are necessary and sufficient if 3f +1 <= n <= 5f-1 ( Upper bound: e.g., PBFT, Tendermint, Simplex tolerate f < n/3 faults and achieve 3-round good-case latency (link:

Research in blockchain has been held back because we don't have good ways to compare max throughputs for different protocols. Pleased to announce a new approach with Kartik Nayak (@kartik1507) and Nibesh Strestha (@nibeshrestha2). 1/