<?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[Byzantine - Medium]]></title>
        <description><![CDATA[Blockchain development studio building decentralized applications for the new web3. - Medium]]></description>
        <link>https://medium.com/byzantine-studio?source=rss----1978869c2a8---4</link>
        <image>
            <url>https://cdn-images-1.medium.com/proxy/1*TGH72Nnw24QL3iV9IOm4VA.png</url>
            <title>Byzantine - Medium</title>
            <link>https://medium.com/byzantine-studio?source=rss----1978869c2a8---4</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Tue, 17 Nov 2026 17:30:37 GMT</lastBuildDate>
        <atom:link href="https://medium.com/feed/byzantine-studio" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Blockchain Fundamentals #2: What are UTXOs?]]></title>
            <link>https://medium.com/byzantine-studio/blockchain-fundamentals-2-what-are-utxos-bfc503df4b99?source=rss----1978869c2a8---4</link>
            <guid isPermaLink="false">https://medium.com/p/bfc503df4b99</guid>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[ethereum]]></category>
            <dc:creator><![CDATA[Andrew]]></dc:creator>
            <pubDate>Mon, 28 May 2018 03:17:43 GMT</pubDate>
            <atom:updated>2018-05-28T03:32:15.416Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*83S0UW1u_WkovNGpE4ETrg.jpeg" /></figure><p>Like many complex subjects, the Crypto world is composed of various concepts that are difficult to understand at first. The UTXO is no exception. Seemingly straightforward, I found this idea particularly tricky to get. Analyzing a UTXO in isolation only begs additional questions — soon leaving you wondering what the heck you’ve been reading for the past two hours.</p><p>Let’s start with a simple definition.</p><blockquote><a href="http://learnmeabitcoin.com/glossary/utxo">Unspent Transaction Outputs</a> (UTXO) are all the spendable outputs for a given address available to be used in new transactions.</blockquote><p>There’s a conceptual dependency here which is understanding how transactions work. Let’s use Bitcoin to analyze this.</p><h3>Transactions (Inputs &amp; Outputs)</h3><p>It’s important to remember that in Bitcoin, you never actually hold something called “Bitcoin”. You don’t own a unique token that lives somewhere on the internet. Instead, you own the “rights” to move Bitcoin from one place to another. Admittedly, even this analogy breaks down quickly since no Bitcoin is ever actually “moved”. This was hard for me to grasp when I first started learning about Cryptocurrencies. I kept envisioning a digital file of some sort moving from one machine to another.</p><p>What actually happens is a form of double-entry bookkeeping. Each transaction contains one or more “inputs” which can be thought of as “debits” to a <a href="https://github.com/bitcoinbook/bitcoinbook/blob/develop/ch02.asciidoc#transaction-double-entry">Bitcoin account</a>. Those inputs turn into spendable “outputs” for the eventual recipient(s).</p><p>I highly recommend watching the below video by professor Donald J. Patterson to gain a better understanding of how the Bitcoin transaction process works.</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2FEm8nJN8IEes%3Ffeature%3Doembed&amp;display_name=YouTube&amp;url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DEm8nJN8IEes&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2FEm8nJN8IEes%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/8a71c59ec6d257750bc930f3a2eac0da/href">https://medium.com/media/8a71c59ec6d257750bc930f3a2eac0da/href</a></iframe><p>To quickly summarize, all transactions (except the coinbase) have both <em>inputs</em> and <em>outputs</em>. Inputs are where the money came <em>from</em> and outputs are where the money is <em>going</em>. Unless you’re a miner receiving newly created Bitcoin, every output sent to you will contain one or more <em>inputs</em> indicating where the money originated <em>from</em>. If you keep following this trail back you’ll eventually arrive at the the first transaction of a given block — the <a href="https://bitcoin.org/en/glossary/coinbase">coinbase transaction</a>.</p><p>So all Bitcoin transactions therefore have the following <a href="https://github.com/ethereum/wiki/wiki/Design-Rationale#accounts-and-not-utxos">constraints</a>:</p><ol><li>Every input must be valid and not yet spent</li><li>The transaction must have a signature matching the owner of the input</li><li>The total value of the inputs must equal or exceed the total value of the outputs</li></ol><h3>The UTXO</h3><p>Alright so let’s say you create a new Bitcoin address. At this point your balance would be zero since the address won’t have any inputs or outputs traceable to it. Now let’s say you’re friends with Alice who owns 10 BTC. She wakes up one morning, feeling particularly philanthropic, and decides to send you one Bitcoin. Woo! Let’s pause at this point and analyze some important things that are happening now.</p><p>First, the one BTC that Alice sends is actually considered a UTXO for <em>you</em>. This is because it’s an unspent output controlled by the private key of your wallet address. <em>Unspent</em> because you haven’t sent it to another address yet — <em>output</em> because it came from Alice. The one BTC represented a UTXO for Alice <em>prior</em> to sending it to you, and a <em>spent</em> transaction output for someone else further down the chain.</p><p>Second, when an output is marked as spent<em> </em>this means the previous owner who once maintained the “right to spend”, no longer does. The Bitcoin network is continuously creating and removing UTXOs with each transaction. You can think of each UTXO creating a different “state” of the overall Bitcoin blockchain. This state allows every user in the network to keep track of who owns the right to spend BTC.</p><p>Third, the inputs you receive don’t “mix” together like they would with physical coins. For example, if Alice decided to send you another BTC, you would now have two <em>separate </em>spendable outputs assigned to your address<em>. </em>These two spendable outputs are UTXOs for <em>you</em>.</p><p>Finally, when you send BTC to another person your wallet software will look for one or more unspent outputs — assigned to your address — and use them as <em>inputs</em> to the recipient. If a single UTXO isn’t large enough to satisfy the demand of the input amount, then the wallet will use a second, a third, etc until the total is greater than or equal to the amount your sending. <strong>This is key to understanding the nature of UTXOs. </strong>Sometimes this “total” can be much larger then the needed input amount. This is because the Bitcoin protocol requires that any UTXO must be completely spent if it’s used to fulfill the total input requirements. You can’t divide UTXOs. The difference is then sent back to you as “change” during the the transaction. Interestingly enough, this “change” is represented as a newly created UTXO assigned to you.</p><h3>Conclusion</h3><p>I’ve found that understanding UTXOs is easier when <em>described</em> and not defined. It’s the kind of concept that becomes clearer as you begin adding context to it.</p><p>If you see anything wrong with my analysis please let me know in the comments! Cheers!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=bfc503df4b99" width="1" height="1" alt=""><hr><p><a href="https://medium.com/byzantine-studio/blockchain-fundamentals-2-what-are-utxos-bfc503df4b99">Blockchain Fundamentals #2: What are UTXOs?</a> was originally published in <a href="https://medium.com/byzantine-studio">Byzantine</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Blockchain Fundamentals #1: What is a Merkle Tree?]]></title>
            <link>https://medium.com/byzantine-studio/blockchain-fundamentals-what-is-a-merkle-tree-d44c529391d7?source=rss----1978869c2a8---4</link>
            <guid isPermaLink="false">https://medium.com/p/d44c529391d7</guid>
            <category><![CDATA[merkle-tree]]></category>
            <category><![CDATA[ethereum]]></category>
            <category><![CDATA[data-science]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[blockchain]]></category>
            <dc:creator><![CDATA[Andrew]]></dc:creator>
            <pubDate>Sun, 04 Mar 2018 18:38:41 GMT</pubDate>
            <atom:updated>2018-05-28T03:15:33.288Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*7ioGEBJNB46Xmg8ddbuO6A.jpeg" /></figure><p>Let’s start with a quick definition from the book <a href="https://github.com/bitcoinbook/bitcoinbook/blob/develop/ch09.asciidoc#user-content-merkle_trees">Mastering Bitcoin</a> by <a href="https://medium.com/u/898f59563d67">Andreas M. Antonopoulos</a>:</p><blockquote>A merkle tree, also known as a binary hash tree, is a data structure used for efficiently summarizing and verifying the integrity of large sets of data.</blockquote><p>This gives us a great high-level starting point. However I think it’s a challenge to capture the significance of Merkle Trees using words alone. In my experience it’s the type of concept that’s better defined by showing <em>how it works</em> instead. We’ll do this through building our own Merkle Tree. However beforehand, we need to go through a quick primer on hashing first.</p><h3>Hashing</h3><p>Hashing functions are mathematical algorithms that take inputs and provide unique outputs. Some of the most common hashing functions are MD5, SHA-3, and SHA-256 — the last of which is used by Bitcoin.</p><p>These hashing functions will produce unique values that you can later use to “represent” the inputs. It’s important to recognize that these values will <em>exclusively </em>represent the current <em>state</em> of any given input<em>. </em>“State” in this context can represent a number of things. For example, adding a single word to the end of a file or simply changing its contents in any manner. When this happens, the file in question can be said to now hold a <em>new state</em>.</p><p>Let’s demonstrate how this works in detail.</p><p><em>(Note: in order to follow along you must be on macOS.)</em></p><h4>Hashing Example</h4><p>First, open up Terminal and go to your home folder. Then create a new directory called merkletrees.</p><pre>cd ~ &amp;&amp; mkdir merkletrees &amp;&amp; cd merkletrees</pre><p>Now create a file called a.txt</p><pre>touch a.txt</pre><p>Now we can run the built-in md5 command on our newly created file.</p><pre>md5 a.txt</pre><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*nlzuLTXViZpfu8WMYtViqg.gif" /></figure><p>The result should be the hexadecimal string: d41d8cd98f00b204e9800998ecf8427e. (For brevity sake, I’ll refer to these hash values by the first seven characters liked41d8cd. I find this makes reading easier.)</p><p>So what happened here? We just produced a unique “hash” value — d41d8cd — that represents the current state of a.txt. The state here happens to be an empty file. You might find it interesting that an empty file outputs a hash at all. This is partly unique to the md5 algorithm as <a href="https://stackoverflow.com/questions/10909976/why-do-seemingly-empty-files-and-strings-produce-md5sums">it will always</a> produce d41d8cd for empty files.</p><p>If we change the <em>contents</em> of a.txt, the hash will also change. We can update the name and even the extension of the file without the hash changing. Again, <a href="https://stackoverflow.com/questions/5055143/will-changing-a-file-name-affect-the-md5-hash-of-a-file">what matters here are the contents itself</a>. Give it a shot by going back to Terminal and running this in the same directory:</p><pre>echo “hashing is awesome” &gt;&gt; a.txt &amp;&amp; md5 a.txt</pre><p>You should get the hash ca00359cc149a5622c5ba87a93d8abb9 or ca00359 for short. Our file now contains the text “hashing is awesome” which means that it also holds a new state — represented by the unique hash ca00359.</p><h3>Growing The Tree</h3><p>There are <a href="http://cs.lmu.edu/~ray/notes/orderedtrees/">different types of Merkle Trees</a>. With many blockchains however, we’re primarily concerned with transactions between <em>two</em> entities (Person A sends $10 to Person B). Therefore “Binary Merkle Trees” are what projects like <a href="https://bitcoin.org/bitcoin.pdf">Bitcoin</a> use.</p><p>As the same suggests, a <a href="https://wikivisually.com/wiki/Binary_tree">Binary Merkle Tree</a> is a data structure in which each node has at most two children. This means we combine two inputs together to obtain a single output. When we have multiple <em>pairs</em> of inputs, a tree structure develops like this:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/885/1*t34FRAZgkz_PzwuObjRdjg.png" /><figcaption>Diagram 1. Rough sketch of the structure of a Merkle Tree using our text files as example inputs</figcaption></figure><p>Relating this back to our previous example, a.xt in diagram 1 would be the hash ca00359. We haven’t created a second file yet, but if we did, we could take its hash and combine it with ca00359. The next step would be to run this “combined” hash through MD5 to get the parent hash. We continue this process until we’re left with a single value called the <a href="https://www.certificate-transparency.org/log-proofs-work">Merkle Root</a>.</p><h4>Adding Branches</h4><p>Imagine our a.txt file is given three new siblings: b.txt, c.txt and d.txt— all of which have unique content.</p><p>First, open Terminal and delete the previous a.txt file we made earlier.</p><pre>rm a.txt</pre><p>Next, run the following command.</p><pre>echo &quot;Hello from a.txt&quot; &gt;&gt; a.txt &amp;&amp; md5 a.txt &amp;&amp;<br>echo &quot;Hello from b.txt&quot; &gt;&gt; b.txt &amp;&amp; md5 b.txt &amp;&amp;<br>echo &quot;Hello from c.txt&quot; &gt;&gt; c.txt &amp;&amp; md5 c.txt &amp;&amp;<br>echo &quot;Hello from d.txt&quot; &gt;&gt; d.txt &amp;&amp; md5 d.txt</pre><p>You should see an output like this:</p><pre>MD5 (a.txt) = c95c68d91441ba192ada81c9cfb2abe7<br>MD5 (b.txt) = 80262782d5961c452eae5de9991af0fd<br>MD5 (c.txt) = 0bfe75f719adf6450bb8be8e10126383<br>MD5 (d.txt) = 10fa7f973f6ec6682e1a6f4570a89861</pre><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*TmCZfzrpQggEMBmudt-zvw.gif" /></figure><p>We just generated a list of hashes from our four unique files like we did with a.txt. We’ll use these to build the tree.</p><p>Let’s begin by taking the unique hash of a.txt and joining it with the unique hash of b.txt. I’ve bolded the hash of a.txt to make it easier to distinguish from the latter. The result becomes this:</p><p><strong>c95c68d91441ba192ada81c9cfb2abe7</strong>80262782d5961c452eae5de9991af0fd</p><p>Notice at the moment we’re only <em>combining</em> the hash of a.txt with the hash of b.txt. The next step is to run <em>this combined value</em> through MD5 once more to produce our parent hash.</p><p>We can do this by running the following:</p><pre>md5 &lt;&lt;&lt; &quot;c95c68d91441ba192ada81c9cfb2abe780262782d5961c452eae5de9991af0fd&quot;</pre><p>Which will give us:</p><pre>a3d71b58e08759e6245667fb6f4770b6</pre><p>Congrats! We just produced are first parent hash! We can now say that the current state of a.txt and b.txt are represented by a3d71b5.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/885/1*ArQ26NukJqWiwsWlRzGHyA.png" /><figcaption>Diagram 2. The parent hash of a.txt and b.txt combined</figcaption></figure><p>Now let’s repeat this with the hash of c.txt and d.txt<em>. </em>Remember that the former is 0bfe75f and the latter 10fa7f9.</p><pre>md5 &lt;&lt;&lt; &quot;<strong>0bfe75f719adf6450bb8be8e10126383</strong>10fa7f973f6ec6682e1a6f4570a89861&quot;</pre><p>Which produces:</p><pre>078791272b0b48b7bb7004ebc1b22123</pre><p>And now our updated tree looks like this:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/885/1*zBQlB1yExqoCI_fjUtwzDQ.png" /><figcaption>Diagram 3. The parent hash of c.txt and d.txt combined</figcaption></figure><p>Almost done. The last step is to combine the two parents together to achieve the highly anticipated Merkle Root.</p><p>We’ll first combine the two parent hashes a3d71b5 and 0787912. Then run the combined value through MD5 again, like this:</p><pre>md5 &lt;&lt;&lt; &quot;a3d71b58e08759e6245667fb6f4770b6078791272b0b48b7bb7004ebc1b22123&quot;</pre><p>Which produces our Merkle Root:</p><pre>eaad1d42b754612a4249bcbd95f0b734</pre><p>The Merkle Tree is now complete!</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/885/1*94YWLQMW-iRHtsB62QjTRg.png" /><figcaption>Diagram 4. A completed Merkle Tree</figcaption></figure><h3>Why Are Merkle Trees Important?</h3><p>Merkle Trees are really important because they allow for <a href="https://blog.ethereum.org/2015/11/15/merkling-in-ethereum/">“Merkle Proofs”</a>. These enable us to <a href="https://github.com/bitcoinbook/bitcoinbook/blob/develop/ch09.asciidoc">quickly verify</a> that a given input has been included in a particular data set — and in what order.</p><p>Merkle Trees are also <a href="https://github.com/bitcoinbook/bitcoinbook/blob/develop/ch09.asciidoc#user-content-merkle_example_run">really efficient</a>. They allow us to compress large data sets by removing all superfluous branches while keeping only the ones we need to establish our proof. In the Blockchain world, this means Merkle Trees provide the following critical features:</p><ol><li>Ability to verify whether a transaction is included in a block</li><li>Light-clients (since we don’t have to download the entire chain)</li><li>Overall performance and scalability</li><li><a href="https://bitcoin.org/en/glossary/simplified-payment-verification">Simplified Payment Verification</a> or (SPV)</li></ol><p>There is much more to discuss regarding Merkle Trees including how they operate within other blockchains like Ethereum, how they’re used in scaling solutions, etc. However since this is just a fundamentals article I’ll be touching on those topics separately.</p><p>Suffice it to say, once you grasp the basics of Merkle Trees you can really begin to appreciate the security and efficiency of Blockchain data structures. This really is amazing and exciting technology!</p><p>If you want to start diving into more advanced Merkle Tree topics, I highly suggest <a href="https://medium.com/u/587a00dbce51">Vitalik Buterin</a>’s article entitled “<a href="https://blog.ethereum.org/2015/11/15/merkling-in-ethereum/">Merkling in Ethereum</a>”.</p><p>Good luck!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=d44c529391d7" width="1" height="1" alt=""><hr><p><a href="https://medium.com/byzantine-studio/blockchain-fundamentals-what-is-a-merkle-tree-d44c529391d7">Blockchain Fundamentals #1: What is a Merkle Tree?</a> was originally published in <a href="https://medium.com/byzantine-studio">Byzantine</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[What Makes Blockchain Revolutionary?]]></title>
            <link>https://medium.com/byzantine-studio/what-makes-blockchain-revolutionary-28b0a524490d?source=rss----1978869c2a8---4</link>
            <guid isPermaLink="false">https://medium.com/p/28b0a524490d</guid>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[crypto]]></category>
            <category><![CDATA[ethereum]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[bitcoin]]></category>
            <dc:creator><![CDATA[Andrew]]></dc:creator>
            <pubDate>Tue, 06 Feb 2018 04:18:02 GMT</pubDate>
            <atom:updated>2018-02-06T02:22:14.101Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*3rfXRUIBXxh0SCMRsWkIxw.jpeg" /><figcaption>Like Russia during the October Revolution, we too are heading into uncharted territory</figcaption></figure><p>A simple search will present anyone with copious articles describing Blockchain technology so an intuitive question might be, “Why write another one?”</p><p>I’m a software engineer of seven years with thousands of hours of experience building web applications, using databases, and writing software. I’ve also been obsessively fascinated by the Blockchain phenomenon since 2012 and have been researching it since. Because of my background, I feel that I have a useful perspective to bring to the table.</p><p>My personal motivation is that I think Blockchain is one of the most important technological inventions since the internet. The attribute of disintermediation — or removal of third-parties — has the potential to unleash levels of prosperity and freedom never before known to humanity.</p><p>However to understand why, we need to know how it distinguishes itself. How is it different from the technology we’ve been using for decades? This is becoming increasingly important as more and more projects enter the scene with ambitious and sometimes faulty claims.</p><p>So let’s explore what makes Blockchains revolutionary by first examining the core fundamentals of the technology.</p><h3>Databases</h3><p>When people hear the word database, they might think of something advanced. Probably something to do with computers and probably complex. However the concept of a database is actually as old as civilization itself.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/500/1*9BobFWRBCtfLaTCeG9jzgw.jpeg" /></figure><p>At its core, a database stores things. From tracking the ownership of giant stone money like <a href="https://www.aier.org/blog/blockchain-works-money-yap">The Yap during the 13th century</a>, to tracking bank account balances. The data itself and how you store it can be as simple or as complex as you need it to be.</p><p>Things become interesting when you start “relating” different data sets to each other— especially without duplication. For example, you can do this by allowing two or more data sets to talk to one another using a unique ID common to both. This is incredibly powerful when your data set grows because you can then find commonalities between them.</p><p>Imagine we have a “people” table that stores information about individuals. Let’s say we store their name, age and a unique ID for each person. Now imagine that we also have an “addresses” table storing the address, city, state, but more importantly — the person who lives at each particular address using the unique ID we mentioned above. The data is useful on its own to be sure, but now it can <em>relate</em> to other data which enhances the usefulness as shown in the diagram below.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/700/1*P-V_tapjjBWLRiIcPnCXpA.png" /><figcaption>The green “ID” column under the People table points to the green “Person” column under the Addresses table.</figcaption></figure><p>The important point to realize here is that databases allow you to “create” records, “read” them, “update” them, and “delete” them. This process is known by an acronym in computer science called CRUD (Create, Read, Update, Delete). It forms the foundation for modern persistent storage and can be found in almost every piece of software that we use today.</p><p>So how does this relate to Blockchain? Is it just a new kind of database? In a sense, yes.</p><p>One of the distinguishing features of a Blockchain is that it’s both relational and <em>temporal</em>. This means that the data relates to other data <em>across time</em>. Data stored last week, last month, or last year can always be accessed and its origin found.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*e75_zlD9n70nuxS97XEa_A.png" /></figure><p>Consequently, with each addition to the chain the level of trust grows because it becomes exponentially harder to reverse the additions.</p><p>In traditional database environments, trust is handled in a centralized and permissioned fashion. Permissioned, because technically speaking you need to know the login credentials of the database you’re using before making changes. These are generally only passed around secretly to those who <em>have</em> to know. Centralized, because these databases only run on a single or handful of private servers — all of which are controlled by a centralized entity. Walk into any large corporation and this is generally the architecture you’ll find.</p><p>Blockchain databases on the other hand live <em>decentralized</em> and <em>permissionless</em> environments — almost the complete opposite of the traditional architecture we’ve been using for years.</p><h3>Establishing Consensus</h3><p>A database only works if you trust what it holds. Imagine saving the phone number of a new friend, only to later unintentionally send a text to your mother-in-law! Your phone contains a database of contacts which you trust because, well, you’re the one in charge of modifying them.</p><p>With Blockchains on the other hand, instead of trusting <em>individuals</em> to make additions to the database, you simply need to trust the <em>process of additions</em> — or the rules of the protocol.</p><p>This is possible due to a computer science breakthrough that our friend Satoshi Nakamoto <a href="https://bitcoin.org/bitcoin.pdf">provided almost 10 years ago</a>. The breakthrough centers around a problem that puzzled engineers for decades, and which was first described by Leslie Lamport in 1980 called <a href="http://bnrg.cs.berkeley.edu/~adj/cs16x/hand-outs/Original_Byzantine.pdf">The Byzantine Generals Problem</a>.</p><p>Nakamoto not only provided a solution, but also laid the foundation for inspiring a renaissance in different algorithms attempting to solve the same problem. As of today, the only proven solution is known as <a href="https://github.com/bitcoinbook/bitcoinbook/blob/develop/ch02.asciidoc">Proof-of-Work</a>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/959/1*6Ohb6czM0lgZ-igWeC0gmQ.jpeg" /></figure><p>I want to reiterate an important point. The Nakamoto breakthrough isn’t Proof-of-Work itself, or the cryptography behind it. These things have been known for decades. The importance comes from the ability use these technologies to establish consensus within an <em>open</em> network.</p><h3>What Exactly Is Consensus?</h3><p>Consensus can be defined as a <a href="https://dictionary.cambridge.org/dictionary/english/consensus">general agreement</a> about the validity of something.</p><p>For example, my wife and I are in “consensus” regarding the withdrawals made from our bank account. Put another way, we trust that any money leaving the account is either authorized by us or the bank. In this game, trust between the players is assumed from the beginning.</p><p>The same analogy can be applied to computers within a closed network. If a company runs a private LAN, we can assume they’re able to set the rules — or the protocol — for how the computers on the network communicate. Therefore we can assume trust between the computers from the beginning.</p><p>Question: In these two scenarios is “consensus” a <em>problem</em>? In other words is it something that if removed would prevent people from trusting the system at all? I don’t think it is. <em>Consensus is not a problem when the players are assumed to already trust each other.</em></p><p>Therefore we can say traditional databases do not suffer from a consensus problem because at any given time you can be reasonably sure that anyone modifying the database is authorized to do so. However, what happens when you apply this analysis to an <em>open</em> network?</p><p>Let’s go back to banking. My wife and I use a traditional bank to store our money. The bank needs to be able to communicate with <em>other banks</em> regarding deposits and withdrawals. Otherwise if I receive payment from someone who uses a <em>different</em> bank, there could be a potential conflict regarding the state of money ownership.</p><p>In this game each bank operates within an adversarial open network called the “free” market. We can’t assume that each bank trusts each other to play fairly since competition continuously drives them to win. To solve this, governments have established Central Banks that “introduce trust” into the network. The end result being the creation of a centralized, permissioned, and closed network called The Federal Reserve System.</p><p>So we can say “solving for consensus” between potential adversaries is only needed within open networks. This is important because many projects currently appearing within the community are claiming to have “revolutionary Blockchains” that are really nothing but glorified databases operating within closed or semi-closed networks. It’s advisable to be very suspicious of these claims. They may be able to provide faster transaction times but if not decentralized it’s business as usual for the most part.</p><p>The revolution is found in open networks. But that begs the question, how do you then incentivize people to play by the rules?</p><h3>$$$</h3><p>I’ve been making the case that a prerequisite for labeling something a “Blockchain” is that it must use an open peer-to-peer network that anyone can join. Without this “adversarial” environment, there’s no need to solve for consensus and thus no need to make a seperate distinction from traditional databases technology.</p><p>I often hear people say they’re more interested in the underlying “Blockchain” technology and not so much the currency. I’ve always wondered why people take this approach. After all, the technology is colloquially referred to as crypto<em>currency</em>. In my option to neglect the economic side of Blockchain is to grossly underappreciated why it’s important in the first place.</p><p>Within closed-environments, you generally don’t need to solve for the unpredictability of human action. However because Blockchains operate in open environments they need a way to <em>incentivize </em>people to play by the rules and this is where the amazing insight of Satoshi can be found.</p><p>In the Bitcoin Blockchain there exists both <em>an incentive to play honestly</em> and <em>disincentive to cheat</em>. This dynamism partly explains why the network stays secure. You’re incentivized to play nicely since doing so will reward you with coins. You’re also disincentivize to attack the system since doing so will cost you a lot of money in hardware and electricity costs. Even if you were to perform <a href="https://learncryptography.com/cryptocurrency/51-attack">what’s called a “51% attack”</a>, the community at large could always decide to temporarily work together to alienate the adversary by forking and moving to a different version of the software.</p><p>It’s important to note that if Satoshi didn’t introduce the money dynamic then it probably would have gone straight to the software graveyard.</p><h3>Conclusion</h3><p>2018 is gearing up to be the biggest year for crypto yet. And as we embark into the turbulence, I think it’s vital that we recognize why the revolution was able to start in the first place. Doing so will help us avoid the scams and false promises in the space.</p><p>In my mind a good way to measure this is by judging whether a Blockchain provides <em>reasonable</em> trust within an <em>open</em> network and doing so without requiring a centralized authority.</p><p>Crypto is as much a philosophy as it is a technology. These core principles of decentralization and establishing trust in a <em>trustless way,</em> have always been — and should remain — the driving forces in our community.</p><p>To open networks!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=28b0a524490d" width="1" height="1" alt=""><hr><p><a href="https://medium.com/byzantine-studio/what-makes-blockchain-revolutionary-28b0a524490d">What Makes Blockchain Revolutionary?</a> was originally published in <a href="https://medium.com/byzantine-studio">Byzantine</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>