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.
43 lines
1.7 KiB
TeX
43 lines
1.7 KiB
TeX
\section{Consensus Protocol Design}
|
|
|
|
|
|
\subsection{Protocol Overview}
|
|
|
|
The Quantum Consensus Protocol operates in rounds. Each round:
|
|
|
|
\begin{enumerate}[nosep]
|
|
\item The network publishes a difficulty target $\tau_r$ and window
|
|
$\Delta_r$ derived from the previous $w$ rounds.
|
|
\item Each proposer searches for $(N^*, z^*)$ satisfying the
|
|
difficulty condition.
|
|
\item The first valid proposal is broadcast with a proof
|
|
$(N^*, z^*, \tilde{G}_k^{(N^*)}(z^*))$.
|
|
\item Validators verify the proof classically and vote.
|
|
\item After $\geq 2n/3 + 1$ votes, the round finalizes.
|
|
\end{enumerate}
|
|
|
|
\subsection{Security Properties}
|
|
|
|
\begin{itemize}[nosep]
|
|
\item \textbf{Safety}: Follows from the BFT voting threshold. No two
|
|
conflicting proposals can both receive $> 2n/3$ votes.
|
|
\item \textbf{Liveness}: Guaranteed as long as $> 2n/3$ validators
|
|
are honest and at least one proposer can evaluate the Eisenstein
|
|
oracle (classically or quantum).
|
|
\item \textbf{Quantum advantage}: Proposers with quantum hardware find
|
|
valid parameters in $O(\sqrt{M/t})$ vs $O(M/t)$ time, but cannot
|
|
forge proofs or bypass the voting threshold.
|
|
\end{itemize}
|
|
|
|
\subsection{Economic Considerations}
|
|
|
|
The protocol creates a natural market for quantum computing resources:
|
|
validators who invest in quantum hardware produce blocks faster,
|
|
earning proportionally more rewards. As quantum hardware commoditizes,
|
|
the difficulty window narrows, maintaining target block times. This is
|
|
analogous to the ASIC arms race in proof-of-work, but with the
|
|
important difference that quantum advantage is bounded (quadratic, not
|
|
exponential) and verification remains classical.
|
|
|
|
%% ============================================================
|