What are you doing now? I feel like after I graduate I’m gonna have to find a new field.

If it’s actually exploiting a bug in a formal system, no. If it’s a natural-language (unformalized) document which no one can understand, no. On the other hand a formal proof not using bugs which can’t be understood, is still considered a proof, though its value is lower than an understandable proof (because as you said in another comment, the real value is in understanding rather than theorems). The prototypical example before LLMs was the proof of the four-color theorem which relied on computer-checked casework.