Skip to content

Commit

Permalink
Add release notes for v0.3.2
Browse files Browse the repository at this point in the history
  • Loading branch information
mhostetter committed Dec 19, 2022
1 parent 5b9d50a commit 2a006d1
Show file tree
Hide file tree
Showing 3 changed files with 54 additions and 1 deletion.
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -78,7 +78,7 @@ Import the `galois` package in Python.
In [1]: import galois

In [2]: galois.__version__
Out[2]: '0.3.1'
Out[2]: '0.3.2'
```

### Create a [`FieldArray`](https://mhostetter.github.io/galois/latest/api/galois.FieldArray/) subclass
Expand Down
1 change: 1 addition & 0 deletions docs/index.rst
Original file line number Diff line number Diff line change
Expand Up @@ -149,6 +149,7 @@ If this library was useful to you in your research, please cite us. Following th
:hidden:

release-notes/versioning.rst
release-notes/v0.3.2.md
release-notes/v0.3.1.md
release-notes/v0.3.0.md
release-notes/v0.2.0.md
Expand Down
52 changes: 52 additions & 0 deletions docs/release-notes/v0.3.2.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,52 @@
# v0.3.2

*Released December 18, 2022*

## Changes

- Added a prime factorization database for $n = b^k \pm 1$, with $b \in \{2, 3, 5, 6, 7, 10, 11, 12\}$.
The factorizations are from the [Cunningham Book](https://homes.cerias.purdue.edu/~ssw/cun/third/index.html).
This speeds up the creation of large finite fields. ([#452](https://github.com/mhostetter/galois/pull/452))
```ipython
In [1]: import galois
# v0.3.1
In [2]: %time galois.factors(2**256 - 1)
# Took forever...
# v0.3.2
In [2]: %time galois.factors(2**256 - 1)
Wall time: 1 ms
Out[2]:
([3,
5,
17,
257,
641,
65537,
274177,
6700417,
67280421310721,
59649589127497217,
5704689200685129054721],
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1])
```
- Added speed-up when factoring powers of small primes. This speeds up the creation of large finite fields. ([#454](https://github.com/mhostetter/galois/pull/454))
```ipython
In [1]: import galois
# v0.3.1
In [2]: %time galois.factors(2**471)
Wall time: 4.18 s
Out[2]: ([2], [471])
# v0.3.2
In [2]: %time galois.factors(2**471)
Wall time: 2 ms
Out[2]: ([2], [471])
```
- Added four additional Mersenne primes that were discovered between 2013-2018. ([#452](https://github.com/mhostetter/galois/pull/452))

## Contributors

- Matt Hostetter ([@mhostetter](https://github.com/mhostetter))

0 comments on commit 2a006d1

Please sign in to comment.