Numerology null mc
v100_numerology_null_mc.py · registry
Read the original description and evidence links
Numerology null test (look-elsewhere corrected) [N]: exact census of the FULL declared formula grammar (provably containing every scored TFPT formula) over the 13 scored frozen-registry observables with conservative data windows ⇒ joint formula-fishing probability ∏pᵢ = 10⁻²⁵·⁸, robust to budget/window variation; 2×200k Monte-Carlo pseudo-theories reach at most 5/13 hits vs TFPT 13/13; power controls: φ₀ ±1%/10% collapses TFPT's own scorecard to 9/6, data shuffle to mean 1.2; all 94 500 F_U(1) variants root-solved — exactly ONE hits the 4×10⁻⁸ CODATA window ⇒ total ≤ 10⁻³⁰·⁷ (~102 bits), CONDITIONAL on the declared grammar (a null-model rejection, never 'certainty'); complementary to the v84 freeze
Read the original Python source- Linked claims
- Paper sections
- Source section 1Source section 2Source section 3Source section 4Source section 5Source section 6Source section 7Source section 8Source section 9Source section 10Source section 11Source section 12Source section 13Source section 14Source section 15Source section 16Source section 17Source section 18Source section 19Source section 20Source section 21Source section 22Source section 23