Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/thery/mathcomp-extra
Extra contribution for mathcomp
https://github.com/thery/mathcomp-extra
aks-algorithm binomial coq fourier-transform lucas-theorem matroid primality-test rsa-algorithm sorting-algorithms theorem-proving
Last synced: 3 months ago
JSON representation
Extra contribution for mathcomp
- Host: GitHub
- URL: https://github.com/thery/mathcomp-extra
- Owner: thery
- License: mit
- Created: 2019-07-18T11:59:59.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2024-07-04T17:09:42.000Z (6 months ago)
- Last Synced: 2024-10-11T21:51:26.969Z (3 months ago)
- Topics: aks-algorithm, binomial, coq, fourier-transform, lucas-theorem, matroid, primality-test, rsa-algorithm, sorting-algorithms, theorem-proving
- Language: Coq
- Homepage:
- Size: 411 KB
- Stars: 5
- Watchers: 3
- Forks: 2
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
- awesome-coq - MathComp Extra - Extra material for the Mathematical Components library, including the AKS primality test and RSA encryption and decryption. (Projects / Libraries)
README
# mathcomp-extra
[![Docker CI][docker-action-shield]][docker-action-link]
[docker-action-shield]: https://github.com/thery/mathcomp-extra/actions/workflows/docker-action.yml/badge.svg?branch=master
[docker-action-link]: https://github.com/thery/mathcomp-extra/actions/workflows/docker-action.yml
Some extra material for mathcomp
[Fibonacci and Lucas numbers](./fib.v)
[Lower bound of lcm(1, 2, ..., n)](./lcm_lbound.v)
[Definitions and some properties of matroids](./matroid.v)
[Rsa algorithm](./rsa.v)
[More lemmas about polynomials](./more_thm.v)
[Polynomials modulo](./divpoly.v)
[Binary gcd](./bgcdn.v)
[Nth root for natural number](./rootn.v)
[The aks algorithm](./aks_algo.v) the algorithm as in Hing Lun Chan's PhD thesis
[The aks correctness proof](./aks.v) a transcription of Hing Lun Chan's proof
[The proof of Lucas theorem for binomial](./digitn.v)
[A formalisation of 2-player games](./tplayer.v) (in progress)
[A formalisation of Fast Fourier Transform](./fft.v)
[More theorems about tuples](./more_tuple.v)
[A formalisation of sorting network](./nsort.v)
[A formalisation of bitonic sort](./bitonic.v)
[A formalisation of Batcher odd or even sort](./batcher.v)
[A formalisation of Knuth exchange sort](./bjsort.v)
[A fun puzzle about a tricky integer function](./puzzleFF.v)
[A port to mathcomp of the elliptic curve of CoqPrime](./elliptic.v)
[A formalisation of some sudoku solvers ](./sudoku.v)
[A formalisation of Montgomery reduction ](./montgomery.v)
[A formalisation of Residue Number System](./rns.v)
[Euler Criterion](./euler.v)
A note about sorting network is available [here](https://hal.inria.fr/hal-03585618).
## Meta
- Author(s):
- Laurent Théry
- License: [MIT License](LICENSE)
- Compatible Coq versions: 8.18 or later
- Additional dependencies:
- [ Hierarchy Builder 1.7.0 or later](https://github.com/math-comp/hierarchy-builder)
- [MathComp ssreflect 2.2.0 or later](https://math-comp.github.io)
- [MathComp fingroup 2.2.0 or later](https://math-comp.github.io)
- [MathComp algebra 2.2.0 or later](https://math-comp.github.io)
- [MathComp field 2.2.0 or later](https://math-comp.github.io)
- [MathComp zify 1.5.0+2.0+8.16 or later](https://github.com/math-comp/mczify)
- [MathComp Algebra Tactics 1.2.3 or later](https://github.com/math-comp/algebra-tactics)
- Coq namespace: `mathcomp-extra`
- Related publication(s): none
## Building and installation instructions
To build and install manually, do:
``` shell
git clone https://github.com/thery/mathcomp-extra.git
cd mathcomp-extra
make # or make -j
make install
```