remove some uninteresting comments

src/fmtseq.cpp

@@ -314,7 +314,6 @@ int fmtseq::generate (pubkey&pub, privkey&priv,
  * - h*l hashes of verification chain, from bottom to top, h*l times hash size
  * - i (so that we can guess left/right concatenation before hashing) stored as
  *   H-bit number in little endian.
- *   TODO Why cannot the tree be just XORed together? would be WAY simpler!
  *
  * summed up:
  *

src/matrix.cpp

@@ -63,7 +63,7 @@ void matrix::compute_transpose (matrix&r)
 
 void matrix::mult (const matrix&right)
 {
-	//trivial multiply. TODO strassen algo for larger matrices.
+	//trivial multiply
 	matrix leftT;
 	compute_transpose (leftT);
 	uint w = right.width(), h = leftT.width(), i, j;