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]>
177 lines
7.2 KiB
TeX
177 lines
7.2 KiB
TeX
\section{Conclusion}
|
|
|
|
\label{sec:conclusion}
|
|
|
|
We have presented Lux Consensus, a physics-inspired metastable blockchain consensus
|
|
protocol that achieves:
|
|
|
|
\begin{itemize}[nosep]
|
|
\item \textbf{4,500+ TPS} throughput through DAG-based parallel transaction processing
|
|
\item \textbf{650ms median finality} on a globally distributed 1,000-node network
|
|
\item \textbf{Byzantine fault tolerance} up to $f < n/3$ validators
|
|
\item \textbf{$O(kn)$ message complexity} independent of concurrent decisions
|
|
\item \textbf{Formal safety and liveness guarantees} proven under partial synchrony
|
|
\item \textbf{Machine-checked proofs} in Lean~4 covering all 12 protocol components,
|
|
4 cryptographic primitives, and cross-chain delivery (36 theorems, 33 fully proved)
|
|
\end{itemize}
|
|
|
|
The Wave-family foundation provides a qualitatively different approach to Byzantine
|
|
consensus: rather than explicit quorums and leader election, Lux achieves agreement through
|
|
emergent majority amplification. This yields: no designated leader (no view-change stalls),
|
|
parallelism across conflict sets (DAG throughput), and graceful degradation under Byzantine
|
|
behavior (throughput reduction without safety violations).
|
|
|
|
The physics analogy to metastable phase transitions is not merely aesthetic: it provides
|
|
genuine insight into the protocol's dynamics. Just as a supercooled liquid rapidly
|
|
crystallizes when nucleated, Lux's repeated sampling rapidly amplifies any initial
|
|
majority preference into consensus. The mathematical machinery of phase transitions and
|
|
large deviation theory provides sharp bounds on convergence and safety.
|
|
|
|
The formal verification effort described in Section~\ref{sec:formal} provides
|
|
machine-checked confidence in the core protocol invariants, with 33 of 36 theorems
|
|
fully proved in Lean~4. Future work includes: (1) completing the three remaining
|
|
\texttt{sorry}-annotated proofs via round-indexed induction,
|
|
(2) adaptive parameter tuning based on real-time network conditions,
|
|
(3) analysis under adaptive Byzantine adversaries, and
|
|
(4) extension to multi-value consensus beyond binary conflict sets.
|
|
|
|
%% -----------------------------------------------------------------------
|
|
%% REFERENCES
|
|
%% -----------------------------------------------------------------------
|
|
\bibliographystyle{plainnat}
|
|
|
|
\begin{thebibliography}{30}
|
|
|
|
\bibitem{brewer2000cap}
|
|
E.~Brewer, ``Towards robust distributed systems,'' in
|
|
\textit{Proceedings of PODC}, 2000.
|
|
|
|
\bibitem{castro1999practical}
|
|
M.~Castro and B.~Liskov, ``Practical Byzantine fault tolerance,'' in
|
|
\textit{Proceedings of OSDI}, 1999.
|
|
|
|
\bibitem{yin2019hotstuff}
|
|
M.~Yin, D.~Malkhi, M.~K. Reiter, G.~G. Gueta, and I.~Abraham, ``HotStuff: BFT
|
|
consensus with linearity and responsiveness,'' in \textit{Proceedings of PODC}, 2019.
|
|
|
|
\bibitem{buchman2016tendermint}
|
|
E.~Buchman, ``Tendermint: Byzantine fault tolerance in the age of blockchains,''
|
|
Master's thesis, University of Guelph, 2016.
|
|
|
|
\bibitem{nakamoto2008bitcoin}
|
|
S.~Nakamoto, ``Bitcoin: A peer-to-peer electronic cash system,'' 2008.
|
|
|
|
\bibitem{rocket2019wave}
|
|
Team Rocket, ``Snowflake to Avalanche: A novel metastable consensus protocol family
|
|
for cryptocurrencies,'' 2019.
|
|
|
|
\bibitem{buterin2020ethereum2}
|
|
V.~Buterin et al., ``Ethereum 2.0 specifications,'' 2020.
|
|
|
|
\bibitem{baudet2019state}
|
|
M.~Baudet et al., ``State machine replication in the Libra Blockchain,''
|
|
Technical Report, The Libra Association, 2019.
|
|
|
|
\bibitem{dwork1988consensus}
|
|
C.~Dwork, N.~Lynch, and L.~Stockmeyer, ``Consensus in the presence of partial
|
|
synchrony,'' \textit{Journal of the ACM}, 35(2):288--323, 1988.
|
|
|
|
\bibitem{lamport1982byzantine}
|
|
L.~Lamport, R.~Shostak, and M.~Pease, ``The Byzantine generals problem,''
|
|
\textit{ACM TOPLAS}, 4(3):382--401, 1982.
|
|
|
|
\bibitem{micali1999verifiable}
|
|
S.~Micali, M.~Rabin, and S.~Vadhan, ``Verifiable random functions,'' in
|
|
\textit{Proceedings of FOCS}, 1999.
|
|
|
|
\bibitem{landau1980statistical}
|
|
L.~D. Landau and E.~M. Lifshitz, \textit{Statistical Physics}. Pergamon Press, 1980.
|
|
|
|
\bibitem{binder1987theory}
|
|
K.~Binder, ``Theory of first-order phase transitions,''
|
|
\textit{Reports on Progress in Physics}, 50(7):783--859, 1987.
|
|
|
|
\bibitem{ising1925beitrag}
|
|
E.~Ising, ``Beitrag zur Theorie des Ferromagnetismus,''
|
|
\textit{Zeitschrift f{\"u}r Physik}, 31(1):253--258, 1925.
|
|
|
|
\bibitem{glauber1963time}
|
|
R.~J. Glauber, ``Time-dependent statistics of the Ising model,''
|
|
\textit{Journal of Mathematical Physics}, 4(2):294--307, 1963.
|
|
|
|
\bibitem{demers1987epidemic}
|
|
A.~Demers et al., ``Epidemic algorithms for replicated database maintenance,'' in
|
|
\textit{Proceedings of PODC}, 1987.
|
|
|
|
\bibitem{king2011breaking}
|
|
V.~King and J.~Saia, ``Breaking the $O(n^2)$ bit barrier: Scalable Byzantine agreement
|
|
with an adaptive adversary,'' \textit{Journal of the ACM}, 58(4):18, 2011.
|
|
|
|
\bibitem{gilad2017algorand}
|
|
Y.~Gilad, R.~Hemo, S.~Micali, G.~Vlachos, and N.~Zeldovich, ``Algorand: Scaling
|
|
Byzantine agreements for cryptocurrencies,'' in \textit{Proceedings of SOSP}, 2017.
|
|
|
|
\bibitem{abraham2019sync}
|
|
I.~Abraham and D.~Malkhi, ``The Sync HotStuff algorithm,'' 2019.
|
|
|
|
\bibitem{spiegelman2022shoal}
|
|
A.~Spiegelman et al., ``Shoal: Improving DAG-BFT latency and robustness,'' 2022.
|
|
|
|
\bibitem{danezis2022narwhal}
|
|
G.~Danezis et al., ``Narwhal and Tusk: A DAG-based mempool and efficient BFT
|
|
consensus,'' in \textit{Proceedings of EuroSys}, 2022.
|
|
|
|
\bibitem{malkhi2022bullshark}
|
|
D.~Malkhi and A.~Spiegelman, ``Bullshark: DAG BFT protocols made practical,'' 2022.
|
|
|
|
\bibitem{bagaria2019prism}
|
|
V.~Bagaria, S.~Kannan, D.~Tse, G.~Fanti, and P.~Viswanath, ``Prism: Deconstructing
|
|
the blockchain to approach physical limits,'' in \textit{Proceedings of CCS}, 2019.
|
|
|
|
\bibitem{pass2017fruitchains}
|
|
R.~Pass and E.~Shi, ``FruitChains: A fair blockchain,'' in
|
|
\textit{Proceedings of PODC}, 2017.
|
|
|
|
\bibitem{garay2015bitcoin}
|
|
J.~Garay, A.~Kiayias, and N.~Leonardos, ``The Bitcoin backbone protocol: Analysis and
|
|
applications,'' in \textit{Proceedings of EUROCRYPT}, 2015.
|
|
|
|
\bibitem{vukolic2016eventually}
|
|
M.~Vukoli{\'c}, ``The quest for scalable blockchain fabric: Proof-of-work vs. BFT
|
|
replication,'' in \textit{Proceedings of iNetSec}, 2016.
|
|
|
|
\bibitem{fischer1985impossibility}
|
|
M.~J. Fischer, N.~A. Lynch, and M.~S. Paterson, ``Impossibility of distributed
|
|
consensus with one faulty process,'' \textit{Journal of the ACM}, 32(2):374--382, 1985.
|
|
|
|
\bibitem{ben2003resilient}
|
|
M.~Ben-Or, ``Another advantage of free choice: Completely asynchronous agreement
|
|
protocols,'' in \textit{Proceedings of PODC}, 1983.
|
|
|
|
\bibitem{moura2021lean4}
|
|
L.~de~Moura and S.~Ullrich, ``The Lean~4 theorem prover and programming language,''
|
|
in \textit{Proceedings of CADE}, 2021.
|
|
|
|
\bibitem{mathlib4}
|
|
The mathlib Community, ``Mathlib4,'' 2024.
|
|
\url{https://github.com/leanprover-community/mathlib4}
|
|
|
|
\bibitem{hawblitzel2015ironfleet}
|
|
C.~Hawblitzel et al., ``IronFleet: Proving practical distributed systems correct,''
|
|
in \textit{Proceedings of SOSP}, 2015.
|
|
|
|
\bibitem{boneh2001short}
|
|
D.~Boneh, B.~Lynn, and H.~Shacham, ``Short signatures from the Weil pairing,''
|
|
in \textit{Proceedings of ASIACRYPT}, 2001.
|
|
|
|
\bibitem{komlo2020frost}
|
|
C.~Komlo and I.~Goldberg, ``FROST: Flexible round-optimized Schnorr threshold
|
|
signatures,'' in \textit{Proceedings of SAC}, 2020.
|
|
|
|
\bibitem{ducas2018crystals}
|
|
L.~Ducas et al., ``ML-DSA (FIPS 204, formerly CRYSTALS-Dilithium): A lattice-based digital signature scheme,''
|
|
\textit{IACR Transactions on CHES}, 2018(1):238--268, 2018.
|
|
|
|
\end{thebibliography}
|
|
|