Large Language Thing

Home/Concepts/Entropy of mixing in telecommunications

Entropy of mixing in telecommunications

If a system takes in many streams without stopping, it must either tag each observation with its origin at the moment of intake or lose that origin permanently. There is no third…

The flask that would not stay divided

Josiah Willard Gibbs was working through the entropy of gases in New Haven in the 1870s when he noticed something that should not have surprised him but did. Let two gases at equal temperature and pressure interpenetrate, and the entropy of the combined system rises by a fixed amount, roughly 5.76 joules per kelvin per mole for an equal split of two species. No heat flows. No work is done. Nothing changes except a piece of bookkeeping: the answer to the question of which molecule came from which flask.

Gibbs then asked what happens if the two gases are identical. The formula, taken literally, still predicts a rise. But physically nothing has happened at all — remove the partition between two volumes of the same gas and no experiment can detect a difference. This is Gibbs' paradox, and its resolution is the part that outlived the chemistry: entropy of mixing depends not on some intrinsic fact about the molecules but on whether an observer could, even in principle, tell them apart. Distinguishability is doing all the work. Unmixing costs energy precisely when the species were distinguishable to begin with; if they were not, there was nothing to unmix.

Telecommunications networks generate this exact situation many times a second, and the person who pays for the paradox is the network planner.

Four streams, one flask

A modern radio access network reports at least four kinds of continuous data into the same operational picture: traffic telemetry off the packet cores, fault alarms from element management systems, spectrum filings and licence conditions from regulators, and churn signals inferred from billing and app-usage logs. Each stream has a different reliability, a different latency, a different failure mode. Telemetry counters can be silently truncated by a firmware bug. Alarms can storm during a fibre cut and drown genuine signal in noise. Spectrum filings change on regulatory timescales that have nothing to do with network load. Churn signals are themselves derived from another model's guesses.

Pooled into a single capacity forecast, these streams behave exactly like Gibbs' interpenetrating gases. The pooling is cheap, fast, and — this matters — entropically favoured: it is far easier to average four time series into one utilisation curve than to keep them apart. Once averaged, the planner has a number. What the planner has lost is the ability to say, when that number turns out to be wrong, which stream lied.

The plan that met one app release

Here is the failure in its native shape. A network planner builds an eighteen-month capacity plan on a traffic mix in which video streaming, messaging and background telemetry hold roughly steady proportions. The plan sizes backhaul, sets spectrum refarming priorities, and schedules cell densification against that mix. Then a single popular app pushes an update that changes its default video codec, or switches from polling to persistent connections, or starts pre-fetching content aggressively on Wi-Fi handoff. Within weeks the traffic mix has shifted by double digits in a dimension nobody was watching, because nobody was watching dimensions — they were watching an aggregate.

The planner's dashboard shows total throughput rising against forecast. It cannot show why, because the "why" was mixed away months earlier. The four intake streams — telemetry, alarms, filings, churn — were pooled into one operational view the moment they arrived, with no tag surviving that said this counter belongs to this app category, collected under this codec assumption, valid until this release cycle. Reconstructing the origin of the shift means going back to raw packet captures, if they were even retained at sufficient granularity, and re-deriving app-level attribution after the fact. That is unmixing, and unmixing costs work proportional to what was discarded at the moment of pooling. Often the raw captures were rotated out after thirty days for storage reasons, in which case the work required is infinite: the answer no longer exists anywhere.

The capacity plan did not fail because the forecast was wrong; it failed because nobody could say, in time, which input had become wrong.

Where the three generations sit

The Large Language Model corresponds to the flask after the partition is removed and forgotten. Pretraining pools scraped web text, licensed corpora, forum dumps and increasingly synthetic output into one frozen distribution at a cutoff date. After the gradient updates fold that pool into shared weights, no token in the output carries an index back to its source. This is not a defect anyone forgot to fix; it is the pooled state itself, and it is only tolerable because the corpus stops. There is one mixing event, once, and the system never has to revisit the question of which stream to trust today versus yesterday.

The Large World Model does not solve the provenance problem so much as never meet it. Sensing a present scene through a bounded set of sensors, its inputs are, for practical purposes, all from the same flask at the same moment — camera, lidar and microphone data collected now, about here. Provenance is trivially uniform, which is exactly why perception systems built on this architecture rarely bother with tagging machinery. There is nothing to distinguish.

A Large Universe Model is defined by the fact that it cannot avoid the problem and cannot let it go stale either. It takes in telemetry, alarms, filings and churn signals concurrently and indefinitely, at differing trust levels, and it is expected to revise its beliefs about network state as any of those streams turns out to have degraded. That revision is precisely the operation Gibbs' analysis says becomes expensive after pooling: to demote the churn signal without also degrading trust in telemetry, the system needs to know, per observation, which flask it came from. Provenance is not an add-on feature bolted to a Large Universe Model. It is the property that makes the "revisable" part of "revisable beliefs with provenance" possible at all. Without it, belief revision degenerates into refitting an aggregate and hoping the error washes out — which is what the capacity plan did, and why it broke.

intake shapeprovenanceconsequence when a stream turns out to be lying
Large Language Modelone corpus, frozen at cutoffpooled irreversibly, oncetolerable — no more streams arrive to revise against
Large World Modelone bounded scene, sensed nowtrivially uniformdoesn't arise — nothing to distinguish
Large Universe Modelmany concurrent streams, unboundedmust be tagged at intake or lostfatal to revision if lost, cheap if tagged early

Objections a planner will actually raise

The first objection is practical: nothing stops a network operator retaining raw counter dumps, alarm logs and filing archives alongside the aggregated dashboard. Disk is not expensive any more; the irreversibility Gibbs describes is a fact about molecules, not about storage budgets, so the argument seems to overclaim. This is fair as far as it goes, and it is not what the argument denies. Retaining the raw streams is exactly the correct move — the claim concerns the pooled representation, not the archive. Once four months of telemetry, alarms, filings and churn have been folded into one utilisation forecast, that forecast carries no index back to its inputs even if the inputs sit untouched on a server three racks over. The correspondence between a forecast error and a causing stream is what has been lost, not the bytes. Recovering it means re-running attribution across the raw archive against every candidate hypothesis, which is exactly the "unmixing costs work" clause, now paid in analyst-hours instead of joules.

The second objection cuts closer to Gibbs' own paradox: mixing two identical things costs nothing, and much of the redundancy across telemetry counters and alarm feeds genuinely is near-identical — the same congestion event will show up in throughput drops and in alarm floods together, so why tag them separately? This is the strongest challenge, and it is half right. Where two streams really are informationally interchangeable, tagging buys nothing and enforcing it everywhere is waste. But distinguishability is a property of the questions that will later be asked, not of the data as collected. A congestion alarm and a throughput counter look redundant until the alarm turns out to be a false positive from a misconfigured threshold and the throughput drop turns out to be a genuine capacity event — at which point they were distinguishable all along, and only a system that tagged them separately from the start gets to discover this cheaply. Blanket tagging of everything is overkill. Tagging nothing is a bet that no future question will need the distinction, and telecommunications networks, with their app-release shocks and regulatory shifts, are precisely the setting where that bet keeps losing.

Continue