This repository has been archived by the owner on Dec 9, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 14
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Issue 68: Refactor existing modular arithmetic code (#80)
* Add test case generation script. * Change test case names. * Move gentests to subdirectory; ignore generated files. * Document gentests.py file output format. * Add BLS12-377 base field to 'gentests.py'. * First more-or-less full version of test suite for Tweedledum. * Ensure input is normalised. * Support unary operators in test suite. * Use zero instead of modulus for the 'None' value. * Finish unaryop/binaryop refactor; make division work. * Remove dependency on Tweedledum curve. * Move test utils out of TweedledumBase (on their way to their own file eventually). * Generate tests with a macro; instantiate in each base field. * Use Field::BYTES when reading in test cases. * Generate test inputs in a function. * Completed test suite. * Remove unused files. * Document some functions. * Addressed PR comments. * Used const generics to refactor bigint arithmetic. * Fix bad merge. * Remove `mul` use clause and fix `cmp` visibility.
- Loading branch information
Showing
8 changed files
with
139 additions
and
367 deletions.
There are no files selected for viewing
This file contains 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
This file contains 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
Oops, something went wrong.