mirror of
https://github.com/lux-apps/papers.git
synced 2026-10-30 18:15:21 +00:00
zeekay
abf99d05fc
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.
35 lines
1.4 KiB
TeX
35 lines
1.4 KiB
TeX
\section{Comparison with Other Consensus Protocols}
|
|
|
|
\label{sec:comparison}
|
|
|
|
\begin{table}[h]
|
|
\centering
|
|
\begin{tabular}{lcccc}
|
|
\toprule
|
|
\textbf{Protocol} & \textbf{Message} & \textbf{Finality} & \textbf{Safety} & \textbf{Adaptive} \\
|
|
& \textbf{Complexity} & & & \textbf{Threshold} \\
|
|
\midrule
|
|
PBFT & $O(n^2)$ & Deterministic & 100\% & No \\
|
|
HotStuff & $O(n)$ & Deterministic & 100\% & No \\
|
|
Tendermint & $O(n)$ & Deterministic & 100\% & No \\
|
|
Wave (fixed-$\theta$)~\cite{rocket2018wave} & $O(k \log n)$ & Probabilistic & 99.9\% & No \\
|
|
\textbf{FPC (Wave, adaptive-$\theta$)} & $O(k \log n)$ & Probabilistic & 99.999\% & \textbf{Yes} \\
|
|
\bottomrule
|
|
\end{tabular}
|
|
\caption{Comparison of consensus protocols}
|
|
\label{tab:comparison}
|
|
\end{table}
|
|
|
|
\subsection{vs. Fixed-Threshold Sampling (Wave without FPC)}
|
|
|
|
Fixed-threshold sampling protocols~\cite{rocket2018wave} use a constant decision threshold which can cause metastability. FPC's adaptive thresholds prevent oscillation while maintaining similar message complexity.
|
|
|
|
\subsection{vs. PBFT/HotStuff}
|
|
|
|
Traditional BFT protocols provide absolute safety but suffer from quadratic or linear message complexity. FPC trades negligible safety probability for logarithmic scaling.
|
|
|
|
\subsection{vs. Nakamoto Consensus}
|
|
|
|
Nakamoto consensus provides probabilistic finality through proof-of-work. FPC achieves faster finality (seconds vs. hours) with explicit Byzantine fault tolerance.
|
|
|