machine-checked-proofs

Machine-checked Lean 4 proofs for "Recursive Language Models Through the Admissibility-Dynamics Framework." Covers RLM sub-call architecture, three sufficient conditions for bounded-inconsistency deployment (safe abstention, bounded-decomposable predicates, runtime depth verification), training class closure, and the deployment-boundary synthesis.

Machine-checked Lean 4 proofs for "Language Model Hallucinations: An Impossibility Theorem and Its Architectural Consequences." Covers Theorem 1 (impossibility of guaranteed consistency), certification-depth lower bounds, mitigation boundaries for CoT / grammar / rerank, and intrinsic/extrinsic DCF taxonomy.

Zero-axiom Smithian Fold Theory with exact machine-checked derivations across physics, mathematics, classical computation, and quantum computation

Machine-checked Lean 4 proofs for "Projection Insufficiency and Trajectory Realization." Establishes that no function on a non-injective projection can recover a trajectory-dependent property, with specializations to language-model hallucination, planning, RL, POMDPs, and constraint propagation.

Tests that carry their own evidence: an Idris2 framework grading every test into three provenance tiers — Actually-Proven, Provisionally-Proven, Unproven — over a 17x14 category-by-aspect lattice whose coverage is derived from tests that ran and passed, never declared.

Machine-checked Lean 4 / mathlib proofs and deterministic, reproducibility-first numerical audits of released PLDR-LLM checkpoints, backing the paper "Power law graph attention: exact generalization of scaled dot-product attention, empirical collapse at inference" (PLDR-LLM / PLGA).

Honest, machine-checked ledger of the SZL formula corpus (proof-harness + CI). Lambda = Conjecture-1, never proven.

Proof-carrying Smithian Fold derivation and executable laboratory for classical and quantum computational sciences

A Constructive Formalization of Discrete Entanglement-Geometry Duality in Cubical Agda

Lean 4 + Mathlib formalization of the Λ aggregator — Λ uniqueness as Conjecture 1 (not a closed theorem). 749 declarations · 14 axioms · 163 tracked sorries. Backs the SZL governance gate. Doctrine v11 LOCKED · DOI 10.5281/zenodo.20434308