{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreihn7fr7uowdl26ujgifqd2dznwrjwwdov5vfdcxgz3l7gb47qqzzi",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mk5ngnspkjc2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreidmzck7dmzio7pvdgpqykuxo6fygnnualdujmmzt5mpfwa2cygzbi"
    },
    "mimeType": "image/png",
    "size": 127891
  },
  "path": "/2026-04-23-latency-of-censorship-resistance/",
  "publishedAt": "2026-04-23T06:00:00.000Z",
  "site": "https://decentralizedthoughts.github.io",
  "textContent": "This post covers our new lower bound on the latency cost of censorship resistance. In a traditional BFT protocol, the leader has two roles: (1) It constructs (and therefore holds) the input; and (2) It proposes the input. Many BFT protocols optimize for the good case when the leader is honest. For partial synchrony, with $n \\leq 5f-2$ parties, the good-case latency is 3 rounds. The leader’s monopoly over both...\n\nBy Ittai Abraham, Yuval Efron, and Ling Ren",
  "title": "Latency cost of censorship resistance"
}