{"id":16154904,"url":"https://github.com/schernykh/factorization","last_synced_at":"2025-04-07T00:38:20.389Z","repository":{"id":103404839,"uuid":"87055263","full_name":"SChernykh/Factorization","owner":"SChernykh","description":"Fast factorization of numbers less than 2^64","archived":false,"fork":false,"pushed_at":"2017-04-03T08:54:05.000Z","size":64,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-13T06:18:31.545Z","etag":null,"topics":["division-free","factorization"],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SChernykh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-04-03T08:53:57.000Z","updated_at":"2021-05-22T00:33:44.000Z","dependencies_parsed_at":null,"dependency_job_id":"4316ac5c-2e8f-468e-94c9-7e67220025ab","html_url":"https://github.com/SChernykh/Factorization","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SChernykh%2FFactorization","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SChernykh%2FFactorization/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SChernykh%2FFactorization/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SChernykh%2FFactorization/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SChernykh","download_url":"https://codeload.github.com/SChernykh/Factorization/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247574087,"owners_count":20960495,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["division-free","factorization"],"created_at":"2024-10-10T01:19:12.539Z","updated_at":"2025-04-07T00:38:20.371Z","avatar_url":"https://github.com/SChernykh.png","language":"C++","readme":"# Factorization\nFast factorization of numbers less than 2^64. It does trial divisions up to fourth root of N and then 1 or 2 Pollard-Brent calls to get the remaining factors.\n\nAll integer divisions are replaced with multiplications by reciprocals, both for trial division step and Pollard-Brent step.\n\nSome performance data: ~296,000 factorizations per second on a single core of Core i7-4770K for numbers around ~10^15\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fschernykh%2Ffactorization","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fschernykh%2Ffactorization","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fschernykh%2Ffactorization/lists"}