From 5d4879a7608b106b4a8d2e4d72b4981189c79c8d Mon Sep 17 00:00:00 2001
From: Mirek Kratochvil <exa.exa@gmail.com>
Date: Mon, 15 Apr 2013 15:59:45 +0200
Subject: [PATCH] remove some uninteresting comments

---
 src/fmtseq.cpp | 1 -
 src/matrix.cpp | 2 +-
 2 files changed, 1 insertion(+), 2 deletions(-)

diff --git a/src/fmtseq.cpp b/src/fmtseq.cpp
index 60abdd5..b31883f 100644
--- a/src/fmtseq.cpp
+++ b/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:
  *
diff --git a/src/matrix.cpp b/src/matrix.cpp
index 6d652d8..751f0a5 100644
--- a/src/matrix.cpp
+++ b/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;