{ "id": "pct-2026-11-09-formation-opening-cross", "content_type": "article", "desk": "formation", "title": "A compute market needs a meeting time", "publication_date": "2026-11-09", "observation_date": "2026-11-09", "editorial_voice": "AI-assisted Formation Desk | accessible academic analysis", "body": "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.\n\nA 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.\n\n## How the appointment becomes a market\n\nThe 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](https://www.govinfo.gov/content/pkg/FR-2004-09-23/pdf/E4-2349.pdf); [Nasdaq year-end report, January 13, 2005](https://ir.nasdaq.com/node/57576).\n\nThere 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](https://www.govinfo.gov/content/pkg/FR-2004-09-23/pdf/E4-2349.pdf).\n\nThe 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](https://www.nasdaqtrader.com/TraderNews.aspx?id=ETA2021-29).\n\nNasdaq'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](https://listingcenter.nasdaq.com/rulebook/nasdaq/rules/nasdaq-equity-4).\n\n## Five compute blocks at one price\n\nConsider 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.\n\nSupplier 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.\n\nFor 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.\n\nAt $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.\n\nFive 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.\n\nBefore 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.\n\n## The cost of waiting together\n\nThe 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.\n\nCompute 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.\n\nNor 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.\n\nA 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.", "sources": [ { "id": "pct-source-sec-opening-20040923", "title": "Order Approving Proposed Rule Change Relating to Improved Nasdaq Opening Process, Release 34-50405", "publisher": "U.S. Securities and Exchange Commission / Federal Register", "url": "https://www.govinfo.gov/content/pkg/FR-2004-09-23/pdf/E4-2349.pdf", "published_at": "2004-09-23", "decision_date": "2004-09-16", "retrieved_at": "2026-11-09", "date_note": "Order dated September 16; Federal Register publication September 23. Dates read from document, not crawler metadata.", "evidence_type": "Primary regulator approval order", "supports": "Three-part original mechanism; automatic-execution participation dispute; Nasdaq response; SEC approval.", "verification": "Read official two-page PDF text, printed pages 57118–57119, sections II–V. No claim that stakeholder arguments establish realized effects.", "license_status": "U.S. federal government-authored order, generally public domain in the United States. Original paraphrase; no source layout or substantial quotation reproduced.", "publication_date": "2004-09-23", "observation_date": "2026-11-09" }, { "id": "pct-source-nasdaq-yearend-20050113", "title": "NASDAQ Announces Market Year-end Statistics for 2004", "publisher": "Nasdaq", "url": "https://ir.nasdaq.com/node/57576", "published_at": "2005-01-13", "retrieved_at": "2026-11-09", "date_note": "Publication date verified on page; December 2004 is the reported rollout-completion month, not the article date.", "evidence_type": "Primary exchange retrospective announcement", "supports": "Nasdaq reported completion of Opening Cross rollout to all Nasdaq-listed securities in December 2004.", "verification": "Read dated official HTML and NASDAQ Products and Services section. Promotional claims of accuracy or success are not adopted as independent empirical findings.", "license_status": "Copyright Nasdaq; factual paraphrase only. No data table, chart, logo or source prose reproduced.", "publication_date": "2005-01-13", "observation_date": "2026-11-09" }, { "id": "pct-source-nasdaq-opening-alert-20210416", "title": "Equity Trader Alert 2021-29: Reminder, Nasdaq to Implement Enhancements to the Opening Cross Process", "publisher": "Nasdaq Trader", "url": "https://www.nasdaqtrader.com/TraderNews.aspx?id=ETA2021-29", "published_at": "2021-04-16", "effective_date_announced": "2021-05-17", "retrieved_at": "2026-11-09", "date_note": "Notice date and announced effective date read from official page; historical notice not presented as proof of every current operational detail.", "evidence_type": "Primary exchange implementation notice", "supports": "Earlier information from 9:25, on-open cancellation/modification restrictions, and later qualified order entry under cutoffs.", "verification": "Read full operative announcement, including early-information fields, restrictions, and 9:28/9:29:30/9:30 cutoffs. Article intentionally gives a high-level summary.", "license_status": "Copyright Nasdaq; factual paraphrase only. No reproduction of specifications or market data.", "publication_date": "2021-04-16", "observation_date": "2026-11-09" }, { "id": "pct-source-nasdaq-rule4752-20261109", "title": "Nasdaq Equity 4, Rule 4752: Opening Process", "publisher": "Nasdaq Listing Center", "url": "https://listingcenter.nasdaq.com/rulebook/nasdaq/rules/nasdaq-equity-4", "published_at": null, "version_date": "2026-11-09", "retrieved_at": "2026-11-09", "date_note": "Continuously maintained rulebook, observed November 9, 2026. This is an observation date, not an asserted publication date; subsection has its own amendment history.", "evidence_type": "Primary exchange rules", "supports": "Price selection begins with maximum executions; further tie-breaks, price protections and cancellation conditions apply.", "verification": "Read Rule 4752(a) and (d), especially (d)(2)(A)–(F). Distinguishes indicative reference prices from actual cross-price selection. Simplified compute rule explicitly differs from Nasdaq.", "license_status": "Published exchange rules; no open-content license verified. Factual paraphrase only, with no substantial verbatim reproduction.", "publication_date": null, "observation_date": "2026-11-09" } ], "facts": [ { "id": "pct-20261109-formation-f01", "claim": "The SEC approved the new opening process on September 16, 2004; its order was published September 23 and described on-open orders, imbalance dissemination and a single-price cross.", "source_ids": [ "pct-source-sec-opening-20040923" ] }, { "id": "pct-20261109-formation-f02", "claim": "Nasdaq reported on January 13, 2005 that rollout to all Nasdaq-listed securities was completed in December 2004.", "source_ids": [ "pct-source-nasdaq-yearend-20050113" ] }, { "id": "pct-20261109-formation-f03", "claim": "The 2004 approval record includes Bloomberg’s objection to automatic-execution eligibility and Nasdaq’s response that iterative order delivery conflicted with simultaneous matching.", "source_ids": [ "pct-source-sec-opening-20040923" ] }, { "id": "pct-20261109-formation-f04", "claim": "An April 16, 2021 notice announced earlier imbalance information and on-open cancellation/modification restrictions, effective May 17, 2021.", "source_ids": [ "pct-source-nasdaq-opening-alert-20210416" ] }, { "id": "pct-20261109-formation-f05", "claim": "Rule 4752(d), read November 9, 2026, starts with maximizing executed shares and includes further tie-breaks, price protections and conditions in which no Opening Cross occurs.", "source_ids": [ "pct-source-nasdaq-rule4752-20261109" ] } ], "inferences": [ { "id": "pct-2026-11-09-formation-opening-cross-I001", "claim": "An announced compute auction could concentrate otherwise dispersed, compatible interest; this is a proposed design mechanism, not an established empirical benefit.", "label": "PCT editorial inference" }, { "id": "pct-2026-11-09-formation-opening-cross-I002", "claim": "For simultaneous compute matching, purchase authority and reserved capacity should precede execution, rather than leaving bilateral negotiation until after allocation.", "label": "PCT editorial inference" }, { "id": "pct-2026-11-09-formation-opening-cross-I003", "claim": "Restricting the auction to genuinely substitutable capacity improves interpretability but can reduce participation.", "label": "PCT editorial inference" }, { "id": "pct-2026-11-09-formation-opening-cross-I004", "claim": "Any evaluation of batch auctions should count waiting, abandoned demand and failed delivery alongside matched volume.", "label": "PCT editorial inference" } ], "unknowns": [ "No compute marketplace, provider or customer is reported to offer or accept the illustrative auction.", "All compute specifications, quantities, prices, limits, eligibility and willingness to wait in the example are invented assumptions, not market observations or supplier quotes.", "No causal estimate of the Nasdaq mechanism’s effect on liquidity, welfare or price accuracy is asserted.", "The proposed compute rule is not Nasdaq’s algorithm and is not claimed to be strategy-proof, welfare-optimal or legally approved.", "The example omits trading fees and taxes and assumes included delivery components are specified; actual delivered costs and performance require measurement.", "A small venue’s surrounding quotations, concentration, regulatory obligations, contract enforceability and remedies would need separate investigation." ], "correction_history": [], "license_status": "Original PCT editorial prose; public license not selected. Source rights remain separate. No source images, datasets, code or substantial quotations reproduced.", "public_url": null, "schema_version": "pct-research-item-1.0", "desk_extensions": { "estimated_reading_minutes": 5.0, "word_count": 1054, "historical_institution": "Nasdaq Opening Cross, introduced in 2004; original regulator record distinguished from 2021 changes and current rules.", "hypothetical_example": { "status": "Invented mechanism and order book; not a live offer, benchmark, transaction or investment recommendation.", "auction_time_utc": "10:00", "service_start_utc": "12:00", "gpus_per_block": 8, "service_hours": 4, "currency": "USD", "supply": [ { "seller": "A", "quantity_blocks": 3, "ask_per_block": 80 }, { "seller": "B", "quantity_blocks": 3, "ask_per_block": 100 }, { "seller": "C", "quantity_blocks": 2, "ask_per_block": 120 } ], "demand": [ { "buyer": "X", "quantity_blocks": 2, "bid_per_block": 150 }, { "buyer": "Y", "quantity_blocks": 3, "bid_per_block": 120 }, { "buyer": "Z", "quantity_blocks": 2, "bid_per_block": 90 } ], "rule": "Consider submitted price levels; maximize minimum of eligible supply and demand; minimize absolute supply-demand imbalance; lowest price if still tied. Allocate by price priority then a preannounced equal-price rule. Whole-block partial quantity fills allowed.", "clearing_price_per_block": 100, "matched_blocks": 5, "gpu_hours": 160, "gross_payment": 500, "price_per_gpu_hour_before_omitted_fees_taxes": 3.125, "supply_allocation": { "A": 3, "B": 2, "C": 0 }, "demand_allocation": { "X": 2, "Y": 3, "Z": 0 }, "limitations": [ "All blocks prequalified as substitutes for each buyer.", "Independent jobs; no multi-block all-or-nothing requirement.", "Trading fees and taxes omitted.", "Winning price does not demonstrate delivery, true valuation or competitive market conditions." ] }, "audit": { "primary_sources_only": true, "live_quote_claims": false, "historical_analogy_not_equivalence": true, "facts_separated_from_inference": true, "prior_topics_avoided": [ "freight clearing", "Nord Pool", "grain inspection", "airport slots", "gas recalls", "FCC repacking" ] }, "schema_version": "pct.article.v1", "dek": "Nasdaq's Opening Cross shows how a scheduled auction combines information, firm orders and allocation rules. A compute version must earn back the time customers spend waiting." }, "public_projection": { "version": "1.0.0", "date": "2026-11-10", "changes": [ "Internal workspace artifact paths omitted where present. Historical license/status fields retain original provenance; current public reuse policy is stated separately." ], "rights": "PCT reserves rights in original editorial content; third-party rights retained. No general source-data reuse license." } }