{"id":20618816,"url":"https://github.com/anthhon/prime-breaker","last_synced_at":"2025-10-26T07:14:11.449Z","repository":{"id":113454505,"uuid":"584184951","full_name":"Anthhon/prime-breaker","owner":"Anthhon","description":"A simple and efficient way to find two prime numbers that multiply to a given","archived":false,"fork":false,"pushed_at":"2023-04-09T03:57:09.000Z","size":303,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-11T15:40:00.357Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Rust","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/Anthhon.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":"2023-01-01T18:32:08.000Z","updated_at":"2023-09-13T11:49:23.000Z","dependencies_parsed_at":"2024-11-20T11:01:49.440Z","dependency_job_id":null,"html_url":"https://github.com/Anthhon/prime-breaker","commit_stats":null,"previous_names":["anthhon/prime-breaker"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Anthhon/prime-breaker","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anthhon%2Fprime-breaker","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anthhon%2Fprime-breaker/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anthhon%2Fprime-breaker/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anthhon%2Fprime-breaker/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Anthhon","download_url":"https://codeload.github.com/Anthhon/prime-breaker/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anthhon%2Fprime-breaker/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279007602,"owners_count":26084334,"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","status":"online","status_checked_at":"2025-10-11T02:00:06.511Z","response_time":55,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":[],"created_at":"2024-11-16T12:09:34.628Z","updated_at":"2025-10-11T15:40:01.041Z","avatar_url":"https://github.com/Anthhon.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# prime-breaker\n\nOverall, this program is a simple and efficient way to find two prime numbers that multiply to a given one\n\nThis C program is designed to find two prime numbers that multiply to a target prime number.\nThe program uses an efficient prime number checking algorithm based on the Sieve of Eratosthenes to quickly determine\nif a number is prime or not. The program also includes a timer to measure how long it takes to find the two prime numbers.\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanthhon%2Fprime-breaker","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanthhon%2Fprime-breaker","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanthhon%2Fprime-breaker/lists"}