{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"naturals-big-endian","owner":"arithmetic-operations-for","isFork":false,"description":"🐘 Arbitrary precision arithmetic for integers in big-endian order for JavaScript","allTopics":["algorithms","agpl","base-conversion","arithmetic","biginteger","integer","big-endian","extended-euclidean-algorithm","divide-and-conquer","euclidean-algorithm","karatsuba-multiplication","divide-and-conquer-division","exponentiation-by-squaring","javascript"],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":0,"issueCount":17,"starsCount":2,"forksCount":2,"license":"GNU Affero General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-13T10:17:02.092Z"}},{"type":"Public","name":"integers-modulo-n-big-endian","owner":"arithmetic-operations-for","isFork":false,"description":"🧜‍♀️ Modular arithmetic for JavaScript","allTopics":["modular","algorithms","prime","agpl","arithmetic","modular-arithmetic","biginteger","integer","big-endian","montgomery","modulo","modular-exponentiation","exponentiation-by-squaring","modular-inverse","montgomery-trick","montgomery-multiplication","javascript"],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":3,"issueCount":7,"starsCount":0,"forksCount":1,"license":"GNU Affero General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-13T09:30:57.843Z"}}],"repositoryCount":2,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}