mirror of
https://github.com/lux-apps/papers.git
synced 2026-10-30 18:15:21 +00:00
zeekay
f4ee7a0525
Bylines, paper authorship, correspondence addresses and the founder blurb under each post named an individual. They name the organisation that published the work instead: the brand on posts and pages, the research byline on papers, and research@ in place of a personal address. Both are what these repositories already used elsewhere — nothing new was coined. Co-authors are untouched. Where a paper named someone else alongside, they stay named; only the one byline changed. Bibliography entries, running heads, PDF metadata and affiliations move with it, so a citation still resolves to whoever the cited paper names. Sample and fixture data uses the placeholder name these tests already use elsewhere, so no assertion changed meaning.
102 lines
4.3 KiB
TeX
102 lines
4.3 KiB
TeX
\documentclass[11pt,a4paper]{article}
|
|
\usepackage{../shared/luxcover}
|
|
\usepackage[utf8]{inputenc}
|
|
\usepackage[T1]{fontenc}
|
|
\usepackage{amsmath,amssymb,amsthm}
|
|
\usepackage{graphicx}
|
|
\usepackage{algorithm}
|
|
\usepackage{algpseudocode}
|
|
\usepackage{tikz}
|
|
\usepackage{pgfplots}
|
|
\usepackage{booktabs}
|
|
\usepackage{hyperref}
|
|
\usepackage{cleveref}
|
|
\usepackage{listings}
|
|
\input{../shared/lstlang}
|
|
\usepackage{xcolor}
|
|
\usepackage{multicol}
|
|
\usepackage{caption}
|
|
\usepackage{subcaption}
|
|
|
|
\usetikzlibrary{automata, positioning, arrows.meta, shapes.geometric}
|
|
\pgfplotsset{compat=1.17}
|
|
|
|
% Define colors for code listings
|
|
\definecolor{codegreen}{rgb}{0,0.6,0}
|
|
\definecolor{codegray}{rgb}{0.5,0.5,0.5}
|
|
\definecolor{codepurple}{rgb}{0.58,0,0.82}
|
|
\definecolor{backcolour}{rgb}{0.95,0.95,0.92}
|
|
|
|
% Code listing style
|
|
\lstdefinestyle{mystyle}{
|
|
backgroundcolor=\color{backcolour},
|
|
commentstyle=\color{codegreen},
|
|
keywordstyle=\color{magenta},
|
|
numberstyle=\tiny\color{codegray},
|
|
stringstyle=\color{codepurple},
|
|
basicstyle=\ttfamily\footnotesize,
|
|
breakatwhitespace=false,
|
|
breaklines=true,
|
|
captionpos=b,
|
|
keepspaces=true,
|
|
numbers=left,
|
|
numbersep=5pt,
|
|
showspaces=false,
|
|
showstringspaces=false,
|
|
showtabs=false,
|
|
tabsize=2
|
|
}
|
|
\lstset{style=mystyle}
|
|
|
|
% Theorem environments
|
|
\theoremstyle{definition}
|
|
\newtheorem{definition}{Definition}[section]
|
|
\newtheorem{theorem}{Theorem}[section]
|
|
\newtheorem{lemma}{Lemma}[section]
|
|
\newtheorem{proposition}{Proposition}[section]
|
|
\newtheorem{corollary}{Corollary}[section]
|
|
\newtheorem{example}{Example}[section]
|
|
\newtheorem{remark}{Remark}[section]
|
|
|
|
\title{Fraud Proofs: Optimistic Rollup Security on Lux with Interactive Verification}
|
|
\author{
|
|
Lux Research\thanks{Corresponding author: [email protected]}\\
|
|
\textit{Lux Industries, Inc.}\\
|
|
\texttt{[email protected]}
|
|
}
|
|
\date{2020}
|
|
|
|
\begin{document}
|
|
|
|
\luxcoverpage
|
|
|
|
\begin{abstract}
|
|
We present a comprehensive fraud proof system for optimistic rollups on the Lux network, implementing an interactive bisection protocol that efficiently identifies and proves invalid state transitions. Our system supports one-step execution verification on-chain, multi-round challenges with logarithmic complexity, and specialized fraud proofs for AI compute operations including model inference verification and gradient computation validation. The design minimizes on-chain computation while maintaining security through game-theoretic incentives and stake-based participation. We introduce novel techniques for verifying AI workloads through layer-wise neural network verification, sumcheck protocols for matrix operations, and gradient checking mechanisms. The system integrates seamlessly with Lux's multi-chain architecture, enabling cross-chain fraud detection and appchain-based rollup execution. Our analysis demonstrates that the protocol achieves optimal challenge resolution in $O(\log n)$ rounds while maintaining economic security through progressive slashing and reward mechanisms. Comparison with existing systems shows significant improvements in verification efficiency for AI workloads while maintaining compatibility with standard EVM operations.
|
|
\end{abstract}
|
|
|
|
\input{sections/01-introduction}
|
|
\input{sections/02-optimistic-rollup-architecture}
|
|
\input{sections/03-fraud-proof-basics}
|
|
\input{sections/04-interactive-bisection-game}
|
|
\input{sections/05-bisection-protocol-implementation}
|
|
\input{sections/06-one-step-proof-verification}
|
|
\input{sections/07-lux-implementation-details}
|
|
\input{sections/08-economic-incentives}
|
|
\input{sections/09-security-analysis}
|
|
\input{sections/10-challenge-period-trade-offs}
|
|
\input{sections/11-comparison-with-zk-rollups}
|
|
\input{sections/12-comparison-with-other-optimistic-systems}
|
|
\input{sections/13-data-availability-solutions}
|
|
\input{sections/14-fault-attribution}
|
|
\input{sections/15-cross-chain-fraud-proofs}
|
|
\input{sections/16-ai-computation-fraud-proofs}
|
|
\input{sections/17-implementation-challenges}
|
|
\input{sections/18-performance-metrics}
|
|
\input{sections/19-future-improvements}
|
|
\input{sections/20-mathematical-foundations}
|
|
\input{sections/21-conclusion}
|
|
\input{sections/22-detailed-protocol-specifications}
|
|
\input{sections/23-references-implementation-code}
|
|
|
|
\end{document}
|