mirror of
https://github.com/lux-apps/papers.git
synced 2026-10-30 18:15:21 +00:00
zeekay
dd93cb41f7
Sweep across the non-Tier-1 paper catalogue (Tier-1 owned by parallel
agent and excluded). All 113 processed papers already had luxcover
wired up; this commit fixes 14 build breakers and produces fresh
PDFs across the catalogue.
Fixes:
- lux-blockchain-scaling-laws: em-dash inside lstlisting -> --
- lux-corona-pq: stale \input pointing at 03-the-corona-scheme renamed
to 03-the-corona-scheme (file already renamed on disk)
- lux-lattice-cryptography-primer: same Corona->Corona rename
- lux-formal-verification-lean4: Lean source uses unicode (×, ∀, ∃, ∈,
∧, ∨, ∩, ≠, ⟨, ⟩, ·, ¬) inside lstlistings. Added a literate map
so listings render the math glyphs without UTF-8 fault.
- lux-id-did-specification: ✓/✗ in tabular replaced with \ding{51}
/ \ding{55} (pifont). Added pifont package.
- lux-ntt-simd-implementation: middle-dot in Go assembly listings;
added literate {·}{\textperiodcentered}.
- lux-ntt-transform: μ, ×, –, — in regular text (no T1 fontenc).
Replaced with $\mu$/$\times$/--/--- via unicode->latex sweep.
- lux-perpetuals-derivatives, lux-quantum-consensus,
lux-quasar-consensus, lux-tee-computing-mesh: same unicode->latex
sweep across body text. Also fixed broken math segment
`$L_{avg} = 10$\times$$` -> `$L_{avg} = 10\times$`.
- lux-zchain: emoji glyphs in roadmap table replaced with
parenthetical text.
- lux-triple-proof-consensus: dropped duplicate \usepackage{geometry}
that clashed with luxcover (geometry option clash).
- pq: defined missing \Rq macro.
PDFs rebuilt for the full Tier-2/3 set.
Excluded (Tier-1, parallel agent): lp-073-pulsar, lp-stricte2epq,
dag-evm-formal, lp-010-quasar-stm-{3,4}, lp-020-quasar-consensus,
lux-institutional-custody, lux-nist-mptc-submission, pqsafe-il5,
pq-rns, plus shared/ and lps/.
96 lines
3.4 KiB
TeX
96 lines
3.4 KiB
TeX
\documentclass[11pt,a4paper]{article}
|
|
\usepackage{../shared/luxcover}
|
|
\usepackage[utf8]{inputenc}
|
|
\usepackage{amsmath,amssymb,amsfonts,amsthm}
|
|
\usepackage{graphicx}
|
|
\usepackage{hyperref}
|
|
\usepackage{algorithm}
|
|
\usepackage{algpseudocode}
|
|
\usepackage{listings}
|
|
\input{../shared/lstlang}
|
|
\usepackage{xcolor}
|
|
\usepackage{booktabs}
|
|
\usepackage{multirow}
|
|
\usepackage{array}
|
|
\usepackage{tikz}
|
|
\usepackage{pgfplots}
|
|
\usepackage[numbers]{natbib}
|
|
\usepackage{enumitem}
|
|
\usepackage{subcaption}
|
|
\pgfplotsset{compat=1.18}
|
|
|
|
\newtheorem{theorem}{Theorem}[section]
|
|
\newtheorem{lemma}[theorem]{Lemma}
|
|
\newtheorem{corollary}[theorem]{Corollary}
|
|
\newtheorem{definition}{Definition}[section]
|
|
\newtheorem{proposition}[theorem]{Proposition}
|
|
\newtheorem{remark}{Remark}[section]
|
|
|
|
\lstset{
|
|
basicstyle=\small\ttfamily,
|
|
keywordstyle=\color{blue}\bfseries,
|
|
commentstyle=\color{gray},
|
|
stringstyle=\color{red},
|
|
breaklines=true,
|
|
frame=single,
|
|
numbers=left,
|
|
numberstyle=\tiny\color{gray},
|
|
captionpos=b
|
|
}
|
|
|
|
\title{\textbf{Lux Consensus: Physics-Inspired Metastable Blockchain Consensus}}
|
|
|
|
\author{
|
|
Zach Kelling\thanks{Corresponding author: [email protected]}\\
|
|
\textit{Lux Industries, Inc.}\\
|
|
\texttt{[email protected]}
|
|
}
|
|
|
|
\date{Original: 2022\quad|\quad Revised: February 2026}
|
|
|
|
\begin{document}
|
|
|
|
\luxcoverpage
|
|
|
|
\begin{abstract}
|
|
We present Lux Consensus, a physics-inspired metastable consensus protocol that achieves
|
|
sub-second finality with high throughput while tolerating up to $f < n/3$ Byzantine faults.
|
|
Lux Consensus extends the metastable protocol family---Slush, Flare, Wave, and
|
|
Lux---with a directed acyclic graph (DAG) ordering layer, adaptive confidence
|
|
thresholds, and a novel metastability-breaking mechanism grounded in statistical mechanics
|
|
and phase transition theory. The protocol operates through repeated random subsampling of
|
|
the validator set, building confidence through emergent majority amplification rather than
|
|
explicit leader election. We prove that Lux achieves probabilistic safety with $1 - e^{-\Omega(k)}$
|
|
confidence, liveness under partial synchrony, and convergence in $O(\log n)$ communication
|
|
rounds with high probability. Empirical evaluation on a 1,000-node testnet demonstrates
|
|
sustained throughput of 4,500 transactions per second with median finality of 650
|
|
milliseconds, outperforming PBFT-family protocols at scale while maintaining Byzantine fault
|
|
tolerance equivalent to classical BFT systems. We provide formal proofs of safety, liveness,
|
|
and convergence, alongside rigorous parameterization analysis of the sampling parameters
|
|
$k$, $\alpha$, and $\beta$ that govern the protocol's security--performance trade-off.
|
|
Additionally, we present a mechanized verification in Lean~4 with Mathlib, producing
|
|
36 machine-checked theorems covering all protocol components, BFT threshold arithmetic,
|
|
and cryptographic primitive axiomatization.
|
|
\end{abstract}
|
|
|
|
\tableofcontents
|
|
\newpage
|
|
|
|
%% -----------------------------------------------------------------------
|
|
%% 1. INTRODUCTION
|
|
%% -----------------------------------------------------------------------
|
|
|
|
\input{sections/01-introduction}
|
|
\input{sections/02-background-and-related-work}
|
|
\input{sections/03-system-model}
|
|
\input{sections/04-the-lux-protocol}
|
|
\input{sections/05-formal-analysis}
|
|
\input{sections/06-parameterization}
|
|
\input{sections/07-implementation}
|
|
\input{sections/08-evaluation}
|
|
\input{sections/09-security-considerations}
|
|
\input{sections/10-formal-verification}
|
|
\input{sections/99-conclusion}
|
|
|
|
\end{document}
|