{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2OLBVNZA6H6HIS3WLLZJV2WRZ7","short_pith_number":"pith:2OLBVNZA","schema_version":"1.0","canonical_sha256":"d3961ab720f1fc744b765af29aead1cff5c3af62db2b7f88ceacc48f542df047","source":{"kind":"arxiv","id":"2205.09174","version":6},"attestation_state":"computed","paper":{"title":"Cordial Miners: Fast and Efficient Consensus for Every Eventuality","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.MA","cs.NI"],"primary_cat":"cs.DC","authors_text":"Ehud Shapiro, Idit Keidar, Oded Naor, Ouri Poupko","submitted_at":"2022-05-18T18:45:20Z","abstract_excerpt":"Cordial Miners are a family of efficient Byzantine Atomic Broadcast protocols, with instances for asynchrony and eventual synchrony.\n  They improve the latency of state-of-the-art DAG-based protocols by almost 2X and achieve optimal good-case complexity of O(n) by forgoing Reliable Broadcast as a building block.\n  Rather, Cordial Miners use the blocklace -- a partially-ordered counterpart of the totally-ordered blockchain data structure -- to implement the three algorithmic components of consensus: Dissemination, equivocation-exclusion, and ordering."},"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":"2205.09174","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2022-05-18T18:45:20Z","cross_cats_sorted":["cs.MA","cs.NI"],"title_canon_sha256":"bdda1adf6e9f5be6976e99245691ca356276d0187a9d6421a0d3de43ee8fde58","abstract_canon_sha256":"046c42d82e5711d649a6eded54f1f20f50a33dcdd49d754b2f4c8462255420ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:15.611807Z","signature_b64":"NSW+kjwjp+f09mMIQxpq/gcKi/EPNOQy66/jMyyrQ+9vI48TBldXnu3nqSSxGJfJhKO1vki52Md+d+NTiIzNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3961ab720f1fc744b765af29aead1cff5c3af62db2b7f88ceacc48f542df047","last_reissued_at":"2026-07-05T07:44:15.611289Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:15.611289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cordial Miners: Fast and Efficient Consensus for Every Eventuality","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.MA","cs.NI"],"primary_cat":"cs.DC","authors_text":"Ehud Shapiro, Idit Keidar, Oded Naor, Ouri Poupko","submitted_at":"2022-05-18T18:45:20Z","abstract_excerpt":"Cordial Miners are a family of efficient Byzantine Atomic Broadcast protocols, with instances for asynchrony and eventual synchrony.\n  They improve the latency of state-of-the-art DAG-based protocols by almost 2X and achieve optimal good-case complexity of O(n) by forgoing Reliable Broadcast as a building block.\n  Rather, Cordial Miners use the blocklace -- a partially-ordered counterpart of the totally-ordered blockchain data structure -- to implement the three algorithmic components of consensus: Dissemination, equivocation-exclusion, and ordering."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.09174","kind":"arxiv","version":6},"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/2205.09174/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":"2205.09174","created_at":"2026-07-05T07:44:15.611357+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.09174v6","created_at":"2026-07-05T07:44:15.611357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.09174","created_at":"2026-07-05T07:44:15.611357+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OLBVNZA6H6H","created_at":"2026-07-05T07:44:15.611357+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OLBVNZA6H6HIS3W","created_at":"2026-07-05T07:44:15.611357+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OLBVNZA","created_at":"2026-07-05T07:44:15.611357+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.10152","citing_title":"Consensus as Collapse Policy: Communication Evidence, Horizons, and Prefix Decisions","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2OLBVNZA6H6HIS3WLLZJV2WRZ7","json":"https://pith.science/pith/2OLBVNZA6H6HIS3WLLZJV2WRZ7.json","graph_json":"https://pith.science/api/pith-number/2OLBVNZA6H6HIS3WLLZJV2WRZ7/graph.json","events_json":"https://pith.science/api/pith-number/2OLBVNZA6H6HIS3WLLZJV2WRZ7/events.json","paper":"https://pith.science/paper/2OLBVNZA"},"agent_actions":{"view_html":"https://pith.science/pith/2OLBVNZA6H6HIS3WLLZJV2WRZ7","download_json":"https://pith.science/pith/2OLBVNZA6H6HIS3WLLZJV2WRZ7.json","view_paper":"https://pith.science/paper/2OLBVNZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.09174&json=true","fetch_graph":"https://pith.science/api/pith-number/2OLBVNZA6H6HIS3WLLZJV2WRZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/2OLBVNZA6H6HIS3WLLZJV2WRZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OLBVNZA6H6HIS3WLLZJV2WRZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OLBVNZA6H6HIS3WLLZJV2WRZ7/action/storage_attestation","attest_author":"https://pith.science/pith/2OLBVNZA6H6HIS3WLLZJV2WRZ7/action/author_attestation","sign_citation":"https://pith.science/pith/2OLBVNZA6H6HIS3WLLZJV2WRZ7/action/citation_signature","submit_replication":"https://pith.science/pith/2OLBVNZA6H6HIS3WLLZJV2WRZ7/action/replication_record"}},"created_at":"2026-07-05T07:44:15.611357+00:00","updated_at":"2026-07-05T07:44:15.611357+00:00"}