NP-Intermediate proof of the Lunar Crash Problem (condensed).

The security assumption is that no efficient adversary can compute the discrete log of a lunar parameter without solving the Lunar Crash Problem (proven NP-Intermediate in Appendix C). Traditional finality is monotonic: once a block is finalized, it cannot be reverted. LUNACID v2.1.4 introduces Non-Monotonic Finality —blocks can be "eclipsed" (replaced) only within a shrinking time window, after which they achieve Singularity .

For a block $B$ at height $h$, its finality score $\Phi(B)$ is defined as: