quepaxa
An open-source Rust implementation of QuePaxa (SOSP'23): crash-fault-tolerant consensus whose liveness never depends on timeouts. Any replica can drive any slot; a leader is only a fast path (one round trip), and hedged, randomized proposers keep the log moving when the leader is slow, partitioned or gone.
quepaxa— sans-IO,no_std + alloccore exposing a replicated log of opaque batches. It never touches the network, disk or clock: you feed it events and execute the actions it returns, which makes it deterministic, simulation-tested and embeddable.quepaxa-ffi— stable C ABI (cdylib/staticlib, header incrates/quepaxa-ffi/include/quepaxa.h).examples/kv-tokio— reference runtime: a replicated key-value store over TCP with fsync'd storage, snapshots and a load generator.
Using the core
use Bytes;
use ;
let cfg = new;
let mut replica = new?;
let mut actions = Vecnew;
replica.poll_actions; // after every call, before the next one
// … execute the startup actions (the new incarnation's Persist), then:
replica.propose?;
replica.poll_actions;
for action in actions
Documentation: docs.rs/quepaxa, with a guide in chapters — driving the
replica, durability and
restart,
snapshots, linearizable
reads, membership and
leaders,
tuning and how the protocol
works (also readable in
crates/quepaxa/docs).
Runnable examples: cargo run -p quepaxa --example cluster (three replicas, writes and a
linearizable read), restart (crash recovery, compaction, catching up from a snapshot) and
membership (replacing a member and the leader), all on the in-memory driver in
crates/quepaxa/examples/common.
examples/kv-tokio is a complete networked, fsync'd key-value store. The C ABI
follows the same model: docs.rs/quepaxa-ffi and
crates/quepaxa-ffi/examples/smoke.c.
Guarantees and testing
- Safety under crash-recovery: replies never leave before the state they report is durable (ADR 0002); leaders never reuse their fast-path priority after a restart.
- Linearizable reads through read barriers; commit-time dedup applies each entry once.
- Membership changes through the log (
Replica::propose_reconfiguration), effective 64 slots after they are decided, one at a time; a configurable leader order (Config::leader_order) to put the leader where a majority is closest (design). - Verified by unit and property tests, a deterministic simulator (loss, duplication, reordering, partitions, crash-restart with lost and torn writes, snapshots) with agreement and linearizability oracles, delay-bounded model checking of the real replica, fuzzing, Miri, mutation testing with a ratchet, and seeded-bug canaries that must keep failing. See VERIFICATION.md.
Platforms
Tested natively on Linux, macOS and Windows (x86_64 and aarch64); the C ABI is tested on
Android (emulator) and iOS (simulator); the core builds for wasm32-unknown-unknown and
thumbv7em-none-eabihf. MSRV: Rust 1.89.
Status
Pre-1.0. The wire format, durable format and C ABI may change between minor versions until 1.0 (see the changelog for upgrade notes). Not supported: Byzantine faults, witnesses (vote-only members), automatic latency-based leader tuning. Performance measurements, on disk and in memory: docs/benchmarks.md. Design record: spec, decisions, ADRs.
License
Licensed under either of Apache License, Version 2.0 or MIT license at your option.