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/.
80 lines
2.8 KiB
TeX
80 lines
2.8 KiB
TeX
\documentclass[11pt,a4paper]{article}
|
|
\usepackage{../shared/luxcover}
|
|
\usepackage[utf8]{inputenc}
|
|
\usepackage[T1]{fontenc}
|
|
\usepackage{amsmath,amssymb,amsfonts,amsthm}
|
|
\usepackage{graphicx}
|
|
\usepackage{hyperref}
|
|
\usepackage{algorithm}
|
|
\usepackage{algpseudocode}
|
|
\usepackage{xcolor}
|
|
\usepackage{booktabs}
|
|
\usepackage{enumitem}
|
|
\usepackage{tikz}
|
|
\usepackage{tabularx}
|
|
\usepackage{mathtools}
|
|
\usepackage{multirow}
|
|
|
|
\hypersetup{colorlinks=true,linkcolor=black,citecolor=blue,urlcolor=blue}
|
|
|
|
\newtheorem{theorem}{Theorem}[section]
|
|
\newtheorem{lemma}[theorem]{Lemma}
|
|
\newtheorem{corollary}[theorem]{Corollary}
|
|
\newtheorem{proposition}[theorem]{Proposition}
|
|
\newtheorem{definition}{Definition}[section]
|
|
\newtheorem{remark}{Remark}[section]
|
|
\newtheorem{invariant}{Invariant}[section]
|
|
|
|
\title{\textbf{Comprehensive Security Model\\for the Lux Network}}
|
|
|
|
\author{
|
|
Zach Kelling \\
|
|
\textit{Lux Industries, Inc.}\\
|
|
\texttt{[email protected]}
|
|
}
|
|
|
|
\date{Original: 2023\quad|\quad Revised: February 2026}
|
|
|
|
\begin{document}
|
|
|
|
\luxcoverpage
|
|
|
|
\begin{abstract}
|
|
We present a comprehensive, layered security model for the Lux Network that makes
|
|
every security assumption explicit, every failure mode enumerated, and every trust
|
|
boundary documented. The model covers four adversary classes (classical, quantum,
|
|
economic, network-level), four protocol layers (consensus, transport, execution,
|
|
application), and three cryptographic assumption families (discrete logarithm for BLS,
|
|
lattice for ML-DSA and Pulsar, hash for STARK proofs). We prove that any two of the
|
|
three cryptographic assumption families sufficing for security (defense in depth),
|
|
enumerate what happens when each component breaks, and specify explicit trust
|
|
assumptions per component. The central invariant: \emph{every security claim in this
|
|
document is either formally proven, empirically tested with cited results, or
|
|
explicitly marked as an assumption}. No vague assertions. Triple-proof quantum finality
|
|
achieves 248 bytes per epoch, ${\sim}2$--$5$\,ms CPU verification, and 1\,ms block times.
|
|
|
|
\textbf{Keywords}: security model, threat model, blockchain security, defense in depth,
|
|
cryptographic assumptions, formal verification, trust boundaries
|
|
\end{abstract}
|
|
|
|
\tableofcontents
|
|
\newpage
|
|
|
|
%% ========================================================================
|
|
%% 1. INTRODUCTION
|
|
%% ========================================================================
|
|
|
|
\input{sections/01-introduction}
|
|
\input{sections/02-adversary-classes}
|
|
\input{sections/03-cryptographic-assumptions}
|
|
\input{sections/04-per-layer-security-guarantees}
|
|
\input{sections/05-failure-modes}
|
|
\input{sections/06-trust-assumptions}
|
|
\input{sections/07-formal-verification-status}
|
|
\input{sections/08-triple-proof-quantum-finality-summary}
|
|
\input{sections/09-the-invariant-machine-checkable-security}
|
|
\input{sections/10-related-work}
|
|
\input{sections/99-conclusion}
|
|
|
|
\end{document}
|