mirror of
https://github.com/lux-apps/papers.git
synced 2026-11-03 05:07:46 +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/.
69 lines
3.1 KiB
TeX
69 lines
3.1 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{booktabs}
|
|
\usepackage{multirow}
|
|
\usepackage{array}
|
|
\usepackage{xcolor}
|
|
\usepackage{tikz}
|
|
\usepackage{float}
|
|
\usepackage{enumitem}
|
|
\usepackage{mathtools}
|
|
\usetikzlibrary{arrows.meta,positioning,shapes.geometric}
|
|
|
|
\newtheorem{theorem}{Theorem}
|
|
\newtheorem{lemma}[theorem]{Lemma}
|
|
\newtheorem{proposition}[theorem]{Proposition}
|
|
\newtheorem{definition}{Definition}
|
|
\newtheorem{corollary}[theorem]{Corollary}
|
|
\newtheorem{remark}{Remark}
|
|
|
|
\hypersetup{
|
|
colorlinks=true,
|
|
linkcolor=blue,
|
|
citecolor=blue,
|
|
urlcolor=blue
|
|
}
|
|
|
|
\title{\textbf{Lux Warp Messaging: Cross-Appchain Communication\\with BLS Aggregate Signatures}\\[6pt]
|
|
\large Efficient, Trustless Message Relay Between Sovereign Chains\\via Multi-Signature Verification and Optimistic Delivery}
|
|
|
|
\author{
|
|
Zach Kelling\thanks{Corresponding author: [email protected]}\\
|
|
\textit{Lux Industries, Inc.}\\
|
|
\texttt{[email protected]}
|
|
}
|
|
|
|
\date{2023}
|
|
|
|
\begin{document}
|
|
|
|
\luxcoverpage
|
|
|
|
\begin{abstract}
|
|
We present Lux Warp Messaging (LWM), a cross-appchain communication protocol that enables trustless message passing between sovereign blockchains within the Lux Network ecosystem. LWM leverages BLS aggregate signatures over the BLS12-381 curve to achieve compact, efficiently verifiable proofs of cross-chain messages without requiring a trusted relay chain or committee. A message originating on a source appchain is signed by a quorum of the source appchain's validators; the aggregate signature, together with a bitmap identifying signers and their stake weights, constitutes a succinct proof verifiable on any destination appchain. We formalize the protocol's security properties, proving that message authenticity holds under a $2/3$ honest-stake assumption and that liveness is preserved as long as at least $2/3$ of the source appchain's weighted validators are online. We introduce an optimistic delivery mode that reduces end-to-end latency from $O(\Delta_{\text{finality}})$ to $O(\Delta_{\text{block}})$ by allowing relayers to submit messages before full finality, with a dispute window for fraud proofs. Empirical benchmarks demonstrate that LWM achieves sub-second cross-appchain message verification with aggregate signature sizes of 48 bytes regardless of the number of signers, and total message overhead below 500 bytes for appchains with up to 1,000 validators.
|
|
\end{abstract}
|
|
|
|
\input{sections/01-introduction}
|
|
\input{sections/02-preliminaries}
|
|
\input{sections/03-protocol-specification}
|
|
\input{sections/04-security-analysis}
|
|
\input{sections/05-optimistic-delivery}
|
|
\input{sections/06-relay-network-design}
|
|
\input{sections/07-validator-set-tracking}
|
|
\input{sections/08-message-batching}
|
|
\input{sections/09-comparison-with-existing-protocols}
|
|
\input{sections/10-empirical-benchmarks}
|
|
\input{sections/11-protocol-extensions}
|
|
\input{sections/12-formal-verification-status}
|
|
\input{sections/13-related-work}
|
|
\input{sections/99-conclusion}
|
|
|
|
\end{document}
|