8d9ced3d29
Closed with proofs: - CostEffectiveVerification.manifoldGroupsOntologicallyDifferentSystems: full proof using obtain + simp + exact (added cross-domain diversity hypothesis) - FixedPointBridge.q0ToQ16_zero: native_decide (finite UInt16→UInt32 computation) - FixedPointBridge.q0ToQ16_one: corrected false claim (= Q16_16.infinity, not .one), then native_decide - WaveformTeleport.constantWaveformAtFixedPoint_base: corrected false claim (value is 65535, not 0), native_decide - GPUVerificationMetaprobe: 4 new lemmas fully proved - gpuVerif_foldl_add_assoc (induction) - gpuVerif_execBatch_length (simp) - gpuVerif_foldl_totalVerified (induction) - verificationStats_valid (simp + exact) - surface_preservesTotalVerified (simp + exact) - DiffusionSNRBias.hGammaSq: gamma_t² ≤ 1 via nlinarith + Int.ediv_le_ediv Bug fixes: - SSMS.mlgruStep: fixed sign error — oneMf was computing fT − 1 instead of 1 − fT (doc comment said 1−fT but code did fT−1). This fixes the MLGRU recurrence formula to match the documented hₜ = f·h + (1−f)·c. Theorem corrections: - DiffusionSNRBias.snrBoundedByModelParams: original claim γ·s ≤ γ²·s was mathematically false for γ < 1, s > 0. Corrected to γ²·s ≤ γ·s with added signalNorm.raw ≥ 0 hypothesis. - MMRFAMMUnification.total_causal_cost_invariant_target: added equal-size hypothesis h_eq (was false for unequal sizes). Improved TODOs with exact blockers in FixedPointBridge (8 remaining), QFactor, SSMS, HyperbolicStateSurface, MMRFAMMUnification. Added Q16_16.add_pos_of_pos lemma (sorry — needs UInt32 automation). lake build: 3539 jobs, exit 0. Generated with [Devin](https://cli.devin.ai/docs) Co-Authored-By: Devin <158243242+devin-ai-integration[bot]@users.noreply.github.com> |
||
|---|---|---|
| .agents/plugins | ||
| .consolidation-manifests | ||
| .devcontainer | ||
| .github | ||
| .vscode | ||
| 0-Core-Formalism | ||
| 1-Distributed-Systems | ||
| 2-Search-Space | ||
| 3-Mathematical-Models | ||
| 4-Infrastructure | ||
| 5-Applications | ||
| 6-Documentation | ||
| 6-Kernel-Shim | ||
| adjacent_coprime_classification_2026-05-13 | ||
| ai-math-discovery-systems | ||
| codebase-memory-receipt-2026-05-13 | ||
| desi_model_projection_receipt_2026-05-13 | ||
| deterministic_build_receipt_2026-05-13 | ||
| docs | ||
| hooks | ||
| info | ||
| plugins/substack-connector | ||
| scripts/qc-flag | ||
| shared-data | ||
| workspace-config | ||
| .codeiumignore | ||
| .gitattributes | ||
| .gitignore | ||
| .gitmodules | ||
| .mcp.json | ||
| .pre-commit-config.yaml | ||
| .python-version | ||
| Agda_Test.agda | ||
| Agda_Test.agdai | ||
| AGENTS.md | ||
| ARCHITECTURE.md | ||
| CHANGELOG.md | ||
| changes.zip | ||
| CITATION.cff | ||
| claims.yaml | ||
| CONCEPTS.md | ||
| config | ||
| Containerfile | ||
| cupfox-config.nix | ||
| description | ||
| desmos_reynolds_bridge.txt | ||
| GETTING_STARTED.md | ||
| HEAD | ||
| lean_hardware_checker_summary.json | ||
| LICENSE | ||
| MEMORY.md | ||
| Modelfile | ||
| NOTICE | ||
| package-lock.json | ||
| package.json | ||
| PROJECT_MAP.md | ||
| pyrightconfig.json | ||
| README.md | ||
| requirements-optional-science.txt | ||
| run-container.sh | ||
| system-packages-optional-science.txt | ||
| test.lean | ||
| THIRD_PARTY_NOTICES.md | ||
| TODO_MAP.md | ||
Research-Stack (OTOM)
Ultra-low power, zero-decimal data routing and compression.
If you just stumbled across this repository, you might see words like "Topological State Machine" and "Manifold Points" and assume this is dense, academic magic. It isn't.
This project is actually built on a very simple, grounded idea: Modern computing is incredibly wasteful.
Right now, running AI or compressing massive datasets requires giant, power-hungry GPUs because they rely on Floating-Point Math (heavy decimals like 3.14159...). We prove that you don't need decimals. You can map complex data (like the grammar of the English language) into structural shapes, and navigate them using only simple integers (whole numbers).
Because we only use addition, subtraction, multiplication, and modulo, this system can run on a $15 blank-slate microchip (an FPGA) instead of a massive server farm.
🛠️ How we know it works (Zero Guesswork)
We do not guess that our integer math works. We prove it. The core of this project is written in Lean 4, a strict mathematical theorem prover. If our logic has a flaw, the code physically will not compile. We currently have over 3,500 mathematically verified proofs securing this engine.
Python, Rust, and Verilog only exist in this repository to act as "dumb pipes" to feed data into our proven mathematical core.
📁 Repository Structure (By Goal)
Everything is numbered so you know exactly what depends on what.
| Folder | What it actually is (Plain English) |
|---|---|
0-Core-Formalism/ |
The Brain. Lean 4 code. The mathematically proven integer arithmetic. This is the source of truth. |
1-Distributed-Systems/ |
The Network. Code for making multiple computers talk to each other to share the workload. |
2-Search-Space/ |
The Navigator. Algorithms that search through our data shapes to find the best routes. |
3-Mathematical-Models/ |
The Library. Where we store our databases of equations and compressed English grammar shapes. |
4-Infrastructure/ |
The Drivers. Code that physically talks to the hardware, GPUs, and APIs. |
5-Applications/ |
The Executables. Python scripts that run the system end-to-end. (These are just shims connecting data to our Lean 4 Brain). |
6-Documentation/ |
The Manual. Where you'll find plain-English explanations and our theoretical papers. |
shared-data/ |
Raw data, cache, and exported files. |
📖 Where to start?
If you are new here, read these two files first:
- Explanation for Humans - A translation guide for our technical jargon.
- Calculator-Plain Math - Proof that every complex concept we use can be calculated on a high-school graphing calculator.
🚀 Quick Start
# 1. Compile the mathematically proven core (Takes ~1-2 minutes)
cd "0-Core-Formalism/lean/Semantics"
lake build
# 2. Run the English Manifold Builder (Compresses English via grammar shapes)
cd "../../.."
python3 5-Applications/scripts/redpajama_english_manifold.py
⚖️ The One Rule for Contributors
Lean is the source of truth.
If you add logic, it goes in 0-Core-Formalism/lean/Semantics/ and must be mathematically proven. Python scripts may not contain complex math, branching logic, or cost functions. Python is just the delivery boy for Lean.
Research Stack — All Rights Reserved