fix: strict ModReduce in emulated fields

[ivokub]

Description

Fixes #1147, but more thoroughly. Added separate method which performs modular reduction and asserts that the result is in range. Updated the documentation accordingly.

Additionally, added an option to algebra methods to obtain the canonical bit representation if necessary (when comparing bitwise some values).

The current implementation are not modified - if the prover would provide x+p from the hint, then the recursion implementations fail to solve as we have incorrect FS challenges.

We now have reduction in the 2-chain PLONK verifier as previously when performing binary decomposition of BLS12 points we used canonical decomposition, but now by default we don't.

Type of change

• Bug fix (non-breaking change which fixes an issue)
• New feature (non-breaking change which adds functionality)
• This change requires a documentation update

How has this been tested?

• TestReduceStrict
• TestToBitsCanonical
• TestIsZeroEdgeCases

How has this been benchmarked?

• PLONK verify BLS12-377 in BW6-761. Was 358153 now 322251
• PLONK verify BW6-761 in BN254. Was 28933345 now 28215408.

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

[ivokub]

Converting to draft until bugs fixed.

[ivokub]

Fixes pushed.