--- a/handouts/ho06.tex	Thu Nov 05 02:11:13 2015 +0000
+++ b/handouts/ho06.tex	Thu Nov 05 03:57:27 2015 +0000
@@ -593,8 +593,10 @@
 are.\footnote{\url{http://en.wikipedia.org/wiki/NP_(complexity)}}
 They are the building blocks for zero-knowledge proofs.
 Zero-Knowldege proofs are not yet widely used in production
-systems, but it is slowly gaining ground. One application
-where they pop up are crypto currencies.
+systems, but it is slowly gaining ground. One area of application
+where they pop up is crypto currencies (for example Zerocoins
+or how to make sure a Bitcoin exchange is solvent without
+revealing its assets).
 
 If you want to brush up on the modular logarithm problem,
 the Khan Academy has a nice video: