{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y5CNAR6EK7ZFTWQIM7V3SRAUI2","short_pith_number":"pith:Y5CNAR6E","schema_version":"1.0","canonical_sha256":"c744d047c457f259da0867ebb944144685cceeb0dbf14f022979b1b107b2b188","source":{"kind":"arxiv","id":"1807.04938","version":3},"attestation_state":"computed","paper":{"title":"The latest gossip on BFT consensus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ethan Buchman, Jae Kwon, Zarko Milosevic","submitted_at":"2018-07-13T06:53:53Z","abstract_excerpt":"The paper presents Tendermint, a new protocol for ordering events in a distributed network under adversarial conditions. More commonly known as Byzantine Fault Tolerant (BFT) consensus or atomic broadcast, the problem has attracted significant attention in recent years due to the widespread success of blockchain-based digital currencies, such as Bitcoin and Ethereum, which successfully solved the problem in a public setting without a central authority. Tendermint modernizes classic academic work on the subject and simplifies the design of the BFT algorithm by relying on a peer-to-peer gossip p"},"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":"1807.04938","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-07-13T06:53:53Z","cross_cats_sorted":[],"title_canon_sha256":"af1aa679da8e40253a4ba48caeb21f56f03d556d11b74f9111ab31a576169130","abstract_canon_sha256":"b1bfdc7c8936c99257ac8006be948dff072f34aec551b045aef4da2470c4b0b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:21:04.882493Z","signature_b64":"clkfUH01n9vZ9wz6bJ5v0iWr904Ee6prKQJtyEtyOlMMoWUC7HDlGyV/AmTQkiQgmRi7vEvC4CXdDKsfSee+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c744d047c457f259da0867ebb944144685cceeb0dbf14f022979b1b107b2b188","last_reissued_at":"2026-07-05T00:21:04.882083Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:21:04.882083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The latest gossip on BFT consensus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ethan Buchman, Jae Kwon, Zarko Milosevic","submitted_at":"2018-07-13T06:53:53Z","abstract_excerpt":"The paper presents Tendermint, a new protocol for ordering events in a distributed network under adversarial conditions. More commonly known as Byzantine Fault Tolerant (BFT) consensus or atomic broadcast, the problem has attracted significant attention in recent years due to the widespread success of blockchain-based digital currencies, such as Bitcoin and Ethereum, which successfully solved the problem in a public setting without a central authority. Tendermint modernizes classic academic work on the subject and simplifies the design of the BFT algorithm by relying on a peer-to-peer gossip p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04938","kind":"arxiv","version":3},"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/1807.04938/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":"1807.04938","created_at":"2026-07-05T00:21:04.882137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04938v3","created_at":"2026-07-05T00:21:04.882137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04938","created_at":"2026-07-05T00:21:04.882137+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5CNAR6EK7ZF","created_at":"2026-07-05T00:21:04.882137+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5CNAR6EK7ZFTWQI","created_at":"2026-07-05T00:21:04.882137+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5CNAR6E","created_at":"2026-07-05T00:21:04.882137+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04687","citing_title":"Clownfish: Scaling DAG-based BFT Consensus via Sparse Edges","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03754","citing_title":"Fast TetraBFT: Optimizing Latency Where It Matters","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23677","citing_title":"AMP: Arc Multi-Proposer Protocol with Bounded Inclusion Guarantees","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2408.01896","citing_title":"Bitcoin Staking","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2410.12755","citing_title":"Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2503.16783","citing_title":"CoBRA: A Universal Strategyproof Confirmation Protocol for Quorum-based Proof-of-Stake Blockchains","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2512.21137","citing_title":"Declarative distributed algorithms as axiomatic theories in three-valued modal logic over semitopologies","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12364","citing_title":"Attacks and Mitigations for Distributed Governance of Agentic AI under Byzantine Adversaries","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27659","citing_title":"Back to the Future: Rethinking Endorsement in Order-Execute Blockchains","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08132","citing_title":"OrbitBFT: Enabling Scalable and Robust BFT Consensus in LEO Constellations","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05559","citing_title":"Adversarial procurement in blockchains","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y5CNAR6EK7ZFTWQIM7V3SRAUI2","json":"https://pith.science/pith/Y5CNAR6EK7ZFTWQIM7V3SRAUI2.json","graph_json":"https://pith.science/api/pith-number/Y5CNAR6EK7ZFTWQIM7V3SRAUI2/graph.json","events_json":"https://pith.science/api/pith-number/Y5CNAR6EK7ZFTWQIM7V3SRAUI2/events.json","paper":"https://pith.science/paper/Y5CNAR6E"},"agent_actions":{"view_html":"https://pith.science/pith/Y5CNAR6EK7ZFTWQIM7V3SRAUI2","download_json":"https://pith.science/pith/Y5CNAR6EK7ZFTWQIM7V3SRAUI2.json","view_paper":"https://pith.science/paper/Y5CNAR6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04938&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5CNAR6EK7ZFTWQIM7V3SRAUI2/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5CNAR6EK7ZFTWQIM7V3SRAUI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5CNAR6EK7ZFTWQIM7V3SRAUI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5CNAR6EK7ZFTWQIM7V3SRAUI2/action/storage_attestation","attest_author":"https://pith.science/pith/Y5CNAR6EK7ZFTWQIM7V3SRAUI2/action/author_attestation","sign_citation":"https://pith.science/pith/Y5CNAR6EK7ZFTWQIM7V3SRAUI2/action/citation_signature","submit_replication":"https://pith.science/pith/Y5CNAR6EK7ZFTWQIM7V3SRAUI2/action/replication_record"}},"created_at":"2026-07-05T00:21:04.882137+00:00","updated_at":"2026-07-05T00:21:04.882137+00:00"}