aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAge
* More ZUtil lemmasGravatar Jason Gross2016-07-22
|
* Revert "Revert "Add more ZUtil automation""Gravatar Jason Gross2016-07-22
| | | | | | This reverts commit 5d7b2bc9a4e902d3c3aa7a3625ffda6eb127011f. Now it should work fine
* Merge pull request #37 from JasonGross/fix-intuitionGravatar Jason Gross2016-07-22
|\ | | | | Redesign intuition, speeding up overall compilation by 20%
| * 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
| * Revert "Add more ZUtil automation"Gravatar Jason Gross2016-07-22
|/ | | | | | This reverts commit 29bb3dd531be45ba7960b34ef759b44436e48905. [intuition] is stupid and terrible. Fix upcoming.
* Add more ZUtil automationGravatar Jason Gross2016-07-22
|
* Add ring_simplify_subtermsGravatar Jason Gross2016-07-22
|
* Generalize div_sub_small a bitGravatar Jason Gross2016-07-22
|
* Merge branch 'master' of github.com:mit-plv/fiat-cryptoGravatar jadep2016-07-21
|\
* | Fix 8.4{pl1,pl2} buildsGravatar jadep2016-07-21
| |
| * Add another lemma to zarithGravatar Jason Gross2016-07-21
| |
* | Changed name of [carry_and_reduce_single] to [carry_single], since it does ↵Gravatar jadep2016-07-21
| | | | | | | | not perform reduction
| * Split up proof in BarrettReduction.ZGravatar Jason Gross2016-07-21
| | | | | | | | | | | | In particular, we do equality reasoning in one place and inequality reasoning in another. This makes it very clear how the inequality reasoning follows from the equality reasoning.
| * Add another ZUtil lemmaGravatar Jason Gross2016-07-21
| |
| * Another ZUtil lemmaGravatar Jason Gross2016-07-21
| |
| * Fix broken proofsGravatar Jason Gross2016-07-21
| |
| * Add more ZUtilGravatar Jason Gross2016-07-21
| |
| * More ZUtil helper lemmasGravatar Jason Gross2016-07-21
| |
| * Add more ZUtil lemmasGravatar Jason Gross2016-07-21
| | | | | | | | We really want rewrite mod AC here...
| * Update .mailmapGravatar Jason Gross2016-07-21
| |
| * Add ZUtil lemmasGravatar Jason Gross2016-07-21
|/
* Merge branch 'master' of github.com:mit-plv/fiat-cryptoGravatar jadep2016-07-21
|\
* | Removed lingering print statement.Gravatar jadep2016-07-21
| |
| * Faster update-_CoqProject targetGravatar Jason Gross2016-07-21
| |
| * Fix clean targetGravatar Jason Gross2016-07-21
| | | | | | | | This is the problem with copy-paste solutions. (Thanks @jadephilipoom)
* | Merge branch 'master' of github.com:mit-plv/fiat-cryptoGravatar jadep2016-07-21
|\|
* | Fixes #29Gravatar jadep2016-07-21
| |
* | re-introduced extra field isomorphism layer for 8.4 compatibility and better ↵Gravatar jadep2016-07-21
| | | | | | | | organization of reasoning.
| * ed25519 spec: small cleanupGravatar Andres Erbsen2016-07-21
| |
| * Add support for TIMED=1 in Coq 8.4Gravatar Jason Gross2016-07-20
| | | | | | | | This should fix #34
| * Don't depend on the submodule; copy-paste insteadGravatar Jason Gross2016-07-20
| |
| * Add a separate non-specific targetGravatar Jason Gross2016-07-20
| | | | | | | | | | | | | | | | This should fix #27. We depend on some files in the etc/coq-scripts submodule. Note that you need to either run `make cleanall -k` or `rm -f Makefile.coq` after pulling this to build the development.
| * Merge pull request #33 from JasonGross/dir-localsGravatar Andres Erbsen2016-07-20
| |\ | | | | | | Add target for .dir-locals.el
| * | automate a proofGravatar Andres Erbsen2016-07-20
| | |
| * | compute on [F q]!Gravatar Andres Erbsen2016-07-20
| | |
| * | experiments wd25519: simplify proof for aGravatar Andres Erbsen2016-07-20
| | |
| | * Add target for .dir-locals.elGravatar Jason Gross2016-07-20
| |/ | | | | | | | | | | This fixes #31 Thanks @cpitclaudel!
* | Merge branch 'master' of github.com:mit-plv/fiat-cryptoGravatar jadep2016-07-20
|\|
* | mergeGravatar jadep2016-07-20
|\ \
| | * Move mul_rep_extended (do we actually care about this?)Gravatar Jason Gross2016-07-20
| |/
| * Don't use auto with *Gravatar Jason Gross2016-07-20
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | It's fragile and slow. Now we're 45 seconds faster. After | File Name | Before || Change ------------------------------------------------------------------------------- 1m03.42s | Total | 1m49.00s || -0m45.57s ------------------------------------------------------------------------------- 0m20.01s | ModularArithmetic/ModularBaseSystemProofs | 1m05.69s || -0m45.67s 0m32.14s | Specific/GF25519 | 0m31.92s || +0m00.21s 0m07.05s | Specific/GF1305 | 0m07.07s || -0m00.02s 0m02.84s | ModularArithmetic/ModularBaseSystemOpt | 0m02.90s || -0m00.06s 0m00.69s | Experiments/SpecificCurve25519 | 0m00.69s || +0m00.00s 0m00.69s | ModularArithmetic/ModularBaseSystemInterface | 0m00.73s || -0m00.04s
* | restructured ModularBaseSystem pipeline to put tuple conversion before ↵Gravatar jadep2016-07-20
| | | | | | | | ModularBaseSystem is fully defined, rather than after ModularBaseSystemOpt
| * Absolutize some importsGravatar Jason Gross2016-07-20
| |
| * Silence a deprecation warningGravatar Jason Gross2016-07-20
| |
| * Display pretty timing graph on travisGravatar Jason Gross2016-07-20
| |
| * Remove dependency of ext_base on pseudomersenneGravatar Jason Gross2016-07-20
| |
| * Add Z.lt_le_incl to zarithGravatar Jason Gross2016-07-20
| |
| * Add another lemma about +, <= to arithGravatar Jason Gross2016-07-20
| |
| * Use a proof that doesn't require as many assumptions in extended_base_lengthGravatar Jason Gross2016-07-20
| |
| * Work around bad design in CoqGravatar Jason Gross2016-07-19
| | | | | | | | | | This is https://coq.inria.fr/bugs/show_bug.cgi?id=4949, [intuition] should not use [auto with *] by default