mirror of
https://github.com/lux-apps/papers.git
synced 2026-11-02 11:39:52 +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/.
53 lines
2.3 KiB
TeX
53 lines
2.3 KiB
TeX
\documentclass[11pt,a4paper]{article}
|
|
\usepackage{../shared/luxcover}
|
|
\usepackage[utf8]{inputenc}
|
|
\usepackage[T1]{fontenc}
|
|
\usepackage{amsmath,amssymb,amsfonts,amsthm}
|
|
\usepackage{hyperref}
|
|
\usepackage{booktabs}
|
|
\usepackage{enumitem}
|
|
\usepackage{xcolor}
|
|
\usepackage{tikz}
|
|
\usepackage{pgfplots}
|
|
\pgfplotsset{compat=1.18}
|
|
\usetikzlibrary{arrows.meta,positioning}
|
|
|
|
\hypersetup{colorlinks=true,linkcolor=black,citecolor=blue,urlcolor=blue}
|
|
|
|
\newtheorem{theorem}{Theorem}[section]
|
|
\newtheorem{lemma}[theorem]{Lemma}
|
|
\newtheorem{definition}{Definition}[section]
|
|
\newtheorem{observation}{Observation}[section]
|
|
|
|
\title{Performance vs Security Tradeoffs\\in Cryptographic Infrastructure}
|
|
|
|
\author{
|
|
Zach Kelling \\
|
|
Lux Industries, Inc.\\
|
|
\texttt{[email protected]}
|
|
}
|
|
|
|
\date{2024}
|
|
|
|
\begin{document}
|
|
|
|
\luxcoverpage
|
|
|
|
\begin{abstract}
|
|
Security systems that are too slow to use get bypassed. We quantify the performance cost of every cryptographic primitive deployed in the Lux network: MPC threshold signing (50ms at 2-of-3 to 1.2s at 20-of-50), FHE bootstrapping (12ms per gate, 1000--10000$\times$ cleartext), BLS aggregation ($O(1)$ verification regardless of validator count), ML-DSA signatures (3,309 bytes, 51.7$\times$ ECDSA), STARK aggregation ($O(\log N)$ verification compressing $N$ signatures to $\sim$200 bytes), and triple-proof epoch finality (248 bytes, ${\sim}2$--$5$\,ms CPU QuasarCert verification). We measure each primitive on production hardware and present a benchmark table with actual values. We analyze the practical constraint that defines the Lux architecture: achieving sub-second finality with post-quantum security on commodity hardware. The conclusion is that no single primitive satisfies all requirements; the architecture must compose primitives across time scales (per-block classical speed, per-epoch post-quantum security) and across trust models (BLS for speed, MPC for distribution, FHE for privacy).
|
|
\end{abstract}
|
|
|
|
\input{sections/01-introduction}
|
|
\input{sections/02-mpc-latency-vs-threshold-size}
|
|
\input{sections/03-fhe-compute-cost}
|
|
\input{sections/04-bls-aggregation}
|
|
\input{sections/05-ml-dsa-signature-size}
|
|
\input{sections/06-stark-aggregation}
|
|
\input{sections/07-triple-proof-overhead}
|
|
\input{sections/08-storage-scaling}
|
|
\input{sections/09-the-practical-constraint}
|
|
\input{sections/10-benchmark-summary}
|
|
\input{sections/99-conclusion}
|
|
|
|
\end{document}
|