Grzegorz Fabiański

Game-hopping proofs can now be mechanized in Lean with unprecedented clarity and integration, enabling more robust cryptographic security verification.

Forget about checking equivalence for higher-order polyregular functions—it's undecidable.