mirror of
https://github.com/lux-apps/papers.git
synced 2026-10-30 18:15:21 +00:00
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.
46 lines
1.4 KiB
TeX
46 lines
1.4 KiB
TeX
\section{STARK Aggregation}
|
|
|
|
|
|
STARK proofs compress $N$ cryptographic statements into a single succinct proof.
|
|
|
|
\subsection{ML-DSA Signature Aggregation}
|
|
|
|
\begin{center}
|
|
\begin{tabular}{rrrr}
|
|
\toprule
|
|
\textbf{$N$ (validators)} & \textbf{Z-Chain ZKP} & \textbf{STARK proof} & \textbf{Compression} \\
|
|
\midrule
|
|
10 & 33,090 B & 198 B & 167$\times$ \\
|
|
50 & 165,450 B & 202 B & 819$\times$ \\
|
|
100 & 330,900 B & 205 B & 1,614$\times$ \\
|
|
500 & 1,654,500 B & 210 B & 7,878$\times$ \\
|
|
1,000 & 3,309,000 B & 213 B & 15,535$\times$ \\
|
|
\bottomrule
|
|
\end{tabular}
|
|
\end{center}
|
|
|
|
\begin{observation}[STARK Scaling]
|
|
STARK proof size grows as $O(\log N)$. Verification time is also $O(\log N)$. This makes STARK aggregation the enabling technology for post-quantum consensus at scale.
|
|
\end{observation}
|
|
|
|
\subsection{Proof Generation Cost}
|
|
|
|
The cost is proof generation, not verification:
|
|
|
|
\begin{center}
|
|
\begin{tabular}{rrrr}
|
|
\toprule
|
|
\textbf{$N$} & \textbf{Generation Time} & \textbf{Memory} & \textbf{Verification Time} \\
|
|
\midrule
|
|
10 & 120ms & 45 MB & 2.1ms \\
|
|
50 & 340ms & 180 MB & 2.8ms \\
|
|
100 & 580ms & 350 MB & 3.2ms \\
|
|
500 & 1.8s & 1.2 GB & 4.1ms \\
|
|
1,000 & 3.5s & 2.4 GB & 4.7ms \\
|
|
\bottomrule
|
|
\end{tabular}
|
|
\end{center}
|
|
|
|
At 100 validators, proof generation (580ms) fits within the 1-second epoch window. At 1,000 validators, generation (3.5s) exceeds a single epoch but can be pipelined (generate epoch $e$'s proof during epochs $e+1$ through $e+3$).
|
|
|