mirror of
https://github.com/lux-apps/papers.git
synced 2026-10-30 18:15:21 +00:00
The seven engine specifications (lux-{photon,wave,nova,nebula,prism,ray,field}-protocol)
were fragmented short notes documenting layers of the same Quasar consensus stack.
This commit merges them into a single canonical reference, lux-consensus-engines.tex,
that uses one preamble, one set of theorems, one bibliography, and one composition
chapter showing how the engines layer into the LP-020 finality pipeline.
The seven originals are reduced to single-page breadcrumb stubs pointing at the
consolidated paper; their sections/ content is preserved on disk for git history.
- new: lux-consensus-engines/ (50 pages, 646KB PDF, ~2900 lines tex)
- breadcrumbs: each original keeps cover + title + stub paragraph naming its chapter
- composition: chapter 9 records the layered contract Photon < Wave < Nova < ...
- bibliography: consolidated from the seven original thebibliography blocks
34 lines
1.9 KiB
TeX
34 lines
1.9 KiB
TeX
\section{Introduction}
|
|
|
|
\label{sec:prism-introduction}
|
|
|
|
The throughput of a single consensus instance is fundamentally limited by the per-round
|
|
message complexity and the finality latency. Even with pipelining (Photon) and burst
|
|
finalization (Nova), a single consensus instance processes transactions sequentially
|
|
within each conflict set. For blockchains with diverse transaction types---token
|
|
transfers, smart contract calls, cross-chain messages, governance votes---the aggregate
|
|
throughput is limited by the busiest conflict set.
|
|
|
|
Prism addresses this by partitioning the consensus problem into independent spectrum
|
|
bands, each handling a subset of conflict sets. This is analogous to frequency-division
|
|
multiplexing in telecommunications: each band occupies a different ``frequency''
|
|
(conflict set partition) and processes transactions independently.
|
|
|
|
The challenge is ensuring global consistency: while each band finalizes independently,
|
|
the combined output must form a valid total order compatible with cross-band dependencies.
|
|
Prism's spectral combiner solves this through a deterministic merge algorithm that
|
|
respects the causal order of cross-band references.
|
|
|
|
\paragraph{Contributions.}
|
|
\begin{enumerate}[nosep]
|
|
\item The Prism multi-spectrum consensus protocol with hash-based band assignment (\S\ref{sec:prism-protocol}).
|
|
\item Conflict locality and load balance proofs (\S\ref{sec:prism-partition}).
|
|
\item The spectral combiner algorithm with order consistency proof (\S\ref{sec:prism-combiner}).
|
|
\item Direct voting fast path for uncontested decisions (\S\ref{sec:prism-voting}).
|
|
\item Linear throughput scaling demonstration: 50,000 TPS with 16 bands (\S\ref{sec:prism-evaluation}).
|
|
\end{enumerate}
|
|
|
|
%% -----------------------------------------------------------------------
|
|
%% 2. SPECTRAL DECOMPOSITION
|
|
%% -----------------------------------------------------------------------
|