{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AEV4IMTX7C45C3V6CUZLM6YNMV","short_pith_number":"pith:AEV4IMTX","schema_version":"1.0","canonical_sha256":"012bc43277f8b9d16ebe1532b67b0d655ed303465dbfac2ba4999dd326c0e2e5","source":{"kind":"arxiv","id":"2405.04420","version":1},"attestation_state":"computed","paper":{"title":"Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Amirali Ebrahimzadeh, {\\DJ}or{\\dj}e \\v{Z}ikeli\\'c, Krishnendu Chatterjee, Krzysztof Pietrzak, Mehrdad Karrabi, Michelle Yeo","submitted_at":"2024-05-07T15:44:39Z","abstract_excerpt":"We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems -- like proofs of stake or proofs of space -- and consider the problem of computing an optimal selfish mining attack which maximizes expected relative revenue of the adversary, thus minimizing the chain quality. To this end, we propose a novel selfish mining attack that aims to maximize this objective and formally model the attack as a Markov decision process (MDP). We then present a formal analysis procedure which computes an $\\epsilon$-tight lower bo"},"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":"2405.04420","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-05-07T15:44:39Z","cross_cats_sorted":[],"title_canon_sha256":"858b9d4f00f0b128ed4d399915a0d8fe3980916a76c362a9e1b89adbe766b504","abstract_canon_sha256":"b4e93b1c6b22ed1bc03e1675a0aa984234a132158f042774dc5ec65f7abbf94d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:16:50.079543Z","signature_b64":"Ta3PNvhmf5JavheGRxVp8ZSjHHORl/HJ15K1P8RYeTVTW+d0d2NGhVdp86hyvpmZmqNJl3H2vpBCCgUkxu4vBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"012bc43277f8b9d16ebe1532b67b0d655ed303465dbfac2ba4999dd326c0e2e5","last_reissued_at":"2026-07-05T08:16:50.079052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:16:50.079052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Amirali Ebrahimzadeh, {\\DJ}or{\\dj}e \\v{Z}ikeli\\'c, Krishnendu Chatterjee, Krzysztof Pietrzak, Mehrdad Karrabi, Michelle Yeo","submitted_at":"2024-05-07T15:44:39Z","abstract_excerpt":"We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems -- like proofs of stake or proofs of space -- and consider the problem of computing an optimal selfish mining attack which maximizes expected relative revenue of the adversary, thus minimizing the chain quality. To this end, we propose a novel selfish mining attack that aims to maximize this objective and formally model the attack as a Markov decision process (MDP). We then present a formal analysis procedure which computes an $\\epsilon$-tight lower bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04420","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/2405.04420/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":"2405.04420","created_at":"2026-07-05T08:16:50.079109+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.04420v1","created_at":"2026-07-05T08:16:50.079109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04420","created_at":"2026-07-05T08:16:50.079109+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEV4IMTX7C45","created_at":"2026-07-05T08:16:50.079109+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEV4IMTX7C45C3V6","created_at":"2026-07-05T08:16:50.079109+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEV4IMTX","created_at":"2026-07-05T08:16:50.079109+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AEV4IMTX7C45C3V6CUZLM6YNMV","json":"https://pith.science/pith/AEV4IMTX7C45C3V6CUZLM6YNMV.json","graph_json":"https://pith.science/api/pith-number/AEV4IMTX7C45C3V6CUZLM6YNMV/graph.json","events_json":"https://pith.science/api/pith-number/AEV4IMTX7C45C3V6CUZLM6YNMV/events.json","paper":"https://pith.science/paper/AEV4IMTX"},"agent_actions":{"view_html":"https://pith.science/pith/AEV4IMTX7C45C3V6CUZLM6YNMV","download_json":"https://pith.science/pith/AEV4IMTX7C45C3V6CUZLM6YNMV.json","view_paper":"https://pith.science/paper/AEV4IMTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.04420&json=true","fetch_graph":"https://pith.science/api/pith-number/AEV4IMTX7C45C3V6CUZLM6YNMV/graph.json","fetch_events":"https://pith.science/api/pith-number/AEV4IMTX7C45C3V6CUZLM6YNMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEV4IMTX7C45C3V6CUZLM6YNMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEV4IMTX7C45C3V6CUZLM6YNMV/action/storage_attestation","attest_author":"https://pith.science/pith/AEV4IMTX7C45C3V6CUZLM6YNMV/action/author_attestation","sign_citation":"https://pith.science/pith/AEV4IMTX7C45C3V6CUZLM6YNMV/action/citation_signature","submit_replication":"https://pith.science/pith/AEV4IMTX7C45C3V6CUZLM6YNMV/action/replication_record"}},"created_at":"2026-07-05T08:16:50.079109+00:00","updated_at":"2026-07-05T08:16:50.079109+00:00"}