HYPERSCALE · OVERLOAD & PRIORITY

The critical never queues behind the bulk.

On Napoleon's battlefields, a surgeon invented a rule that still runs every emergency room on earth: treat by urgency — never by rank, never by order of arrival. Hyperscale's network layer runs the same rule, because a node under overload is exactly a hospital in a disaster: demand spikes at the precise moment capacity drops.

01 · 1797

The surgeon who sorted

Before Dominique-Jean Larrey, the wounded waited where they fell until the battle ended — then were treated in order of rank: officers first, however lightly scratched. Larrey, Napoleon's chief surgeon, built fast horse-drawn ambulances — ambulances volantes — to reach the wounded during the fighting, and then did the more radical thing: he sorted them. By urgency alone. The dying colonel-of-nothing before the grazed general; the salvageable before the comfortable. The French verb trier, to sort, gave the practice its name: triage.

Underneath the battlefield drama is a cold scheduling insight that took medicine decades to articulate and computing decades more: when you cannot do everything, the decision of what never waits must be made in advance — because at the moment of overload, the queue itself is what kills.

02 · The death spiral

How a node drowns in its own rescue

Here is the failure that motivated this whole layer — observed live during this system's development. A validator falls behind (a GC pause, a network blip, anything). It starts catching up: bulk-fetching the blocks it missed. The catch-up traffic floods its own connection — and starves the small, urgent consensus messages that represent now. Starved of now, it falls further behind, so it fetches harder, so it starves longer. The rescue is the drowning. No amount of bandwidth fixes this; the fix is Larrey's: the fast heartbeat must never wait behind the history download, and that ordering must be decided before the crisis, not during it.

✕ FIRST COME, FIRST SERVED

Fair and fatal

A FIFO queue can't tell a consensus vote from a megabyte of catch-up. Under load, "fair" means the urgent waits its turn behind the enormous.

✕ ONE QUEUE FOR EVERYTHING

Bulk wins by volume

Recovery traffic is a firehose; consensus traffic is a whisper. Any shared, unranked channel is won by the firehose — precisely when the whisper matters most.

✕ INFINITE WAITING ROOMS

The buffer is the casualty

Unbounded queues convert overload into memory exhaustion — the waiting room grows until it kills the hospital. Every queue needs a size and a policy for the overflow.

03 · The tags

Five colors of urgency

So every message in Hyperscale carries a class — a triage tag on a spectrum from "treat immediately" to "can wait indefinitely": live consensus at the top; then the traffic that completes blocks; then cross-shard progress; then recovery; and at the bottom, bulk catch-up. The tail of the spectrum is sheddable by design: bounded queues, capped shares of the connection, drop-on-overflow. Under stress, catch-up degrades gracefully and retries later; consensus does not degrade at all.

CONSENSUS · immediate BLOCK COMPLETION CROSS-SHARD PROGRESS RECOVERY BULK CATCH-UP · sheddable THE NODE, OVERLOADED shed — retried later, bounded the chain keeps beating blocks keep filling transfers keep moving recovery slows…
Shedding is a designed behavior with a bounded blast radius — not a failure. The whisper always outranks the firehose.

Notice what this does to the death spiral: the lagging node's own bulk fetching can no longer starve its own consensus intake. It keeps hearing now while it back-fills then — at whatever rate the priority spectrum leaves for it — and the loop that fed on itself simply has nothing to eat. (The urgent classes are also precisely what the archive's fetch obligations and the provisions ride on when gossip fails them.)

04 · The intake rules

Malice is just another load pattern

Everything above assumes traffic that is merely heavy. But some of the crowd at the door is hostile — and the same triage discipline handles it, because the safety rules already make Byzantine content harmless (the overlap), leaving only Byzantine volume to bound:

◦ NO SELF-REPORTED WEIGHTS

Checked at the door

Wire formats carry hard size caps enforced before any memory is allocated. A peer claiming to send a three-tonne patient is refused at the ambulance bay, not weighed in the ward.

◦ CAPPED BEDS PER CASE

Bounded buffers, useful excess

Only a small constant number of competing block headers is ever buffered per consensus slot — an honest proposer signs exactly one, so the excess isn't just dropped, it's evidence.

◦ POLITE PERSISTENCE

Backoff and rotation

Every fetch path retries with exponential backoff and rotates peers — a dead or malicious server converts into bounded retry load spread elsewhere, never a hammering loop.

Two quieter rules complete the intake. Bounded speculation: a flood of far-future garbage can't drag a replica's attention beyond a capped distance from its last certified block, so hostile peers can't inflate its view or burn its CPU verifying fantasy. Reputation with receipts: every gossiped message gets an explicit accept/reject verdict that feeds peer scoring — a peer that keeps sending junk loses standing deterministically, on every honest node that hears it.

05 · The lesson

Overload tells the truth

A system under overload reveals its actual priorities — the ones enforced by its queues, not the ones written in its mission statement. Priority isolation here is a standing invariant — exercised, not assumed: the fault suite floods, partitions, and drops traffic class by class and asserts the consensus heartbeat never misses (the crash lab).

Larrey's rule, restated for networks: decide in advance what you will never fail to do — then build the queues so that, on the worst day, that decision executes itself.