cs.DC · 2026-08-19 · No. 89

Distributed, Parallel, and Cluster Computing, 2026-08-19.

7 new papers in cs.DC. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

7 entries
  1. 01

    Minimizing Commit Rules for DAG-based Atomic Broadcast

    Petr Kuznetsov, Maxence Perion, Sara Tucci-Piergiovanni

    cs.DC

    A popular class of Byzantine fault-tolerant atomic broadcast protocols rely on directed acyclic graphs (DAGs) that represent causal relations between broadcast messages. Each process applies a protocol-specific \emph{commit rule} on its local DAG to determine which vertices can be delivered in a total order. Intuitively, commit rules that impose fewer conditions on the DAG to order its vertices imply more efficient protocols, as the broadcast...

    arxiv.org/abs/2608.18029 · PDF

  2. 02

    Multivalued Consensus: General Adversaries Require More Communication

    Mose Mizrahi, Roger Wattenhofer

    cs.DC · cs.CR · cs.IT

    We study $n$-party fault-tolerant consensus against general (non-threshold) adversaries. We describe an infinite family $Z_\mathsf{proj}^{n,d}$ of $Q^d$-satisfying $n$-party adversary structures based on finite projective geometry which cause error-free $R$-round protocols for interactive consistency on $L$-bit inputs to require $Ω(Ln^{2+1/d})$ bits of expected communication. Likewise, $Z_\mathsf{proj}^{n,d}$ causes error-free byzantine...

    arxiv.org/abs/2608.17998 · PDF

  3. 03

    Bounded-State Restoration: Decoupling Local Restore Capacity from External LLM State

    Zixuan Li

    cs.DC

    Hierarchical KV-cache systems can retain long-context LLM execution state beyond GPU memory, but retention capacity does not determine the local memory required to make that state executable again. We isolate this second resource as the restoration working set (RWS): the peak local staging state whose lifetimes overlap during restoration. In the pinned upstream LMCache whole-plan path, measured full-reuse points for 1.956, 7.823, and 15.646...

    arxiv.org/abs/2608.17826 · PDF

  4. 04

    Counting in Population Protocols on Graphs

    Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Thorsten Götte, Lukas Hintze, Dominik Kaaser

    cs.DC

    We consider the problem of counting the number of agents in a population protocol where the agents are connected by an underlying graph $G=(V,E)$ with $|V|=n$ nodes. In each step, a random scheduler selects an edge uniformly at random, and the incident nodes make a state transition. As per standard assumptions, agents are identical and anonymous, that is, have no identifiers. To break symmetry, in each interaction one of the agents is...

    arxiv.org/abs/2608.17590 · PDF

  5. 05

    Optimal Adaptive Multi-Valued Byzantine Agreement

    Marc Dufay, Anton Paramonov, Roger Wattenhofer

    cs.DC

    In Byzantine Agreement (BA), $n$ parties, out of which $t$ can be Byzantine, run a distributed protocol to agree on a common valid input. Traditionally, these protocols have a linear latency and quadratic message complexity, making them impractical at a large scale. In their recent work, Constantinescu, Dufay, Paramonov, and Wattenhofer consider the actual number of byzantine parties $f \leq t$ and work toward decoupling the dependency on $n$...

    arxiv.org/abs/2608.17552 · PDF

  6. 06

    Generalizing and accelerating consistency checking for non-transactional distributed storage systems

    Kotikala Raghav, Aman Hassan, Brian Sajeev Kattikat, Patel Jay, RSRS Santhosh, Abhilash Jindal

    cs.DC

    Linearizability checkers check if an operation history, observed by concurrent clients, is linearizable. They are used in testing distributed storage systems, and use the classic Wing-Gong (WG) linearizability checking algorithm. In this paper, we generalize the WG algorithm to make linearizability checkers more versatile: we can check other non-transactional consistency guarantees, like ordered sequential consistency provided by Zookeeper....

    arxiv.org/abs/2608.17388 · PDF

  7. 07

    Brief Announcement: Fair Binding for Hidden-State Authorization in Byzantine SMR

    Arnab Mallick

    cs.DC

    Validated Byzantine SMR assumes that replicas can evaluate the validity of an ordered command. Agent authorization creates a different regime: a command may be valid only relative to a committed policy state that validators cannot reconstruct from the log. A proof that an action was authorized at an old commitment is then only a historical attestation, it does not by itself reserve the hidden resource for later use. We isolate two independent...

    arxiv.org/abs/2608.17349 · PDF

This edition is part of The Daily Abstract — cs.DC archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.