Skip to main content

lean_rs_abi/
supported.rs

1//! The supported Lean toolchain window.
2//!
3//! `lean-rs-abi` accepts the active toolchain at build time iff its `lean.h`
4//! digest matches one entry in [`SUPPORTED_TOOLCHAINS`]. The table is the
5//! single source of truth for the v1.0 compatibility promise.
6//!
7//! Each entry records the SHA-256 of one `include/lean/lean.h`, the
8//! `LEAN_VERSION_STRING` values that ship that exact header (Lean does not
9//! always bump the header between releases—header-identical releases share
10//! one entry), and the set of [`REQUIRED_SYMBOLS`](crate::REQUIRED_SYMBOLS)
11//! that are absent from this toolchain. Runtime layout assumptions in
12//! `lean-rs-sys` are checked against this same window (see
13//! `docs/architecture/02-versioning-and-compatibility.md`).
14//!
15//! See `docs/bump-toolchain.md` for the procedure to extend the window.
16
17/// One ABI-equivalence class in the supported toolchain window.
18#[derive(Debug, Clone, Copy, PartialEq, Eq)]
19pub struct SupportedToolchain {
20    /// `LEAN_VERSION_STRING` values that ship this exact header. Releases
21    /// with byte-identical `lean.h` share one entry.
22    pub versions: &'static [&'static str],
23    /// SHA-256 of `include/lean/lean.h`, lowercase hex.
24    pub header_digest: &'static str,
25    /// Entries of [`crate::REQUIRED_SYMBOLS`] that are absent from this
26    /// toolchain. Empty when the full surface is available.
27    pub missing_symbols: &'static [&'static str],
28}
29
30impl SupportedToolchain {
31    /// Return `true` iff `version` (the `LEAN_VERSION_STRING`) is one of
32    /// this entry's grouped releases.
33    #[must_use]
34    pub fn includes(&self, version: &str) -> bool {
35        self.versions.contains(&version)
36    }
37}
38
39/// The supported Lean toolchain window.
40///
41/// Ordered by the first `versions` entry. To add a new toolchain, follow
42/// the checklist in `docs/bump-toolchain.md`.
43// Lower bound of the window is **4.30.0**. Releases 4.27.0–4.29.1 were
44// dropped on 2026-07-28: their `libleanshared` does not export
45// `_l___private_Lean_Util_CollectAxioms_0__Lean_CollectAxioms_collectAndGet___boxed`,
46// which the compiled `lean-rs-host` shim dylib references through
47// `Lean.collectAxioms` (in the shims since v0.1.18), so the mandatory host
48// shim fails `dlopen` on those toolchains — the window claimed support the
49// runtime never had. Verified by `nm -gU`: 4.29.1 exports zero
50// `collectAndGet` symbols, 4.30.0 and later export four. The earlier 4.26.0
51// drop (2026-07-19) was for shim *build* failures; ≤ 4.25.x is excluded by
52// the refcount divergence that crashes inside `lean_dec_ref_cold`.
53pub const SUPPORTED_TOOLCHAINS: &[SupportedToolchain] = &[
54    SupportedToolchain {
55        versions: &["4.30.0"],
56        header_digest: "5a25125970f4f1dcf85a4c403463b387a8ff93535cd4a3054cafdee1759017d7",
57        missing_symbols: &[],
58    },
59    SupportedToolchain {
60        versions: &["4.31.0-rc1", "4.31.0-rc2"],
61        header_digest: "99ef35d69709e38caf836cf9ebbdf94d4474801e04157b8a72622dbdc653ec87",
62        missing_symbols: &[],
63    },
64    SupportedToolchain {
65        versions: &["4.31.0"],
66        header_digest: "486fe204404c0fdfb753b7e089c1c0d38fbdb396206030497696165e31218992",
67        missing_symbols: &[],
68    },
69    SupportedToolchain {
70        versions: &["4.32.0-rc1", "4.32.0", "4.32.2"],
71        header_digest: "22eed50aa703c4403010fabc12a7231ffa34dc979bd59ca1bfbac13c29a1dad2",
72        missing_symbols: &[],
73    },
74    // 4.33.0-rc1 ships a *new* `lean.h` digest, but the change is confined to
75    // two C11 `_Atomic(...)` qualifiers—`m_canceled` (a `uint8_t` inside the
76    // opaque `lean_task_imp`, reached only via our `*mut c_void` `imp` field)
77    // and `m_imp` (a pointer in `lean_task_object`). `_Atomic(T)` for a
78    // lock-free scalar/pointer has the same size and alignment as `T`, so a
79    // probe against both headers reports byte-identical size, alignment, and
80    // field offsets for all 10 mirrored structs. `repr.rs` is unchanged; all
81    // 88 REQUIRED_SYMBOLS resolve. Added 2026-07-19 as the new head.
82    SupportedToolchain {
83        versions: &["4.33.0-rc1", "4.33.0-rc2"],
84        header_digest: "9018878554c5552ff3754865780d21825c2d0c5c4b47491b37bf6fe046adcd56",
85        missing_symbols: &[],
86    },
87];
88
89/// Return the [`SupportedToolchain`] entry that includes `version`, if any.
90#[must_use]
91pub fn supported_for(version: &str) -> Option<&'static SupportedToolchain> {
92    SUPPORTED_TOOLCHAINS.iter().find(|t| t.includes(version))
93}
94
95/// Return the [`SupportedToolchain`] entry whose `header_digest` matches the
96/// given lowercase-hex SHA-256 string, if any.
97#[must_use]
98pub fn supported_by_digest(digest: &str) -> Option<&'static SupportedToolchain> {
99    SUPPORTED_TOOLCHAINS.iter().find(|t| t.header_digest == digest)
100}
101
102/// Return `true` iff no [`SupportedToolchain`] entry lists `symbol` under
103/// `missing_symbols`. Combine with [`crate::REQUIRED_SYMBOLS`] for a
104/// membership check via [`crate::symbol_in_all`].
105#[must_use]
106pub fn symbol_present_in_window(symbol: &str) -> bool {
107    SUPPORTED_TOOLCHAINS
108        .iter()
109        .all(|t| !t.missing_symbols.contains(&symbol))
110}
111
112#[cfg(test)]
113mod tests {
114    use super::*;
115
116    /// `SemVer` precedence key for a Lean version string: numeric release
117    /// core (e.g. `4.31.0`) first, then a flag that ranks a final release
118    /// *after* its pre-releases (`false` for `-rcN`, `true` for a final),
119    /// then the pre-release identifier. Tuple `Ord` composes these in the
120    /// right priority. The naive `&str` comparison gets the rc/final pair
121    /// backwards—`"4.31.0" < "4.31.0-rc1"` lexically—so the ordering
122    /// invariant compares these keys instead (`SemVer` §11).
123    fn precedence_key(version: &str) -> (Vec<u64>, bool, &str) {
124        let (core, pre) = match version.split_once('-') {
125            Some((core, pre)) => (core, pre),
126            None => (version, ""),
127        };
128        let core_nums = core.split('.').map(|n| n.parse().unwrap_or(0)).collect();
129        (core_nums, pre.is_empty(), pre)
130    }
131
132    #[test]
133    fn window_is_non_empty_and_ordered_by_first_version() {
134        assert!(!SUPPORTED_TOOLCHAINS.is_empty());
135        for w in SUPPORTED_TOOLCHAINS.windows(2) {
136            let (Some(prev), Some(next)) = (w.first(), w.get(1)) else {
137                continue;
138            };
139            let (Some(a), Some(b)) = (prev.versions.first(), next.versions.first()) else {
140                continue;
141            };
142            assert!(
143                precedence_key(a) < precedence_key(b),
144                "SUPPORTED_TOOLCHAINS must be sorted ascending by first version: {a} >= {b}",
145            );
146        }
147    }
148
149    #[test]
150    fn every_entry_lists_at_least_one_version() {
151        for t in SUPPORTED_TOOLCHAINS {
152            assert!(
153                !t.versions.is_empty(),
154                "entry with digest {} has no versions",
155                t.header_digest
156            );
157        }
158    }
159
160    #[test]
161    fn digests_are_distinct() {
162        for (i, a) in SUPPORTED_TOOLCHAINS.iter().enumerate() {
163            let Some(rest) = SUPPORTED_TOOLCHAINS.get(i + 1..) else {
164                continue;
165            };
166            for b in rest {
167                assert_ne!(
168                    a.header_digest, b.header_digest,
169                    "{:?} and {:?} share a header digest \u{2014} merge their `versions` arrays",
170                    a.versions, b.versions,
171                );
172            }
173        }
174    }
175
176    #[test]
177    fn versions_are_distinct_across_entries() {
178        let mut seen: Vec<&str> = Vec::new();
179        for t in SUPPORTED_TOOLCHAINS {
180            for &v in t.versions {
181                assert!(
182                    !seen.contains(&v),
183                    "version {v} appears in more than one SupportedToolchain entry",
184                );
185                seen.push(v);
186            }
187        }
188    }
189
190    #[test]
191    fn digests_are_64_lowercase_hex() {
192        for t in SUPPORTED_TOOLCHAINS {
193            assert_eq!(
194                t.header_digest.len(),
195                64,
196                "entry for {:?}: digest is not 64 chars",
197                t.versions,
198            );
199            assert!(
200                t.header_digest
201                    .bytes()
202                    .all(|b| b.is_ascii_digit() || (b'a'..=b'f').contains(&b)),
203                "entry for {:?}: digest is not lowercase hex",
204                t.versions,
205            );
206        }
207    }
208
209    #[test]
210    fn lookups_round_trip() {
211        for t in SUPPORTED_TOOLCHAINS {
212            for &v in t.versions {
213                assert_eq!(supported_for(v), Some(t));
214            }
215            assert_eq!(supported_by_digest(t.header_digest), Some(t));
216        }
217        assert!(supported_for("0.0.0").is_none());
218        assert!(supported_by_digest("0").is_none());
219    }
220
221    #[test]
222    fn fully_present_symbols_pass_window_check() {
223        for &s in crate::REQUIRED_SYMBOLS {
224            assert!(symbol_present_in_window(s), "{s} should be in all supported toolchains");
225        }
226    }
227
228    #[test]
229    fn unknown_symbol_passes_window_check() {
230        // No entry can possibly list an unknown symbol under missing_symbols,
231        // so the window-only check trivially passes; the membership check
232        // (`crate::symbol_in_all`) is what catches non-required symbols.
233        assert!(symbol_present_in_window("lean_does_not_exist_zzz"));
234    }
235}