# Redis streaming with redis-rs ```json metadata { "title": "Redis streaming with redis-rs", "description": "Implement a Redis event-streaming pipeline in Rust with redis-rs", "categories": ["docs","develop","stack","oss","rs","rc"], "tableOfContents": {"sections":[{"id":"overview","title":"Overview"},{"id":"how-it-works","title":"How it works"},{"children":[{"id":"data-model","title":"Data model"}],"id":"the-event-stream-helper","title":"The event-stream helper"},{"id":"producing-events","title":"Producing events"},{"id":"reading-with-a-consumer-group","title":"Reading with a consumer group"},{"id":"acknowledging-entries","title":"Acknowledging entries"},{"id":"multiple-consumer-groups-one-stream","title":"Multiple consumer groups, one stream"},{"id":"recovering-crashed-consumers-with-xautoclaim","title":"Recovering crashed consumers with XAUTOCLAIM"},{"id":"replay-with-xrange","title":"Replay with XRANGE"},{"id":"the-consumer-worker-task","title":"The consumer worker task"},{"id":"prerequisites","title":"Prerequisites"},{"children":[{"id":"get-the-source-files","title":"Get the source files"},{"id":"start-the-demo-server","title":"Start the demo server"}],"id":"running-the-demo","title":"Running the demo"},{"children":[{"id":"use-one-redis-connection-per-blocking-consumer-in-real-workloads","title":"Use one Redis connection per blocking consumer in real workloads"},{"id":"atomically-reserve-consumer-names-in-the-in-process-registry","title":"Atomically reserve consumer names in the in-process registry"},{"id":"pick-retention-by-length-or-by-minimum-id","title":"Pick retention by length or by minimum ID"},{"id":"dont-let-consumer-group-lag-silently-grow","title":"Don't let consumer-group lag silently grow"},{"id":"make-consumer-logic-idempotent","title":"Make consumer logic idempotent"},{"id":"bound-the-delivery-counter-as-a-poison-pill-signal","title":"Bound the delivery counter as a poison-pill signal"},{"id":"partition-by-tenant-or-entity-for-scale","title":"Partition by tenant or entity for scale"},{"id":"use-a-separate-consumer-pool-per-group","title":"Use a separate consumer pool per group"},{"id":"dont-read-with-xread-no-group-and-then-try-to-ack","title":"Don't read with XREAD (no group) and then try to ack"},{"id":"inspect-the-stream-directly-with-redis-cli","title":"Inspect the stream directly with redis-cli"}],"id":"production-usage","title":"Production usage"},{"id":"learn-more","title":"Learn more"}]} , "codeExamples": [] } ``` This guide shows you how to build a Redis-backed event-streaming pipeline in Rust with the [`redis`](https://crates.io/crates/redis) crate (redis-rs). It includes a small local web server built with `axum` and `tokio` so you can produce events into a single Redis Stream, watch two independent consumer groups read it at their own pace, and recover stuck deliveries with `XAUTOCLAIM` after simulating a consumer crash. ## Overview A Redis Stream is an append-only log of field/value entries with auto-generated, time-ordered IDs. Producers append with [`XADD`](https://redis.io/docs/latest/commands/xadd); consumers belong to *consumer groups* and read with [`XREADGROUP`](https://redis.io/docs/latest/commands/xreadgroup). The group as a whole tracks a single `last-delivered-id` cursor, and each consumer gets its own pending-entries list (PEL) of messages it has been handed but not yet acknowledged. Once a consumer has processed an entry it calls [`XACK`](https://redis.io/docs/latest/commands/xack) to clear the entry from its PEL; entries left unacknowledged past an idle threshold can be reassigned to a healthy consumer with [`XAUTOCLAIM`](https://redis.io/docs/latest/commands/xautoclaim). That gives you: * Ordered, durable history that many independent consumer groups can read at their own pace * At-least-once delivery, with per-consumer pending lists and automatic recovery of crashed consumers * Horizontal scaling within a group — add a consumer and Redis automatically splits the work * Replay of any range with [`XRANGE`](https://redis.io/docs/latest/commands/xrange), independent of consumer-group state * Bounded retention through [`XADD MAXLEN ~`](https://redis.io/docs/latest/commands/xadd) or [`XTRIM MINID ~`](https://redis.io/docs/latest/commands/xtrim), without a separate cleanup job In this example, producers append order events (`order.placed`, `order.paid`, `order.shipped`, `order.cancelled`) to a single stream at `demo:events:orders`. Two consumer groups read the same stream: * **`notifications`** — two consumers (`worker-a`, `worker-b`) sharing the work, modelling a fan-out worker pool. * **`analytics`** — one consumer (`worker-c`) processing the full event flow on its own. ## How it works The flow looks like this: 1. The application calls `stream.produce(event_type, payload).await` which runs [`XADD`](https://redis.io/docs/latest/commands/xadd) with an approximate [`MAXLEN ~`](https://redis.io/docs/latest/commands/xadd) cap. Redis assigns an auto-generated time-ordered ID. 2. Each consumer task loops on [`XREADGROUP`](https://redis.io/docs/latest/commands/xreadgroup) with the special ID `>` (meaning "deliver entries this group has not yet delivered to anyone") and a short block timeout. 3. After processing each entry, the consumer calls [`XACK`](https://redis.io/docs/latest/commands/xack) so Redis can drop it from the group's pending list. 4. If a consumer is killed (or crashes) before acking, its entries sit in the group's PEL. A periodic [`XAUTOCLAIM`](https://redis.io/docs/latest/commands/xautoclaim) sweep reassigns idle entries to a healthy consumer. 5. Anyone — including code outside the consumer groups — can read history with [`XRANGE`](https://redis.io/docs/latest/commands/xrange) without affecting any group's cursor. Each consumer group has its own cursor (`last-delivered-id`) and its own pending list, so the two groups in this demo process the same events without coordinating with each other. ## The event-stream helper The `EventStream` struct wraps the stream operations ([source](https://github.com/redis/docs/blob/main/content/develop/use-cases/streaming/rust/event_stream.rs)): ```rust use redis::aio::ConnectionManager; use redis::Client; use std::collections::HashMap; let client = Client::open("redis://127.0.0.1:6379/")?; let conn = ConnectionManager::new(client).await?; let stream = EventStream::new( conn, "demo:events:orders", // stream key 2000, // approximate MAXLEN guardrail 5000, // XAUTOCLAIM idle threshold (ms) ); // Producer let mut payload = HashMap::new(); payload.insert("order_id".into(), "o-1234".into()); payload.insert("customer".into(), "alice".into()); payload.insert("amount".into(), "49.50".into()); let stream_id = stream.produce("order.placed", payload).await?; // Consumer group + one consumer stream.ensure_group("notifications", "0-0").await?; let entries = stream.consume("notifications", "worker-a", 10, 500).await?; for (entry_id, fields) in entries { handle(&fields); stream.ack("notifications", vec![entry_id]).await?; // XACK } // Recover stuck PEL entries by reaping them into a healthy consumer. // The textbook pattern: each consumer periodically calls XAUTOCLAIM // with itself as the target and processes whatever it claimed. // `ConsumerWorker::reap_idle_pel` wraps that flow; the low-level helper // `stream.autoclaim(group, target, ...)` is also available if you // want to drive XAUTOCLAIM directly. let result = worker_b.reap_idle_pel().await; // result == ReapResult { claimed: N, processed: M, deleted_ids: [...] } // deleted_ids are PEL entries whose payload was already trimmed. // Redis 7+ has already removed those slots from the PEL, so no XACK // is needed — log them and route to a dead-letter store for audit. // Replay history (independent of any group's cursor) for (entry_id, fields) in stream.replay("-", "+", 50).await? { println!("{} {:?}", entry_id, fields); } ``` ### Data model Each event is a single stream entry — a flat map of field/value strings — with an auto-generated time-ordered ID: ```text demo:events:orders 1716998413541-0 type=order.placed order_id=o-1234 customer=alice amount=49.50 ts_ms=... 1716998413542-0 type=order.paid order_id=o-1234 customer=alice amount=49.50 ts_ms=... 1716998413542-1 type=order.shipped order_id=o-1235 customer=bob amount=12.00 ts_ms=... ... ``` The ID is `{milliseconds}-{sequence}`, monotonically increasing within the stream, so you can range-query by approximate wall-clock time without an extra index. (IDs are ordered within a stream, not across streams — two events appended to different streams at the same millisecond can produce the same ID.) The implementation uses: * [`XADD ... MAXLEN ~ n`](https://redis.io/docs/latest/commands/xadd), pipelined, for batch production with a retention cap * [`XREADGROUP`](https://redis.io/docs/latest/commands/xreadgroup) with the special ID `>` for fresh deliveries to a consumer * [`XACK`](https://redis.io/docs/latest/commands/xack) on every processed entry * [`XAUTOCLAIM`](https://redis.io/docs/latest/commands/xautoclaim) for sweeping idle pending entries to a healthy consumer * [`XRANGE`](https://redis.io/docs/latest/commands/xrange) for replay and audit * [`XPENDING`](https://redis.io/docs/latest/commands/xpending) for inspecting the per-group pending list * [`XINFO STREAM`](https://redis.io/docs/latest/commands/xinfo-stream), [`XINFO GROUPS`](https://redis.io/docs/latest/commands/xinfo-groups), and [`XINFO CONSUMERS`](https://redis.io/docs/latest/commands/xinfo-consumers) for surface-level observability * [`XTRIM`](https://redis.io/docs/latest/commands/xtrim) for explicit retention enforcement ## Producing events `produce_batch` pipelines `XADD` calls in a single round trip. Each call carries an approximate `MAXLEN ~` cap so the stream stays bounded as it rolls forward: ```rust pub async fn produce_batch( &self, events: Vec<(String, HashMap)>, ) -> RedisResult> { if events.is_empty() { return Ok(Vec::new()); } let mut pipe = redis::pipe(); for (event_type, payload) in &events { let fields = encode_fields(event_type, payload); pipe.cmd("XADD") .arg(&self.stream_key) .arg("MAXLEN") .arg("~") .arg(self.maxlen_approx) .arg("*"); for (k, v) in &fields { pipe.arg(k).arg(v); } } let mut conn = self.conn.clone(); let ids: Vec = pipe.query_async(&mut conn).await?; self.stats .produced_total .fetch_add(ids.len() as u64, Ordering::Relaxed); Ok(ids) } ``` The `~` flavour of `MAXLEN` lets Redis trim at a macro-node boundary, which is much cheaper than exact trimming and is what you want when the cap is a retention *guardrail*, not a hard size constraint. With 300 events produced and `MAXLEN ~ 50`, you might end up with 100 entries left — Redis released the oldest whole macro-node and stopped. The next `XADD` will keep length stable. If you genuinely need an exact cap (rare), use `MAXLEN` without the `~`. The performance difference is significant on busy streams. ## Reading with a consumer group Each consumer in a group runs the same `XREADGROUP` loop. The special ID `>` means "deliver entries this group has not yet delivered to *anyone*": ```rust pub async fn consume( &self, group: &str, consumer: &str, count: usize, block_ms: usize, ) -> RedisResult> { let opts = StreamReadOptions::default() .group(group, consumer) .count(count) .block(block_ms); let mut conn = self.conn.clone(); let reply: Option = conn .xread_options(&[self.stream_key.as_str()], &[">"], &opts) .await?; Ok(flatten_read_reply(reply)) } ``` `block_ms` makes the call efficient even when the stream is idle: the client parks on the server until either an entry arrives or the timeout expires, so consumers don't busy-loop. Reading with an explicit ID like `0-0` instead of `>` does something different — it replays entries already delivered to *this* consumer name (its private PEL). That is the canonical recovery path when the same consumer restarts: catch up on its own pending entries first, then resume reading new ones. ## Acknowledging entries Once the consumer has processed an entry, `XACK` tells Redis it can drop the entry from the group's pending list: ```rust pub async fn ack(&self, group: &str, ids: Vec) -> RedisResult { if ids.is_empty() { return Ok(0); } let mut conn = self.conn.clone(); let n: i64 = conn.xack(&self.stream_key, group, &ids).await?; self.stats.acked_total.fetch_add(n as u64, Ordering::Relaxed); Ok(n) } ``` This is the linchpin of at-least-once delivery: an entry that is never acked stays in the PEL until a claim moves it elsewhere. If your consumer task crashes between processing and ack, the next claim sweep picks the entry back up. The one caveat is retention: `XADD MAXLEN ~` and `XTRIM` can release the entry's *payload* even while its ID is still in the PEL. The next `XAUTOCLAIM` returns those IDs in its `deleted` list and removes them from the PEL inside the same command — the entry cannot be retried, so the caller should log it and route to a dead-letter store for audit. The example handles this explicitly in the autoclaim flow further down. The trade-off is the opposite of pub/sub: a slow or crashed consumer doesn't lose messages, but it does mean your downstream system must be idempotent. If you process an order twice because the first attempt died after the side effect but before the ack, the second attempt must be safe. ## Multiple consumer groups, one stream The big difference between Redis Streams and a job queue is that any number of independent consumer groups can read the same stream. The demo sets up two groups on `demo:events:orders`: ```rust stream.ensure_group("notifications", "0-0").await?; stream.ensure_group("analytics", "0-0").await?; ``` Each group has its own cursor. Producing 5 events results in `notifications` and `analytics` each receiving all 5, with no coordination between them. Within `notifications`, the work is split across `worker-a` and `worker-b`: Redis hands each `XREADGROUP` call whatever entries are not yet delivered to anyone in the group, so adding a second worker doubles throughput without any rebalance logic. The `"0-0"` argument means "deliver everything in the stream from the beginning" — useful in a demo and for fresh groups bootstrapping from history. In production, a brand-new group reading a long-existing stream usually starts at `$` ("only events after this point") and uses [`XRANGE`](https://redis.io/docs/latest/commands/xrange) explicitly if it needs history. ## Recovering crashed consumers with XAUTOCLAIM The demo's "Crash next 3" button tells a chosen consumer to drop its next three deliveries on the floor without acking them — the same effect as a worker process dying mid-message. Those entries stay in the group's PEL with their delivery counter incremented. Once they have been idle for at least `claim_min_idle_ms`, any healthy consumer in the group can rescue them by calling `XAUTOCLAIM` *with itself as the target*. `ConsumerWorker::reap_idle_pel` wraps that pattern ([source](https://github.com/redis/docs/blob/main/content/develop/use-cases/streaming/rust/consumer_worker.rs)): ```rust pub async fn reap_idle_pel(&self) -> ReapResult { let (claimed, deleted) = match self .stream .autoclaim(&self.group, &self.name, 100, "0-0", 10) .await { Ok(v) => v, Err(_) => return ReapResult::default(), }; let mut processed: u64 = 0; for (entry_id, fields) in claimed.iter() { tokio::time::sleep(self.process_latency).await; if self.handle_entry(entry_id.clone(), fields.clone()).await.is_ok() { processed += 1; } } ReapResult { claimed: claimed.len() as u64, processed, deleted_ids: deleted, } } ``` The underlying `stream.autoclaim` helper pages through the group's PEL with `XAUTOCLAIM`'s continuation cursor. redis-rs 0.24 has no typed wrapper for `XAUTOCLAIM`, so the helper builds it from raw `redis::cmd("XAUTOCLAIM")` and decodes the three-element Redis 7+ reply by hand: ```rust pub async fn autoclaim( &self, group: &str, consumer: &str, page_count: usize, start_id: &str, max_pages: usize, ) -> RedisResult<(Vec, Vec)> { let mut claimed_all: Vec = Vec::new(); let mut deleted_all: Vec = Vec::new(); let mut cursor = start_id.to_string(); let mut conn = self.conn.clone(); for _ in 0..max_pages { let raw: Value = redis::cmd("XAUTOCLAIM") .arg(&self.stream_key) .arg(group) .arg(consumer) .arg(self.claim_min_idle_ms) .arg(&cursor) .arg("COUNT") .arg(page_count) .query_async(&mut conn) .await?; let (next_cursor, claimed, deleted) = parse_autoclaim_reply(raw)?; claimed_all.extend(claimed); deleted_all.extend(deleted); if next_cursor == "0-0" { break; } cursor = next_cursor; } Ok((claimed_all, deleted_all)) } ``` A single `XAUTOCLAIM` call scans up to `page_count` PEL entries starting at `start_id`, reassigns the ones idle for at least `min_idle_time` to the named consumer, and returns a continuation cursor in the first slot of the reply. For a full sweep, loop until the cursor returns to `0-0` (with a `max_pages` safety net so one call cannot monopolise a very large PEL). The delivery counter is incremented on every claim — after a few cycles you can use it to spot a *poison-pill* message that crashes every consumer that touches it, and route it to a dead-letter stream so the bad entry stops cycling. (New entries keep flowing past the poison pill — `XREADGROUP >` still delivers fresh work — but the bad entry's repeated reclaim wastes consumer time and keeps the PEL larger than it needs to be.) The `deleted` list contains PEL entry IDs whose stream payload was already trimmed by the time the claim ran (typically because `MAXLEN ~` retention outran a slow consumer). `XAUTOCLAIM` removes those dangling slots from the PEL itself, so the caller does *not* need to `XACK` them — but the entries cannot be retried either, so log and route them to a dead-letter store for offline inspection. Redis 7.0 introduced this third return element; the example requires Redis 7.0+ for that reason. `reap_idle_pel` is the right primitive for the recovery path because it claims and processes in one step: every entry the call returned is now in *this* consumer's PEL, so the same consumer is responsible for processing and acking it. In production each consumer task runs `reap_idle_pel` periodically (every few seconds, on a timer) so a crashed peer's entries never sit invisibly. The demo exposes it as a manual button so you can trigger the reap after waiting for the idle threshold. `XCLAIM` (singular, no auto) does the same thing for a specific list of entry IDs you already have in hand — useful when you want to take ownership of one known stuck entry, or when you need to move a specific consumer's PEL to a peer (the case the demo's "Remove consumer" button handles via `handover_pending`). `XAUTOCLAIM` cannot filter by source consumer, so it cannot be used for a per-consumer handover. ## Replay with XRANGE `XRANGE` reads a slice of history. It is completely independent of any consumer group — no cursors move, no acks happen — so it is safe to call any number of times, from any task: ```rust pub async fn replay( &self, start_id: &str, end_id: &str, count: usize, ) -> RedisResult> { let mut conn = self.conn.clone(); let reply: StreamRangeReply = conn .xrange_count(&self.stream_key, start_id, end_id, count) .await?; Ok(stream_ids_to_entries(reply.ids)) } ``` The special IDs `-` and `+` mean "from the very beginning" and "to the very end". You can also pass real IDs (`1716998413541-0`) or just the millisecond part (`1716998413541`, which Redis interprets as "any entry with this timestamp"). Typical uses: * **Bootstrapping a new projection** — read the entire stream from `-` and build a derived view in another store (a search index, a SQL table, a different cache). Doing this against a consumer group would consume the entries; `XRANGE` lets you do it without disrupting live consumers. * **Auditing recent activity** — read the last few minutes by ID range without touching any group cursor. * **Debugging** — fetch one specific entry by its ID, or a tight range around an incident timestamp, to see exactly what producers wrote. ## The consumer worker task `ConsumerWorker` wraps the `XREADGROUP` → process → `XACK` loop in a spawned tokio task. The main loop reads new entries with `XREADGROUP >`, processes each entry with a small sleep to simulate work, then acks it. If the demo has asked the worker to drop the next *n* deliveries, those entries are recorded as dropped and left in the PEL so `XAUTOCLAIM` can recover them later: ```rust async fn run_loop(self: Arc) { loop { let (stop, paused) = { let inner = self.inner.lock().await; (inner.stop, inner.paused) }; if stop { return; } if paused { tokio::time::sleep(Duration::from_millis(50)).await; continue; } let entries: Vec = match self.stream.consume(&self.group, &self.name, 10, 500).await { Ok(v) => v, Err(err) => { eprintln!("[{}/{}] read failed: {}", self.group, self.name, err); tokio::time::sleep(Duration::from_millis(500)).await; continue; } }; for (entry_id, fields) in entries { self.dispatch(entry_id, fields).await; } } } ``` `dispatch` wraps `handle_entry` so an `XACK` failure (a Redis hiccup) logs a "handler error" entry and continues, rather than tearing down the spawned task. Letting a Redis error bubble through `spawn`'s panic boundary would silently halt the consumer while every other entry sat in its PEL waiting for `XAUTOCLAIM`. Recovery of stuck PEL entries — this consumer's, after a restart, or another consumer's, after a crash — runs through a separate `reap_idle_pel` method rather than the read loop. That method calls `XAUTOCLAIM` with this consumer as the target, then processes whatever was claimed in the same flow as new entries. This is the textbook Streams pattern: each consumer is its own reaper, running `XAUTOCLAIM(self)` periodically (or on demand) so a crashed peer's entries never sit invisibly in the PEL. The demo's "XAUTOCLAIM to selected" button calls `reap_idle_pel` on the chosen consumer; in production you would run it from a timer every few seconds. Note that the worker's main read loop deliberately does *not* call `XREADGROUP 0` to drain its own PEL on every iteration. That would re-deliver every pending entry continuously and *reset its idle counter to zero* each time, which would keep crashed entries below the `XAUTOCLAIM` threshold forever. Using `XAUTOCLAIM(self)` as the recovery primitive — which only fires for entries idle longer than `min_idle_time` — avoids that whole class of bug. The pause and crash levers exist only for the demo. A real consumer is just the read-process-ack loop — everything else in this class is instrumentation. ## Prerequisites * Redis 7.0 or later. `XAUTOCLAIM` was added in Redis 6.2, but its reply gained a third element (the list of deleted IDs) in 7.0; the example relies on that shape. * Rust 1.70 or later (stable). * The `redis` crate at version 0.24+, with features `["tokio-comp", "aio", "connection-manager", "streams"]`. The `connection-manager` feature gives `ConnectionManager` for cheap, cloneable, auto-reconnecting connections; `streams` adds the typed reply structs for `XINFO`/`XPENDING`. The `Cargo.toml` for this demo pins all the runtime crates: ```toml [dependencies] redis = { version = "0.24", features = ["tokio-comp", "aio", "connection-manager", "streams"] } tokio = { version = "1", features = ["full"] } axum = "0.7" serde = { version = "1.0", features = ["derive"] } serde_json = "1.0" rand = "0.8" ``` If your Redis server is running elsewhere, start the demo with `--redis-host` and `--redis-port`. ## Running the demo ### Get the source files The demo consists of four files. Download them from the [`rust` source folder](https://github.com/redis/docs/tree/main/content/develop/use-cases/streaming/rust) on GitHub, or grab them with `curl`: ```bash mkdir streaming-demo && cd streaming-demo BASE=https://raw.githubusercontent.com/redis/docs/main/content/develop/use-cases/streaming/rust curl -O $BASE/Cargo.toml curl -O $BASE/event_stream.rs curl -O $BASE/consumer_worker.rs curl -O $BASE/demo_server.rs ``` ### Start the demo server From that directory: ```bash cargo run --release ``` You should see: ```text Deleting any existing data at key 'demo:events:orders' for a clean demo run (pass --no-reset to keep it). Redis streaming demo server listening on http://127.0.0.1:8788 Using Redis at localhost:6379 with stream key 'demo:events:orders' (MAXLEN ~ 2000) Seeded 3 consumer(s) across 2 group(s) ``` By default the demo wipes the configured stream key on startup so each run starts from a clean state. Pass `--no-reset` to keep any existing data at the key (useful when re-running against the same stream to inspect prior state), or `--stream-key ` to point the demo at a different key entirely. Open [http://127.0.0.1:8788](http://127.0.0.1:8788) in a browser. You can: * **Produce** any number of events of a chosen type (or random types). Watch the stream length grow and the tail update. * See each **consumer group**: its `last-delivered-id`, the size of its pending list, and the consumers in it. Each consumer shows its processed count, pending count, and idle time. * **Add or remove** consumers within a group at runtime to see Redis split the work across the new shape. * Click **Crash next 3** on a consumer to drop its next three deliveries — the same effect as a worker process dying after `XREADGROUP` but before `XACK`. Watch the **Pending entries (XPENDING)** panel fill up. * Wait until the idle time exceeds the threshold (default 5000 ms), pick a healthy target consumer, and click **XAUTOCLAIM to selected** — the stuck entries are reassigned and the delivery counter increments. * **Replay (XRANGE)** any range to confirm the full history is independent of consumer-group state. * **XTRIM** with an approximate `MAXLEN` to bound retention. Note that an approximate trim only releases whole macro-nodes — `MAXLEN ~ 50` on a small stream may not delete anything; on a 300-entry stream it typically lands at around 100. * Click **Reset demo** to drop the stream and re-seed the default groups. ## Production usage ### Use one Redis connection per blocking consumer in real workloads `redis-rs`'s `ConnectionManager` wraps a single multiplexed connection. That's the right default for short non-blocking commands — `XADD`, `XACK`, `XPENDING`, `XINFO` — but blocking calls like `XREADGROUP ... BLOCK 500` tie up the server side of the connection for the block duration. If many consumers share one `ConnectionManager`, their `XREADGROUP` calls effectively serialise: while Redis is parked waiting for the first consumer's block to expire (or deliver), the second consumer's request can't even leave the local pipeline. For the demo this is fine — three consumers reading an idle stream produce a steady 1.5s round-trip — but a production deployment with N consumers should hold one `ConnectionManager` per consumer (or per small fan-out) so the block windows don't fight each other. ### Atomically reserve consumer names in the in-process registry The demo keeps an in-process registry of `(group, name) → ConsumerWorker` so the HTTP routes can find a worker by name, route a "crash next 3" request to it, and move its PEL on remove. Two concurrent `add-worker` requests with the same name must produce **one** success and **one** "already exists" error — not two registry entries with one orphaned. Because the registry is mutated from inside `async` HTTP handlers, the duplicate-check has to be atomic against any concurrent caller. The pitfall here is that `std::sync::Mutex` is `!Send` and so cannot be held across `.await`; the natural "check the map → release the lock → spawn the worker → re-acquire and insert" structure leaves a window where two callers can both pass the check and both insert. The demo uses a `tokio::sync::Mutex` instead and holds it across the whole reservation + spawn sequence: ```rust async fn add_worker(self: &Arc, group: &str, name: &str) -> bool { let key: WorkerKey = (group.to_string(), name.to_string()); let mut guard = self.workers.lock().await; if guard.contains_key(&key) { return false; } let _ = self.stream.ensure_group(group, "0-0").await; let worker = ConsumerWorker::new(self.stream.clone(), group, name); worker.start().await; guard.insert(key, worker); true } ``` `tokio::sync::Mutex` is `Send`, so the compiler is happy to keep the guard alive across `.await`. The result is that the name is reserved, the worker is spawned, and the insert lands while no other caller can race in. A second concurrent call with the same name waits on the lock, sees the entry, and returns `false`. ### Pick retention by length or by minimum ID The demo uses `MAXLEN ~` on every `XADD`. Two alternatives are worth considering: * `MINID ~ ` — keep only entries newer than an ID. If you want "the last 24 hours", compute the wall-clock cutoff and call `stream.trim_minid("-0").await?`. This is the right pattern when retention is time-bounded. * No cap on `XADD` plus a periodic `XTRIM` task — useful if your producer is hot and the per-`XADD` work has to stay minimal, or if retention rules are complex (a separate task can also factor in consumer-group lag). In all three cases the trimming is approximate by default. Use exact trimming (`MAXLEN n` or `MINID id` without `~`) only when you genuinely need an exact count. ### Don't let consumer-group lag silently grow `XINFO GROUPS` reports each group's `lag` (entries the group has not yet read) and `pending` (entries delivered but not acked). In production, alert on either of these crossing a threshold — a steadily growing pending count usually means consumers are crashing without `XAUTOCLAIM` running, and a growing lag means consumers can't keep up with producers. The same applies inside a group: `XINFO CONSUMERS` reports per-consumer pending counts and idle times, so you can spot one slow consumer holding entries that the rest of the group is waiting on. ### Make consumer logic idempotent `XAUTOCLAIM` can re-deliver an entry to a different consumer after a crash. If your processing has side effects (sending email, charging a card, updating a downstream store), make sure the same entry processed twice gives the same result — use an idempotency key, an upsert with conditional check, or a once-per-id guard table. Redis Streams cannot give you exactly-once semantics on its own. ### Bound the delivery counter as a poison-pill signal `XPENDING` returns each entry's delivery count, incremented on every claim. If an entry has been delivered (and dropped) several times, the next consumer is unlikely to fare better. After some threshold — `deliveries >= 5`, say — route the entry to a *dead-letter stream*, ack it on the original group, and alert. New entries keep flowing past a poison pill (`XREADGROUP >` still delivers fresh work), but the bad entry's repeated reclaim wastes consumer time and keeps the PEL bigger than it needs to be — without a DLQ threshold it can also slowly trip retention/lag alerts. ### Partition by tenant or entity for scale A single Redis Stream is a single key, and on a Redis Cluster a single key lives on a single shard. If your throughput exceeds what one shard can handle, partition the stream — for example by tenant ID (`events:orders:{tenant_a}`, `events:orders:{tenant_b}`) — so different tenants land on different shards. Hash-tags (`{tenant_a}`) keep all related streams on the same shard if you need to multi-stream atomically. Per-entity partitioning (`events:order:{order_id}`) is the canonical pattern when you treat each entity's stream as the event-sourcing log for that entity: every state change for one order goes on its own stream, which is also bounded in size by the entity's lifetime. ### Use a separate consumer pool per group The demo runs every consumer in one process. In production each consumer group is usually its own deployment — its own pool of pods or VMs — so a slow projection in `analytics` cannot pull `notifications` workers off their stream. Each pod runs one consumer task per CPU core, with `XAUTOCLAIM` either embedded in the consumer loop (every N reads, claim idle entries to self) or run by a separate reaper task. ### Don't read with XREAD (no group) and then try to ack `XREAD` and `XREADGROUP` are different mechanisms. `XREAD` is a tail-the-log read with no consumer-group state — entries are not added to any PEL, and you cannot `XACK` them. If you want at-least-once delivery and crash recovery, you must read through a consumer group. `XREAD` is still useful for read-only tail clients (a UI streaming events, a debugger, a `tail -f`-style command-line tool). It's just not part of the at-least-once path. ### Inspect the stream directly with redis-cli When testing or troubleshooting, inspect the stream directly to confirm the consumer state is what you expect: ```bash # Stream summary redis-cli XLEN demo:events:orders redis-cli XINFO STREAM demo:events:orders # Group cursors and pending counts redis-cli XINFO GROUPS demo:events:orders # Consumers within a group redis-cli XINFO CONSUMERS demo:events:orders notifications # Pending entries with idle time and delivery count redis-cli XPENDING demo:events:orders notifications - + 20 # Tail the stream live (no consumer-group state — like tail -f) redis-cli XREAD BLOCK 0 STREAMS demo:events:orders '$' # Replay a range redis-cli XRANGE demo:events:orders - + COUNT 50 ``` If a group's `lag` is growing while consumers' `idle` times are short, consumers are healthy but producers are outpacing them — add more consumers. If `pending` is growing while `lag` is small, consumers are *receiving* entries but not *acking* them — either they are crashing mid-message or your acking logic has a bug. ## Learn more This example uses the following Redis commands: * [`XADD`](https://redis.io/docs/latest/commands/xadd) to append an event with an approximate `MAXLEN` cap. * [`XREADGROUP`](https://redis.io/docs/latest/commands/xreadgroup) to read new entries for a consumer in a group. * [`XACK`](https://redis.io/docs/latest/commands/xack) to acknowledge a processed entry. * [`XAUTOCLAIM`](https://redis.io/docs/latest/commands/xautoclaim) to reassign idle pending entries to a healthy consumer. * [`XCLAIM`](https://redis.io/docs/latest/commands/xclaim) to take ownership of a specific list of pending entry IDs by hand (used by `handover_pending` to move a leaving consumer's PEL to a peer, since `XAUTOCLAIM` has no source-consumer filter). * [`XRANGE`](https://redis.io/docs/latest/commands/xrange) for replay and audit, independent of consumer-group state. * [`XPENDING`](https://redis.io/docs/latest/commands/xpending) to inspect the per-group pending list with idle times and delivery counts. * [`XTRIM`](https://redis.io/docs/latest/commands/xtrim) for explicit retention enforcement. * [`XGROUP CREATE`](https://redis.io/docs/latest/commands/xgroup-create) and [`XGROUP DELCONSUMER`](https://redis.io/docs/latest/commands/xgroup-delconsumer) to manage groups and consumers. * [`XINFO STREAM`](https://redis.io/docs/latest/commands/xinfo-stream), [`XINFO GROUPS`](https://redis.io/docs/latest/commands/xinfo-groups), and [`XINFO CONSUMERS`](https://redis.io/docs/latest/commands/xinfo-consumers) for observability. See the [`redis-rs` documentation](https://docs.rs/redis/) for the full client reference, and the [Streams overview](https://redis.io/docs/latest/develop/data-types/streams) for the deeper conceptual model — consumer groups, the PEL, claim semantics, capped streams, and the differences with Kafka partitions.