Every objection you’re thinking of has been anticipated. Here’s how to evaluate this honestly.
Your Evaluation Path
1. Read CMAC_REF005 (Reviewer Brief) — 20 pages, every standard objection
2. Run verification scripts — 60 seconds each
3. Check CMAC_REF004 (Predictions Registry) — all [cmac key="predictions"] predictions with falsifiers
4. (Optional) Read P005 (Fine-Structure Constant) — the strongest quantitative claim
Time estimate: ~2 hours minimum.
The Standard Objections (Already Answered)
“This is numerology.”
Response: Numerology fits numbers post-hoc with arbitrary constants. CMAC derives numbers from a single geometric constraint (B = 1) with zero adjustable parameters. The α prediction has 12 significant digits. Run:
python3 CMAC_PHYS_P005_Verification_v2.py
“No peer review.”
Response: Correct. P002 (pure mathematics) is submitted to arXiv. This is the biggest gap. But every claim is computationally verifiable. You can be the first external reviewer. Run the scripts.
“Independent of physics credentials.”
Response: The author has no physics PhD. This is disclosed. The work speaks for itself — every claim has a verification script, every result has an epistemic tier, every limitation is documented.
“Too good to be true.”
Response: The predictions are falsifiable. [cmac key=“absence_theorems”] absence theorems can kill the theory tomorrow. CODATA 2026 (September) tests the α prediction. JUNO tests the PMNS angles. If CMAC is wrong, we will know.
“Where does c₂ = π²/21 come from?”
Response: This is the weakest link. c₂ is derived from the asymptotic expansion of the capacity series, but the derivation route is not fully formalized. It’s labeled appropriately (PHYS-DERIVED, not MATH-PROVEN). This is documented in CMAC_REF005.
The 60-Second Test
Before forming any opinion, run this:
python3 CMAC_MATH_P002_Verification_v2.py
If this fails: report it. That would be a discovery.
If this passes: you now know the infrastructure works.
Then run:
python3 CMAC_PHYS_P005_Verification_v2.py
This verifies the fine-structure constant derivation. 118 checks.
The Epistemic Tier System
Every identity is labeled:
| Tier | Meaning | Count |
|——|———|——-|
| MP (MATH-PROVEN) | Machine-verified theorem from B = 1 alone | [cmac key=“tier_mp”] |
| PD (PHYS-DERIVED) | Follows from B = 1 + one physical identification | [cmac key=“tier_pd”] |
| ST (STRUCTURAL) | Pattern match < 1%; derivation route incomplete | [cmac key=“tier_st”] |
| CJ (CONJECTURAL) | Motivated fit; significant gaps | [cmac key=“tier_cj”] |
You always know exactly how confident to be. This is a feature, not a weakness.
What Would Change Your Mind?
To falsify CMAC:
- Find a mathematical error. Run the scripts. Identify a FAIL.
- Detect a structurally absent phenomenon. Supersymmetry, extra dimensions, 4th-generation fermion.
- Measure outside the prediction window. CODATA 2026 α outside 78 ppb.
To verify CMAC:
- Independent replication. Run all [cmac key=“scripts”] scripts. All PASS.
- Mathematical review. Evaluate P002 as pure graph theory.
- Experimental confirmation. CODATA 2026, JUNO, DUNE.
The Honest Weaknesses
CMAC is honest about its gaps:
| Gap | Status | Description |
|—–|——–|————-|
| G1–G8 | CLOSED | Various derivation gaps |
| G9 | OPEN | Conformal vs isometric transition |
| Gravity | Partial | Post-Newtonian complete; full Schwarzschild pending |
| Peer review | None | P002 submitted to arXiv; no journal review |
| c₂ derivation | Incomplete | Asymptotic expansion needs formalization |
Key Documents for Skeptics
| Document | Purpose |
|———-|———|
| CMAC_REF005 | Reviewer Brief — every objection answered |
| CMAC_REF004 | Predictions Registry — all [cmac key=“predictions”] predictions |
| CMAC_REF003 | Identity Lattice — all [cmac key=“identities”] identities with tiers |
| CMAC_REF008 | Absences Registry — all [cmac key=“absence_theorems”] absence theorems |
The Bottom Line
You are right to be skeptical. Any ToE claim should be met with extreme scrutiny.
But CMAC is designed for adversarial evaluation:
- Zero parameters — no wiggle room
- Maximal falsifiability — [cmac key=“absence_theorems”] ways to kill it
- Computational verification — [cmac key=“checks”] checks
- Epistemic transparency — you always know the confidence tier
The programme may be wrong. But it is honest. And it is checkable.
Run the scripts. Find an error. Or don’t.
Skepticism is welcome. The mathematics is the argument.
Nanak Love, CMAC Institute, unit.edu