Another cool Lean exercise: a verified implementation of the Boyer-Moore majority voting algorithm.
It's an O(n) time O(1) space majority element detection algorithm.

The 1981 verification of took the authors 20 hours. In contrast, I spent no more than 4 hours (including building the CLI tool) thanks to proof automation techniques like grind and omega.

https://github.com/Forthoney/mjrty

GitHub - Forthoney/mjrty: Verified Boyer-Moore majority algorithm

Verified Boyer-Moore majority algorithm. Contribute to Forthoney/mjrty development by creating an account on GitHub.

GitHub

@castlehoney Cool!

Also, I heard that omega will soon be deprecated in favor of grind.