So far we have manually checkable proofs for the field mul and square inner loops, and machine verification (via frama-c) of overflow-freeness for 10x26 (5x52 requires hacking on frama-c to get a 128 bit type into it.)
I believe know how to machine check the field and scalar in a reasonable amount of time, but not straight from the C; so the effort would be one-time and rot, and I’m not sure it’s worth the time.
There may be other areas of the code that are good targets for formal methods. I’d hoped previously to get some researchers working in this space interested; but so far no luck.