{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KTGMSFWTCD5NV3QSOSE66PBKD2","short_pith_number":"pith:KTGMSFWT","schema_version":"1.0","canonical_sha256":"54ccc916d310fadaee127489ef3c2a1e8e35ea5b6e0efea2a6876b320ba90fbc","source":{"kind":"arxiv","id":"2411.00558","version":1},"attestation_state":"computed","paper":{"title":"3-Slot-Finality Protocol for Ethereum","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Francesco D'Amato, Luca Zanolini, Roberto Saltini, Thanh-Hai Tran","submitted_at":"2024-11-01T13:12:58Z","abstract_excerpt":"Gasper, the consensus protocol currently employed by Ethereum, typically requires 64 to 95 slots -- the units of time during which a new chain extending the previous one by one block is proposed and voted -- to finalize. This means that under ideal conditions -- where the network is synchronous, and all chain proposers, along with more than two-thirds of the validators, behave as dictated by the protocol -- proposers construct blocks on a non-finalized chain that extends at least 64 blocks. This exposes a significant portion of the blockchain to potential reorganizations during changes in netw"},"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":"2411.00558","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-01T13:12:58Z","cross_cats_sorted":[],"title_canon_sha256":"d88bc3fd81da568eba99098fcf741798ca6075809ba8f335a7b47d8833bc3232","abstract_canon_sha256":"c166a9aa500c24ca6cd01cc0e9555844a4fe86e8785046c4dc5c5482d2b95c27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:44.597077Z","signature_b64":"8AslL8n/y5zGTrT8is5cqhZQICMDotKQIL+RECjAbLSGRjUK0IjfgJ9nIRvjMf6nxBKFz4ki1QUdotzEGt0/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ccc916d310fadaee127489ef3c2a1e8e35ea5b6e0efea2a6876b320ba90fbc","last_reissued_at":"2026-07-05T09:29:44.596663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:44.596663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3-Slot-Finality Protocol for Ethereum","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Francesco D'Amato, Luca Zanolini, Roberto Saltini, Thanh-Hai Tran","submitted_at":"2024-11-01T13:12:58Z","abstract_excerpt":"Gasper, the consensus protocol currently employed by Ethereum, typically requires 64 to 95 slots -- the units of time during which a new chain extending the previous one by one block is proposed and voted -- to finalize. This means that under ideal conditions -- where the network is synchronous, and all chain proposers, along with more than two-thirds of the validators, behave as dictated by the protocol -- proposers construct blocks on a non-finalized chain that extends at least 64 blocks. This exposes a significant portion of the blockchain to potential reorganizations during changes in netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.00558","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/2411.00558/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":"2411.00558","created_at":"2026-07-05T09:29:44.596728+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.00558v1","created_at":"2026-07-05T09:29:44.596728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.00558","created_at":"2026-07-05T09:29:44.596728+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTGMSFWTCD5N","created_at":"2026-07-05T09:29:44.596728+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTGMSFWTCD5NV3QS","created_at":"2026-07-05T09:29:44.596728+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTGMSFWT","created_at":"2026-07-05T09:29:44.596728+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00892","citing_title":"A declarative approach to specifying distributed algorithms using three-valued modal logic","ref_index":2002,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KTGMSFWTCD5NV3QSOSE66PBKD2","json":"https://pith.science/pith/KTGMSFWTCD5NV3QSOSE66PBKD2.json","graph_json":"https://pith.science/api/pith-number/KTGMSFWTCD5NV3QSOSE66PBKD2/graph.json","events_json":"https://pith.science/api/pith-number/KTGMSFWTCD5NV3QSOSE66PBKD2/events.json","paper":"https://pith.science/paper/KTGMSFWT"},"agent_actions":{"view_html":"https://pith.science/pith/KTGMSFWTCD5NV3QSOSE66PBKD2","download_json":"https://pith.science/pith/KTGMSFWTCD5NV3QSOSE66PBKD2.json","view_paper":"https://pith.science/paper/KTGMSFWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.00558&json=true","fetch_graph":"https://pith.science/api/pith-number/KTGMSFWTCD5NV3QSOSE66PBKD2/graph.json","fetch_events":"https://pith.science/api/pith-number/KTGMSFWTCD5NV3QSOSE66PBKD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTGMSFWTCD5NV3QSOSE66PBKD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTGMSFWTCD5NV3QSOSE66PBKD2/action/storage_attestation","attest_author":"https://pith.science/pith/KTGMSFWTCD5NV3QSOSE66PBKD2/action/author_attestation","sign_citation":"https://pith.science/pith/KTGMSFWTCD5NV3QSOSE66PBKD2/action/citation_signature","submit_replication":"https://pith.science/pith/KTGMSFWTCD5NV3QSOSE66PBKD2/action/replication_record"}},"created_at":"2026-07-05T09:29:44.596728+00:00","updated_at":"2026-07-05T09:29:44.596728+00:00"}