download: refactor handling of URI Extension Block and crypttext hash tree, simplify...

[tahoe-lafs/tahoe-lafs.git] / src / allmydata / hashtree.py

diff --git a/src/allmydata/hashtree.py b/src/allmydata/hashtree.py
index c2f6deca50f7cbbd2c5910c6d213cb171f8f9510..8e66471eeca98b867ebea77ec636c9b9739c4f27 100644 (file)
--- a/src/allmydata/hashtree.py
+++ b/src/allmydata/hashtree.py
@@ -384,7 +384,7 @@ class IncompleteHashTree(CompleteBinaryTreeMixin, list):
             for i in new_hashes:
                 if self[i]:
                     if self[i] != new_hashes[i]:
-                        msg = "new hash does not match existing hash at "
+                        msg = "new hash %s does not match existing hash %s at " % (base32.b2a(new_hashes[i]), base32.b2a(self[i]))
                         msg += self._name_hash(i)
                         raise BadHashError(msg)
                 else: