aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorGravatar Jade Philipoom <jadep@mit.edu>2016-01-20 15:54:08 -0500
committerGravatar Jade Philipoom <jadep@mit.edu>2016-01-20 15:54:08 -0500
commit8b3728b68ea21e0cfedfc4eff7fa15830e84bdf1 (patch)
tree500975efd44b8b78985f8489b6cc5180fceaab0f /README.md
parent40750bf32318eb8d93e9537083e4288e55b2555e (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