The region

Allocation is a region in distribution space, not a single vector. Inside it, the room stays open. Its boundaries are inherited.

The dignity-floor at every operator, from the spine. Binding regardless of any further calculation.

Substrate rates the ground can regenerate and absorb, from Chapter Ten.

Accumulation thresholds past which the buffer must overflow, from Chapter Four. Concentrations the buffer cannot carry. Asymmetries that force slope correction. Record densities at which the structure can no longer read itself.

And the joint condition: all three satisfied at once, at every class of operator.

The region is approximate at present reading capacity. It runs through proxies with inspectable assumptions and explicit bounds. Better data will sharpen it.

What it refuses categorically is concentration that contracts the room past what the structure can sustain. Some concentration is cooperative — real differences in capacity, prior cooperative coupling. Some is parasitic — provenance failure, propagation failure, captured advantage. The reading tells them apart where the difference lives.

This is the short edition of Ø Applications — a summary. Where a step is compressed here, the original carries it in full. The original book (PDF) · This edition (PDF)

The same page on the420code.org: the420code.org/models/applications/12-the-architecture-of-global-resource-allocation/