SNAPKITTYWEST Research Papers

Ahmad Ali Parr · SnapKitty Collective · Bel Esprit D'Accord Irrevocable Trust

Original research in formal mathematics, sovereign AI architecture, and deterministic agent systems. Every claim is reproducible. All Lean 4 proofs compile with no sorry. The chain cannot be revised — only extended.

"Tokens are coordinate charts. The simplex is the law. The '1' was always there — and so was the proof obligation."

---

Papers — Complete DOI Catalog

#	Title	DOI	Date
1	Attention Exhaustion Attacks	10.5281/zenodo.20678420	June 2026
2	SNAPKITTYWEST Sovereign Compute Architecture	10.5281/zenodo.21132094	July 2026
3	Resonance Block Trust Deeds	10.5281/zenodo.21144425	July 2026
4	GKN: I₄ Quartic Invariant and E₇ Symmetry	10.5281/zenodo.21268911	July 2026
5	The Gates Normalization Constraint & Meta-Inverted Sum	10.5281/zenodo.21349277	July 2026
6	Attention Is All You Don't Need: NAND Decomposition	10.5281/zenodo.21351461	July 2026
7	The Jordan Spectral Transformer	10.5281/zenodo.21443609	July 2026
8	PAR-011: Jacobian Conjecture via Jordan Algebras	10.5281/zenodo.21727363	July 2026
9	The Sovereign Stack (unified, 26pp)	10.5281/zenodo.21816366	Aug 2026
10	Sovereign Monster Kernel (new)	Zenodo pending	Aug 2026

---

The Sovereign Stack — Unified Paper

DOI: 10.5281/zenodo.21816366

26-page unified theory connecting all 9 papers into one architectural claim:

Replace probability with proof.

Four movements:

• Attack: Attention exhaustion achieves 0% detection across 10 frontier LLMs
• Geometry: The normalization constraint is the manifold definition, not softmax behavior
• Algebra: K_QLG = ω_SLA = target_QRA — proved in Lean 4, zero sorry, no mathlib
• Jurisdiction: Proof-gated agent ticks produce a computational jurisdiction

Read PDF →

---

Sovereign Monster Kernel — New Paper

30 languages. 1 human. Formally verified end-to-end. No cloud. No vendor. No libc. No sorry.

16-page paper describing the complete vertically integrated compute stack:

• Custom ARM64/x86-64 assembly entry point (no crt0, no libc)
• Zero-dependency Fortran 2018 kernel: Blake3 + Ed25519 from scratch
• Hand-written PTX 8.0 GPU kernels (flash attention + GEMM, RTX 4090)
• C-- continuous batching scheduler with WORM hooks
• MLIR fusion graph targeting 4 backends simultaneously
• QATAAUM clean-room quantum compiler (9-level IR, 221 tests)
• Sovereign Event Bus: Erlang + Ada SPARK + WASM SUBLEQ + Idris 2
• Formal verification: Lean 4, Agda, Coq, HOL Light, Isabelle, Idris 2

Repository → Paper PDF →

---

Key Results

Gates Normalization Constraint

The probability simplex Δⁿ is the law. Softmax guarantees normalization — not semantic validity. The meta-inverted sum Λ(ℓ) = log Z is its Legendre dual. Proved in Lean 4, 12 theorems, zero sorry.

Tripartite Isomorphism

Three independently motivated algebras are the same object:

• Quadratic Ledger Geometry (QLG): unit integer sphere x²+y²+z²=1
• Symbolic Ledger Algebra (SLA): balance axiom R(λ) = δ + ι = 0
• Discrete Agent Routing Automata (QRA): H=0 nats routing tensor

K_QLG = ω_SLA = target_QRA — proved in Lean 4, zero sorry, no mathlib.

Jordan Spectral Transformer

Replaces softmax attention with Fibonacci-Banach contraction: T(ρ) = φ⁻¹·UρU† + φ⁻²·ρ, contraction rate φ⁻¹ ≈ 0.618 Fixed point ρ* satisfies [U, ρ*] = 0 (PAR-011).

Attention Exhaustion

Multi-substrate cognitive friction prompts defeat detection at 0% detection rate across 10 frontier LLMs including Claude Sonnet 4, Llama 3.3-70B, Mistral-Large.

---

ORCID

0009-0006-1916-5245

License

Sovereign Source License v2 · Bel Esprit D'Accord Irrevocable Trust · 2026