{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TN37YFTZM3DEHT66TFFUCW65W3","short_pith_number":"pith:TN37YFTZ","schema_version":"1.0","canonical_sha256":"9b77fc167966c643cfde994b415bddb6c965f59eb82381c0621d5bf396255a86","source":{"kind":"arxiv","id":"2108.01900","version":1},"attestation_state":"computed","paper":{"title":"Lachesis: Scalable Asynchronous BFT on DAG Streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Guzev, Andre Cronje, Egor Lysenko, Michael Kong, Quan Nguyen","submitted_at":"2021-08-04T08:21:28Z","abstract_excerpt":"This paper consolidates the core technologies and key concepts of our novel Lachesis consensus protocol and Fantom Opera platform, which is permissionless, leaderless and EVM compatible.\n  We introduce our new protocol, so-called Lachesis, for distributed networks achieving Byzantine fault tolerance (BFT)~\\cite{lachesis01}. Each node in Lachesis protocol operates on a local block DAG, namely \\emph{OPERA DAG}. Aiming for a low time to finality (TTF) for transactions, our general model considers DAG streams of high speed but asynchronous events. We integrate Proof-of-Stake (PoS) into a DAG model"},"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":"2108.01900","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-08-04T08:21:28Z","cross_cats_sorted":[],"title_canon_sha256":"74f0c799e7cbc44c54e0106d0e6b7ccad57fa39ded8b22f1e9ad8ac58c1c7788","abstract_canon_sha256":"5d264b592dcc38919d1ec267c8e5d32a6c54fd9c85bdd8e5b845d074a4daee9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:03:12.164334Z","signature_b64":"tm0QqUMV0aOplsM5ucKOnUBio/PsSQ0L6OF6YfITz7iT1XM+wQXwsOBWO95lnnVcnn5M8I3ZttivoHHe+reUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b77fc167966c643cfde994b415bddb6c965f59eb82381c0621d5bf396255a86","last_reissued_at":"2026-07-05T03:03:12.163920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:03:12.163920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lachesis: Scalable Asynchronous BFT on DAG Streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Guzev, Andre Cronje, Egor Lysenko, Michael Kong, Quan Nguyen","submitted_at":"2021-08-04T08:21:28Z","abstract_excerpt":"This paper consolidates the core technologies and key concepts of our novel Lachesis consensus protocol and Fantom Opera platform, which is permissionless, leaderless and EVM compatible.\n  We introduce our new protocol, so-called Lachesis, for distributed networks achieving Byzantine fault tolerance (BFT)~\\cite{lachesis01}. Each node in Lachesis protocol operates on a local block DAG, namely \\emph{OPERA DAG}. Aiming for a low time to finality (TTF) for transactions, our general model considers DAG streams of high speed but asynchronous events. We integrate Proof-of-Stake (PoS) into a DAG model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.01900","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/2108.01900/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":"2108.01900","created_at":"2026-07-05T03:03:12.163977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.01900v1","created_at":"2026-07-05T03:03:12.163977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.01900","created_at":"2026-07-05T03:03:12.163977+00:00"},{"alias_kind":"pith_short_12","alias_value":"TN37YFTZM3DE","created_at":"2026-07-05T03:03:12.163977+00:00"},{"alias_kind":"pith_short_16","alias_value":"TN37YFTZM3DEHT66","created_at":"2026-07-05T03:03:12.163977+00:00"},{"alias_kind":"pith_short_8","alias_value":"TN37YFTZ","created_at":"2026-07-05T03:03:12.163977+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":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TN37YFTZM3DEHT66TFFUCW65W3","json":"https://pith.science/pith/TN37YFTZM3DEHT66TFFUCW65W3.json","graph_json":"https://pith.science/api/pith-number/TN37YFTZM3DEHT66TFFUCW65W3/graph.json","events_json":"https://pith.science/api/pith-number/TN37YFTZM3DEHT66TFFUCW65W3/events.json","paper":"https://pith.science/paper/TN37YFTZ"},"agent_actions":{"view_html":"https://pith.science/pith/TN37YFTZM3DEHT66TFFUCW65W3","download_json":"https://pith.science/pith/TN37YFTZM3DEHT66TFFUCW65W3.json","view_paper":"https://pith.science/paper/TN37YFTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.01900&json=true","fetch_graph":"https://pith.science/api/pith-number/TN37YFTZM3DEHT66TFFUCW65W3/graph.json","fetch_events":"https://pith.science/api/pith-number/TN37YFTZM3DEHT66TFFUCW65W3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TN37YFTZM3DEHT66TFFUCW65W3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TN37YFTZM3DEHT66TFFUCW65W3/action/storage_attestation","attest_author":"https://pith.science/pith/TN37YFTZM3DEHT66TFFUCW65W3/action/author_attestation","sign_citation":"https://pith.science/pith/TN37YFTZM3DEHT66TFFUCW65W3/action/citation_signature","submit_replication":"https://pith.science/pith/TN37YFTZM3DEHT66TFFUCW65W3/action/replication_record"}},"created_at":"2026-07-05T03:03:12.163977+00:00","updated_at":"2026-07-05T03:03:12.163977+00:00"}