<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Tue, 14 Apr 2026 12:40:56 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/pbft/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Lien Présentation pBFT]]></title><link>http://direct.ecency.com/hive-114606/@bahts/lien-presentation-pbft</link><guid isPermaLink="true">http://direct.ecency.com/hive-114606/@bahts/lien-presentation-pbft</guid><category><![CDATA[hive-114606]]></category><dc:creator><![CDATA[bahts]]></dc:creator><pubDate>Tue, 23 Nov 2021 15:13:03 GMT</pubDate></item><item><title><![CDATA[What is Klaytn (KLAY)?]]></title><description><![CDATA[The Klaytn platform was created by the developers of the Korean messaging and calling application Kakao Talk. The tasks of developing and updating the platform also belong to these developers. In a]]></description><link>http://direct.ecency.com/klaytn/@bonarousx/what-is-klaytn-klay</link><guid isPermaLink="true">http://direct.ecency.com/klaytn/@bonarousx/what-is-klaytn-klay</guid><category><![CDATA[klaytn]]></category><dc:creator><![CDATA[bonarousx]]></dc:creator><pubDate>Thu, 23 Sep 2021 12:45:21 GMT</pubDate><enclosure url="https://images.ecency.com/p/PB8ro82ZpZP35bVGjGoE93K3E4U5KX8KtMBJ2rhDdRT1vbA1XAcrtniTnrk6vnnbUvbcLWe96VK2J5KkPUNzb3KwZJ2myGES6rakEm5ZqbgnhocJ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[[Algorithm]Practical Byzantine Fault Tolerance(PBFT) 합의 알고리즘]]></title><description><![CDATA[비잔티움 장군 문제(Byzantine Generals Problem)가 발생할 수 있는 상황에서도 네트워크의 합의를 보장하는 알고리즘 비잔티움 장군 문제(Byzantine Generals Problem)란 비잔티움 제국군의 여러 부대가 지리적으로 떨어진 상태에서 각 부대의 장군들이 전령을 통해 교신하면서 공격 계획을 세울 때, 장군들 중에배신자가 있더라도 합의를]]></description><link>http://direct.ecency.com/consensusalgorithm/@covepark/algorithm-practical-byzantine-fault-tolerance-pbft</link><guid isPermaLink="true">http://direct.ecency.com/consensusalgorithm/@covepark/algorithm-practical-byzantine-fault-tolerance-pbft</guid><category><![CDATA[consensusalgorithm]]></category><dc:creator><![CDATA[covepark]]></dc:creator><pubDate>Tue, 03 Mar 2020 07:12:00 GMT</pubDate><enclosure url="https://images.ecency.com/p/D5zH9SyxCKd9GJ4T6rkBdeqZw1coQAaQyCUzUF4FozBvW7k14D4GwDTgEQbb6tk1kP4PeAyQGF1fMsWQ5UepLyX8oqWWbKmzYSgpzF9DE5hn9Ksw3RVBusww8sjJEj7GadjxLn?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[公链中的战斗机：交易所公链]]></title><description><![CDATA[公链篇 本文大概 7700字 阅读需要 8分钟 刚刚过去的五一假期，全国国内旅游接待总人数1.95亿人次，实现旅游收入1176.7亿元，这些成绩建立在一个基本的道理上，“要想富先修路”。路 - 就是基础设施； 在互联网时代，基础设施 - 就是通信协议层：TCP/IP、HTTP、SMTP、XMPP等等； 那么，区块链行业的基础设施，非公链莫属。而公链之中，要提到一个币圈香饽饽 -]]></description><link>http://direct.ecency.com/fcoin/@blockchainer-tmf/2fixuj</link><guid isPermaLink="true">http://direct.ecency.com/fcoin/@blockchainer-tmf/2fixuj</guid><category><![CDATA[fcoin]]></category><dc:creator><![CDATA[blockchainer-tmf]]></dc:creator><pubDate>Fri, 17 May 2019 16:31:33 GMT</pubDate><enclosure url="https://images.ecency.com/p/TZjG7hXReeVoAvXt2X6pMxYAb3q65xMju8wryWxKrsghkLp51Y3tx2PKSzMTakLNbj7jr3Q9bEvTpDwRhsd5pNeotuehLEq4Qd1qN77mcaXM3vZWR3Bi9NMXvikxiKXLtD5V1J7nxGpAdL?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[📨 Praktische Byzantinische Ausfallsicherheit (PBFT): So funktionieren Ripple, EOS, etc. im Kern]]></title><description><![CDATA[Ich erkläre euch wie praktische byzantinische Ausfallsicherheit (PBFT) funktioniert. PBFT ist ein Typ von Konsens-Verfahren bei dem die Liste der Teilnehmer vorab bekannt ist. Dabei akzeptiert jeder Teilnehmer]]></description><link>http://direct.ecency.com/dtube/@tschaul/2vistzj3</link><guid isPermaLink="true">http://direct.ecency.com/dtube/@tschaul/2vistzj3</guid><category><![CDATA[dtube]]></category><dc:creator><![CDATA[tschaul]]></dc:creator><pubDate>Thu, 28 Feb 2019 07:43:42 GMT</pubDate><enclosure url="https://images.ecency.com/p/46aP2QbqUqBqwzwxM6L1P6uLNceBDDCM6u8ECdHwLi6HXqMMPxUkt7kvMcZFoYsuM4sTmFkg6PhBqTTrqPToofJd7tWy?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[New Documents About "BOS IBC" and "Batch-PBFT" Released]]></title><link>http://direct.ecency.com/bos/@starteos/new-documents-of-bos-about-boc-ibc-and-batch-pbft-released</link><guid isPermaLink="true">http://direct.ecency.com/bos/@starteos/new-documents-of-bos-about-boc-ibc-and-batch-pbft-released</guid><category><![CDATA[bos]]></category><dc:creator><![CDATA[starteos]]></dc:creator><pubDate>Fri, 15 Feb 2019 09:36:39 GMT</pubDate><enclosure url="https://images.ecency.com/p/EEEoA8oLaAxsTkPYAARp78o5cJA1o6Chv9x98TzCFT6v5FpaykikzdX9hPRNaDgU9wmYaKbH1fy7DghVzMk9bEjsTUeJdhi576b5vFafBQqhWuudmZKdrYBc9VVbKrfz1DiuVPkYso96qBcLDLFmY?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[PBFT 논문을 읽고 있습니다.]]></title><description><![CDATA[안녕하세요 이더리움 코드보는 Sigmoid입니다. PBFT에 대해서 개념적으로는 알고 있었지만 논문을 읽어본적은 없어서, 이번 기회에 제대로 보다보니, 저도 모르게 번역을 하고 있네요. (해두면 좋을 만한 논문인것 같네요.) 논문을 읽으면서, 몇가지 눈에 띄는 포인트를 정리해 봅니다. PBFT는 합의냐? 비동기 네트워크의 비잔틴 장애에도 정확하게 생존 가능한]]></description><link>http://direct.ecency.com/pbft/@sigmoid/pbft</link><guid isPermaLink="true">http://direct.ecency.com/pbft/@sigmoid/pbft</guid><category><![CDATA[pbft]]></category><dc:creator><![CDATA[sigmoid]]></dc:creator><pubDate>Thu, 20 Dec 2018 14:38:18 GMT</pubDate><enclosure url="https://images.ecency.com/p/C3TZR1g81UNaPs7vzNXHueW5ZM76DSHWEY7onmfLxcK2iQHdhBcVJWmPCuzVhSUvZwg5ULzc1bAi1Giyvz34RCXts3ZgCVUuecZ3qi9G6vDPnhNV4Kw3esp?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[PBFT 核心概念以及基于 DPoS 的实现]]></title><description><![CDATA[众做周知, PBFT 是目前能够有效对抗拜占庭问题的算法之一, 使用 PBFT 意味着就算我们的系统中有 2/3 的节点有问题, 只要有 1/3 是好的, 那这个系统就依旧能正常运作. 最近需要在 DPoS 的基础上实现 PBFT 算法, 断断续续看了很久 PBFT 的论文, 提炼出在 DPoS 中需要注意的如下一些概念, 并分析在 DPoS 中如何实现 PBFT 的一些行为. 视图 整个分布式系统随时间往前推进,]]></description><link>http://direct.ecency.com/dpos/@cifer/pbft-dpos</link><guid isPermaLink="true">http://direct.ecency.com/dpos/@cifer/pbft-dpos</guid><category><![CDATA[dpos]]></category><dc:creator><![CDATA[cifer]]></dc:creator><pubDate>Sun, 18 Nov 2018 09:04:33 GMT</pubDate></item><item><title><![CDATA[[코인예수 블록바] 증명방식에 대하여 -2]]></title><description><![CDATA[안녕하세요. 코인예수 블록바입니다. 요즘에 생겨나는 블록체인 프로젝트들에서는 새로운 개념의 증명방식들이 생겨나고 있는데요, 이번 글에서는 조금 생소할 수 있는 내용들을 다루어보려고 합니다. 비트코인이나 이더리움, 퀀텀 등과 같은 가상화폐와 증명 방식들을 다르게 가져가는 친구들이 있어요. 저도 이러한 증명방식들을 접했을 때 좀 생소했기 때문에 제가 이해한 것을]]></description><link>http://direct.ecency.com/kr/@bitjesusblockba/2</link><guid isPermaLink="true">http://direct.ecency.com/kr/@bitjesusblockba/2</guid><category><![CDATA[kr]]></category><dc:creator><![CDATA[bitjesusblockba]]></dc:creator><pubDate>Tue, 03 Jul 2018 12:21:42 GMT</pubDate><enclosure url="https://images.ecency.com/p/99pyU5Ga1kwqSXWA2evTexn6YzPHotJF8R85JZsErvtTWXnqBKDYpYj8vUVkDavNFRq4TMjKB8M8YXwGze83th2HpkBFF4BYuXVQ19jWcie2ECv6tq7bj3RbEtgHkKKDBc?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[[케블리] #48. 합의 알고리즘 이해하기 - PBFT Consensus Algorithm]]></title><description><![CDATA[[그림1 - Consensus] 케블리 #44에서 합의 알고리즘 마스터하기 - PoW, PoS를 다루었습니다. PoW와 PoS 모두 블록체인이라는 분산 원장 시스템에서 노드 간 합의를 이루는 새로운 방법입니다. 특히 비트코인이 제시한 합의 알고리즘은 ‘Nakamoto Consensus’라고도 불릴 만큼, 종전 컴퓨터과학의 합의 알고리즘에서는 시도한 적 없던]]></description><link>http://direct.ecency.com/consensus/@kblock/48-pbft-consensus-algorithm</link><guid isPermaLink="true">http://direct.ecency.com/consensus/@kblock/48-pbft-consensus-algorithm</guid><category><![CDATA[consensus]]></category><dc:creator><![CDATA[kblock]]></dc:creator><pubDate>Mon, 02 Jul 2018 13:38:09 GMT</pubDate><enclosure url="https://images.ecency.com/p/2FFvzA2zeqoVJ2SVhDmmumdPfnVEcahMce9nMwwksSDdRvYaKRNb49P8M8ZwZZjHGYyXiTAbSkSvcGxmoLwDy8VQFgrn8vWJRnLaYmEQjJhMT9eHwRvyi2kHDz8Vk?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[EOS finality]]></title><description><![CDATA[Steemit produces block every 3 seconds. The last irreversible block (LIB) is found after 14 nodes (2/3 of 21) are built on top of it. So this takes roughly 3X14 = 42 seconds. This is similar to what he]]></description><link>http://direct.ecency.com/eos/@maxawei/eos-finality</link><guid isPermaLink="true">http://direct.ecency.com/eos/@maxawei/eos-finality</guid><category><![CDATA[eos]]></category><dc:creator><![CDATA[maxawei]]></dc:creator><pubDate>Sat, 09 Jun 2018 05:03:00 GMT</pubDate><enclosure url="https://images.ecency.com/p/S5Eokt4BcQdk7EHeT1aYjzebg2hC7hkthT45eBZcsZaJGYzjwiUjKE7Pqj7Zkxi9nMN5K1p?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[[Blockchain Study] PBFT(Practical Byzantine Fault Tolerance)]]></title><description><![CDATA[PoW, PoS, DPOS 등 다양한 합의 알고리즘(Consensus Algorithm)이 블록체인에 나오고 있는 현재, 또 다른 중요한 합의 알고리즘을 꼽으라고 한다면 당연 PBFT일 것이다. 텐더민트(Tendermint), 네오(Neo) 등에서 사용할 뿐만 아니라 IBM이 만든 Hyperledger와 R3에서도 합의 알고리즘으로 PBFT를 사용하고 있으니,]]></description><link>http://direct.ecency.com/crypto/@energist/blockchain-study-pbft-practical-byzantine-fault-tolerance</link><guid isPermaLink="true">http://direct.ecency.com/crypto/@energist/blockchain-study-pbft-practical-byzantine-fault-tolerance</guid><category><![CDATA[crypto]]></category><dc:creator><![CDATA[energist]]></dc:creator><pubDate>Sun, 08 Apr 2018 12:50:39 GMT</pubDate><enclosure url="https://images.ecency.com/p/2gsjgna1uruvUuS7ndh9YqVwYGPLVszbFLwwpAYXZBKUcDb5K2Tw8R8fifiz3fxZLxTbNwSTuZWjZtH2u9T3uQneCEmWKivoWzqvqL943x1cA72P2n?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[How it Works: High-Speed Super Large Ledger Technology]]></title><description><![CDATA[A workable framework for concurrent byzantine fault tolerance blockchains Public blockchains are great. The most famous ones like Bitcoin and Ethereum have sparked a global movement of furious innovation]]></description><link>http://direct.ecency.com/blockchain/@simoncheong/how-it-works-high-speed-super-large-ledger-technology</link><guid isPermaLink="true">http://direct.ecency.com/blockchain/@simoncheong/how-it-works-high-speed-super-large-ledger-technology</guid><category><![CDATA[blockchain]]></category><dc:creator><![CDATA[simoncheong]]></dc:creator><pubDate>Mon, 18 Sep 2017 17:16:36 GMT</pubDate><enclosure url="https://images.ecency.com/p/C3TZR1g81UNchGPKLQuxAL7oEwDJ42cT977qXjChaEPy9TMGhLEzGSVozRYwfgKJwznfaVfHBNjLbuE1ZdpYVFZdCBJNQYGt7uAZKv2RoNRZj3fJcp9nvyU?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>