<?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" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Lukas Kolisko on Medium]]></title>
        <description><![CDATA[Stories by Lukas Kolisko on Medium]]></description>
        <link>https://medium.com/@lkolisko?source=rss-86b31a38e345------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*lmD9dp2KMgaL8EG0.jpg</url>
            <title>Stories by Lukas Kolisko on Medium</title>
            <link>https://medium.com/@lkolisko?source=rss-86b31a38e345------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Thu, 19 Nov 2026 10:27:37 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@lkolisko/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Mining Crypto on Mobile Device]]></title>
            <link>https://medium.com/@lkolisko/mining-crypto-on-mobile-device-5512142b806b?source=rss-86b31a38e345------2</link>
            <guid isPermaLink="false">https://medium.com/p/5512142b806b</guid>
            <category><![CDATA[mining]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[mobile]]></category>
            <category><![CDATA[bitcoin]]></category>
            <dc:creator><![CDATA[Lukas Kolisko]]></dc:creator>
            <pubDate>Wed, 13 Jun 2018 10:34:51 GMT</pubDate>
            <atom:updated>2018-06-13T11:13:48.367Z</atom:updated>
            <content:encoded><![CDATA[<p><em>Recently I discussed the potential of mining or securing blockchain leveraging mobile devices. Although I was a skeptic to that, I am in the first place engineer, and researcher so tried to spend few more brain cycles on it and track it down.</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/400/0*ZEHHYbsoZVEoRxd3.jpg" /></figure><h3>Proof-of-Work</h3><p>PoW is sweet in the sense of full decentralization and minimal data transfer requirements. I did not find much data, but it seems Snapdragon 835 can do ~20 H/s through an in-browser miner. I am not sure if this has been hashcash, scrypt or ethash mining. My assumption is hashcash as scrypt and ethash depends on memory bandwidth (therefore GPUs are used). To compare Antminer S9 on scrypt gives 14.0 TH/s and modern GPUs for ethash are in ~40 MH/s.</p><p>If I would be generous and with optimizations be able to get it to 100H/s, 5W and 0.20 USD per kWh with 0% pool fee I am in loss 10 USD per year and likely much more due to inefficiencies.</p><p>Even if everyone on earth were mining on his mobile, they would be blown out of the water by a couple of ASICs or GPUs. I am not even talking about huge inefficiency. To put in in perspective, the ASICs and GPUs are not likely to be beaten by quantum computers in the next two decades. However, we don’t have to give up. There is Proof-of-Stake. 😉</p><h3>Proof-of-Stake</h3><p>If you would like to use mobile to participate PoS staking, you need to have the whole ledger. For Ethereum that means 1TB+ that is still out of reach. The final Casper implementation requires stakers to be up close to 24/7 to avoid losing part of your stake and take benefit of 5% income. Economically and technically is better to create an RPI3+ setup for &lt;50 USD.</p><h3>Proof-of-Authority</h3><p>If we put it in context of Identity bound to a mobile device, then Proof of Authority can come to our mind. It is computationally inexpensive. However, again similarly to PoS, you have to be online close to 24/7, and you have to keep the ledger, that is getting prohibitively large, and of course there is bandwidth requirement.</p><p><em>Note: Some sites tried to replace add revenues with embedding browser mining into their sites. The miners were leveraging “GPUs” through the browser APIs. Still, there were a lot of technical problems around that and income has been negligible compared to having adds on site.</em></p><p>Happy Blockchaining,<br> — Lukas</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5512142b806b" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Experimenting with Community Governance Model]]></title>
            <link>https://medium.com/@lkolisko/experimenting-with-community-governance-model-d6899b190d10?source=rss-86b31a38e345------2</link>
            <guid isPermaLink="false">https://medium.com/p/d6899b190d10</guid>
            <category><![CDATA[voting]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[community]]></category>
            <category><![CDATA[ethereum]]></category>
            <category><![CDATA[governance]]></category>
            <dc:creator><![CDATA[Lukas Kolisko]]></dc:creator>
            <pubDate>Fri, 25 May 2018 07:50:32 GMT</pubDate>
            <atom:updated>2018-05-25T07:56:02.233Z</atom:updated>
            <content:encoded><![CDATA[<p><strong>It is fascinating to see how initially a “quite technical thing” like blockchain generated global and diverse communities. It makes a step outside of the “technology box” now, trying to leverage the potential of modern technology and voting models to improve government its development.</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*qxZSIAi8bZdMlMYHVh-OgA.jpeg" /><figcaption>source: <a href="https://pixabay.com/en/hands-raised-raised-hands-arms-up-1768845/">https://pixabay.com/en/hands-raised-raised-hands-arms-up-1768845/</a></figcaption></figure><p>Recent Ethereum protocol’s decision-making process has been called in question after series of controversial proposals. Ethereum community leaders announced they are looking into finding better community governance models and teamed with Glen Weyl (co-author of “Radical Markets”). (see <a href="https://medium.com/@VitalikButerin/liberation-through-radical-decentralization-22fc4bedc2ac">Liberation Through Radical Decentralization</a>, <a href="https://www.coindesk.com/experimental-voting-effort-aims-break-ethereum-governance-gridlock/">Experimental Voting Effort Aims to Break Ethereum Governance Gridlock</a> ) .</p><p>One option on the table is implementing Quadratic Voting (<a href="https://en.wikipedia.org/wiki/Quadratic_voting">https://en.wikipedia.org/wiki/Quadratic_voting</a>). In this model, participants cast preference and intensity of preference for each decision (as opposed to a simple for or against decision). If a voter sees the decision as important for her, then she can buy more votes. Cost of buying many ballots becomes prohibited as the cost rises quadratically. The rise in the cost of votes mitigates manipulation of the process by “rich”. There is also an excellent example how QV could be applied to make decisions in your city <a href="http://www.slate.com/news-and-politics/2018/05/democrats-might-win-the-midterms-will-they-lose-the-future.html">http://www.slate.com/news-and-politics/2018/05/democrats-might-win-the-midterms-will-they-lose-the-future.html</a> .</p><p>Many aspects of such governance model can be put into question, e.g., handling sock-puppets and moving from pseudo-anonymity to known identities, side-games, and all the technical difficulties. But I believe good balance can be achieved and technology could solve some of these issues.</p><p>In any case, it will be fascinating to see how this works out in such diverse, emotional and opinionated communities around blockchain technology. I think this could be a great incubator before adopting similar models in public elections and decision-making process.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=d6899b190d10" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Recent Cryptocurrency Attacks Explained]]></title>
            <link>https://medium.com/@lkolisko/recent-cryptocurrency-attacks-explained-1cd756a12462?source=rss-86b31a38e345------2</link>
            <guid isPermaLink="false">https://medium.com/p/1cd756a12462</guid>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[cybercrime]]></category>
            <category><![CDATA[verge]]></category>
            <category><![CDATA[cyberattack]]></category>
            <category><![CDATA[bitcoin-gold]]></category>
            <dc:creator><![CDATA[Lukas Kolisko]]></dc:creator>
            <pubDate>Thu, 24 May 2018 09:30:46 GMT</pubDate>
            <atom:updated>2018-05-24T09:30:46.001Z</atom:updated>
            <content:encoded><![CDATA[<p>A few weeks ago I wrote a post on blockchain security and resiliency to different attack vectors “<a href="http://bit.ly/2KLSKnh">Is Bitcoin Prone To Double-Spending Problem?</a>”. Recently three attacks on major cryptocurrencies happened. Let’s have a look at details of these attacks.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*-ym079lraxCtpOzYRUaEfQ.jpeg" /></figure><p><strong>Bitcoin Gold (</strong><a href="https://coinmarketcap.com/currencies/bitcoin-gold/"><strong>BTG</strong></a><strong>)</strong></p><p>The BTG “Double Spend Attack” (leveraging 51% attack) attack ended on May 18, 2018 (<a href="http://bit.ly/2LrgyOz">http://bit.ly/2LrgyOz</a>). The Attacker reversed 22 blocks. BTG’s target blocktime is 10 minutes. Rewriting 22 blocks means the attack had majority hash power for 3.5 hours. Getting so much has power is expensive even on networks with small hash power behind, but it can be monetized through the “Double Spend Attack”. Blockchain normally prevents this including only one transaction of “coin” you would like to double spend. The attacker was able to reverse transactions leveraging its control over network and deposit the same “coin” multiple times on exchanges and wallets.</p><p><strong>Verge (</strong><a href="https://coinmarketcap.com/currencies/verge/"><strong>XVG</strong></a><strong>)</strong></p><p>XVG has been again under “Time Warp Modified Vector Attack”. The attacker utilized fake timestamps to lower PoW complexity by 99.9..% . Lowering complexity alone would still not be enough, because complexity is lower for all miners in the network. But the second part of the attack was that the complexity had been lowered just for scrypt and lyra2re (XVG is using 5 different algorithms). It made getting 51% much more manageable. Many legitimate blocks were invalidated. The attacker gained during the last attack around 35.000.000 XVG. An excellent explanation is available here <a href="http://bit.ly/2KNQvzQ">http://bit.ly/2KNQvzQ</a>.</p><p><strong>MonaCoin (</strong><a href="https://coinmarketcap.com/currencies/monacoin/"><strong>MONA</strong></a><strong>)</strong></p><p>MONA has been between May 13 and 15 under “selfish-miner” attack. The attacker was able to gain 57% of the network hash rate. The miner leveraged that to create a hidden chain of the public chain. Because the hidden branch had more PoW spent, it became the main chain after being broadcasted. Therefore any payment that happened between the fork of secret branch and tip of blockchain is reverted and has to be mined again and the door for double-spending attack is open.</p><h3>The take away from these stories is that any PoW based network is as secure as the amount of computational power behind it.</h3><p>Happy BLOCKCHAINING,<br> — Lukas</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=1cd756a12462" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Is Bitcoin Prone To Double-Spending Problem?]]></title>
            <link>https://medium.com/@lkolisko/is-bitcoin-prone-to-double-spending-problem-9c7c1995118c?source=rss-86b31a38e345------2</link>
            <guid isPermaLink="false">https://medium.com/p/9c7c1995118c</guid>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[money]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[cyberattack]]></category>
            <category><![CDATA[security]]></category>
            <dc:creator><![CDATA[Lukas Kolisko]]></dc:creator>
            <pubDate>Thu, 26 Apr 2018 10:50:07 GMT</pubDate>
            <atom:updated>2018-04-27T07:11:44.598Z</atom:updated>
            <content:encoded><![CDATA[<p><em>The key feature that made Bitcoin survive where its predecessors failed was the ability to solve the “double-spending” problem in the distributed-decentralized network on the global scale. But as with almost everything in life, the double-spending resiliency guarantee has limits.</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/595/0*X0SdIA1y-3Ob_97p.jpg" /></figure><p>There are multiple know attack vectors know for Bitcoin network like Race attack, Vector76 attack, Finney attack, Alternative history attack or well-known Majority (51% ) attack.</p><p>Race, Vector76, Finney and Alternative history attack vectors are significantly mitigated by waiting for more confirmations. For example, “Alternative history attack” in case the attacker controls 10% of hashing power available in the network is after six confirmations in the range &lt; 0.1%.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/668/1*kwmiDAeHeyhWeA10Zt5UsA.png" /></figure><p>The reason behind these attack vectors are possible is the property of <strong>“lottery-based”</strong> algorithms — e.g., Proof of Work in Bitcoin. The winner eligible to create new block is selected based on some “decentralized lottery” process . In Bitcoin by searching for a correct nonce to get hash of the mined block header lower than specific k (starting with certain number of zeros). The “k” here controls complexity of solving the “cryptographic riddle”. It is adjusted based on the actual computational power behind the network to set average block frequency to ~10 minutes.</p><p>What can happen there are multiple winners and therefore valid blocks sent to network at a virtually same time?</p><p>Valid blocks are accepted and appended to ledger by full nodes. The blockchain ledger is no longer linear list of blocks/transactions but starts to have branches. The ledger eventually converges back to single linear ledger by selecting the longest chain as the main chain and abandoning other branches. Transactions that appear only in branches are orphaned and get back to miner’s mempools.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*EG5qk_T3Oc9ErhecE17-iA.png" /><figcaption>based on: <a href="https://www.slideshare.net/ITU/blockchain-cryptography-and-consensus"><em>https://www.slideshare.net/ITU/blockchain-cryptography-and-consensus</em></a></figcaption></figure><p>If we are accepting bitcoin payments, then we are interested in a measure called latency to finality. Latency to finality is time to wait to get high enough probability, e.g., &lt; 0.1% that the transaction is not going to be reversed). In blockchains using lottery-based consensus algorithms is relatively high. E.g., in bitcoin six blocks with one block per ~10 minutes =&gt; ~1 hour.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*FWvGIVUzYdbck-Vs61WFjg.png" /></figure><p><strong>The finality of a transaction in blockchains using lottery-based consensus algorithms is a probabilistic measure. It is basically a function of a number of confirmations (or time)*.</strong></p><p>Such attack vectors do no apply to “<strong>voting based” </strong>algorithms like RBFT or BFT-SMaRt. The block getting enough votes (potentially through multiple rounds based on consensus algorithm) is finalized. Therefore the transaction is immediately finalized and cannot be reverted. The finality in voting-based consensus algorithms is not probabilistic function. The disadvantage is that these algorithms do not scale so well, because more information has to be exchanged during consensus.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*XCU6bImA-X0HIhXyb7u_hg.png" /><figcaption>based on: <a href="https://www.slideshare.net/ITU/blockchain-cryptography-and-consensus"><em>https://www.slideshare.net/ITU/blockchain-cryptography-and-consensus</em></a></figcaption></figure><p><strong>If you are accepting crypto payments for your services, then you have to understand the underlying platform and set your risk model accordingly. Trusting 0 confirmations is probably ok for a coffee payment, but might not be appropriate for if we talk about larger transfers of money.</strong></p><p>Happy block-chaining<br> — Lukas</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=9c7c1995118c" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Is blockchain headed in wrong direction?]]></title>
            <link>https://medium.com/@lkolisko/is-blockchain-headed-in-wrong-direction-eb4667529632?source=rss-86b31a38e345------2</link>
            <guid isPermaLink="false">https://medium.com/p/eb4667529632</guid>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[opinion]]></category>
            <category><![CDATA[distributed-ledgers]]></category>
            <category><![CDATA[future-technology]]></category>
            <dc:creator><![CDATA[Lukas Kolisko]]></dc:creator>
            <pubDate>Tue, 10 Apr 2018 08:36:41 GMT</pubDate>
            <atom:updated>2018-04-10T08:41:04.401Z</atom:updated>
            <content:encoded><![CDATA[<p><em>There is a lot of criticism about distributed ledger technology based on the argument that it is not solving any real-world problems better than current centralized systems of trust and therefore is headed in the wrong direction no matter what technological progress it makes. Is that true or we are ignoring some important facts?</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*0GCoJZFwRjGhDN_vqz8XgQ.jpeg" /></figure><p>My colleague pointed me to this article <a href="https://bit.ly/2GFw32m">https://bit.ly/2GFw32m</a>. The point author is trying to make about distributed ledger technology (DLT) is exactly in the way I described above. But are we really able to solve challenges introduced by the globalization of society and need for agreement of growing set of stakeholders effectively?</p><p><strong>The breakthrough made by Nakamoto and Bitcoin was solving Byzantine Fault Tolerance and therefore enabled creating reliable systems from unreliable parts on the internet scale (global human scale).</strong></p><p>We should not look on DLT as just another system of record technology. In the longer term, the goal is not to have just another system of record but to have a new platform to develop and run applications and exchange data.</p><p>Technologically it is much more significant leap then movement from on-premise to cloud. Trust is an expensive resource backed by centralized law enforncement and on international level frequently military power enforcement. Important property of DLT is an ability to implement processes where parties are not willing to trust each other and let one of them keep control. This is a significant issue in the world today with complex distributed processes where exchanging information is essential.</p><p>As we are moving to a world where our lives are more and more dependent on decisions made by technology like autonomous cars, smart cities that are driven by data collected from IoT networks such technology is needed to scale further.</p><p><strong>Reaching consensus has been always the cornerstone of functional and prosperous society. DLT is the technological solution addressing this on a global scale. The speed of processes in today worlds is accelerating exponentially. To scale further we need a technology that removes central points that are creating bottlenecks and inherently aggregate control which turns out to be dangerous in long-term.</strong></p><p>To address the concerns with real-world DLT use cases. With exponential progress in technological space, people just lost patience and are forgetting that maturing takes time and experience like in humans case.</p><p>— Lukas</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=eb4667529632" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[In-depth on differences between public, private and permissioned blockchains]]></title>
            <link>https://medium.com/@lkolisko/in-depth-on-differences-between-public-private-and-permissioned-blockchains-aff762f0ca24?source=rss-86b31a38e345------2</link>
            <guid isPermaLink="false">https://medium.com/p/aff762f0ca24</guid>
            <category><![CDATA[enterprise]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[business]]></category>
            <category><![CDATA[distributed-ledgers]]></category>
            <category><![CDATA[consensus]]></category>
            <dc:creator><![CDATA[Lukas Kolisko]]></dc:creator>
            <pubDate>Tue, 03 Apr 2018 10:23:03 GMT</pubDate>
            <atom:updated>2018-04-03T10:23:03.312Z</atom:updated>
            <content:encoded><![CDATA[<p>If you are looking into an application of blockchain or distributed ledger technology for business and enterprise blockchain solutions, then you have heard about private and permissioned blockchains. In this post, I will try to explain more in depth what are their properties, strengths, and weaknesses compared to the public blockchain solutions.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*IPEQSz1nJ7EbLz4dJzhKjg.png" /></figure><p>What public and private blockchains have in common?</p><ul><li>Both are decentralized peer-to-peer networks, where “each participant” maintains a replica of a shared append-only ledger of digitally signed transactions.</li><li>Both maintain the replicas in sync through a protocol referred to as consensus.</li><li>Both provide certain guarantees on the immutability of the ledger, even when some participants are faulty or malicious.</li></ul><p>In short both from the point of architecture and main properties provide what we understand under blockchain or more in general distributed ledger platform.</p><p>This leads to the more interesting question on what puts them apart. We could give a simple answer that the difference is in who is allowed to participate in the network, execute the consensus protocol and maintain the shared ledger. Such definition is correct, but a bit high level to understand the potential of private distributed ledger platforms besides of requiring authentication and authorization to access the blockchain.</p><p>Let’s start first with the typical enterprise customer requirements.</p><p><strong>Confidentiality</strong></p><p><em>Confidentiality is the measure of ensuring that only entities participating in a particular transaction will have knowledge and access to it.</em></p><p>In consortium networks where potential competitors are participating it is essential to enable blockchain channels between peers that are not visible to all members of a consortium. It is not just about data confidentiality that can be potentially hidden using cryptography or more advanced zero-knowledge proof schemes. Just insight into a number of transactions between peers in the consortium could bring competitive advantage, and this might not be desired.</p><p>Implementing this requirement is quite hard on many blockchain platforms because they follow order-execute architecture where every member of network executes transactions in a block to sync its state. Some of the private and permissioned blockchain solutions like Hyperledger enable implementing confidentiality leveraging different architecture (execute-order-validate) and natively supporting private channels on a shared blockchain infrastructure.</p><p><strong>Throughput</strong></p><p><em>Throughput is measure of number of transactions processed by by period of time. In blockchain context is average number of transactions appended to blockchain (within blocks) per second.</em></p><p>Current solutions built around relational or distributed databases can achieve throughput in tens of thousands transactions per second. You might argue that lower performance is an acceptable compromise compared to trust, immutability, etc.. However, the business process you might want to migrate to blockchain will likely have some throughput requirements that must be met.</p><p>Majority of public blockchains are in an entirely different ballroom in this regard. Private blockchains provide orders of magnitude higher throughput compared to most of the public blockchains because their consensus design does not have to include incentives for miners, identities of members proposing blocks are known, and therefore potentially loss of credibility works as the incentive. Scalability focuses on throughput rather than the number of nodes.</p><p><strong>Finality</strong></p><p><em>Finality measures how long one has to wait to be given a reasonable guarantee the transaction written in blockchain is irreversible (will not be orphaned).</em></p><p>This is again significant property for business. Need to wait one hour like on blockchain network is not acceptable for a lot of the business processes. Most of the public blockchain use lottery based algorithms to select a node to propose a new block. This scales well as minimal information has to be exchanged over a network to achieve consensus, but leads to chain forks in the network and therefore longer time to finality. <br>Most of the private blockchains, therefore, go for voting based consensus algorithms. The block is finalized when the majority of nodes vote for it. It brings virtually immediate finality in exchange for lower scalability as consensus requires more messages to be exchanged. This typically is not such a big issue for private blockchains because the number of participants is orders of magnitude lower and there are deployed in WANs with low latencies and guaranteed throughput compared to general internet environment.</p><p>Let’s take this into a single picture.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*HH1d22mqtWwlRTqOXawaoA.png" /></figure><p>The first important thing to understand that there is no strict border and different blockchains are positioned differently on the scale of validators anonymity and trust.<br>Public blockchain needs good scalability and strong resilience against malicious members along with an incentive model. This brings tradeoff in slow speed and high latency to finality along with the need of token to incentivize miners securing the network. The network is there as secure as the computational power behind it.<br>To address some of these weaknesses (especially energy consumption) Proof of Stake is being adopted by large-scale public blockchains like Ethereum. It improves speed and finality (still probabilistic because of the potential appearance of forks). It also increases resiliency against specific attack vectors but might suffer from “nothing at stake” and “rich get even richer” issues (nothing at stake being solved by slashing). Because these are public and permissionless native coin is included and economic model to safeguard the network is built in, and therefore some trade offs have to be made.</p><p>Much better fit for enterprise use cases are blockchains using BFT based consensus. In a semi-trustless environment where strong confidentiality is not a requirement, Federated BFT consensus (Ripple, Stelar) provides good performance and immediate finality thanks to voting. It also does not require a native token to prevent validators from malicious behavior.</p><p>If high confidentiality, transaction throughput, and immediate finality are required, then private permissioned blockchains are probably the best platform. The native token is not necessary as identities of participants are known and approved by notaries. Part of the blockchain security model is brought be the risk of losing identity credibility.</p><p>Private blockchain group includes different variants of BFT algorithms and also Proof-of-Authority available on Ethereum. In private blockchains, frequently requirement on resiliency against malicious behavior is lower. Therefore consensus can be designed without byzantine fault tolerance to achieve better throughput like Hyperledger Fabric using Kafka (still having the crash tolerance).</p><p>Different business cases have different requirements, and no solution would fit all the cases. Understanding properties of different platforms are vital to make the decision regarding blockchain platform and even evaluate if using blockchain to implement a business case make sense.</p><p><strong>Sources</strong></p><ul><li><a href="https://www.ibm.com/blogs/blockchain/2017/05/the-difference-between-public-and-private-blockchain">https://www.ibm.com/blogs/blockchain/2017/05/the-difference-between-public-and-private-blockchain</a></li><li><a href="https://medium.com/@pavelkravchenko/ok-i-need-a-blockchain-but-which-one-ca75c1e2100">https://medium.com/@pavelkravchenko/ok-i-need-a-blockchain-but-which-one-ca75c1e2100</a></li><li><a href="https://pdfs.semanticscholar.org/da8a/37b10bc1521a4d3de925d7ebc44bb606d740.pdf">https://pdfs.semanticscholar.org/da8a/37b10bc1521a4d3de925d7ebc44bb606d740.pdf</a></li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=aff762f0ca24" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Are We Mining or Betting on Blockchain?]]></title>
            <link>https://medium.com/@lkolisko/are-we-mining-or-betting-on-blockchain-4a81d4f44b69?source=rss-86b31a38e345------2</link>
            <guid isPermaLink="false">https://medium.com/p/4a81d4f44b69</guid>
            <category><![CDATA[proof-of-work]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[mining]]></category>
            <category><![CDATA[consensus]]></category>
            <dc:creator><![CDATA[Lukas Kolisko]]></dc:creator>
            <pubDate>Fri, 16 Mar 2018 08:54:28 GMT</pubDate>
            <atom:updated>2018-03-16T09:38:29.688Z</atom:updated>
            <content:encoded><![CDATA[<p><strong>Term betting describes the consensus process in a more general way and captures the probabilistic nature of consensus and distributed ledger state. Why I think so ? …</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*xqDb0YREEi67QUz9Tl5QsQ.jpeg" /><figcaption>Mining or Betting ?</figcaption></figure><p>The mining term comes from the fact that computers or better say nodes of blockchain network (e.g., bitcoin) perform a computationally expensive task. The network rewards them for that in bitcoin (or other cryptocurrencies). Like miners dig for expensive metals or diamonds. The reward is there to incentivize more miners to join the network and increase safety, security, and irreversibility of the shared ledger.</p><p><strong>Another way of looking on what happens is; Miners in PoW (bitcoin) are betting power consumption on winning the race for forging a new block. They are betting energy E on getting probability p to create a new block and get reward R. Validators in Proof of Stake are staking money on a valid block. State of the ledger is also final only up-to certain probability that with growing ledger should be reaching 100%.</strong></p><p><strong>We could refer to these processes as Consensus-By-Bet.</strong></p><p>I do not think mining will fade away any time soon when we are talking about blockchain. Also mining sounds more trustworthy then betting. However when talking technically about blockchain and consensus using the betting term might be a good way to grasp what happens behind the scenes.</p><p>Happy Block Chaining,<br> — Lukas</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=4a81d4f44b69" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Do we need mining in private and permissioned blockchains?]]></title>
            <link>https://medium.com/@lkolisko/do-we-need-mining-in-private-and-permissioned-blockchains-1a69b4c2c7a1?source=rss-86b31a38e345------2</link>
            <guid isPermaLink="false">https://medium.com/p/1a69b4c2c7a1</guid>
            <category><![CDATA[private-blockchain]]></category>
            <category><![CDATA[proof-of-work]]></category>
            <category><![CDATA[permissioned-blockchains]]></category>
            <category><![CDATA[mining]]></category>
            <category><![CDATA[blockchain]]></category>
            <dc:creator><![CDATA[Lukas Kolisko]]></dc:creator>
            <pubDate>Wed, 14 Mar 2018 13:09:03 GMT</pubDate>
            <atom:updated>2018-03-14T13:12:54.350Z</atom:updated>
            <content:encoded><![CDATA[<p>Talks on private and permissioned blockchains always raise the questions like.</p><blockquote><strong><em>“Where does the mining happen in private and permissioned blockchain?”</em></strong></blockquote><blockquote><strong><em>“How can a blockchain work without mining?”</em></strong></blockquote><p>The frequency of questions motivated me to write this post. I will try to explain what are differences between public, private and permissioned blockchains. Why do we have mining in public blockchain. And at the end hopefully give you answer about mining in the context of private and permissioned blockchains.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*eUHPF_-ywIZuvIKQvVI9Lg.jpeg" /></figure><p>Let’s first define what I mean by public, private and permissioned blockchains<em>*)</em>.</p><p><strong>What public, private and permissioned blockchains have in common ?</strong></p><ul><li>Decentralized peer-to-peer networks, where each participant maintains a replica of a shared append-only ledger of digitally signed transactions.</li><li>Maintain the replicas in sync through a protocol referred to as consensus.</li><li>Provide certain guarantees on the immutability of the ledger, even when some participants are faulty or malicious.</li></ul><p><strong>What are public, private and permissioned blockchains differences ?</strong></p><ul><li>Who is allowed to participate in the network, execute the consensus protocol and maintain the shared ledger.</li><li>Public blockchain network — Open, anyone can join and participate, has incentivizing mechanism to motivate participants to join.</li><li>Private blockchain network — Private deployment might use different consensus, typically does not need incentives for participants</li><li>Permissioned — Restrictions on who is allowed to participate in the network, and only in particular transaction</li></ul><p>Mining in public blockchains like bitcoin is part of the consensus protocol named Proof of Work. The word itself is connected with incentive given to miners in exchange for energy they spent to enhance stability, security and safety of the network. Lets look on these properties in more detail.</p><p><strong>Stability</strong></p><p>In bitcoin network, the average time to solve the puzzle by miners is set to 10 minutes (Litecoin ~2.5 minutes, Ethereum ~15 seconds). <strong>The probability that two or more miners will successfully solve the puzzle in about the same time and broadcast the new block into the network is proportional to the frequency new blocks are created*</strong>*). This goes against stability of network where we want to minimize chain forks.</p><p><strong>The longer average time to create a new block is, the higher probability transactions will reach all the nodes.</strong> It helps to increase the network stability preventing forks too.</p><p><strong>Safety and Security</strong><br>The second aspect of mining is to strengthen irreversibility of the transaction. Mining of new block requires energy to solve the puzzle.<strong> The transactions within blocks are guarded by all the energy spent on mining blocks before them.</strong> The older the block is, the lower is the probability it would be orphaned. The older the block is, then more energy would be required to modify the block. <em>***)</em></p><p><strong>Fairness</strong><br>Reward coming from coinbase transaction incentivizes members of the network (e.g., new bitcoins) and fees collected from transactions included in the forged block. <strong>The race for the block brings fairness about spreading the incentives between miners proportionally to the power they are spending to safeguard the blockchain.</strong> The fairness has also other benefits regarding decentralization and safety, but lest keep that apart for clarity now.</p><p>The Proof of Work provides high levels of security, safety, and irreversibility that is required in the anonymous public environment. The price for that is high energy costs and limits on transaction throughput.</p><p>Let’s evaluate the above mentioned properties in the private and restricted blockchain case.</p><p><strong>The number of nodes in a business network is typically an order of magnitudes lower, and there is usually direct network visibility.</strong> Therefore you do not need a big time windows to ensure transactions are spread through the whole network. <strong>Slowing down the creation of new blocks through PoW is not required or not to that level to achieve stability.</strong></p><p>In the permissioned and private blockchains, the identities of members are known. It is restricted who is allowed to participate in the network, execute the consensus protocol and maintain the shared ledger. <strong>There is typically no native token or incentives to motivate members to join and perform mining. Fairness required for distribution of incentives is not present at all.</strong></p><p>Because members are not anonymous and networks are usually not exposed to hostile public internet environment the <strong>requirements on cost of immutability are weaker. The blockchain does not have to be guarded by the enormous cost of energy. For immutability integrity through hash chain and replicas owned by different parties is usually sufficient.</strong></p><h3>Differences in the environment and known identity of network participants along with their defined roles removes the need for the high cost protection through the PoW mining. More emphasis is put on transaction throughput, fault tolerance, overall efficiency and restriction of access to the blockchain data and smart contracts<strong>.</strong></h3><p>This affects selection of the consensus algorithm (voting based are preferred) and enables achieve high transaction throughput without using side chains as “work-around” solution for the public blockchains.</p><p>*) Source <a href="https://www.ibm.com/blogs/blockchain/2017/05/the-difference-between-public-and-private-blockchain">https://www.ibm.com/blogs/blockchain/2017/05/the-difference-between-public-and-private-blockchain</a></p><p><em>**) The situation when one or more valid blocks appear is resolved by the “longest chain rule”. The longest chain (the one where most energy has been spent) takes the precedence and therefore network converges back to a single chain. The transactions from orphaned chains move back to miner mempools and are candidates for the next block.</em></p><p><em>***) In the bitcoin network, a transaction is considered safe if confirmed by six blocks. Creating a parallel chain with transactions in favor of attacker is expensive or close to impossible by all the energy needed to achieve that.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=1a69b4c2c7a1" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Zero-knowledge Proof for Dummies]]></title>
            <link>https://medium.com/@lkolisko/zero-knowledge-proof-for-dummies-5dbce67b967b?source=rss-86b31a38e345------2</link>
            <guid isPermaLink="false">https://medium.com/p/5dbce67b967b</guid>
            <category><![CDATA[eli5]]></category>
            <category><![CDATA[explanation]]></category>
            <category><![CDATA[zero-knowledge-proofs]]></category>
            <category><![CDATA[blockchain]]></category>
            <dc:creator><![CDATA[Lukas Kolisko]]></dc:creator>
            <pubDate>Tue, 27 Feb 2018 16:04:47 GMT</pubDate>
            <atom:updated>2018-02-27T16:04:47.824Z</atom:updated>
            <content:encoded><![CDATA[<p>The zero-knowledge term appears more frequently with the hype of blockchain. It is not a simple concept to understand. Therefore I will try to explain it here in layman terms using an example. The example is based on Quisquater and Guillou (Crypto 89) explanation.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/887/1*yiZnvxgr5z_RtsSxQTBq7w.png" /></figure><p>Imagine a shopping mall like on the picture with only one entrance and door in the middle that opens with a secret phrase. Angelina wants to convince Brad she knows the secret without revealing it. She enters the mall leaving Brad outside and picks randomly right or left route until she gets to the door. She calls Brad’s mobile to enter the mall too. Brad does not know if she went right or left. He calls her back and tells her left or right. Angelina can arrive from left or right based on the command from Brad using the door if needed. From now on we will refer to this as the protocol.</p><p>For the first time, Brad has only 50% confidence that Angelina knows the secret. However, they keep repeating the exercise n-times. If she does not know the secret, then she would be able to cheat Brad only with probability 2^(-n). Therefore Brad is constantly gaining confidence, that Angelina knows the secret.</p><p>Why can’t Angelina simply make a round from left to right or vice versa to convince Brad? The secret opening the door works only one way, and the whole point is to avoid revealing any other information than Angelina knows the secret. If Angelina would make round walk through the door, then it would be proof of knowledge and not the zero-knowledge proof.</p><p>Let’s assume Brad has a video camera to record the protocol. He throws a coin to pick right or left randomly. Jennifer and Justin would like to make a similar tape to fool Brad. They can do guessing the coin throw, and recording Jennifer walk down the guessed path. If they guessed wrong, then they would just rewind the video. Form both videos it must no be possible to tell who knows the secret and which version is staged. The point is if there is indistinguishable simulation possible, then Brad does not learn anything more from the protocol.</p><p>In more formal definition, the protocol has to have the following properties to be considered Zero-knowledge proof.</p><ol><li><strong>Security</strong> — Angelina’s impostor can comply with the protocol only overwhelmingly small probability.</li><li><strong>Completeness</strong> — If Angelina knows the secret, then she passes the test.</li><li><strong>Soundness</strong> — If an impostor can fool Brad, then there must be an alternative way between left and right and anybody can use it.</li><li><strong>Zero-Knowledge Property</strong> — It is possible to create a simulation based on recorded protocol (Jennifer and Justin tape in this case) that Brad is not able to distinguish that from real protocol he executed with Angelina.</li></ol><p>Hope my explanation helped you a bit to grasp the idea of Zero-Knowledge proof and what is the difference to knowledge-proof. I highly suggest to look around the internet for other examples (e.g., with Color balls… Angelina and colorblind Brad).</p><p>Sources</p><ul><li><a href="http://www.cse.scu.edu/~tschwarz/coen350/zkp.html">http://www.cse.scu.edu/~tschwarz/coen350/zkp.html</a></li><li><a href="https://en.wikipedia.org/wiki/Talk%3AZero-knowledge_proof">https://en.wikipedia.org/wiki/Talk%3AZero-knowledge_proof</a></li></ul><p>Happy Block Chaining!<br> — Lukas</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5dbce67b967b" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Tutorial Invoking Chaincode from Hyperledger Fabric Java SDK]]></title>
            <link>https://medium.com/@lkolisko/tutorial-invoking-chaincode-from-hyperledger-fabric-java-sdk-e8dea535a1be?source=rss-86b31a38e345------2</link>
            <guid isPermaLink="false">https://medium.com/p/e8dea535a1be</guid>
            <category><![CDATA[tutorial]]></category>
            <category><![CDATA[hyperledger]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[chaincode]]></category>
            <category><![CDATA[java]]></category>
            <dc:creator><![CDATA[Lukas Kolisko]]></dc:creator>
            <pubDate>Mon, 26 Feb 2018 16:13:01 GMT</pubDate>
            <atom:updated>2018-02-26T16:16:45.667Z</atom:updated>
            <content:encoded><![CDATA[<p>In the previous <a href="https://medium.com/@lkolisko/hyperledger-fabric-sdk-java-basics-tutorial-a67b2b898410">post</a> we learned how to do some basic interactions we fabric-ca and fabric using the fabric-sdk-java. In this post we will make one step further and actually invoke a chaincode.</p><p>The prerequisite is fabcar network up and running. If you do not have it, then please follow this tutorial <a href="http://hyperledger-fabric.readthedocs.io/en/release/write_first_app.html">http://hyperledger-fabric.readthedocs.io/en/release/write_first_app.html</a> .</p><p>The example code is available at <a href="https://github.com/lkolisko/scratch.git">https://github.com/lkolisko/scratch.git</a> .</p><h3>Development Environment</h3><ol><li>git clone <a href="https://github.com/lkolisko/scratch.git">https://github.com/lkolisko/scratch.git</a> demo2</li><li>cd demo2/hyperledger/fabric-sdk-java-scratch</li><li>… and open in your favorite IDE</li></ol><p>The tutorial is reusing some code explained in the previous <a href="https://medium.com/@lkolisko/hyperledger-fabric-sdk-java-basics-tutorial-a67b2b898410">post</a> . If you did not read that tutorial I highly suggest taking that exercise first.</p><p>Open lkolisko.hyperledger.example.HFJavaSDKChainCodeInvocationExample and let’s follow the code step by step.</p><h3>Initialization</h3><p>The initialization creates fabric-ca client and enrolls admin. This step is not necessary if you already have key-pair and certificate signed by the fabric-ca. Then we set admin user into the context and initialize channel object.</p><pre>HFCAClient caClient =<br>        <em>getHfCaClient</em>(<strong>&quot;http://localhost:7054&quot;</strong>, <strong>null</strong>);<br>AppUser user = <em>getAdmin</em>(caClient);<br>HFClient client = <em>getHfClient</em>();<br>client.setUserContext(user);<br>Channel channel = <em>getChannel</em>(client);</pre><p>An important step that must not be forgotten is registering the event hub.</p><pre><em>// initialize channel<br>// peer name and endpoint in fabcar network<br></em>Peer peer = client.newPeer(<strong>&quot;peer0.org1.example.com&quot;</strong>, <strong>&quot;grpc://localhost:7051&quot;</strong>);<br><em>// eventhub name and endpoint in fabcar network<br></em>EventHub eventHub = client.newEventHub(<strong>&quot;eventhub01&quot;</strong>, <strong>&quot;grpc://localhost:7053&quot;</strong>);<br><em>// orderer name and endpoint in fabcar network<br></em>Orderer orderer = client.newOrderer(<strong>&quot;orderer.example.com&quot;</strong>, <strong>&quot;grpc://localhost:7050&quot;</strong>);<br><em>// channel name in fabcar network<br></em>Channel channel = client.newChannel(<strong>&quot;mychannel&quot;</strong>);<br>channel.addPeer(peer);<br>channel.addEventHub(eventHub);<br>channel.addOrderer(orderer);<br>channel.initialize();<br><strong>return </strong>channel;</pre><p>This is required to handle transaction events coming back from fabric. If you forget to register event hub, then the code will wait until timeout on the event from the orderer.</p><pre>DEBUG Channel — Channel mychannel successful sent to Orderer transaction id: 9570f… </pre><h3>Invoking query for all cars</h3><p>The next step is invoking query for all cars. This is exactly the same as in the previous post, therefore I am not going to explain it here. The only difference is that we parse the JSON response and built map of CarRecord objects. We are using standard Json support of the JDK.</p><pre><em>// get channel instance from client<br></em>Channel channel = client.getChannel(<strong>&quot;mychannel&quot;</strong>);<br><em>// create chaincode request<br></em>QueryByChaincodeRequest qpr = client.newQueryProposalRequest();<br><em>// build cc id providing the chaincode name. Version is omitted here.<br></em>ChaincodeID fabcarCCId = ChaincodeID.<em>newBuilder</em>().setName(<strong>&quot;fabcar&quot;</strong>).build();<br>qpr.setChaincodeID(fabcarCCId);<br><em>// CC function to be called<br></em>qpr.setFcn(<strong>&quot;queryAllCars&quot;</strong>);<br>Collection&lt;ProposalResponse&gt; responses = channel.queryByChaincode(qpr);<br><strong>for </strong>(ProposalResponse response : responses) {<br>    <strong>if </strong>(response.isVerified() &amp;&amp; response.getStatus() == ChaincodeResponse.Status.<strong><em>SUCCESS</em></strong>) {<br>        ByteString payload = response.getProposalResponse().getResponse().getPayload();<br>        <strong>try </strong>(JsonReader jsonReader = Json.<em>createReader</em>(<strong>new </strong>ByteArrayInputStream(payload.toByteArray()))) {<br>            <em>// parse response<br>            </em>JsonArray arr = jsonReader.readArray();<br>            Map&lt;String, CarRecord&gt; cars = <strong>new </strong>HashMap&lt;&gt;();<br>            <strong>for </strong>(<strong>int </strong>i = 0; i &lt; arr.size(); i++) {<br>                JsonObject rec = arr.getJsonObject(i);<br>                CarRecord carRecord = <em>getCar</em>(rec);<br>                cars.put(carRecord.getKey(), carRecord);<br>            }<br>            <strong>return </strong>cars;<br>        }<br>    } <strong>else </strong>{<br>        <strong><em>log</em></strong>.error(<strong>&quot;response failed. status: &quot; </strong>+ response.getStatus().getStatus());<br>    }<br>}<br><strong>return </strong>Collections.<em>emptyMap</em>();</pre><h3>Invoking chaincode</h3><p>Now it finally gets interesting. We are going to add invoke the chaincode and add a new car record to the blockchain. The core is implemented in sendTransaction method. <br>We create TransactionProposalRequest that carries chaincode identifier, the function we would like to invoke and arguments for the function. We send the transaction proposal to the channel via sendTransactionProposal.</p><pre>TransactionProposalRequest tpr = client.newTransactionProposalRequest();<br>ChaincodeID cid = ChaincodeID.<em>newBuilder</em>().setName(<strong>&quot;fabcar&quot;</strong>).build();<br>tpr.setChaincodeID(cid);<br>tpr.setFcn(<strong>&quot;createCar&quot;</strong>);<br>tpr.setArgs(<strong>new </strong>String[]{<strong>&quot;CAR11&quot;</strong>, <strong>&quot;Skoda&quot;</strong>, <strong>&quot;MB1000&quot;</strong>, <strong>&quot;Yellow&quot;</strong>, <strong>&quot;Lukas&quot;</strong>});<br>Collection&lt;ProposalResponse&gt; responses = channel.sendTransactionProposal(tpr);<br>List&lt;ProposalResponse&gt; invalid = responses.stream().filter(r -&gt; r.isInvalid()).collect(Collectors.<em>toList</em>());<br><strong>if </strong>(!invalid.isEmpty()) {<br>    invalid.forEach(response -&gt; {<br>        <strong><em>log</em></strong>.error(response.getMessage());<br>    });<br>    <strong>throw new </strong>RuntimeException(<strong>&quot;invalid response(s) found&quot;</strong>);<br>}<br><strong>return </strong>channel.sendTransaction(responses);</pre><p>If all responses are fine, then we can proceed with sending the transaction to an orderer. This returns aCompletableFuture&lt;BlockEvent.TransactionEvent&gt; we can handle in our code.</p><p>For simplicity, we just request result with a timeout and verify that for validity. We managed to invoke our first chaincode !</p><pre>BlockEvent.TransactionEvent event = <em>sendTransaction</em>(client, channel).get(60, TimeUnit.<strong><em>SECONDS</em></strong>);<br><strong>if </strong>(event.isValid()) {<br>    <strong><em>log</em></strong>.info(<strong>&quot;Transacion tx: &quot; </strong>+ event.getTransactionID() + <strong>&quot; is completed.&quot;</strong>);<br>} <strong>else </strong>{<br>    <strong><em>log</em></strong>.error(<strong>&quot;Transaction tx: &quot; </strong>+ event.getTransactionID() + <strong>&quot; is invalid.&quot;</strong>);<br>}</pre><p>To verify the car is really store we call queryCar with key we passed in there.</p><pre>Channel channel = client.getChannel(<strong>&quot;mychannel&quot;</strong>);<br>QueryByChaincodeRequest qpr = client.newQueryProposalRequest();<br>ChaincodeID chainCodeId = ChaincodeID.<em>newBuilder</em>().setName(<strong>&quot;fabcar&quot;</strong>).build();<br>qpr.setChaincodeID(chainCodeId);<br>qpr.setFcn(<strong>&quot;queryCar&quot;</strong>);<br>qpr.setArgs(<strong>new </strong>String[]{key});</pre><pre>Collection&lt;ProposalResponse&gt; queryProposals = channel.queryByChaincode(qpr);<br>...</pre><p>There is really nothing new compared to queryAllCars to be explained. <br>Congratulations for having your first fabric chaincode invoked from fabric-sdk-java.</p><p><em>Note: In production code definitely deserves a better error handling and logging that has been omitted here for simplicity. So please do not try this at work!</em></p><p>Happy Chaining Blocks Together! <br> — Lukas</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=e8dea535a1be" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>