ATProto Browser

Record data

{
  "uri": "at://did:plc:fwa55bujvdrwlwlwgqmmxmuf/app.bsky.feed.post/3loc5rvf5xo2s",
  "cid": "bafyreih7q6rwcki6fdj4d2kihed6hqxjpsxxqv5anag6qnpxcgv6tyn5si",
  "value": {
    "text": "Improving the Round Complexity of MiniCast (Thomas Locher, Victor Shoup) ia.cr/2025/779",
    "$type": "app.bsky.feed.post",
    "embed": {
      "$type": "app.bsky.embed.images",
      "images": [
        {
          "alt": "Abstract. For very long messages, the reliable broadcast protocol with the best communication complexity to date is the Minicast protocol of Locher & Shoup [2024]. To reliably broadcast a message m to n parties, Minicast has communication complexity  ∼ 1.5|m|n, when |m| is large. However, the round complexity of Minicast is 4, which is worse than the 3 rounds of the classical protocol of Bracha. We give a new reliable broadcast protocol whose communication complexity is essentially the same as that of Minicast, but whose round complexity is just 3. Like Minicast, our new protocol does not rely on any cryptography other than hash functions. We also give a new 2-round protocol that relies on signatures. For large |m|, its communication complexity is also  ∼ 1.5|m|n, unless the sender provably misbehaves, in which case its communication complexity may degrade to at most  ∼ 2|m|n.\n",
          "image": {
            "$type": "blob",
            "ref": {
              "$link": "bafkreiayz6h4vio6mwdurzh4kv46vxeqq6widq4kwhfv6lv7372l7wlra4"
            },
            "mimeType": "image/png",
            "size": 87301
          },
          "aspectRatio": {
            "width": 1200,
            "height": 800
          }
        }
      ]
    },
    "facets": [
      {
        "index": {
          "byteEnd": 87,
          "byteStart": 73
        },
        "features": [
          {
            "uri": "https://ia.cr/2025/779",
            "$type": "app.bsky.richtext.facet#link"
          }
        ]
      }
    ],
    "createdAt": "2025-05-03T20:15:59.311575Z"
  }
}