{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DIHBNKXLGIE5DOK4RGIGZQQSHD","short_pith_number":"pith:DIHBNKXL","schema_version":"1.0","canonical_sha256":"1a0e16aaeb3209d1b95c89906cc21238e7e7c55c59f011e4b41fe2a920f16e86","source":{"kind":"arxiv","id":"2602.02892","version":2},"attestation_state":"computed","paper":{"title":"Prefix Consensus For Censorship Resistant BFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Andrei Tonkikh, Zhuolun Xiang","submitted_at":"2026-02-02T22:55:29Z","abstract_excerpt":"Despite broad adoption of BFT consensus in blockchains, censorship resistance remains weak: existing designs offer limited inclusion guarantees and allow leaders to exclude transactions.\n  We address this with a new abstraction and protocol stack. We define \\emph{Prefix Consensus}, where parties input vectors and output two consistent vectors $(v^{\\sf low},v^{\\sf high})$ that extend the maximum common prefix of honest inputs and satisfy $v_i^{\\sf low}\\preceq v_j^{\\sf high}$ for all honest parties $i,j$. We show that Prefix Consensus is solvable asynchronously and establish tight round-complexi"},"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":"2602.02892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-02-02T22:55:29Z","cross_cats_sorted":[],"title_canon_sha256":"d97d0420a8450176edd3b0d9540de67fe969a86b6e5f8f2ed2d07a36bca5abbc","abstract_canon_sha256":"4789d4d47a07546f41f669d504685c93d3bee11f953f19f1b2c1bd1e39dbe0ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-20T00:18:18.292782Z","signature_b64":"pzs2cI5a1ugVBEW1LLyv2u2TLpbsmKpz4ft54igdOhFCtf61A5bZd2d4wXG35AKkP7gv9G0VZSg8jEvFsLjwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a0e16aaeb3209d1b95c89906cc21238e7e7c55c59f011e4b41fe2a920f16e86","last_reissued_at":"2026-07-20T00:18:18.291814Z","signature_status":"signed_v1","first_computed_at":"2026-07-20T00:18:18.291814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prefix Consensus For Censorship Resistant BFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Andrei Tonkikh, Zhuolun Xiang","submitted_at":"2026-02-02T22:55:29Z","abstract_excerpt":"Despite broad adoption of BFT consensus in blockchains, censorship resistance remains weak: existing designs offer limited inclusion guarantees and allow leaders to exclude transactions.\n  We address this with a new abstraction and protocol stack. We define \\emph{Prefix Consensus}, where parties input vectors and output two consistent vectors $(v^{\\sf low},v^{\\sf high})$ that extend the maximum common prefix of honest inputs and satisfy $v_i^{\\sf low}\\preceq v_j^{\\sf high}$ for all honest parties $i,j$. We show that Prefix Consensus is solvable asynchronously and establish tight round-complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.02892","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.02892/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":"2602.02892","created_at":"2026-07-20T00:18:18.292269+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.02892v2","created_at":"2026-07-20T00:18:18.292269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.02892","created_at":"2026-07-20T00:18:18.292269+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIHBNKXLGIE5","created_at":"2026-07-20T00:18:18.292269+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIHBNKXLGIE5DOK4","created_at":"2026-07-20T00:18:18.292269+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIHBNKXL","created_at":"2026-07-20T00:18:18.292269+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23677","citing_title":"AMP: Arc Multi-Proposer Protocol with Bounded Inclusion Guarantees","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DIHBNKXLGIE5DOK4RGIGZQQSHD","json":"https://pith.science/pith/DIHBNKXLGIE5DOK4RGIGZQQSHD.json","graph_json":"https://pith.science/api/pith-number/DIHBNKXLGIE5DOK4RGIGZQQSHD/graph.json","events_json":"https://pith.science/api/pith-number/DIHBNKXLGIE5DOK4RGIGZQQSHD/events.json","paper":"https://pith.science/paper/DIHBNKXL"},"agent_actions":{"view_html":"https://pith.science/pith/DIHBNKXLGIE5DOK4RGIGZQQSHD","download_json":"https://pith.science/pith/DIHBNKXLGIE5DOK4RGIGZQQSHD.json","view_paper":"https://pith.science/paper/DIHBNKXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.02892&json=true","fetch_graph":"https://pith.science/api/pith-number/DIHBNKXLGIE5DOK4RGIGZQQSHD/graph.json","fetch_events":"https://pith.science/api/pith-number/DIHBNKXLGIE5DOK4RGIGZQQSHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIHBNKXLGIE5DOK4RGIGZQQSHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIHBNKXLGIE5DOK4RGIGZQQSHD/action/storage_attestation","attest_author":"https://pith.science/pith/DIHBNKXLGIE5DOK4RGIGZQQSHD/action/author_attestation","sign_citation":"https://pith.science/pith/DIHBNKXLGIE5DOK4RGIGZQQSHD/action/citation_signature","submit_replication":"https://pith.science/pith/DIHBNKXLGIE5DOK4RGIGZQQSHD/action/replication_record"}},"created_at":"2026-07-20T00:18:18.292269+00:00","updated_at":"2026-07-20T00:18:18.292269+00:00"}