mirror of
https://github.com/lux-apps/papers.git
synced 2026-11-03 05:07:46 +00:00
zeekay
4a753bb639
Restructured from flat .tex/.pdf files into per-paper subdirectories. Added Antje Worring as co-author on all papers. Synced PDFs to pdfs/ for download site.
51 lines
1.5 KiB
TeX
51 lines
1.5 KiB
TeX
\section{Comparison with ZK-Rollups}
|
|
|
|
|
|
We compare optimistic rollups with fraud proofs against ZK-rollups across multiple dimensions.
|
|
|
|
\begin{table}[h]
|
|
\centering
|
|
\caption{Optimistic vs ZK-Rollup Comparison}
|
|
\begin{tabular}{lll}
|
|
\toprule
|
|
\textbf{Feature} & \textbf{Optimistic Rollup} & \textbf{ZK-Rollup} \\
|
|
\midrule
|
|
Proof overhead & Low (only if challenged) & High (every batch) \\
|
|
Finality time & 7 days (typical) & 10 minutes \\
|
|
Security model & 1-of-N honest assumption & Cryptographic \\
|
|
EVM compatibility & Native & Requires zkEVM \\
|
|
Proof generation cost & \$10-100 & \$1000-10000 \\
|
|
Verifier complexity & Medium & Low \\
|
|
Data availability & Full transaction data & Proof + state diff \\
|
|
Capital requirements & High (bonds) & Low \\
|
|
\bottomrule
|
|
\end{tabular}
|
|
\end{table}
|
|
|
|
\subsection{Security Model Comparison}
|
|
|
|
Optimistic rollups rely on game-theoretic security:
|
|
\begin{equation}
|
|
\text{Security}_{\text{OR}} = P(\text{at least one honest challenger})
|
|
\end{equation}
|
|
|
|
ZK-rollups provide cryptographic security:
|
|
\begin{equation}
|
|
\text{Security}_{\text{ZK}} = 1 - P(\text{break cryptographic assumptions})
|
|
\end{equation}
|
|
|
|
\subsection{Cost Analysis}
|
|
|
|
The amortized cost per transaction:
|
|
|
|
\begin{equation}
|
|
\text{Cost}_{\text{OR}} = \frac{\text{Data Cost} + P(\text{challenge}) \times \text{Challenge Cost}}{n}
|
|
\end{equation}
|
|
|
|
\begin{equation}
|
|
\text{Cost}_{\text{ZK}} = \frac{\text{Data Cost} + \text{Proof Generation Cost}}{n}
|
|
\end{equation}
|
|
|
|
where $n$ is the number of transactions in a batch.
|
|
|