Performant Byzantine Fault Tolerant State Machine Replication (BFT SMR) in Rust.
ssbc/ssb-server
The gossip and replication server for Secure Scuttlebutt - a distributed social network
rumqttc - Rust
A pure rust MQTT client which strives to be robust, efficient and easy to use. This library is backed by an async (tokio) eventloop which handles all the robustness and and efficiency parts of MQTT but naturally fits into both sync and async worlds as we’ll see
Pretty State Machine Patterns in Rust
A computer scientist working in open source towards a more hopeful future.
Announcing Rust 1.96.1 | Rust Blog
Empowering everyone to build reliable and efficient software.
Announcing Topcoat: a framework for building full-stack reactive web apps with Rust | Tokio - An asynchronous Rust runtime
Tokio is a runtime for writing reliable asynchronous applications with Rust. It provides async I/O, networking, scheduling, timers, and more.
Spirallex/rust-pds
Single-binary AT Protocol PDS in Rust (macOS) + device-portable stelyph-core that runs on-device in iOS. Self-hosted Bluesky federation.
Async: What is blocking? – Alice Ryhl
The async/await feature in Rust is implemented using a mechanism known as cooperative scheduling, and this has some important consequences for people who write asynchronous Rust code.
Zero-copy Protobuf and ConnectRPC for Rust
As part of my work at Anthropic, I open sourced two Rust crates that fill a gap in the RPC ecosystem: buffa, a pure-Rust Protocol Buffers…
An early look at tailscale-rs, a tsnet library in Rust
We've launched an experimental Rust library for Tailscale via tsnet. Help test tailscale-rs and shape it with your feedback.
Conflict-Free Replicated Data Types
Replicating data under Eventual Consistency (EC) allows any replica to accept updates without remote synchronisation. This ensures performance and scalability in large-scale distributed systems (e.g., clouds). However, published EC approaches are ad-hoc and error-prone. Under a formal Strong Eventual Consistency (SEC) model, we study sufficient conditions for convergence. A data type that satisfies these conditions is called a Conflict-free Replicated Data Type (CRDT). Replicas of any CRDT are guaranteed to converge in a self-stabilising manner, despite any number of failures. This paper formalises two popular approaches (state- and operation-based) and their relevant sufficient conditions. We study a number of useful CRDTs, such as sets with clean semantics, supporting both add and remove operations, and consider in depth the more complex Graph data type. CRDT types can be composed to develop large-scale distributed applications, and have interesting theoretical properties.
copyleftdev/zgrok
Self-hosted ngrok alternative in Rust. Development in progress - check out the issues for detailed specs.