mirror of
https://github.com/lux-apps/papers.git
synced 2026-10-30 18:15:21 +00:00
zeekayandHanzo Dev
178febad68
Every rendered "T-Chain" / "ThresholdVM" / "teleportvm" reference across the paper corpus is rewritten to the correct canonical chain by concern: threshold signing / MPC / bridge custody / key recovery -> M-Chain (MVM); FHE / encrypted compute / threshold decryption -> F-Chain (FVM); teleport / cross-chain messaging -> B-Chain (bridgevm); consensus Pulsar stays Q-Chain. Section lux-trust-kernel/03-t-chain-threshold-governance.tex renamed -> 03-f-chain-encrypted-policy.tex (with \input + xref fixes). Braided "T-Chain" sections split by concern (M vs F). Only lp-020's chain-separation rationale and the shared lux/chains/thresholdvm library path retain the name, to record the removal. All changed papers rebuilt (pdflatex, rc=0, no undefined refs). ยง09 of lux-dao-governance-framework reframed: fabricated "production deployment" metrics ($50M/$240k/$12M, survey %s, "as of Oct 2024") relabeled as illustrative design configurations with no invented replacements; reality noted (DAO treasury is a 1/1 Safe); conclusion echo + one "first production" overclaim softened. This commit also captures concurrent corpus workstreams on the same tree. Co-authored-by: Hanzo Dev <[email protected]>
166 lines
6.0 KiB
TeX
166 lines
6.0 KiB
TeX
\section{Conclusion}
|
|
|
|
\label{sec:conclusion}
|
|
%% ============================================================================
|
|
|
|
Quasar achieves 204\,ms median finality over WAN (CPU BLS) and \textbf{10\,ms finality}
|
|
with GPU-accelerated BLS in co-located deployments, with simultaneous classical and
|
|
post-quantum cryptographic guarantees---a combination no other production protocol
|
|
provides. The dual-certificate mechanism adds less than 10\% overhead compared to
|
|
classical-only consensus, invalidating the assumption that post-quantum security
|
|
requires significant performance sacrifice.
|
|
|
|
At Lux's 1\,B gas block limit (\num{47619} txs/block), GPU-BLS opcode dispatch yields a
|
|
\textbf{\num{4761904}\,TPS execution-only upper bound}---\emph{not} an end-to-end finality
|
|
figure; finality is bound by signature recovery, settlement conflict-detection, and BLS/PQ
|
|
finality. CPU BLS provides a 100\,ms fallback (\num{476190}\,TPS execution-only). At 100 validators over WAN, consensus-layer throughput reaches
|
|
\num{10400}\,TPS with O($n$) message complexity, positioning Quasar between
|
|
high-throughput DAG protocols (Narwhal+Tusk, $\sim$38{,}500\,TPS) and traditional
|
|
BFT protocols (Tendermint, $\sim$1{,}200\,TPS). For applications where finality
|
|
speed and quantum resistance matter more than raw throughput---cross-chain bridges,
|
|
financial settlement, regulatory-sensitive operations---Quasar is the optimal choice.
|
|
|
|
The benchmark data in this paper is reproducible. Hardware specifications, software
|
|
versions, and test configurations are fully documented. We encourage independent
|
|
reproduction and will publish the complete test harness as open source.
|
|
|
|
%% ============================================================================
|
|
%% REFERENCES
|
|
%% ============================================================================
|
|
|
|
\begin{thebibliography}{99}
|
|
|
|
\bibitem{quasar-paper}
|
|
Kelling, Z. (2025).
|
|
\textit{Quasar: Quantum-Secure Multi-Engine Consensus with Dual-Certificate Finality}.
|
|
Lux Industries Research.
|
|
|
|
\bibitem{hotstuff}
|
|
Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I. (2019).
|
|
\textit{HotStuff: BFT Consensus with Linearity and Responsiveness}.
|
|
ACM PODC 2019. \texttt{arXiv:1803.05069}.
|
|
|
|
\bibitem{tendermint}
|
|
Buchman, E. (2016).
|
|
\textit{Tendermint: Byzantine Fault Tolerance in the Age of Blockchains}.
|
|
University of Guelph.
|
|
|
|
\bibitem{narwhal-tusk}
|
|
Danezis, G., Kokoris-Kogias, E., Sonnino, A., Spiegelman, A. (2022).
|
|
\textit{Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus}.
|
|
EuroSys 2022. \texttt{arXiv:2105.11827}.
|
|
|
|
\bibitem{casper-ffg}
|
|
Buterin, V., Griffith, V. (2017).
|
|
\textit{Casper the Friendly Finality Gadget}.
|
|
\texttt{arXiv:1710.09437}.
|
|
|
|
\bibitem{solana-wp}
|
|
Yakovenko, A. (2018).
|
|
\textit{Solana: A New Architecture for a High Performance Blockchain}.
|
|
Solana Labs Whitepaper v0.8.13.
|
|
|
|
\bibitem{snow-paper}
|
|
Team Rocket. (2020).
|
|
\textit{Scalable and Probabilistic Leaderless BFT Consensus through Metastability}.
|
|
\texttt{arXiv:1906.08936}.
|
|
|
|
\bibitem{pulsar}
|
|
Z.~Kelling. (2026).
|
|
\textit{LP-073: Pulsar --- Module-LWE Rank-$k$ Threshold ML-DSA for
|
|
Permissionless Validator Sets}.
|
|
Lux Industries, Inc. \texttt{github.com/luxfi/pulsar}.
|
|
|
|
\bibitem{fips204}
|
|
NIST. (2024).
|
|
\textit{FIPS 204: Module-Lattice-Based Digital Signature Standard (ML-DSA)}.
|
|
National Institute of Standards and Technology.
|
|
|
|
\bibitem{mysticeti}
|
|
Babel, K., Danezis, G., Kokoris-Kogias, E., Sonnino, A. (2024).
|
|
\textit{Mysticeti: Reaching the Latency Limits with Uncertified DAGs}.
|
|
Cornell University. \texttt{arXiv:2310.14821}.
|
|
|
|
\bibitem{blockbench}
|
|
Dinh, T.T.A., Wang, J., Chen, G., Liu, R., Ooi, B.C., Tan, K.L. (2017).
|
|
\textit{BLOCKBENCH: A Framework for Analyzing Private Blockchains}.
|
|
ACM SIGMOD 2017.
|
|
|
|
\bibitem{ethereum-pq}
|
|
Ethereum Foundation. (2025).
|
|
\textit{Post-Quantum Cryptography Research Roadmap}.
|
|
ethereum.org/research.
|
|
|
|
\bibitem{hotstuff2}
|
|
Malkhi, D., Nayak, K. (2023).
|
|
\textit{HotStuff-2: Optimal Two-Phase Responsive BFT}.
|
|
Cryptology ePrint Archive 2023/397.
|
|
|
|
\bibitem{bls-sigs}
|
|
Boneh, D., Lynn, B., Shacham, H. (2001).
|
|
\textit{Short Signatures from the Weil Pairing}.
|
|
ASIACRYPT 2001, LNCS 2248, pp. 514--532.
|
|
|
|
\bibitem{pbft}
|
|
Castro, M., Liskov, B. (1999).
|
|
\textit{Practical Byzantine Fault Tolerance}.
|
|
OSDI 1999.
|
|
|
|
% --- Named-competitor scaffold (Apr 2026) ---
|
|
|
|
\bibitem{buchman2016tendermint}
|
|
Buchman, E. (2016).
|
|
\textit{Tendermint: Byzantine Fault Tolerance in the Age of Blockchains}.
|
|
M.Sc.\ thesis, University of Guelph.
|
|
\url{https://atrium.lib.uoguelph.ca/items/5459099e-67aa-4a83-b816-25c6752e0afe}
|
|
|
|
\bibitem{cometbftgithub}
|
|
CometBFT Authors. (2026).
|
|
\textit{CometBFT: A distributed, Byzantine fault-tolerant, deterministic state machine replication engine}.
|
|
\url{https://github.com/cometbft/cometbft}
|
|
|
|
\bibitem{malkhi2023hotstuff2}
|
|
Malkhi, D., Nayak, K. (2023).
|
|
\textit{HotStuff-2: Optimal Two-Phase Responsive BFT}.
|
|
Cryptology ePrint Archive 2023/397.
|
|
\url{https://eprint.iacr.org/2023/397}
|
|
|
|
\bibitem{rocket2019avalanche}
|
|
Team Rocket. (2019).
|
|
\textit{Scalable and Probabilistic Leaderless BFT Consensus through Metastability}.
|
|
arXiv:1906.08936.
|
|
|
|
\bibitem{amores2024avalanche}
|
|
Amores-Sesar, I., Schneider, P., Cachin, C. (2024).
|
|
\textit{An Analysis of Avalanche Consensus}.
|
|
arXiv:2401.02811.
|
|
|
|
\bibitem{babel2024mysticeti}
|
|
Babel, K., Danezis, G., Kokoris-Kogias, E., Sonnino, A. (2025).
|
|
\textit{Mysticeti: Reaching the Limits of Latency with Uncertified DAGs}.
|
|
NDSS 2025. arXiv:2310.14821.
|
|
|
|
\bibitem{alqahtani2021bottlenecks}
|
|
Alqahtani, S., Demirbas, M. (2021).
|
|
\textit{Bottlenecks in Blockchain Consensus Protocols}.
|
|
arXiv:2103.04234.
|
|
|
|
\bibitem{yakovenko2018solana}
|
|
Yakovenko, A. (2018).
|
|
\textit{Solana: A New Architecture for a High Performance Blockchain}.
|
|
Solana Labs Whitepaper v0.8.13.
|
|
|
|
\bibitem{yin2019hotstuff}
|
|
Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I. (2019).
|
|
\textit{HotStuff: BFT Consensus with Linearity and Responsiveness}.
|
|
ACM PODC 2019. arXiv:1803.05069.
|
|
|
|
\end{thebibliography}
|
|
|
|
%% ============================================================================
|
|
%% APPENDICES
|
|
%% ============================================================================
|
|
|
|
\appendix
|
|
|