{"id":20802321,"url":"https://github.com/onurmx/pi","last_synced_at":"2025-03-12T03:13:19.535Z","repository":{"id":207894112,"uuid":"548383788","full_name":"onurmx/pi","owner":"onurmx","description":"Calculating digits of pi with arbitrary size and find pattern inside.","archived":false,"fork":false,"pushed_at":"2023-11-18T09:01:19.000Z","size":1598,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-18T12:35:16.103Z","etag":null,"topics":["algorithms","approximation","approximation-algorithms","arbitrary-precision","billion","billions","chudnovsky","computability","gmp","high-performance-computing","knuth-morris-pratt","million","mpf","mpir","mpz","pattern","pattern-finding","pi"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/onurmx.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2022-10-09T13:08:45.000Z","updated_at":"2023-11-18T08:40:47.000Z","dependencies_parsed_at":"2023-11-18T09:40:38.189Z","dependency_job_id":null,"html_url":"https://github.com/onurmx/pi","commit_stats":null,"previous_names":["onurmx/pi"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/onurmx%2Fpi","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/onurmx%2Fpi/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/onurmx%2Fpi/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/onurmx%2Fpi/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/onurmx","download_url":"https://codeload.github.com/onurmx/pi/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243147108,"owners_count":20243746,"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":["algorithms","approximation","approximation-algorithms","arbitrary-precision","billion","billions","chudnovsky","computability","gmp","high-performance-computing","knuth-morris-pratt","million","mpf","mpir","mpz","pattern","pattern-finding","pi"],"created_at":"2024-11-17T18:30:01.620Z","updated_at":"2025-03-12T03:13:19.516Z","avatar_url":"https://github.com/onurmx.png","language":"C++","readme":"# pi\nCalculating digits of pi with arbitrary size and find pattern inside.\n\n## Pi calculation\nIt can calculate billion digits of pi with using Chudnovsky algorithm.\n\n## Pattern finding\nIt can find number patterns with using Knutt-Morris-Pratt algorithm.\n\n## Compilation\nCompilation is done by selecting \"Release\" and targeting \"x64\" bit cpu architecture.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fonurmx%2Fpi","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fonurmx%2Fpi","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fonurmx%2Fpi/lists"}