{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OWBTGR44N276MRDUMULUW6NXML","short_pith_number":"pith:OWBTGR44","schema_version":"1.0","canonical_sha256":"758333479c6ebfe6447465174b79b762d643e047e97133374936bec395073a84","source":{"kind":"arxiv","id":"2402.08068","version":4},"attestation_state":"computed","paper":{"title":"The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ehud Shapiro, Paulo S\\'ergio Almeida","submitted_at":"2024-02-12T21:27:32Z","abstract_excerpt":"Conflict-free Replicated Data Types (CRDTs) are designed for replica convergence without global coordination or consensus. Recent work has achieved the same in a Byzantine environment, through DAG-like structures based on cryptographic hashes of content. The blocklace is a partially-ordered generalization of the blockchain in which each block has any finite number of signed hash pointers to preceding blocks. We show that the blocklace datatype, with the sole operation of adding a single block, is a CRDT: it is both a pure operation-based CRDT, with self-tagging; and a delta-state CRDT, under a"},"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":"2402.08068","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-02-12T21:27:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"025787b82318ea17ccb21dbc85601217d3309491b319af01145f2430c69e1ce8","abstract_canon_sha256":"b24c68f6b5ba6503e9d361bfb51918d50b01a8d13a9921690b049ad226421f69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:41.102459Z","signature_b64":"BkyhV767MUbJJEK0r6yMXfJdYvYj14kAlkmgOJ4OUJdwrPJ/ehiEzBbJWesgNtWo2YZnYvO2EXFSiNPXx+LvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"758333479c6ebfe6447465174b79b762d643e047e97133374936bec395073a84","last_reissued_at":"2026-07-05T10:03:41.101969Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:41.101969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ehud Shapiro, Paulo S\\'ergio Almeida","submitted_at":"2024-02-12T21:27:32Z","abstract_excerpt":"Conflict-free Replicated Data Types (CRDTs) are designed for replica convergence without global coordination or consensus. Recent work has achieved the same in a Byzantine environment, through DAG-like structures based on cryptographic hashes of content. The blocklace is a partially-ordered generalization of the blockchain in which each block has any finite number of signed hash pointers to preceding blocks. We show that the blocklace datatype, with the sole operation of adding a single block, is a CRDT: it is both a pure operation-based CRDT, with self-tagging; and a delta-state CRDT, under a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08068","kind":"arxiv","version":4},"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/2402.08068/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":"2402.08068","created_at":"2026-07-05T10:03:41.102031+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08068v4","created_at":"2026-07-05T10:03:41.102031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08068","created_at":"2026-07-05T10:03:41.102031+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWBTGR44N276","created_at":"2026-07-05T10:03:41.102031+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWBTGR44N276MRDU","created_at":"2026-07-05T10:03:41.102031+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWBTGR44","created_at":"2026-07-05T10:03:41.102031+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.22963","citing_title":"ERA: Epoch-Resolved Arbitration for Duelling Admins in Group Management CRDTs","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23560","citing_title":"Towards System-Oriented Formal Verification of Local-First Access Control","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OWBTGR44N276MRDUMULUW6NXML","json":"https://pith.science/pith/OWBTGR44N276MRDUMULUW6NXML.json","graph_json":"https://pith.science/api/pith-number/OWBTGR44N276MRDUMULUW6NXML/graph.json","events_json":"https://pith.science/api/pith-number/OWBTGR44N276MRDUMULUW6NXML/events.json","paper":"https://pith.science/paper/OWBTGR44"},"agent_actions":{"view_html":"https://pith.science/pith/OWBTGR44N276MRDUMULUW6NXML","download_json":"https://pith.science/pith/OWBTGR44N276MRDUMULUW6NXML.json","view_paper":"https://pith.science/paper/OWBTGR44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08068&json=true","fetch_graph":"https://pith.science/api/pith-number/OWBTGR44N276MRDUMULUW6NXML/graph.json","fetch_events":"https://pith.science/api/pith-number/OWBTGR44N276MRDUMULUW6NXML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWBTGR44N276MRDUMULUW6NXML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWBTGR44N276MRDUMULUW6NXML/action/storage_attestation","attest_author":"https://pith.science/pith/OWBTGR44N276MRDUMULUW6NXML/action/author_attestation","sign_citation":"https://pith.science/pith/OWBTGR44N276MRDUMULUW6NXML/action/citation_signature","submit_replication":"https://pith.science/pith/OWBTGR44N276MRDUMULUW6NXML/action/replication_record"}},"created_at":"2026-07-05T10:03:41.102031+00:00","updated_at":"2026-07-05T10:03:41.102031+00:00"}