diff --git a/prism-examples/consensus/coin.pctl b/prism-examples/consensus/coin.pctl
index e26c623e..c85f10f4 100644
--- a/prism-examples/consensus/coin.pctl
+++ b/prism-examples/consensus/coin.pctl
@@ -1,18 +1,15 @@
 const int k;
 
 // C1 (with probability 1, all N processes finish the protocol)
-// (needs fairness)
 P>=1 [ F "finished" ]
 
 // C2 (minimum probability that the protocol finishes with all coins equal to v) (v=1,2)
-// (needs fairness)
 // Results are same for v=1 and v=2 by symmetry
 // Analytic bound is (K-1)/(2*K)
 Pmin=? [ F "finished"&"all_coins_equal_0" ]
 Pmin=? [ F "finished"&"all_coins_equal_1" ]
 
 // Max probability of finishing protocol with coins not all equal
-// (no fairness needed since max. probabilities)
 Pmax=? [ F "finished"&!"agree" ]
 
 // Min/max probability of finishing within k steps