<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>byzantine-fault-tolerance on Sparse Notes</title>
    <link>https://sparsenotes.com/tags/byzantine-fault-tolerance/</link>
    <description>Recent content in byzantine-fault-tolerance on Sparse Notes</description>
    <image>
      <url>https://sparsenotes.com/images/og-default.png</url>
      <link>https://sparsenotes.com/images/og-default.png</link>
    </image>
    <generator>Hugo -- gohugo.io</generator>
    <lastBuildDate>Sat, 25 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sparsenotes.com/tags/byzantine-fault-tolerance/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>The Byzantine Generals Problem (Lamport, Shostak &amp; Pease, 1982)</title>
      <link>https://sparsenotes.com/posts/2026/07/papers/byzantine-generals-problem/</link>
      <pubDate>Sat, 25 Jul 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/07/papers/byzantine-generals-problem/</guid>
      <description>The 1982 paper that named the problem, proved the n ≥ 3f &#43; 1 bound for oral messages, and showed how digital signatures lift the bound — the foundation every consensus protocol since has stood on.</description>
    </item>
    
  </channel>
</rss>
