diff --git a/tips/TIP-0045/tip-0045.md b/tips/TIP-0045/tip-0045.md
index 93ae4630b..595b4e89a 100644
--- a/tips/TIP-0045/tip-0045.md
+++ b/tips/TIP-0045/tip-0045.md
@@ -52,7 +52,7 @@ value for which the proof is computed. A `Leaf Hash` schema is additionally used
 
 <details>
   <summary>Node</summary>
-  <blockquote>Contains the hash of the value for which the proof is being computed.</blockquote>
+  <blockquote>A merkle tree node that contains two child components.</blockquote>
 </details>
 <table>
   <tr>
@@ -76,7 +76,7 @@ value for which the proof is computed. A `Leaf Hash` schema is additionally used
     <td colspan="2">
       <details>
         <summary>Node</summary>
-        <blockquote>Contains the hash of the value for which the proof is being computed. Defined in <a href='../TIP-0045/tip-0045.md#node'>TIP-45 (Node)</a>.</blockquote>
+        <blockquote>A merkle tree node that contains two child components. Defined in <a href='../TIP-0045/tip-0045.md#node'>TIP-45 (Node)</a>.</blockquote>
       </details>
       <details>
         <summary>Leaf Hash</summary>
@@ -93,7 +93,7 @@ value for which the proof is computed. A `Leaf Hash` schema is additionally used
     <td colspan="2">
       <details>
         <summary>Node</summary>
-        <blockquote>Contains the hash of the value for which the proof is being computed. Defined in <a href='../TIP-0045/tip-0045.md#node'>TIP-45 (Node)</a>.</blockquote>
+        <blockquote>A merkle tree node that contains two child components. Defined in <a href='../TIP-0045/tip-0045.md#node'>TIP-45 (Node)</a>.</blockquote>
       </details>
       <details>
         <summary>Leaf Hash</summary>
@@ -633,7 +633,7 @@ A proof is serialized as follows:
     <td colspan="2">
       <details>
         <summary>Node</summary>
-        <blockquote>Contains the hash of the value for which the proof is being computed. Defined in <a href='../TIP-0045/tip-0045.md#node'>TIP-45 (Node)</a>.</blockquote>
+        <blockquote>A merkle tree node that contains two child components. Defined in <a href='../TIP-0045/tip-0045.md#node'>TIP-45 (Node)</a>.</blockquote>
         <table>
           <tr>
             <td>
@@ -656,7 +656,7 @@ A proof is serialized as follows:
             <td colspan="2">
               <details>
                 <summary>Node</summary>
-                <blockquote>Contains the hash of the value for which the proof is being computed. Defined in <a href='../TIP-0045/tip-0045.md#node'>TIP-45 (Node)</a>.</blockquote>
+                <blockquote>A merkle tree node that contains two child components. Defined in <a href='../TIP-0045/tip-0045.md#node'>TIP-45 (Node)</a>.</blockquote>
               </details>
               <details>
                 <summary>Leaf Hash</summary>
@@ -673,7 +673,7 @@ A proof is serialized as follows:
             <td colspan="2">
               <details>
                 <summary>Node</summary>
-                <blockquote>Contains the hash of the value for which the proof is being computed. Defined in <a href='../TIP-0045/tip-0045.md#node'>TIP-45 (Node)</a>.</blockquote>
+                <blockquote>A merkle tree node that contains two child components. Defined in <a href='../TIP-0045/tip-0045.md#node'>TIP-45 (Node)</a>.</blockquote>
               </details>
               <details>
                 <summary>Leaf Hash</summary>