| Commit message (Collapse) | Author | Age |
|
|
|
| |
added another precondition and pushed it through everywhere but one place in ExtendedCoordinates, where I was stuck.
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
ModularBaseSystem [pow], which we need for sqrt and inversion.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
This allows us to rely entirely on typeclass resolution to resolve these
instances, without having to do ad-hoc things for [and].
After | File Name | Before || Change
------------------------------------------------------------------------------------
2m21.71s | Total | 2m22.59s || -0m00.87s
------------------------------------------------------------------------------------
0m28.82s | Specific/GF25519 | 0m29.86s || -0m01.03s
0m29.60s | ModularArithmetic/ModularBaseSystemProofs | 0m29.40s || +0m00.20s
0m21.25s | Experiments/SpecEd25519 | 0m21.28s || -0m00.03s
0m18.15s | CompleteEdwardsCurve/ExtendedCoordinates | 0m18.14s || +0m00.00s
0m11.95s | CompleteEdwardsCurve/CompleteEdwardsCurveTheorems | 0m11.94s || +0m00.00s
0m07.26s | Specific/GF1305 | 0m07.28s || -0m00.02s
0m03.77s | ModularArithmetic/Tutorial | 0m03.75s || +0m00.02s
0m03.76s | ModularArithmetic/ModularBaseSystemOpt | 0m03.75s || +0m00.00s
0m03.61s | CompleteEdwardsCurve/Pre | 0m03.63s || -0m00.02s
0m02.15s | ModularArithmetic/ModularArithmeticTheorems | 0m02.12s || +0m00.02s
0m01.88s | ModularArithmetic/PrimeFieldTheorems | 0m01.89s || -0m00.01s
0m01.75s | Algebra | 0m01.73s || +0m00.02s
0m01.21s | Experiments/DerivationsOptionRectLetInEncoding | 0m01.17s || +0m00.04s
0m01.14s | ModularArithmetic/ExtendedBaseVector | 0m01.14s || +0m00.00s
0m01.01s | ModularArithmetic/PseudoMersenneBaseParamProofs | 0m00.98s || +0m00.03s
0m00.62s | Encoding/ModularWordEncodingTheorems | 0m00.63s || -0m00.01s
0m00.60s | Encoding/ModularWordEncodingPre | 0m00.61s || -0m00.01s
0m00.59s | Util/Decidable | 0m00.64s || -0m00.05s
0m00.58s | Spec/EdDSA | 0m00.61s || -0m00.03s
0m00.57s | ModularArithmetic/ModularBaseSystem | 0m00.61s || -0m00.04s
0m00.56s | Spec/ModularWordEncoding | 0m00.56s || +0m00.00s
0m00.51s | ModularArithmetic/PseudoMersenneBaseRep | 0m00.53s || -0m00.02s
0m00.37s | Spec/CompleteEdwardsCurve | 0m00.34s || +0m00.02s
|
| |
|
|
|
|
|
| |
This prevents notation conflicts (see comment in Notations.v for more
explanation).
|
|
|
|
|
|
|
|
| |
[admit] is the same as [shelve] / [give_up] in Coq 8.5.
Error: Attempt to save a proof with given up goals. If this is really
what you want to do, use
Admitted in place of Qed. (in proof edwards_acurve_abelian_group)
|
|
|
|
| |
Not sure why eauto depth matters...
|
|
|
|
| |
Now you don't have to copy/paste the [match goal with ... end].
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
fewer nonzero ports. remove FField and FNsatz
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
| |
Pair programming with Andres, a better proof of unifiedAddM1'_rep, some
progress on twistedAddAssoc.
|
|
|
|
|
|
|
|
|
|
|
|
| |
The file coqprime/Coqprime/ListAux.v was importing List, which was confusing
machines on which mathclasses was also installed.
Using https://github.com/JasonGross/coq-tools
```bash
make -kj10
cd src
git ls-files "*.v" | xargs python ~/Documents/repos/coq-tools/absolutize-imports.py -i -R . Crypto
```
|
| |
|
| |
|
|
|
|
| |
ExtendedCoordinates, outline Edwards curve associativity
|
|
|
|
| |
CompleteEdwardsCurve, where the precondition is not in scope.
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|