{"id":19049448,"url":"https://github.com/flothinkspi/prime-chain-calculator","last_synced_at":"2026-05-10T16:30:18.769Z","repository":{"id":81709633,"uuid":"82168896","full_name":"FloThinksPi/Prime-Chain-Calculator","owner":"FloThinksPi","description":"Calculates the longest chain of prime numbers e.g: \" 18593 → 185593 → 1855993 .... \" but limitation is the INT32 numberspace of Java. So no bigger prime chains than INT_MAX will be found.","archived":false,"fork":false,"pushed_at":"2017-02-16T11:02:26.000Z","size":13,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-02T09:26:28.655Z","etag":null,"topics":["java","java-8","parallel-computing","parallelism","parallelization","prime-chain","prime-numbers","student-project","study-project"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-2-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/FloThinksPi.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-02-16T10:28:39.000Z","updated_at":"2017-02-20T15:09:14.000Z","dependencies_parsed_at":null,"dependency_job_id":"7651a4b7-83ab-4876-93e6-cf918cfe8710","html_url":"https://github.com/FloThinksPi/Prime-Chain-Calculator","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/FloThinksPi%2FPrime-Chain-Calculator","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FloThinksPi%2FPrime-Chain-Calculator/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FloThinksPi%2FPrime-Chain-Calculator/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FloThinksPi%2FPrime-Chain-Calculator/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/FloThinksPi","download_url":"https://codeload.github.com/FloThinksPi/Prime-Chain-Calculator/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240105468,"owners_count":19748465,"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":["java","java-8","parallel-computing","parallelism","parallelization","prime-chain","prime-numbers","student-project","study-project"],"created_at":"2024-11-08T23:10:55.615Z","updated_at":"2026-05-10T16:30:18.728Z","avatar_url":"https://github.com/FloThinksPi.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"Instructions\n============\n\nStart with option -Xmx12G or more(needs lots of ram). Other possibillity is to set maxPrimeNumber in Config.java to a smaller value.\n\nAt the first run a prime database gets generated with all prime numbers from variables 0 to maxPrimeNumber= from Config.java.\nAfter that, prime chains will get searched betwen the variables startChainSearch and stopChainSearch from Config.java.\nAll further runs will use the prime database file and will be faster. \nIf you change maxPrimeNumber= from Config.java delete the prime database first so the primes get regenerated.\n\nLongest primechain from 0 to INT32_MAX is [31, 331, 3331, 33331, 333331, 3333331, 33333331].\n\nBSD 2-Clause License\n============\n\nCopyright (c) 2016, Florian Braun\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n  list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice,\n  this list of conditions and the following disclaimer in the documentation\n  and/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fflothinkspi%2Fprime-chain-calculator","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fflothinkspi%2Fprime-chain-calculator","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fflothinkspi%2Fprime-chain-calculator/lists"}