Rafał Stefański

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

Regularity can be understood in a broader context, revealing connections across diverse output domains that challenge traditional assumptions in computation theory.

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