{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SI3L6YEKI6KAJWTWPPTWQLHIST","short_pith_number":"pith:SI3L6YEK","schema_version":"1.0","canonical_sha256":"9236bf608a479404da767be7682ce894dffaae1a3b0610ad0260ba286bfc20a6","source":{"kind":"arxiv","id":"1905.04867","version":1},"attestation_state":"computed","paper":{"title":"ONLAY: Online Layering for scalable asynchronous BFT system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andre Cronje, Quan Nguyen","submitted_at":"2019-05-13T05:30:29Z","abstract_excerpt":"This paper presents a new framework, namely \\emph{\\onlay}, for scalable asynchronous distributed systems. In this framework, we propose a consensus protocol $L_{\\phi}$, which is based on the Lachesis protocol~\\cite{lachesis01}. At the core of $L_{\\phi}$ protocol, it introduces to use layering algorithm to achieve practical Byzantine fault tolerance (pBFT) in leaderless asynchronous Directed Acyclic Graph (DAG). Further, we present new online layering algorithms for the evolutionary DAGs across the nodes. Our new protocol achieves determistic scalable consensus in asynchronous pBFT by using ass"},"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":"1905.04867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-13T05:30:29Z","cross_cats_sorted":[],"title_canon_sha256":"3ca3cdb1c3b0b3c512f4bcde7cfb89892d5f0db50978b7999524dfb001077743","abstract_canon_sha256":"670cd50b21cfb888c536ef1037ba385cdf599a1d0aa4ba8afb5c35d54942906c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:23.263023Z","signature_b64":"9wx5aJuF5uAq7pfo8/9eCKLQFXowcF78dhiXMukQw2eKeRr12qMywEYpdGLemuhf7qCXcebF2IkgMKmpPUlvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9236bf608a479404da767be7682ce894dffaae1a3b0610ad0260ba286bfc20a6","last_reissued_at":"2026-05-17T23:46:23.262387Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:23.262387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ONLAY: Online Layering for scalable asynchronous BFT system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andre Cronje, Quan Nguyen","submitted_at":"2019-05-13T05:30:29Z","abstract_excerpt":"This paper presents a new framework, namely \\emph{\\onlay}, for scalable asynchronous distributed systems. In this framework, we propose a consensus protocol $L_{\\phi}$, which is based on the Lachesis protocol~\\cite{lachesis01}. At the core of $L_{\\phi}$ protocol, it introduces to use layering algorithm to achieve practical Byzantine fault tolerance (pBFT) in leaderless asynchronous Directed Acyclic Graph (DAG). Further, we present new online layering algorithms for the evolutionary DAGs across the nodes. Our new protocol achieves determistic scalable consensus in asynchronous pBFT by using ass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04867","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":""},"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":"1905.04867","created_at":"2026-05-17T23:46:23.262483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04867v1","created_at":"2026-05-17T23:46:23.262483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04867","created_at":"2026-05-17T23:46:23.262483+00:00"},{"alias_kind":"pith_short_12","alias_value":"SI3L6YEKI6KA","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SI3L6YEKI6KAJWTW","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SI3L6YEK","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.03655","citing_title":"StakeDag: Stake-based Consensus For Scalable Trustless Systems","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST","json":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST.json","graph_json":"https://pith.science/api/pith-number/SI3L6YEKI6KAJWTWPPTWQLHIST/graph.json","events_json":"https://pith.science/api/pith-number/SI3L6YEKI6KAJWTWPPTWQLHIST/events.json","paper":"https://pith.science/paper/SI3L6YEK"},"agent_actions":{"view_html":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST","download_json":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST.json","view_paper":"https://pith.science/paper/SI3L6YEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04867&json=true","fetch_graph":"https://pith.science/api/pith-number/SI3L6YEKI6KAJWTWPPTWQLHIST/graph.json","fetch_events":"https://pith.science/api/pith-number/SI3L6YEKI6KAJWTWPPTWQLHIST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/action/storage_attestation","attest_author":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/action/author_attestation","sign_citation":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/action/citation_signature","submit_replication":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/action/replication_record"}},"created_at":"2026-05-17T23:46:23.262483+00:00","updated_at":"2026-05-17T23:46:23.262483+00:00"}