{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MSRGK4OFCKQWW7GJ7M4KXVTBKD","short_pith_number":"pith:MSRGK4OF","schema_version":"1.0","canonical_sha256":"64a26571c512a16b7cc9fb38abd66150ed937502b6a425306fecfc8da6f049eb","source":{"kind":"arxiv","id":"2407.02167","version":2},"attestation_state":"computed","paper":{"title":"Reusable Formal Verification of DAG-based Consensus Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.SE"],"primary_cat":"cs.LO","authors_text":"Bernhard Scholz, Nathalie Bertrand, Pavle Subotic, Pranav Ghorpade, Sasha Rubin","submitted_at":"2024-07-02T11:19:12Z","abstract_excerpt":"Blockchains use consensus protocols to reach agreement, e.g., on the ordering of transactions. DAG-based consensus protocols are increasingly adopted by blockchain companies to reduce energy consumption and enhance security. These protocols collaboratively construct a partial order of blocks (DAG construction) and produce a linear sequence of blocks (DAG ordering). Given the strategic significance of blockchains, formal proofs of the correctness of key components such as consensus protocols are essential. This paper presents safety-verified specifications for five DAG-based consensus protocols"},"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":"2407.02167","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-07-02T11:19:12Z","cross_cats_sorted":["cs.DC","cs.SE"],"title_canon_sha256":"9994f54f20a87a8796f367268a3c0b215caa449cb2736b9b8b9a39d9e810fb01","abstract_canon_sha256":"776afe8f9d6c6da95bc29337feddb0daa2c3f3dcbe52018868d01e97f52e83f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:35.328574Z","signature_b64":"YNlxrdUj+NuPbd7bRQkKMLedjCg8PeEomPnCb00/uAN2X7MWduLTTLQXKGwLoiWEqXnKXc2lDJnSgX7//VqNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64a26571c512a16b7cc9fb38abd66150ed937502b6a425306fecfc8da6f049eb","last_reissued_at":"2026-07-05T10:33:35.327598Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:35.327598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reusable Formal Verification of DAG-based Consensus Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.SE"],"primary_cat":"cs.LO","authors_text":"Bernhard Scholz, Nathalie Bertrand, Pavle Subotic, Pranav Ghorpade, Sasha Rubin","submitted_at":"2024-07-02T11:19:12Z","abstract_excerpt":"Blockchains use consensus protocols to reach agreement, e.g., on the ordering of transactions. DAG-based consensus protocols are increasingly adopted by blockchain companies to reduce energy consumption and enhance security. These protocols collaboratively construct a partial order of blocks (DAG construction) and produce a linear sequence of blocks (DAG ordering). Given the strategic significance of blockchains, formal proofs of the correctness of key components such as consensus protocols are essential. This paper presents safety-verified specifications for five DAG-based consensus protocols"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02167","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/2407.02167/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":"2407.02167","created_at":"2026-07-05T10:33:35.327907+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.02167v2","created_at":"2026-07-05T10:33:35.327907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02167","created_at":"2026-07-05T10:33:35.327907+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSRGK4OFCKQW","created_at":"2026-07-05T10:33:35.327907+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSRGK4OFCKQWW7GJ","created_at":"2026-07-05T10:33:35.327907+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSRGK4OF","created_at":"2026-07-05T10:33:35.327907+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16853","citing_title":"Formal Verification of Blockchain Nonforking in DAG-Based BFT Consensus with Dynamic Stake","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MSRGK4OFCKQWW7GJ7M4KXVTBKD","json":"https://pith.science/pith/MSRGK4OFCKQWW7GJ7M4KXVTBKD.json","graph_json":"https://pith.science/api/pith-number/MSRGK4OFCKQWW7GJ7M4KXVTBKD/graph.json","events_json":"https://pith.science/api/pith-number/MSRGK4OFCKQWW7GJ7M4KXVTBKD/events.json","paper":"https://pith.science/paper/MSRGK4OF"},"agent_actions":{"view_html":"https://pith.science/pith/MSRGK4OFCKQWW7GJ7M4KXVTBKD","download_json":"https://pith.science/pith/MSRGK4OFCKQWW7GJ7M4KXVTBKD.json","view_paper":"https://pith.science/paper/MSRGK4OF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.02167&json=true","fetch_graph":"https://pith.science/api/pith-number/MSRGK4OFCKQWW7GJ7M4KXVTBKD/graph.json","fetch_events":"https://pith.science/api/pith-number/MSRGK4OFCKQWW7GJ7M4KXVTBKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSRGK4OFCKQWW7GJ7M4KXVTBKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSRGK4OFCKQWW7GJ7M4KXVTBKD/action/storage_attestation","attest_author":"https://pith.science/pith/MSRGK4OFCKQWW7GJ7M4KXVTBKD/action/author_attestation","sign_citation":"https://pith.science/pith/MSRGK4OFCKQWW7GJ7M4KXVTBKD/action/citation_signature","submit_replication":"https://pith.science/pith/MSRGK4OFCKQWW7GJ7M4KXVTBKD/action/replication_record"}},"created_at":"2026-07-05T10:33:35.327907+00:00","updated_at":"2026-07-05T10:33:35.327907+00:00"}