anchor.diff:            └─────┘   └─────┘      └─────┘   └─────┘  
   
         :markdown-it
  -        You may have seen this data-structure before: it is the foundational data-structure behind
  +        You may have seen this data structure before: it is the foundational data structure behind
           both Git and Bitcoin.  In Bitcoin, the leaves are transactions from a transaction block, and
           the recursive hashes allow someone who has no direct access to a particular transaction to
           trust its authenticity.
   
           Git also relies heavily on hashing the hashes of child nodes.  However, Merkle trees don't
           map perfectly to Git's use-case.  To understand the variation that Git introduces, let's look
  -        at another data-structure.
  +        at another data structure.
   
           ### Directed Acyclic Graph
   
  
positive.code:         - author meta-data; and
          - a timestamp.
  
          This data-structure actually resembles a Merkle tree in a number of ways.
  
          - Both are unidirectional.
          - Both utilize recursive hashes on a tree-like structure.
  
negative.code:         - And it allows for universal guarantees surrounding uniqueness of a module and bundle's
            behavior within the context of any build.
  
          To understand this better, let's look at the two data structures upon which the module system
          is based.
  
  
  