Observability
Native histograms, SLO tie-in, and production failure patterns
GitHub 2023: a SLO alert for code-search latency repeatedly fired without action. Investigation found the alert was on average latency — a bug fix that pushed p99 from 200 ms to 800 ms barely moved the mean. The SLO was reworked to multi-window p99 burn-rate alerts per the Google SRE Workbook pattern. The next incident was caught in under 4 minutes.
Native histograms (Prometheus 2.40+)
Classic histograms require choosing bucket boundaries at instrumentation time. If your service’s latency distribution shifts — say a slow path suddenly dominates the 1–5 s range — you need to redeploy with different buckets.
Native histograms (Prometheus 2.40+, also called exponential histograms in OTel) use a logarithmic scale with dynamically adjusting resolution. Every observation is placed in a bucket sized at ~1% relative precision — e^(2^-scale) width — without any static boundary list. Benefits:
- No manual bucket tuning.
- Uniform p99 accuracy across the latency range (not just near the SLO).
- Similar storage cost to a well-tuned classic histogram.
- Full PromQL compatibility:
histogram_quantileworks the same way.
OTel’s exponential histograms work identically and are the default for new metric instrumentation in the OTel SDK.
Compatibility note: some older storage backends (Cortex < 1.15, Thanos < 0.32) need version upgrades to read native histograms. Verify the storage tier before switching.
| Histogram type | Bucket tuning | p99 accuracy | Compatibility |
|---|---|---|---|
| Classic (fixed buckets) | Manual, per-service | Good near SLO only | Universal |
| Native / exponential | None needed | ~1% everywhere | Prometheus 2.40+, OTel SDK default |
| Summary (per-replica) | None | Correct per-replica, wrong aggregated | Cannot aggregate across replicas |
Why averaging p99 across replicas is wrong
Averaging pre-computed percentiles (summary metrics) across replicas is a famous anti-pattern:
Example: replica A serves 100 requests all at 100 ms. Replica B serves 100 requests all at 1000 ms. p99 of A is 100 ms; p99 of B is 1000 ms; their average is 550 ms. The true p99 of the merged 200 requests is 1000 ms (rank 199 out of 200, above the 99th cutoff). The average is off by nearly 2×.
The correct pattern: histograms emit per-replica bucket counts; sum by (le) (rate(...)) aggregates them at query time; histogram_quantile computes the true fleet-wide percentile from the aggregated counts. Accurate within ±half a bucket. No replica isolation.
RED feeds the SLO error budget
An SLO is a promise: 99.9% of requests complete successfully within 200 ms over 30 days. RED’s Duration and Errors are exactly the metrics that populate this promise.
- Availability SLO:
1 - rate(errors[window]) / rate(total[window])— “99.9% of requests must not return 5xx” - Latency SLO:
histogram_quantile(0.99, ...) < 0.200— “99th percentile must be under 200 ms” - Error budget: minutes or request-count remaining before the SLO is breached for the month.
Without RED instrumentation, you do not have an SLO — you have a wish.
Multi-window burn-rate alerting (Google SRE Workbook): alert when the error budget is burning too fast at two windows simultaneously:
- 1-hour window (fast burn): catches sudden spikes (deployment gone wrong).
- 6-hour window (slow burn): catches slow regressions that threshold alerts miss.
A threshold alert on absolute p99 (“fire if p99 > 200 ms”) misses slow regressions (p99 goes from 150 to 190 ms over two weeks, always below the threshold) and fires false positives on brief spikes. Burn-rate alerts catch both.
Production failure patterns in RED+USE
GitHub 2023 (average latency alert): SLO alert on average latency. A regression pushed p99 from 200 to 800 ms; mean moved from 45 to 55 ms. Alert never fired. Fix: switch to p99 burn-rate alerts with 1h short + 6h long windows per the SRE Workbook.
Cloudflare 2022 (cardinality explosion): A new label on request_duration caused Prometheus servers to OOM. Rule-evaluation latency grew from 100 ms to 4+ s, masking service alerts. Prometheus’s own prometheus_tsdb_head_series was the leading signal — but there was no alert on it. Fix: per-team cardinality budget enforced in CI; meta-monitoring on Prometheus’s own RED.
Stripe 2024 (PSI memory pressure invisible to free-RAM): Webhook worker stalled for 11 minutes. Free-RAM dashboards showed 500 MB available. PSI memory full was at 90% — kernel was thrashing reclaim. Fix: migrated saturation alerting from MemAvailable < threshold to PSI-based alerting; next incident caught in 30 seconds.
Discord 2023 (rule-evaluation latency growth): A refactor moved a hot label from one metric to two. Cardinality doubled silently. Prometheus rule-evaluation latency grew from 100 ms to 4 s over two weeks, delaying alerts during a customer-facing incident. Fix: rule-evaluation duration added as a first-class panel in the meta-monitoring dashboard.
Why this works
Self-referential observability: Prometheus itself emits RED and USE metrics. Key Prometheus self-metrics to watch: prometheus_tsdb_head_series (cardinality growth), prometheus_engine_query_duration_seconds_p99 (query latency), prometheus_rule_evaluation_duration_seconds_p99 (alert delays). Every observability layer — OTel Collectors, Fluent Bit, Vector — emits its own RED. In a mature stack, every layer of observability is itself observed. The collapse mode for an unobserved monitoring tier is silent failure: your services look fine, but the monitoring pipeline stopped delivering their data 20 minutes ago.
A team uses Prometheus summary metrics (pre-computed p99 per replica) and averages them to get fleet-wide p99. Why is this mathematically wrong?
A threshold alert fires when p99 > 200 ms. p99 drifts from 140 ms to 185 ms over three weeks (never crossing 200 ms). The SLO allows 99.9% of requests to complete within 200 ms. What does the threshold alert miss that a burn-rate alert would catch?
- 01What is a native (exponential) histogram and what problem does it solve over classic histograms?
- 02How does RED tie into SLO error budgets? What is the formula for a latency SLO?
- 03What are the two burn-rate windows in multi-window alerting and what does each catch?
Native (exponential) histograms, available in Prometheus 2.40+ and as the OTel SDK default, use a logarithmic bucket scale at ~1% relative precision, eliminating the manual bucket-tuning required by classic histograms. RED Duration histograms and Error counters are the direct substrate for SLO measurement: the availability SLO is 1 - error_rate and the latency SLO is histogram_quantile(0.99) < target. Multi-window burn-rate alerting (1h short + 6h long windows) catches both sudden regressions and slow drift that threshold alerts miss — catching the slow kind is what the GitHub 2023 incident post-mortem mandated. Every major production failure in this unit — Cloudflare 2022, GitHub 2023, Stripe 2024, Discord 2023 — reduced to one specific missed RED or USE signal: cardinality explosion invisible without Prometheus self-monitoring, average latency masking p99, free-RAM invisible to PSI memory pressure, and rule-evaluation latency growth masking alerts. Self-referential observability — monitoring the monitoring pipeline itself with the same RED+USE discipline — is the last defense.
appears again in167
- The journey of a request: seven stops from socket to responsejunior
- Accept and parse: from kernel queue to a typed requestmiddle
- Routing and middleware: choosing what runs, and in what ordermiddle
- Handler and response: from business logic to bytes on the wiremiddle
- Streaming and backpressure: when the client reads slower than you writesenior
- Timeouts and tail latency: budgets, deadlines, and the fan-out trapsenior
- Middleware and DI: the two patterns that shape every backendjunior
- Writing middleware: signatures, next(), and the three framework modelsmiddle
- Inversion of control: how dependencies reach a classmiddle
- DI scopes and lifecycles: singleton, request, transientmiddle
- DI as a testing seam: fakes, mocks, and the boundary that matterssenior
- DI containers in production: resolution graphs, circular deps, and when not tosenior
- Blocking vs non-blocking I/O: two ways to waitjunior
- The event loop: one thread, ordered phasesmiddle
- What blocks the loop: CPU work and sync callsmiddle
- Offloading CPU work: worker threads and the libuv poolmiddle
- Backpressure and bounded concurrencysenior
- Throughput under load: tail latency and saturationsenior
- Why pool: the cost of creating a connectionjunior
- Pool sizing: why bigger is not fastermiddle
- Acquisition and timeouts: the wait queue is the real latency dialmiddle
- Retry strategies: backoff, jitter, and thundering herdmiddle
- Observability, production failures, and global-scale designsenior
- Tasks, microtasks, and scheduler.yield()middle
- Timer accuracy, throttling, and idle workmiddle
- Node.js event loop: phases, nextTick, and loop lagsenior
- Rendering strategies: SSG, SSR, ISR, streaming, and hydrationjunior
- SSG, SSR, ISR, streaming, and RSC — how each worksmiddle
- Hydration cost: selective, progressive, islands, resumabilitymiddle
- Core Web Vitals: what LCP, INP, and CLS measurejunior
- LCP: four phases, one dominant costmiddle
- INP: input delay, processing, presentationmiddle
- Lab vs field: why the two disagree and how to use eachmiddle
- Metric tradeoffs, RUM attribution, and the CI+field loopsenior
- The full picture: URL to LCP to INP as a relay racejunior
- Eight layers traced: from the service worker to the second navigationmiddle
- Five canonical breaks: where production reliably diessenior
- The three-track method: reading traces and building a monitored systemsenior
- What an index is and how it speeds up queriesjunior
- The leading-column rule and composite index designmiddle
- Partial, expression, and covering indexesmiddle
- Index types: GIN, GiST, BRIN, Hash, Bloom, and HOT updatesmiddle
- Index-only scans, the Visibility Map, and INCLUDEsenior
- Production failure modes and the index audit playbooksenior
- Index design exercise: full-text search strategysenior
- EXPLAIN and execution plans: what the planner decides and whyjunior
- Scan types: Seq, Index, Bitmap, Index-Onlymiddle
- Join algorithms and the row-estimate cascademiddle
- pg_statistic, ANALYZE, and production observabilitymiddle
- Extended statistics: fixing correlated-column estimate failuressenior
- Plan cache, cost-constant tuning, and planner internalssenior
- Production failure modes and plan stabilitysenior
- Connection pools: amortising the cost of a Postgres backendjunior
- PgBouncer session, transaction, and statement modesmiddle
- Pool sizing: the (cores × 2) + spindles formula and the two-layer stackmiddle
- Pool exhaustion and idle-in-transaction: the 3 AM failure modemiddle
- Migrating to transaction mode: rollout playbook and PgBouncer 1.21 prepared statementsmiddle
- The Postgres process model and why raising max_connections degrades throughputsenior
- Pooler landscape 2026, serverless connection storms, and the full failure-mode taxonomysenior
- ADD COLUMN: instant in PG 11+ vs rewrite in older Postgresjunior
- The lock-queue failure mode: why instant DDL can freeze the databasemiddle
- Safe DDL patterns: NOT VALID, CONCURRENTLY, and unsafe-op fixesmiddle
- Migration failure taxonomy and production disciplinesenior
- Shard-key selection: hash, range, list, and directory strategiesmiddle
- Co-location and Citus: the invariant that makes sharding usablemiddle
- The hot-shard failure mode: detection, isolation, and durable policymiddle
- Online resharding, 2PC, and the operational cost of shardingsenior
- The seven acts: from CREATE TABLE to Citusjunior
- Acts 1–3 in depth: schema, indexes, and planner statisticsmiddle
- Acts 4–6 in depth: MVCC bloat, connection pooling, and safe migrationsmiddle
- Act 7 in depth: sharding, co-location, and the seven-tier tradeoff cascademiddle
- Observability, anti-patterns, and production triagesenior
- Bits on the wirejunior
- Latency mathmiddle
- Bufferbloat and congestionsenior
- The physical frontiersenior
- Sequence numbers and connection statemiddle
- Flow control and congestion controlmiddle
- BBR, production observability, and beyond TCPsenior
- CDN: putting content next doorjunior
- Anycast and GeoDNS: routing to the nearest edgemiddle
- Tiered cache and Cache-Controlmiddle
- Vary header and cache keysmiddle
- Stale-while-revalidate and cache stampedesenior
- Edge workers and edge-side compositionsenior
- CDN operations and observabilitysenior
- WebSocket: the HTTP upgrade handshakejunior
- WebSocket vs SSE vs long-polling: choosing the right transportmiddle
- WebSocket backpressure: when clients can''''t keep upmiddle
- Reconnection: jittered backoff, thundering herd, message resumptionsenior
- WebSocket at scale: HTTP/2 multiplexing, permessage-deflate, C10Msenior
- WebSocket in production: proxies, security, and distributed architecturesenior
- What reverse proxies dojunior
- Balancing algorithms: round-robin to power-of-two-choicesmiddle
- L4 vs L7 load balancing and client-IP preservationmiddle
- Health checks, connection draining, and slow startmiddle
- Retry storms, circuit breakers, and load sheddingsenior
- Resilient LB architecture: anycast, zone-aware routing, and observabilitysenior
- Why QUIC and not TCP+TLSjunior
- QUIC streams and head-of-line blockingjunior
- Integrated handshake and 1-RTTmiddle
- Connection IDs and network migrationmiddle
- Loss detection and congestion controlmiddle
- 0-RTT resumption and packet encryptionsenior
- Deployment tradeoffs and CPU costsenior
- DDoS: what it is and why it worksjunior
- Amplification attacks and state exhaustionmiddle
- Rate limiting: algorithms and architecturemiddle
- WAFs, firewalls, mTLS, and HSTSmiddle
- DNS cache poisoning and BGP hijackingsenior
- Defense-in-depth architecture and attack economicssenior
- The twelve layers: one URL, seven actorsjunior
- DNS, TCP, TLS in sequence: where the milliseconds gomiddle
- Critical render path and Core Web Vitalsmiddle
- Proxy intercepts and security gates: rate limiters, WAF, mTLSmiddle
- Alternate paths: QUIC 0-RTT, WebSocket upgrade, connection migrationmiddle
- Observability: distributed traces, USE/RED, and samplingsenior
- Resilience: cascading retries, circuit breakers, and error budgetssenior
- Why profile first: measure where time actually goesjunior
- Amdahl''''s law and self-time: the ceiling on every speedup you can shipmiddle
- The measurement loop: microbench, macrobench, prod profile, observer effectmiddle
- Reading flame graphs: shapes, per-language profilers, and the 60-second scanmiddle
- Statistical baselines: why one run is not a measurementmiddle
- Profiler history and microbenchmark pitfalls: Knuth to GWPsenior
- Hardware counters, cold-start profiles, and profile securitysenior
- Continuous profiling at scale: costs, CI gates, trace correlation, and anti-patternssenior
- What makes a hot path: symptom vs causejunior
- Five shapes of hotspot: CPU, alloc, cache, lock, syscallmiddle
- Reading parent and child chains: where to apply the fixmiddle
- JIT deopt, the fix-and-verify loop, and PR-time profilingmiddle
- Hardware counters and Intel TMA: sub-category diagnosissenior
- False sharing and native-bridge hot pathssenior
- Hot paths in production: security, tail latency, and tooling lineagesenior
- Memory hierarchy: why the same O(N) loop can be 17x slowerjunior
- Row-major vs column-major: access order and the 9x gapjunior
- Branch prediction and branchless codemiddle
- Hardware prefetcher, TLB, and memory-level parallelismsenior
- GC basics: what the runtime taxes you forjunior
- GC algorithms: generational, concurrent, and per-runtimemiddle
- GC tradeoffs: pause, throughput, heap — and object poolingmiddle
- GC tuning: pacing, heap shape, and allocation observabilitymiddle
- GC internals: tri-color invariant, write barriers, and per-runtime deep-divessenior
- GC in production: observability, security, edge cases, and fleet governancesenior
- N+1: one logical operation, many round-tripsjunior
- Fix families: JOIN, IN, preload, and DataLoadermiddle
- Detecting N+1: query logs, APM traces, and CI gatesmiddle
- DataLoader: batching across resolver treesmiddle
- Cross-protocol N+1: HTTP fan-out and Redis MGETmiddle
- N+1 at scale: pool exhaustion, plan changes, and denormalisationsenior
- Batching: amortize fixed cost per operationjunior
- The batching window: size and wait timemiddle
- Batching in Kafka and Postgresmiddle
- io_uring and observability of batchingmiddle
- From Nagle to io_uring: evolution of batchingmiddle
- Backpressure, failure isolation, and batch security in productionsenior
- What a bundle actually costs: download, parse, compile, executejunior
- Core Web Vitals: LCP, INP, and CLSmiddle
- Code splitting: route-level, component-level, vendor splittingmiddle
- Tree shaking and compression: removing what you don''''t usemiddle
- Third-party scripts: the silent budget killermiddle
- CI enforcement and RUM: making budgets stickmiddle
- V8 JIT pipeline, HTTP priorities, and bundle securitysenior
- The performance loop: discipline, not a projectjunior
- Classify and fix: matching bottleneck families to remediesmiddle
- Observability stack and CI gates: catching regressions before they shipmiddle
- Incident to enforcement: SLO burn to verified fix in 35 minutesmiddle
- Culture, economics, and org-scale performancesenior