perf(bls12-377): eliminate finalexp ~naively

[yelhousni]

Description

Similarly to #1173, we apply theorem 1 of https://eprint.iacr.org/2024/640.pdf to check that f == c^r. We check instead that f^k == c^(q-u) where k=(u-1)^2/3 using a Frobenius map and 2 optimized addition chains. This PR implements this idea after pushing f to the cyclotomic subgroup. The exponentiations are done then using a mix of Karabina's and Granger--Scott's algorithms whenever appropriate.

Type of change

• Bug fix (non-breaking change which fixes an issue)

How has this been tested?

Pairing tests pass.

How has this been benchmarked?

This PR saves 11,864 scs in the PairingCheck and 12,356 scs in the PLONK native aggregation circuit.

Checklist:

• I have performed a self-review of my code
• I have commented my code, particularly in hard-to-understand areas
• I have made corresponding changes to the documentation
• I have added tests that prove my fix is effective or that my feature works
• I did not modify files generated from templates
• golangci-lint does not output errors locally
• New and existing unit tests pass locally with my changes
• Any dependent changes have been merged and published in downstream modules

[yelhousni]

superseded by #1207