<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://tcwiki.azurewebsites.net/index.php?action=history&amp;feed=atom&amp;title=Consensus_Protocols</id>
		<title>Consensus Protocols - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://tcwiki.azurewebsites.net/index.php?action=history&amp;feed=atom&amp;title=Consensus_Protocols"/>
		<link rel="alternate" type="text/html" href="http://tcwiki.azurewebsites.net/index.php?title=Consensus_Protocols&amp;action=history"/>
		<updated>2026-09-10T04:22:50Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.4</generator>

	<entry>
		<id>http://tcwiki.azurewebsites.net/index.php?title=Consensus_Protocols&amp;diff=18922&amp;oldid=prev</id>
		<title>Tom: /* Full Title or Meme */</title>
		<link rel="alternate" type="text/html" href="http://tcwiki.azurewebsites.net/index.php?title=Consensus_Protocols&amp;diff=18922&amp;oldid=prev"/>
				<updated>2023-10-25T19:09:17Z</updated>
		
		<summary type="html">&lt;p&gt;‎&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;Full Title or Meme&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='2' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='2' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 19:09, 25 October 2023&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot; &gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Full Title or Meme==&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Full Title or Meme==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;A means for coming to a common consensus when not all parties trust each other.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;==Context==&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;A distributed algorithm developed by researchers at Switzerland's Ecole Polytechnique Federale de Lausanne (EPFL) helps overcome performance and reliability issues associated with consensus protocols. The QuePaxa algorithm is an asynchronous consensus protocol that is on par with leader-based protocols. Said EPFL's Bryan Ford, &amp;quot;QuePaxa is just as fast, efficient, low latency, and low cost in terms of network bandwidth, under normal conditions” as widely deployed leader-based protocols. QuePaxa allows a second leader to help the first leader without interference, with the potential for a third leader to assist both of them. Additionally, QuePaxa can survive noisy networks, high communication delays, unpredictably varying network delays, and deliberate denial-of-service attacks.&amp;lt;ref&amp;gt; Tanya Petersen, ''A game changer for building robust distributed systems'' EPFL News (2023-10-23) https://actu.epfl.ch/news/a-game-changer-for-building-robust-distributed-sys/&amp;lt;/ref&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;A distributed algorithm developed by researchers at Switzerland's Ecole Polytechnique Federale de Lausanne (EPFL) helps overcome performance and reliability issues associated with consensus protocols. The QuePaxa algorithm is an asynchronous consensus protocol that is on par with leader-based protocols. Said EPFL's Bryan Ford, &amp;quot;QuePaxa is just as fast, efficient, low latency, and low cost in terms of network bandwidth, under normal conditions” as widely deployed leader-based protocols. QuePaxa allows a second leader to help the first leader without interference, with the potential for a third leader to assist both of them. Additionally, QuePaxa can survive noisy networks, high communication delays, unpredictably varying network delays, and deliberate denial-of-service attacks.&amp;lt;ref&amp;gt; Tanya Petersen, ''A game changer for building robust distributed systems'' EPFL News (2023-10-23) https://actu.epfl.ch/news/a-game-changer-for-building-robust-distributed-sys/&amp;lt;/ref&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Tom</name></author>	</entry>

	<entry>
		<id>http://tcwiki.azurewebsites.net/index.php?title=Consensus_Protocols&amp;diff=18921&amp;oldid=prev</id>
		<title>Tom: /* Full Title or Meme */</title>
		<link rel="alternate" type="text/html" href="http://tcwiki.azurewebsites.net/index.php?title=Consensus_Protocols&amp;diff=18921&amp;oldid=prev"/>
				<updated>2023-10-25T19:07:48Z</updated>
		
		<summary type="html">&lt;p&gt;‎&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;Full Title or Meme&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='2' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='2' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 19:07, 25 October 2023&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot; &gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Full Title or Meme==&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Full Title or Meme==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;A distributed algorithm developed by researchers at Switzerland's Ecole Polytechnique Federale de Lausanne (EPFL) helps overcome performance and reliability issues associated with consensus protocols. The QuePaxa algorithm is an asynchronous consensus protocol that is on par with leader-based protocols. Said EPFL's Bryan Ford, &amp;quot;QuePaxa is just as fast, efficient, low latency, and low cost in terms of network bandwidth, under normal conditions” as widely deployed leader-based protocols. QuePaxa allows a second leader to help the first leader without interference, with the potential for a third leader to assist both of them. Additionally, QuePaxa can survive noisy networks, high communication delays, unpredictably varying network delays, and deliberate denial-of-service attacks.&amp;lt;ref&amp;gt; Tanya Petersen, ''A game changer for building robust distributed systems'' https://actu.epfl.ch/news/a-game-changer-for-building-robust-distributed-sys/&amp;lt;/ref&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;A distributed algorithm developed by researchers at Switzerland's Ecole Polytechnique Federale de Lausanne (EPFL) helps overcome performance and reliability issues associated with consensus protocols. The QuePaxa algorithm is an asynchronous consensus protocol that is on par with leader-based protocols. Said EPFL's Bryan Ford, &amp;quot;QuePaxa is just as fast, efficient, low latency, and low cost in terms of network bandwidth, under normal conditions” as widely deployed leader-based protocols. QuePaxa allows a second leader to help the first leader without interference, with the potential for a third leader to assist both of them. Additionally, QuePaxa can survive noisy networks, high communication delays, unpredictably varying network delays, and deliberate denial-of-service attacks.&amp;lt;ref&amp;gt; Tanya Petersen, ''A game changer for building robust distributed systems'' &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;EPFL News (2023-10-23) &lt;/ins&gt;https://actu.epfl.ch/news/a-game-changer-for-building-robust-distributed-sys/&amp;lt;/ref&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==References==&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==References==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[Category: Networking]]&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[Category: Networking]]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Tom</name></author>	</entry>

	<entry>
		<id>http://tcwiki.azurewebsites.net/index.php?title=Consensus_Protocols&amp;diff=18920&amp;oldid=prev</id>
		<title>Tom at 19:07, 25 October 2023</title>
		<link rel="alternate" type="text/html" href="http://tcwiki.azurewebsites.net/index.php?title=Consensus_Protocols&amp;diff=18920&amp;oldid=prev"/>
				<updated>2023-10-25T19:07:06Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='2' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='2' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 19:07, 25 October 2023&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot; &gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;==Full Title or Meme==&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;A distributed algorithm developed by researchers at Switzerland's Ecole Polytechnique Federale de Lausanne (EPFL) helps overcome performance and reliability issues associated with consensus protocols. The QuePaxa algorithm is an asynchronous consensus protocol that is on par with leader-based protocols. Said EPFL's Bryan Ford, &amp;quot;QuePaxa is just as fast, efficient, low latency, and low cost in terms of network bandwidth, under normal conditions” as widely deployed leader-based protocols. QuePaxa allows a second leader to help the first leader without interference, with the potential for a third leader to assist both of them. Additionally, QuePaxa can survive noisy networks, high communication delays, unpredictably varying network delays, and deliberate denial-of-service attacks.&amp;lt;ref&amp;gt; Tanya Petersen, ''A game changer for building robust distributed systems'' https://actu.epfl.ch/news/a-game-changer-for-building-robust-distributed-sys/&amp;lt;/ref&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;A distributed algorithm developed by researchers at Switzerland's Ecole Polytechnique Federale de Lausanne (EPFL) helps overcome performance and reliability issues associated with consensus protocols. The QuePaxa algorithm is an asynchronous consensus protocol that is on par with leader-based protocols. Said EPFL's Bryan Ford, &amp;quot;QuePaxa is just as fast, efficient, low latency, and low cost in terms of network bandwidth, under normal conditions” as widely deployed leader-based protocols. QuePaxa allows a second leader to help the first leader without interference, with the potential for a third leader to assist both of them. Additionally, QuePaxa can survive noisy networks, high communication delays, unpredictably varying network delays, and deliberate denial-of-service attacks.&amp;lt;ref&amp;gt; Tanya Petersen, ''A game changer for building robust distributed systems'' https://actu.epfl.ch/news/a-game-changer-for-building-robust-distributed-sys/&amp;lt;/ref&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;==References==&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category: Networking]]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Tom</name></author>	</entry>

	<entry>
		<id>http://tcwiki.azurewebsites.net/index.php?title=Consensus_Protocols&amp;diff=18919&amp;oldid=prev</id>
		<title>Tom: Created page with &quot;A distributed algorithm developed by researchers at Switzerland's Ecole Polytechnique Federale de Lausanne (EPFL) helps overcome performance and reliability issues associated...&quot;</title>
		<link rel="alternate" type="text/html" href="http://tcwiki.azurewebsites.net/index.php?title=Consensus_Protocols&amp;diff=18919&amp;oldid=prev"/>
				<updated>2023-10-25T19:05:29Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;A distributed algorithm developed by researchers at Switzerland&amp;#039;s Ecole Polytechnique Federale de Lausanne (EPFL) helps overcome performance and reliability issues associated...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;A distributed algorithm developed by researchers at Switzerland's Ecole Polytechnique Federale de Lausanne (EPFL) helps overcome performance and reliability issues associated with consensus protocols. The QuePaxa algorithm is an asynchronous consensus protocol that is on par with leader-based protocols. Said EPFL's Bryan Ford, &amp;quot;QuePaxa is just as fast, efficient, low latency, and low cost in terms of network bandwidth, under normal conditions” as widely deployed leader-based protocols. QuePaxa allows a second leader to help the first leader without interference, with the potential for a third leader to assist both of them. Additionally, QuePaxa can survive noisy networks, high communication delays, unpredictably varying network delays, and deliberate denial-of-service attacks.&amp;lt;ref&amp;gt; Tanya Petersen, ''A game changer for building robust distributed systems'' https://actu.epfl.ch/news/a-game-changer-for-building-robust-distributed-sys/&amp;lt;/ref&amp;gt;&lt;/div&gt;</summary>
		<author><name>Tom</name></author>	</entry>

	</feed>