Archived
Every live market is subscribed on two connections chosen at random, and its book takes each change from whichever connection delivers it first: the book hash says whether a change is a duplicate, the next one, or one to hold until the change before it arrives. A change one connection misses costs nothing, each Delta carries the earliest receive time, and a connection that drops is covered by the other. When a change fits on no connection in time, the book follows one connection unchecked and asks the other for a fresh book. Connections now decode and route events to 16 book threads, independent of them; a move leaves its old connection only once the new one delivers, so it costs no change; a connection closed with 1013 twice within ten minutes is split. reconcile reads the collector's log and fails only on a mismatch no cause line explains. SIGTERM and SIGHUP stop the collector cleanly. Breaking: lanes are gone (connections and book threads are separate), and reconcile takes the log as a second argument.
48 lines
2.5 KiB
Markdown
48 lines
2.5 KiB
Markdown
# 0003. Two connections per symbol, first one wins
|
|
|
|
## Context
|
|
|
|
Extension 1 asks for redundant websockets: connections drop, go quiet, lag,
|
|
and get closed by the server (code 1013) when they carry too much. Sprint 03
|
|
gave each lane a connection and a book thread of its own
|
|
([0002](0002-lanes-and-orchestrator.md)). The obvious next step was a second,
|
|
identical connection per lane, one of them the trusted source, with a
|
|
Snapshot at each switch, as the brief sketches. Measured on 2026-11-11
|
|
([sprint 04](../../roadmap/04.%20redundant%20connections.md)): two connections
|
|
on the same symbols deliver the same changes in the same order, 0.5 ms apart
|
|
at the median and 100 ms or more for 1% of changes; and two connections
|
|
carrying the same symbols are closed together.
|
|
|
|
## Decision
|
|
|
|
Every symbol is subscribed on **two connections chosen independently and at
|
|
random**, and its one book takes each change from **whichever connection
|
|
delivers it first**. Polymarket's book hash, sent with every change, says
|
|
where a change belongs: already applied (a duplicate), next (it fits and is
|
|
written), or early (held until the change before it arrives). Only when a
|
|
change fits on no connection in time does the book thread fall back to
|
|
following one connection unchecked and resyncing on the other.
|
|
|
|
Connections therefore no longer belong to a book thread. A connection thread
|
|
stamps, parses and routes each event to the book thread of its market, one of
|
|
16, derived from the market's id. The orchestrator of 0002 stays; its lanes
|
|
are superseded.
|
|
|
|
## Why
|
|
|
|
First one wins gives each Delta the earliest receive time, turns a change one
|
|
connection missed into no loss at all, and needs no second book and no
|
|
Snapshot per switch. A source and a standby would have kept the source's
|
|
receive time and lost the change the source missed. Independent connections
|
|
were measured against twins on the same 48,038 symbols for 20 minutes: 272
|
|
symbol-seconds with both subscriptions down, against 3,787 for twins dealt at
|
|
random and 33,345 for twins in creation order. A move becomes a subscribe and
|
|
an unsubscribe with the book left where it is, so it opens no subscription
|
|
gap.
|
|
|
|
Trade-off: the routing step 0002 avoided is back, parsing moves into the
|
|
connection thread, and the book thread's rules get subtler (held changes, a
|
|
ceiling, a chain declared broken). The design leans on an exchange that lets
|
|
the same change be recognised across connections: Polymarket's hash does;
|
|
Kalshi's `clock` looks as if it would (to confirm in M6).
|