danog/PrimeModule-ext
1
0
Fork 0
mirror of https://github.com/danog/PrimeModule-ext.git synced 2024-11-26 11:54:39 +01:00
Code Issues Projects Releases Wiki Activity
20 Commits 1 Branch 2 Tags 52 KiB
C++ 67.7%
Makefile 15.3%
Shell 12%
C 5%
master
Go to file
Daniil Gentili e5f0310eae
Update hash
2021-10-24 18:36:49 +02:00
examples New C++ header-only library 2021-10-24 18:22:14 +02:00
src New C++ header-only library 2021-10-24 18:22:14 +02:00
_config.yml Set theme jekyll-theme-cayman 2017-08-16 15:57:31 +02:00
.gitignore New C++ header-only library 2021-10-24 18:22:14 +02:00
CNAME Create CNAME 2017-08-16 16:00:51 +02:00
LICENSE First commit 2017-05-06 18:32:27 +01:00
Makefile Add PKGBUILD 2021-10-24 18:35:29 +02:00
PKGBUILD Update hash 2021-10-24 18:36:49 +02:00
README.md New C++ header-only library 2021-10-24 18:22:14 +02:00

README.md

PrimeModule-ext

C++ header-only library, binary and FFI library for factorizing huge (up to 2^63-1) numbers (optimized for huge semiprimes).

Install

Arch Linux (AUR):

paru -S primemodule

Debian/Ubuntu:

sudo apt-get install build-essential && git clone https://github.com/danog/PrimeModule-ext && cd PrimeModule-ext && make -j$(nproc) && sudo make install

API

Binary

primemodule number

On success (return code 0), prints to stdout one of the prime factors of number.

C++

uint32_t PrimeModule::factorize(uint64_t number);

Returns one of the prime factors of number, throws an std::runtime_error on failure.

C

int64_t factorize(uint64_t number);

Returns one of the prime factors of number, returns -1 on failure.

PHP

<?php

$f = FFI::load("/usr/include/primemodule-ffi.h");

// Always pass strings to allow 64-bit factorization with no loss of precision on 32-bit PHP.
var_dump($f->factorizeFFI("2189285106422392999"));

Returns one of the prime factors of 2189285106422392999, returns -1 on failure.