{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JJD6AEEY5ZGUBNUNVISFZBL7IZ","short_pith_number":"pith:JJD6AEEY","schema_version":"1.0","canonical_sha256":"4a47e01098ee4d40b68daa245c857f467ec556d9abb7a87619e51871174b3dda","source":{"kind":"arxiv","id":"2208.09262","version":2},"attestation_state":"computed","paper":{"title":"Byzantine Consensus is \\Theta(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version]","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jovan Komatovic, Manuel Vidigueira, Muhammad Ayaz Dzulfikar, Pierre Civit, Rachid Guerraoui, Seth Gilbert, Vincent Gramoli","submitted_at":"2022-08-19T10:56:26Z","abstract_excerpt":"The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether a consensus protocol with quadratic communication complexity can be obtained in partial synchrony. Until now, the most efficient known solutions for Byzantine consensus in partially synchronous settings had cubic communication complexity (e.g., HotStuff, binary DBFT).\n  This paper closes the existing gap by introducing SQuad, a partially sync"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2208.09262","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-08-19T10:56:26Z","cross_cats_sorted":[],"title_canon_sha256":"a3417af8f9b3247c8af12470e497e5d6bbb8bdfb595628da8a3bb64cdb0dc809","abstract_canon_sha256":"5b25329aafface8f13298f763bb0991f3ea88e371f931d5f05fe7452d8a102d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:06.855198Z","signature_b64":"O6VaRpSxuF+VXGfVMREj3aTmr7I6kU0urhJrBB43fuyGJmFg5VngsbGBaiQ8DHyMuMaQQu0AJHU7wYDJi9UqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a47e01098ee4d40b68daa245c857f467ec556d9abb7a87619e51871174b3dda","last_reissued_at":"2026-07-05T04:55:06.854693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:06.854693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine Consensus is \\Theta(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version]","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jovan Komatovic, Manuel Vidigueira, Muhammad Ayaz Dzulfikar, Pierre Civit, Rachid Guerraoui, Seth Gilbert, Vincent Gramoli","submitted_at":"2022-08-19T10:56:26Z","abstract_excerpt":"The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether a consensus protocol with quadratic communication complexity can be obtained in partial synchrony. Until now, the most efficient known solutions for Byzantine consensus in partially synchronous settings had cubic communication complexity (e.g., HotStuff, binary DBFT).\n  This paper closes the existing gap by introducing SQuad, a partially sync"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.09262","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.09262/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2208.09262","created_at":"2026-07-05T04:55:06.854758+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.09262v2","created_at":"2026-07-05T04:55:06.854758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.09262","created_at":"2026-07-05T04:55:06.854758+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJD6AEEY5ZGU","created_at":"2026-07-05T04:55:06.854758+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJD6AEEY5ZGUBNUN","created_at":"2026-07-05T04:55:06.854758+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJD6AEEY","created_at":"2026-07-05T04:55:06.854758+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJD6AEEY5ZGUBNUNVISFZBL7IZ","json":"https://pith.science/pith/JJD6AEEY5ZGUBNUNVISFZBL7IZ.json","graph_json":"https://pith.science/api/pith-number/JJD6AEEY5ZGUBNUNVISFZBL7IZ/graph.json","events_json":"https://pith.science/api/pith-number/JJD6AEEY5ZGUBNUNVISFZBL7IZ/events.json","paper":"https://pith.science/paper/JJD6AEEY"},"agent_actions":{"view_html":"https://pith.science/pith/JJD6AEEY5ZGUBNUNVISFZBL7IZ","download_json":"https://pith.science/pith/JJD6AEEY5ZGUBNUNVISFZBL7IZ.json","view_paper":"https://pith.science/paper/JJD6AEEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.09262&json=true","fetch_graph":"https://pith.science/api/pith-number/JJD6AEEY5ZGUBNUNVISFZBL7IZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JJD6AEEY5ZGUBNUNVISFZBL7IZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJD6AEEY5ZGUBNUNVISFZBL7IZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJD6AEEY5ZGUBNUNVISFZBL7IZ/action/storage_attestation","attest_author":"https://pith.science/pith/JJD6AEEY5ZGUBNUNVISFZBL7IZ/action/author_attestation","sign_citation":"https://pith.science/pith/JJD6AEEY5ZGUBNUNVISFZBL7IZ/action/citation_signature","submit_replication":"https://pith.science/pith/JJD6AEEY5ZGUBNUNVISFZBL7IZ/action/replication_record"}},"created_at":"2026-07-05T04:55:06.854758+00:00","updated_at":"2026-07-05T04:55:06.854758+00:00"}