Code Pack: Code Used to Compute Morningstar Theorems
Year: 2026
Type: preprint
Abstract: Code Pack: the code used to compute the Morningstar theorems — the investigation's checkable record, in three layers. Lean 4 code: the proof — the machine-checked Lean files for the theorems, zero sorry, with the build logs and axiom audits beside them; a theorem counts only once it has been through Lean. SymPy verification scripts: the checks — the programs that re-run every quantitative claim live, with their outputs saved beside them. Grids and registers: the graded record — every cell and every grade in the CSVs, with the reports carrying the reasoning. 222 files in all (24 Lean source files, 39 Python scripts, 33 grid and register CSVs, 79 reports and ledgers), each hash-checked against the manifest. Assembled 11 November 2026, as a snapshot of the investigation's code at that date. The pack is the successor to the Consolidated Verification Code (10.5281/zenodo.24046324). House rule it serves: print it or it can't be checked.
Authors: Morningstar, CAL, Morningstar, Horus
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234355310
