pub fn fingerprint(levers: &BTreeMap<String, String>) -> String
2026-09-26: The SHA-256 of a lever set: name=value in key order, each NUL-terminated, so A=1 B=2 and A=1B=2 differ and the empty set has one fixed digest.
name=value
A=1 B=2
A=1B=2