A Bare-Metal O(1) Stack-Bounded Symbolic PDE & 128-Bit Rational Interval SMT Framework for Verifying Enstrophy Coercivity in 3D Incompressible Navier-Stokes Flows
We present garry-ultimate-oss (v2.0.0), a zero-dependency, #![no_std]-compatible, O(1) stack-bounded symbolic partial differential equation (PDE) deduction engine and 128-bit interval constraint prover written in pure Rust. To study finite-time vorticity blow-up exclusion in the three-dimensional (3D) incompressible Navier-Stokes equations on R^3 × [0, ∞) without unconstrained floating-point time-stepping, the kernel combines two deterministic stages: (1) a five-lemma symbolic PDE deduction tree (SymbolicPdeProofTree) that verifies solenoidal convective conservation (∇ · u = 0), Hodge-Helmholtz pressure-gradient curl annihilation (∇ × ∇p ≡ 0), Constantin-Fefferman Biot-Savart Gram determinant depletion, Bernstein-Poincaré dyadic spectral coercivity across plunge-pool-to-tailwater collar domains (L_1 → L_2), and Gagliardo-Nirenberg-Young palinstrophy absorption; and (2) an outward-rounded 128-bit rational interval Satisfiability Modulo Theories (SMT) refutation solver (RationalInterval128 and DeterministicSmtProver) paired with a complete real-analysis (R) formalization in Lean 4 / Mathlib4. Across ten benchmark 3D flow manifolds and an 8-axiom, 20-stage causal derivation pipeline, the kernel refutes the finite-time blow-up hypothesis (dZ/dt ≥ 0 ⇒ UNSAT) in 196.34 ns per manifold on stack memory and seals each run in a reproducible 7,865-byte IEEE 802.3 CRC-32 state checkpoint.
Authors
- Nhat Nam Nguyen (ORCID: https://orcid.org/0009-0002-2275-0307)
Institutions
- Nha Trang University (VN)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.5281/zenodo.24267995
- Primary Topic
- Formal Methods in Verification
- Type
- preprint