aboutsummaryrefslogtreecommitdiff
path: root/_CoqProject
Commit message (Collapse)AuthorAge
* Split up GF25519Reflective.Common: faster+parallelGravatar Jason Gross2016-11-09
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | After | File Name | Before || Change -------------------------------------------------------------------------------- 2m53.12s | Total | 2m52.26s || +0m00.85s -------------------------------------------------------------------------------- 0m01.38s | Specific/GF25519Reflective/Common | 0m43.51s || -0m42.12s 0m14.82s | Specific/GF25519Reflective/CommonBinOp | N/A || +0m14.82s 0m10.91s | Specific/GF25519Reflective/CommonUnOp | N/A || +0m10.91s 0m10.44s | Specific/GF25519Reflective/CommonUnOpWireToFE | N/A || +0m10.43s 0m06.42s | Specific/GF25519Reflective/CommonUnOpFEToWire | N/A || +0m06.41s 1m18.24s | Experiments/Ed25519 | 1m18.57s || -0m00.32s 0m07.97s | Specific/GF25519Reflective/Reified/Mul | 0m08.45s || -0m00.47s 0m07.89s | Specific/GF25519Reflective/Reified/Freeze | 0m07.84s || +0m00.04s 0m06.87s | Specific/GF25519Reflective | 0m06.92s || -0m00.04s 0m03.53s | Specific/GF25519Reflective/Reified/CarrySub | 0m03.63s || -0m00.10s 0m03.27s | Specific/GF25519Reflective/Reified/CarryAdd | 0m03.28s || -0m00.00s 0m03.18s | Specific/GF25519Reflective/Reified/CarryOpp | 0m03.15s || +0m00.03s 0m02.24s | Specific/GF25519Reflective/Reified/Unpack | 0m02.21s || +0m00.03s 0m02.19s | Specific/GF25519Reflective/Reified/Pack | 0m02.28s || -0m00.08s 0m02.16s | Specific/GF25519Reflective/Reified/Sub | 0m02.15s || +0m00.01s 0m02.14s | Specific/GF25519Bounded | 0m02.07s || +0m00.07s 0m02.07s | Experiments/Ed25519Extraction | 0m02.16s || -0m00.09s 0m01.99s | Specific/GF25519Reflective/Reified/Add | 0m01.81s || +0m00.17s 0m01.82s | Specific/GF25519Reflective/Reified/Opp | 0m01.78s || +0m00.04s 0m01.76s | Specific/GF25519Reflective/Reified/GeModulus | 0m01.71s || +0m00.05s 0m00.97s | Specific/GF25519Reflective/CommonUnOpFEToZ | N/A || +0m00.97s 0m00.86s | Specific/GF25519Reflective/Reified | 0m00.75s || +0m00.10s
* Factor related_Z_op (except conditional_sub)Gravatar Jason Gross2016-11-08
|
* Add IffT, some Proper prod lemmasGravatar Jason Gross2016-11-07
|
* implement X25519Gravatar Andres Erbsen2016-11-06
|
* Split off some things from InterpretationsGravatar Jason Gross2016-11-05
|
* separate Ed25519Extraction.v, add extraction to MakefileGravatar Andres Erbsen2016-11-03
| | | | | @JasonGross: src/Specific/GF25519Bounded.v has another constant that I think needs a extraction-friendly version, I added a comment
* Move hlist to new fileGravatar Jason Gross2016-11-01
|
* Add Reflection.ApplicationGravatar Jason Gross2016-10-31
|
* Switch to reflective bounded word in Ed25519Gravatar Jason Gross2016-10-31
| | | | (cc @andres-erbsen)
* Add src/Specific/GF25519Reflective.vGravatar Jason Gross2016-10-31
|
* Switch to a faster way of proving wfGravatar Jason Gross2016-10-30
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | By keeping more data in the reified side-condition, we can reflectively replace all side conditions of the form [x = y] with [x = x], and check via vm_cast that this does not change the side condition. This is empirically a cheap check, and since we can prove that all propositions become true under this sort of replacement, we get most of our proof for free. After | File Name | Before || Change ----------------------------------------------------------------------------------------------------------- 12m15.26s | Total | 12m34.17s || -0m18.90s ----------------------------------------------------------------------------------------------------------- 0m06.92s | Specific/GF25519Reflective/Reified/Mul | 0m14.58s || -0m07.66s 0m05.99s | Specific/GF25519Reflective/Reified/Freeze | 0m10.74s || -0m04.75s N/A | Reflection/WfRelReflective | 0m04.05s || -0m04.04s 0m02.00s | Reflection/WfReflective | 0m04.05s || -0m02.04s 1m17.14s | CompleteEdwardsCurve/ExtendedCoordinates | 1m16.12s || +0m01.01s 1m32.08s | Test/Curve25519SpecTestVectors | 1m32.06s || +0m00.01s 0m40.68s | ModularArithmetic/Conversion | 0m40.54s || +0m00.14s 0m34.50s | Spec/Ed25519 | 0m34.74s || -0m00.24s 0m30.28s | ModularArithmetic/ModularBaseSystemProofs | 0m30.33s || -0m00.04s 0m29.06s | Experiments/Ed25519 | 0m29.43s || -0m00.37s 0m23.05s | Experiments/MontgomeryCurve | 0m22.85s || +0m00.19s 0m22.37s | Specific/GF25519 | 0m22.28s || +0m00.08s 0m22.06s | ModularArithmetic/Pow2BaseProofs | 0m22.08s || -0m00.01s 0m20.17s | Algebra | 0m20.11s || +0m00.06s 0m17.10s | EdDSARepChange | 0m17.21s || -0m00.10s 0m16.85s | CompleteEdwardsCurve/CompleteEdwardsCurveTheorems | 0m17.03s || -0m00.17s 0m13.86s | Util/ZUtil | 0m13.72s || +0m00.13s 0m09.98s | Testbit | 0m10.03s || -0m00.04s 0m08.94s | [require-in-module,deprecated] src/Assembly/GF25519 | 0m09.08s || -0m00.14s 0m08.81s | ModularArithmetic/Montgomery/ZProofs | 0m08.71s || +0m00.09s 0m08.45s | BoundedArithmetic/ArchitectureToZLikeProofs | 0m08.46s || -0m00.01s 0m08.39s | Specific/GF25519BoundedCommonWord | 0m08.41s || -0m00.01s 0m08.39s | Specific/GF1305 | 0m08.44s || -0m00.04s 0m08.35s | Encoding/PointEncoding | 0m08.41s || -0m00.06s 0m08.22s | BoundedArithmetic/Double/Proofs/Multiply | 0m08.25s || -0m00.02s 0m07.76s | BoundedArithmetic/Double/Proofs/ShiftRightDoubleWordImmediate | 0m07.77s || -0m00.00s 0m07.18s | Specific/GF25519BoundedCommon | 0m07.34s || -0m00.16s 0m06.80s | BoundedArithmetic/Double/Proofs/SpreadLeftImmediate | 0m07.03s || -0m00.23s 0m06.10s | Bedrock/Word | 0m06.08s || +0m00.01s 0m05.45s | Specific/SC25519 | 0m05.44s || +0m00.00s 0m05.44s | BoundedArithmetic/Double/Proofs/RippleCarryAddSub | 0m05.49s || -0m00.04s 0m05.40s | Util/ListUtil | 0m05.38s || +0m00.02s 0m05.32s | Experiments/GenericFieldPow | 0m05.31s || +0m00.01s 0m04.81s | WeierstrassCurve/Pre | 0m04.82s || -0m00.01s 0m04.76s | ModularArithmetic/ModularBaseSystemListProofs | 0m04.84s || -0m00.08s 0m04.40s | Reflection/Z/Interpretations | 0m04.48s || -0m00.08s 0m04.22s | Reflection/LinearizeWf | 0m04.21s || +0m00.00s 0m03.92s | BaseSystemProofs | 0m03.88s || +0m00.04s 0m03.91s | Assembly/GF25519BoundedInstantiation | 0m03.78s || +0m00.13s 0m03.83s | ModularArithmetic/BarrettReduction/ZHandbook | 0m03.90s || -0m00.06s 0m03.67s | ModularArithmetic/Tutorial | 0m03.53s || +0m00.14s 0m03.56s | CompleteEdwardsCurve/Pre | 0m03.50s || +0m00.06s 0m03.36s | BoundedArithmetic/InterfaceProofs | 0m03.30s || +0m00.06s 0m03.03s | ModularArithmetic/BarrettReduction/ZGeneralized | 0m03.12s || -0m00.09s 0m02.92s | BoundedArithmetic/Double/Proofs/Decode | 0m02.90s || +0m00.02s 0m02.89s | ModularArithmetic/ZBoundedZ | 0m02.84s || +0m00.05s 0m02.86s | Specific/GF25519Reflective/Reified/CarrySub | 0m03.15s || -0m00.29s 0m02.85s | Encoding/PointEncodingPre | 0m02.87s || -0m00.02s 0m02.62s | Assembly/State | 0m02.71s || -0m00.08s 0m02.61s | ModularArithmetic/ModularArithmeticTheorems | 0m02.60s || +0m00.00s 0m02.54s | BoundedArithmetic/Double/Proofs/ShiftLeft | 0m02.60s || -0m00.06s 0m02.53s | BoundedArithmetic/Double/Proofs/ShiftRight | 0m02.50s || +0m00.02s 0m02.52s | Specific/GF25519Reflective/Reified/CarryOpp | 0m03.00s || -0m00.48s 0m02.51s | Specific/GF25519Reflective/Reified/CarryAdd | 0m02.50s || +0m00.00s 0m02.38s | ModularArithmetic/ModularBaseSystemOpt | 0m02.34s || +0m00.04s 0m02.28s | ModularArithmetic/BarrettReduction/ZBounded | 0m02.30s || -0m00.02s 0m02.16s | Specific/FancyMachine256/Montgomery | 0m02.07s || +0m00.09s 0m02.13s | Specific/FancyMachine256/Barrett | 0m02.18s || -0m00.05s 0m01.93s | Reflection/WfProofs | 0m01.89s || +0m00.04s 0m01.84s | Assembly/Evaluables | 0m02.00s || -0m00.15s 0m01.84s | Specific/FancyMachine256/Core | 0m01.91s || -0m00.06s 0m01.84s | ModularArithmetic/Montgomery/ZBounded | 0m01.79s || +0m00.05s 0m01.79s | Specific/GF25519Bounded | 0m01.74s || +0m00.05s 0m01.79s | Specific/GF25519Reflective/Reified/Sub | 0m01.66s || +0m00.13s 0m01.78s | Specific/GF25519Reflective/Reified/Pack | 0m01.80s || -0m00.02s 0m01.76s | Reflection/InlineWf | 0m01.69s || +0m00.07s 0m01.68s | Specific/GF25519Reflective/Reified/Unpack | 0m01.71s || -0m00.03s 0m01.55s | Reflection/InlineInterp | 0m01.58s || -0m00.03s 0m01.53s | ModularArithmetic/BarrettReduction/Z | 0m01.55s || -0m00.02s 0m01.51s | Specific/GF25519Reflective/Reified/Add | 0m01.29s || +0m00.21s 0m01.48s | Specific/GF25519Reflective/Reified/Opp | 0m01.49s || -0m00.01s 0m01.47s | Assembly/WordizeUtil | 0m01.52s || -0m00.05s 0m01.45s | Assembly/Compile | 0m01.45s || +0m00.00s 0m01.43s | Reflection/TestCase | 0m01.44s || -0m00.01s 0m01.42s | Specific/GF25519Reflective/Reified/GeModulus | 0m01.34s || +0m00.07s 0m01.41s | Util/NatUtil | 0m01.39s || +0m00.02s 0m01.32s | Assembly/Bounds | 0m01.33s || -0m00.01s 0m01.31s | ModularArithmetic/PrimeFieldTheorems | 0m01.27s || +0m00.04s 0m01.18s | ModularArithmetic/ExtendedBaseVector | 0m01.11s || +0m00.06s 0m01.17s | BaseSystem | 0m01.16s || +0m00.01s 0m01.15s | Assembly/Conversions | 0m01.12s || +0m00.02s 0m01.08s | BoundedArithmetic/Double/Repeated/Proofs/Decode | 0m01.11s || -0m00.03s 0m01.00s | Assembly/Pipeline | 0m01.00s || +0m00.00s 0m00.99s | Util/WordUtil | 0m01.07s || -0m00.08s 0m00.98s | Assembly/HL | 0m01.04s || -0m00.06s 0m00.98s | Assembly/LL | 0m01.00s || -0m00.02s 0m00.98s | BoundedArithmetic/Double/Proofs/BitwiseOr | 0m00.91s || +0m00.06s 0m00.97s | Assembly/PhoasCommon | 0m00.89s || +0m00.07s 0m00.92s | Util/NumTheoryUtil | 0m00.91s || +0m00.01s 0m00.87s | BoundedArithmetic/X86ToZLikeProofs | 0m00.80s || +0m00.06s 0m00.83s | BoundedArithmetic/Double/Proofs/LoadImmediate | 0m00.86s || -0m00.03s 0m00.78s | Specific/GF25519Reflective/Reified | 0m00.68s || +0m00.09s 0m00.78s | Util/IterAssocOp | 0m00.78s || +0m00.00s 0m00.77s | Specific/GF25519Reflective/Common | 0m00.70s || +0m00.07s 0m00.76s | Assembly/QhasmEvalCommon | 0m00.78s || -0m00.02s 0m00.75s | Util/PartiallyReifiedProp | 0m00.74s || +0m00.01s 0m00.72s | Encoding/ModularWordEncodingTheorems | 0m00.62s || +0m00.09s 0m00.72s | Util/Tuple | 0m00.72s || +0m00.00s 0m00.66s | ModularArithmetic/ModularBaseSystem | 0m00.64s || +0m00.02s 0m00.63s | ModularArithmetic/PseudoMersenneBaseParamProofs | 0m00.63s || +0m00.00s 0m00.62s | ModularArithmetic/ExtPow2BaseMulProofs | 0m00.70s || -0m00.07s 0m00.61s | Util/AdditionChainExponentiation | 0m00.60s || +0m00.01s 0m00.61s | Reflection/LinearizeInterp | 0m00.51s || +0m00.09s 0m00.60s | Encoding/ModularWordEncodingPre | 0m00.58s || +0m00.02s 0m00.60s | BoundedArithmetic/Double/Repeated/Proofs/Multiply | 0m00.61s || -0m00.01s 0m00.60s | ModularArithmetic/ModularBaseSystemList | 0m00.61s || -0m00.01s 0m00.60s | Spec/EdDSA | 0m00.60s || +0m00.00s 0m00.58s | Reflection/InterpWfRel | 0m00.57s || +0m00.01s 0m00.57s | Reflection/WfReflectiveGen | 0m00.60s || -0m00.03s 0m00.56s | BoundedArithmetic/Interface | 0m00.65s || -0m00.08s 0m00.56s | Spec/ModularWordEncoding | 0m00.72s || -0m00.15s 0m00.56s | BoundedArithmetic/Double/Repeated/Proofs/ShiftLeftRight | 0m00.62s || -0m00.05s 0m00.56s | BoundedArithmetic/X86ToZLike | 0m00.63s || -0m00.06s 0m00.55s | BoundedArithmetic/Double/Proofs/SelectConditional | 0m00.54s || +0m00.01s 0m00.52s | BoundedArithmetic/Double/Repeated/Core | 0m00.52s || +0m00.00s 0m00.51s | BoundedArithmetic/ArchitectureToZLike | 0m00.42s || +0m00.09s 0m00.50s | Assembly/StringConversion | 0m00.54s || -0m00.04s 0m00.50s | BoundedArithmetic/Double/Repeated/Proofs/RippleCarryAddSub | 0m00.49s || +0m00.01s 0m00.50s | ModularArithmetic/ZBounded | 0m00.51s || -0m00.01s 0m00.49s | Assembly/Qhasm | 0m00.53s || -0m00.04s 0m00.49s | Reflection/Z/Syntax | 0m00.50s || -0m00.01s 0m00.48s | BoundedArithmetic/Double/Core | 0m00.47s || +0m00.01s 0m00.48s | Reflection/Z/Reify | 0m00.41s || +0m00.07s 0m00.48s | ModularArithmetic/Pre | 0m00.48s || +0m00.00s 0m00.48s | BoundedArithmetic/Double/Repeated/Proofs/SelectConditional | 0m00.46s || +0m00.01s 0m00.47s | BoundedArithmetic/Double/Repeated/Proofs/ShiftRightDoubleWordImmediate | 0m00.62s || -0m00.15s 0m00.47s | Reflection/InterpWf | 0m00.47s || +0m00.00s 0m00.47s | BoundedArithmetic/Double/Repeated/Proofs/LoadImmediate | 0m00.47s || +0m00.00s 0m00.46s | Assembly/QhasmUtil | 0m00.45s || +0m00.01s 0m00.46s | BoundedArithmetic/Double/Repeated/Proofs/BitwiseOr | 0m00.49s || -0m00.02s 0m00.46s | Reflection/CommonSubexpressionElimination | 0m00.44s || +0m00.02s 0m00.45s | Util/Decidable | 0m00.54s || -0m00.09s 0m00.44s | BoundedArithmetic/Double/Proofs/ShiftLeftRightTactic | 0m00.42s || +0m00.02s 0m00.44s | Reflection/Conversion | 0m00.42s || +0m00.02s 0m00.44s | Reflection/InterpProofs | 0m00.45s || -0m00.01s 0m00.44s | BoundedArithmetic/Eta | 0m00.39s || +0m00.04s 0m00.42s | Reflection/MapInterpWf | 0m00.41s || +0m00.01s 0m00.42s | Reflection/Syntax | 0m00.44s || -0m00.02s 0m00.42s | Spec/WeierstrassCurve | 0m00.43s || -0m00.01s 0m00.42s | Reflection/Named/NameUtil | 0m00.35s || +0m00.07s 0m00.42s | BoundedArithmetic/StripCF | 0m00.48s || -0m00.06s 0m00.42s | Reflection/Named/RegisterAssign | 0m00.41s || +0m00.01s 0m00.42s | Reflection/InputSyntax | 0m00.42s || +0m00.00s 0m00.42s | Spec/MxDH | 0m00.40s || +0m00.01s 0m00.41s | Reflection/CountLets | 0m00.36s || +0m00.04s 0m00.41s | Reflection/Named/EstablishLiveness | 0m00.36s || +0m00.04s 0m00.40s | ModularArithmetic/Pow2Base | 0m00.42s || -0m00.01s 0m00.39s | Reflection/MapInterp | 0m00.35s || +0m00.04s 0m00.39s | ModularArithmetic/PseudoMersenneBaseParams | 0m00.45s || -0m00.06s 0m00.39s | Reflection/Named/Syntax | 0m00.42s || -0m00.02s 0m00.38s | Reflection/FilterLive | 0m00.35s || +0m00.03s 0m00.38s | Spec/CompleteEdwardsCurve | 0m00.44s || -0m00.06s 0m00.38s | Reflection/Named/DeadCodeElimination | 0m00.36s || +0m00.02s 0m00.38s | Reflection/Linearize | 0m00.38s || +0m00.00s 0m00.37s | Reflection/Inline | 0m00.38s || -0m00.01s 0m00.37s | ModularArithmetic/Montgomery/Z | 0m00.36s || +0m00.01s 0m00.37s | Reflection/WfRel | 0m00.37s || +0m00.00s 0m00.36s | Assembly/QhasmCommon | 0m00.31s || +0m00.04s 0m00.35s | Tactics/Algebra_syntax/Nsatz | 0m00.37s || -0m00.02s 0m00.35s | Spec/ModularArithmetic | 0m00.36s || -0m00.01s 0m00.34s | Reflection/Named/Compile | 0m00.36s || -0m00.01s 0m00.34s | Reflection/Named/ContextOn | 0m00.34s || +0m00.00s 0m00.34s | Reflection/Reify | 0m00.35s || -0m00.00s 0m00.28s | Bedrock/Nomega | 0m00.28s || +0m00.00s 0m00.24s | ModularArithmetic/ModularBaseSystemListZOperations | 0m00.26s || -0m00.02s 0m00.21s | Util/Sum | 0m00.24s || -0m00.03s 0m00.19s | Util/CaseUtil | 0m00.22s || -0m00.03s 0m00.18s | Experiments/ExtrHaskellNats | 0m00.17s || +0m00.00s 0m00.13s | Util/Relations | 0m00.14s || -0m00.01s 0m00.10s | Util/Option | 0m00.14s || -0m00.04s 0m00.09s | Util/PointedProp | 0m00.08s || +0m00.00s 0m00.08s | Util/Sigma | 0m00.10s || -0m00.02s 0m00.08s | Util/LetIn | 0m00.04s || +0m00.04s 0m00.05s | Util/HProp | 0m00.04s || +0m00.01s 0m00.05s | Util/Tactics | 0m00.04s || +0m00.01s 0m00.05s | Util/Equality | 0m00.04s || +0m00.01s 0m00.04s | Util/Prod | 0m00.05s || -0m00.01s 0m00.04s | Util/AutoRewrite | 0m00.04s || +0m00.00s 0m00.03s | Util/Unit | 0m00.03s || +0m00.00s 0m00.03s | Spec/Encoding | 0m00.02s || +0m00.00s 0m00.03s | Util/Logic | 0m00.03s || +0m00.00s 0m00.02s | Tactics/VerdiTactics | 0m00.03s || -0m00.00s 0m00.02s | Util/Notations | 0m00.02s || +0m00.00s 0m00.02s | Encoding/EncodingTheorems | 0m00.03s || -0m00.00s 0m00.02s | Util/Isomorphism | 0m00.02s || +0m00.00s 0m00.02s | Util/GlobalSettings | 0m00.02s || +0m00.00s 0m00.02s | Util/FixCoqMistakes | 0m00.03s || -0m00.00s 0m00.02s | Util/Bool | 0m00.02s || +0m00.00s
* Add PartiallyReifiedPropGravatar Jason Gross2016-10-30
|
* Add reification of various operationsGravatar Jason Gross2016-10-30
| | | | | We split the reification up into separate files, one operation per file, so that we can run all the reification in parallel when building.
* Add initial work on reifying GF25519 stuffGravatar Jason Gross2016-10-30
|
* Add InterpWfGravatar Jason Gross2016-10-28
|
* Add InterpWfRelGravatar Jason Gross2016-10-28
|
* Add beginnings of various interpretations of expression treesGravatar Jason Gross2016-10-27
|
* Merge pull request #84 from mit-plv/rsloan-phoasGravatar Jason Gross2016-10-27
|\ | | | | Patching master with most of my Conversion refactors
* | Add syntax and reification for the ops in GF25519Gravatar Jason Gross2016-10-27
| | | | | | | | That is, for add, sub, mul, opp, freeze, ge_modulus, pack, and unpack.
* | Factor out cmov{l,ne} and negGravatar Jason Gross2016-10-27
| | | | | | | | This way we will have a faster build of reification things
* | Add WfRelReflectiveGravatar Jason Gross2016-10-27
| | | | | | | | Not sure if it's needed, but it was pretty easy to write...
* | Add WfReflectiveGenGravatar Jason Gross2016-10-27
| | | | | | | | Prep for WfRelReflective
* | Add Wf proofs about MapInterpGravatar Jason Gross2016-10-27
| |
| * Merge branch 'master' into rsloan-phoasGravatar Jason Gross2016-10-27
| |\ | |/ |/|
* | Switch to bounded ZGravatar Jason Gross2016-10-25
| | | | | | | | | | We don't have working word code yet, because the reification code currently does spurious word->N->Z->N->word conversions everywhere. So we use Z instead.
| * Fix 8.4 buildGravatar Jason Gross2016-10-22
| |
| * Merge branch 'master' into pr/84Gravatar Jason Gross2016-10-22
| |\ | |/ |/|
* | Fix src/Experiments/Ed25519.v for Coq 8.4Gravatar Jason Gross2016-10-22
| | | | | | | | Using very dubious module hackery.
| * merge rsloan-phoas refactors into masterGravatar Robert Sloan2016-10-21
| |\ | |/ |/|
| * committing unstable refactors to patch masterGravatar Robert Sloan2016-10-21
| |
* | Split up GF25519Bounded to avoid circular dependenciesGravatar Jason Gross2016-10-20
| |
* | Merge branch 'master' into instantiation-rsloan-phoasGravatar Jason Gross2016-10-20
|\ \
| * | First pass at bounded version of GF25519Gravatar Jason Gross2016-10-19
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Boundedness is axiomatized as ```coq Axiom ExprBinOp : Type. Axiom ExprUnOp : Type. Axiom interp_bexpr : ExprBinOp -> Specific.GF25519.fe25519 -> Specific.GF25519.fe25519 -> Specific.GF25519.fe25519. Axiom interp_uexpr : ExprUnOp -> Specific.GF25519.fe25519 -> Specific.GF25519.fe25519. Axiom radd : ExprBinOp. Axiom rsub : ExprBinOp. Axiom rmul : ExprBinOp. Axiom ropp : ExprUnOp. Axiom rinv : ExprUnOp. Axiom radd_correct : forall x y, interp_bexpr radd x y = carry_add x y. Axiom rsub_correct : forall x y, interp_bexpr rsub x y = carry_sub x y. Axiom rmul_correct : forall x y, interp_bexpr rmul x y = mul x y. Axiom ropp_correct : forall x, interp_uexpr ropp x = carry_opp x. Axiom rinv_correct : forall x, interp_uexpr rinv x = inv x. Axiom check_bbounds : ExprBinOp -> bool. Axiom check_ubounds : ExprUnOp -> bool. Axiom radd_bounded : check_bbounds radd = true. Axiom rsub_bounded : check_bbounds rsub = true. Axiom rmul_bounded : check_bbounds rmul = true. Axiom ropp_bounded : check_ubounds ropp = true. Axiom rinv_bounded : check_ubounds rinv = true. Axiom bbounds_correct : forall rexpr, check_bbounds rexpr = true -> forall x y, is_bounded x = true -> is_bounded y = true -> is_bounded (interp_bexpr rexpr x y) = true. Axiom ubounds_correct : forall rexpr, check_ubounds rexpr = true -> forall x, is_bounded x = true -> is_bounded (interp_uexpr rexpr x) = true. ``` Questions: - Some of this is very general and probably doesn't belong in this file (e.g., [correct_le_le]). Should it stay, or move elsewhere? - There's a lot of type munging that could be generalized to arbitrary heterogenous lists; should it be generalized? - How do we do [div] on bounded things? Currently, I have ```coq Axiom div : forall (f g : fe25519), fe25519. Axiom div_correct : forall a b : fe25519, ModularBaseSystem.eq (proj1_fe25519 (div a b)) (ModularBaseSystem.div (proj1_fe25519 a) (proj1_fe25519 b)). ```
* | | Start instantiating boundedness thingsGravatar Jason Gross2016-10-19
| |/ |/|
| * Rename and clean up exponent codeGravatar Jason Gross2016-10-17
| |
| * Initial work on exponent field as ZGravatar Jason Gross2016-10-17
| |
| * Add Z as ZBoundedGravatar Jason Gross2016-10-16
| |
* | Making sub bounds actually tightGravatar Robert Sloan2016-10-14
| |
* | Minor refactors waiting for the code generation to finishGravatar Robert Sloan2016-10-13
| |
| * Add src/BoundedArithmetic/Eta.vGravatar Jason Gross2016-10-13
| |
| * remove EncodingLemmas from _CoqProject (file deleted by Andres in commit ↵Gravatar jadep2016-10-12
| | | | | | | | 9379415c)
| * Add Ed25519 to _CoqProjectGravatar Jason Gross2016-10-12
| |
| * Add some admitted x86->ZLike proofsGravatar Jason Gross2016-10-10
| |
| * Update _CoqProjectGravatar Jason Gross2016-10-10
| |
| * Add shl,shr,shrd to repeated doublingGravatar Jason Gross2016-10-09
| | | | | | | | | | | | | | | | | | | | | | | | | | | | After | File Name | Before || Change --------------------------------------------------------------------------------------------------------- 0m03.99s | Total | 0m03.08s || +0m00.90s --------------------------------------------------------------------------------------------------------- 0m01.14s | BoundedArithmetic/Double/Repeated/Proofs/Decode | 0m01.02s || +0m00.11s 0m00.52s | BoundedArithmetic/Double/Repeated/Proofs/BitwiseOr | 0m00.53s || -0m00.01s 0m00.51s | BoundedArithmetic/Double/Repeated/Proofs/RippleCarryAddSub | 0m00.51s || +0m00.00s 0m00.47s | BoundedArithmetic/Double/Repeated/Proofs/ShiftRightDoubleWordImmediate | N/A || +0m00.47s 0m00.46s | BoundedArithmetic/Double/Repeated/Proofs/LoadImmediate | 0m00.54s || -0m00.08s 0m00.46s | BoundedArithmetic/Double/Repeated/Proofs/ShiftLeftRight | N/A || +0m00.46s 0m00.44s | BoundedArithmetic/Double/Repeated/Proofs/SelectConditional | 0m00.49s || -0m00.04s
| * Add proofs for doubling shl,shr,shrdGravatar Jason Gross2016-10-09
| | | | | | | | | | | | | | | | | | | | | | After | File Name | Before || Change ------------------------------------------------------------------------------------------------ 0m14.81s | Total | 0m00.00s || +0m14.81s ------------------------------------------------------------------------------------------------ 0m08.87s | BoundedArithmetic/Double/Proofs/ShiftRightDoubleWordImmediate | N/A || +0m08.86s 0m02.82s | BoundedArithmetic/Double/Proofs/ShiftLeft | N/A || +0m02.81s 0m02.72s | BoundedArithmetic/Double/Proofs/ShiftRight | N/A || +0m02.72s 0m00.40s | BoundedArithmetic/Double/Proofs/ShiftLeftRightTactic | N/A || +0m00.40s
| * Some work on x86 and bounded repeated thingsGravatar Jason Gross2016-10-09
| |
| * Split up DoubleBoundedProofs, add proofsGravatar Jason Gross2016-10-07
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Some help from jadep on BitwiseOr. After | File Name | Before || Change -------------------------------------------------------------------------------------- 0m39.26s | Total | 0m36.03s || +0m03.23s -------------------------------------------------------------------------------------- N/A | BoundedArithmetic/DoubleBoundedProofs | 0m21.20s || -0m21.19s 0m07.47s | BoundedArithmetic/Double/Proofs/Multiply | N/A || +0m07.46s 0m06.70s | BoundedArithmetic/Double/Proofs/SpreadLeftImmediate | N/A || +0m06.70s 0m05.14s | BoundedArithmetic/Double/Proofs/RippleCarryAddSub | N/A || +0m05.13s 0m02.75s | BoundedArithmetic/Double/Proofs/Decode | N/A || +0m02.75s 0m08.06s | BoundedArithmetic/ArchitectureToZLikeProofs | 0m08.05s || +0m00.00s 0m02.01s | Specific/FancyMachine256/Barrett | 0m02.13s || -0m00.12s 0m02.00s | Specific/FancyMachine256/Montgomery | 0m02.06s || -0m00.06s 0m01.75s | Specific/FancyMachine256/Core | 0m01.66s || +0m00.09s 0m00.90s | BoundedArithmetic/Double/Proofs/LoadImmediate | N/A || +0m00.90s 0m00.88s | BoundedArithmetic/Double/Proofs/BitwiseOr | N/A || +0m00.88s 0m00.58s | BoundedArithmetic/Double/Proofs/SelectConditional | N/A || +0m00.57s 0m00.53s | BoundedArithmetic/ArchitectureToZLike | 0m00.47s || +0m00.06s 0m00.49s | BoundedArithmetic/Double/Core | N/A || +0m00.49s N/A | BoundedArithmetic/DoubleBounded | 0m00.46s || -0m00.46s
| * Add a variant of [map] on reflective things that changes the interp functionGravatar Jason Gross2016-10-07
| |
* | Merge _CoqProjectGravatar Rob Sloan2016-10-06
|\ \
generated by cgit v1.2.3 (git 2.39.1) at 2024-06-21 08:50:17 +0000