{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2CT3SEUDUBI6QXLAKKSMLSATBM","short_pith_number":"pith:2CT3SEUD","schema_version":"1.0","canonical_sha256":"d0a7b91283a051e85d6052a4c5c8130b118ace261607dc7aa74004c1daef159b","source":{"kind":"arxiv","id":"2401.01791","version":2},"attestation_state":"computed","paper":{"title":"Moonshot: Optimizing Chain-Based Rotating Leader BFT via Optimistic Proposals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Isaac Doidge, Joshua Tobkin, Nibesh Shrestha, Raghavendra Ramesh","submitted_at":"2024-01-03T15:45:23Z","abstract_excerpt":"Existing chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2\\delta$ (where $\\delta$ is the message transmission latency). While a protocol with a block period of $\\delta$ exists under the synchronous model, its commit latency is linear in the size of the system.\n  To close this gap, we present the first chain-based BFT SMR protocols with $\\delta$ delay between the proposals of consecutive honest leaders and commit latencies of $3\\delta$. We present three protocols for the partially synchrono"},"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":"2401.01791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-01-03T15:45:23Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8d046452c998765070f83dcf80fa0757ad204384c8046edc0f7356191f476f7b","abstract_canon_sha256":"8a447fd26fd80123dfd15057a5d505b51b994eb8ac5a5a72594cfaa9fbcbede7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:09:47.431532Z","signature_b64":"pFxcdu9rQjtNSomg0iuWJSmbphv1d0H75XsTN2n4mI4q5BrwQYj+UwQl8pPCa1SVaPcV4kPK8L/zXdmaksneDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0a7b91283a051e85d6052a4c5c8130b118ace261607dc7aa74004c1daef159b","last_reissued_at":"2026-07-05T08:09:47.431017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:09:47.431017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Moonshot: Optimizing Chain-Based Rotating Leader BFT via Optimistic Proposals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Isaac Doidge, Joshua Tobkin, Nibesh Shrestha, Raghavendra Ramesh","submitted_at":"2024-01-03T15:45:23Z","abstract_excerpt":"Existing chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2\\delta$ (where $\\delta$ is the message transmission latency). While a protocol with a block period of $\\delta$ exists under the synchronous model, its commit latency is linear in the size of the system.\n  To close this gap, we present the first chain-based BFT SMR protocols with $\\delta$ delay between the proposals of consecutive honest leaders and commit latencies of $3\\delta$. We present three protocols for the partially synchrono"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.01791","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/2401.01791/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":"2401.01791","created_at":"2026-07-05T08:09:47.431091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.01791v2","created_at":"2026-07-05T08:09:47.431091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01791","created_at":"2026-07-05T08:09:47.431091+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CT3SEUDUBI6","created_at":"2026-07-05T08:09:47.431091+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CT3SEUDUBI6QXLA","created_at":"2026-07-05T08:09:47.431091+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CT3SEUD","created_at":"2026-07-05T08:09:47.431091+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.10612","citing_title":"Zaptos: Towards Optimal Blockchain Latency","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2CT3SEUDUBI6QXLAKKSMLSATBM","json":"https://pith.science/pith/2CT3SEUDUBI6QXLAKKSMLSATBM.json","graph_json":"https://pith.science/api/pith-number/2CT3SEUDUBI6QXLAKKSMLSATBM/graph.json","events_json":"https://pith.science/api/pith-number/2CT3SEUDUBI6QXLAKKSMLSATBM/events.json","paper":"https://pith.science/paper/2CT3SEUD"},"agent_actions":{"view_html":"https://pith.science/pith/2CT3SEUDUBI6QXLAKKSMLSATBM","download_json":"https://pith.science/pith/2CT3SEUDUBI6QXLAKKSMLSATBM.json","view_paper":"https://pith.science/paper/2CT3SEUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.01791&json=true","fetch_graph":"https://pith.science/api/pith-number/2CT3SEUDUBI6QXLAKKSMLSATBM/graph.json","fetch_events":"https://pith.science/api/pith-number/2CT3SEUDUBI6QXLAKKSMLSATBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CT3SEUDUBI6QXLAKKSMLSATBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CT3SEUDUBI6QXLAKKSMLSATBM/action/storage_attestation","attest_author":"https://pith.science/pith/2CT3SEUDUBI6QXLAKKSMLSATBM/action/author_attestation","sign_citation":"https://pith.science/pith/2CT3SEUDUBI6QXLAKKSMLSATBM/action/citation_signature","submit_replication":"https://pith.science/pith/2CT3SEUDUBI6QXLAKKSMLSATBM/action/replication_record"}},"created_at":"2026-07-05T08:09:47.431091+00:00","updated_at":"2026-07-05T08:09:47.431091+00:00"}