diff --git a/docs/img/utreexo_delete.svg b/docs/img/utreexo_delete.svg
index f8d6fdc4..0ac20375 100644
--- a/docs/img/utreexo_delete.svg
+++ b/docs/img/utreexo_delete.svg
@@ -1,29 +1,10 @@
-
\ No newline at end of file
diff --git a/docs/img/utreexo_proof.svg b/docs/img/utreexo_proof.svg
index e399facd..3d3ce0a0 100644
--- a/docs/img/utreexo_proof.svg
+++ b/docs/img/utreexo_proof.svg
@@ -1,29 +1,10 @@
-
\ No newline at end of file
diff --git a/docs/utreexo.md b/docs/utreexo.md
index 0f0d4d8f..8743d928 100644
--- a/docs/utreexo.md
+++ b/docs/utreexo.md
@@ -64,6 +64,8 @@ Batch inclusion proofs were introduced in the Utreexo paper (see Appendix) and t
+As can be seen from the illustration, the batch proof can be much more compact because more intermediate nodes can be calculated rather than be provided.
+
Implementation wise there are several things you should note:
- Proof nodes are in the exact order you need them to verify proof/delete leaves
- Leaf nodes might edge in (since they are not necessarily in the bottom most row), so on every step you should pick one of {leaf, proof, computed} nodes
+As can be seen from the illustration, the batch proof can be much more compact because more intermediate nodes can be calculated rather than be provided.
+
Implementation wise there are several things you should note:
- Proof nodes are in the exact order you need them to verify proof/delete leaves
- Leaf nodes might edge in (since they are not necessarily in the bottom most row), so on every step you should pick one of {leaf, proof, computed} nodes