{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RQIAI4MNZUHZXWN76SQRDQA524","short_pith_number":"pith:RQIAI4MN","schema_version":"1.0","canonical_sha256":"8c1004718dcd0f9bd9bff4a111c01dd72f78d99866f88e14dd0276feab97a9cd","source":{"kind":"arxiv","id":"2102.12825","version":3},"attestation_state":"computed","paper":{"title":"Revisiting Optimal Resilience of Fast Byzantine Consensus (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrei Tonkikh, Petr Kuznetsov, Yan X Zhang","submitted_at":"2021-02-25T12:53:34Z","abstract_excerpt":"It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely known Byzantine fault-tolerant consensus protocol, it takes three message delays to decide a value, in contrast with just two in Paxos. This motivates the search for fast Byzantine consensus algorithms that can produce decisions after just two message delays \\emph{in the common case}, e.g., under the assumption that the current leader is correct and not suspected by correct processes. The (optimal) two-step latency c"},"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":"2102.12825","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-02-25T12:53:34Z","cross_cats_sorted":[],"title_canon_sha256":"344469e092a619ba4fbc77f72e4d57066d44fa206e8182470819d6e420d5f67e","abstract_canon_sha256":"57eb01ca9237a4422cb738272f09fc10226e2dad98e5a3c8c840fb13197dce57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:50.735584Z","signature_b64":"VniJoV5fIYet3CPnxBZ6Nq5TlrEdetoifgVLHPOfJ/h4v5wWNuQaD0im97MeRsV5mXjoRNh7steqtTSEV70RCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c1004718dcd0f9bd9bff4a111c01dd72f78d99866f88e14dd0276feab97a9cd","last_reissued_at":"2026-07-05T03:00:50.735190Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:50.735190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Optimal Resilience of Fast Byzantine Consensus (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrei Tonkikh, Petr Kuznetsov, Yan X Zhang","submitted_at":"2021-02-25T12:53:34Z","abstract_excerpt":"It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely known Byzantine fault-tolerant consensus protocol, it takes three message delays to decide a value, in contrast with just two in Paxos. This motivates the search for fast Byzantine consensus algorithms that can produce decisions after just two message delays \\emph{in the common case}, e.g., under the assumption that the current leader is correct and not suspected by correct processes. The (optimal) two-step latency c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.12825","kind":"arxiv","version":3},"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/2102.12825/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":"2102.12825","created_at":"2026-07-05T03:00:50.735252+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.12825v3","created_at":"2026-07-05T03:00:50.735252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.12825","created_at":"2026-07-05T03:00:50.735252+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQIAI4MNZUHZ","created_at":"2026-07-05T03:00:50.735252+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQIAI4MNZUHZXWN7","created_at":"2026-07-05T03:00:50.735252+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQIAI4MN","created_at":"2026-07-05T03:00:50.735252+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01934","citing_title":"Diagnosing High-Performance BFT Consensus via Mixture Modeling of Block Time Distributions","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQIAI4MNZUHZXWN76SQRDQA524","json":"https://pith.science/pith/RQIAI4MNZUHZXWN76SQRDQA524.json","graph_json":"https://pith.science/api/pith-number/RQIAI4MNZUHZXWN76SQRDQA524/graph.json","events_json":"https://pith.science/api/pith-number/RQIAI4MNZUHZXWN76SQRDQA524/events.json","paper":"https://pith.science/paper/RQIAI4MN"},"agent_actions":{"view_html":"https://pith.science/pith/RQIAI4MNZUHZXWN76SQRDQA524","download_json":"https://pith.science/pith/RQIAI4MNZUHZXWN76SQRDQA524.json","view_paper":"https://pith.science/paper/RQIAI4MN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.12825&json=true","fetch_graph":"https://pith.science/api/pith-number/RQIAI4MNZUHZXWN76SQRDQA524/graph.json","fetch_events":"https://pith.science/api/pith-number/RQIAI4MNZUHZXWN76SQRDQA524/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQIAI4MNZUHZXWN76SQRDQA524/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQIAI4MNZUHZXWN76SQRDQA524/action/storage_attestation","attest_author":"https://pith.science/pith/RQIAI4MNZUHZXWN76SQRDQA524/action/author_attestation","sign_citation":"https://pith.science/pith/RQIAI4MNZUHZXWN76SQRDQA524/action/citation_signature","submit_replication":"https://pith.science/pith/RQIAI4MNZUHZXWN76SQRDQA524/action/replication_record"}},"created_at":"2026-07-05T03:00:50.735252+00:00","updated_at":"2026-07-05T03:00:50.735252+00:00"}