Skip to content

lukegor/FastModularExponentiation

View on GitHub ↗Related repositories →

This C# program efficiently calculates <a^b mod  n> using exponentiation by squaring. Ideal for cryptography and large number computations.

active 2024-05-262024-07-22 (UTC)

Complete coverage26,369 / 26,369 hourly files (100%) · 2 absent upstream2023-08-152026-08-17 (UTC)
Events
10
Pushes
5
Pull requests
0
Issues
0
Stars
1
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 58 days from 2024-05-26 to 2024-07-22. Pushes: 5 total, peak 4 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 1 total, peak 1 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
lukegor5500

Recent activity

Latest issues, pull requests and releases

  • Releaselukegor2024-07-02 18:42
    Release

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 1 stars here means stars gained during the window, not the repo's star count.