Pith. sign in

REVIEW 1 cited by

Certifying Safety when Implementing Consensus

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.03501 v1 pith:2DIN2OFF submitted 2019-03-08 cs.DC cs.PL

Certifying Safety when Implementing Consensus

classification cs.DC cs.PL
keywords certifyconsensusdistributedimplementationsprotocolsafetysystemadditional
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

Ensuring the correctness of distributed system implementations remains a challenging and largely unaddressed problem. In this paper we present a protocol that can be used to certify the safety of consensus implementations. Our proposed protocol is efficient both in terms of the number of additional messages sent and their size, and is designed to operate correctly in the presence of $n-1$ nodes failing in an $n$ node distributed system (assuming fail-stop failures). We also comment on how our construction might be generalized to certify other protocols and invariants.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Federated Learning Architecture: Data Privacy and System Security Approaches

    cs.CR 2026-07 conditional novelty 2.5

    CKKS plus differential privacy in FedAvg yields usable accuracy on Framingham, Pima, and Bank Marketing, with larger privacy budget growth as clients increase and data shrinks.