Fallacy of Zero Latency¶

The design-time assumption that a remote call returns as fast as a local one, dropping the per-hop round-trip term L from the cost function, so that an operation making n network calls is budgeted as free when it actually costs at least n·L and compounds under sequential fan-out.

Core Idea¶

The Fallacy of Zero Latency is the design-time assumption that a remote call returns as fast as a local one — that network round-trip time is effectively zero and can be ignored in API design and performance estimation. Real networks add irreducible latency, invisible on localhost and under light-load testing. The structural error is in the cost function: when per-call latency L is treated as zero, an operation making n remote calls looks free, when it actually costs at least n·L and compounds under sequential fan-out.

Scope of Application¶

The fallacy lives within distributed computing — the subfields where a composed operation's cost function drops the per-hop round-trip term L, and the corrective toolkit is native.

Object-relational mapping / persistence layer — the home case: lazy-loading issues a query per row (the N+1 pattern).
Microservice fan-out and service mesh — a single request synchronously chaining ten downstream calls.
Client-API design — a list view calling a detail endpoint once per item.
Multi-region and cross-datacenter deployment — the cross-continent hop invisible at design time and dominant in production.

Clarity¶

Naming the fallacy makes a per-call cost visible that local-call abstractions are built to hide: transparent RPC and ORM lazy-loading erase the local/remote distinction, so L silently drops from the cost model. It sharpens the distinction between number of calls and cost of the operation, and locates the trap in development practice — the latency is invisible on localhost, exactly where systems are designed.

Manages Complexity¶

A scattered catalogue of pathologies collapses to one term in a single cost function: per-call latency L, wrongly set to zero, so n calls cost at least n·L. The disparate bugs resolve into one shape (too many sequential round trips on the critical path), and the whole corrective toolkit resolves into one principle: minimize sequential round trips, parallelize the unavoidable ones.

Abstract Reasoning¶

Carrying L > 0 licenses a diagnostic move (read the round-trip count behind slowness, using the localhost-versus-production gap), an interventionist move (cut or parallelize round trips, each corrective a prediction), a boundary-drawing move (when n·L is negligible, zero latency is a safe approximation), and a forward move (budget production latency at design time).

Knowledge Transfer¶

Within distributed computing the fallacy transfers as mechanism across the persistence layer, service mesh, client-API design, and multi-region deployment, sharing the n·L cost function and the corrective toolkit — one of the Fallacies of Distributed Computing. Beyond it the portable content is the latency prime plus the cost-of-composition shape; transaction costs and cross-team hand-offs are the same shape, not the same mechanism, so the RPC-native corrective vocabulary stays home.

Relationships to Other Abstractions¶

Current abstraction Fallacy of Zero Latency Domain-specific

Parents (1) — more general patterns this builds on

Fallacy of Zero Latency is a kind of Idealized-Substrate Fallacy Prime

The fallacy of zero latency is the idealized-substrate fallacy specialized to a network whose omitted friction is positive per-hop delay.

Hierarchy path (1) — routes to 1 parentless root

Fallacy of Zero Latency → Idealized-Substrate Fallacy → Abstraction

Neighborhood in Abstraction Space¶

Fallacy of Zero Latency sits in a moderately populated region (50^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Unclustered & Miscellaneous (309 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12