{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LAUXQYXFCJEVT6XG6MN5POMASB","short_pith_number":"pith:LAUXQYXF","schema_version":"1.0","canonical_sha256":"58297862e5124959fae6f31bd7b98090633bbc4729f2e3c36158820eb032ea39","source":{"kind":"arxiv","id":"2308.06955","version":1},"attestation_state":"computed","paper":{"title":"Security Analysis of Filecoin's Expected Consensus in the Byzantine vs Honest Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Marko Vukoli\\'c, Sarah Azouvi, Xuechao Wang","submitted_at":"2023-08-14T06:20:24Z","abstract_excerpt":"Filecoin is the largest storage-based open-source blockchain, both by storage capacity (>11EiB) and market capitalization. This paper provides the first formal security analysis of Filecoin's consensus (ordering) protocol, Expected Consensus (EC). Specifically, we show that EC is secure against an arbitrary adversary that controls a fraction $\\beta$ of the total storage for $\\beta m< 1- e^{-(1-\\beta)m}$, where $m$ is a parameter that corresponds to the expected number of blocks per round, currently $m=5$ in Filecoin. We then present an attack, the $n$-split attack, where an adversary splits th"},"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":"2308.06955","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-08-14T06:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"a5e02d94f3c0d2392c877ee2f33e71ed076cae81e46d07ad74aa03eaf01314d5","abstract_canon_sha256":"0240f4bd811c70dcedbf6b14e16aeee4f85941335b9ab804f84b891558327670"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:47.634286Z","signature_b64":"WysYjZtkQqsGafAq41W2zfLpi92FCuCJd+Bvfey2uQ/wRPgnDQopjnR0tQcFZY0hshDOdgtLK7YYQiVXuyucAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58297862e5124959fae6f31bd7b98090633bbc4729f2e3c36158820eb032ea39","last_reissued_at":"2026-07-05T06:40:47.633791Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:47.633791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Security Analysis of Filecoin's Expected Consensus in the Byzantine vs Honest Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Marko Vukoli\\'c, Sarah Azouvi, Xuechao Wang","submitted_at":"2023-08-14T06:20:24Z","abstract_excerpt":"Filecoin is the largest storage-based open-source blockchain, both by storage capacity (>11EiB) and market capitalization. This paper provides the first formal security analysis of Filecoin's consensus (ordering) protocol, Expected Consensus (EC). Specifically, we show that EC is secure against an arbitrary adversary that controls a fraction $\\beta$ of the total storage for $\\beta m< 1- e^{-(1-\\beta)m}$, where $m$ is a parameter that corresponds to the expected number of blocks per round, currently $m=5$ in Filecoin. We then present an attack, the $n$-split attack, where an adversary splits th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06955","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/2308.06955/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":"2308.06955","created_at":"2026-07-05T06:40:47.633855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.06955v1","created_at":"2026-07-05T06:40:47.633855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06955","created_at":"2026-07-05T06:40:47.633855+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAUXQYXFCJEV","created_at":"2026-07-05T06:40:47.633855+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAUXQYXFCJEVT6XG","created_at":"2026-07-05T06:40:47.633855+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAUXQYXF","created_at":"2026-07-05T06:40:47.633855+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10026","citing_title":"SoK: DAG-based Consensus Protocols","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LAUXQYXFCJEVT6XG6MN5POMASB","json":"https://pith.science/pith/LAUXQYXFCJEVT6XG6MN5POMASB.json","graph_json":"https://pith.science/api/pith-number/LAUXQYXFCJEVT6XG6MN5POMASB/graph.json","events_json":"https://pith.science/api/pith-number/LAUXQYXFCJEVT6XG6MN5POMASB/events.json","paper":"https://pith.science/paper/LAUXQYXF"},"agent_actions":{"view_html":"https://pith.science/pith/LAUXQYXFCJEVT6XG6MN5POMASB","download_json":"https://pith.science/pith/LAUXQYXFCJEVT6XG6MN5POMASB.json","view_paper":"https://pith.science/paper/LAUXQYXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.06955&json=true","fetch_graph":"https://pith.science/api/pith-number/LAUXQYXFCJEVT6XG6MN5POMASB/graph.json","fetch_events":"https://pith.science/api/pith-number/LAUXQYXFCJEVT6XG6MN5POMASB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAUXQYXFCJEVT6XG6MN5POMASB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAUXQYXFCJEVT6XG6MN5POMASB/action/storage_attestation","attest_author":"https://pith.science/pith/LAUXQYXFCJEVT6XG6MN5POMASB/action/author_attestation","sign_citation":"https://pith.science/pith/LAUXQYXFCJEVT6XG6MN5POMASB/action/citation_signature","submit_replication":"https://pith.science/pith/LAUXQYXFCJEVT6XG6MN5POMASB/action/replication_record"}},"created_at":"2026-07-05T06:40:47.633855+00:00","updated_at":"2026-07-05T06:40:47.633855+00:00"}