@user We should whitelist theorem proving languages that are known to be sound and widely used. If the community objects to this approach, maybe we should create a tag for Lean challenges specifically perhaps? On second thought, maybe a tag for Lean challenges would be better. Because the statement has to be formalized, or specified in the ITP language too.
Whitelisting interactive theorem proving langs doesn’t seem like the easiest thing to do, but it may be easier to differentiate between such a language and a language that isn’t one than other categories
A proof golf without restrictions on language used sounds best, though IMO
Unless there’s a compelling reason to use Lean or Coq
I’d recommend bringing this up in tnb where more people will see it