Simplify 32-bit Montgomery fields#1
Merged
graikos merged 24 commits intoJul 15, 2026
Conversation
mitschabaude
changed the title
mitschabaude
marked this pull request as ready for review
July 15, 2026 06:26
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Mont32FieldAPIreduceRawinNative32.lean.This is a review-by-editing follow-up stacked on
graikos/fast_kb_bb_fields(Verified-zkEVM#258).Performance
The large KoalaBear univariate multiplication benchmark remains at the established baseline:
KoalaBear.Fast.Field: about 4.18 msKoalaBear.Fast.Field: about 1.11 msKoalaBear.Fast.Field: about 1.11 msGenerated C was inspected to confirm that field operations remain direct native Montgomery arithmetic with specialized constants and no transported-field calls or division/remainder in the hot conversion path.