A compute market needs a meeting time

A compute buyer can refresh a marketplace all morning without finding the combination of hardware, start time and price it needs. A supplier can watch the same quiet screen and conclude that nobody wants its capacity. If the two parties arrive at different times, a continuously open market may make available interest harder to see.

A scheduled auction offers one possible response: give compatible buyers and sellers an appointment. Nasdaq's Opening Cross is a useful historical example of how that appointment becomes an institution. It combines a deadline with defined orders, information before execution and rules that determine which commitments become trades. The compute application depends on finding customers who can wait and a product they can genuinely substitute.

How the appointment becomes a market

The SEC approved Nasdaq's new opening process on September 16, 2004. Its order described three components: orders specifically for the open, dissemination of order imbalances, and a 9:30 a.m. cross that would execute the maximum number of shares at one price. Nasdaq reported in January 2005 that it had completed the rollout to all Nasdaq-listed securities the previous December. SEC approval, published September 23, 2004; Nasdaq year-end report, January 13, 2005.

There was a consequential argument about participation. Bloomberg objected that requiring automatic execution would exclude trading interest from electronic networks using order delivery. Nasdaq answered that matching orders at one instant was incompatible with an iterative delivery process and described alternative participation routes. The SEC approved the proposal after considering those objections. The record shows that making orders executable together also required decisions about access. SEC approval, sections III and IV.

The timing rules have changed since 2004. An April 2021 Nasdaq notice announced earlier imbalance information from 9:25 a.m., alongside restrictions on cancelling or modifying on-open orders once that information began. New qualifying orders could still arrive under specified cutoffs. This paired additional information with firmer commitments. Those later rules should not be read back into the original launch. Nasdaq trader alert, April 16, 2021.

Nasdaq's current rulebook starts price selection by maximizing executed shares, then applies tie-breaks including minimizing unmatched interest. It also specifies price protections and circumstances in which no cross occurs. A scheduled auction therefore needs more than the instruction to pick a price that clears. It needs published answers for ties, unusual prices and failure. Nasdaq Rule 4752(d), retrieved November 9, 2026.

Five compute blocks at one price

Consider an invented compute auction at 10:00 UTC for service beginning at noon. Each block contains eight GPUs on one approved host configuration for four uninterrupted hours. Hardware, memory, interconnect, software image, region, storage allowance and remedies for failed delivery are fixed beforehand. Each buyer has already tested the eligible suppliers and can use any offered block. Different blocks run independent jobs; nobody needs a sixteen-GPU job spread across two hosts.

Supplier A offers three blocks at a minimum of $80 each. B offers three at $100. C offers two at $120. Buyer X wants two blocks at up to $150 each, Y wants three at up to $120, and Z wants two at up to $90. Each participant accepts an allocation of fewer whole blocks than requested. These quantities and prices are illustrative, not observed offers.

For this pilot, suppose the published rule considers submitted price levels, maximizes the number of matched blocks, then minimizes the difference between eligible supply and demand. If a tie remains, it chooses the lowest qualifying price. Lower asks and higher bids receive allocation priority, with a previously announced rule for equal-price orders. This is an illustrative design, not a reproduction of Nasdaq's algorithm.

At $100, six blocks are offered and five are demanded. Five trade. At $120, eight are offered and five demanded, so five still trade but more supply remains unmatched. At $90 only three blocks are offered. The stated rule therefore selects $100: A sells three blocks, B sells two, X buys two and Y buys three. Z's limit is too low to trade with the remaining suppliers.

Five blocks represent 160 GPU-hours. Buyers pay $500 in total, equivalent to $3.125 per GPU-hour under the example's assumptions. Trading fees and taxes are omitted; any real comparison must add them and other excluded charges. The arithmetic establishes an allocation for these orders. It does not establish that the price is competitive, that bids reveal true values, or that useful work was delivered.

Before bidding, the suppliers must reserve the offered capacity and the buyers must authorize purchases within their limits. Credentials, payment arrangements and access checks must be ready. If winning merely starts another negotiation, a participant may withdraw while everyone else is committed. This is the compute counterpart of the historical dispute over which orders could participate in a simultaneous match.

The cost of waiting together

The proposal works only for demand that can tolerate the appointment. An overnight evaluation batch might wait for a morning auction; an inference service facing an immediate traffic surge might pay more to start now. Pooling orders can improve the opportunity to match, but waiting consumes time. A pilot must count customers who leave before the auction, not only those who remain to trade.

Compute also makes the product boundary unusually important. Two eight-GPU blocks cannot automatically satisfy one sixteen-GPU training request. A buyer that needs both blocks or neither introduces a combination constraint absent from the simple example. Splitting the market by topology, region or software requirements improves comparability while leaving fewer orders in each auction. One cannot assume both broad participation and close substitutability.

Nor does a uniform price prevent strategic bidding. A large supplier could withhold capacity, and a large buyer could shade demand. The opening price in a securities market also has surrounding quotations and established market institutions. A new compute venue cannot borrow their credibility merely by copying a price-selection rule.

A useful test would compare scheduled auctions with immediate posted offers for the same qualified product. Measure time to usable capacity, total delivered cost, completed work, failed starts and participation over repeated sessions. Record whether apparent volume came from new matches or simply moved existing business to a different clock. The historical lesson is a specific design option: concentrate executable interest at an agreed time. Whether the additional matches justify waiting is a question the compute market must answer for itself.