{"packages":{"danog/primemodule":{"1.0":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0","version_normalized":"1.0.0.0","license":["AGLPV3"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"1a1c52780bd45796ccaae5ac3fe2c53cf28c3e64"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/1a1c52780bd45796ccaae5ac3fe2c53cf28c3e64","type":"zip","shasum":"","reference":"1a1c52780bd45796ccaae5ac3fe2c53cf28c3e64"},"type":"library","funding":[],"time":"2018-03-13T13:46:26+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://github.com/danog/PrimeModule-ext)"},"uid":2004082},"1.0.1":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.1","version_normalized":"1.0.1.0","license":["AGLPV3"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"cba74439dff77e68cd70a33c7898a035a4f64557"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/cba74439dff77e68cd70a33c7898a035a4f64557","type":"zip","shasum":"","reference":"cba74439dff77e68cd70a33c7898a035a4f64557"},"type":"library","funding":[],"time":"2018-03-16T12:08:41+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://github.com/danog/PrimeModule-ext)"},"uid":2004083},"1.0.10":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.10","version_normalized":"1.0.10.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"dadd3fa2693425f2b7feee5bb717d79b1af42b80"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/dadd3fa2693425f2b7feee5bb717d79b1af42b80","type":"zip","shasum":"","reference":"dadd3fa2693425f2b7feee5bb717d79b1af42b80"},"type":"library","funding":[],"time":"2022-05-22T12:28:02+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"revision":0}},"require":{"php":"^8.0"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":6268348},"1.0.10.9998":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.10.9998","version_normalized":"1.0.10.9998","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"63ff15d3d92c9ba2d2a6a5a8fca298d5571a5b39"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/63ff15d3d92c9ba2d2a6a5a8fca298d5571a5b39","type":"zip","shasum":"","reference":"63ff15d3d92c9ba2d2a6a5a8fca298d5571a5b39"},"type":"library","funding":[],"time":"2022-05-22T12:28:25+00:00","autoload":{"files":["___transpiledWithPhabel.php"],"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"require":[],"revision":0}},"require":{"phabel/phabel":"^1.0","php":"*"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":6268349},"1.0.10.9999":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.10.9999","version_normalized":"1.0.10.9999","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"dadd3fa2693425f2b7feee5bb717d79b1af42b80"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/dadd3fa2693425f2b7feee5bb717d79b1af42b80","type":"zip","shasum":"","reference":"dadd3fa2693425f2b7feee5bb717d79b1af42b80"},"type":"library","funding":[],"time":"2022-05-22T12:28:02+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"revision":0}},"require":{"php":"^8.0"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":6268350},"1.0.11":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.11","version_normalized":"1.0.11.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"2328b1ec43b4a2a318602f4b16d6bf628ca96d04"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/2328b1ec43b4a2a318602f4b16d6bf628ca96d04","type":"zip","shasum":"","reference":"2328b1ec43b4a2a318602f4b16d6bf628ca96d04"},"type":"library","funding":[],"time":"2022-12-03T20:53:15+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"revision":0}},"require":{"php":"^8.0"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":6757579},"1.0.11.9998":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.11.9998","version_normalized":"1.0.11.9998","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"970feba34fe7c019f7925d7a68085117412504e4"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/970feba34fe7c019f7925d7a68085117412504e4","type":"zip","shasum":"","reference":"970feba34fe7c019f7925d7a68085117412504e4"},"type":"library","funding":[],"time":"2022-12-03T20:54:02+00:00","autoload":{"files":["___transpiledWithPhabel.php"],"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"require":[],"revision":0}},"require":{"phabel/phabel":"^1.0","php":"*"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":6757580},"1.0.11.9999":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.11.9999","version_normalized":"1.0.11.9999","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"2328b1ec43b4a2a318602f4b16d6bf628ca96d04"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/2328b1ec43b4a2a318602f4b16d6bf628ca96d04","type":"zip","shasum":"","reference":"2328b1ec43b4a2a318602f4b16d6bf628ca96d04"},"type":"library","funding":[],"time":"2022-12-03T20:53:15+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"revision":0}},"require":{"php":"^8.0"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":6757581},"1.0.12":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.12","version_normalized":"1.0.12.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"1fcfddc25347ed21de26150ba1fbe95b0a2b2862"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/1fcfddc25347ed21de26150ba1fbe95b0a2b2862","type":"zip","shasum":"","reference":"1fcfddc25347ed21de26150ba1fbe95b0a2b2862"},"type":"library","funding":[],"time":"2023-04-12T14:19:15+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"revision":0}},"require":{"php":"^8.0"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":7114471},"1.0.13":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.13","version_normalized":"1.0.13.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"e7ebfc1ea64c24186e49064cd4b76bc76c28600e"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/e7ebfc1ea64c24186e49064cd4b76bc76c28600e","type":"zip","shasum":"","reference":"e7ebfc1ea64c24186e49064cd4b76bc76c28600e"},"type":"library","funding":[],"time":"2023-05-27T14:41:40+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"revision":0}},"require":{"php":"^8.0"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":7236799},"1.0.2":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.2","version_normalized":"1.0.2.0","license":["AGLPV3"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"df0a4ccf9b899b6d31afbdae183d9ae6a3a9d75a"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/df0a4ccf9b899b6d31afbdae183d9ae6a3a9d75a","type":"zip","shasum":"","reference":"df0a4ccf9b899b6d31afbdae183d9ae6a3a9d75a"},"type":"library","funding":[],"time":"2018-03-16T12:20:36+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://github.com/danog/PrimeModule-ext)"},"uid":2004084},"1.0.3":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.3","version_normalized":"1.0.3.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"a18918c4092d6d8696521b05a59a3cdb5cdc061e"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/a18918c4092d6d8696521b05a59a3cdb5cdc061e","type":"zip","shasum":"","reference":"a18918c4092d6d8696521b05a59a3cdb5cdc061e"},"type":"library","funding":[],"time":"2018-03-21T10:47:51+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://github.com/danog/PrimeModule-ext)"},"uid":2015046},"1.0.4":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.4","version_normalized":"1.0.4.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"293b76709722988608f0db063a0eeb9fb126ed22"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/293b76709722988608f0db063a0eeb9fb126ed22","type":"zip","shasum":"","reference":"293b76709722988608f0db063a0eeb9fb126ed22"},"type":"library","funding":[],"time":"2021-02-08T18:57:32+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://github.com/danog/PrimeModule-ext)"},"uid":4924103},"1.0.5":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.5","version_normalized":"1.0.5.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"946c8273e271efc9a70795399800082569769969"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/946c8273e271efc9a70795399800082569769969","type":"zip","shasum":"","reference":"946c8273e271efc9a70795399800082569769969"},"type":"library","funding":[],"time":"2021-09-04T16:55:26+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://github.com/danog/PrimeModule-ext)"},"uid":5490151},"1.0.6":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.6","version_normalized":"1.0.6.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"34f41ddc2d77aa96d6bd435513bcf516dbfa78b5"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/34f41ddc2d77aa96d6bd435513bcf516dbfa78b5","type":"zip","shasum":"","reference":"34f41ddc2d77aa96d6bd435513bcf516dbfa78b5"},"type":"library","funding":[],"time":"2021-09-05T18:55:40+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://github.com/danog/PrimeModule-ext)"},"uid":5491342},"1.0.7":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.7","version_normalized":"1.0.7.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"371cf2521dc665875cac5765259240c0666de69c"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/371cf2521dc665875cac5765259240c0666de69c","type":"zip","shasum":"","reference":"371cf2521dc665875cac5765259240c0666de69c"},"type":"library","funding":[],"time":"2021-10-24T16:51:03+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"require":{"php":">=7.0"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://github.com/danog/PrimeModule-ext)"},"uid":5634156},"1.0.8":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.8","version_normalized":"1.0.8.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"678fcfd2fcfec975ffd7b0e437c01e700c48468c"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/678fcfd2fcfec975ffd7b0e437c01e700c48468c","type":"zip","shasum":"","reference":"678fcfd2fcfec975ffd7b0e437c01e700c48468c"},"type":"library","funding":[],"time":"2022-05-22T12:15:00+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"revision":0}},"require":{"php":"^8.0"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":6268325},"1.0.9":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.9","version_normalized":"1.0.9.0","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"fbb45df47d84e6a5145407ded1fdde4a85d6421f"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/fbb45df47d84e6a5145407ded1fdde4a85d6421f","type":"zip","shasum":"","reference":"fbb45df47d84e6a5145407ded1fdde4a85d6421f"},"type":"library","funding":[],"time":"2022-05-22T12:15:58+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"revision":0}},"require":{"php":"^8.0"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":6268328},"1.0.9.9998":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.9.9998","version_normalized":"1.0.9.9998","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"91dc35b8833a71de8e24ff84e9444918c2692b84"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/91dc35b8833a71de8e24ff84e9444918c2692b84","type":"zip","shasum":"","reference":"91dc35b8833a71de8e24ff84e9444918c2692b84"},"type":"library","funding":[],"time":"2022-05-22T12:16:12+00:00","autoload":{"files":["___transpiledWithPhabel.php"],"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"require":[],"revision":0}},"require":{"phabel/phabel":"^1.0","php":"*"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":6268329},"1.0.9.9999":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"1.0.9.9999","version_normalized":"1.0.9.9999","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"fbb45df47d84e6a5145407ded1fdde4a85d6421f"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/fbb45df47d84e6a5145407ded1fdde4a85d6421f","type":"zip","shasum":"","reference":"fbb45df47d84e6a5145407ded1fdde4a85d6421f"},"type":"library","funding":[],"time":"2022-05-22T12:15:58+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"revision":0}},"require":{"php":"^8.0"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":6268330},"dev-master":{"name":"danog/primemodule","description":"Prime module capable of doing prime factorization of huge numbers very quickly.\"","keywords":[],"homepage":"","version":"dev-master","version_normalized":"9999999-dev","license":["AGPL-3.0-only"],"authors":[{"name":"Daniil Gentili","email":"daniil@daniil.it"}],"source":{"url":"https://github.com/danog/PrimeModule.git","type":"git","reference":"323d93061050c5dc0204c688c7f5a1048dc8932f"},"dist":{"url":"https://api.github.com/repos/danog/PrimeModule/zipball/323d93061050c5dc0204c688c7f5a1048dc8932f","type":"zip","shasum":"","reference":"323d93061050c5dc0204c688c7f5a1048dc8932f"},"type":"library","funding":[],"time":"2023-12-29T15:35:52+00:00","autoload":{"psr-0":{"danog\\":"lib/"}},"extra":{"phabel":{"revision":0}},"default-branch":true,"require":{"php":"^8.0"},"require-dev":{"phabel/phabel":"^1"},"suggest":{"ext-primemodule":"Install the native C++ extension for extremely fast factorization (https://prime.madelineproto.xyz)"},"uid":4211080}}}}