aboutsummaryrefslogtreecommitdiff
path: root/src
Commit message (Collapse)AuthorAge
* Add a proof of 2 * x - x = xGravatar Jason Gross2016-06-30
|
* Add a classification of n / m < 0Gravatar Jason Gross2016-06-30
|
* Add a tactic for making use of destructed <? in ZGravatar Jason Gross2016-06-30
|
* Prove that a ^ k <> 0Gravatar Jason Gross2016-06-30
|
* Add pow_Zpow to Util.ZUtilGravatar Jason Gross2016-06-30
| | | | I followed the naming scheme of things like div_Zdiv in the stdlib.
* 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
|
* Revert "CompleteEdwardsCurveTheorems: build on 8.4 after field_algebra cahnge"Gravatar Andres Erbsen2016-06-28
| | | | This reverts commit 4ab9da1b82913f1ad798bcdacd8801f619ee2fdf.
* No more anomalies from super_nsatz, hopefullyGravatar Jason Gross2016-06-28
|
* Fix field_algebra in 8.4Gravatar Jason Gross2016-06-28
|
* CompleteEdwardsCurveTheorems: build on 8.4 after field_algebra cahngeGravatar Andres Erbsen2016-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.
* EdDSARefinement: work around rewrite_strat for 8.4Gravatar Andres Erbsen2016-06-28
|
* Tuple: from_list_to_listGravatar Andres Erbsen2016-06-28
|
* 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
|
* eddsa refinement setupGravatar Andres Erbsen2016-06-27
|
* Add [destruct_head] tacticsGravatar Jason Gross2016-06-27
|
* Add [break_match] for hypothesesGravatar Jason Gross2016-06-27
|
* Add decidable instances for sumwise and fieldwiseGravatar Jason Gross2016-06-27
|
* Add a tactic for dealing with equalities of [sum]Gravatar 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
|
* Fix for Coq 8.4Gravatar Jason Gross2016-06-25
|
* EdDSA: prove things about specGravatar Andres Erbsen2016-06-25
|
* 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] >.<
* Remove a useless introGravatar Jason Gross2016-06-24
|
* 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
* nsatz_contradict can now handle invalid _ <> _ hypothesesGravatar Jason Gross2016-06-23
|
* Add Unit.vGravatar Jason Gross2016-06-23
|
* Add equality on sum typesGravatar Jason Gross2016-06-23
|
* Merge pull request #8 from mit-plv/rsloan-pipeline-example-initGravatar Jason Gross2016-06-23
|\ | | | | Make Pipeline.v Build on 8.4
| * Remove examples for 8.4 compatibilityGravatar Robert Sloan2016-06-23
| |
| * Remove vestigal BoundedWord machineryGravatar Robert Sloan2016-06-23
| |
* | Improve some tactics and lemmasGravatar Jason Gross2016-06-23
| |
generated by cgit v1.2.3 (git 2.39.1) at 2024-06-20 03:16:18 +0000