papers/lp-307-quantum-consensus-protocol/sections/07-2026-status-mapping-qcp-to-quasar.tex

\section{2026 Status: Mapping QCP to Quasar}
\label{sec:status}

The Quantum Consensus Protocol was a 2023 research exploration. The
production consensus protocol for Lux Network is Quasar (LP-020),
which incorporates several QCP ideas while departing from others.

\subsection{What Was Adopted}

\begin{itemize}[nosep]
  \item \textbf{Lattice-based cryptographic foundation}: Quasar uses
        Pulsar lattice signatures alongside BLS-381, providing
        post-quantum security at the consensus layer. The lattice
        hardness assumptions (SVP, LWE) that underpin QCP's Eisenstein
        approach also underpin Pulsar.
  \item \textbf{Classical verification of quantum-hard problems}: Quasar
        maintains the asymmetry principle---consensus proofs are
        classically verifiable even though the underlying cryptographic
        assumptions are quantum-resistant.
  \item \textbf{Leaderless architecture}: QCP's model where any
        proposer can submit a valid proof influenced Quasar's leaderless
        design, where all validators participate symmetrically.
  \item \textbf{Difficulty as a protocol parameter}: The concept of
        network-adaptive difficulty evolved into Quasar's dynamic
        validator weighting based on stake and performance.
\end{itemize}

\subsection{What Remained Theoretical}

\begin{itemize}[nosep]
  \item \textbf{Eisenstein series as consensus kernel}: The specific use
        of modular forms for difficulty proofs was not adopted. Quasar
        uses BLS aggregate signatures and ML-DSA for consensus
        votes---simpler, well-audited, and no quantum hardware needed.
  \item \textbf{Quantum proposal advantage}: Quasar does not give
        quantum-equipped validators any advantage. All validators
        participate equally. The economic incentive model is
        stake-based, not computation-based.
  \item \textbf{Amplitude amplification for parameter search}: Without
        a computation-based proof requirement, Grover search has no
        role in Quasar.
  \item \textbf{Quantum circuit implementation}: No quantum hardware
        dependency exists in the production protocol. Quasar runs on
        classical hardware with post-quantum cryptographic primitives
        (ML-DSA-65, Pulsar, ML-KEM-768).
\end{itemize}

\subsection{Assessment}

QCP demonstrated that quantum computational structure (specifically,
the analytic properties of Eisenstein series over lattices) could in
principle be harnessed for consensus. The convergence bounds
(Theorem~\ref{thm:truncation}) and the difficulty search framework
remain mathematically sound. However, the practical path to
post-quantum consensus turned out to be simpler: use post-quantum
\emph{signatures} on a classical consensus protocol, rather than
building a consensus protocol that requires quantum \emph{computation}.

Quasar achieves the same security goals---BFT safety, sub-second
finality, post-quantum resistance---without requiring quantum hardware,
which is the correct engineering tradeoff for a production network in
2026.

%% ============================================================