aboutsummaryrefslogtreecommitdiff
path: root/src/Algebra.v
Commit message (Collapse)AuthorAge
* Move most notation level declarations into UtilGravatar Jason Gross2016-07-27
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | This reveals and prevents notation clashes. Notable breakage: - `x {{ y }}` breaks `Context {forall x, {P x} + {~P x}}.` (@jadephilipoom) - `x [[ y ]]` breaks `destruct x as [[a]|[b]].` (@jadephilipoom) - `O :( A , B ): :?: L ::: R` breaks `((1):nat)` and `constr:(nat)` (@varomodt) After | File Name | Before || Change ------------------------------------------------------------------------------------ 3m16.07s | Total | 3m23.63s || -0m07.55s ------------------------------------------------------------------------------------ 0m16.90s | ModularArithmetic/ModularBaseSystemProofs | 0m19.02s || -0m02.12s 0m03.29s | ModularArithmetic/ModularBaseSystemOpt | 0m05.30s || -0m02.00s 0m12.04s | Experiments/SpecEd25519 | 0m13.89s || -0m01.85s 0m36.02s | CompleteEdwardsCurve/ExtendedCoordinates | 0m36.12s || -0m00.09s 0m34.48s | Specific/GF25519 | 0m34.27s || +0m00.20s 0m15.62s | CompleteEdwardsCurve/CompleteEdwardsCurveTheorems | 0m15.76s || -0m00.14s 0m07.36s | Specific/GF1305 | 0m07.34s || +0m00.02s 0m06.64s | Algebra | 0m06.14s || +0m00.50s 0m05.12s | WeierstrassCurve/Pre | 0m05.09s || +0m00.03s 0m04.58s | ModularArithmetic/Tutorial | 0m03.83s || +0m00.75s 0m04.46s | BaseSystemProofs | 0m04.33s || +0m00.12s 0m04.26s | ModularArithmetic/Pow2BaseProofs | 0m05.16s || -0m00.90s 0m03.91s | CompleteEdwardsCurve/Pre | 0m04.62s || -0m00.71s 0m02.75s | Assembly/State | 0m03.12s || -0m00.37s 0m02.55s | Experiments/EdDSARefinement | 0m01.85s || +0m00.69s 0m02.46s | Util/ZUtil | 0m02.45s || +0m00.00s 0m01.86s | Assembly/Wordize | 0m02.02s || -0m00.15s 0m01.68s | ModularArithmetic/ModularArithmeticTheorems | 0m01.68s || +0m00.00s 0m01.67s | ModularArithmetic/PrimeFieldTheorems | 0m01.96s || -0m00.29s 0m01.50s | Encoding/PointEncodingPre | 0m02.20s || -0m00.70s 0m01.46s | ModularArithmetic/BarrettReduction/Z | 0m01.02s || +0m00.43s 0m01.26s | BaseSystem | 0m01.21s || +0m00.05s 0m01.24s | Assembly/Pseudize | 0m01.22s || +0m00.02s 0m01.20s | ModularArithmetic/ExtendedBaseVector | 0m01.86s || -0m00.66s 0m01.04s | Util/IterAssocOp | 0m00.74s || +0m00.30s 0m00.96s | ModularArithmetic/ExtPow2BaseMulProofs | 0m00.67s || +0m00.28s 0m00.96s | Assembly/Pipeline | 0m00.65s || +0m00.30s 0m00.93s | Experiments/DerivationsOptionRectLetInEncoding | 0m00.98s || -0m00.04s 0m00.93s | ModularArithmetic/ModularBaseSystemField | 0m00.95s || -0m00.01s 0m00.92s | Util/NumTheoryUtil | 0m01.19s || -0m00.26s 0m00.90s | ModularArithmetic/ModularBaseSystemListProofs | 0m00.89s || +0m00.01s 0m00.82s | ModularArithmetic/PseudoMersenneBaseParamProofs | 0m00.95s || -0m00.13s 0m00.81s | Assembly/QhasmEvalCommon | 0m00.86s || -0m00.04s 0m00.80s | Assembly/StringConversion | 0m00.60s || +0m00.20s 0m00.79s | Assembly/Qhasm | 0m00.54s || +0m00.25s 0m00.73s | Assembly/Pseudo | 0m00.98s || -0m00.25s 0m00.72s | Util/AdditionChainExponentiation | 0m00.92s || -0m00.20s 0m00.69s | Experiments/SpecificCurve25519 | 0m00.72s || -0m00.03s 0m00.65s | Spec/ModularWordEncoding | 0m00.85s || -0m00.19s 0m00.65s | ModularArithmetic/ModularBaseSystemList | 0m00.68s || -0m00.03s 0m00.65s | Assembly/PseudoConversion | 0m00.67s || -0m00.02s 0m00.64s | Encoding/ModularWordEncodingPre | 0m00.62s || +0m00.02s 0m00.64s | Spec/EdDSA | 0m00.93s || -0m00.29s 0m00.64s | Testbit | 0m00.94s || -0m00.29s 0m00.63s | Encoding/ModularWordEncodingTheorems | 0m00.66s || -0m00.03s 0m00.62s | Assembly/AlmostQhasm | 0m00.49s || +0m00.13s 0m00.59s | ModularArithmetic/ModularBaseSystem | 0m00.61s || -0m00.02s 0m00.49s | Spec/WeierstrassCurve | 0m00.43s || +0m00.06s 0m00.49s | Assembly/QhasmUtil | 0m00.51s || -0m00.02s 0m00.49s | ModularArithmetic/Pre | 0m00.47s || +0m00.02s 0m00.47s | Assembly/Vectorize | 0m00.51s || -0m00.04s 0m00.46s | Assembly/AlmostConversion | 0m00.44s || +0m00.02s 0m00.42s | ModularArithmetic/Pow2Base | 0m00.42s || +0m00.00s 0m00.41s | ModularArithmetic/PseudoMersenneBaseParams | 0m00.45s || -0m00.04s 0m00.41s | Spec/ModularArithmetic | 0m00.41s || +0m00.00s 0m00.39s | Spec/CompleteEdwardsCurve | 0m00.41s || -0m00.01s 0m00.03s | Util/Notations | 0m00.03s || +0m00.00s
* Add databases for ring_simplifyGravatar Jason Gross2016-07-22
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | After | File Name | Before || Change ------------------------------------------------------------------------------------ 2m39.49s | Total | 2m36.24s || +0m03.25s ------------------------------------------------------------------------------------ 0m48.49s | Specific/GF25519 | 0m48.53s || -0m00.03s 0m34.52s | CompleteEdwardsCurve/ExtendedCoordinates | 0m34.24s || +0m00.28s 0m15.71s | CompleteEdwardsCurve/CompleteEdwardsCurveTheorems | 0m15.24s || +0m00.47s 0m11.41s | Experiments/SpecEd25519 | 0m11.34s || +0m00.07s 0m08.23s | Specific/GF1305 | 0m08.30s || -0m00.07s 0m05.64s | Algebra | 0m05.55s || +0m00.08s 0m05.03s | WeierstrassCurve/Pre | 0m04.51s || +0m00.52s 0m04.23s | ModularArithmetic/Tutorial | 0m03.63s || +0m00.60s 0m03.33s | CompleteEdwardsCurve/Pre | 0m03.34s || -0m00.00s 0m02.87s | ModularArithmetic/ModularBaseSystemOpt | 0m02.80s || +0m00.07s 0m01.80s | Experiments/EdDSARefinement | 0m01.77s || +0m00.03s 0m01.54s | ModularArithmetic/PrimeFieldTheorems | 0m01.55s || -0m00.01s 0m01.52s | Encoding/PointEncodingPre | 0m01.54s || -0m00.02s 0m01.51s | ModularArithmetic/ModularArithmeticTheorems | 0m01.51s || +0m00.00s 0m01.19s | ModularArithmetic/ExtendedBaseVector | 0m01.18s || +0m00.01s 0m01.16s | ModularArithmetic/ModularBaseSystemListProofs | 0m00.80s || +0m00.35s 0m01.03s | ModularArithmetic/ModularBaseSystemProofs | 0m00.96s || +0m00.07s 0m00.95s | Experiments/SpecificCurve25519 | 0m00.95s || +0m00.00s 0m00.92s | Experiments/DerivationsOptionRectLetInEncoding | 0m00.85s || +0m00.07s 0m00.91s | ModularArithmetic/ModularBaseSystemField | 0m00.86s || +0m00.05s 0m00.76s | Encoding/ModularWordEncodingPre | 0m00.60s || +0m00.16s 0m00.69s | Util/IterAssocOp | 0m00.67s || +0m00.01s 0m00.69s | ModularArithmetic/ModularBaseSystemList | 0m00.57s || +0m00.12s 0m00.68s | ModularArithmetic/ExtPow2BaseMulProofs | 0m00.63s || +0m00.05s 0m00.68s | Spec/EdDSA | 0m00.61s || +0m00.07s 0m00.67s | Encoding/ModularWordEncodingTheorems | 0m00.64s || +0m00.03s 0m00.66s | Spec/ModularWordEncoding | 0m00.56s || +0m00.09s 0m00.62s | Util/AdditionChainExponentiation | 0m00.59s || +0m00.03s 0m00.58s | ModularArithmetic/ModularBaseSystem | 0m00.57s || +0m00.01s 0m00.55s | ModularArithmetic/PseudoMersenneBaseParamProofs | 0m00.54s || +0m00.01s 0m00.51s | Spec/WeierstrassCurve | 0m00.43s || +0m00.08s 0m00.41s | Spec/CompleteEdwardsCurve | 0m00.38s || +0m00.02s
* Add reverse_nondep and ring_simplify_subterms_in_all tacticsGravatar Jason Gross2016-07-22
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | After | File Name | Before || Change ------------------------------------------------------------------------------------ 2m50.48s | Total | 3m00.71s || -0m10.23s ------------------------------------------------------------------------------------ 0m15.26s | CompleteEdwardsCurve/CompleteEdwardsCurveTheorems | 0m18.84s || -0m03.58s 0m48.47s | Specific/GF25519 | 0m51.03s || -0m02.56s 0m35.42s | CompleteEdwardsCurve/ExtendedCoordinates | 0m34.27s || +0m01.14s 0m09.92s | Specific/GF1305 | 0m08.66s || +0m01.25s 0m05.73s | Experiments/GenericFieldPow | 0m07.03s || -0m01.29s 0m03.67s | ModularArithmetic/Pow2BaseProofs | 0m04.78s || -0m01.11s 0m11.26s | Experiments/SpecEd25519 | 0m11.21s || +0m00.04s 0m05.81s | Algebra | 0m06.09s || -0m00.28s 0m04.54s | WeierstrassCurve/Pre | 0m05.08s || -0m00.54s 0m03.62s | ModularArithmetic/Tutorial | 0m04.38s || -0m00.75s 0m03.34s | CompleteEdwardsCurve/Pre | 0m03.56s || -0m00.22s 0m02.83s | ModularArithmetic/ModularBaseSystemOpt | 0m03.37s || -0m00.54s 0m01.76s | Experiments/EdDSARefinement | 0m01.81s || -0m00.05s 0m01.54s | ModularArithmetic/PrimeFieldTheorems | 0m01.67s || -0m00.12s 0m01.52s | ModularArithmetic/ModularArithmeticTheorems | 0m01.62s || -0m00.10s 0m01.47s | Encoding/PointEncodingPre | 0m01.63s || -0m00.15s 0m01.21s | ModularArithmetic/ExtendedBaseVector | 0m01.33s || -0m00.12s 0m00.99s | Experiments/SpecificCurve25519 | 0m00.95s || +0m00.04s 0m00.98s | ModularArithmetic/ModularBaseSystemProofs | 0m01.08s || -0m00.10s 0m00.90s | ModularArithmetic/BarrettReduction/Z | 0m00.96s || -0m00.05s 0m00.87s | Experiments/DerivationsOptionRectLetInEncoding | 0m00.88s || -0m00.01s 0m00.86s | ModularArithmetic/ModularBaseSystemField | 0m00.99s || -0m00.13s 0m00.81s | ModularArithmetic/ModularBaseSystemListProofs | 0m00.94s || -0m00.12s 0m00.71s | ModularArithmetic/ExtPow2BaseMulProofs | 0m00.69s || +0m00.02s 0m00.67s | Util/IterAssocOp | 0m00.74s || -0m00.06s 0m00.65s | Encoding/ModularWordEncodingTheorems | 0m00.68s || -0m00.03s 0m00.64s | Testbit | 0m00.63s || +0m00.01s 0m00.61s | Util/AdditionChainExponentiation | 0m00.68s || -0m00.07s 0m00.61s | ModularArithmetic/ModularBaseSystem | 0m00.72s || -0m00.10s 0m00.61s | Encoding/ModularWordEncodingPre | 0m00.82s || -0m00.20s 0m00.60s | Spec/EdDSA | 0m00.60s || +0m00.00s 0m00.59s | ModularArithmetic/ModularBaseSystemList | 0m00.87s || -0m00.28s 0m00.57s | Spec/ModularWordEncoding | 0m00.62s || -0m00.05s 0m00.57s | ModularArithmetic/PseudoMersenneBaseParamProofs | 0m00.61s || -0m00.04s 0m00.43s | Spec/WeierstrassCurve | 0m00.43s || +0m00.00s 0m00.40s | Spec/CompleteEdwardsCurve | 0m00.44s || -0m00.03s 0m00.04s | Util/Tactics | 0m00.03s || +0m00.01s
* Make the library 20% faster: [auto with *] is evilGravatar Jason Gross2016-07-22
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | I do hereby revoke the privilege of [intuition] to grab random hints from random databases. This privilege is reserved for [debug_intuition], which comes with a warning about not being used in production code. This tactic is useful in conjunction with `Print Hint *`, to discover what hint databases the hints were grabbed from. (Suggestions for renaming [debug_intuition] welcome.) Any file using [intuition] must [Require Export Crypto.Util.FixCoqMistakes.]. It's possible we could lift this restriction by compiling [FixCoqMistakes] separately, and passing along `-require FixCoqMistakes` to Coq. Should we do this? After | File Name | Before || Change ------------------------------------------------------------------------------------ 3m29.54s | Total | 4m33.13s || -1m03.59s ------------------------------------------------------------------------------------ 0m03.75s | BaseSystemProofs | 0m43.84s || -0m40.09s 0m42.57s | CompleteEdwardsCurve/ExtendedCoordinates | 0m34.48s || +0m08.09s 0m03.04s | Util/ListUtil | 0m11.18s || -0m08.14s 0m01.62s | ModularArithmetic/PrimeFieldTheorems | 0m09.53s || -0m07.90s 0m00.87s | Util/NumTheoryUtil | 0m07.61s || -0m06.74s 0m01.61s | Encoding/PointEncodingPre | 0m06.93s || -0m05.31s 0m51.95s | Specific/GF25519 | 0m47.52s || +0m04.42s 0m12.30s | Experiments/SpecEd25519 | 0m11.29s || +0m01.01s 0m09.22s | Specific/GF1305 | 0m08.17s || +0m01.05s 0m03.48s | CompleteEdwardsCurve/Pre | 0m04.77s || -0m01.28s 0m02.70s | Assembly/State | 0m04.09s || -0m01.38s 0m01.55s | ModularArithmetic/ModularArithmeticTheorems | 0m02.93s || -0m01.38s 0m01.16s | Assembly/Pseudize | 0m02.34s || -0m01.17s 0m15.67s | CompleteEdwardsCurve/CompleteEdwardsCurveTheorems | 0m16.37s || -0m00.70s 0m06.02s | Algebra | 0m06.67s || -0m00.65s 0m05.90s | Experiments/GenericFieldPow | 0m06.68s || -0m00.77s 0m04.65s | WeierstrassCurve/Pre | 0m05.27s || -0m00.61s 0m03.93s | ModularArithmetic/Pow2BaseProofs | 0m03.94s || -0m00.00s 0m03.70s | ModularArithmetic/Tutorial | 0m03.85s || -0m00.14s 0m02.83s | ModularArithmetic/ModularBaseSystemOpt | 0m02.84s || -0m00.00s 0m02.74s | Experiments/EdDSARefinement | 0m01.80s || +0m00.94s 0m02.35s | Util/ZUtil | 0m02.51s || -0m00.15s 0m01.86s | Assembly/Wordize | 0m02.32s || -0m00.45s 0m01.23s | ModularArithmetic/ExtendedBaseVector | 0m01.20s || +0m00.03s 0m01.21s | BaseSystem | 0m01.63s || -0m00.41s 0m01.03s | Experiments/SpecificCurve25519 | 0m00.98s || +0m00.05s 0m01.01s | ModularArithmetic/ModularBaseSystemProofs | 0m01.11s || -0m00.10s 0m00.95s | ModularArithmetic/BarrettReduction/Z | 0m01.38s || -0m00.42s 0m00.92s | Experiments/DerivationsOptionRectLetInEncoding | 0m01.81s || -0m00.89s 0m00.85s | ModularArithmetic/ModularBaseSystemField | 0m00.86s || -0m00.01s 0m00.82s | ModularArithmetic/ModularBaseSystemListProofs | 0m00.79s || +0m00.02s 0m00.80s | Assembly/QhasmEvalCommon | 0m00.93s || -0m00.13s 0m00.73s | Spec/EdDSA | 0m00.59s || +0m00.14s 0m00.72s | Util/Tuple | 0m00.71s || +0m00.01s 0m00.70s | Util/IterAssocOp | 0m00.72s || -0m00.02s 0m00.67s | Encoding/ModularWordEncodingTheorems | 0m00.71s || -0m00.03s 0m00.66s | Assembly/Pipeline | 0m00.64s || +0m00.02s 0m00.65s | Testbit | 0m00.65s || +0m00.00s 0m00.65s | Assembly/PseudoConversion | 0m00.65s || +0m00.00s 0m00.64s | Util/AdditionChainExponentiation | 0m00.63s || +0m00.01s 0m00.63s | ModularArithmetic/ExtPow2BaseMulProofs | 0m00.64s || -0m00.01s 0m00.63s | Assembly/Pseudo | 0m00.65s || -0m00.02s 0m00.62s | ModularArithmetic/ModularBaseSystem | 0m00.57s || +0m00.05s 0m00.61s | ModularArithmetic/ModularBaseSystemList | 0m00.57s || +0m00.04s 0m00.60s | Encoding/ModularWordEncodingPre | 0m00.69s || -0m00.08s 0m00.60s | ModularArithmetic/PseudoMersenneBaseParamProofs | 0m00.59s || +0m00.01s 0m00.56s | Assembly/StringConversion | 0m00.56s || +0m00.00s 0m00.54s | Spec/ModularWordEncoding | 0m00.61s || -0m00.06s 0m00.54s | Assembly/QhasmUtil | 0m00.46s || +0m00.08s 0m00.52s | Assembly/Qhasm | 0m00.53s || -0m00.01s 0m00.48s | Assembly/AlmostQhasm | 0m00.52s || -0m00.04s 0m00.48s | ModularArithmetic/Pre | 0m00.48s || +0m00.00s 0m00.46s | Assembly/Vectorize | 0m00.72s || -0m00.25s 0m00.45s | Spec/WeierstrassCurve | 0m00.44s || +0m00.01s 0m00.44s | Assembly/AlmostConversion | 0m00.44s || +0m00.00s 0m00.43s | ModularArithmetic/Pow2Base | 0m00.51s || -0m00.08s 0m00.42s | ModularArithmetic/PseudoMersenneBaseParams | 0m00.38s || +0m00.03s 0m00.41s | Spec/CompleteEdwardsCurve | 0m00.43s || -0m00.02s 0m00.34s | Spec/ModularArithmetic | 0m00.36s || -0m00.01s 0m00.03s | Util/FixCoqMistakes | N/A || +0m00.03s 0m00.02s | Util/Notations | 0m00.04s || -0m00.02s 0m00.02s | Util/Tactics | 0m00.02s || +0m00.00s
* Add ring_simplify_subtermsGravatar Jason Gross2016-07-22
|
* proved an admit in field homomorphisms that turned out to be unprovable; I ↵Gravatar jadep2016-07-15
| | | | added another precondition and pushed it through everywhere but one place in ExtendedCoordinates, where I was stuck.
* cleaned Specific operations so they produce code without proof terms, and ↵Gravatar jadep2016-07-12
| | | | proved that GF1305 is a field
* prove that if something is isomorphic to a field, it is a fieldGravatar jadep2016-07-11
|
* s/conservative_common_denominator/common_denominator/gGravatar Andres Erbsen2016-07-11
|
* rename [common_denominator] to [field_simplify_if_div]Gravatar Andres Erbsen2016-07-11
|
* remove field_algebraGravatar Andres Erbsen2016-07-11
|
* wrap nsatz in AlgebraGravatar Andres Erbsen2016-07-11
|
* added proofs about addition chain exponentiation for later use in ↵Gravatar jadep2016-07-10
| | | | ModularBaseSystem [pow], which we need for sqrt and inversion.
* super_nsatz: Handle x^2 = y^2 -> x <> -y -> x = yGravatar Jason Gross2016-07-02
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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
* Simplify conservative_common_denominatorGravatar Jason Gross2016-06-29
| | | | | | | | | | | We no longer try to predict field_simplify_eq. This results in better behavior and less code which is more modular. In particular, the tactic responsible for hiding non-fraction pieces from field_simplify_eq no longer tries to preemptively assert that denominators are nonzero. This improvement is a result of @andres-erbsen's point in #16, https://github.com/mit-plv/fiat-crypto/pull/16#discussion_r69035102 , that we were generating too many side-conditions.
* Don't generate goals [False] in conservative_common_denominator_allGravatar Jason Gross2016-06-29
| | | | See also #16, https://github.com/mit-plv/fiat-crypto/pull/16/files/f1744181ad236300cfa9ba7c033684fbdf45a3e9..4e50ef26b9b02c882536281e1c7a0cf013a963d5#r69034941
* Fix [only_two_square_roots] to not loopGravatar Jason Gross2016-06-29
| | | | | It was previously posing hypotheses that were algebraic duplicates of existing hypotheses, and then clearing them.
* Allow side-conditions in common denom. all in hypsGravatar Jason Gross2016-06-29
| | | | | This should handle #16 / https://github.com/mit-plv/fiat-crypto/pull/16#discussion_r69009840
* Handle fractions in denominatorsGravatar Jason Gross2016-06-29
| | | | | This should deal with #16 / https://github.com/mit-plv/fiat-crypto/pull/16#discussion_r69009776
* Clear symmetric duplicates in clear_algebraic_duplicatesGravatar Jason Gross2016-06-29
|
* Fix a typo in the previous commitGravatar Jason Gross2016-06-28
|
* [super_nstaz]: Handle side-conditions from [nsatz]Gravatar Jason Gross2016-06-28
|
* No more anomalies from super_nsatz, hopefullyGravatar Jason Gross2016-06-28
|
* Fix a typo (missing .)Gravatar Jason Gross2016-06-28
|
* Fix super_nsatz tactic to be better about orderingGravatar Jason Gross2016-06-28
| | | | See also #13.
* Try a faster way of solving some inequalities resulting from common_denominatorGravatar Jason Gross2016-06-27
|
* Actual fix for super_nsatzGravatar Jason Gross2016-06-27
|
* Fix super_nstaz to not errorGravatar Jason Gross2016-06-27
|
* Add a super_nsatz tacticGravatar Jason Gross2016-06-27
|
* Fix notation levelGravatar Jason Gross2016-06-27
|
* Add global notation for eq_decGravatar Jason Gross2016-06-27
|
* scalarmult support; EdDSA.sign produces valid signaturesGravatar Andres Erbsen2016-06-27
|
* first pass of scalarmultGravatar Andres Erbsen2016-06-27
|
* Add a tactic to handle "at most two square roots"Gravatar Jason Gross2016-06-27
|
* Various nsatz and field tactic improvementsGravatar Jason Gross2016-06-24
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | After | File Name | Before || Change ------------------------------------------------------------------------------------ 2m29.81s | Total | 2m34.05s || -0m04.23s ------------------------------------------------------------------------------------ 0m11.98s | CompleteEdwardsCurve/CompleteEdwardsCurveTheorems | 0m15.22s || -0m03.24s 0m29.71s | ModularArithmetic/ModularBaseSystemProofs | 0m30.05s || -0m00.33s 0m29.12s | Specific/GF25519 | 0m29.12s || +0m00.00s 0m21.50s | Experiments/SpecEd25519 | 0m21.43s || +0m00.07s 0m18.20s | CompleteEdwardsCurve/ExtendedCoordinates | 0m18.24s || -0m00.03s 0m07.36s | Specific/GF1305 | 0m07.33s || +0m00.03s 0m06.66s | Experiments/GenericFieldPow | 0m06.89s || -0m00.22s 0m03.84s | ModularArithmetic/ModularBaseSystemOpt | 0m03.84s || +0m00.00s 0m03.82s | ModularArithmetic/Tutorial | 0m03.88s || -0m00.06s 0m03.74s | CompleteEdwardsCurve/Pre | 0m03.81s || -0m00.06s 0m02.30s | ModularArithmetic/ModularArithmeticTheorems | 0m02.27s || +0m00.02s 0m02.11s | ModularArithmetic/PrimeFieldTheorems | 0m02.05s || +0m00.06s 0m01.93s | Algebra | 0m02.06s || -0m00.13s 0m01.17s | Experiments/DerivationsOptionRectLetInEncoding | 0m01.19s || -0m00.02s 0m01.13s | ModularArithmetic/ExtendedBaseVector | 0m01.18s || -0m00.05s 0m01.01s | ModularArithmetic/PseudoMersenneBaseParamProofs | 0m01.07s || -0m00.06s 0m00.61s | Encoding/ModularWordEncodingTheorems | 0m00.64s || -0m00.03s 0m00.61s | Spec/EdDSA | 0m00.62s || -0m00.01s 0m00.57s | Encoding/ModularWordEncodingPre | 0m00.62s || -0m00.05s 0m00.56s | Spec/ModularWordEncoding | 0m00.59s || -0m00.02s 0m00.55s | ModularArithmetic/ModularBaseSystem | 0m00.59s || -0m00.03s 0m00.52s | ModularArithmetic/PseudoMersenneBaseRep | 0m00.52s || +0m00.00s 0m00.41s | Tactics/Nsatz | 0m00.41s || +0m00.00s 0m00.38s | Spec/CompleteEdwardsCurve | 0m00.40s || -0m00.02s 0m00.03s | Util/Tactics | 0m00.03s || +0m00.00s
* Add a version of common_denominator w/o oversimplGravatar Jason Gross2016-06-24
| | | | | | | It first [set]s anything not containing a division. Unfortunately, it's not a good drop-in replacement, because some code relies on exactly how [field_simplify] calls [field_simplify_eq] >.<
* ExtendedCoordinates: group.Gravatar Andres Erbsen2016-06-24
|
* isomorphism_to_subgroup_groupGravatar Andres Erbsen2016-06-24
|
* Use Decidable machinery for is_eq_decGravatar Jason Gross2016-06-24
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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
* Improve some tactics and lemmasGravatar Jason Gross2016-06-23
|
* Add tactics to Tactics, at most 2 sq-roots to AlgebraGravatar Jason Gross2016-06-23
|
* surjective homomorphism from group makes a groupGravatar Andres Erbsen2016-06-23
|
* Make [nsatz_contradict] better at inequalitiesGravatar Jason Gross2016-06-23
|
* [field_algebra] now knows that 0 <> -0 is falseGravatar Jason Gross2016-06-23
|
* Add tactics for canonicalizing field (in)equalitiesGravatar Jason Gross2016-06-23
|
* Rename the nonzero lemma to an iff lemmaGravatar Jason Gross2016-06-23
|
* Add mul_nonzero_nonzero_and to Algebra.vGravatar Jason Gross2016-06-23
|
* Algebra: change a aliasing definition into an aliasing lemma to appease ↵Gravatar Andres Erbsen2016-06-20
| | | | implicit argument resolution
* More missing scopes for 8.5?Gravatar Jason Gross2016-06-20
|
* Fix for Coq 8.4pl2Gravatar Jason Gross2016-06-20
|
generated by cgit v1.2.3 (git 2.39.1) at 2024-05-20 16:53:09 +0000