<?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 Till Antonio Mahler on Medium]]></title>
        <description><![CDATA[Stories by Till Antonio Mahler on Medium]]></description>
        <link>https://medium.com/@tillmahler?source=rss-1979c128cf83------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*L_dytrW3BUQQktmS.</url>
            <title>Stories by Till Antonio Mahler on Medium</title>
            <link>https://medium.com/@tillmahler?source=rss-1979c128cf83------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Tue, 17 Nov 2026 09:19:54 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@tillmahler/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[“Don’t talk about blockchain”]]></title>
            <link>https://medium.com/astratum/dont-talk-about-blockchain-d0e557ae02ab?source=rss-1979c128cf83------2</link>
            <guid isPermaLink="false">https://medium.com/p/d0e557ae02ab</guid>
            <dc:creator><![CDATA[Till Antonio Mahler]]></dc:creator>
            <pubDate>Wed, 24 Jul 2019 13:25:36 GMT</pubDate>
            <atom:updated>2019-07-24T13:29:14.064Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*lczzywdktj7eUj5ZG2gnOg@2x.jpeg" /></figure><p>Last week I had the pleasure of attending one of the more in-depth meetups in Berlin, which revolves around the decentralization paradigm and it’s potential ramifications propagated by blockchain technology. The event is called <a href="https://www.blockchainnights.com/">Blockchain Nights and is hosted by the Humboldt University</a> roughly every three months.</p><p>In this post we will take a look at all the different aspects that were touched upon in this meetup, which was titled “<strong>Stocks, Bonds and Real Estate — Security Tokens as Application Case</strong>“ and provide you with all the links to deep dive into the fascinating world behind each of them.</p><p>Now let’s get started!</p><h3>Empowerment with Smart Contracts</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*3sy-F0oyhRQnDSjMAreoaw.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/@helloquence?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Helloquence</a></figcaption></figure><p>First up as a speaker was Robert Muth, a research associate at the <em>Institute of Software Engineering and Theoretical Computer Science at the Technical University of Berlin</em>, who got started by describing the lack of trust we have nowadays when it comes to the intersection of political and technological spheres.</p><p>More precisely, he talked about two problems that he sees as emblematic — electronic voting and political promises.</p><p>Voting via electronic means is <a href="https://www.csoonline.com/article/3269297/online-voting-is-impossible-to-secure-so-why-are-some-governments-using-it.html">regarded as extremely dangerous</a> and not realizable by many experts, especially due to the fact that <a href="https://www.bloomberg.com/news/features/2018-10-04/the-big-hack-how-china-used-a-tiny-chip-to-infiltrate-america-s-top-companies">most electronic components can never be 100% fully secured</a>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*XDrIrXZ79ayxIk-ABqcwhg@2x.jpeg" /></figure><p>The example Muth gave, was the known issue with Russian election meddling and the larger angle of attack this would provide them with.</p><p>As for the political promises, he described how frequently the promises made by leading politicians aren’t being kept, for example when it comes to the infamous upload filter that the German government coalition didn’t want to introduce when writing their coalition agreement — nevertheless 2 years later, they were indeed voting in proposition for them in the European Union.</p><p>Muth sees a problem of trust at the core in both of his examples and how blockchains can potentially act as a filler in this void of trust. He then proceeded to present a Berlin based blockchain initiative called BBBlocksberg (a fun word game for the Germans).</p><p>With this project (for which there currently is unfortunately no online presence), he tries to bolster residential participation, empowerment through voting and innovative incentive systems with tokens.</p><h3>Adoption — Blockchain and Real Estate</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*-5wasdEeQrO-m2Ryx1hptw.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/@grantlemons?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Grant Lemons</a></figcaption></figure><p>Next on the speakers list was Gonzalo Sanchez Slik, the <em>Head of Business Development at Brickblock.</em></p><p><a href="https://www.brickblock.io/">Brickblock</a> started out with the ambition to tokenize real-estate assets, but eventually pivoted and are now all-in on real-estate funds.</p><p>Slik kicked of his presentation by describing several obstacles that he sees especially in the real-estate sector when it comes to blockchain technologies:</p><p>First of all, this industry is overall very <strong>conservative</strong>, with a long term focus and very risk averse attitude. This attitude leads to a very negative reaction when people from this industry first come into contact with blockchains through the “<strong>Bitcoin funnel</strong>” aka the appearance that everything blockchain IS Bitcoin and therefore volatile, scammy and not very trustworthy.</p><p>He went on to elaborate how the managers of these large real-estate funds also have a <strong>different understanding of time</strong>, as in that fast in their world might be a couple of months, while fast for the rest of us in the blockchain space has a completely different proportion. Last but not least, he explained the risk-averse attitude through the question he is often asked by the managers: “Why do we need you?”</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*h0zwgn4cYXBzkIrEAVitWQ@2x.jpeg" /></figure><p>After Slik talked about all these obstacles to blockchain adoption in the real-estate sector, he went on to present the solutions Brickblock has found and applied.</p><p>The first solution focused on the point that “<strong>you only need one yes</strong>”. This refers to the fact that quite often you only need one little stone to get a Domino-effect started, in Brickblocks case this happened to be Peakside Capital, which will start a €200 million heavy fund using their technology. The positive aspects of this will be a fast, automatic and secure execution of processes, in a transparent and reliable way.</p><p>In order to get the managers in this industry to fathom the potential efficiency gains and the way blockchains work, he said that it was essential to <strong>hold their hands</strong> and guide them slowly into this new technological realm.</p><p>His next point might be the most important one of all — <strong>don’t talk about blockchain. </strong>He elaborated this point and made it clear that quite often we, who we are in this fast moving and complex space, often tend to underestimate the huge lack of proper understanding what this technology is and where it’s great potential lies. In order to get ordinary people (without a computer science or advanced cryptographics degree) to embrace the technology and use it, it might just be best to have it work its magic under hood, without screaming “this is blockchain” into the world.</p><p>Last but not least Slik stressed the importance to present this new technological paradigm rather as a <strong>“just another tool”</strong>.</p><p><a href="https://blockgeeks.com/guides/blockchain-real-estate/">If you want to read more about the potential ramifications of blockchains in the real-estate industry, click right here</a>.</p><h3>Finance 4.0 — Sustainability Actions as Tokenized Asset</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Xkyr-y0AgzwgqzJIZ2LKDA.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/@blankerwahnsinn?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Fabian Blank</a></figcaption></figure><p>The next speaker was Mark Ballandies, a <em>research associate at the Institute of Computational Social Science at the ETH Zürich. </em>His talk revolved around the concept of <strong>Finance 4.0</strong>, a new holistic concept that tries to nudge people towards sustainable and healthy choices and actions using token-based incentive systems running on Distributed Ledger Technology (DLT) systems.</p><p>Ballandies calls this approach distributed sustainability and started his presentation showing us this video:</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2FoNlKdHjvExo%3Ffeature%3Doembed&amp;url=http%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DoNlKdHjvExo&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2FoNlKdHjvExo%2Fhqdefault.jpg&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/a2c7acc8c0dfd11d06735dae85ce1098/href">https://medium.com/media/a2c7acc8c0dfd11d06735dae85ce1098/href</a></iframe><p>Afterwards Ballandies elaborated on his reasoning to use DLT systems for the purpose of nudging people towards sustainable choices. By understanding the inherent workings of different tokenized systems, he created a taxonomy of tokens.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*e5kbPLsF8xwRYINPsjPtqg@2x.jpeg" /></figure><p>Looking at the conceptual architecture of prominent blockchains, such as Bitcoin or Ethereum, he pinpointed how it is the people that help finding consensus in these networks through employing their hardware (or staking their tokens), who benefit from the actions that are taken in these systems.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Yf-TVBR8pnFCuFP2pxnzlw@2x.jpeg" /></figure><p>His vision is to extend the rewards given out to not only the people who enable consensus in these networks, but also to reward positive behaviour in the real off-chain world. As described in the video, one could earn tokens for performing certain actions and then proceed to use those tokens for other goods or services.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*0zfkJKeTg6BfNGca07IKaw@2x.jpeg" /></figure><p>He went on to describe a couple of potential use cases for this new approach, such as supporting a time bank scheme for helping neighbors, elderly people, etc.</p><p><a href="https://futurict2.eu/why-and-how-we-are-using-blockchain-for-finance-4-0/">If you feel like reading more about this interesting new approach, be my guest.</a></p><h3>Translating the legal world into a smart contract: Applying Swiss law to the blockchain</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*ms3U_5M_VtmM1GhMwYPv_Q.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/@pichler_sebastian?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Sebastian Pichler</a></figcaption></figure><p>Up last was Samuel Brack, the <em>co-founder and COO </em>of a company called<em> </em><a href="https://blockstate.com/"><em>BlockState</em></a><em>.</em></p><p>Their project is building a platform for offering security tokens. These kind of tokens represent complete or fractional ownership of a physical asset (for example a barrel of oil, a diamond, or a stock in a company).</p><p>Using the Ethereum blockchain, Brack presented how they use the <a href="https://thesecuritytokenstandard.org/">token standard ERC1400</a> to create these security tokens.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*INtV8_eoScnIknKgZnpi-w@2x.jpeg" /></figure><p>Since <em>Blockstate </em>is located in Switzerland, there are a couple of very important legal aspects that they have to keep in mind, one of them being a very big risk from my personal point of view — Swiss law requires a company to be able to seize assets from their clients if needed.</p><p>Especially in blockchain context, this seems rather difficult to fit into the whole immutable ledger discourse. Brack calls this possible intervention <strong>“God mode”</strong> and defended it, saying that it leaves traces and therefore is somewhat transparent. I’m not too convinced though.</p><p>A very interesting aspect of his talk was the way they design their security token though. He pointed out that since the legal context is always prone to changes, this presents a potential problem when it comes to the smart contract that governs the security tokens. They therefore opted to design their security token in a way that only the transfer logic is an inherent part of the smart contract , and the complex business logic is constructed as an additional layer that can be changed.</p><p><a href="https://blockgeeks.com/guides/security-tokens-explained/">If you want to deep dive into the world of security tokens, just click right here.</a></p><p>This interesting meetup ended with a panel discussion revolving around the possible implications of the automation of law, which was hotly debated.</p><p>I hope you’ve enjoyed this brief recap of this interesting meetup, if you have any questions, remarks or feedback, feel free to let me know.</p><p>All the best</p><p>Till</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=d0e557ae02ab" width="1" height="1" alt=""><hr><p><a href="https://medium.com/astratum/dont-talk-about-blockchain-d0e557ae02ab">“Don’t talk about blockchain”</a> was originally published in <a href="https://medium.com/astratum">ASTRATUM</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[The Best Newsletters That Help You Understand The Cryptoverse]]></title>
            <link>https://medium.com/thecapital/the-best-newsletters-that-help-you-understand-the-cryptoverse-5f2bb6f2de58?source=rss-1979c128cf83------2</link>
            <guid isPermaLink="false">https://medium.com/p/5f2bb6f2de58</guid>
            <category><![CDATA[ethereum]]></category>
            <category><![CDATA[newsletter]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[blockchain]]></category>
            <dc:creator><![CDATA[Till Antonio Mahler]]></dc:creator>
            <pubDate>Sun, 10 Feb 2019 09:44:37 GMT</pubDate>
            <atom:updated>2019-02-10T09:44:37.945Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/800/1*NVqSCRunGeHLAdkeVzZTMw.png" /></figure><h4>By <a href="https://medium.com/@tillmahler">Till Antonio Mahler</a> on <a href="https://medium.com/altcoin-magazine?source=logo-4c740d51d3f2---c4037b4d8519">ALTCOIN MAGAZINE</a></h4><p>Hello there, lovely to have you here!</p><p>Time is flying by, January is already laying behind us, and things tend to move at a crazy pace anyways in this mysterious cryptoverse of ours.</p><p>Today I’d love to share with you some of the best newsletters, that can help you greatly to grasp the fast-moving blockchain space and keep a clear overview of what’s happening.</p><p>The newsletter presented below represents a good mixture of insights on new projects, opinion pieces, commentary, as well as through technical deep dives from time to time.</p><p>Ready? Then let’s dive right in.</p><h3>Token Economy</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/831/0*F-vmcJM02R1yMglq" /><figcaption><a href="https://storage.googleapis.com/hotlinks-f6004.appspot.com/token-economy.jpg">Source</a></figcaption></figure><p>First up is a wonderful newsletter that goes by the name of <strong>Token Economy</strong>.</p><p>Written by Stefano Bernardi and Yannick Roux, they focus on a great selection of rather longer and in-depth pieces, which they annotate with some remarks of their own. It’s a great way to be on top of the latest opinion pieces about the fast-paced blockchain space and is always a treasure trove of high-quality content and intriguing insights!</p><p>The newsletter is published in a weekly cycle and always also includes the latest information on new and noteworthy projects.</p><p>I highly recommend you this little gem — of course it’s completely free of charge (all the others as well)!</p><p><a href="http://weekly.tokeneconomy.co/">To learn more about this newsletter and to sign up, just click right here.</a></p><h3>MIT Chain Letter</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*TOnnCBZAFvfmDFd7" /><figcaption><a href="https://go.technologyreview.com/hubfs/social_chainletter-2.png#">Source</a></figcaption></figure><p>Next up is a marvelous newsletter published by the Massachusetts Institute of Technology (MIT), named <strong>Chain Letter.</strong></p><p>Sent out every couple of days or so, it provides you with a brief overview of the biggest and the most important stories in the blockchain world. It’s easily digestible and a great way of staying on top of the bigger context. They always end their newsletter with a section called <em>“Loose Change”, </em>where they collect a lot of super interesting newsy tidbits.</p><p>I highly recommend this newsletter — <a href="https://go.technologyreview.com/newsletters/chain-letter/">if you want to read more about it and sign up for it, click right here.</a></p><h3>Blockchain Weekly</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/774/0*Ony55Spz-S4OMCJp" /><figcaption><a href="https://blockchainweekly.net/">Source</a></figcaption></figure><p><strong>Blockchain Weekly</strong> is a great newsletter that is published — surprise, surprise — every week.</p><p>This newsletter is aimed more at people who already have an established understanding of blockchain technology and is more of a round-up of the plethora of things happening in all corners of the cryptoverse.</p><p>If you’re interested in staying on top of the game when it comes to developments all around the blockchain space, this is the newsletter that is made just for you.</p><p><a href="https://blockchainweekly.net/">To read more about this and to sign up, click right here.</a></p><h3>Extra: Exponential view</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*WWzcI_mm1CcMuJo-" /></figure><p>As a little cherry on top, I’d love to introduce you to a truly marvelous newsletter, that goes by the name of <strong>Exponential View.</strong></p><p>While not focused on blockchains primarily, it’s a treasure trove of indulging yourself into great curated articles that take you to the innovative edge of the emerging technologies all around us and their ramifications.</p><p>It’s an awesome newsletter that explores the world of tomorrow, through the most relevant technological advancements in a myriad of fields today!</p><p>Definitely a great way for a complementary approach, in order to understand the greater context in which blockchain technology is developing and takes place.</p><p><a href="http://www.exponentialview.co/">To read more about it and to sign up, just click here.</a></p><p>If you’re interested in more awesome resources to enhance your knowledge about blockchain, <a href="https://medium.com/blockwhat/blockwhat-blockchain-781a47b34306">I’d love to humbly invite you to check out <em>blockwhat?</em></a>, where I explore the history behind blockchains, their technological fabric, actual use cases and also provide reviews about helpful resources to thoroughly understand this fascinating new technological paradigm.</p><p>Yours truly</p><p>Till</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*7faPAwQ92KPl911N9VHBUw.jpeg" /></figure><p>Follow us on <a href="https://twitter.com/Alt__Magazine">Twitter</a>, <a href="https://www.investfeed.com/Altcoinmagazine?rec=90e98ef">InvestFeed</a>, <a href="https://www.facebook.com/Altcoin-Magazine-302454903822750/">Facebook</a>, <a href="https://www.instagram.com/altcoin_magazine/">Instagram</a>, <a href="https://www.linkedin.com/company/altcoin-magazine/">LinkedIn</a>, and join our <a href="https://discord.gg/DkwPvH5">Discord</a> and <a href="https://t.me/AltcoinMagazine">Telegram</a>.</p><p>Read about our upcoming Altcoin Magazine Mastermind Event <a href="https://altcoinmagazinemastermindevent.eventbrite.com/">here</a>.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5f2bb6f2de58" width="1" height="1" alt=""><hr><p><a href="https://medium.com/thecapital/the-best-newsletters-that-help-you-understand-the-cryptoverse-5f2bb6f2de58">The Best Newsletters That Help You Understand The Cryptoverse</a> was originally published in <a href="https://medium.com/thecapital">The Capital</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Finding Consensus 4/4: Alternative Consensus Mechanisms]]></title>
            <link>https://medium.com/blockwhat/finding-consensus-4-4-alternative-consensus-mechanisms-3b8817bd6d57?source=rss-1979c128cf83------2</link>
            <guid isPermaLink="false">https://medium.com/p/3b8817bd6d57</guid>
            <category><![CDATA[consensus]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[blockchain]]></category>
            <dc:creator><![CDATA[Till Antonio Mahler]]></dc:creator>
            <pubDate>Wed, 06 Feb 2019 15:06:15 GMT</pubDate>
            <atom:updated>2019-02-06T15:06:15.631Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*UfT4YNfW-t-Zz83U4OukTg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/_Y-8SdEn-WI?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Serge Kutuzov</a></figcaption></figure><p>Welcome here at <a href="https://medium.com/blockwhat/blockwhat-blockchain-781a47b34306"><em>blockwhat?</em></a> dear reader, I’m very happy you’ve made it here and hope that you’ll enjoy this post, which wraps up our exploration of <em>Finding Consensus</em> for now.</p><p>After having thoroughly looked into the most popular consensus mechanisms in the last couple of posts, we will expand our view today and see what kind of alternative and innovative ideas are floating around in this fabulous blockchain world of ours.</p><p>Join me in exploring six interesting and novel ideas, such as <em>Proof of Elapsed Time, Proof of Capacity, Proof of Burn, Proof of Authority, Proof of Importance</em> and as a little extra cherry on top, we’ll briefly look at <em>Directed Acyclic Graphs</em>.</p><p>Let’s get started, it’s going to be a captivating read!</p><p>This article is part nine of our journey into the technological foundations of blockchain technology.</p><p><a href="https://medium.com/blockwhat/blockwhat-but-why-7b3c08687f3">If you’re new here and want to understand what’s going on, just click here</a>.</p><ol><li><a href="https://medium.com/blockwhat/the-tech-behind-blockchains-6076d38d1490">The Tech Behind Blockchains</a></li><li><a href="https://medium.com/blockwhat/decentralized-c5a7a6ba5aab">A Journey Into Decentralization</a></li><li><a href="https://medium.com/blockwhat/hash-ing-everywhere-a-primer-on-hash-functions-24cdf43515d7">Hash(ing) Everywhere — A Primer On Hash Functions</a></li><li><a href="https://medium.com/blockwhat/public-key-cryptography-a-comprehensive-guide-1e8489e08104">Public Key Encryption — A Comprehensive Guide</a></li><li><a href="https://medium.com/blockwhat/merkle-trees-ensuring-integrity-on-blockchains-508d6647d58e">Merkle Trees — Ensuring Integrity On Blockchains</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c">Finding Consensus 1/4: Byzantine Fault Tolerance</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343">Finding Consensus 2/4: Proof Of Work</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75">Finding Consensus 3/4: Proof Of Stake</a></li><li>Finding Consensus 4/4: Alternative Consensus Mechanisms (This article)</li><li>Blockchain Networks &amp; Their Components — A Comprehensive Guide</li></ol><p><a href="https://medium.com/altcoin-magazine/a-brief-prehistory-of-blockchain-957bcd45604c">If you’re interested in exploring the fascinating history behind blockchain, click right here and go down the rabbit hole.</a></p><h3>Introduction</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Mm0UwdsicwbYufTBamWXOw.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/2x19-mRQgX8?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Josh Boot</a></figcaption></figure><p>As we’ve seen extensively in the last couple of posts about <a href="https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c"><em>Byzantine Fault Tolerance</em></a>, <a href="https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343"><em>Proof of Work (PoW)</em></a><em> </em>and <a href="https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75"><em>Proof of Stake (PoS)</em></a>, finding consensus in a decentralized system tends to be a rather tricky and difficult affair.</p><p>While <em>PoW</em> and <em>PoS </em>are the most widely used consensus mechanisms in the existing blockchain systems, there are many shortcomings and disadvantages associated with both of them:</p><p>Due to the inherent high amount of computational power that is required in order solve the cryptographic puzzle that lays at the heart of <strong>Proof of Work</strong> algorithms, the energy consumption is immense. This has of course an environmental impact, that is quite often heavily criticized — yet, many supporters argue that this energy intensive process is also one of the strong suits of <em>PoW</em>.</p><p>Another issue associated with <em>PoW</em> is the rather low scalability, at least at the base layer (<a href="https://medium.com/coinmonks/understanding-cryptocurrency-transaction-speeds-f9731fd93cb3">not accounting for second layer solutions like the Lightning Network</a>) — Bitcoin is currently processing about 7 transactions per second and Ethereum about 25 transactions per second — Visa is estimated being able to handle about 25.000 transactions per second!</p><p><a href="https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343">Finding Consensus 2/4: Proof Of Work</a></p><p>When it comes to <strong>Proof of Stake</strong>, many critiques hover around the aspect that the <em>“rich get richer”</em> and other issues, such as the <em>“nothing at stake”</em> or <em>“long range”</em> problem.</p><p><a href="https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75">Finding Consensus 3/4: Proof Of Stake</a></p><p>Due to these limitations, many smart people came up with a lot of interesting alternatives during the last couple of years.</p><p>Without any further ado, let’s take a look at some of the most prominent ones.</p><h3>Proof of Elapsed Time</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*vzWzeHIePfOxPdexHmrjVg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/BXOXnQ26B7o?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Aron Visuals</a></figcaption></figure><p>The first alternative consensus mechanism that we’ll look into is called <strong>Proof of Elapsed Time.</strong></p><p>This concept was developed by Intel in 2016 and is mainly applied to permissioned blockchain systems — these are blockchains that are not open to the public, where the participants are known and need to identify themselves to the network. Due to this special nature of permissioned systems there is no need to have a cryptocurrency involved, since they normally serve an essential role in creating financial incentives for honest and integer behavior in networks, where the participants don’t know each other.</p><p>Intel’s idea revolves around the use of their proprietary <a href="https://en.wikipedia.org/wiki/Software_Guard_Extensions"><em>Software Guard Extensions</em> (SGX)</a> programming reference manual. What this behemoth of words is describing, is basically a way of providing a secure enclave to developers to protect sensitive data.</p><p>This works by creating a so-called <em>Trusted Execution Environment</em>, which ensures that unwanted access is not possible, even when having physical access to the chip.</p><p>Based on these properties, Intel came up with their novel consensus mechanism <em>Proof of Elapsed Time. </em>In order to take part in a blockchain utilizing this mechanism, users have to identify themselves to the network and prove that they are running a SGX.</p><p>In order to be eligible to validate a block, each computer takes part in a lottery-style scheme where an internal randomized timer system assigns a random timer to each participating computer. The first timer to wake up then gets the right to validate the next block.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*PJ1BqrMWyOEW3c73O5N4YQ.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/w2JtIQQXoRU?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">insung yoon</a></figcaption></figure><p>This special take on figuring out collectively who gets to validate the next block leads to it being a highly efficient approach, that isn’t very resource intensive.</p><p>There is one downside to this though — users need to trust Intel, an intermediary, who is the only entity manufacturing those chips. This can be somewhat tricky, since we saw some vulnerabilities being <a href="https://en.wikipedia.org/wiki/Spectre_(security_vulnerability)">exposed as part of the <em>Spectre</em> issue</a>.</p><p><em>Proof of Elapsed Time</em> is currently used by <a href="https://www.investopedia.com/terms/h/hyperledger-sawtooth.asp">Hyperledger Sawtooth</a>, a blockchain developed for enterprise solutions by the Linux Foundation.</p><p>If you want to read more about this consensus method, <a href="https://blockonomi.com/proof-of-elapsed-time-consensus/">just click here</a>.</p><h3>Proof of Capacity</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*bkJzceh1iCg1rJ6Dg8BUqQ.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/1iVKwElWrPA?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Patrick Lindenberg</a></figcaption></figure><p>Next up we will look at the <strong>Proof of Capacity</strong>, which was first developed as a “green” alternative to <em>Proof of Work</em> by the <a href="https://www.burst-coin.org/proof-of-capacity">cryptocurrency project Burst</a> in the summer 2014.</p><p>In order to cut down on the energy-intensive process of repeatedly finding hashes in a cryptographic mining race, Burst chose another approach. Instead of actively mine during the validation process, all the mining is done in advance and only once.</p><p>This process is called <strong>plotting</strong> and it works as follows: the mining is done on a harddrive in advance and creates unique plot files. Compared to Bitcoin’s <em>Proof of Work</em>, this mining is also requiring more computational power, since they use the <a href="https://en.bitcoinwiki.org/wiki/SHABAL">Shabal hashing algorithm</a>.</p><p>Once these plot files have been generated, the software calculates a so-called <strong>scoop number</strong>. The resulting number represents a “deadline” or a timer and refers to the amount of time that has to pass since the last block before you can create a new one. Therefore the harddrive that has the shortest “deadline” in the network gets to create a new block and receives the financial reward.</p><p>You can imagine this system like a lottery system. The plot files are like lottery tickets — a random number is then generated and the one who has the most matching numbers wins. But instead of losing your lottery tickets in the next round you actually get to keep them!</p><p>Even though more computational work is needed in the beginning to create all the plot files, this is a one-time only expense, which makes it way more energy efficient that <em>Proof of Work</em>. Also there is no special hardware needed, <a href="https://en.wikipedia.org/wiki/Application-specific_integrated_circuit">like ASIC chips</a>, in order to successfully participate in the mining process, which leads to a lower barrier to entry for new users.</p><p>If you want a more in-depth explanation of this alternative consensus mechanism, <a href="https://hackernoon.com/burst-part-3-proof-of-capacity-the-green-alternative-8e2651211671">be my guest</a>.</p><h3>Proof of Burn</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*G8PDz0e8ACPaYwVkAdwvPQ.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/7iatBuqFvY0?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Yaoqi LAI</a></figcaption></figure><p>Another (fiery) alternative is known as <strong>Proof of Burn</strong>, which was conceived originally by Ian Stewart and is often dubbed as “<em>Proof of Work </em>without the energy waste”.</p><p>Burning coins is a terminology that refers to making coins unusable — for example when they end up at an address that is not usable anymore (because the private key has been lost).</p><p>Normally, in order to successfully participate in a <em>Proof of Work</em> based consensus mechanism, users have to invest money and energy into acquiring specialized hardware and to build so-called <a href="https://www.forbes.com/sites/jasonevangelho/2018/03/13/mining-101-what-exactly-is-cryptocurrency-mining/">mining rigs</a>.</p><p>The basic idea of <em>Proof of Burn</em> is to create a “virtual mining rig”, where the coins that are being burned represent an investment into those. The more coins are burned, the bigger the virtual mining rig and therefore the higher the chance of being selected as a block validator.</p><p>In the context of this consensus mechanism, the coins need to be send to a <strong>verifiably unspendable address</strong>, also known as “<em>eater adress” </em>— these are randomly generated addresses with no associated private key.</p><p>By creating a short term loss for a long term investment, the idea is to promote a long lasting involvement of the users. This is supposed to lead to a greater price stability, as investors are unlikely to sell or spend their coins. They are rewarded over time and can earn lifetime privileges to mine on the system. Most systems support regular activity by giving more weight to recently burned coins.</p><p>Yet, critics argue that the resources used to generate the burnt coins is wasted and that the “rich gets richer” problem that is often associated with <em>Proof of Stake</em> applies here as well.</p><p>At the moment, <em>Proof of Burn</em> is often used as a complimentary mechanism to <em>PoW/PoS</em>, or when moving from one cryptocurrency to another within one system. One project that is utilizing <em>Proof of Burn </em>is <a href="http://slimco.in/proof-of-burn-guide/">Slim Coin</a>.</p><p>If you look for more information on this consensus mechanism <a href="https://blockonomi.com/proof-of-burn/">click here</a> or <a href="https://www.coinbureau.com/education/proof-of-burn-explained/">here</a>.</p><h3>Proof of Authority</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*9-8xPocLU9TE3wocC8XwBA.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/QozzJpFZ2lg?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Markus Spiske</a></figcaption></figure><p>In 2017, Gavin Wood (one of the founders of Ethereum &amp; Parity) proposed a vastly different alternative to the privacy-focused consensus mechanism before and named it <strong>Proof of Authority.</strong></p><p>It can be seen as an optimized <em>Proof of Stake </em>model, but instead of staking coins, it uses <strong>real identity. </strong>On a side note, it’s important to know that this alternative mechanism is mostly used for permissioned blockchains!</p><p>So what’s the whole backstory to this idea?</p><p>Well, it turns out that in blockchain systems, the stake that people hold of a specific cryptocurrency can have a wildly different value for the different people participating in it. Imagine Tfor example a situation in which you own 100 Bitcoin and no other coins — Alice also has 100 Bitcoins, but this only represents a small percentage of her holdings, since she also owns a lot of Ethereum, <a href="https://dogecoin.com/">Dodgecoin</a> and <a href="https://jesuscoin.today/">Jesuscoin</a>.</p><p>Due to this different perceived value of the Bitcoins that they own as part of their overall portfolio, they can have very different approaches when it comes to governance and to their overall attitude towards the development of the system.</p><p><em>Proof of Authority</em> therefore tries to establish a system in which a group of trusted validators ensures a fair and integer maintenance of the network — by bringing real social reputation into the mix.</p><p>This idea works by limiting the right to validate blocks to a group of pre-approved participants. In order to create this illustrious circle, there are three requirements that have to be met:</p><ol><li><em>The identities of the validators need to be formally identified on-chain, as well as off-chain (for example through a public database);</em></li><li><em>It needs to be difficult to become a validator — this ensures long-term commitment, since financial and social reputation are at stake;</em></li><li><em>There must be complete uniformity in the process, so it’s transparent to the rest of the system.</em></li></ol><p>Once somebody passed the rigorous process and becomes a validator, they can now take part in the validation process and receive the financial rewards associated with it. Should they act in a malicious way, they can be easily removed through a governance process.</p><p>The advantages of this consensus mechanism is the low computational power that is required, as well the low level of communication needed between nodes in order to reach consensus. Due to the characteristic that the different validators have their real social reputation at stake, it also doesn’t matter if the number of nodes fluctuates slightly.</p><blockquote>“It takes 20 years to build a reputation and 5 minutes to ruin it. If you think about that, you’ll do things differently.”</blockquote><blockquote>- Warren Buffet</blockquote><p>These aspects taken together leads to an increased efficiency in transaction throughout and network consensus.</p><p>There are some disadvantages with this system that are often pointed out though — basically it’s simply a slightly more distributed version of a centralized system and some people also simply don’t care about their reputation.</p><p>Currently there is one blockchain project that has <em>Proof of Authority </em>implemented and it’s aptly named <a href="https://poa.network/#">Proof of Authority Network</a>.</p><p>If you want to indulge yourself deeper into this alternative <a href="https://medium.com/poa-network/proof-of-authority-consensus-model-with-identity-at-stake-d5bd15463256">click here</a> or <a href="https://blockonomi.com/proof-of-authority/#">here</a>.</p><h3>Proof of Importance</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*t7sM4fxibFbzO3eAkbx3Wg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/JW6r_0CPYec?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">NeONBRAND</a></figcaption></figure><p>Next on our list is the <strong>Proof of Importance</strong> mechanism.</p><p>At first look it seems quite similar to <em>Proof of Stake</em>, but after closes inspection there are some key differences that we will take a look at.</p><p>In order to partake in the block creation and validation process, which is called <strong>harvesting</strong>, nodes (aka users) <strong>vest</strong> (“stake”) an amount of the blockchain native currency. If they successfully harvest a block, they then receive a financial reward.</p><p>So far pretty much the same as your classical <em>Proof of Stake </em>blockchain.</p><p>The difference now lays in the metrics that are being used to determine the <strong>weight </strong>of the stake — or in other words how valuable / influential the stake is. The higher the weight, the higher the chance to harvest a block.</p><p>Instead of only taking into account the amount of coins staked and the corresponding coin age, there are a couple of other factors that also play a role.</p><p>For example, the <strong>net transfers in the past 30 days</strong> increase this weight, with more recent transactions leading to a bigger weight.</p><p>Also, so-called <strong>cluster nodes</strong>, that are part of a cluster of high activity are weighted slightly more favorable.</p><p>The advantages compared to classical <em>PoS </em>blockchains revolve around to main points.</p><p>Firstly, this method encourages using the currency instead of just hoarding it. Secondly, this mechanism guards against the “nothing at stake” problem.</p><p>Since there is no requirement for special hardware, the barrier to entry is very low — and the computers can be turned off to harvest.</p><p>At the moment there is one big blockchain project that utilizes this approach, which is called <a href="https://nem.io/">NEM</a>.</p><p>To read more about this interesting alternative, <a href="https://www.smithandcrown.com/definition/proof-of-importance/">click here</a> or <a href="https://nem.io/xem/harvesting-and-poi/">here</a>.</p><h3>Directed Acyclic Graph</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*EKZOTkpw6fp26BwnQ041wA.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/PChvdQjvTO4?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Sergey Pesterev</a></figcaption></figure><p>And now, lust but not least, the cherry on top — <strong>Directed Acyclic Graphs </strong>(DAG).</p><p>Don’t let yourself be intimidated by this behemoth of a name!</p><p>While theoretically not being a blockchain, it still plays an important role in the field of distributed ledger technologies.</p><p>Blockchains are characterized by linking sequences of lists and grouping them into — surprise, surprise — into blocks. There are some intrinsic problems with blockchains though, especially when it comes to <strong>scalability </strong>and <strong>transaction throughput</strong>. When there are a lot of transactions happen during the same time in blockchain systems, it can lead to bottlenecks and “traffic jams” that bring the system to a halt — this is what happenend for example on the Ethereum network, when <a href="https://www.bbc.com/news/technology-42237162">the Cryptokitties overwhelmed it</a>.</p><p><em>DAGs</em> work in a very different way though. They are used to model influence between different information and can easily overcome these bottleneck problems due to their specific architecture.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/921/0*58bhFyNrt4jv6WtG" /><figcaption><a href="https://images.ctfassets.net/r1dr6vzfxhev/4w6pryBBDiuAm8AcmA8iim/9f60015a346ed07821b996b4a1c3bf5e/Blockchain_And_Tangle.png">Source</a></figcaption></figure><p>If you want to participate in the network, you have to validate other transactions, on order to being able to broadcast your own. This helps to unite the interests of users and miners into, since they are one and the same in these systems.</p><p>There a couple of characteristics that make <em>DAGs</em> so special.</p><p>First of all, they are <strong>acyclic</strong>, which means that new transactions reference old ones, but never the other way around.</p><p>The <strong>latency</strong> is also very low and only constrained by the bandwidth — there is no theoretical limit when it comes to scaling.</p><p>Another important aspect is that they are <strong>feeless</strong>, every transaction issued is also a validator, which enables feeless microtransactions.</p><p>Due to this characteristic, it is possible to create <strong>zero value transactions</strong>, with which messages can be send and received.</p><p>The last important aspect is so-called <strong>database pruning</strong>, which refers to the fact that it isn’t obligatory to have the entire history of the system at hand, but rather only a small and relevant part of it.</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fgiphy.com%2Fembed%2FCPskAi4C6WLHa%2Ftwitter%2Fiframe&amp;display_name=Giphy&amp;url=https%3A%2F%2Fmedia.giphy.com%2Fmedia%2FCPskAi4C6WLHa%2Fgiphy.gif&amp;image=https%3A%2F%2Fi.giphy.com%2Fmedia%2FCPskAi4C6WLHa%2Fgiphy.gif&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=giphy" width="435" height="198" frameborder="0" scrolling="no"><a href="https://medium.com/media/cc3da9e2d0fc3141c59d893d7625df24/href">https://medium.com/media/cc3da9e2d0fc3141c59d893d7625df24/href</a></iframe><p>One of the most prominent projects that exist which makes use of this method is <a href="https://www.mycryptopedia.com/iota-explained/"><strong>IOTA</strong></a>. Their idea is it to develop and establish their solution as a firm foundation for the Internet of Things infrastructure. Instead of calling it simply a <em>Directed Acyclic Graph</em>, they refer to their database as the <strong>tangle.</strong></p><p>To read more about <em>DAGs</em>, <a href="https://www.coinbureau.com/education/directed-acyclic-graphs-dags/#">click right here</a>.</p><p>That’s it, we’ve reached the end of this post — thank you very much for your attention, I hope that you walk away somewhat more knowledgeable and that you enjoyed the read.</p><p>If you have any comments, questions or constructive feedback let me know I’d love to hear from you!</p><p>Yours truly</p><p>Till</p><p>PS: If you’re looking for helpful and great resources to learn more about blockchain’s paradigm shifting technological potential,<a href="https://medium.com/blockwhat/reviews-resources/home"> check out these awesome resources</a>.</p><h3>Links for further reading:</h3><p><a href="https://blockonomi.com/proof-of-elapsed-time-consensus/">https://blockonomi.com/proof-of-elapsed-time-consensus/</a></p><p><a href="https://hackernoon.com/burst-part-3-proof-of-capacity-the-green-alternative-8e2651211671">https://hackernoon.com/burst-part-3-proof-of-capacity-the-green-alternative-8e2651211671</a></p><p><a href="https://www.coinbureau.com/education/proof-of-burn-explained/">https://www.coinbureau.com/education/proof-of-burn-explained/</a></p><p><a href="https://medium.com/poa-network/proof-of-authority-consensus-model-with-identity-at-stake-d5bd15463256">https://medium.com/poa-network/proof-of-authority-consensus-model-with-identity-at-stake-d5bd15463256</a></p><p><a href="https://www.smithandcrown.com/definition/proof-of-importance/">https://www.smithandcrown.com/definition/proof-of-importance/</a></p><p><a href="https://www.coinbureau.com/education/directed-acyclic-graphs-dags/">https://www.coinbureau.com/education/directed-acyclic-graphs-dags/</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=3b8817bd6d57" width="1" height="1" alt=""><hr><p><a href="https://medium.com/blockwhat/finding-consensus-4-4-alternative-consensus-mechanisms-3b8817bd6d57">Finding Consensus 4/4: Alternative Consensus Mechanisms</a> was originally published in <a href="https://medium.com/blockwhat">blockwhat?</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[January - Monthly Recap]]></title>
            <link>https://medium.com/blockwhat/january-monthly-recap-25b4d1e4f28b?source=rss-1979c128cf83------2</link>
            <guid isPermaLink="false">https://medium.com/p/25b4d1e4f28b</guid>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[ethereum]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[review]]></category>
            <dc:creator><![CDATA[Till Antonio Mahler]]></dc:creator>
            <pubDate>Fri, 01 Feb 2019 14:32:49 GMT</pubDate>
            <atom:updated>2019-02-01T14:32:49.584Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*oyXvJQpulMqvbKEt6mEBbg.jpeg" /><figcaption>Photo by<a href="https://unsplash.com/photos/waNAJOI7Jz8?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText"> Maddi Bazzocco</a> on<a href="https://unsplash.com/search/photos/january?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText"> Unsplash</a></figcaption></figure><p>Hello there dear <a href="https://medium.com/blockwhat/blockwhat-blockchain-781a47b34306"><em>blockwhat?</em></a> reader,</p><p>I hope you had a great start into 2019! Time is flying by and with January already being behind us, I’d love to share with you this brief recap of the past month.</p><p>January has been truly exciting and I was humbled to finish it on a exceptionally lovely note — being selected as a “Top Writer” in Bitcoin.</p><p>Without any further ado, let’s jump right into the story rundown.</p><h3>Stories published</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*x9rjjv4ZV6lybUJRblpZ0g.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/x7CDil50KKY?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Clem Onojeghuo</a> on <a href="https://unsplash.com/search/photos/stories?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Unsplash</a></figcaption></figure><p>The posts published this month focused mainly on one of the most essential aspects of blockchain technology — how to find consensus in a decentralized system.</p><p>We started off by looking at <strong>Byzantine Fault Tolerance</strong></p><p><a href="https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c"><em>https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c</em></a></p><p>Next up we got to know the mother of blockchain consensus mechanisms, <strong>Proof of Work</strong></p><p><a href="https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343"><em>https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343</em></a></p><p>Afterwards, we journeyed into the world of <strong>Proof of Stake</strong></p><p><a href="https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75"><em>https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75</em></a></p><p>As I want to share the resources that have helped me a great deal to fathom blockchains and their potential ramifications, I’ve started a section in which I review the books and resources, that facilitated my journey greatly! The latest review looks at “Blockchain and the Law”, a wonderful nuanced book by Primavera De Filippi and Aaron Wright.</p><p><a href="https://medium.com/blockwhat/blockchain-and-the-law-by-primavera-de-filippi-aaron-wright-ce527ac7c7c"><em>https://medium.com/blockwhat/blockchain-and-the-law-by-primavera-de-filippi-aaron-wright-ce527ac7c7c</em></a></p><h3>What’s to come?</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*atEsHK44oe_AWQhJKIy_KA.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/kBUfvkbFIoE?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Tomasz Frankowski</a> on <a href="https://unsplash.com/?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Unsplash</a></figcaption></figure><p>Currently I’m working on a draft for the final part of the <em>Finding Consensus</em> series, in which I’ll look into alternative consensus mechanisms apart from <em>Proof of Work </em>and <em>Proof of Stake</em>.</p><p>Afterwards there are two super interesting aspects that I’ll look into before finishing the <em>Technological Foundations </em>(for the moment being at least) — first, we will look into the <strong>different parts that make up blockchain networks </strong>and afterwards we’ll finish with a thorough look at <strong>Tokens and Tokenization</strong>.</p><p>Thank you very much for being an avid reader of <a href="https://medium.com/blockwhat/blockwhat-blockchain-781a47b34306"><em>blockwhat?</em></a>, it means the world to me and I thoroughly hope that you enjoy the published content!</p><p>Yours truly</p><p>Till</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=25b4d1e4f28b" width="1" height="1" alt=""><hr><p><a href="https://medium.com/blockwhat/january-monthly-recap-25b4d1e4f28b">January - Monthly Recap</a> was originally published in <a href="https://medium.com/blockwhat">blockwhat?</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Finding Consensus 3/4: Proof Of Stake]]></title>
            <link>https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75?source=rss-1979c128cf83------2</link>
            <guid isPermaLink="false">https://medium.com/p/74c573b8bc75</guid>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[proof-of-stake]]></category>
            <category><![CDATA[crypto]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[blockchain]]></category>
            <dc:creator><![CDATA[Till Antonio Mahler]]></dc:creator>
            <pubDate>Wed, 30 Jan 2019 16:30:51 GMT</pubDate>
            <atom:updated>2019-02-06T15:07:19.095Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*M1sRme4kJK3BsP_Qh8r_eg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/pvIVPYGM16o?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Michał Parzuchowski</a></figcaption></figure><p>Hello there, awesome that you’ve made to <a href="https://medium.com/blockwhat/blockwhat-blockchain-781a47b34306"><em>blockwhat?</em></a>. In today’s post we will continue our journey into the fascinating realms of how consensus is found in different blockchain systems!</p><p>After having taken an in-depth look into <em>Proof of Work</em> in the last post, this piece will focus on another highly popular consensus mechanism — <strong>Proof of Stake</strong>. We will look at it’s history, analyze how it works and what makes it stand apart from other forms of finding consensus, but also look at its potential limitations.</p><p>Ready? Then let’s get going.</p><p>This article is part eight of our journey into the technological foundations of blockchain technology.</p><p><a href="https://medium.com/blockwhat/blockwhat-but-why-7b3c08687f3">If you’re new here and want to understand what’s going on, just click here</a>.</p><ol><li><a href="https://medium.com/blockwhat/the-tech-behind-blockchains-6076d38d1490">The Tech Behind Blockchains</a></li><li><a href="https://medium.com/blockwhat/decentralized-c5a7a6ba5aab">A Journey Into Decentralization</a></li><li><a href="https://medium.com/blockwhat/hash-ing-everywhere-a-primer-on-hash-functions-24cdf43515d7">Hash(ing) Everywhere — A Primer On Hash Functions</a></li><li><a href="https://medium.com/blockwhat/public-key-cryptography-a-comprehensive-guide-1e8489e08104">Public Key Encryption — A Comprehensive Guide</a></li><li><a href="https://medium.com/blockwhat/merkle-trees-ensuring-integrity-on-blockchains-508d6647d58e">Merkle Trees — Ensuring Integrity On Blockchains</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c">Finding Consensus 1/4: Byzantine Fault Tolerance</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343">Finding Consensus 2/4: Proof Of Work</a></li><li>Finding Consensus 3/4: Proof Of Stake (This article)</li><li><a href="https://medium.com/blockwhat/finding-consensus-4-4-alternative-consensus-mechanisms-3b8817bd6d57">Finding Consensus 4/4: Alternative Consensus Mechanisms</a></li><li>Network — Who’s Doing All This Stuff?</li></ol><p><a href="https://medium.com/altcoin-magazine/a-brief-prehistory-of-blockchain-957bcd45604c">If you’re interested in exploring the fascinating history behind blockchain, click right here and go down the rabbit hole.</a></p><h3>Consensus</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*r1nhXZXbjiQ7Hb1ZFPe26w.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/rK5pVY1Op5A?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">rawpixel</a></figcaption></figure><p>The importance of finding consensus and the extraordinary difficulty of it, especially in decentralized systems, has been explained in length in the prior two post on <em>Finding Consensus</em>, therefore we won’t dive too deep into this baseline here. If you want to recap the essentials of this interesting topic, I’d recommend you to give them a quick read:</p><p>Part one focused on <strong>Byzantine Fault Tolerance</strong></p><p><a href="https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c">Finding Consensus 1/4: Byzantine Fault Tolerance</a></p><p>And part two on <strong>Proof of Work</strong></p><p><a href="https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343">Finding Consensus 2/4: Proof Of Work</a></p><p>With the growing popularity of Bitcoin in the years after it has seen the day of light in 2009, more and more people started to get interested in the underlying technology, known <em>as blockchain.</em></p><p>Many other blockchain projects were started in those years, which in the beginning all continued to make use of Bitcoin’s consensus mechanism, <em>Proof of Work (PoW)</em>.</p><p>While <em>PoW</em> is very effective at securing the public ledger and creating a strong set of incentives to act in an honest and integer way, it tends also to be very energy consuming. That particular aspect is due to the nature of the way consensus is found — participating nodes (aka computers) try to guess the right solution to a complicated cryptographic puzzle. By utilizing a lot of computational power, they require a lot of energy, which turns into tangible costs for the users who own the computers.</p><p>Along comes the prolific developer Sunny King, who in 2012 proposed a completely new way of finding consensus, which he dubbed <strong>Proof of Stake.</strong></p><p>His idea revolved around finding a way to achieve consensus by internalizing the whole process — instead of using external hardware, which consumes a lot of energy to run, he came up with a purely software-based mechanism to validate blocks and therefore finding consensus.</p><p>He first implemented this idea in his cryptocurrency project <a href="https://peercoin.net/"><em>Peercoin</em></a><em>.</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/400/1*iM6Vp9d9tgcZZrNlKWbe-A.jpeg" /><figcaption><a href="https://pbs.twimg.com/profile_images/875814912697577472/HJWwl22N_400x400.jpg">Peercoin</a></figcaption></figure><p>Before we take a look at how this mechanism works, it’s essential to understand that public blockchains inherently need to have a cryptocurrency (aka token), since its fundamental properties of security and honesty are due to the financial incentives enabled through rewarding honest behavior by giving out these tokens.</p><p>For example, Bitcoin achieves to maintain the integrity of their public ledger due to all the miners who take part in the mining race, at which end there lays a reward of not only the transaction fees, but also an amount of newly generated Bitcoin.</p><p>With that understood, we will now examine of <em>Proof of Stake</em> functions:</p><p>First of all, the participating computers in a <em>Proof of Stake</em> network are normally not called <em>miners</em> but rather <em>forgers</em> or <em>minters. </em>Every node that wants to take part in the process of forming a new block of transactions and gain the right to propagate it to the whole system, need to show its commitment to wanting to perform this duty. In order to demonstrate this willingness, participants need to stake an amount of the coin that is being used on that particular blockchain.</p><p>This is done by creating a special transaction, which locks the amount of cryptocurrency in a special deposit — the amount is now considered<strong> staked</strong>.</p><p>Using a lottery style mechanism, the system then randomly chooses a participating user (who has a stake) as a validator for a block of transactions, and thus gives him a financial reward in the form of transaction fees and newly minted coins (not always though, this differs from project to project).</p><p>The more coins a user has staked, the higher is the chance of being selected.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*qWm4r1QF9iNMDgPEb20U1Q.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/a6N685qLsHQ?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Jonathan Petersson</a></figcaption></figure><p>Now you might think that sounds like a situation ripe for abuse of some wealthy big wales, who hold a huge chunk of the respective coins?</p><p>Well, in order to ensure a certain level of fairness, there are a couple of ideas that have been developed — their implementation again depends on the specific blockchain in question of course.</p><p>One of most widely used concepts is <strong>Coin Age Selection.</strong></p><p>The idea behind this is simple, you multiply the amount of coins in the deposit with the number of days they have been staked — the higher the resulting cumulative<em> Coin Age</em>, the higher the chance of being selected. There are a couple of rules that normally tend to apply for this concept:</p><p>In order to be considered for the selection process, the coins need to be staked at least for a duration of 30 days. The maximum age that a coin can accumulate is reached after 90 days. Also, if a user has been chosen as a block validator, a new transaction is created that sends the staked coins back into the user’s wallet — this automatically resets the timer a user has to wait before being eligible for the selection process once more.</p><p>How does this system ensure an honest behavior you might ask yourself now?</p><p>It turns out that in the case of an invalid block being propagated to the rest of the system, the respective user would lose his deposit. This creates a strong incentive to act with integrity, since everything else would result in ensured financial loss.</p><p>The main advantages of <em>Proof of Stake </em>are mainly the following three:</p><p>A high <strong>energy efficiency</strong>, especially compared to <em>PoW</em>, which is due to the purely software based nature of it.</p><p>Also, the possibility of people grouping their resources together and thus creating large mining pools doesn’t lead to an exponentially growing influence, as would be the case in PoW — therefore potentially strengthening the <strong>decentralized nature</strong> of the system.</p><p>Last but not least, <strong>security</strong> plays a big role. A majority attack, in which a malicious actor controls the majority of the network, would require the attacker to be in possession if at least 51% of the total supply. If somebody would actually want to stage such an attack, the more tokens would be bought would lead to an increasing token price, making it extremely expensive. Should the attack then go through, the coin value would most certainly drop immensely — leading to a huge financial loss of the attacker.</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fgiphy.com%2Fembed%2FyoJC2Olx0ekMy2nX7W%2Ftwitter%2Fiframe&amp;display_name=Giphy&amp;url=https%3A%2F%2Fmedia.giphy.com%2Fmedia%2FyoJC2Olx0ekMy2nX7W%2Fgiphy.gif&amp;image=https%3A%2F%2Fi.giphy.com%2Fmedia%2FyoJC2Olx0ekMy2nX7W%2Fgiphy.gif&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=giphy" width="435" height="239" frameborder="0" scrolling="no"><a href="https://medium.com/media/253962425946beae8b9a939b4d987782/href">https://medium.com/media/253962425946beae8b9a939b4d987782/href</a></iframe><p>On an interesting side note, there are two things that I’d love to share with you.</p><p>The first one revolves around the creator of this consensus mechanism, Sunny King, who created another very interesting blockchain in 2013, which goes by the name of <a href="https://en.wikipedia.org/wiki/Primecoin"><strong>Primecoin</strong></a><strong>.</strong> This system used <em>Proof of Work</em> as the underlying consensus mechanism, but combined the mining with something really useful — searching for Prime numbers, which then in turn can be used by scientist free of charge.</p><p>From a historic perspective it might also be very interesting for you to dive into the story of Wei Dai’s <strong>b-money</strong> idea from 1998. In it, Dai proposed a similar concept of using staked deposits as a mean of dis-incentivizing bad behavior.</p><p><a href="https://medium.com/blockwhat/98-wei-dai-who-dat-f93c4e4bcfc9">’98 | Wei Dai — Who dat?</a></p><p>Next up, we’ll take a look at some alternative consensus mechanisms that have been created based upon <em>Proof of Stake.</em></p><h3>Alternative PoS Mechanisms</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*0P73ss7mN_Gmbn-3bGRrew.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/2-HWopOOXP4?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Adi Goldstein</a></figcaption></figure><p>One of the best known alternatives is the so-called <a href="https://lisk.io/academy/blockchain-basics/how-does-blockchain-work/delegated-proof-of-stake"><strong>Delegated Proof of Stake</strong> model</a>.</p><p>It works by combing real time voting with a social system of reputation. All the users of the system can vote for delegates (sometimes also called <em>witnesses),</em> with the voting power increasing proportionally to the amount of tokens (aka coins) hold.</p><p>The elected delegates now have the responsibility to ensure that the nodes are up and running, that all the transactions across the network are collected into blocks, are subsequently validated and in the case of dispute, resolve the issues.</p><p>If a delegate would act in a dishonest way, he can easily be voted out of the network and the delegate would lose his stake. The smaller amount of elected delegates leads to a more efficient and more effective consensus mechanism, with a high transaction throughput.</p><p>Another idea is called<a href="https://docs.wavesplatform.com/en/platform-features/leased-proof-of-stake-lpos.html"> <strong>Leased Proof of Stake</strong></a>. This concepts revolves around the idea, that users are able to lease their coins to a node that they trust — without giving up ownership of the coins though. Any financial reward that that node that gets, by successfully validating blocks, is shared with the respective users who leased their stake.</p><h3>Potential Limitations</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*mYVKw-5us2mTHdLXeUeisQ.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/zS1kn5DQm1M?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Ksenia Kudelkina</a></figcaption></figure><p>There are two big potential limitations to the overall security of a <em>Proof of Stake </em>blockchain, both of these were coined for the first time by Andrew Poelstra in his paper <a href="https://download.wpsoftware.net/bitcoin/pos.pdf">“On Stake and Consensus”</a> — a worthwhile, even though quite technical read.</p><p>The first one is the so-called <a href="https://medium.com/@abhisharm/understanding-proof-of-stake-through-its-flaws-part-2-nothing-s-at-stake-8d12d826956c"><strong>nothing at stake </strong>problem</a>.</p><p>After consensus has been found in a<em> Proof of Work </em>blockchain, the validated block is then added to the chain. Due to the inherent latency of the underlying communication channel (the Internet), it can happen that two valid blocks are mined at the same time. The network achieves to agree on the valid chain by always selecting the longest chain, since the most work went into producing it. If somebody wants to change the transaction history in the past in a <em>PoW </em>system, that actor would need to redo all the work that went into producing the prior blocks — which would amount to an enormous amount of energy, ergo cost being required.</p><p>If we break all of this down to its core, it’s actually not a technical thing, but rather social norms that lay behind this. The choice of which software to use is up to every participant, so technically everybody’s free to implement whatever consensus rule they fancy — yet, if the rest of the network chooses not to use that same software, that would be a senseless endeavor.</p><p>When it comes to <em>Proof of Stake </em>blockchains, there is no special hardware required in order to secure the system. Due to this, users can theoretically vote on many different versions of a blockchain in order to increase their chance of a financial reward — this would lead to consensus becoming incredibly difficult to be found. Since users have nothing at stake, it’d be in their best interest and logical rational to engage in this behavior.</p><p>A possible solution to this is to penalize nodes who vote on two different versions of one block or to penalize those voting on a wrong block.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*eAdqKoWkI9p3NnQdx94yHw.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/dJdcb11aboQ?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">John Matychuk</a></figcaption></figure><p>The second issue is known as <a href="https://medium.com/@abhisharm/understanding-proof-of-stake-through-its-flaws-part-3-long-range-attacks-672a3d413501"><strong>long range </strong>problem</a>.</p><p>This issue revolves around the problem that people who participated in the early days of a <em>Proof of State </em>blockchain could theoretically revert all of the blockchain history. How exactly would that play out?</p><p>Well, these early users could go back in the blockchain’s history and start from a point where they exerted a big influence. Since there is no need to provide enormous amounts of computational power in a <em>Proof of Stake </em>blockchain, chains can be grown very long very fast.</p><p>Now a problem known as <a href="https://blog.ethereum.org/2014/11/25/proof-stake-learned-love-weak-subjectivity/"><strong>weak subjectivity</strong></a> enters the stage.</p><p>Let’s say you chose to become a new participant in a <em>Proof of Stake </em>blockchain. Once you’ve set up your computer, the installed software now needs to know which chain that circulates in the system can be trusted (aka the so-called <strong>main chain</strong>). Your computer know finds itself in the situation that it needs to ask another computer for that information — and trust it that the information is correct. This leads to a big problem of trust arising, because you could fall prey to one of those doctored chains mentioned above.</p><p>Since trust is at the core of blockchain technology and is considered as the most essential invention, the need to trust a third party leads to a fundamental problem. There are workarounds to this problem, such as having trusted servers that frequently send out a hash of the correct main chain, yet this degree of centralization lingers along.</p><p>I’d love to end this post with a quote by my fellow Medium writer <a href="https://medium.com/u/47dc29999bf2">Abhishek Sharma</a>:</p><blockquote>“There appears to be a clear trade-off between mining costs and the level of trust required of other participants in the blockchain.</blockquote><blockquote>It may be the case that if we want to curb the immense resource consumption of cryptocurrencies, we will have to once again trust each other instead of mathematical proofs.”</blockquote><p>If you’ve reached this point you can pad yourself on your back — you’ve made it through the whole post. I’d love to thank you for the time and attention that you’ve invested into this read and hope that you’ve enjoyed it!</p><p>Do you have any comments, questions or constructive feedback? If yes, please let me know, I’d love to hear from you(:</p><p>All the best</p><p>Till</p><p>PS: If you’re looking for helpful and great resources to learn more about blockchain’s paradigm shifting technological potential, <a href="https://medium.com/blockwhat/reviews-resources/home">check out these awesome resources</a>.</p><h3>Links for further reading:</h3><p><a href="https://github.com/ethereum/wiki/wiki/Proof-of-Stake-FAQs">https://github.com/ethereum/wiki/wiki/Proof-of-Stake-FAQs</a></p><p><a href="https://medium.com/@hugonguyen/work-is-timeless-stake-is-not-554c4450ce18">https://medium.com/@hugonguyen/work-is-timeless-stake-is-not-554c4450ce18</a></p><p><a href="https://medium.com/@dsl_uiuc/fake-stake-attacks-on-chain-based-proof-of-stake-cryptocurrencies-b8b05723f806">https://medium.com/@dsl_uiuc/fake-stake-attacks-on-chain-based-proof-of-stake-cryptocurrencies-b8b05723f806</a></p><p><a href="https://vitalik.ca/general/2018/03/28/plutocracy.html">https://vitalik.ca/general/2018/03/28/plutocracy.html</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=74c573b8bc75" width="1" height="1" alt=""><hr><p><a href="https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75">Finding Consensus 3/4: Proof Of Stake</a> was originally published in <a href="https://medium.com/blockwhat">blockwhat?</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Blockchain and the Law by Primavera De Filippi & Aaron Wright]]></title>
            <link>https://medium.com/blockwhat/blockchain-and-the-law-by-primavera-de-filippi-aaron-wright-ce527ac7c7c?source=rss-1979c128cf83------2</link>
            <guid isPermaLink="false">https://medium.com/p/ce527ac7c7c</guid>
            <category><![CDATA[review]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[ethereum]]></category>
            <dc:creator><![CDATA[Till Antonio Mahler]]></dc:creator>
            <pubDate>Tue, 22 Jan 2019 12:06:18 GMT</pubDate>
            <atom:updated>2019-01-22T12:10:43.173Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Nna8XsI6E69GoPQCdv-n1g.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/w8JiSVyjy-8?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">freddie marriage</a></figcaption></figure><p>Welcome to the latest book review here at <a href="https://medium.com/blockwhat/blockwhat-blockchain-781a47b34306"><em>blockwhat?</em></a>, it’s awesome that you’re here.</p><p>This blog project tries to bundle the most important information surrounding distributed ledger technologies (DLT), with a special focus on blockchains. Apart from providing you <a href="https://medium.com/altcoin-magazine/the-best-resources-to-step-up-your-blockchain-game-56726496d2e3">with these reviews</a>, that guide you to very helpful resources to further your understanding of blockchains, there is a big <a href="https://medium.com/altcoin-magazine/a-brief-prehistory-of-blockchain-957bcd45604c">focus on the history</a> and <a href="https://medium.com/blockwhat/the-tech-behind-blockchains-6076d38d1490#">the technology behind</a> this groundbreaking new paradigm.</p><p>Without any further ado, let’s dive into today’s review of Blockchain and the Law, a refreshingly different book in the blockchain space.</p><h3>The Book</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/447/1*_Io-Dnf00k3PPbBIJmi7jg.jpeg" /><figcaption><a href="http://www.hup.harvard.edu/images/jackets/9780674976429-lg.jpg">Source</a></figcaption></figure><blockquote>[The code] will present the greatest threat to both liberal and libertarian ideals, as well as their greatest promise. We can build, or architect, or code cyberspace to protect values that we believe are fundamental. Or we can build, or architect, or code cyberspace to allow those values to disappear. There is no middle ground. There is no choice that does not include some kind of building. Code is never found; it is only ever made, and only ever made by us.</blockquote><blockquote>- Lawrence Lessig</blockquote><p>Blockchain and the Law by Primavera De Filippi &amp; Aaron Wright is a wonderful read, from the beginning to the very end.</p><p>Overall the book finds a good balance between exploring the topic on a high conceptual level, as well as a low technical level — which is a great accomplishment in a space that is often either too technical or way too superficial.</p><p>The two authors explore the ramifications of blockchain technology in many different fields, such as financial applications or the legal sphere — with one chapter dedicated completely to the fascinating field of Decentralized Autonomous Organizations (DAOs).</p><p>One of the key focuses of the book is always the look from a possible and potential regulatory perspective and they make it abundantly clear why this matters. While many authors in the blockchain space often resort to a very hyped, overly optimistic and one-sided view on the merits and consequences of this new technological paradigm, De Filippi and Wright always also take an in-depth look into possible negative outcomes.</p><p>A regulatory framework they focus on is <a href="https://en.wikipedia.org/wiki/Pathetic_dot_theory">Lessig’s so-called “Pathetic Dot Theory”</a>, which argues that compared to other affairs in our world, software and ergo the cyberspace are completely man made — and therefore government and regulatory bodies have a great deal of possible influence on the development of these systems. The four main areas to exert control are Law, Social Norms, the market and architecture.</p><p>All in all it’s a lovely read, with a refreshingly balanced look at the consequences and ramifications of blockchains on many different fields, especially with regards to the law surrounding them.</p><p>Highly recommended read for everybody who wants to extend their understanding of the broad ramifications of blockchain technology.</p><h3>The Authors</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/390/1*YT0U0wIy1TIy8-JHCojpsw.jpeg" /><figcaption><a href="https://cardozo.yu.edu/sites/default/files/styles/470wide/public/ve0CszPR.jpg?itok=1ocEB1s2">Source</a></figcaption></figure><p><strong>Primavera De Filippi</strong> is a permanent researcher at the<a href="http://cersa.cnrs.fr/"> CERSA/CNRS/Université Paris II Panthéon-Assas</a> and a faculty associate at the<a href="https://cyber.harvard.edu/"> Berkman Klein Center for Internet &amp; Society at Harvard Law School</a>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/470/1*RqWDeQk7lfFHVpfGqZRptQ.jpeg" /><figcaption><a href="https://cardozo.yu.edu/sites/default/files/styles/470wide/public/ve0CszPR.jpg?itok=1ocEB1s2">Source</a></figcaption></figure><p><strong>Aaron Wright</strong> is Associate Clinical Professor of Law and Director of the Blockchain Project at<a href="https://www.cardozo.yu.edu/"> Benjamin N. Cardozo School of Law at Yeshiva University</a>.</p><p>I hope that you’ve enjoyed this brief review — if you’re enticed to dive into this awesome book, I’m highly confident that you’ll manage to find it in a local bookstore next to you, otherwise you can find it in the beautiful lands of the vast cyberspace of ours.</p><p>Yours truly</p><p>Till</p><p>If you’re interested in more awesome resources to enhance your knowledge about blockchain, check out these other reviews:</p><ol><li><a href="https://medium.com/blockwhat/digital-gold-by-nathaniel-popper-f285b2b0eb3e">Digital Gold by Nathaniel Popper (Book</a>)</li><li><a href="https://medium.com/blockwhat/the-truth-machine-by-michael-j-casey-and-paul-vigna-a5c4736cc0f4">The Truth Machine by Michael J Casey and Paul Vigna (Book</a>)</li><li><a href="https://medium.com/blockwhat/blockchain-revolution-by-don-and-alex-tapscott-17e474fb0a48">Blockchain Revolution by Don and Alex Tapscott (Book</a>)</li><li><a href="https://medium.com/blockwhat/blockchain-innovation-by-frederick-munawa-podcast-d18ce1ffd46">Blockchain Innovation by Frederick Munawa</a> (Podcast)</li><li><a href="https://medium.com/blockwhat/mastering-bitcoin-by-andreas-antonopoulos-book-de38950bb562">Mastering Bitcoin by Andreas Antonopoulos</a> (Book)</li><li>Blockchain and the Law by Primavera De Filippi &amp; Aaron Wright (Book) (this review)</li><li>Mastering Ethereum by Andreas Antonopoulos and Gavin Wood</li><li>Homo Sapiens by Noah Yuval Harari</li><li>Homo Deus by Noah Yuval Harari</li><li>21 Lessons for the 21st Century by Noah Yuval Harari</li></ol><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=ce527ac7c7c" width="1" height="1" alt=""><hr><p><a href="https://medium.com/blockwhat/blockchain-and-the-law-by-primavera-de-filippi-aaron-wright-ce527ac7c7c">Blockchain and the Law by Primavera De Filippi &amp; Aaron Wright</a> was originally published in <a href="https://medium.com/blockwhat">blockwhat?</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Finding Consensus 2/4: Proof Of Work]]></title>
            <link>https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343?source=rss-1979c128cf83------2</link>
            <guid isPermaLink="false">https://medium.com/p/387860493343</guid>
            <category><![CDATA[proof-of-work]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[blockchain]]></category>
            <dc:creator><![CDATA[Till Antonio Mahler]]></dc:creator>
            <pubDate>Thu, 17 Jan 2019 13:28:33 GMT</pubDate>
            <atom:updated>2019-02-06T15:07:31.156Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*5Jlkobme5sqWEmc7uu4L1A.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/EqUFBrTIdeE?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Ricardo Gomez Angel</a></figcaption></figure><p>Welcome back to <a href="https://medium.com/blockwhat/blockwhat-blockchain-781a47b34306"><em>blockwhat?</em></a>, it’s a pleasure to welcome you here once again on our journey to explore the technological fabric behind blockchains.</p><p>In today’s post, we will explore an ingenious idea that constitutes a truly technological marvel — a fascinating concept to find consensus, known as Proof of Work. We will dive into the importance of this revolutionary idea, understand its inner workings and get to know the limitations surrounding this concept as well.</p><p>A captivating story in three chapters — let’s get going!</p><p>This article is part seven of our journey into the technological foundations of blockchain technology.</p><p><a href="https://medium.com/blockwhat/blockwhat-but-why-7b3c08687f3">If you’re new here and want to understand what’s going on, just click here</a>.</p><ol><li><a href="https://medium.com/blockwhat/the-tech-behind-blockchains-6076d38d1490">The Tech Behind Blockchains</a></li><li><a href="https://medium.com/blockwhat/decentralized-c5a7a6ba5aab">A Journey Into Decentralization</a></li><li><a href="https://medium.com/blockwhat/hash-ing-everywhere-a-primer-on-hash-functions-24cdf43515d7">Hash(ing) Everywhere — A Primer On Hash Functions</a></li><li><a href="https://medium.com/blockwhat/public-key-cryptography-a-comprehensive-guide-1e8489e08104">Public Key Encryption — A Comprehensive Guide</a></li><li><a href="https://medium.com/blockwhat/merkle-trees-ensuring-integrity-on-blockchains-508d6647d58e">Merkle Trees — Ensuring Integrity On Blockchains</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c">Finding Consensus 1/4: Byzantine Fault Tolerance</a></li><li>Finding Consensus 2/4: Proof Of Work (This article)</li><li><a href="https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75">Finding Consensus 3/4: Proof Of Stake</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-4-4-alternative-consensus-mechanisms-3b8817bd6d57">Finding Consensus 4/4: Alternative Consensus Mechanisms</a></li><li>Network — Who’s Doing All This Stuff?</li></ol><p><a href="https://medium.com/altcoin-magazine/a-brief-prehistory-of-blockchain-957bcd45604c">If you’re interested in exploring the fascinating history behind blockchain, click right here and go down the rabbit hole.</a></p><h3>Consensus</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*90OqH2-MZ4cdAHmbOgStrQ.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/4Ennrbj1svk?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Olav Ahrens Røtne</a></figcaption></figure><p>Agreeing upon what’s “true” is almost always a tricky business, even more so in decentralized systems, where there is not a single authority of power.</p><p>In order to understand why finding consensus is so incredibly important in a blockchain context, it’s important to note that at their heart, blockchains are simply ledgers that record the state of a system at a specific point in time.</p><p>The challenge of finding a single universal “truth” about the state of transactions and ownership within in public global ledger lays at the core of blockchain technology and the ingenious solution found for it sets this technology apart from all the traditional systems before it.</p><p>Legacy systems depend on a trust model with a central authority that enables them to verify and authenticate the state of affairs within their database. Since an inherent characteristic of blockchain technology is that it has no central authority, it is of utmost importance to find a mechanism with which consensus can be achieved, so that every node can trust the public ledger as the ultimate authoritative record.</p><p>Satoshi’s main invention is arguably the decentralized mechanism for emergent consensus within a decentralized system.</p><p>You might find asking yourself now, what the hell is emergent consensus?</p><p>Well, in order to understand this, it’s indispensable to recall the topic of the last post — <strong>Byzantine Fault Tolerance</strong>. This topic dealt with the incredibly complex problem of ensuring consensus in a decentralized system, which might contain malicious actors. A Byzantine fault tolerant system is one, that ensures that consensus still can be reached completely.</p><p>To get an in-depth understanding of this concept, check out this article:</p><p><a href="https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c">Finding Consensus 1/4: Byzantine Fault Tolerance</a></p><p>Satoshi’s idea, Proof of Work, works slightly different though. Instead of having a consensus that can directly be believed 100%, it is rather a probabilistic one — meaning that the probability that this particular consensus is correct, is growing with the time passing by, but will never be 100%.</p><p>It is an emergent consensus, since the consensus is an emergent artifact of the asynchronous interaction of all the independent nodes (aka computers), all following the same simple rules.</p><p>The way this emergent decentralized consensus is achieved is by the mesh of four different processes, which take place independently of each other across the network:</p><p><em>1) Full nodes use a comprehensive list of criteria to independently verify each transaction.</em></p><p><em>2) All these transactions are bundled independently into new blocks by mining nodes, together with a Proof-of-Work.</em></p><p><em>3) The new blocks are independently verified by every node and assembled into a cryptographically linked chain.</em></p><p><em>4) Each node then independently decided on the assumed correct chain by choosing the one with the highest cumulative computation performed through Proof-of-Work.</em></p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fgiphy.com%2Fembed%2F3o7btPCcdNniyf0ArS%2Ftwitter%2Fiframe&amp;display_name=Giphy&amp;url=https%3A%2F%2Fmedia.giphy.com%2Fmedia%2F3o7btPCcdNniyf0ArS%2Fsource.gif&amp;image=https%3A%2F%2Fi.giphy.com%2Fmedia%2F3o7btPCcdNniyf0ArS%2Fgiphy.gif&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=giphy" width="435" height="242" frameborder="0" scrolling="no"><a href="https://medium.com/media/3dd4ac74867cd51a84f1d7c7768443d5/href">https://medium.com/media/3dd4ac74867cd51a84f1d7c7768443d5/href</a></iframe><p>By harnessing the synergies of these four processes, blockchains can secure the system and enable emergence of a network-wide consensus without a central authority. All the properties of blockchain technology emerge due to this, such as currency, transactions, payments and the security model.</p><p>The mechanism by which transactions are verified and aggregated into new blocks is achieved by so-called mining, as is the case for Bitcoin and Ethereum for example. This process is basically the decentralized security mechanism, which enables the establishment of a trusted public ledger without a central authority.</p><p>After having combed through this introductory part, let’s now explore how mining works in detail.</p><h3>Mining</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*jxM_EUOiAtPoG6gjc-yhOg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/LXxtBQl1GH4?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Simon Basler</a></figcaption></figure><p>The process by which consensus is achieved is described synonymous as <strong>mining.</strong> As in the real world, where mining is hard work, the connotation translates well into the meaning within a blockchain context.</p><p>Before we get into the nitty gritty details of how this process works, we will start with an overview of the flow of transactions. Let’s take Bitcoin for this example. The first step is to verify and subsequently bundle transactions during a certain amount of time (in Bitcoin’s case ~10 min) into a single block.</p><p>The nodes than all take part in a race to solve a cryptographic puzzle, this process is known as Proof of Work. If a node has found the right answer to the puzzle, they get the right to broadcast to the network, which then verifies the validity of the solution found and the transactions included. Once this is done, the block is cryptographically linked to the blocks before it — slowly growing into a chain of blocks.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/800/0*TIVCQFV2cfoPt0ml" /><figcaption><a href="https://cdn-images-1.medium.com/max/800/0*o8GQNm7la1KPFYpq">Source</a></figcaption></figure><p>After having looked at a high-level description of the process, we will explore the fascinating specifics of this ingenious marvel.</p><p>There are some concepts mentioned below, such as <strong>hashing </strong>and <strong>merkle trees</strong>, that have been covered in prior posts, therefore we will not get into them in too great detail — if you haven’t read them yet, feel free to do so here:</p><ul><li><a href="https://medium.com/blockwhat/hash-ing-everywhere-a-primer-on-hash-functions-24cdf43515d7">Hash(ing) Everywhere — A Primer On Hash Functions</a></li><li><a href="https://medium.com/blockwhat/merkle-trees-ensuring-integrity-on-blockchains-508d6647d58e">Merkle Trees — Ensuring Integrity On Blockchains</a></li></ul><p>We will begin by looking at the way all of these blocks are constructed. Each block has a so-called <strong>block header</strong>, which consists of several components, such as the version of the software, the previous block hash, the merkle root, a timestamp, a difficulty target and a nonce.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/800/0*shv280Kemp-WlwOb" /><figcaption><a href="https://cdn-images-1.medium.com/max/800/0*imvNmIRjzZzGpcWJ">Source</a></figcaption></figure><p>The <strong>software version </strong>is used in order to keep track of changes or upgrades in the underlying protocol.</p><p>The <strong>previous block hash</strong> creates the chain of cryptographically linked blocks.</p><p>The <strong>merkle root</strong> is the all encompassing hash of the underlying merkle tree (explained in a prior post in depth).</p><p>The <strong>timestamp</strong> is counting the quantity of seconds that have passed since the first of January 1970. <a href="https://en.wikipedia.org/wiki/Unix_time">https://en.wikipedia.org/wiki/Unix_time</a></p><p>The <strong>difficulty target</strong> is an important part in the cryptographic puzzle and dictates, well, the difficulty.</p><p>Last but not least, the <strong>nonce</strong>, is used in the cryptographic puzzle as well.</p><p>For our little journey into <strong>Proof of Work</strong>, we will focus on the last two bits, <em>difficulty target</em> and <em>nonce</em>. The original idea behind this concept can be traced back to 1992, when Dr. Cynthia Dwork and Dr. Moni Naor published their research on<a href="http://www.wisdom.weizmann.ac.il/~naor/PAPERS/pvp.pdf"> how to combat junk-mail.</a></p><p>More commonly known is Adam Back’s <strong>hashcash</strong> though, which is covered in depth in the following post:</p><p><a href="https://medium.com/blockwhat/97-anybody-interested-in-some-hash-cash-7fd422dc5e79">’97 | Anybody interested in some hash(cash)?</a></p><p><em>Hashcash</em> was designed as a system to combat junk email. It does so by obliging the sender of an email to solve a little cryptographic puzzle, which requires some processing power and thus energy (that has to be paid for) to be solved. On a small scale for individual emails this does not matter too much, but in the case of spam, where potentially millions of emails are send, this suddenly incurs a very high energy bill.</p><p>Satoshi Nakamoto incorporated this idea into Bitcoin and directly credits Adam Back in his whitepaper <a href="https://bitcoin.org/bitcoin.pdf">“Bitcoin: A Peer-to-Peer Electronic Cash System”</a>.</p><p>So what exactly is the place of this concept within some of the most widely used blockchains like Bitcoin and Ethereum?</p><p>Well, <em>Proof of Work </em>is the most commonly adopted consensus algorithm and is used both by those systems. It constitutes a cryptographic puzzle, which competing mining nodes try to solve.</p><p>In order for a competing mining node to win the right to broadcast their block into the network, the node needs to hash the block header repeatedly, changing one parameter at the time (the <em>nonce </em>we mentioned earlier). They continue doing this until the resulting hash output matches a predefined target, which is defined by the software in the block header.</p><p>By changing the nonce, the mining nodes need to use a lot of computational power to use brute-force in order to produce a hash that is less than the target. By setting a lower target, the computational power needed increases exponentially and it is thus more difficult to find. Since the probability of any possible outcome can be calculated in advance, is is possible to use an outcome of a specific difficulty as a proof of a specific amount of work.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*dupbNcK6xxRvqxy5FV8Blg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/O7Ge0rlPmX4?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Dominik Vanyi</a></figcaption></figure><p>But why would people willingly commit their computers to perform so many random guesses simply to solve a cryptographic puzzle?</p><p>Well, the incentive structure behind this idea is what truly makes Bitcoin and other blockchains so secure and ensures integrity! If your computer is the one to find a valid solution and the block is accepted by the other nodes into the chain of blocks, you get two rewards — Bitcoins and the fees that all the transactions incur.</p><p>Right now that would still amount up to 12.5 Bitcoins (even though this number is halving every 210.000 blocks), which would make you a nifty ~40.000 Euro — not too bad, heh?</p><p>As more and more people want to take part in this mining race (and thus the possibility to make some nice income), the total processing power increases — this is also called the total hash rate of the network. In order to ensure a steady production of new blocks (and therefore a steady process of minting new coins), the mining difficulty increases proportionally to the total hash rate of the network.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*tDiOIA80-Bj6-G0y" /><figcaption><a href="https://www.blockchain.com/de/charts/hash-rate">Source</a></figcaption></figure><p>Using<em> Proof of Work</em> has the advantage that it makes it extremely costly for malicious actors to introduce false transactions or change the ledger, since they would need to be in control of a vast amount of the total processing power within the network.</p><p>Blockchains that use <em>Proof of Work</em> as their consensus mechanism always encourage the computers that form part of their respective system, to take the chain with the most <em>Proof of Work</em> as the valid chain.</p><p>For an in-depth look into both Bitcoin and Ethereum, I’d humbly recommend you to read these two posts:</p><ul><li><a href="https://medium.com/blockwhat/08-bit-what-bitcoin-hello-world-166ac85141e">’08 | Bit what? Bitcoin! — Hello world.</a></li><li><a href="https://medium.com/blockwhat/13-ethereum-the-world-computer-bd22cecbc0d">’13 | Ethereum — The World Computer</a></li></ul><p>Before we end this section, I’d love to highlight some of the different ways in which different blockchains enable computers to mine and therefore perform the <em>Proofs of Work</em>.</p><p>There are mainly five different ways which can be used to take part in the mining process:</p><p><a href="https://en.bitcoinwiki.org/wiki/CPU_mining"><strong>CPU mining</strong></a> is utilising the Central Processing Unit of a computer, which is the “heart” of a computer, controlling instructions and the data flow inside a system.</p><p><a href="https://www.quora.com/What-is-graphics-card-mining"><strong>GPU mining</strong></a><strong> </strong>is using the Graphic Processor Unit (aka Graphic Card) to perform the required calculations.</p><p><a href="https://www.digitaltrends.com/computing/what-is-an-asic-miner/"><strong>ASIC mining</strong></a><strong> </strong>is making use of specialized chips that were designed to calculate hashes with a very high throughout. It stands for <em>Application Specific Integrated Circuits</em> and is the most widely used way for mining on Bitcoin and Ethereum currently.</p><p><a href="https://en.wikipedia.org/wiki/Mining_pool"><strong>Mining pools</strong></a><strong> </strong>bundle together the processing power of many individual computers and share the profits — for most people this is the most common and most effective way of taking part in the mining business.</p><p><a href="https://en.wikipedia.org/wiki/Cloud_mining"><strong>Cloud Mining</strong></a><strong> </strong>refers to the possibility of utilizing the services of a remote datacenter to take part in the mining process.</p><p>So far so good, before coming to an end of this post, we will briefly examine the limitations and problems surrounding<em> Proof of Work</em>.</p><h3>Limitations &amp; Problems</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*wYpeoRJ8HWMGfM7OmasUfg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/81QkOoPGahY?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Jose Aragones</a></figcaption></figure><p>While <em>Proof of Work</em> ensures a very high degree if security and integrity for blockchains, it also has its downsides.</p><p>For one, due to the very heavy processing that takes place, the energy required to perform all the random guessing is quite enormous.</p><p>The current hash rate of the Bitcoin network is above 38 trillion hashes per second for example. Since the Proof-of-Work algorithm consumes vast amounts of computing power and therefore energy, it is not very environmental friendly, consuming more that 47 Terrawatthours, almost equaling the annual energy consumption of Singapore.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/960/0*pWEue5SOarlDM2MG" /><figcaption><a href="https://digiconomist.net/bitcoin-energy-consumption">Source</a></figcaption></figure><p>Another problem are the <em>mining pools </em>that were mentioned above. The massive concentration of mining power into these pools has led to a de facto miner centralization — <a href="https://yanpritzker.com/is-bitcoin-mining-centralized-and-what-does-that-mean-for-my-coi-1fc1bc379601">there are opinions that suggest that this doesn’t really constitute a big problem tough</a>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*dlt26eu8hWHgzcJ1" /><figcaption><a href="https://www.blockchain.com/en/pools">Source</a></figcaption></figure><p>You’ve made it to the end of this post, congrats! I hope you’ve enjoyed reading this bit on <em>Proof of Work</em> and that your understanding of this crucial aspect of blockchain technology is now clearer to you.</p><p>If you have any questions, remarks or constructive feedback, please let me know — I’d love to get in contact with you.</p><p>All the best</p><p>Till</p><p>PS: If you’re looking for helpful and great resources to learn more about blockchain’s paradigm shifting technological potential,<a href="https://medium.com/blockwhat/reviews-resources/home"> check out these awesome resources</a>.</p><h3>Links for further reading</h3><p><a href="https://www.investinblockchain.com/proof-of-work-explained/">https://www.investinblockchain.com/proof-of-work-explained/</a></p><p><a href="https://medium.com/loom-network/understanding-blockchain-fundamentals-part-2-proof-of-work-proof-of-stake-b6ae907c7edb">https://medium.com/loom-network/understanding-blockchain-fundamentals-part-2-proof-of-work-proof-of-stake-b6ae907c7edb</a></p><p><a href="https://www.cs.cornell.edu/~ie53/publications/btcProcFC.pdf">https://www.cs.cornell.edu/~ie53/publications/btcProcFC.pdf</a></p><p><a href="https://www.verypossible.com/blog/pros-and-cons-of-different-blockchain-consensus-protocols">https://www.verypossible.com/blog/pros-and-cons-of-different-blockchain-consensus-protocols</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=387860493343" width="1" height="1" alt=""><hr><p><a href="https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343">Finding Consensus 2/4: Proof Of Work</a> was originally published in <a href="https://medium.com/blockwhat">blockwhat?</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Finding Consensus 1/4: Byzantine Fault Tolerance]]></title>
            <link>https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c?source=rss-1979c128cf83------2</link>
            <guid isPermaLink="false">https://medium.com/p/dd79aecf8d1c</guid>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[ethereum]]></category>
            <category><![CDATA[technology]]></category>
            <dc:creator><![CDATA[Till Antonio Mahler]]></dc:creator>
            <pubDate>Fri, 04 Jan 2019 15:34:21 GMT</pubDate>
            <atom:updated>2019-02-09T08:23:23.677Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*D1a3wrXwc0gWi65Na_fdyg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/3Zt0qoHUYb0?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">rawpixel</a></figcaption></figure><p>Hello there and welcome back to a new post here at <a href="https://medium.com/blockwhat/blockwhat-blockchain-781a47b34306"><em>blockwhat?</em></a>, it’s a pleasure to have you here.</p><p>Today’s story marks the beginning of a mini series of four posts, that will explore the way consensus is found in blockchain networks — an absolutely fascinating aspect of this nascent technology!</p><p>Join me for a captivating first post in which we will get to know a concept known as <strong>Byzantine Fault Tolerance</strong>, figure out what this comprises, the history behind it and what kind of solutions have been found in that area — absolutely mesmerizing stuff!</p><p>This article is part six of our journey into the technological foundations of blockchain technology.</p><p><a href="https://medium.com/blockwhat/blockwhat-but-why-7b3c08687f3">If you’re new here and want to understand what’s going on, just click here</a>.</p><ol><li><a href="https://medium.com/blockwhat/the-tech-behind-blockchains-6076d38d1490">The Tech Behind Blockchains</a></li><li><a href="https://medium.com/blockwhat/decentralized-c5a7a6ba5aab">A Journey Into Decentralization</a></li><li><a href="https://medium.com/blockwhat/hash-ing-everywhere-a-primer-on-hash-functions-24cdf43515d7">Hash(ing) Everywhere — A Primer On Hash Functions</a></li><li><a href="https://medium.com/blockwhat/public-key-cryptography-a-comprehensive-guide-1e8489e08104">Public Key Encryption — A Comprehensive Guide</a></li><li><a href="https://medium.com/blockwhat/merkle-trees-ensuring-integrity-on-blockchains-508d6647d58e">Merkle Trees — Ensuring Integrity On Blockchains</a></li><li>Finding Consensus 1/4: Byzantine Fault Tolerance (This article)</li><li><a href="https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343">Finding Consensus 2/4: Proof Of Work</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75">Finding Consensus 3/4: Proof Of Stake</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-4-4-alternative-consensus-mechanisms-3b8817bd6d57">Finding Consensus 4/4: Alternative Consensus Mechanisms</a></li><li>Network — Who’s Doing All This Stuff?</li></ol><p><a href="https://medium.com/altcoin-magazine/a-brief-prehistory-of-blockchain-957bcd45604c">If you’re interested in exploring the fascinating history behind blockchain, click right here and go down the rabbit hole.</a></p><h3>Introduction</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Hvs_Dqclz-uajcjmsgH4gA.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/3To9V42K0Ag?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">John Baker</a></figcaption></figure><p>This story revolves around something that’s at the core of our human existence and lays the basis for everything — figuring out what we actually want and making a decision.</p><p>It turns out that figuring out what we want (aka finding consensus) is also the essential glue that makes blockchains so unique and powerful. Blockchains are essentially ledgers that are recorded and updated by independent computers (aka nodes) that are dispersed all around the globe — for a visual impression check out the nodes that are currently part of the Bitcoin network for example.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/846/0*8sW5dycGb71dfFeB" /><figcaption><a href="https://bitnodes.earn.com/">Source</a></figcaption></figure><p>One of the most tricky parts is to get all those independent nodes to find consensus on what the correct state of the ledger is (e.g. who owns which Bitcoins).</p><p>In distributed systems like Bitcoin, one that is comprised of many different parts that communicate with each other and need to coordinate their actions, there is a pretty nasty class of failures that can occur and lead to potentially extremely severe outcomes.</p><p>This type of failures was first described by the three computer scientists Lamport, Shostak and Pease in their 1978 paper “<a href="https://lamport.azurewebsites.net/pubs/reaching.pdf"><em>Reaching Agreement in the Presence of Faults</em></a><em>”.</em></p><p>Upon originally publishing their findings, they called this failure class within finding consensus <strong>Interactive Consistency</strong> and it was only four years later that they published the same idea under the now commonly known name <strong>The Byzantine Generals Problem</strong>.</p><h3>The Byzantine Generals Problem</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*szsHMM9Ar2kbM4XmR8yg4g.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/QjakxjLPh-I?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Dean Hinnant</a></figcaption></figure><p>In their 1982 paper titled “<a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.126.9525&amp;rep=rep1&amp;type=pdf"><em>The Byzantine Generals Problem</em></a>” Lamport, Shostak and Pease devised an illustrious analogy to demonstrate the severeness of this problem.</p><p>The situation they came up with comprises a Byzantine army which is camped outside all around an enemy city. Their army consists of many different units, which all have their own commanding general.</p><p>After having carefully assessed the strength of their enemy who is defending the city, they know that they can only win if all units attack at the same time — if not, defeat is ensured.</p><p>Since the city is quite large and the army is encamped far away from each others positions, the generals can only communicate by messenger.</p><p>The essential task is to find a common strategy and execute it together — attack or retreat? It’s very important to note that the nature of the plan doesn’t matter at all — but rather that consensus on one common plan is found.</p><p>So far so good, now we introduce some potentially problematic variables into the situation though. What do we do when not all the generals or their messengers are loyal and honest?</p><p>For one, image a <strong>traitorous general</strong> who sends contradicting messages to the other generals, telling some to attack and some to retreat.</p><p>There is another factor that makes this situation arguably worse — potentially <strong>traitorous messengers. </strong>Since the generals can’t communicate directly with one another, they rely on their messengers. Instead of the generals who act dishonest, it could also very well be that some messengers will communicate faulty messages.</p><p>How can the Byzantine army make sure that all the generals still accept the same plan in spite of this challenge?</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/732/1*3knMRaz02wixcEyiT04CDg.jpeg" /><figcaption><a href="https://lisk.io/content/5-academy/2-blockchain-basics/4-how-does-blockchain-work/7-byzantine-fault-tolerance-explained/7a-byzantine-fault-tolerance.jpg">Source</a></figcaption></figure><p>These type of faults are called <strong>Byzantine faults</strong> and they refer to any fault that presents different symptoms to different observers. In the case described above, this refers to generals receiving contradictory messages either due to a traitorous general or a traitorous messenger.</p><p>If a system service that requires consensus to be performed is lost due to a <strong>Byzantine fault</strong>, it’s called a <strong>Byzantine failure.</strong> In this case, the failure to reach a common plan that is carried out by all the generals is the failed system service.</p><p>A system that can tolerate some of these faults and still come to a consensus is called <strong>Byzantine fault tolerant</strong>.</p><p>This problem relates directly to modern day distributed systems — the different computers are the generals and the communication systems they rely on are the messengers.</p><p>In the next section we will explore the implication of all this in distributed computer systems.</p><h3>Distributed Systems</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*VhkrZXE_rBraWGVA59o9kg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/aF2NlmdAm58?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Brandon Mowinkel</a></figcaption></figure><p>Byzantine faults<strong> </strong>are considered one of the most difficult class of failures in distributed computer systems.</p><p>Instead of a so-called <strong>fail-stop, </strong>where a node simply stops working and therefore ceases to send any data at all, in the case of a <strong>Byzantine failure</strong> the faulty node in question can still generate data and can appear to be correctly functioning to other nodes in the system. This can and does easily confuses fault detection systems, leading to severe outcomes.</p><p>It’s important to understand, that these types of failures are not necessarily due to security problems, but they can be due to simple electrical failures as well.</p><p>A big and problematic myth is that Byzantine faults are so rare that they will occur only in isolation. This is due to the common fallacy that assumes that random events are distributed uniformly in time — for example if we have a 1 in 500 year weather event this year, that it will take about another 500 years before it will happen again.</p><p>The reality in electronic distributed systems is rather that the conditions that cause an event can well persist, meaning that the probability of clustering is high!</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fgiphy.com%2Fembed%2Fl0Iy1U0KU3rBaewjm%2Ftwitter%2Fiframe&amp;display_name=Giphy&amp;url=https%3A%2F%2Fmedia.giphy.com%2Fmedia%2Fl0Iy1U0KU3rBaewjm%2Fgiphy.gif&amp;image=https%3A%2F%2Fi.giphy.com%2Fmedia%2Fl0Iy1U0KU3rBaewjm%2Fgiphy.gif&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=giphy" width="435" height="245" frameborder="0" scrolling="no"><a href="https://medium.com/media/6e0f2357ace07359a432080ae67ee132/href">https://medium.com/media/6e0f2357ace07359a432080ae67ee132/href</a></iframe><p>In fact, there are many examples where this type of failure had or could’ve had disastrous outcomes — so many, <a href="https://c3.nasa.gov/dashlink/resources/624/">that NASA published this report</a>, in which they detail some of them regarding a whole fleet of expensive aircraft and their very own Space Shuttle program.</p><p>There are many systems, in which redundant system components alone are not enough to ensure maximum security though.</p><p>Take airplanes for example — <a href="https://elaineou.com/2017/02/12/byzantine-fault-tolerant-airplanes/">Airbus and Boeing both incorporate a <strong>Byzantine fault tolerant</strong> system design, called SAFEbus</a>. The SAFEbus recipient nodes each receive four copies, and only record the message if all four are identical. Each transmitter controls its partner’s drivers and will silence the whole node if informed of too many errors.</p><p>The same level of scrutiny and reliability is needed also in nuclear power plants and of course spacecrafts. SpaceX’s Dragon spacecraft for example employs a Byzantine fault tolerant flight system design, since a radiation event may change memory or register values, potentially leading to disastrous outcomes.</p><p>Of course not only correct input is important, but also the processing of that information needs to be redundant — if you’re interested to go deeper into this topic, <a href="https://en.wikipedia.org/wiki/Common_cause_and_special_cause_(statistics)">explore common mode failures</a>.</p><p>After having understood the importance of this concept, we will now take a look at how it is applied in the context of blockchain technology.</p><h3>Consensus On Blockchains</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*3BTnZ2-4acYIifuhF-sbPA.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/Db-stA8meJY?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Kenna Phillips</a></figcaption></figure><blockquote>“A blockchain based system is as secure and robust as its consensus model.”</blockquote><blockquote>— Dr. Arati Baliga</blockquote><p>All the properties of blockchains that make them so unique and extraordinary, like immutability and auditability, are only safeguarded when the underlying assumptions are correct — and in order for them to be correct, consensus about this assertion needs to be found.</p><p>When it comes to blockchains, there are many different ways of finding consensus. Some approaches that build on Byzantine fault tolerance, are the following.</p><p>One of the earliest and most famous ones is the <a href="http://pmg.csail.mit.edu/papers/osdi99.pdf"><strong>Practical Byzantine Fault Tolerance protocol</strong></a>,<strong> </strong>which was written by Miguel Castro and Barbara Liskov in 1999.</p><p>This protocol enables Byzantine fault tolerance for distributed systems, one of the better known solutions who make use of this approach is <a href="https://medium.com/coinmonks/how-does-hyperledger-fabric-works-cdb68e6066f5"><strong>HyperledgerFabric</strong></a>.</p><p>It’s important to point out that this protocol does not work for permission-less blockchains (e.g. like Bitcoin or Ethereum), but is rather employed by private blockchains. This protocol is very communication heavy and therefore not really suitable for large scale blockchains.</p><p>Another approach is known as <strong>Federated Byzantine Agreement</strong>, which entails a federated voting process. This solution is used by <a href="https://www.mycryptopedia.com/stellar-lumens-xlm-explained/"><strong>Stellar</strong></a><strong> </strong>and<strong> </strong><a href="https://www.digitaltrends.com/computing/what-is-ripple/"><strong>Ripple</strong></a>, two big blockchains.</p><p>The most famous and widely used consensus method, which is called <strong>Proof of Work</strong> (and is employed by many public blockchains, such as Bitcoin, Ethereum), is interestingly enough technically seen not really Byzantine fault tolerant. Rather, it is a probabilistic solution to the problem — but more on this in the next post!</p><p>Many people, including Bitcoin’s inventor Satoshi Nakamoto, mistakenly describe that particular consensus mechanism as being Byzantine fault tolerant — if you want to read Nakamoto’s own take on this, <a href="https://www.mail-archive.com/cryptography@metzdowd.com/msg09997.html">I highly recommend you to read this email that he send out in late 2008.</a></p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fgiphy.com%2Fembed%2F10qMQz7Q1OKEdG%2Ftwitter%2Fiframe&amp;url=https%3A%2F%2Fmedia.giphy.com%2Fmedia%2F10qMQz7Q1OKEdG%2Fgiphy.gif&amp;image=https%3A%2F%2Fi.giphy.com%2Fmedia%2F10qMQz7Q1OKEdG%2Fgiphy.gif&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=giphy" width="435" height="245" frameborder="0" scrolling="no"><a href="https://medium.com/media/0deb472357b77a18dc323ba0c8aeda5b/href">https://medium.com/media/0deb472357b77a18dc323ba0c8aeda5b/href</a></iframe><p>So far so good for an introduction to the way consensus is found in a blockchain context — thank you very much for powering through this post, I hope you enjoyed it!</p><p>Please let me know if you have any questions, remarks or feedback, I’d gladly hear from you. If you liked this post, I’d be more than happy if you leave a clap (or two), share it with your friends and follow the future stories here on <a href="https://medium.com/blockwhat"><em>blockwhat?</em></a>.</p><p>All the best</p><p>Till</p><p>PS: If you’re looking for helpful and great resources to learn more about blockchain’s paradigm shifting technological potential, <a href="https://medium.com/blockwhat/reviews-resources/home">check out these awesome resources</a>.</p><h3>Links For Further Reading</h3><p><a href="https://pdfs.semanticscholar.org/da8a/37b10bc1521a4d3de925d7ebc44bb606d740.pdf?_ga=2.21200635.1919538867.1522092864-1798624458.1520283070">https://pdfs.semanticscholar.org/da8a/37b10bc1521a4d3de925d7ebc44bb606d740.pdf?_ga=2.21200635.1919538867.1522092864-1798624458.1520283070</a></p><p><a href="https://www.cs.indiana.edu/classes/p545/post/lec/fault-tolerance/Driscoll-Hall-Sivencrona-Xumsteg-03.pdf">https://www.cs.indiana.edu/classes/p545/post/lec/fault-tolerance/Driscoll-Hall-Sivencrona-Xumsteg-03.pdf</a></p><p><a href="https://blog.cdemi.io/byzantine-fault-tolerance/">https://blog.cdemi.io/byzantine-fault-tolerance/</a></p><p><a href="https://medium.com/loom-network/understanding-blockchain-fundamentals-part-1-byzantine-fault-tolerance-245f46fe8419">https://medium.com/loom-network/understanding-blockchain-fundamentals-part-1-byzantine-fault-tolerance-245f46fe8419</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=dd79aecf8d1c" width="1" height="1" alt=""><hr><p><a href="https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c">Finding Consensus 1/4: Byzantine Fault Tolerance</a> was originally published in <a href="https://medium.com/blockwhat">blockwhat?</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Merkle Trees — Ensuring Integrity On Blockchains]]></title>
            <link>https://medium.com/blockwhat/merkle-trees-ensuring-integrity-on-blockchains-508d6647d58e?source=rss-1979c128cf83------2</link>
            <guid isPermaLink="false">https://medium.com/p/508d6647d58e</guid>
            <category><![CDATA[ethereum]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[bitcoin]]></category>
            <dc:creator><![CDATA[Till Antonio Mahler]]></dc:creator>
            <pubDate>Wed, 26 Dec 2018 21:00:51 GMT</pubDate>
            <atom:updated>2019-02-06T15:07:52.878Z</atom:updated>
            <content:encoded><![CDATA[<h3>Merkle Trees — Ensuring Integrity On Blockchains</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*9bNqu8F0noIfvf862zqDFQ.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/efOgkiiCdqU?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Liam Pozz</a></figcaption></figure><p>Welcome to a new post here at <a href="https://medium.com/blockwhat/blockwhat-blockchain-781a47b34306"><em>blockwhat?</em></a>, where we explore the mesmerizing technological fabric that powers blockchains.</p><p>In this post we will take a look at a fascinating concept known as <strong>Merkle Trees</strong> and find out how they ensure integrity on blockchains. After getting to know the history behind it, we will examine how it works and why it matters, especially in a blockchain context.</p><p>An exciting journey into one of the fundamental parts that make blockchains so powerful — let’s go!</p><p>This article is part five of our journey into the technological foundations of blockchain technology.</p><p><a href="https://medium.com/blockwhat/blockwhat-but-why-7b3c08687f3">If you’re new here and want to understand what’s going on, just click here.</a></p><ol><li><a href="https://medium.com/blockwhat/the-tech-behind-blockchains-6076d38d1490">The Tech Behind Blockchains</a></li><li><a href="https://medium.com/blockwhat/decentralized-c5a7a6ba5aab">A Journey Into Decentralization</a></li><li><a href="https://medium.com/blockwhat/hash-ing-everywhere-a-primer-on-hash-functions-24cdf43515d7">Hash(ing) Everywhere — A Primer On Hash Functions</a></li><li><a href="https://medium.com/blockwhat/public-key-cryptography-a-comprehensive-guide-1e8489e08104">Public Key Encryption — A Comprehensive Guide</a></li><li>Merkle Trees — Ensuring Integrity On Blockchains (This article)</li><li><a href="https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c">Finding Consensus 1/4: Byzantine Fault Tolerance</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-2-4-proof-of-work-387860493343">Finding Consensus 2/4: Proof of Work</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75">Finding Consensus 3/4: Proof Of Stake</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-4-4-alternative-consensus-mechanisms-3b8817bd6d57">Finding Consensus 4/4: Alternative Consensus Mechanisms</a></li><li>Network — Who’s Doing All This Stuff?</li></ol><p><a href="https://medium.com/altcoin-magazine/a-brief-prehistory-of-blockchain-957bcd45604c">If you’re interested in exploring the fascinating history behind blockchain, click right here and go down the rabbit hole.</a></p><h3>Introduction</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*fZC8VX1fNFxQYRBhKQkUvA.jpeg" /><figcaption><a href="http://www.exponentialtimes.net/sites/default/files/merkle1.jpg">Source</a></figcaption></figure><p>This man in the picture above is Ralph Merkle — a highly influential computer scientist who is also known as the father of modern public key cryptography. Not bad, eh?</p><p>Merkle turned out be an exceptionally smart man already early on — while still being an undergrad, he coming up with an ingenious concept known as <a href="https://en.wikipedia.org/wiki/Merkle%27s_Puzzles"><strong>Merkle Puzzle</strong></a> in 1974. His idea was groundbreaking and revolved around the question, how two parties can safely exchange secrets even if they have never exchanged secrets before, without anybody else being able to listen in on their exchange.</p><p>His solution to this problem was astonishing and works the following way. Let’s assume that the super secret spy Alice wants to communicate with the heroic insider Bob from Evil Corporation, who has an important piece of information that could save the world from eternal evil.</p><p>In order for Alice to securely communicate with Bob, she decides to use Merkle’s Puzzle. By doing so, she sends Bob thousands of encrypted messages who all contain a different key. The interesting thing about all of those messages is, that while they are encrypted, this encryption is not super duper difficult to break — it takes a couple of minutes for each message though.</p><p>Now, Bob chooses a random message out of the thousands that he received from Alice and starts to decrypt it. After 15 minutes his computer has decrypted the message and now he can see the key that was hidden inside. He now writes a message, uses the key to encrypt it and sends it back to Alice.</p><p>Since Alice knows which keys she has sent and which keys belong together, she can now easily find out which key, out of the thousands she sent to Bob, has been chosen by him. From now on they both can easily communicate with each other — and any possible hacker or malicious party would have a very hard time of figuring out what’s happening. Why?</p><p>Well, in order to understand their encrypted messages, the hacker would need to decrypt all of the thousands of messages sent (which would require enormous amounts of processing power) and check every possible key with the messages.</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fgiphy.com%2Fembed%2FwpoLqr5FT1sY0%2Ftwitter%2Fiframe&amp;display_name=Giphy&amp;url=https%3A%2F%2Fmedia.giphy.com%2Fmedia%2FwpoLqr5FT1sY0%2Fgiphy.gif&amp;image=https%3A%2F%2Fi.giphy.com%2Fmedia%2FwpoLqr5FT1sY0%2Fgiphy.gif&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=giphy" width="435" height="315" frameborder="0" scrolling="no"><a href="https://medium.com/media/481bcab67c71a0aaaadb42753472ce4a/href">https://medium.com/media/481bcab67c71a0aaaadb42753472ce4a/href</a></iframe><p>So far, so good — Merkle’s Puzzle was an early idea for a public key environment. If you want to read more about <strong>Public Key Cryptography, </strong>check out this post:</p><p><a href="https://medium.com/blockwhat/public-key-cryptography-a-comprehensive-guide-1e8489e08104">Public Key Cryptography — A Comprehensive Guide</a></p><p>Like this groundbreaking idea hasn’t been enough, five years later he and his college Ivan Damgård came up with another innovative concept known as the <a href="https://en.wikipedia.org/wiki/Merkle%E2%80%93Damg%C3%A5rd_construction"><strong>Merkle–Damgård construction</strong></a>, which he published as his PhD thesis in 1979. This idea is also known as a <strong>cryptographic hash function </strong>and plays a big role in Merkle Trees. But more on this later.</p><p>In the same year, he published his paper <a href="http://www.merkle.com/papers/Certified1979.pdf">“A certified digital signature”</a> — this idea became known as <strong>Merkle Trees.</strong></p><p>Let’s see what it describes:</p><blockquote>“The invention comprises a method of providing a digital signature for purposes of authentication of a message, which utilizes an authentication tree function of a one-way function of a secret number.”</blockquote><p>Say what?</p><p>No worries, in this post we will dissect the different aspects of this and by the end you’ll have no problem understanding what Merkle Trees are and why they are incredibly important!</p><p>His idea revolved around a new and highly efficient way to create digital signatures or proofs. By using his idea, we now have a very practical way of efficiently summarizing large sets of data and verifying their integrity.</p><p>Before we get into the nitty gritty details of this, we need to recap one important building block of his idea — hash functions.</p><h3>Hash Functions</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*ij4OThN8DISD0zwH-7UlWQ.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/yD5rv8_WzxA?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Nick Hillier</a></figcaption></figure><p><strong>Hash functions</strong>, if broken down, are very straightforward and easy to understand.</p><p>A hashing algorithm takes an input (this can be literally anything), runs it through some magic mathematical processes and then creates a unique output (called a hash).</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*imr8xQdKYLI78Re_BiP3Mg.gif" /><figcaption><a href="https://cdn-images-1.medium.com/max/800/1*WYP37qLVKYsDZtCrOxz_Kg.gif">Source</a></figcaption></figure><p>What makes hashing algorithms so incredibly useful, is the property that the slightest change in the input completely alters the output. This property is what makes hashing algorithms so powerful — because they can be used to validate data and detect even the slightest change to them.</p><p>Ralph Merkle came up with a fundamental idea in this area as well — remember the ominous Merkle–Damgård construction that we talked about earlier?</p><p><strong>Cryptographic hash functions</strong> are a special class of hash functions that at the first impression sound quite intimidating, but they are actually quite easy to understand. These special hash functions serve a very important purpose in the field of cryptography and are widely used in online payments,<a href="https://www.pickaweb.co.uk/kb/what-is-https/"> the HTTPS protocol</a> and , you guessed it, blockchain technology.</p><p>These hash functions have a couple of very important characteristics, listed below:</p><p><strong>Deterministic</strong>: for the same input you will always get the same output.</p><p><strong>Quick computation</strong>: they can be quickly computed (no brainer).</p><p><strong>Pre-Image Resistance</strong>: it is infeasible to to determine the input through the output.</p><p><strong>Every change in the input changes resulting hash</strong>: indispensable for immutability of records.</p><p><strong>Collision Resistant</strong>: it is infeasible for two inputs to have the same hash.</p><p><strong>Puzzle Friendly</strong>: its infeasible but not impossible to deduce a certain input</p><p>If you want to deep dive into this topic, I highly recommend you to read this complementary post:</p><p><a href="https://medium.com/blockwhat/hash-ing-everywhere-a-primer-on-hash-functions-24cdf43515d7">Hash(ing) Everywhere — A Primer On Hash Functions</a></p><p>One of the most widely used cryptographic hash functions is the SHA256. The SHA is an acronym for <em>Secure Hash Algorithm </em>and the 256 relates the number of bytes that are produced as a result. These 256 bites will be always represented as a 64 character number, no matter how big (all of wikipedia) or how small (just one letter) the input is.</p><p>Now that we know what hash functions are, especially cryptographic hash functions, we are ready to look at these mysterious Merkle trees.</p><h3>Merkle Trees</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*wuL-YFAF_EQPmfYs" /><figcaption><a href="https://i.stack.imgur.com/ExJSC.png">Source</a></figcaption></figure><p>Don’t be intimidated by the looks of this beauty above! What you can see there is a lovely <strong>Merkle tree.</strong> The hashes at the very bottom are called <strong>leafs</strong>, the hashes above them <strong>branches</strong> and last but not least, we have the <strong>root </strong>at the very top.</p><p>As already stated above, this idea lets us very efficiently summarize large sets of data and verify that a specific data block is part of the larger data set.</p><p>How so?</p><p>Well, we take all the bits of data (e.g.transactions) and pair them — if its an odd number, we simply take the last remaining one and pair it with itself . Then, all of the individual transactions are run through a hashing algorithm and added together. This process continues until we’re left with one final hash — which is also known as the <strong>Merkle root</strong>.</p><p>The unique nature of hashes, that even the slightest change in the original input completely changes the output, is what makes this idea so incredibly powerful.</p><p>Changing one of the original <em>leafs</em><strong><em> </em></strong><em>(e.g. individual transactions) </em>would lead to that particular hash being altered — this in turn would alter all the other hashes up to the <em>Merkle root</em>. This allows for an easy verification of the validity of the complete database.</p><p>In the picture above we only had a very small <em>Merkle tree</em>, the real power lies in the magic this concept can work in bigger databases, like the one below.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*loOxXpPLQMd7wFAV" /><figcaption><a href="https://i.stack.imgur.com/2Ep7y.png">Source</a></figcaption></figure><p>Let’s assume that you want to check if a certain piece of data is valid and has not been altered — for example <strong>K</strong>.</p><p>It would be a real hassle and computational effort to check every single piece of data in the database above. <em>Merkle trees</em> enable us to do a nice short cut now — we only need 4 pieces of information, instead of checking the whole tree (<strong>L, IJ, MNOP and ABCDEFGH)</strong>.</p><p>We start by seeing if the hash of <strong>K </strong>and <strong>L</strong> give us the right hash <strong>KL</strong>. Then, cascading our way up, we continuously check the corresponding hashes all the way up to the <strong>Root. </strong>If the original piece of information was indeed valid and has not been altered, we should end up with exactly the same <em>root hash</em><strong><em>.</em></strong></p><p>And voila, instead of checking every single piece of data, we could get the job done way faster.</p><p>This ingenious concept gives us three very useful applications:</p><ol><li>We can easily <strong>prove the integrity and validity</strong> of data contained in a database.</li><li>It <strong>requires only little memory or disk space</strong> — since we have only the hashes of all the data, it is computationally easy and fast.</li><li>In order to verify the integrity and validity of data, only tiny amounts of information is required to be transmitted.</li></ol><p>Now let’s see what role <strong>Merkle trees</strong> play in the context of blockchain technology.</p><h3>Application in Blockchains</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*omY4Vo2r8FUU8lHX1nj2JQ.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/XyNi3rUEReE?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Thom</a></figcaption></figure><p>Before we explore why <strong>Merkle trees</strong> are an essential part of blockchains, it’s important to understand how blockchains are actually composed.</p><p>Blockchains are basically recording changes in the state of a network — changes that happen when transactions take place, smart contracts are triggered, etc.</p><p>All these state changes are bundled into blocks — in the case of Bitcoin roughly every 10 min and in Ethereum every 12 seconds. These blocks are structured roughly like in the graphic below.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*imvNmIRjzZzGpcWJ" /><figcaption><a href="https://lisk.io/content/5-academy/2-blockchain-basics/4-how-does-blockchain-work/5-what-is-hashing/15a-structure-of-blockchain.jpg">Source</a></figcaption></figure><p>All these blocks have a so-called <strong>block header. </strong>There are six different values that are stored here, for now the only one we care about is the <strong>Merkle root</strong> though, which is called Tx_Root in the graphic above (Tx = Transaction).</p><p>The are hundreds of thousands of blocks each possibly containing thousands of transactions. In order to verify all transactions happening, a huge amount of processing power would be needed if computers would need to query and search the whole database each time they want to validate that a certain transaction has happened. Why do we even need to know if certain transactions happened?</p><p>Well, if you own one Bitcoin (<a href="https://blockonomi.com/utxo-vs-account-based-transaction-models/">Ethereum employs a different model</a>), you actually don’t really “own” that specific token as one whole unit. Rather, you have a right to so-called <a href="https://komodoplatform.com/whats-utxo/"><strong>unspent transaction outputs (UTXO)</strong></a>. We won’t go in-depth here, for now it’s simply important to understand that the tokens you want to spend might have been transferred to you <em>n-</em>number of blocks ago, so in order to verify that you really have the tokens you say you have, the computer needs to be able to go back and search for a block in the past.</p><p>Every transaction has an ID, which is a 64 character code that takes up 32 bytes of memory. If we now think of the thousands and thousands of transactions that a computer would have to search through in order to validate one transaction, it would be extremely processing intense and inefficient.</p><p>While blockchains would be technically possible without <em>Merkle trees</em>, they nevertheless<strong> </strong>play an essential role when it comes to ensuring integrity and efficiency. By applying the <em>Merkle magic</em>, all the transactions that are included in one block are now easily verifiable.</p><p>Let’s take the visual below as an example (if you click on it, it becomes bigger).</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*A6JqYf2twJqcz1qx" /><figcaption><a href="https://lisk.io/content/5-academy/2-blockchain-basics/4-how-does-blockchain-work/5-what-is-hashing/11b-merke-tree.jpg">Source</a></figcaption></figure><p>In it, you see all the transactions that are repeatedly hashed and together make up this magnificent <em>Merkle tree</em>.</p><p>If we need to verify if a certain transaction happened (and you thus have the Bitcoins you claim you can spend), we simply need a couple of infos. Apart from the block number, we simply need the corresponding hashes and can easily verify that the transaction <strong>8</strong> is indeed included in that block.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*T0tH5TfKCxohEkrm" /><figcaption><a href="https://lisk.io/content/5-academy/2-blockchain-basics/4-how-does-blockchain-work/5-what-is-hashing/11c-merke-tree-highlighted.jpg">Source</a></figcaption></figure><p><em>Merkle trees</em><strong> </strong>enable another really cool feature of blockchains. Nowadays, a copy of the whole blockchain in the case of Bitcoin amounts up to <a href="https://www.statista.com/statistics/647523/worldwide-bitcoin-blockchain-size/">~ 184 gb</a>. This size makes it impossible to carry around on a mobile phone or many computers.</p><p>In order to still be able to interact with the blockchain and to engage in transactions, so-called <strong>Simplified Payment Verification </strong>clients make use of <em>Merkle trees</em>. Since we don’t need that many informations in order to ensure integrity and verify certain transactions, by using <em>Merkle trees</em> we can also use Wallet applications from our phones! (We’ll cover this topic in a future article)</p><p>While most <em>Merkle trees </em>are of a binary nature, Ethereum uses a special type of <em>Merkle tree</em> with three inputs, called <strong>Patricia trees </strong>(or also tries). If you feel like, <a href="https://blog.ethereum.org/2015/11/15/merkling-in-ethereum/">you can read more about it in this intriguing article by Vitalik Buterin</a>.</p><p>Wow, you’ve made it all the way to the end — I hope that you’ve enjoy the read and in case you have any questions or feedback, please let me know, I’d love to hear from you.</p><p>All the best</p><p>Till</p><p>PS: If you’re looking for helpful and great resources to learn more about blockchain’s paradigm shifting technological potential,<a href="https://medium.com/blockwhat/reviews-resources/home"> check out these awesome resources</a>.</p><h3>Links For Further Reading</h3><p><a href="https://blockonomi.com/merkle-tree/">https://blockonomi.com/merkle-tree/</a></p><p><a href="https://www.komodoplatform.com/whats-merkle-tree/">https://www.komodoplatform.com/whats-merkle-tree/</a></p><p><a href="https://blog.ethereum.org/2015/11/15/merkling-in-ethereum/">https://blog.ethereum.org/2015/11/15/merkling-in-ethereum/</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=508d6647d58e" width="1" height="1" alt=""><hr><p><a href="https://medium.com/blockwhat/merkle-trees-ensuring-integrity-on-blockchains-508d6647d58e">Merkle Trees — Ensuring Integrity On Blockchains</a> was originally published in <a href="https://medium.com/blockwhat">blockwhat?</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Public Key Cryptography — A Comprehensive Guide]]></title>
            <link>https://medium.com/blockwhat/public-key-cryptography-a-comprehensive-guide-1e8489e08104?source=rss-1979c128cf83------2</link>
            <guid isPermaLink="false">https://medium.com/p/1e8489e08104</guid>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[ethereum]]></category>
            <dc:creator><![CDATA[Till Antonio Mahler]]></dc:creator>
            <pubDate>Mon, 24 Dec 2018 15:04:04 GMT</pubDate>
            <atom:updated>2019-02-06T15:08:20.815Z</atom:updated>
            <content:encoded><![CDATA[<h3><strong>Public Key Cryptography — A Comprehensive Guide</strong></h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*TiltvM4ydji8sXcvbsEL_Q.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/pY_AZJfdbHQ?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Matt Artz</a></figcaption></figure><p>It’s a pleasure to have you here at <a href="https://medium.com/blockwhat/blockwhat-blockchain-781a47b34306"><em>blockwhat?</em></a>, together we will explore the fascinating technological ideas that make blockchains so unique.</p><p>In this post we will explore a concept that plays a foundational role in ensuring information and computer security — <strong>Public Key Cryptography</strong><em>.</em> Since this fascinating idea is the heart of blockchain technology, we will dive into its history, grasp how it works and examine the practical applications in the context of blockchains.</p><p>An absolutely technological marvel with a captivating history — let’s get started!</p><p>This article is part four of our journey into the technological foundations of blockchain technology.</p><p><a href="https://medium.com/blockwhat/blockwhat-but-why-7b3c08687f3">If you’re new here and want to understand what’s going on, just click here.</a></p><ol><li><a href="https://medium.com/blockwhat/the-tech-behind-blockchains-6076d38d1490">The Tech Behind Blockchains</a></li><li><a href="https://medium.com/blockwhat/decentralized-c5a7a6ba5aab">A Journey Into Decentralization</a></li><li><a href="https://medium.com/blockwhat/hash-ing-everywhere-a-primer-on-hash-functions-24cdf43515d7">Hash(ing) Everywhere — A Primer On Hash Functions</a></li><li>Public Key Encryption — A Comprehensive Guide (This article)</li><li><a href="https://medium.com/blockwhat/merkle-trees-ensuring-integrity-on-blockchains-508d6647d58e">Merkle Trees — Ensuring Integrity On Blockchains</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-1-4-byzantine-fault-tolerance-dd79aecf8d1c">Finding Consensus 1/4: Byzantine Fault Tolerance</a></li><li><a href="http://v/">Finding Consensus 2/4: Proof of Work</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-3-4-proof-of-stake-74c573b8bc75">Finding Consensus 3/4: Proof Of Stake</a></li><li><a href="https://medium.com/blockwhat/finding-consensus-4-4-alternative-consensus-mechanisms-3b8817bd6d57">Finding Consensus 4/4: Alternative Consensus Mechanisms</a></li><li>Network — Who’s Doing All This Stuff?</li></ol><p><a href="https://medium.com/altcoin-magazine/a-brief-prehistory-of-blockchain-957bcd45604c">If you’re interested in exploring the fascinating history behind blockchain, click right here and go down the rabbit hole.</a></p><h3>History</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*_TOwTSw57Ze01xIMzCDr8w.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/EF8Jr-uPS2Y?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">rawpixel</a></figcaption></figure><p>The origins of our story today reach a long time back into hour past, a couple thousands of years …</p><p>Cryptography has always played an important role in ensuring that sensitive information did not fall into the wrong hands — back then, these were mostly military secrets.</p><p>One of the most famous encryption methods used to be the so-called <a href="https://learncryptography.com/classical-encryption/caesar-cipher"><strong>Julius Caesar Cypher</strong>,</a> which you all have probably also used in the exciting days of your childhood when you wanted to send secret messages to your friends. The way this method works is pretty straightforward — you apply a simple mathematical logic to the message that you want to encrypt. For example, that you move back three letters to the left from the original letter that you want to send.</p><p>So if we want to encrypt an “H”, we go three letters to the left and end up with an “E”.</p><p>ABCDEFG<strong>H</strong> -&gt; ABCD<strong>E</strong>FGH</p><p>You can see a lovely visualization of this concept below.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*WN2CyauY238LW4DO" /><figcaption><a href="https://lisk.io/content/5-academy/2-blockchain-basics/4-how-does-blockchain-work/2-blockchain-cryptography-explained/5-julius-caesar-encryption.gif">Source</a></figcaption></figure><p>During the centuries, the methods of encrypting messages became more and more sophisticated. Especially the evolving field of complex mathematics lead to innovative and strong new ways of encrypting and decrypting of information. This made sure that the information could only be viewed by the intended recipients and nobody else.</p><p>The way these techniques work are known as <strong>symmetric key encryption. </strong>This method uses complex mathematical concepts to encrypt information with a so-called private key. The message was now unreadable to everybody and could only be reversed to the original state by applying the same private key. In order to use this form of encryption, the corresponding private key had to be shared with everybody who was supposed to be able to read the secret messages (e.g. generals in the army, ambassadors, etc.).</p><p>This system of using a private key to encrypt and decrypt information turned out to be pretty secure — as long as nobody unintended had also access to this private key. The keys had to be regularly changed though, just in case the key or the person carrying it fell into the wrong hands.</p><p>Below you can see a great visualization of this concept.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*KuUKbWQbMdvFJvfE" /><figcaption><a href="https://lisk.io/content/5-academy/2-blockchain-basics/4-how-does-blockchain-work/2-blockchain-cryptography-explained/4-symmetric-key-cryptography.jpg">Source</a></figcaption></figure><p>One very famous example of symmetric-key cryptography was the <a href="https://en.wikipedia.org/wiki/Enigma_machine"><strong>Enigma machine</strong></a><strong> </strong>that the German Military used in the second world war to encrypt their messages. The allied forces had a very hard time breaking the code used by the Germans — <a href="https://www.iwm.org.uk/history/how-alan-turing-cracked-the-enigma-code">until Alan Turing brilliantly managed to crack it</a>.</p><p>So far we’ve read about the <strong>Julius Caesar cypher</strong> and <strong>symmetric key encryption </strong>(also known as private key encryption) — let’s focus on the truly revolutionary invention of <strong>public key encryption </strong>next!</p><h3>Public Key Encryption</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*ou27uef_kSZs9WBJhQ1Wnw.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/lmFJOx7hPc4?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Micah Williams</a></figcaption></figure><p>The story of this groundbreaking invention is a fascinating one — involving the British intelligence service “British Government Communications Headquarter” (GCHQ).</p><p>In 1969, a research scientist named John Ellis made one of the greatest breakthroughs in modern encryption and code breaking while working for GCHQ. His invention was so essential and far fetching to the future of information security, that the GCHG decided to keep it a secret for over 27 years — it was only declassified in 1997.</p><p>It’s an absolutely stunning piece of modern computer science history and if you’re enticed to read more about it, <a href="https://www.telegraph.co.uk/history/12191473/The-unsung-genius-who-secured-Britains-computer-defences-and-paved-the-way-for-safe-online-shopping.html">just click right here</a>.</p><p>As an interesting twist of history, the same concept that John Ellis came up with originally, was replicated at a public institution in 1976 — a team of researchers at MIT and Stanford then had the ability to publish their findings and they were originally credited with the invention. It wasn’t until many years later, that John Ellis got the recognition for his idea.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/620/1*vGUCyTF26gY6u0BTmyQmHA.jpeg" /><figcaption><a href="https://secure.i.telegraph.co.uk/multimedia/archive/03593/james_ellis4_3593310b.jpg">Source</a></figcaption></figure><p>So what exactly was so important that the British intelligence community decided to keep it a secret?</p><p>It’s a marvelous concept known as <strong>Public Key Encryption</strong> and the idea behind it is truly exceptional. While up to that point the responsibility of encrypting a message always laid on the sender of it, he thought out of the box and reversed the process — including the recipient in encrypting a message in a truly ingenious way.</p><p>It works as follows:</p><p>We start by taking a random string of numbers (e.g. 3860280357), from now on this will be called our <em>private key</em>) and mathematically derive another string of numbers from it — the resulting new string of numbers is called <em>public key</em>. A very important aspect of this process is, that it’s a so called <em>trap door function</em>, which means that it’s very easy to calculate it into one direction (ergo from <em>private key </em>to <em>public key</em>), but not the other way around (aka it’s almost impossible to derive the <em>private key </em>from the <em>public key</em>), without having some important information (aka the trapdoor).</p><p>This very abstract sounding concept enables us to do some marvelous things though, because we can now take a piece of data, use our <em>public key</em> and scramble it up (<a href="https://medium.com/searchencrypt/what-is-encryption-how-does-it-work-e8f20e340537">by using some encryption magic</a>). For everybody out there this new data set is incomprehensible and unreadable. In order to unscramble it and to make it readable, one need to be in possession of the corresponding <em>private key</em>. Whoever has that key, can now use some mathematical magic and unscramble the data. Voila!</p><p>You can see this process illustrated in the picture below.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*PzbEWogFI6nK8WV9" /><figcaption><a href="https://lisk.io/content/5-academy/2-blockchain-basics/4-how-does-blockchain-work/2-blockchain-cryptography-explained/6-public-key-cryptography-1.jpg">Source</a></figcaption></figure><p>You can think of this abstractly like this — the public address is your bank account and the private key is your secret PIN. The address can be safely broadcasted to the public, while it is indispensable to keep your PIN safe and secret.</p><p>This amazing new way of encrypting information made it become an Important mathematical foundation for information and computer security, since it helps to ensure authenticity and integrity of a message when communication over an unreliable channel of communication (e.g. the internet).</p><blockquote>“Strong, relatively cheap encryption became ‘democratised’ and enabled more secure communications on a global scale. Encryption went from being a tool of strategic advantage between super-power blocs, but to a key enabler of individual freedom and safety.”</blockquote><blockquote>- Robert Hannigan, Director of GCHQ</blockquote><p>The fact that the mathematical functions used in Public Key Cryptography have the unique characteristic that they are almost irreversible, meaning that they can only easily be calculated into one direction and not the opposing one, enabled something truly revolutionary — the creation of unforgeable <strong>digital signatures</strong> and digital secrets.</p><h3>Digital Signatures</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*DOkMZGpaJItaW3W1oa_Daw.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/8XddFc6NkBY?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Art Lasovsky</a></figcaption></figure><p>A really cool thing you can do with this <strong>public key encryption</strong> is to digitally sign a document. In order to do this, instead of using the public key to scramble a message, we now use the private key.</p><p>By doing so, everybody can easily verify that we have digitally “signed” the document by checking if the corresponding hashes matches.</p><p>Below you have a lovely visualization of how this works.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/800/0*_MKT3oUju5QzuDS0" /><figcaption><a href="https://exonum.com/blog/content/images/2018/02/CPKDSS@2x.jpg">Source</a></figcaption></figure><p>Digital signatures are at the core of how transactions work and can take place on a blockchain.</p><p>They are used as a mathematical scheme to prove the authenticity of a digital message, meaning that they prove ownership of a private key without revealing that private key. Crazy stuff!</p><p>We’ll cover more in the section below. Let’s now explore how public key cryptography is powering blockchain technology.</p><h3>Applications in Blockchain</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*D-rN_hTJ2juvzyd0zFsr7Q.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/N4FB-VFMNEk?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Sneaky Elbow</a></figcaption></figure><p>Public key cryptography is at the heart of blockchain technology and enables many of the exciting characteristics that make them so unique — it’s essential for the wallet creation and the signing of transactions.</p><p>Wallets is simply another name for the long addresses that you’ll get when interacting with a blockchain.</p><p>Let’s see how this process actually works.</p><p>The first step is to generate a private key. This private key is basically a random number and is of utmost importance, since only the private key can exercise ownership and control over data, for example Bitcoin, that is encoded in the blockchain. Therefore it must be properly stored and backed up, since losing it is synonymous to losing access to all the data. In order to generate a proper random number it is essential to find a secure source of entropy and the usage of cryptographically secure pseudorandom number generators is highly encouraged.</p><p>After having found a random number, a public key is subsequently generated based on it. Both Bitcoin and Ethereum use <a href="https://en.wikipedia.org/wiki/Elliptic-curve_cryptography">Elliptic Curve Multiplication (ECM)</a> as the mathematical function with which a public key is generated from a private key. ECM is a so-called “trap door” function, meaning that is it easy calculate into one direction and impossible to do in reverse, as already mentioned above. Thus, it is not possible to deduce the private key from a public key and it serves as a fundament for secure digital signatures.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/409/1*KKdvscN4y-NcGZ8Nnx1ZYQ.png" /><figcaption><a href="https://cdn.arstechnica.net/wp-content/uploads/2013/10/elliptic-curve-crypt-image00.png">A fancy looking elliptic curve</a></figcaption></figure><p>Apart of creating the addresses used to store and transfer information, <strong>public key cryptography</strong> also plays an essential role in digitally signing transactions.</p><p>This concept serves three purposes within Bitcoin and Ethereum. Firstly, it <strong>authenticates</strong> that the owner of the data has authorized the transaction to take place. Secondly, it shows that the sender cannot deny having sent the message, thus proves <strong>nonrepudiation</strong>. And thirdly, it ensures that the transaction or message <strong>has not been altered</strong> and cannot be modified.</p><p>A digital signature is created by taking a private key from the transaction or message and then running it through the <a href="https://en.wikipedia.org/wiki/Elliptic_Curve_Digital_Signature_Algorithm">Elliptic Curve Digital Signature Algorithm</a>. The resulting digital signature can then be easily verified by other nodes.</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fgiphy.com%2Fembed%2FSDogLD4FOZMM8%2Ftwitter%2Fiframe&amp;display_name=Giphy&amp;url=https%3A%2F%2Fmedia.giphy.com%2Fmedia%2FSDogLD4FOZMM8%2Fgiphy.gif&amp;image=https%3A%2F%2Fi.giphy.com%2Fmedia%2FSDogLD4FOZMM8%2F200.gif&amp;key=d04bfffea46d4aeda930ec88cc64b87c&amp;type=text%2Fhtml&amp;schema=giphy" width="435" height="244" frameborder="0" scrolling="no"><a href="https://medium.com/media/40aadcaeaf5af56bb411677826bd89c3/href">https://medium.com/media/40aadcaeaf5af56bb411677826bd89c3/href</a></iframe><p>I hope you’re walking away more knowledgeable about this fascinating aspect of blockchain technology and that you’ve enjoyed the read.</p><p>If you have any questions or comments, please don’t hesitate to let me know, I’d love to hear from you!</p><p>Yours truly</p><p>Till</p><p>PS: If you’re looking for helpful and great resources to learn more about blockchain’s paradigm shifting technological potential,<a href="https://medium.com/blockwhat/reviews-resources/home"> check out these awesome resources</a>.</p><h3>Links for further reading</h3><p><a href="https://hackernoon.com/a-closer-look-at-ethereum-signatures-5784c14abecc">https://hackernoon.com/a-closer-look-at-ethereum-signatures-5784c14abecc</a></p><p><a href="https://www.blockchain-council.org/blockchain/how-does-blockchain-use-public-key-cryptography/">https://www.blockchain-council.org/blockchain/how-does-blockchain-use-public-key-cryptography/</a></p><p><a href="https://lisk.io/academy/blockchain-basics/how-does-blockchain-work/blockchain-cryptography-explained">https://lisk.io/academy/blockchain-basics/how-does-blockchain-work/blockchain-cryptography-explained</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=1e8489e08104" width="1" height="1" alt=""><hr><p><a href="https://medium.com/blockwhat/public-key-cryptography-a-comprehensive-guide-1e8489e08104">Public Key Cryptography — A Comprehensive Guide</a> was originally published in <a href="https://medium.com/blockwhat">blockwhat?</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>