{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LG33OXRR3FFO3AFIOGCZHKVHH6","short_pith_number":"pith:LG33OXRR","schema_version":"1.0","canonical_sha256":"59b7b75e31d94aed80a8718593aaa73fa1c63ee1d0ad77cd41b31ad50d972c9f","source":{"kind":"arxiv","id":"2503.16783","version":4},"attestation_state":"computed","paper":{"title":"CoBRA: A Universal Strategyproof Confirmation Protocol for Quorum-based Proof-of-Stake Blockchains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Christos Stefo, Eleftherios Kokoris Kogias, Ray Neiheiser, Zeta Avarikioti","submitted_at":"2025-03-21T01:39:29Z","abstract_excerpt":"The security of many Proof-of-Stake (PoS) payment systems relies on quorum-based State Machine Replication (SMR) protocols. While classical analyses assume purely Byzantine faults, real-world systems must tolerate both arbitrary failures and strategic, profit-driven validators. We therefore study quorum-based SMR under a hybrid model with honest, Byzantine, and rational participants.\n  We first establish the fundamental limitations of traditional consensus mechanisms, proving two impossibility results: (1) in partially synchronous networks, no quorum-based protocol can achieve SMR when rationa"},"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":"2503.16783","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-03-21T01:39:29Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"12d03e2efc6993636ea4fb9239ccab787738a3ae070b0fd29c226c97359d179b","abstract_canon_sha256":"b92e60fd3f0e9bece7aa63b63408f29c7526a61631ac5de90d66748bb4c7c20a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:49.040247Z","signature_b64":"2YJJ65SDCbsOvtl/qdmrzorcEeEtyDdk2wlcgn0ncUHWRIQq3SXy8/OaL+euw3wRiFA0avrEui+DfxMf7xHICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59b7b75e31d94aed80a8718593aaa73fa1c63ee1d0ad77cd41b31ad50d972c9f","last_reissued_at":"2026-05-20T00:02:49.039193Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:49.039193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoBRA: A Universal Strategyproof Confirmation Protocol for Quorum-based Proof-of-Stake Blockchains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Christos Stefo, Eleftherios Kokoris Kogias, Ray Neiheiser, Zeta Avarikioti","submitted_at":"2025-03-21T01:39:29Z","abstract_excerpt":"The security of many Proof-of-Stake (PoS) payment systems relies on quorum-based State Machine Replication (SMR) protocols. While classical analyses assume purely Byzantine faults, real-world systems must tolerate both arbitrary failures and strategic, profit-driven validators. We therefore study quorum-based SMR under a hybrid model with honest, Byzantine, and rational participants.\n  We first establish the fundamental limitations of traditional consensus mechanisms, proving two impossibility results: (1) in partially synchronous networks, no quorum-based protocol can achieve SMR when rationa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.16783","kind":"arxiv","version":4},"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/2503.16783/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":"2503.16783","created_at":"2026-05-20T00:02:49.039343+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.16783v4","created_at":"2026-05-20T00:02:49.039343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.16783","created_at":"2026-05-20T00:02:49.039343+00:00"},{"alias_kind":"pith_short_12","alias_value":"LG33OXRR3FFO","created_at":"2026-05-20T00:02:49.039343+00:00"},{"alias_kind":"pith_short_16","alias_value":"LG33OXRR3FFO3AFI","created_at":"2026-05-20T00:02:49.039343+00:00"},{"alias_kind":"pith_short_8","alias_value":"LG33OXRR","created_at":"2026-05-20T00:02:49.039343+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.06655","citing_title":"Wonderboom -- Efficient, and Censorship-Resilient Signature Aggregation for Million Scale Consensus","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LG33OXRR3FFO3AFIOGCZHKVHH6","json":"https://pith.science/pith/LG33OXRR3FFO3AFIOGCZHKVHH6.json","graph_json":"https://pith.science/api/pith-number/LG33OXRR3FFO3AFIOGCZHKVHH6/graph.json","events_json":"https://pith.science/api/pith-number/LG33OXRR3FFO3AFIOGCZHKVHH6/events.json","paper":"https://pith.science/paper/LG33OXRR"},"agent_actions":{"view_html":"https://pith.science/pith/LG33OXRR3FFO3AFIOGCZHKVHH6","download_json":"https://pith.science/pith/LG33OXRR3FFO3AFIOGCZHKVHH6.json","view_paper":"https://pith.science/paper/LG33OXRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.16783&json=true","fetch_graph":"https://pith.science/api/pith-number/LG33OXRR3FFO3AFIOGCZHKVHH6/graph.json","fetch_events":"https://pith.science/api/pith-number/LG33OXRR3FFO3AFIOGCZHKVHH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LG33OXRR3FFO3AFIOGCZHKVHH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LG33OXRR3FFO3AFIOGCZHKVHH6/action/storage_attestation","attest_author":"https://pith.science/pith/LG33OXRR3FFO3AFIOGCZHKVHH6/action/author_attestation","sign_citation":"https://pith.science/pith/LG33OXRR3FFO3AFIOGCZHKVHH6/action/citation_signature","submit_replication":"https://pith.science/pith/LG33OXRR3FFO3AFIOGCZHKVHH6/action/replication_record"}},"created_at":"2026-05-20T00:02:49.039343+00:00","updated_at":"2026-05-20T00:02:49.039343+00:00"}