{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TP2YKU3BQITABA3N3DW6BLALLV","short_pith_number":"pith:TP2YKU3B","schema_version":"1.0","canonical_sha256":"9bf5855361822600836dd8ede0ac0b5d79c701273516f0c3279b4a08defd5cd9","source":{"kind":"arxiv","id":"2306.15743","version":1},"attestation_state":"computed","paper":{"title":"Condorcet Attack Against Fair Transaction Ordering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Majid Khabbazian, Mohammad Amin Vafadar","submitted_at":"2023-06-27T18:49:22Z","abstract_excerpt":"We introduce the Condorcet attack, a new threat to fair transaction ordering. Specifically, the attack undermines batch-order-fairness, the strongest notion of transaction fair ordering proposed to date. The batch-order-fairness guarantees that a transaction tx is ordered before tx' if a majority of nodes in the system receive tx before tx'; the only exception (due to an impossibility result) is when tx and tx' fall into a so-called \"Condorcet cycle\". When this happens, tx and tx' along with other transactions within the cycle are placed in a batch, and any unfairness inside a batch is ignored"},"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":"2306.15743","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-06-27T18:49:22Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7e2486e0de0315a71e439d550b79c0429177ba3f5aaea72ec176f8d85a8acc93","abstract_canon_sha256":"446cf6cbecc61cdfb63a671d7d0d1c7431bddd2743936200605893daf27c0692"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:25:43.931664Z","signature_b64":"Qmnx2BMbtqukN2/+yK3hJtwBGXmkDldCjnsrKW67WbVkUroqa5XUpYM/3Q8IwmY7uuFIAvVJs1nlv3EZ32g6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bf5855361822600836dd8ede0ac0b5d79c701273516f0c3279b4a08defd5cd9","last_reissued_at":"2026-07-05T06:25:43.931093Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:25:43.931093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Condorcet Attack Against Fair Transaction Ordering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Majid Khabbazian, Mohammad Amin Vafadar","submitted_at":"2023-06-27T18:49:22Z","abstract_excerpt":"We introduce the Condorcet attack, a new threat to fair transaction ordering. Specifically, the attack undermines batch-order-fairness, the strongest notion of transaction fair ordering proposed to date. The batch-order-fairness guarantees that a transaction tx is ordered before tx' if a majority of nodes in the system receive tx before tx'; the only exception (due to an impossibility result) is when tx and tx' fall into a so-called \"Condorcet cycle\". When this happens, tx and tx' along with other transactions within the cycle are placed in a batch, and any unfairness inside a batch is ignored"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.15743","kind":"arxiv","version":1},"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/2306.15743/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":"2306.15743","created_at":"2026-07-05T06:25:43.931151+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.15743v1","created_at":"2026-07-05T06:25:43.931151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.15743","created_at":"2026-07-05T06:25:43.931151+00:00"},{"alias_kind":"pith_short_12","alias_value":"TP2YKU3BQITA","created_at":"2026-07-05T06:25:43.931151+00:00"},{"alias_kind":"pith_short_16","alias_value":"TP2YKU3BQITABA3N","created_at":"2026-07-05T06:25:43.931151+00:00"},{"alias_kind":"pith_short_8","alias_value":"TP2YKU3B","created_at":"2026-07-05T06:25:43.931151+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06144","citing_title":"Ordering by Unanimity: Giving Applications Sequencing Rights Without Breaking Composability","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TP2YKU3BQITABA3N3DW6BLALLV","json":"https://pith.science/pith/TP2YKU3BQITABA3N3DW6BLALLV.json","graph_json":"https://pith.science/api/pith-number/TP2YKU3BQITABA3N3DW6BLALLV/graph.json","events_json":"https://pith.science/api/pith-number/TP2YKU3BQITABA3N3DW6BLALLV/events.json","paper":"https://pith.science/paper/TP2YKU3B"},"agent_actions":{"view_html":"https://pith.science/pith/TP2YKU3BQITABA3N3DW6BLALLV","download_json":"https://pith.science/pith/TP2YKU3BQITABA3N3DW6BLALLV.json","view_paper":"https://pith.science/paper/TP2YKU3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.15743&json=true","fetch_graph":"https://pith.science/api/pith-number/TP2YKU3BQITABA3N3DW6BLALLV/graph.json","fetch_events":"https://pith.science/api/pith-number/TP2YKU3BQITABA3N3DW6BLALLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TP2YKU3BQITABA3N3DW6BLALLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TP2YKU3BQITABA3N3DW6BLALLV/action/storage_attestation","attest_author":"https://pith.science/pith/TP2YKU3BQITABA3N3DW6BLALLV/action/author_attestation","sign_citation":"https://pith.science/pith/TP2YKU3BQITABA3N3DW6BLALLV/action/citation_signature","submit_replication":"https://pith.science/pith/TP2YKU3BQITABA3N3DW6BLALLV/action/replication_record"}},"created_at":"2026-07-05T06:25:43.931151+00:00","updated_at":"2026-07-05T06:25:43.931151+00:00"}