<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Merkle-Tree on Pi Stack</title>
    <link>https://www.pistack.xyz/tags/merkle-tree/</link>
    <description>Recent content in Merkle-Tree on Pi Stack</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 19 Jun 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.pistack.xyz/tags/merkle-tree/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Self-Hosted Merkle Tree Libraries: OpenTimestamps vs merkletreejs vs go-merkletree vs Trillian</title>
      <link>https://www.pistack.xyz/posts/2026-06-19-merkle-tree-libraries-opentimestamps-merkletreejs-go-trillian/</link>
      <pubDate>Fri, 19 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-19-merkle-tree-libraries-opentimestamps-merkletreejs-go-trillian/</guid>
      <description>&lt;h2 id=&#34;what-are-merkle-trees-and-why-do-they-matter&#34;&gt;What Are Merkle Trees and Why Do They Matter?&lt;/h2&gt;&#xA;&lt;p&gt;Merkle trees, named after cryptographer Ralph Merkle, are hash-based data structures that enable efficient and secure verification of data integrity. At their core, a Merkle tree takes a set of data blocks, hashes each one, then recursively hashes pairs of hashes until a single root hash remains. This root hash serves as a compact fingerprint of the entire dataset — change any byte anywhere in the data, and the root hash changes completely.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
