Skip to content
Open access

Concurrency Control for Large-Scale MLS: A Hybrid Distributed Sequencer for RFC 9420

Sep 2026 · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications · pp. 1-6 · 0 citations · 13 references

TL;DR

A Decentralised MLS Sequencer is proposed, a deployment-compatible overlay that preserves MLS transcript semantics while decentralising commit admission, and it is proved that, under crash faults and eventual synchrony, DMS cannot produce partitioned committed views among honest members that accept valid certificates.

Abstract

Messaging Layer Security (MLS) in RFC 9420 scales cryptographically, but overlapping group-state updates are still committed against a single epoch, and stale attempts must be retried. This is tolerable in small groups but creates avoidable delay and extra fan-out traffic in large, bursty deployments. We propose a Decentralised MLS Sequencer (DMS), a deployment-compatible overlay that preserves MLS transcript semantics while decentralising commit admission. DMS partitions the ratchet tree into leaf clusters, elects short-lived sub-tree sequencers with leases, admits branch-compatible updates locally, and deterministically coalesces them with a timestamp-based optimistic-concurrency-control Meld operator. We prove that, under crash faults and eventual synchrony, DMS cannot produce partitioned committed views among honest members that accept valid certificates, derive message-complexity bounds and a breakeven condition, and evaluate the design in a custom discrete-event simulation up to 10,000 members. DMS removes stale retries in the simulated workload, reduces mean intent-to-synchronisation latency by 24.6% and 59.8% relative to ordinary RFC 9420 sequencing at 5,000 and 10,000 members, respectively, and stays within 0.7–4.5% of a strong centralised batching baseline in control traffic for groups of 1,000–10,000 members.

Read PDF

Similar papers

Preprint Oct 2026

Byzantine-Tolerant Causal Unicast with Constant Message Space Overhead

A novel Byzantine-tolerant causal ordering algorithm that achieves an optimal application message space overhead for point-to-point messages and formally proves that the algorithm guarantees system-wide liveness and satisfies a weakened causal safety abstraction called Congestion-Relaxed Causal Delivery.

Purvi Patel, A. Kshemkalyani · 0 citations
Book Open access Sep 2026

BigBFT: Scaling BFT without Compromising Fault Tolerance via State Sharding

BigBFT is proposed, a BFT transactional store that scales by sharding the state but not the execution, which keeps a single consensus protocol to order transactions globally, while multiple node shards replicate state partitions and process state access in parallel.

Guang-Da Sun, Jia-Lin Li · 0 citations
Open access Sep 2026

PRDCC: PRedictive Deterministic Concurrency Control under High Contention

Deterministic databases present a promising direction for building scalable OLTP systems by establishing a global transaction order prior to execution, thereby eliminating costly runtime coordination overhead. However, existing methods face significant limitations: the Ordering-Constrained protocols strictly commit tra...

Yu Yan, Zhi-Yu Dai, Ze-Kai Lv et al. · 0 citations
Sep 2026

Flamingo: On Load Balancing in DAG-based Consensus Protocols

Distributed data management systems deployed in untrusted environments rely on Byzantine Fault-Tolerant (BFT) consensus protocols to tolerate malicious failures. DAG-based BFT protocols improve throughput by letting validators disseminate transactions concurrently and by scaling execution across multiple workers. Howev...

Zhen Ping Khor, Garvit Gupta, Mohammad Javad Amiri et al. · 0 citations

Cascadia: A Control-Plane-Free Alternative to Hyperconverged AI Infrastructure

We present Cascadia, a system for serving large language models on fleets of commodity Intel AIPCs using their CPU, integrated-GPU, and NPU resources. Every node embeds ingress, scheduling, and execution; inference requests require no dedicated routing control plane. Nodes join a libp2p QUIC mesh using CA-issued ed2551...

Matias Parij, Pawan Paudel, Tate Berenbaum et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.