Thursday, October 16th, 2025 at CCS 2025, Taipei, Taiwan: Optimistic, Signature-Free Reliable Broadcast and Its Applications. Paper
Friday, October 3rd, 2025 at SDF, internal engineering talk: Blockchain consensus from DLS 1988 to 2025. Slides
Wednesday, April 16th, 2025 at FC 2025, Miyakojima, Japan: Constellation: Peer-to-Peer Overlays for Federated Byzantine Agreement Systems, joint talk with Yifan Mao. Slides and paper
September 10th 2024 at the TLA+ Community Event, Milan, Italy: Verifying the Liveness of Eventually-Synchronous BFT Consensus Protocols. Slides and specifications.
June 20st 2024 at PODC 2024, Nantes, France: Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model. Slides and paper
June 19th 2024 at PODC 2024, Nantes, France: Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols. Slides and paper
Tuesday October 10, 2023at DISC 2023, L’aquila, Italy: “Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority”. Slides and paper
Monday, October 2nd, 2023 at SSS 2023, Jersey City, NY, USA: Time Is Not a Healer, but It Sure Makes Hindsight 20:20. Slides and paper.
Friday, August 31st, 2023 at the workshop on dynamically available consensus (part of SBC 2023): “Consensus under dynamic participation with a minority of failures”. Slides
April 25, 2023, Stanford Blockchain Seminar: “Revisiting the Federated Byzantine Agreement Model”. Recording and slides
March 15, 2023, Dagstuhl seminar “Unifying Formal Methods for Trustworthy Distributed Systems”: A Simple Proof of the FLP impossibility results
December 7th, 2022, Dagstuhl seminar “Formal Methods and Distributed Computing: Stronger Together”: Formal Verification of a Classic Distributed Algorithm Using Inductive Invariants. Slides and proofs
