| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
Implements Tonelli–Shanks for odd prime moduli with Legendre check, p≡3 (mod 4) fast path, and Vitest coverage. Signed-off-by: Felipe Fernandes <felipe.of.dev@gmail.com>
Codecov Report❌ Patch coverage is 93.51852% with 7 lines in your changes missing coverage. Please review.
@@ Coverage Diff @@
## master #1913 +/- ##
==========================================
+ Coverage 85.91% 85.95% +0.04%
==========================================
Files 379 380 +1
Lines 19778 19886 +108
Branches 3016 3042 +26
==========================================
+ Hits 16993 17094 +101
- Misses 2785 2792 +7 ☔ View full report in Codecov by Harness.
|
Sorry, something went wrong.
| Back | FazBrowse Home | New Git URL |
Description
Adds Maths/TonelliShanks.js implementing the Tonelli–Shanks algorithm for modular square roots modulo an odd prime.
Reference: https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm
Checklist
— Felipe Fernandes · Systems & Agentic AI Engineer
https://github.com/felipeofdev-ai · https://felipeofdev-ai.github.io/