{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H6Y4VGILP4EFFVX227ALBVEY2H","short_pith_number":"pith:H6Y4VGIL","schema_version":"1.0","canonical_sha256":"3fb1ca990b7f0852d6fad7c0b0d498d1d82cf6259773e419bdf35fd9f06dba32","source":{"kind":"arxiv","id":"1704.02397","version":2},"attestation_state":"computed","paper":{"title":"Efficient Synchronous Byzantine Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Danny Dolev, Ittai Abraham, Kartik Nayak, Ling Ren, Srinivas Devadas","submitted_at":"2017-04-07T23:00:22Z","abstract_excerpt":"We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates $f$ Byzantine faults in an asynchronous setting using $3f+1$ replicas, and has since been studied or deployed by numerous works. In this work, we improve the Byzantine fault tolerance threshold to $n=2f+1$ by utilizing a relaxed synchrony assumption. We present a synchronous state machine replication protocol that commits a decision every 3 rounds in the common case. The key challenge is to ensure"},"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":"1704.02397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-07T23:00:22Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"c30604e266564a7a12214aacdbc7d64d08fe8acb29377d14b45aba103572309a","abstract_canon_sha256":"919dbaa948cec668ee64878eaeb61b9ecffa7f0635ee7cba914da26050d92595"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:16.311935Z","signature_b64":"0xp+feqmSi9MCwSbXjleQ/pxpS4pdDM10gUgSS/z/U/vV0Zc5yqIXRoOA/2qGKwzJWCvFiFUJ9LviDwManCNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb1ca990b7f0852d6fad7c0b0d498d1d82cf6259773e419bdf35fd9f06dba32","last_reissued_at":"2026-05-18T00:35:16.311311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:16.311311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Synchronous Byzantine Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Danny Dolev, Ittai Abraham, Kartik Nayak, Ling Ren, Srinivas Devadas","submitted_at":"2017-04-07T23:00:22Z","abstract_excerpt":"We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates $f$ Byzantine faults in an asynchronous setting using $3f+1$ replicas, and has since been studied or deployed by numerous works. In this work, we improve the Byzantine fault tolerance threshold to $n=2f+1$ by utilizing a relaxed synchrony assumption. We present a synchronous state machine replication protocol that commits a decision every 3 rounds in the common case. The key challenge is to ensure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02397","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":""},"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":"1704.02397","created_at":"2026-05-18T00:35:16.311429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02397v2","created_at":"2026-05-18T00:35:16.311429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02397","created_at":"2026-05-18T00:35:16.311429+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6Y4VGILP4EF","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6Y4VGILP4EFFVX2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6Y4VGIL","created_at":"2026-05-18T12:31:18.294218+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/H6Y4VGILP4EFFVX227ALBVEY2H","json":"https://pith.science/pith/H6Y4VGILP4EFFVX227ALBVEY2H.json","graph_json":"https://pith.science/api/pith-number/H6Y4VGILP4EFFVX227ALBVEY2H/graph.json","events_json":"https://pith.science/api/pith-number/H6Y4VGILP4EFFVX227ALBVEY2H/events.json","paper":"https://pith.science/paper/H6Y4VGIL"},"agent_actions":{"view_html":"https://pith.science/pith/H6Y4VGILP4EFFVX227ALBVEY2H","download_json":"https://pith.science/pith/H6Y4VGILP4EFFVX227ALBVEY2H.json","view_paper":"https://pith.science/paper/H6Y4VGIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02397&json=true","fetch_graph":"https://pith.science/api/pith-number/H6Y4VGILP4EFFVX227ALBVEY2H/graph.json","fetch_events":"https://pith.science/api/pith-number/H6Y4VGILP4EFFVX227ALBVEY2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6Y4VGILP4EFFVX227ALBVEY2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6Y4VGILP4EFFVX227ALBVEY2H/action/storage_attestation","attest_author":"https://pith.science/pith/H6Y4VGILP4EFFVX227ALBVEY2H/action/author_attestation","sign_citation":"https://pith.science/pith/H6Y4VGILP4EFFVX227ALBVEY2H/action/citation_signature","submit_replication":"https://pith.science/pith/H6Y4VGILP4EFFVX227ALBVEY2H/action/replication_record"}},"created_at":"2026-05-18T00:35:16.311429+00:00","updated_at":"2026-05-18T00:35:16.311429+00:00"}