From 7f4ddef979234b3a39d0b9fbc013004d4e3c2ca9 Mon Sep 17 00:00:00 2001
From: clenser <c_lenser@hotmail.com>
Date: Sat, 14 Oct 2023 18:25:02 +0000
Subject: [PATCH] Edited appa_whitepaper.adoc with Atlas code editor

---
 appa_whitepaper.adoc | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/appa_whitepaper.adoc b/appa_whitepaper.adoc
index 4a77dbbf..d39afe3d 100644
--- a/appa_whitepaper.adoc
+++ b/appa_whitepaper.adoc
@@ -70,7 +70,7 @@ The incentive may help encourage nodes to stay honest. If a greedy attacker is a
 ==== Reclaiming Disk Space
 
 ++++
-<p>Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space. To facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree <a href="#ref_seven">[7]</a> <a href="#ref_two">[2]</a> <a href="#ref_five">[5]</a>, with only the root included in the block's hash. Old blocks can then be compacted by stubbing off branches of the tree. The interior hashes do not need to be stored.</p>
+<p>Once the ((("disk space", "reclaiming")))((("reclaiming", "disk space")))((("blocks", "reclaiming disk space")))latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space. To facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree <a href="#ref_seven">[7]</a> <a href="#ref_two">[2]</a> <a href="#ref_five">[5]</a>, with only the root included in the block's hash. Old blocks can then be compacted by stubbing off branches of the tree. The interior hashes do not need to be stored.</p>
 ++++
 
 image::images/mbc3_aain04.png["disk"]