aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorGravatar Jade Philipoom <jadep@mit.edu>2016-01-20 15:54:08 -0500
committerGravatar Robert Sloan <varomodt@gmail.com>2016-06-22 13:38:54 -0400
commitc27952cd565e15f134bd73f22c696c5355022dde (patch)
tree5ca5f75ff0dafe5fff988539cd1e05669675ffa5 /README.md
parenta7edff124685dbd78116b0b4d230b71c4a4c6a3c (diff)
Import coqprime; use it to prove Euler's criterion.
Diffstat (limited to 'README.md')
-rw-r--r--README.md8
1 files changed, 4 insertions, 4 deletions
diff --git a/README.md b/README.md
index b969cb415..b11cb2d65 100644
--- a/README.md
+++ b/README.md
@@ -5,7 +5,7 @@ Synthesizing Correct-by-Construction Assembly for Cryptographic Primitives
To build:
- git clone git@github.mit.edu:plv/bedrock.git
- ( cd bedrock && $(MAKE) Bedrock/Word.vo )
- make
-
+ git clone git@github.mit.edu:plv/bedrock.git
+ ( cd bedrock && make Bedrock/Word.vo )
+ ( cd coqprime && make PrimalityTest/Zp.vo PrimalityTest/PocklingtonCertificat.vo )
+ make