From 638c07c2ec5e29eef6645fff5da6014aabb5c8c7 Mon Sep 17 00:00:00 2001 From: Jeffrey Hurchalla Date: Fri, 9 Feb 2024 15:22:10 -0800 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index dd16fbb..b66c22f 100644 --- a/README.md +++ b/README.md @@ -2,7 +2,7 @@ ![Alt text](images/epr.jpg?raw=true "Elliptic curve, and rho cycle") -EPR is a high performance, easy to use factoring and primality checking C++ library (header-only) for any integer up to 128 bits in size. At the time of this writing, EPR can provide you with one of the fastest factoring functions known for 64 bit integers (i.e. types int64_t and uint64_t). Note that for good performance you *must* ensure that the standard macro NDEBUG is defined when compiling - see [How to use the library](#how-to-use-the-library). +EPR is a high performance, easy to use factoring and primality checking C++ library (header-only) for any integer up to 128 bits in size. At the time of this writing, EPR provides the fastest factoring functions known for 64 bit integers (i.e. types int64_t and uint64_t). Note that for good performance you *must* ensure that the standard macro NDEBUG is defined when compiling - see [How to use the library](#how-to-use-the-library). The name EPR is an abbreviation of Ecm and Pollard-Rho, since those are the two main algorithms this library uses for factoring. It's also a play on [Einstein-Podolsky-Rosen](https://en.wikipedia.org/wiki/EPR_paradox) for fun ([for now](https://en.wikipedia.org/wiki/Shor%27s_algorithm)).