<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Crypto on Alexey Zanyuk&#39;s blog</title>
    <link>https://zanyuk.com/tags/crypto/</link>
    <description>Recent content in Crypto on Alexey Zanyuk&#39;s blog</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Thu, 05 Nov 2026 17:00:00 -0500</lastBuildDate>
    <atom:link href="https://zanyuk.com/tags/crypto/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Merkle trees and Verkle trees</title>
      <link>https://zanyuk.com/post/merkle-and-verkle-trees/</link>
      <pubDate>Thu, 05 Nov 2026 17:00:00 -0500</pubDate>
      <guid>https://zanyuk.com/post/merkle-and-verkle-trees/</guid>
      <description>You have a large set of records. You want to publish a short commitment now, and later convince someone of one record without sending the set. That is the job of an authenticated data structure.&#xA;A hash commits to one string. SHA-256 of one blob is a fixed fingerprint of that blob. To check it, hash the blob again and compare. A match says this is the same string. It says almost nothing about any other string: a different payment, or the rest of a file, is a different hash, and this fingerprint does not contain those bytes.</description>
    </item>
  </channel>
</rss>
