| Commit message (Collapse) | Author | Age |
| |
|
| |
|
|
|
|
|
| |
[rewrite_strat] ignores [using tac] sometimes, and [Hint Rewrite] only
accepts one database in 8.4.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|\ |
|
| | |
|
| |
| |
| |
| | |
Define [set_nth] in terms of [update_nth]
|
| | |
|
| |
| |
| |
| | |
Compatibility with theories/Numbers/NatInt/NZBits.v
|
| |
| |
| |
| | |
For jadep, or for me, after the 8.5 build is fixed.
|
| | |
|
| | |
|
| | |
|
|/ |
|
| |
|
|\ |
|
|\ \ |
|
| | |
| | |
| | |
| | | |
defined conversion between two such bases. This will allow conversion between the pseudomersenne base representation and the wire format. Also relocated some lemmas to Util.
|
| | |
| | |
| | |
| | |
| | | |
Define the spec of Weierstrass curves
This is the start of work on P256.
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Implement and prove Barrett reduction on Z
This will serve as the high-level algorithm for modular reduction.
We follow Wikipedia very closely, except where we can do better (I
believe @jadephilipoom is updating Wikipedia).
|
| | |\
| | | |
| | | | |
Rename lemmas about Z in ZUtil
|
| | |\ \
| | | | |
| | | | | |
update licensing information for #5
|
| | | | | |
|
| | | |/
| | |/|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
The standard library uses Z.*, and Z* and Z_* are compatibility
notations. We follow suit.
Also, eliminate a few lemmas that are duplicates of ones in the standard
library.
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
After | File Name | Before || Change
------------------------------------------------------------------------------------
2m38.35s | Total | 2m36.78s || +0m01.57s
------------------------------------------------------------------------------------
0m27.68s | Specific/GF25519 | 0m27.26s || +0m00.41s
0m25.00s | CompleteEdwardsCurve/ExtendedCoordinates | 0m24.87s || +0m00.12s
0m24.96s | ModularArithmetic/ModularBaseSystemProofs | 0m24.84s || +0m00.12s
0m21.55s | Experiments/SpecEd25519 | 0m21.39s || +0m00.16s
0m19.82s | CompleteEdwardsCurve/CompleteEdwardsCurveTheorems | 0m19.65s || +0m00.17s
0m08.29s | ModularArithmetic/PrimeFieldTheorems | 0m08.30s || -0m00.01s
0m07.13s | Specific/GF1305 | 0m06.69s || +0m00.43s
0m03.75s | ModularArithmetic/Tutorial | 0m03.77s || -0m00.02s
0m03.69s | ModularArithmetic/ModularBaseSystemOpt | 0m03.71s || -0m00.02s
0m03.64s | CompleteEdwardsCurve/Pre | 0m03.67s || -0m00.02s
0m02.11s | Algebra | 0m01.96s || +0m00.14s
0m01.81s | Experiments/DerivationsOptionRectLetInEncoding | 0m01.83s || -0m00.02s
0m01.73s | Experiments/EdDSARefinement | 0m01.71s || +0m00.02s
0m01.67s | ModularArithmetic/ModularArithmeticTheorems | 0m01.65s || +0m00.02s
0m00.91s | ModularArithmetic/ExtendedBaseVector | 0m00.92s || -0m00.01s
0m00.80s | ModularArithmetic/PseudoMersenneBaseParamProofs | 0m00.85s || -0m00.04s
0m00.60s | Encoding/ModularWordEncodingPre | 0m00.59s || +0m00.01s
0m00.59s | Encoding/ModularWordEncodingTheorems | 0m00.61s || -0m00.02s
0m00.58s | ModularArithmetic/ModularBaseSystem | 0m00.52s || +0m00.05s
0m00.57s | Spec/ModularWordEncoding | 0m00.53s || +0m00.03s
0m00.56s | Spec/EdDSA | 0m00.56s || +0m00.00s
0m00.56s | ModularArithmetic/PseudoMersenneBaseRep | 0m00.54s || +0m00.02s
0m00.36s | Spec/CompleteEdwardsCurve | 0m00.36s || +0m00.00s
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | |
| | | |
| | | |
| | | | |
[intuition] is overpowered and does [auto with *] or something
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|