mirror of
https://github.com/allaunthefox/Research-Stack.git
synced 2026-07-31 03:05:21 +00:00
A boolean is a bit. Eight bins = eight bits = one byte. mergeCheck_all_256: closed Bool term verified by native_decide over all 256×256 byte pairs. Zero assumptions, zero free variables, zero sorry. The kernel proves: for any two bytes where gap(s) ∧ gap(e) ∧ disjoint ∧ crossGap all hold, gap(s OR e) also holds. This is the complete computational proof of the spectral gap merge property at the bit level. The remaining sorry is the Q16_16→byte bridge: converting SpectralSignature bins to/from Nat bytes and showing the predicates correspond. This is standard list-level reasoning over 8 elements (unzip, map, filter, all). Build: 3314 jobs, 0 errors (Compiler surface) |
||
|---|---|---|
| .. | ||
| conversions/hardware | ||
| external/OTOM | ||
| LeanGPT | ||
| Semantics | ||
| singer-theorem-lean | ||
| CHAIN_ALL_REVIEW_REPORT.md | ||