FINITE VERIFICATION ATLAS
GLOBAL CLAIMS BLOCKED UNLESS BRIDGED

AXZ Research Atlas

Shawn Calvin Snelling / Axezent AI — proof-audit ledgers, deterministic receipts, and truth-labeled candidate lemmas.

Core rule

No claim without a receipt. No finite receipt promoted to infinity without a bridge theorem.

Research posture

Finite verified artifacts, candidate lemmas, and blocked global claims are separated.

What this atlas explains

The AXZ Research Atlas is a public website and repository index for the Axezent AI verification ecosystem. It organizes finite mathematical scans, proof-audit kernels, receipt systems, candidate lemmas, and blocked claims into a professor-readable format.

Current strongest lane

The most mature current mathematical lane is the magic-square-of-squares modular and graph-theoretic reduction: Lucas form, 24k+1 compression, modulo-240 and CRT survivor lattices, centered square-pair difference graphs, and additive-diamond sweeps.

Safe academic boundary

PROVED: algebraic reductions and finite verifier results.
CANDIDATE: concrete unsolved-math-adjacent lemmas.
BLOCKED: RH solved, global magic-square solved, unbreakable cryptography, universal convergence.

How to cite or review

Use the repository README, Truth Ledger, and Candidate Lemmas pages first. The site is designed so a reviewer can immediately see what is proved, what is finite, what is candidate, and what is blocked.