Releases: patnashev/prst
Releases · patnashev/prst
v13.0
Stable release 13.0
- Deterministic tests of numbers with many different N-1 or N+1 factors, like N!+1, N!-1, N#+1, N#-1.
- New set of self-test cases: freeform.
v12.1
Stable release 12.1
- GWNum 30.19b19.
- Fixed false error in Morrison test for numbers less than 256 bits.
- Number profile with helper factors.
v12.0
- Batch mode (reading numbers from a text file or standard input).
- Support of division in the number format: K*B^N/D+C.
- Saving all proof files in a single pack file.
- GWNum 30.19b11.
v11.1
Stable release 11.1
- GWNum 30.19b3.
- Improved reliability.
- Changed extensions of temporary files.
- Algebraic factors in the number profile.
v11.0
Stable release 11.0
- Gerbicz-Li check in Morrison and LLR tests.
- Strong check by default.
- Multiplicative order of KBNC numbers.
- Multifactorial support.
- GWNum 30.19.
v10.1
Stable release 10.1
- GWNum 30.18.
- New algorithm of fast modulo operation for generic numbers.
v10.0
Stable release 10.0
- Option to compute the multiplicative order of a small constant.
- Option to show the number "profile", a collection of mathematical properties like divisors of N±1 or Kronecker symbol.
- Faster Li algorithms.
- Pocklington test implementation makes use of factors of k.
- Support of Hex(±k*b^n) numbers.
v9.0
Stable release 9.0
- Faster proofs for b!=2 numbers (serialization of checkpoints).
- Support of Phi(3, ±k*b^n) numbers.
- Support of recursive parentheses in K and B, for example "((10^5310+1)*10^1356+1)*10^3333+1".
v8.2
Stable release 8.2
- Interface tweaks.
- Reading additional factors from helper file or command line.
- More reliable "all factors" mode in Pocklington and Morrison tests.