papers/lp-020-quasar-consensus/sections/99-conclusion.tex at main

mirror of https://github.com/lux-apps/papers.git synced 2026-10-30 18:15:21 +00:00

Files

T

zooqueen 5225fa3df0 Pulsar papers: BCC/CEF byte-equal threshold ML-DSA + honest status

lp-073-pulsar (the dedicated Pulsar paper):
- Add §3.8 "Byte-equal threshold ML-DSA (BCC/CEF)": boundary clearance
  (offline, message-independent), NonceCert (W1+ClearanceQC only, never
  full w), Ringtail-style 2-round online signing, public hint recovery
  (FindHint over w'=A·z−c·t1·2^d), Thm 3.1 BCC/CEF byte-equality, mode
  restriction (65/87 only), the V13 finding, honest status.
- Abstract: reframe from "Corona-family" to the shared two-round
  Module-LWE kernel + Pulsar's byte-equal-ML-DSA target via BCC/CEF;
  add review-ready status.
- §5 security: point Lean ref at Crypto.Pulsar.pulsar_pq_unforgeability
  (was Corona.lean/corona_pq_unforgeability — a conflation); add the
  byte-equal-mode proof posture + honest status.
- Reproducibility appendix: replace the v0.3 algebraic-aggregate
  "production path" (which leaked c·s2/c·t0, V13) with the no-leak
  BCC/CEF path + the superseded-V13 note + honest status.
- references.bib: fix lp073 (was titled "Corona ... Threshold
  Signatures" — misattribution) → Pulsar; add lp4450 canonical entry.

lp-020-quasar-consensus (§13 reconciliation — SUPERSEDED):
- §13 rewritten: "Why Not Threshold ML-DSA" → "Threshold ML-DSA via
  Pulsar; Why Not Threshold FALCON". Threshold ML-DSA IS achieved via
  Pulsar BCC/CEF (byte-equal FIPS 204); the two classical obstacles
  (combined-z rejection, hint computation) are dissolved by offline
  boundary clearance + public UseHint. FALCON subsection kept
  (distributed trapdoor Gaussian sampling is still open). V13 finding
  documented; honest review-ready status; rollup is now framed as a
  complementary accountability lane, not a threshold substitute.
- §1/§4/§11 reconciled to match (no longer claim threshold ML-DSA
  "cannot be deployed"); §99 adds lp4450/lp073 bibitems.

Corona = Module-LWE/Ringtail-derived sibling facts preserved throughout.
PDFs rebuilt (latexmk/pdflatex+bibtex), exit 0, no errors.

2026-06-21 07:16:21 -07:00

235 lines

7.9 KiB

TeX

Raw Permalink Blame History

 \section{Conclusion}
 \label{sec:conclusion}
 %% ============================================================================
 Quasar 3.0 is the consensus protocol of the Lux primary network
 activated on 25 December 2025. Each finalized block carries a
 \emph{QuasarCert} that aggregates three independent verification lanes:
 a 48-byte BLS12-381 aggregate signature, a Corona two-round Module-LWE
 threshold signature rooted on Q-Chain, and a 192-byte Z-Chain Groth16
 rollup of $N$ FIPS-204 ML-DSA-65 validator signatures plus a 32-byte
 public-inputs hash. The third lane is a Z-Chain proof artifact, not a
 raw per-validator ML-DSA list; this makes the per-block on-chain
 post-quantum identity-binding cost constant in the validator count.
 Every QuasarCert binds the certificate subject---an explicit hash of the
 chain id, epoch, round, mode, and seven chain-specific roots
 ($P_\text{val}, Q_\text{cer}, Z_\text{vk}, A_\text{att}, B_\text{br},
 M_\text{mpc}, F_\text{fhe}$) together with the parent block hash, parent
 state root, parent execution root, gas limit, and base fee. Cross-chain
 and cross-epoch replay are structurally impossible
 (Theorem~\ref{thm:replay-impossible}); the verifier decides replay
 locally and statelessly.
 Safety holds if at least one cryptographic lane remains secure.
 Liveness holds under partial synchrony with $f < n/3$ Byzantine
 validators. The protocol is implemented in Go, deployed across the
 P/Q/Z/A/B/M/F chain pipeline, and supported by machine-checked proofs
 in Lean~4 and symbolic verification in Tamarin. The QuasarGPU
 adapter (LP-132) verifies the three lanes in parallel: 0.5--1.5\,ms per
 QuasarCert at $n{=}21$, well inside the 500\,ms target block time, and
 on track for the $\geq$100K TPS sustained per chain.
 The post-quantum design is deliberately conservative. We do not claim
 that BLS12-381 will resist quantum computers, nor that Module-LWE will
 survive every future cryptanalytic decade. We claim that requiring an
 adversary to break all three simultaneously---BLS12-381, Corona
 Module-LWE, and ML-DSA Module-LWE/MSIS, with the Groth16 lane providing
 on-chain compactness---offers a margin of safety that no single-scheme
 approach can match. Quasar 3.0 is the answer for December 2025; the
 .0 research backlog is documented separately
 (Section~\ref{sec:future}).
 \bibliographystyle{plain}
 \begin{thebibliography}{99}
 \bibitem{shor1994}
 P.~W.~Shor.
 \newblock Algorithms for Quantum Computation: Discrete Logarithms and
   Factoring.
 \newblock In \emph{FOCS}, 1994.
 \bibitem{nist-pqc}
 {National Institute of Standards and Technology}.
 \newblock FIPS 204: Module-Lattice-Based Digital Signature Standard.
 \newblock NIST, August 2024.
 \bibitem{mosca2018}
 M.~Mosca.
 \newblock Cybersecurity in an Era with Quantum Computers.
 \newblock \emph{IEEE Security \& Privacy}, 2018.
 \bibitem{boneh2001short}
 D.~Boneh, B.~Lynn, and H.~Shacham.
 \newblock Short Signatures from the Weil Pairing.
 \newblock In \emph{ASIACRYPT}, 2001.
 \bibitem{corona}
 {Lux Industries}.
 \newblock Corona: Two-Round Module-LWE Threshold Signatures.
 \newblock Lux Industries, 2026. \texttt{github.com/luxfi/corona}.
 \newblock Module-LWE (Ringtail-derived), two-round; builds on the
   Ringtail line~\cite{ringtail}; Q-Chain Feldman/Pedersen DKG.
 \bibitem{ringtail}
 C.~Boschini, D.~Kaviani, R.~W.~F.~Lai, G.~Malavolta, A.~Takahashi, and
   M.~Tibouchi.
 \newblock Ringtail: Practical Two-Round Threshold Signatures from LWE.
 \newblock Cryptology ePrint Archive, Paper 2024/1113; IEEE S\&P 2025.
 \newblock Academic two-round lattice threshold; the construction that
   Corona builds on.
 \bibitem{castro1999practical}
 M.~Castro and B.~Liskov.
 \newblock Practical Byzantine Fault Tolerance.
 \newblock In \emph{OSDI}, 1999.
 \bibitem{yin2019hotstuff}
 M.~Yin, D.~Malkhi, M.~K.~Reiter, G.~G.~Gueta, and I.~Abraham.
 \newblock HotStuff: BFT Consensus with Linearity and Responsiveness.
 \newblock In \emph{PODC}, 2019.
 \bibitem{rocket2019scalable}
 T.~Rocket, M.~Yin, K.~Sekniqi, R.~van~Renesse, and E.~G.~Sirer.
 \newblock Scalable and Probabilistic Leaderless BFT Consensus through
   Metastability.
 \newblock IPFS preprint, 2019.
 \bibitem{groth2016}
 J.~Groth.
 \newblock On the Size of Pairing-Based Non-Interactive Arguments.
 \newblock In \emph{EUROCRYPT}, 2016.
 \bibitem{regev2005}
 O.~Regev.
 \newblock On Lattices, Learning with Errors, Random Linear Codes, and
   Cryptography.
 \newblock \emph{J.\ ACM}, 56(6), 2009.
 \bibitem{espitau2024}
 T.~Espitau, M.~Tibouchi, and A.~Wallet.
 \newblock Practical Fiat--Shamir with Aborts Threshold Signatures from
   Lattices.
 \newblock \emph{IACR ePrint}, 2024.
 \bibitem{falcon-spec}
 P.-A.~Fouque, J.~Hoffstein, P.~Kirchner, V.~Lyubashevsky, T.~Pornin,
   T.~Prest, T.~Ricosset, G.~Seiler, W.~Whyte, and Z.~Zhang.
 \newblock FALCON: Fast-Fourier Lattice-Based Compact Signatures over NTRU.
 \newblock NIST PQC Round 3 submission, 2020.
 \bibitem{ducas2016}
 L.~Ducas and T.~Prest.
 \newblock Fast Fourier Orthogonalization.
 \newblock In \emph{ISSAC}, 2016.
 \bibitem{qcert-proof}
 Z.~Kelling.
 \newblock QuasarCert Soundness: Proof Sketch with Circuit Analysis,
   Adaptive Corruption, Setup, and Parameter Tightness.
 \newblock Lux Industries technical note, December 2025.
 \newblock \texttt{proofs/quasar-cert-soundness.tex}.
 \bibitem{lp4450}
 Lux Industries.
 \newblock LP-4450: Pulsar --- Boundary-Cleared Module-LWE Threshold
   ML-DSA (FIPS~204, byte-equal).
 \newblock Lux Improvement Proposal, 2026.
 \newblock \texttt{github.com/luxfi/pulsar}.
 \bibitem{lp073}
 Z.~Kelling.
 \newblock LP-073: Pulsar --- Module-LWE Threshold ML-DSA for
   Permissionless Validator Sets.
 \newblock Lux Industries, Inc., 2026.
 \bibitem{lp132-quasargpu}
 Lux Industries.
 \newblock LP-132: QuasarGPU Verification Substrate.
 \newblock Lux Improvement Proposal, December 2025.
 \bibitem{lux-zap}
 Lux Industries.
 \newblock ZAP: A Zero-Allocation Wire Protocol for Consensus.
 \newblock Lux Industries technical paper, 2025.
 \bibitem{lux-zchain}
 Lux Industries.
 \newblock Z-Chain: Groth16 Rollup Substrate.
 \newblock Lux Industries technical paper, 2025.
 \bibitem{lux-achain}
 Lux Industries.
 \newblock A-Chain: Unified Attestation Chain with TEE-Verified Proof
   of Execution.
 \newblock Lux Industries technical paper, 2025.
 \bibitem{lux-nova}
 Lux Industries.
 \newblock Nova: Linear-Chain Quasar Engine (Photon $\to$ Wave $\to$
   Focus $\to$ Ray).
 \newblock Lux Industries technical paper, 2025.
 \bibitem{lux-nebula}
 Lux Industries.
 \newblock Nebula: DAG Quasar Engine (Flare $\to$ Horizon $\to$ Field).
 \newblock Lux Industries technical paper, 2025.
 %% --- Future-work references (cited only in Section 15) -----------------
 \bibitem{aft2025-conflict-spec}
 {AFT 2025 authors (TBC)}.
 \newblock Conflict Specifications for Concurrent Smart-Contract Execution.
 \newblock In \emph{Advances in Financial Technologies (AFT)}, 2025.
 \bibitem{nemo}
 {Authors (TBC)}.
 \newblock NEMO: Conflict-Free Scheduling for Blockchain Execution.
 \newblock Preprint, 2025.
 \bibitem{rapidlane}
 {Authors (TBC)}.
 \newblock RapidLane: Lane-Parallel Smart-Contract Execution.
 \newblock Preprint, 2025.
 \bibitem{chiron}
 {Authors (TBC)}.
 \newblock Chiron: A Multi-Stream Concurrency Layer for Smart Contracts.
 \newblock Preprint, 2025.
 \bibitem{foresight}
 {Authors (TBC)}.
 \newblock ForeSight: Speculative Read-Set Hinting for Optimistic
   Execution.
 \newblock Preprint, 2025.
 \bibitem{csmv}
 {Authors (TBC)}.
 \newblock CSMV: Conflict-Set Multi-Version Concurrency Control.
 \newblock Preprint, 2025.
 \bibitem{vmvcc}
 {Authors (TBC)}.
 \newblock vMVCC: Versioned Multi-Version Concurrency Control for
   Blockchain State.
 \newblock Preprint, 2025.
 \bibitem{motor}
 {Authors (TBC)}.
 \newblock Motor: A Multi-Leader DAG with Heterogeneous Block Roles.
 \newblock Preprint, 2025.
 \bibitem{multiverse}
 {Authors (TBC)}.
 \newblock Multiverse: Speculative Branching Execution for Smart
   Contracts.
 \newblock Preprint, 2025.
 \end{thebibliography}
 %% ============================================================================
 \appendix
 %% ============================================================================

235 lines 7.9 KiB TeX Raw Permalink Blame History

235 lines

7.9 KiB

TeX

Raw Permalink Blame History