Fallacy of Zero Transport Cost¶
Reject the design-time assumption that moving data between nodes is free by restoring the per-byte cost term to the cost function, so payload volume becomes an explicit design variable budgeted alongside latency.
Core Idea¶
The Fallacy of Zero Transport Cost is the design-time assumption that moving data between nodes is free, so payload volume becomes an unconstrained design variable. In reality every byte carries real costs: serialization CPU on both endpoints, finite shared bandwidth, metered cloud egress, battery and cellular data, and buffer contention. With per-byte cost c set to zero, moving b bytes costs b·c = 0; restoring c > 0 makes payload size a first-class variable, corrected by moving only what the consumer uses.
Scope of Application¶
The fallacy lives within distributed computing, the subfields where a data-moving operation's cost function drops the per-byte term and the corrective toolkit is native.
- API and payload design — full-record responses and chatty schemas, answered by field projection and pagination.
- Cloud economics — cross-region and cross-cloud egress fees billed per gigabyte.
- Mobile and edge — battery and cellular-data costs of oversized payloads.
- ML data pipelines — the move-the-data versus move-the-compute decision.
Clarity¶
Naming the fallacy makes payload volume a first-class design variable and unifies a scattered toolkit — projection, pagination, compression, edge computation, caching — under one principle: move only what the consumer uses. It sharpens the distinction against the zero-latency fallacy: transport cost surfaces as a resource charge on a bill, dislocated in time and space from the code that caused it.
Manages Complexity¶
Incommensurable charges — serialization CPU, bandwidth, egress, battery, contention — compress to one cost-function term, b·c. Restoring c > 0 collapses them into a single budgeted quantity, keeps it cleanly separated from latency L, and reduces "which charges will this incur, and where?" to estimating bytes moved against per-byte cost.
Abstract Reasoning¶
Carrying c > 0 licenses a diagnostic (trace a resource charge back to bytes moved), an interventionist move (shrink b via projection, pagination, compression, caching, edge), boundary-drawing on where transport is effectively free (path-dependent on b·c), and an architectural calculation (move the data or move the compute) that can decide viability.
Knowledge Transfer¶
Within distributed computing the fallacy transfers as mechanism across API design, cloud economics, mobile/edge, and ML pipelines, the b·c framing and toolkit carrying intact. Beyond computing the parent is the well-pinned transaction_costs prime — per-unit friction mis-modeled as zero — of which this is the per-byte networking specialization (with network_flow_models nearby and an idealized-substrate meta-fallacy shared across Deutsch's fallacies). The egress-and-projection machinery stays home.
Relationships to Other Abstractions¶
Current abstraction Fallacy of Zero Transport Cost Domain-specific
Parents (1) — more general patterns this builds on
-
Fallacy of Zero Transport Cost is a kind of Idealized-Substrate Fallacy Prime
The fallacy of zero transport cost is the idealized-substrate fallacy specialized to data movement whose omitted friction is positive transfer cost.
Hierarchy path (1) — routes to 1 parentless root
- Fallacy of Zero Transport Cost → Idealized-Substrate Fallacy → Abstraction
Neighborhood in Abstraction Space¶
Fallacy of Zero Transport Cost sits in a sparse region of the domain-specific corpus (80th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (309 abstractions)
Nearest neighbors
- Fallacy of Infinite Bandwidth — 0.88
- Fallacy of Zero Latency — 0.85
- Rate-Limit Absence — 0.83
- PACELC Theorem — 0.82
- Robustness Principle (Postel's Law) — 0.82
Computed from structural-signature embeddings · 2026-07-12