Caching for Rust — dual-layer L1/L2, zero-knowledge encryption, multi-backend.
Features · Quick Start · Encryption · Backends · Architecture
Status: beta — CacheKit is in closed beta ahead of 1.0. APIs are stabilising; minor breaking changes may still occur between 0.x releases.
cachekit-rs is the Rust SDK for cachekit.io. Pick an intent preset — minimal, production, secure, or io — and get a pre-configured cache in one call, from bare Redis speed to dual-layer with client-side encryption. Pick secure and bytes never leave your process in plaintext.
| Component | What it does |
|---|---|
| CacheKit | get / set / delete / exists with automatic L1 → L2 layering; with a master key configured, every value is AES-256-GCM encrypted before storage (zero-knowledge) |
| SecureCache | The same encryption as a handle (cache.secure_cache()) that refuses a client without a key |
| Backend | Pluggable trait — cachekit.io SaaS, Redis, Memcached, local File, Cloudflare Workers |
| L1 Cache | In-process moka cache with write-through + backfill |
Tip
For the Python SDK with decorators, see cachekit.
For the low-level compression/encryption primitives, see cachekit-core.
| Feature | Default | Description |
|---|---|---|
cachekitio |
✅ | HTTP backend for api.cachekit.io via reqwest + rustls |
encryption |
✅ | Zero-knowledge AES-256-GCM via cachekit-core. Without it, every builder encryption call (.encryption(), .encryption_with_previous(), .encryption_from_bytes(), .encryption_from_bytes_with_previous()) returns a config error, and so does from_env() with CACHEKIT_MASTER_KEY set |
l1 |
✅ | In-process L1 cache via moka, with stale-while-revalidate (native). Not supported on wasm32-unknown-unknown (compile error: no clock there) |
reliability |
✅ | Retry with backoff + jitter, circuit breaker, backpressure, distributed fill locks (native only) |
redis |
❌ | Redis backend via fred (native only) |
memcached |
❌ | Memcached backend via rust-memcache (native only) |
file |
❌ | Local filesystem backend, byte-compatible with cachekit-py's File backend (native only) |
workers |
❌ | Cloudflare Workers backend via worker |
macros |
❌ | #[cachekit] proc-macro decorator (mints interop/v1 keys) |
tracing |
❌ | tracing events per cache operation and breaker transition — see Observability |
# Defaults: SaaS + encryption + L1
[dependencies]
cachekit-rs = "0.10.0"
# With Redis backend
[dependencies]
cachekit-rs = { version = "0.10.0", features = ["redis"] }
# For Cloudflare Workers (no L1, no Redis)
[dependencies]
cachekit-rs = { version = "0.10.0", default-features = false, features = ["workers", "encryption"] }Warning
Mutually exclusive features:
workers+redis— Workers runtime cannot use fredworkers+l1— moka requires std threads unavailable in wasm32workers+reliability— retry/breaker timers need tokiotime, unavailable in wasm32workers+memcached— Workers runtime has no TCP socketsworkers+file— Workers runtime has no filesystem
l1 is also a compile error on wasm32-unknown-unknown with any feature set: std::time::Instant has no clock there, so building the client would panic. Build for that target with default-features = false, features = ["encryption"] plus your backend feature (workers for cachekit.io); wasm32-wasip1 keeps L1.
One call that names your use case. Each preset returns a pre-configured builder you can still override before .build():
| Preset | When to use | Backend | L1 | Encryption | Reliability¹ | Auto-reconnect² | Default TTL |
|---|---|---|---|---|---|---|---|
CacheKit::minimal(url) |
Development, public data, product catalogs — speed first, no extras | Redis³ | ✅ (no SWR) | ❌ | ❌ | ❌ | 300 s |
CacheKit::production(url) |
User sessions, API responses, production services | Redis³ | ✅ | ❌ | ✅ | ✅ | 600 s |
CacheKit::secure(url, master_key_hex)⁵ |
PII, payments, GDPR/HIPAA-sensitive data — zero-knowledge AES-256-GCM | Redis³ | ✅ | ✅ | ✅ | ✅ | 600 s |
CacheKit::io(api_key)⁴ |
Serverless, edge compute, managed caching without running Redis | cachekit.io | ✅ | ❌ | ✅ | n/a (HTTP) | 3 600 s |
¹ Retry with backoff + jitter, circuit breaker, backpressure — the reliability stack. Requires the default-on reliability feature.
² See the resilience contract below.
³ Requires the redis feature flag; secure also needs the default-on encryption feature.
⁴ Or CacheKit::io_from_env() to read CACHEKIT_API_KEY.
⁵ Or CacheKit::secure_from_env(url) to read CACHEKIT_MASTER_KEY, plus the decrypt-only rotation keys in CACHEKIT_PREVIOUS_MASTER_KEYS (see Key Rotation). Both take the key as a hex string and decode it the same way every CacheKit SDK does, verified against the protocol's shared encryption.json master key input vectors (vendored). Use exactly 32 bytes (64 hex chars, openssl rand -hex 32) — the only length every SDK accepts. Every value read and write on the client is encrypted — plain get / set included — and L1 holds ciphertext.
use cachekit::prelude::*;
#[tokio::main]
async fn main() -> Result<(), CachekitError> {
// Needs the `redis` feature.
let cache = CacheKit::production("redis://localhost:6379").await?
.namespace("api")
.build()?;
cache.set("greeting", &"Hello, world!").await?;
let val: Option<String> = cache.get("greeting").await?;
println!("{val:?}");
Ok(())
}Resilience contract — connection failures, at construction and mid-run:
production/secureauto-reconnect: a dropped connection is re-established with exponential backoff (100 ms → 30 s cap), retrying indefinitely.minimalis fail-fast: a dropped connection is not re-established — every subsequent operation that reaches Redis errors until you rebuild the client. Reads served from a warm L1 entry still return without contacting Redis.- Initial connections fail fast for every Redis preset: a bad URL or unreachable Redis errors immediately at construction, never enters a retry loop.
ioopens no connection at construction: an empty API key fails at construction, while an invalid key or unreachable endpoint surfaces at the first request. secure/secure_from_envvalidate the master key (andsecure_from_envany previous keys) before any Redis connection is attempted — a missing, non-hex or short key, or a malformedCACHEKIT_PREVIOUS_MASTER_KEYS, is a deterministic local error, never masked by (or paying for) network I/O, and never a fallback to plaintext.- Auto-reconnect is connection-level repair, distinct from the per-operation reliability stack (retry, circuit breaker, backpressure) that
production/secure/ioalso enable.minimalhas neither — every failure is yours to handle. - Every Redis command has a 5 s timeout (matching cachekit-py and cachekit-ts), so a stalled or unreachable server returns
BackendErrorKind::Timeoutinstead of hanging.minimalfails after ~5 s.production/secureretry a timeout up to 3 attempts, so one op can take ~15 s before it errors, and those timeouts count toward opening the circuit breaker. Underproduction/secure, a connection that stops answering is also closed and re-established, typically 6-8 s after the stalled command was sent (fred checks every 2 s for a pending reply older than 5 s).
use cachekit::prelude::*;
#[tokio::main]
async fn main() -> Result<(), CachekitError> {
let cache = CacheKit::from_env()?.build()?;
cache.set("greeting", &"Hello, world!").await?;
let val: String = cache.get("greeting").await?.unwrap();
println!("{val}");
Ok(())
}use std::sync::Arc;
use std::time::Duration;
use cachekit::prelude::*;
use cachekit::backend::cachekitio::CachekitIO;
let backend = CachekitIO::builder()
.api_key("ck_live_...")
.build()?;
let cache = CacheKit::builder()
.backend(Arc::new(backend))
.default_ttl(Duration::from_secs(600))
.namespace("myapp")
.l1_capacity(5000)
.build()?;Important
Never hardcode API keys or master keys. Use environment variables or a secrets manager.
On native targets each cachekit.io request attempt times out after 5 s, the
protocol's CACHEKIT_TIMEOUT default and the same as cachekit-py and
cachekit-ts; a write (set, delete) gets 10 s. The timeout covers connect,
TLS and the response, and surfaces as BackendErrorKind::Timeout.
On native targets every request carries the User-Agent cachekit-rs/<version>,
and an idle pooled connection is kept for 390 s (reqwest's default is 90 s).
Cloudflare closes an idle client connection after 400 s, so a request after a
90-390 s pause reuses the open connection instead of paying for a new DNS
lookup, TCP connect and TLS handshake. reqwest's 15 s TCP keepalive keeps NAT
mappings alive while the connection is idle. On Linux and macOS it also drops
a silently dead connection within about 60 s; Windows keeps its own fixed
probe count, so detection there takes about 165 s. On wasm32 the platform's
fetch decides pooling and the User-Agent.
Neither CachekitIO client follows a redirect: a 3xx from the API is a permanent error. On wasm32, use the Workers backend.
Configure a master key — the secure preset, or .encryption() / .encryption_with_previous() / .encryption_from_bytes() / .encryption_from_bytes_with_previous() on any builder — and every value the client reads or writes is encrypted client-side with AES-256-GCM before it reaches any cache layer. get, set, set_with_ttl, interop_get, interop_get_swr and #[cachekit] functions all encrypt; the backend and L1 only ever see ciphertext. delete and exists carry no value.
// Env: CACHEKIT_MASTER_KEY=<64 hex chars>
let cache = CacheKit::secure_from_env("redis://localhost:6379").await?.build()?;
// Encrypt → store (backend and L1 see only ciphertext)
cache.set("user:42:ssn", &"123-45-6789").await?;
// Retrieve → decrypt (transparent to caller)
let ssn: String = cache.get("user:42:ssn").await?.unwrap();
// Same encryption as a handle that errors on a client without a key — for
// code that must never run unencrypted.
let secure = cache.secure_cache()?;┌──────────────┐ ┌──────────────┐ ┌──────────────┐
│ Your Code │────>│ CacheKit │────>│ Backend │
│ │ │ AES-256-GCM │ │ (cachekit.io│
│ plaintext │ │ encrypt / │ │ or Redis) │
│ │<────│ decrypt │<────│ │
└──────────────┘ └──────────────┘ └──────────────┘
L1 stores ciphertext
(zero-knowledge preserved)
Warning
Earlier releases encrypted only through secure_cache(): plain get / set on a client with a key configured read and wrote plaintext. Reading such an entry now returns an Encryption error until it is overwritten, deleted or expires, so delete (or let expire) whatever those calls wrote before you upgrade.
Warning
Earlier releases left the .namespace() prefix out of the AAD. On a client with both encryption and .namespace() configured, reading an entry an earlier release wrote returns an Encryption error, never a miss, on every read until it is overwritten, deleted or expires. Before you upgrade, delete those entries or move to a fresh namespace; waiting out the TTL is not a migration. There is no fallback to the old AAD, because one would keep accepting ciphertext moved between namespaces. Clients without a namespace are unaffected.
Security Properties
| Property | Implementation |
|---|---|
| Encryption | AES-256-GCM (AEAD) via cachekit-core (ring on native, aes-gcm on wasm32) |
| Key Derivation | HKDF-SHA256 — per-tenant cryptographic isolation |
| AAD Binding | The key the client passes to its backend, .namespace() prefix included, bound to ciphertext (prevents substitution between keys and namespaces) |
| Memory Safety | zeroize on drop for all key material |
| L1 Guarantee | L1 stores ciphertext, never plaintext |
| Cache-key path encoding (CWE-22) | Keys are percent-encoded into the CachekitIO request path; the empty key, and a key encoding to a reserved segment (., .., health, ttl, lock), are rejected rather than sent |
Cache-key path encoding (CWE-22): CachekitIO keys are percent-encoded (urlencoding::encode) so a key can only ever address /v1/cache/{key}. The empty key, and a key whose encoded form is one of the five reserved path segments — ., .., health, ttl, lock — are rejected with a permanent error rather than sent (protocol spec/saas-api.md § Cache-Key Path Encoding, rule 2). The empty key encodes to an empty segment, so /v1/cache/{key} becomes /v1/cache/ and /v1/cache/{key}/ttl becomes /v1/cache//ttl, neither of which addresses a stored entry. ./.. are dot segments that reqwest's WHATWG URL parser (rust-url) strips before the request leaves the process (/v1/cache/.. → /v1/); health/ttl/lock are live route tokens (/v1/cache/health is the health endpoint, a trailing ttl/lock selects a sub-resource). Encoding can't neutralise either — WHATWG collapses %2E%2E too — so the SDK refuses rather than emit a request whose path was rewritten. This matches the cachekit-ts twin and is stricter than cachekit-py's older %2E rewrite; none of these is ever a canonical CacheKit key (those are non-empty and contain :), so nothing legitimate is affected. Every other key encodes to the same bytes as cachekit-py; cachekit-ts may leave ! * ' ( ) raw, and every conformant form decodes once to the same key (spec rule 4).
AAD v0x03 wire format:
[version(0x03)][len(4)][tenant_id][len(4)][cache_key][len(4)][format][len(4)][compressed]
Each field is length-prefixed with a 4-byte big-endian u32 to prevent boundary-confusion attacks. Cross-SDK compatible — ciphertext produced by the Python SDK decrypts with the Rust SDK and vice versa.
Is AES hardware-accelerated on this host? cache.secure_cache()?.hardware_acceleration_enabled() (also on EncryptionLayer) forwards cachekit-core's detection. Informational only: ring/aes-gcm pick their implementation independently, so use it to explain secure-cache latency, not to change behaviour. The per-architecture semantics are core's — as of cachekit-core 0.6.0 a runtime AES-NI probe on x86/x86_64, true on every aarch64 build (it tests NEON, which all aarch64 targets enable, not the Crypto Extension — a Raspberry Pi 4, a Cortex-A72 without the Crypto Extension, reports true while running software AES), and false on wasm32.
Rotate the master key without invalidating existing entries: promote the new key to current and keep the old one as a decrypt-only previous key during a grace window (max 3, per the protocol keyring spec). Writes always use the current key; reads attempt the current key first, then each previous key in order. Old entries age out via TTL or re-encrypt on the next write — no bulk re-encryption.
// Env: CACHEKIT_MASTER_KEY=<k2-hex> CACHEKIT_PREVIOUS_MASTER_KEYS=<k1-hex>
let cache = CacheKit::from_env()?.build()?;
// The Redis `secure` preset reads the same two variables:
let cache = CacheKit::secure_from_env("redis://localhost:6379").await?.build()?;
// Or explicitly on the client builder, for any tenant, with hex keys
// (each decodes to at least 32 bytes, as for `.encryption()`):
let cache = CacheKit::builder()
.backend(backend.clone())
.encryption_with_previous(&k2_hex, &[&k1_hex], "tenant")?
.build()?;
// Or with exactly 32 raw bytes per key
// (decoded, never the ASCII of a hex string; any other length is an error):
let cache = CacheKit::builder()
.backend(backend)
.encryption_from_bytes_with_previous(&k2_bytes, &[&k1_bytes], "tenant")?
.build()?;Use exactly 32-byte keys (64 hex chars), the only length every SDK accepts. A longer key that .encryption(hex, tenant) accepted can still be retired: list it as a previous key in .encryption_with_previous() for the same tenant. The env variables always derive for tenant "default", and the raw-bytes method takes only 32-byte keys.
Rotation is forward-only: a retired key is never re-promoted (re-promoting would resume a used AES-GCM nonce budget), and a config listing the current key among the previous keys is rejected at load. For the three-phase zero-miss rollout and compromise response, see the key rotation runbook.
Knowing when to drop the old key. Every read served by a previous key is counted against that key's position; cache.secure_cache()?.previous_key_hits() returns the counts (hits[i] for previous_keys[i], current-key reads not counted, no key material). The signal confirms a grace window has drained; it does not shorten one. Follow the protocol's scheduled-rotation runbook: audit for non-expiring entries, add the incoming key as decrypt-only fleet-wide, then promote it. The clock starts only when the promotion deploy has completed on every instance — a lagging instance still writes under the retiring key and reads it silently as its current key. From then, wait at least the longest TTL in use (including any explicit set_with_ttl values), aggregating counts across every instance (they are per process and reset on restart). Once the retiring key's count has stayed flat over that whole window, every live entry has aged out or been re-encrypted on write, and the key can be dropped from CACHEKIT_PREVIOUS_MASTER_KEYS without a hard cut-over.
Interop mode (interop/v1) lets the Python, TypeScript, and Rust SDKs share cache entries: keys are {namespace}:{operation}:{args_hash} with an explicit operation name (no language-specific function path), and values are plain MessagePack — no envelope, readable by any MessagePack library.
The cross-SDK rules — the opt-in for each SDK, what composes with interop, and the shared-entry contract — are in the Using Interop Mode guide on docs.cachekit.io, with the interop/v1 spec as the normative reference. Both win over this README on any conflict.
use cachekit::interop::{interop_key, InteropValue};
// Every SDK computes this exact key for get_user(42)
let key = interop_key("users", "get_user", &[InteropValue::from(42i64)])?;
cache.set_with_ttl(&key, &user, ttl).await?; // plain MessagePack — already interop
let user: Option<User> = cache.interop_get(&key).await?; // strict read: exactly one documentns and nsapi are reserved as namespaces — the CachekitIO server parses a key starting ns: or nsapi: as namespace-prefixed — so interop_key rejects them with InvalidKey and #[cachekit(namespace = ...)] with a compile error; operations are unaffected. Neither segment may contain .. (a..b is rejected the same two ways; a lone ., as in app.v1, is fine), because the server rejects .. anywhere in a key.
Argument hashing is byte-identical across SDKs (canonical MessagePack + Blake2b-256), verified against the shared protocol test vectors (interop-mode.json, vendored) in this repo's test suite. get and interop_get (also on SecureCache) both read exactly one MessagePack document and reject trailing bytes, so neither silently misreads a Python-internal CK frame as the integer 67; interop_get names the CK frame in its error. Every decode of backend-supplied bytes (get and interop_get alike) first passes a header-only structural walk that rejects, before anything is decoded, a document nested deeper than serializer::MAX_DECODE_DEPTH (100 levels, matching the TypeScript SDK; every collection header counts, empty ones included) or declaring more elements or bytes than the input can back, verified against the protocol's shared decode-bounds.json vectors (vendored) — a forged nested-header entry is a bounded Serialization error, not a memory blow-up or a stack overflow. Encryption works unchanged — interop keys are identical across SDKs, so the AAD verifies cross-SDK. On a client with encryption configured, set_with_ttl stores the AES-GCM ciphertext of that MessagePack and interop_get decrypts it.
Warning
Every service that binds one (namespace, operation) must agree on encryption: on in all of them or off in all of them, with the same master key and tenant_id (decrypt-only previous master keys may differ). If an unencrypted service shares the operation with an encrypted one, values end up stored unencrypted at the shared key: the unencrypted service writes in the clear whenever it fills the entry, and a #[cachekit] function on a client without encryption also replaces ciphertext it cannot decode. See Shared entries are a contract.
Important
Use interop keys on a client without .namespace() — a client prefix would rewrite the storage key to {prefix}:{interop_key}, which no other SDK computes. interop_get fails closed with a config error rather than silently missing; interop keys already carry their own namespace segment. set / set_with_ttl do not fail on a namespaced client: they return Ok and write the entry under {prefix}:{interop_key}, a key no other SDK reads.
Interop mode in production: Skyline — the canonical example project — runs this SDK on wasm32 (Cloudflare Workers) deriving interop keys and verifying payload integrity for the namespace the Python and TypeScript SDKs share (public aggregate reads stay on the TypeScript edge — see the example page).
HTTP backend targeting api.cachekit.io with session tracking, L1 metrics headers, SSRF-safe URL validation, distributed locking, and TTL inspection.
use cachekit::backend::cachekitio::CachekitIO;
let backend = CachekitIO::builder()
.api_key("ck_live_...")
.api_url("https://api.cachekit.io") // optional, this is the default
.build()?;How fresh a cachekit.io read is, and how long a deleted project's data stays readable: Consistency and Deletion.
Native Redis via fred with cluster support, TTL inspection, and distributed locking (SET NX PX acquire, atomic Lua compare-and-delete release, <key>:lock namespace shared with cachekit-py). Each command times out after 5 s with BackendErrorKind::Timeout. A timed-out command may still run on the server: harmless for get/set/delete, and a timed-out lock acquire leaves the lock to expire on its own TTL. Requires the redis feature flag.
cachekit-rs = { version = "0.10.0", features = ["redis"] }use cachekit::backend::redis::RedisBackend;
let backend = RedisBackend::builder()
.url("redis://localhost:6379")
.build()?;
backend.connect().await?; // explicit connect requiredMemcached via rust-memcache (single server, connection-pooled, per-socket timeouts — a hung server errors one operation instead of wedging the backend). Keys are validated against protocol metacharacters (whitespace/control bytes) before anything reaches the wire, keeping the key space identical to cachekit-py's.
TTL capability, precisely: memcached's protocol cannot read a key's remaining TTL, so this backend does not implement TtlInspectable — matching cachekit-py, where Memcached is likewise not TTL-inspectable. Both SDKs do ship a bare refresh_ttl (wrapping the memcached touch command) callable directly on the backend, outside the capability trait — so TTL-refresh works, but TTL-driven features that need to read TTLs never engage on memcached in any SDK.
TTLs above memcached's 30-day ceiling are clamped (larger values would be misread as absolute timestamps); values above the item-size limit (default 1 MiB) fail loudly client-side, and a server-side "object too large" classifies as permanent (never retried). Requires the memcached feature flag.
cachekit-rs = { version = "0.10.0", features = ["memcached"] }use cachekit::backend::memcached::MemcachedBackend;
let backend = MemcachedBackend::builder()
.url("tcp://localhost:11211")
.connect() // eager: verifies the server is reachable
.await?;Local disk cache, byte-compatible with cachekit-py's File backend — a py and an rs process pointed at the same directory read each other's entries (Blake2b-128 hashed filenames, shared 14-byte header, atomic write-then-rename, lazy expiry). An entry whose header carries a nonzero reserved byte or nonzero flags (a transform this reader does not implement) reads as a miss on every path and is never deleted or rewritten, as the protocol requires; an entry with an expiry is expired from that second on. Implements TtlInspectable (TTL read off the on-disk header, in-place refresh). Same-process operations on one key serialize on a striped per-key lock (64 stripes), so a read waits on a write to an unrelated key only when the two share a stripe (about 1 in 64); py serializes all operations on one RLock. Cross-process behaviour matches py: on unix, reads and in-place TTL rewrites take advisory flock while writes stay lock-free via atomic rename; and expired-entry unlinks are inode-validated so a stale read decision doesn't delete a concurrent writer's fresh entry. On unix the cache directory must be owned by you and not group/other-writable. Not yet ported from py: LRU eviction and size caps — the directory grows until entries expire or you clear it. Requires the file feature flag and a tokio runtime (I/O runs via spawn_blocking).
cachekit-rs = { version = "0.10.0", features = ["file"] }use cachekit::backend::file::FileBackend;
let backend = FileBackend::builder()
.cache_dir("/var/cache/myapp") // default: <system temp dir>/cachekit
.build()?;wasm32-unknown-unknown backend using worker::Fetch, with distributed locking and TTL inspection against the SaaS lock/TTL endpoints. It is the CachekitIO backend on wasm32. Requires the workers feature with default features disabled.
cachekit-rs = { version = "0.10.0", default-features = false, features = ["workers", "encryption"] }Custom Backend
Implement the Backend trait to plug in any storage:
use async_trait::async_trait;
use cachekit::backend::{Backend, HealthStatus};
use cachekit::error::BackendError;
use std::time::Duration;
struct MyBackend;
#[async_trait]
impl Backend for MyBackend {
async fn get(&self, key: &str) -> Result<Option<Vec<u8>>, BackendError> { todo!() }
async fn set(&self, key: &str, value: Vec<u8>, ttl: Option<Duration>) -> Result<(), BackendError> { todo!() }
async fn delete(&self, key: &str) -> Result<bool, BackendError> { todo!() }
async fn exists(&self, key: &str) -> Result<bool, BackendError> { todo!() }
async fn health(&self) -> Result<HealthStatus, BackendError> { todo!() }
}Optional extension traits: TtlInspectable (TTL queries), LockableBackend (distributed locking).
When the l1 feature is enabled (default), CacheKit maintains an in-process moka cache in front of the backend:
┌─────────────────────────────────────────────────────────┐
│ CacheKit Client │
├─────────────────────────────────────────────────────────┤
│ │
│ GET path: │
│ L1 fresh hit (~50ns) ──► return immediately │
│ L1 stale hit ──► return + background refresh (SWR) │
│ L1 miss ──► L2 backend ──► backfill L1 if fresh (≤30s) │
│ │
│ SET path: │
│ write to L2 backend ──► write-through to L1 │
│ │
│ DELETE path: │
│ invalidate L1 first ──► delete from L2 backend │
│ │
├─────────────┬───────────────────────────────────────────┤
│ L1 (moka) │ L2 (cachekit.io / Redis / Workers) │
│ ~50ns │ ~2–50ms │
└─────────────┴───────────────────────────────────────────┘
| Behavior | Detail |
|---|---|
| Write-through | set() writes to L2 first, then L1 |
| Backfill on miss | L2 hits populate L1 for at most 30 s. On cachekit.io a shorter X-CacheKit-Fresh-For bounds it further, and a hit labelled stale or with Fresh-For: 0 is not backfilled at all, so the next read goes back to the server |
| Invalidate-first | delete() evicts L1 before touching L2 |
| Encrypted L1 | A client with encryption configured stores ciphertext in L1 (never plaintext) |
| Evict on decrypt failure | A read on an encrypted client that fails decryption drops the key's L1 copy and returns the error; the backend entry is kept, so the next read reaches the backend: a hit once the entry is replaced with ciphertext the client can decrypt, a miss once it expires or is deleted |
| Default capacity | 1,000 entries (configurable via .l1_capacity()) |
| Live counters | cache.stats() reports L1 hits / L2 hits / misses; cache.l1_entry_count() the current occupancy — see Observability |
| Stale-while-revalidate | On by default (native; minimal turns it off): #[cachekit] serves an L1 hit past swr_threshold_ratio × entry TTL (default 0.5, ±10% jitter) immediately and refreshes it in the background — see below |
With SWR (default when l1 is on, native targets), an L1 entry has two phases
before it disappears: fresh until swr_threshold_ratio of its TTL has
elapsed, then stale until hard expiry. A #[cachekit]-wrapped call that
hits a stale entry returns it immediately — no caller ever blocks on a
merely-stale value — while at most one background task re-executes the
function. If the same-key mutation token is still current, the task rewrites
both cache layers and renews L1 hard expiry with the full write-path TTL; if a
newer set() or delete() landed through the same client (or one of its
clones) while the origin ran, that explicit mutation wins and the older
refresh result is discarded before it can touch L2. Entry expiry and capacity
eviction do not invalidate the token, so a valid slow refresh can still
repopulate both layers. Refresh dedup takes the same locks as the cold-miss single-flight
(in-process, plus distributed fill locks on lock-capable backends), so N
concurrent stale readers cost one origin execution — misses are billable;
stampedes are not acceptable. Unlike a cold miss, a refresh never waits for
another worker's fill: if another worker or process already holds the key's
lock, or the lock call fails, the refresh stands down at once without polling or
re-reading the cache, records no miss, and the stale value keeps being served
until hard expiry. A hard-expired entry always takes the normal blocking miss
path: SWR never serves past hard expiry.
let cache = CacheKit::builder()
.backend(backend)
.swr_threshold_ratio(0.25) // stale after 25% of entry TTL (default 0.5)
// .swr_enabled(false) // restore strict expire-or-serve behaviour
.build()?;Semantics mirror cachekit-py (swr_threshold_ratio = elapsed-lifetime
fraction; enabled by default) and cachekit-ts (getWithSwr). Worth knowing:
- The freshness window derives from each entry's own TTL. A backfilled
entry (L2 hit → L1, 30 s cap) goes stale at ~
ratio × 30 s— the cap still bounds staleness of L2-derived data, but SWR replaces its expiry cliff with a background refresh that restores the full write-path TTL. The configured ratio is never silently clamped; the window follows the entry. - The server's freshness bound is a hard limit. When cachekit.io sends a
shorter
X-CacheKit-Fresh-For, the backfilled entry's TTL is that bound, so SWR goes stale at ~ratio × Fresh-Forand never serves the copy past it. Stale-labelled reads are never backfilled, so there is nothing local to serve; the server serves its own stale window. - Refresh completion is version-guarded and same-key ordered. Each L1 stale read receives a mutation token. A concurrent explicit write or delete through that client or a clone invalidates the token, so an older origin result cannot clobber the new value or resurrect the deletion in either layer. The guard is intentionally process-local; cross-instance invalidation is outside SWR's serving-policy scope.
- Jitter is fixed per entry. The ±10% threshold jitter is drawn when an entry is inserted, not on every hit, from a per-thread generator seeded once from OS entropy, so neither hot L1 reads nor inserts make an entropy syscall, and the entry's freshness boundary stays stable for its lifetime.
- The background refresh needs a tokio runtime (
Handle::try_current). On other executors the stale value is still served and the refresh is skipped — behaviourally SWR-off, never a panic. - Refresh failures are absorbed: the stale value keeps serving, a later stale read retries, and once the entry hard-expires the blocking path surfaces errors normally.
- Native only: on wasm32 (
l1is refused onwasm32-unknown-unknown) and underunsyncthere is no SWR; the builder knobs don't exist there, so misuse is a compile error rather than a silent no-op. A sync function under#[cachekit]is likewise a clear compile-time error.
With the reliability feature (default, native only), the production, secure, and io presets wrap every backend operation in a reliability stack; minimal stays bare for maximum throughput:
| Layer | What it does | Defaults |
|---|---|---|
| Retry | Truncated exponential backoff + jitter on transient/timeout errors (BackendErrorKind::is_retryable); permanent and auth errors propagate immediately. Under io, all attempts of one op share a deadline: an attempt still running at it is cancelled with BackendErrorKind::Timeout, and no retry starts past it, so a cachekit.io request that stops answering costs one attempt, not three. Other presets and custom backends get no deadline. A cachekit.io 429 for a spent quota or balance (X-CacheKit-Deny-Reason) is not retried; it stays Transient and counts toward the breaker, so a plain #[cachekit] function fails open while a direct client call returns the error and #[cachekit(secure)] fails closed |
3 attempts, 100 ms base, 5 s cap, jitter ×[0.5, 1.5); io deadline 5 s per read, 10 s per write |
| Circuit breaker | closed → open after N retryable failures in a rolling window; fails fast (BackendErrorKind::CircuitOpen) while open; half-open probes recovery |
threshold 5, window 60 s, open 5 s, 3 probes, close after 3 successes |
| Backpressure | Bounds concurrent backend data ops with a semaphore + bounded waiting queue; over-limit calls are shed with BackendErrorKind::Backpressure before reaching the backend — a slow backend can't exhaust the caller's connection pool or memory |
100 concurrent, 1 000 queued, 100 ms wait (Python SDK parity) |
| Graceful degradation | On outage-class backend failure (transient, timeout, open breaker, backpressure shed), #[cachekit]-wrapped functions run uncached (fail-open); permanent/auth errors propagate — a wrong API key fails loudly. #[cachekit(secure)] paths fail closed on everything — encrypted workloads never silently degrade |
built into the macro |
| Single-flight | Concurrent misses of one key collapse to a single execution: per-key in-process lock, plus a distributed fill lock across processes on lock-capable backends (cachekit.io, Redis) | in-process always on; cross-process 5 s lock, 100 ms polls, and a contested waiter computes once 5 s have passed since its own lock attempt; with l1 on a tokio runtime (never under unsync), a stored fill's unlock is sent without the caller waiting for it; the client's next lock attempt on that key re-sends it if the backend has not answered, and if the caller's runtime is dropped or idle first, the lease can stay held for up to its 5 s timeout |
| Stale-while-revalidate | Stale-but-unexpired L1 hits are served immediately while one single-flight-deduplicated background task re-executes the function (details) | on by default with l1 (native); threshold 0.5 × entry TTL ±10% jitter |
Retry sits inside the breaker (one exhausted retry sequence = one breaker failure) and backpressure sits outside both — one permit per logical operation, held across the whole retry sequence, so retry amplification is bounded and shed calls never skew breaker state. Degradation, single-flight, and SWR sit in the #[cachekit] macro around the read path — the same composition as the TypeScript SDK's ReliabilityExecutor and the Python decorator.
use std::time::Duration;
use cachekit::{CacheKit, ReliabilityConfig, RetryConfig};
// Presets enable it — override or disable per client:
let cache = CacheKit::production("redis://localhost:6379").await?
.reliability(ReliabilityConfig {
retry: Some(RetryConfig { max_attempts: 5, ..RetryConfig::default() }),
..ReliabilityConfig::default()
})
.build()?;
// Opt a preset out: a disabled config applies no wrapping.
let bare = CacheKit::production("redis://localhost:6379").await?
.reliability(ReliabilityConfig::disabled())
.build()?;Requires a tokio runtime for backoff timers (the redis and cachekitio backends already do).
Every client counts its reads, with no configuration:
let stats = cache.stats(); // cachekit::L1Stats — live, shared by all clones
println!(
"L1 {} / L2 {} / miss {} — L1 hit rate {:.1}%",
stats.l1_hits, stats.l2_hits, stats.misses, stats.l1_hit_rate() * 100.0,
);
let occupancy = cache.l1_entry_count(); // Option<u64>: None when L1 is off
let breaker = cache.circuit_state(); // Option<CircuitState>: Closed / Open / HalfOpen| Surface | What you get |
|---|---|
CacheKit::stats() |
L1Stats { l1_hits, l2_hits, misses, l1_enabled } for every value read (get, interop_get, SWR and SecureCache variants). exists and reads that fail with a backend error are not counted. |
CacheKit::l1_entry_count() |
Exact L1 occupancy (runs moka's pending housekeeping first — poll it, don't put it on a hot path). |
CacheKit::circuit_state() |
Live breaker state (reliability feature); None when the client has no breaker. |
| SaaS telemetry headers | The cachekit.io backends send X-CacheKit-L1-Hits / L2-Hits / Misses / L1-Hit-Rate from the same counters, wired automatically by CacheKitBuilder::build(). A .metrics_provider(..) set on the backend builder still takes precedence. One backend instance reports one client — the first built over it; once that client is gone the headers fall back to disabled. |
tracing feature |
One debug event per completed operation, per failed fill-lock call, and per #[cachekit] result the macro could not store, on the cachekit target, and breaker transitions on cachekit::reliability (warn on open, info for half-open / closed). |
With the tracing feature, point your subscriber at the crate:
RUST_LOG=cachekit=debug cargo runDEBUG cachekit: op=get key_hash=bcb35ae6f64fa65b2770ab3af631b1ce outcome=miss
DEBUG cachekit: op=set key_hash=bcb35ae6f64fa65b2770ab3af631b1ce ttl_secs=3600
DEBUG cachekit: op=get key_hash=bcb35ae6f64fa65b2770ab3af631b1ce outcome=l1_hit
WARN cachekit::reliability: circuit breaker opened breaker=1 seq=1 from=Closed to=Open
Fields: op (get | set | delete | lock | unlock), outcome (l1_hit | l1_stale | l2_hit | miss), ttl_secs, existed, and error_kind (transient | timeout | …) on a failed lock or unlock: a fill-lock call skips the circuit breaker, so this event is the only signal of a failing lock endpoint. A #[cachekit] result the macro cannot store is not an error: a cold-miss fill is still returned, and a failed SWR refresh commit is dropped while the stale value keeps being served. An op=set event with error_kind (a backend kind, or serialization | encryption | config | payload-too-large | invalid-key) is the only record, since otherwise the failure shows only as repeat misses or refreshes. Breaker events carry breaker, seq, from, to, and (breaker, seq) is the ordering key: breaker is a process-unique id assigned when the breaker is built (stable for its lifetime, not a key or secret), seq counts that breaker's transitions and is assigned under the breaker lock. Events are emitted after the lock is released (so a subscriber may call circuit_state() safely), which means two transitions can arrive out of order under contention, and several clients in one process each restart seq at 1 — group by breaker, order by seq, never by arrival. For fleet-wide correlation combine the pair with the host/process fields your subscriber adds. Events carry key_hash — Blake2b-128 of the namespaced storage key (cachekit::metrics::key_hash) — never the key itself: keys routinely embed user identifiers (CWE-532). The digest is a correlator, not a redaction: it is unkeyed and deterministic, so it matches the File backend's on-disk filename (a log line names the cache file it touched), and for the same reason a low-entropy key like user:42 can be recovered from it by enumeration. Treat cachekit=debug output with the care you give the keys themselves.
Prometheus exposition and OpenTelemetry spans are deliberately not built in: Rust services bring their own registry and bridge tracing themselves.
| Variable | Required | Description |
|---|---|---|
CACHEKIT_API_KEY |
✅ | API key for cachekit.io (from_env() and CacheKit::io_from_env()) |
CACHEKIT_API_URL |
❌ | Override API endpoint (default: https://api.cachekit.io) |
CACHEKIT_MASTER_KEY |
❌ | Hex-encoded master key for encryption (CacheKit::secure_from_env() and from_env()); use exactly 32 bytes (64 hex chars) — shorter, non-hex or non-UTF-8 values are rejected, never treated as unset |
CACHEKIT_PREVIOUS_MASTER_KEYS |
❌ | Comma-separated hex-encoded decrypt-only previous master keys for key rotation (CacheKit::secure_from_env() and from_env(); max 3; a blank value is treated as unset) |
CACHEKIT_DEFAULT_TTL |
❌ | Default TTL in seconds (min 1, default: 300) |
Caution
CACHEKIT_API_URL must use HTTPS, must not carry credentials, a query or a
fragment, and must not point to a private IP address. All of these are
enforced at configuration time.
cachekit-rs/
├── crates/
│ ├── cachekit/ # Main SDK crate
│ │ └── src/
│ │ ├── lib.rs # Public API + prelude
│ │ ├── client.rs # CacheKit, SecureCache, CacheKitBuilder
│ │ ├── config.rs # CachekitConfig + from_env()
│ │ ├── encryption.rs # AES-256-GCM + AAD v0x03
│ │ ├── error.rs # CachekitError, BackendError
│ │ ├── interop.rs # interop/v1 cross-SDK keys + strict reads
│ │ ├── metrics.rs # Live counters, SaaS telemetry headers, tracing events
│ │ ├── session.rs # SDK session tracking
│ │ ├── url_validator.rs # SSRF-safe URL validation
│ │ ├── serializer/ # MessagePack serialization
│ │ ├── l1/ # moka-based L1 cache (feature = "l1")
│ │ └── backend/
│ │ ├── mod.rs # Backend + TtlInspectable + LockableBackend traits
│ │ ├── cachekitio.rs # cachekit.io HTTP backend
│ │ ├── cachekitio_lock.rs # Distributed locking
│ │ ├── cachekitio_ttl.rs # TTL inspection
│ │ ├── saas_wire.rs # SaaS lock/TTL JSON wire bodies
│ │ ├── redis.rs # Redis backend (feature = "redis")
│ │ └── workers.rs # Workers backend (feature = "workers")
│ │
│ └── cachekit-macros/ # Proc-macro crate
│ └── src/lib.rs # #[cachekit] decorator
│
├── Cargo.toml # Workspace root
└── Makefile # Development commands
make quick-check # fmt + clippy + test (run before every commit)
make security # cargo deny + cargo audit (the CI supply-chain gate)
make test # cargo test --features $(NATIVE_FEATURES) (CI's list; see Makefile)
make build # cargo build --release
make build-wasm # wasm32-unknown-unknown (workers feature)make security runs the same two enforcement commands as the supply-chain
job in .github/workflows/security.yml, with cargo audit in its strictest CI
form (--deny yanked) — so a local pass means a pass on every CI event, with
two asymmetries: the weekly run additionally proves the yank check actually
executed (see the guard in security.yml), so with crates.io unreachable a
local run warns and passes where the weekly run goes red; and the job's final
step, the gate tamper check below, is PR-context-only and has no local
equivalent. It needs
cargo-deny and cargo-audit installed, and it reaches the network to refresh
the RustSec advisory database — which is why it is not folded into
quick-check.
Both tools are required, because they answer different questions. "Fails" below means it turns the check red — anything else is reported but not enforced:
cargo deny --locked --all-features check |
cargo audit |
|
|---|---|---|
| Reads | feature-resolved dependency graph | Cargo.lock verbatim |
| Licence allowlist, banned crates, registry/source policy | fails | not checked |
| Vulnerabilities in crates no enabled feature activates | not seen (pruned) | fails |
Yanked crates in Cargo.lock |
warns (feature-resolved graph only, so lockfile-only crates are missed) | warns on PR and push runs; fails only the weekly scheduled run (--deny yanked) |
| Unsound / unmaintained advisories on transitive deps | not seen — deny.toml narrows unmaintained to workspace; unsound already defaults to that scope |
reports only, does not fail — deliberate (see deny.toml) |
--all-features is load-bearing: the default feature set excludes the
memcached, redis, file and macros backends, so a banned crate
reintroduced behind an optional feature passes a bare cargo deny check.
deny.toml is the policy — notably a hard ban on openssl-sys, native-tls
and toxiproxy_rust, because this SDK is rustls-only. Run make deny before
adding or bumping a dependency.
Two examples measure the client. Neither runs in the test suite, and neither adds a dependency.
CPU cost of the hot path — examples/bench_hot_path.rs drives the public
CacheKit API over an in-memory backend, so it measures the client's own work
(key handling, MessagePack, L1, the reliability stack, AES-256-GCM) and no
network. Cases are l1_hit, l2_hit, set, delete and exists (a warm
key), each plain, with reliability (rel) or with encryption (enc), at
64 B, 1 KiB and 64 KiB.
make bench # wall ns/op: indicative only
make bench-instr # instructions/op + run-to-run spread (needs valgrind)
make bench-instr BASE=../bench-base FILTER=l2_hit # A/B against another buildWall time on a shared machine moves by tens of percent between runs, so
bench-instr is the number a change is judged on. It counts only the timed
loop (--toggle-collect), on a single-threaded tokio runtime, five runs per
case, and reports the median and the spread. For an A/B, build the example at
the base commit, copy target/release/examples/bench_hot_path outside
target/, and pass it as BASE; the runs interleave ABBA, a delta counts only
when it beats max(3 × spread, 0.5%), and the target exits 1 when a case got
slower by more than that, or 2 when it measured nothing (an unknown flag, a
filter that matches no case, a valgrind failure). Most cases repeat within 0.4%; the delete cases
spread more (up to about 2.5%), so their floor is wider.
Client wall time — examples/wall_time_probe.rs times CacheKit calls
against the cachekit.io dev endpoint and writes one JSON object per request. It runs
two arms in one process, interleaved in ABBA blocks, with a new client
(warmed by one GET miss) for every block: sdk is the real
CachekitIO backend, and transport is a copy of it over the same reqwest
configuration that also reads cf-ray, status and time to first byte. Run
sdk,sdk first: the difference between two identical arms is the noise floor
any later comparison has to clear. Then run sdk,transport, which must agree
within that floor before the transport arm's extra fields are trusted. Both
arms speak HTTP/1.1 (reqwest is built without HTTP/2).
It writes and deletes keys, so it runs only against a non-production
endpoint (an allowlist in the example), appends every key
to --ledger before the PUT that writes it, caps every TTL at 900 s, and never
retries. A 429, a 503, any other 4xx but 404, or a transport error stops the run;
other 5xx responses are recorded and the run goes on, up to five, so an
endpoint's sporadic errors become a counted rate rather than ending the run.
cargo build --release --example wall_time_probe --features macros
CACHEKIT_API_KEY=… CACHEKIT_API_URL=<allowlisted endpoint> \
target/release/examples/wall_time_probe --run r1 --phase warm \
--out rows.jsonl --ledger keys.txt --arms sdk,sdk --samples 40 --block 10--fresh-conn builds a new client per sample, --gap-ms idles between
samples, --concurrency N sends bursts (after one failed request, the burst
sends nothing more), and --macro-cold-miss times a
#[cachekit] cold miss (GET, lock, origin, PUT, unlock; each request it sends
is checked, and a call sending more than five stops the run; the unlock, sent
after the call returns, is waited for off the clock and checked with its call). --hold-lock
tests those rules against a live refusal: a second client holds the first cold
miss's fill lock, so the run must stop (exit 1 if it does not). Exit 3 is any
stop: only a STOPPED line naming LOCK in macro-cold-miss and lock not granted is the held lock. --help lists every flag. Delete the ledger's keys when the run ends; the TTL
is the backstop.
The supply-chain check reads both its policy (deny.toml) and its own
definition (security.yml) from the PR head, so a PR could weaken the gate it
is being graded by — delete a [bans] entry, or drop --all-features while
keeping the job name green. Two properties make that visible:
- Deletion fails closed.
supply-chainis a required status check: if nothing reports it, the PR cannot merge. The check is pinned to the GitHub Actions app, so a status posted from outside Actions cannot satisfy it. - Modification trips a wire. The job's final step fails the required check
when a PR changes
deny.tomlorsecurity.ymlrelative to its base, or changes any other workflow file that mentionssupply-chain, unless the PR body contains the exact, case-sensitive string[gate-change-approved](add it after human sign-off, then push a commit — the marker is read from the push-time event, so a body edit alone does not re-trigger).
Rust 1.85 or later (Edition 2021).
User-facing docs in this repository follow CacheKit's shared rule on what belongs in them:
What belongs in these docs.
prek install (or pre-commit install) sets up hooks that reject internal references in README
files, docs/ and commit messages, plus a pre-push hook that runs make test when a push
touches .rs files.
MIT — see LICENSE for details.