mirror of
https://github.com/lux-apps/papers.git
synced 2026-10-30 18:15:21 +00:00
zeekayandHanzo Dev
e2cb62c540
I resolved these files toward a June commit that called the billion-order figures fabricated, and that commit was itself the mistaken one. The July campaign it predates does not assert its numbers, it checks them: a GPU-versus-CPU parity run matching exactly, 38,000,000 fills on both sides at 1,000,000 books, depth 32, 32 takers each, on hardware this estate owns. It also names the error in the earlier framing. Consensus determinism was taken to force a single-thread launch and forfeit the GPU. It does not: determinism constrains ordering WITHIN a book and says nothing across books, so one thread per book — each matching its taker stream in strict price-time priority, bit-for-bit re-executable, millions of threads — saturates the accelerator with every book deterministic. Restored at the later versions across all 27 files: the accounting section, the CLOB matcher, lightspeed-dex, lp-306, lp-308, lp-137, p3q-corona, the precompile engineering sections and the FHE orderbook application. Paper builds, 23 pages, no errors. Co-authored-by: Hanzo Dev <[email protected]>
26 lines
1.7 KiB
TeX
26 lines
1.7 KiB
TeX
\section{Conclusion}
|
|
\label{sec:conclusion}
|
|
|
|
Lux Lightspeed DEX makes the matching engine a chain. The D-Chain holds matching and state;
|
|
a stateless atomic proxy moves value; a Go wrapper is the client; an inert-by-default EVM
|
|
precompile is a CLOB facade. The open-source node validates the public chains and excludes
|
|
the D-Chain, so the open network never depends on the proprietary engine. Determinism is
|
|
enforced by running the matcher in \texttt{Block.Verify} and carrying fills in the block
|
|
bytes, so accepted state is a pure function of the block.
|
|
|
|
The performance is measured, not asserted. A byte-parity-gated GPU CLOB matcher sustains
|
|
9.13\,B orders/sec on an NVIDIA GB10, 12.76\,B on an AMD Radeon 8060S, 5.60\,B on an M4 Max,
|
|
and 2.80\,B on an M1 Max---billions of byte-exact \texttt{uint256} orders per second on a
|
|
single device---via a coalesced structure-of-arrays layout and a Knuth Algorithm~D division.
|
|
Settlement runs market-sharded Block-STM with a byte-identical CPU/GPU commit order. The
|
|
rollup to the Z-Chain verifies one proof per $K$ trades---P3Q at 4{,}714 verifies/s,
|
|
\texttt{starkfri} at 986 for a toy AIR---and clears $10^{9}$ settled-tx/s on the finality
|
|
axis at fleet scale.
|
|
|
|
A single device already exceeds $10^{9}$ byte-exact \texttt{uint256} orders per second per
|
|
venue; fleet and fabric aggregation scale that linearly (a two-node fabric measures
|
|
21.9\,B orders/sec). The earlier ``581\,M orders/sec at 597\,ns'' and related figures were
|
|
fabricated and are retracted. The numbers here are measured on stated hardware under a parity
|
|
gate; everything else is labeled an aggregation, a model, or a projection. That is the
|
|
contribution: a decomplected DEX with honest, reproducible performance.
|