<?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 Dr. Stanislav Kubrak on Medium]]></title>
        <description><![CDATA[Stories by Dr. Stanislav Kubrak on Medium]]></description>
        <link>https://medium.com/@stkubr?source=rss-3ef890a25461------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*jKhFapAk9BYHLdiXeyX71A.jpeg</url>
            <title>Stories by Dr. Stanislav Kubrak on Medium</title>
            <link>https://medium.com/@stkubr?source=rss-3ef890a25461------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Thu, 19 Nov 2026 06:11:22 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@stkubr/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[Insolar’s Pulsar Protocol]]></title>
            <link>https://medium.com/coinmonks/insolars-pulsar-protocol-a56da36c45ef?source=rss-3ef890a25461------2</link>
            <guid isPermaLink="false">https://medium.com/p/a56da36c45ef</guid>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[dlt]]></category>
            <category><![CDATA[insolar]]></category>
            <dc:creator><![CDATA[Dr. Stanislav Kubrak]]></dc:creator>
            <pubDate>Tue, 19 Feb 2019 13:42:35 GMT</pubDate>
            <atom:updated>2020-08-26T14:25:18.741Z</atom:updated>
            <content:encoded><![CDATA[<h4>A backbone of Insolar’s Blockchain 4.0</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*87FC0iVsG8v9K-kT92mktw.jpeg" /><figcaption><a href="https://unsplash.com/photos/W8KTS-mhFUE">https://unsplash.com/photos/W8KTS-mhFUE</a></figcaption></figure><p>In this article we would like to touch upon Insolar’s nodes interaction layer, so-called Pulsar Protocol, described in details in recently published <a href="https://insolar.io/uploads/Insolar%20Tech%20Paper.pdf">tech paper</a>. The main purpose of this layer is to facilitate the network<br>synchronization and to provide a source of randomness within a ledger. It utilities Byzantine Fault Tolerance (BFT) consensus model, similar to <a href="https://www.hyperledger.org/projects/fabric">Hyperledger</a>. With more detailed description of the general purpose consensus available <a href="https://people.eecs.berkeley.edu/~luca/cs174/byzantine.pdf">here</a>, let us to briefly review how BFT consensus of Pulsars’ network is functioning and estimate robustness and scalability of the protocol.</p><p>Timeline is split into fixed time intervals, called <em>Pulses </em>(or more conventionally Views). At each Pulse the node goes through several phases:</p><p><strong>Phase 1</strong>: Node prepares, signs and broadcasts PulseData payload to all nodes.<br><strong>Phase 2</strong>: Node receives PulseData payloads with signatures from all other nodes within the cluster, called <em>Globula</em>. Node validates signatures and removes malicious nodes from the send/receive list. The valid Pulsars ID and signatures are broadcasted to all nodes. <br><strong>Phase 3: </strong>Node reaches consensus on PulseData with 2/3 majority, then the Winning Pulsar is selected based on hash of proposed set of PulseDatas. Winning Pulsar provides encryption key to decrypt its PulseData payload. <br><strong>Phase 4: </strong>Node validates Winning Pulsar encryption key, broadcasts another signature to nodes to confirm the validation. Afterwards it receives similar signatures and after successful validation of 2/3 majority the PulseData payload is finalized and persisted.</p><p>The tech paper does not discuss possible <strong>attack vectors or bottlenecks</strong>, however there are a few:</p><p><strong>34% attack</strong>: This is known issue of any BFT based distributed ledger. A way to mitigate the attack is to setup rules for selecting Pulsars and apply the permission restriction on obtaining Pulsar ID.</p><p><strong>Silent Bob attack</strong>: At Phase 3 the Winning Pulsar is <em>expected</em> to provide signing key. Given some malicious omnipotence one could try to jam the consensus. This can be mitigated by banning Winning Pulsar for such misbehavior from the nodes send/receive list and restarting Phase 3.</p><p>Now lets check all <strong>bottlenecks</strong>: at Phase 1 nodes propagate PulseData payload along with signatures to every other node. At Phase 2 nodes need to validate two signatures from every other node, then broadcast Pulsar ID to nodes. At Phase 4 they need again to broadcast Winning Pulsar’s validation signatures. Each time node communicates to all other nodes in <em>Globula</em> cluster, which can be up to 1000 nodes. Since the tech paper does not mention any specifics on what will be the encryption scheme I’ll assume RSA-2048. <br>Let’s do some fast estimations:</p><p><strong><em>Signature validation overhead</em></strong>: RSA-2048 signature validation with optimized C++ library, ran on Intel Core 2 1.83 GHz processor(<a href="https://www.cryptopp.com/benchmarks.html">source</a>) takes about 0.16 msec/sig. Since the node would need to do about 2000 + 2/3*1000 validations per Pulse, it is <strong>0.42 sec per Pulse</strong>, which is a negligibly small number to cause any network delay or nodes desynchronization.</p><p><strong><em>Bandwidth requirements</em></strong><em>: </em>64B(PulseData) + 128B(NodeStateProof) + 256B(Pulsar signature S1)+ 256B(Pulsar signature S2) + 64B(Pulsar ID) + 256B(Winning Pulsar’s validation signature S3) + assume 1024B(payload bytes) = <strong>2kB per node per Pulse</strong>, which tells that any node with a reasonable bandwidth can participate in Pulsars’ consensus.</p><p>In conclusion, one can clearly observe that in the current setup Pulsar Protocol does not impede the scaling of the upper layers of Insolar Business Network Platform.</p><blockquote><a href="https://coincodecap.com/?utm_source=coinmonks">Get Best Software Deals Directly In Your Inbox</a></blockquote><figure><a href="https://coincodecap.com/?utm_source=coinmonks"><img alt="" src="https://cdn-images-1.medium.com/max/584/0*OJ-qb5G6i863msBB.png" /></a></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=a56da36c45ef" width="1" height="1" alt=""><hr><p><a href="https://medium.com/coinmonks/insolars-pulsar-protocol-a56da36c45ef">Insolar’s Pulsar Protocol</a> was originally published in <a href="https://medium.com/coinmonks">Coinmonks</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[IOTA MAM Ultra Lite]]></title>
            <link>https://medium.com/coinmonks/iota-mam-ultra-lite-493d8d1fb71a?source=rss-3ef890a25461------2</link>
            <guid isPermaLink="false">https://medium.com/p/493d8d1fb71a</guid>
            <category><![CDATA[development]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[iota]]></category>
            <category><![CDATA[technology]]></category>
            <dc:creator><![CDATA[Dr. Stanislav Kubrak]]></dc:creator>
            <pubDate>Wed, 16 Jan 2019 19:17:15 GMT</pubDate>
            <atom:updated>2020-08-26T15:31:10.312Z</atom:updated>
            <content:encoded><![CDATA[<h4>Lightest Masked Authenticated Messaging protocol for IOTA</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Culhtv4yKN0mLgymF9QSrg.png" /><figcaption>Created with <a href="http://weavesilk.com/">Silk — Interactive Generative Art</a></figcaption></figure><p>Inspired by <a href="https://medium.com/@samuel.rufinatscha/mam-lite-a-more-flexible-messaging-protocol-for-iota-562fdd318e1d">MAM Lite</a> protocol, a light-weight alternative to MAM streams in IOTA, written by <a href="https://medium.com/u/589112703eef">Samuel Rufinatscha</a> I decided to re-implement it in Python. Doing so I stumbled into a few limitations, originated from RSA signature scheme used in MAML and therefore I opted to switch to another signature scheme, <a href="https://github.com/warner/python-ed25519">Ed25519</a> (the one that NANO uses). It has much shorter public keys and signatures and thus provides several advantages, that will be discussed later. As the result of an effort there is MAML_Ed25519 protocol library (no, not MAMUL 😃), you can checkout the code and examples <a href="https://github.com/stkubr/MAML">here</a>.<br>Apart from using a different signature scheme, it has the similar features:</p><ul><li>Authentication</li><li>Forward Secrecy</li><li>Stream access from every address</li><li>Channel splitting</li><li>AES encrypted</li></ul><p>Now let’s discuss the differences.</p><h4>First, consider RSA signature scheme:</h4><p>RSA keys can be used both for encryption and signing, but they are quite lengthy, for example, RSA-3072 pubkey and signature in trytes are:</p><iframe src="" width="0" height="0" frameborder="0" scrolling="no"><a href="https://medium.com/media/7c2de55af41d257c12f6ad9c3c2c5a14/href">https://medium.com/media/7c2de55af41d257c12f6ad9c3c2c5a14/href</a></iframe><p>So to send RSA pubkey alongside with a data it takes approximately 1000 trytes and this is only the pubkey so far — the signature will also take about 1024 trytes. Keeping in mind that one transaction on Tangle have length of 2187 trytes, it is hard to put anything else meaningful in one transaction. The way to handle this is to keep only a hash of pubkey and splitting your JSON data in chunks over several Tangle transactions in one bundle, as it is done in MAML.</p><p>There is another drawback — having only a hash of pubkey supplied requires one to know a corresponding pubkey <strong>in advance and store it </strong>to be able to verify the signatures in MAML. Otherwise if you join a public stream in a middle you woudn’t be able to verify and identify messages. Potentially this could be solved with the following trick:</p><p>H(pubkey) →Trytes [0:81]→Address →send_tx_to(Address)with_data({‘pubkey’:pubkey})</p><p>so that anyone knowing a hash of pubkey would know where to search or<em> listen</em> for a corresponding pubkey, compare with the hash and store it. But unlike traditional blockchains, Tangle prunes itself often(now even more <a href="https://blog.iota.org/iri-1-6-0-with-local-snapshots-out-now-fc4d991faba8">often</a>), so it would be necessary to rebroadcast your pubkey regularly.</p><p>Lastly, using the same RSA keys for signing and encrypting for restricted access messaging in the same time can become problematic, since signature and encryption keys should have <a href="https://crypto.stackexchange.com/questions/12090/using-the-same-rsa-keypair-to-sign-and-encrypt">different life-cycle</a>.</p><h4>Ed25519 signature is all about short keys and speed:</h4><p>How short in IOTA trytes? Let’s have a look:</p><iframe src="" width="0" height="0" frameborder="0" scrolling="no"><a href="https://medium.com/media/dda9617d38bc87e6c65362c10961d9da/href">https://medium.com/media/dda9617d38bc87e6c65362c10961d9da/href</a></iframe><p>That’s a drastic difference! Now you can supply your JSON with pubkey, not just a hash, and it has roughly similar security level as RSA-3072 above.</p><p>Since Ed25519 cannot be used for encryption, for the fine grained access messaging within a stream the communicating entities would still need to exchange their RSA pubkeys, thus ensuring different life-cycles for signing keys and asymmetric encryption keys.</p><p>As a conclusion I would like to point out that this not a battle of MAML protocols “which one is better”, but rather a suggestion for the unification of MAML streams, that can be done easily by adding one extra field to JSON:</p><pre>{</pre><pre><strong>&#39;MAML_protocol&#39;: MAML_Ed25519 (or MAML_RSA)</strong><br>&#39;data_payload&#39;: Some data here ....<br>&#39;pubkey/hash&#39;: fgdwer8s7d6gdfg6d6fg8.....<br>&#39;signature&#39;: fd7g9s8df7g98df7g...</pre><pre>}</pre><p>so that the code could switch and be agnostic to the type of MAML protocol.</p><p>Based on this suggestion I’m planning to expand the code to be able to handle Ed25519 and RSA streams on the fly. Code repository could be found <a href="https://github.com/stkubr/MAML">here</a>. You can reach me on IOTA Discord at <strong>stkubr#1936 </strong>or on Twitter <a href="https://twitter.com/KubrakStan">@KubrakStan</a>. If you like my work and want me to continue please feel free to buy me a beer by donating some Iotas on address:</p><p>EHNQJBGFAIUTJKPMSUCSDMIH9XTHANMJBVEZLFYURUXJUARTGKG9KDBHTCZHDKZZOGT9ENQEMHPOSLHPWXAELUPSDX</p><p>Thank you for your attention :)</p><p><strong>UPD</strong>: yes NTRUSign scheme is broken — see <a href="https://www.di.ens.fr/~pnguyen/pub_DuNg12a.htm">here</a></p><blockquote><a href="https://coincodecap.com/?utm_source=coinmonks">Get Best Software Deals Directly In Your Inbox</a></blockquote><figure><a href="https://coincodecap.com/?utm_source=coinmonks"><img alt="" src="https://cdn-images-1.medium.com/max/584/0*OJ-qb5G6i863msBB.png" /></a></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=493d8d1fb71a" width="1" height="1" alt=""><hr><p><a href="https://medium.com/coinmonks/iota-mam-ultra-lite-493d8d1fb71a">IOTA MAM Ultra Lite</a> was originally published in <a href="https://medium.com/coinmonks">Coinmonks</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Simple Directed Acyclic Graph (IOTA-like) implementation in Python]]></title>
            <link>https://medium.com/coinmonks/simple-directed-acyclic-graph-iota-like-implementation-in-python-8e07677c55b5?source=rss-3ef890a25461------2</link>
            <guid isPermaLink="false">https://medium.com/p/8e07677c55b5</guid>
            <category><![CDATA[iota]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[distributed-ledgers]]></category>
            <dc:creator><![CDATA[Dr. Stanislav Kubrak]]></dc:creator>
            <pubDate>Mon, 12 Nov 2018 22:26:50 GMT</pubDate>
            <atom:updated>2020-08-27T16:02:41.721Z</atom:updated>
            <content:encoded><![CDATA[<h4>For those whom just the blockchain is not enough.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*FSuN1iAS8dKdHftIoq_yoQ.png" /><figcaption>Picture taken from <a href="https://ukcryptocurrency.com/iota/introduction-what-is-iota/">https://ukcryptocurrency.com/iota/introduction-what-is-iota/</a></figcaption></figure><p>About the same time a year ago I had my “leap of faith” in crypto world. I read tens of whitepapers, thousands Reddit posts, visited numerous meetups until I have discovered IOTA and joined the crypto-rage. As a dry residue now there is a knowledge that I’d like to share with the audience. Inspired by the accessibility and easiness of such blockchain tutorials like <a href="https://hackernoon.com/learn-blockchains-by-building-one-117428612f46">this</a> or <a href="https://medium.com/crypto-currently/lets-build-the-tiniest-blockchain-e70965a248b">this</a> and the lack of similar tutorials for Directed Acyclic Graphs (DAG), I thought to contribute as well. So here is a simple implementation of IOTA-like Distributed Ledger Technology - the Tangle! Gist pages with the full code can be found <a href="https://gist.github.com/stkubr/0469ab30b1f992e2817f6060e4bf576f">here</a>.</p><p>Let’s start with adding the libraries we will need:</p><pre>import hashlib<br>import random<br>import string<br>import time<br>from collections import OrderedDict</pre><p>Then we’re going the represent Tangle as three separate dictionaries:</p><pre>tangle_graph = {&#39;genesis_branch&#39;: [],<br>                &#39;genesis_trunk&#39;: []}<br><br>tangle_data = {}<br><br>tangle_ledger = {&#39;iota_satoshi&#39;: 100}</pre><p>tangle_graph will represent the graph data structure — each dictionary key is a transaction and each value is a list of two other transactions referenced by key, so-called: branch and trunk. We initiate Tangle with some genesis branch and trunk. tangle_data contains transaction to data payload map and tangle_ledger is a map of public keys to values. In actual IOTA implementation these data structures are not separated and are the Tangle, but for the visibility of the tutorial we keep it like that.</p><p>Here for the sake of simplicity we will not use any asymmetric cryptographic encryption like RSA or quantum-resistant Winternitz signatures, just keep in mind that &#39;iota_satoshi&#39; is a public key or an <strong>address</strong> and whoever has a corresponding private key would be able to spent from this address.</p><p>Then we need a hashing function, let’s take simple SHA1:</p><pre>def calc_hash(msg):<br>    hasher = hashlib.sha1(msg.encode())<br>    return hasher.hexdigest()</pre><p>Now we introduce a basic block — Block class (pun intended):</p><pre>class Block:<br>    def __init__(self, branch, trunk):<br>        self.branch = branch<br>        self.trunk = trunk<br>        self.timestamp = time.time()<br>        self.data_payload = get_random_string()<br>        self.value_tx = None<br><br>    def get_hash(self):<br>        return calc_hash(str(OrderedDict(self.__dict__)))</pre><p>Block contains branch and trunk legs, timestamp and some data. Here get_random_string() just supplies block’s data_payload with random string.</p><p>Further we define function that adds blocks to Tangle:</p><pre>def add_tx(block: Block):<br>  if block.branch in tangle_graph and block.trunk in tangle_graph:<br>      tangle_graph[block.get_hash()]=[block.branch,block.trunk]<br>      tangle_data[block.get_hash()] = block.data_payload</pre><p>Basically the function checks if block’s branch and trunk legs exist in the ledger and if true, adds new transaction to Tangle.</p><p>Now we need some algorithm that selects transactions out existing ones in Tangle to be branch and trunk for the new one:</p><pre>def find_tips():<br>    return tuple(random.sample(set(tangle_graph.keys()), 2))</pre><p>This is the simplest uniform random tips selection algorithm - it just selects two different random transactions out of all transactions. In reality things are much more <a href="https://www.iota.org/research/academic-papers">sophisticated</a>.</p><p>And this is it! With one class and three functions we can run the Tangle — let’s run add_tx(Block(*find_tips())) :</p><pre>tangle_graph<br>Out[24]: <br>{&#39;e0d5787db72c7a0bea6d9621f73bd4b21f47546f&#39;: <br>[&#39;genesis_trunk&#39;,&#39;genesis_branch&#39;],<br> &#39;genesis_branch&#39;: [],<br> &#39;genesis_trunk&#39;: []}</pre><p>We just added transaction ‘e0d5787db72c7a0bea6d9621f73bd4b21f47546f’ that references ‘genesis_trunk’ and ‘genesis_branch’. Let’s add more by running add_tx(Block(*find_tips())) few more times!</p><pre>{&#39;2b503d9c90eec329b96b89cde4dc54efa826b0df&#39;: <br>[&#39;genesis_trunk&#39;,&#39;580e464bd9cef52e4af07508171ce84369b258d5&#39;],</pre><pre> &#39;37379d02f49e9dc57a6e08ff33e218a12c39f9de&#39;: <br>[&#39;genesis_branch&#39;,&#39;e0d5787db72c7a0bea6d9621f73bd4b21f47546f&#39;],</pre><pre> &#39;580e464bd9cef52e4af07508171ce84369b258d5&#39;:[&#39;37379d02f49e9dc57a6e08ff33e218a12c39f9de&#39;,&#39;genesis_trunk&#39;],</pre><pre> &#39;e0d5787db72c7a0bea6d9621f73bd4b21f47546f&#39;:<br> [&#39;genesis_trunk&#39;,&#39;genesis_branch&#39;],</pre><pre> &#39;genesis_branch&#39;: [],<br> &#39;genesis_trunk&#39;: []}</pre><p>As you can see Tangle grows and newer transactions starting to randomly reference older transactions. As for tangle_data it looks as following:</p><pre>{&#39;2b503d9c90eec329b96b89cde4dc54efa826b0df&#39;: &#39;yxgcs&#39;,<br> &#39;37379d02f49e9dc57a6e08ff33e218a12c39f9de&#39;: &#39;1lyf8&#39;,<br> &#39;580e464bd9cef52e4af07508171ce84369b258d5&#39;: &#39;1y4vu&#39;,<br> &#39;e0d5787db72c7a0bea6d9621f73bd4b21f47546f&#39;: &#39;nct8w&#39;}</pre><p>Just some random data as intended.</p><p>Now we going to move some funds, but in order to do so we need to add extra function to our Block class:</p><pre>def add_value_tx(self, sender, receiver, amount, signature):<br>        self.value_tx = {&#39;sender&#39;: sender,<br>                         &#39;receiver&#39;: receiver,<br>                         &#39;amount&#39;: amount,<br>                         &#39;signature&#39;: signature<br>                         }</pre><p>This will add <strong>non-zero transaction </strong>status to a block object:</p><pre># prepare block usual way<br>value_block = Block(*find_tips())</pre><pre># add value transition in block<br>value_block.add_value_tx(&#39;iota_satoshi&#39;, &#39;iota_foundation_address&#39;, 50, &#39;calligraphic_signature_of_satoshi_himself&#39;)</pre><p>Obviously calligraphic_signature_of_satoshi_himself is cryptographic signature of the public-key/address iota_satoshi. Now we need to handle a logic for value transactions that will modify tangle_ledger:</p><pre>def check_value_tx(value_tx):<br>    if value_tx[&#39;sender&#39;] in tangle_ledger:<br>      if value_tx[&#39;amount&#39;] &lt;=  tangle_ledger[value_tx[&#39;sender&#39;]]:<br>            # if signature is valid too<br>            res = True<br>    return res</pre><pre>def move_money(sender, receiver, amount):<br>    tangle_ledger[sender] -= amount<br>    if receiver in tangle_ledger:<br>        tangle_ledger[receiver] += amount<br>    else:<br>        tangle_ledger[receiver] = amount</pre><p>First one checks if sender address even exists and have enough money to be spend. Second one moves funds from sender to receiver adding the later if not exist on the ledger. (One can still send negative amount and throw someone in dept 😱 )</p><p>All that remains to modify add_tx() :</p><pre>def add_tx(block: Block):<br>    if block.branch in tangle_graph <br>       and block.trunk in tangle_graph:<br>        if block.value_tx:<br>            if check_value_tx(block.value_tx):<br>                move_money(block.value_tx[&#39;sender&#39;],<br>                           block.value_tx[&#39;receiver&#39;],<br>                           block.value_tx[&#39;amount&#39;])<br>                tangle_graph[block.get_hash()] = [block.branch,   <br>                                                  block.trunk]<br>                tangle_data[block.get_hash()] = block.data_payload<br>        else:<br>            tangle_graph[block.get_hash()] = [block.branch, <br>                                              block.trunk]<br>            tangle_data[block.get_hash()] = block.data_payload</pre><p>Now we can add a block with a value-transaction add_tx(value_block) and the Tangle will look like:</p><pre>tangle_graph<br>{&#39;2b503d9c90eec329b96b89cde4dc54efa826b0df&#39;: <br>[&#39;genesis_trunk&#39;,&#39;580e464bd9cef52e4af07508171ce84369b258d5&#39;],</pre><pre>&#39;37379d02f49e9dc57a6e08ff33e218a12c39f9de&#39;: <br>[&#39;genesis_branch&#39;,&#39;e0d5787db72c7a0bea6d9621f73bd4b21f47546f&#39;],</pre><pre>&#39;580e464bd9cef52e4af07508171ce84369b258d5&#39;:[&#39;37379d02f49e9dc57a6e08ff33e218a12c39f9de&#39;,&#39;genesis_trunk&#39;],</pre><pre>&#39;c33f585243abac2f59494eb092a600d3fe97423a&#39;: [&#39;genesis_branch&#39;,<br>  &#39;580e464bd9cef52e4af07508171ce84369b258d5&#39;],</pre><pre>&#39;e0d5787db72c7a0bea6d9621f73bd4b21f47546f&#39;:<br> [&#39;genesis_trunk&#39;,&#39;genesis_branch&#39;],</pre><pre>&#39;genesis_branch&#39;: [],<br> &#39;genesis_trunk&#39;: []}<br></pre><pre>tangle_ledger<br>{&#39;iota_foundation_address&#39;: 50, &#39;iota_satoshi&#39;: 50}<br></pre><pre>tangle_data<br>{&#39;2b503d9c90eec329b96b89cde4dc54efa826b0df&#39;: &#39;yxgcs&#39;,<br> &#39;37379d02f49e9dc57a6e08ff33e218a12c39f9de&#39;: &#39;1lyf8&#39;,<br> &#39;580e464bd9cef52e4af07508171ce84369b258d5&#39;: &#39;1y4vu&#39;,<br> &#39;e0d5787db72c7a0bea6d9621f73bd4b21f47546f&#39;: &#39;nct8w&#39;,<br> &#39;c33f585243abac2f59494eb092a600d3fe97423a&#39;: <br>  {&#39;data_payload&#39;: &#39;ps697&#39;,<br>   &#39;value_payload&#39;: <br>    {(&#39;sender&#39;, &#39;iota_satoshi&#39;),<br>     (&#39;receiver&#39;, &#39;iota_foundation_address&#39;),<br>     (&#39;amount&#39;, 50),<br>     (&#39;signature&#39;, &#39;calligraphic_signature_of_satoshi_himself&#39;)}<br>}</pre><p>This is simplest DAG implementation and of course it lack of consensus, keys encryption, validation and network topology, but it should give a reader the intuitive understanding how IOTA works.</p><p>Gist pages with the full code can be found <a href="https://gist.github.com/stkubr/0469ab30b1f992e2817f6060e4bf576f">here</a>. You can reach me on IOTA Discord at <strong>stkubr#1936 </strong>or on Twitter <a href="https://twitter.com/KubrakStan">@KubrakStan</a>. If you like my work and want me to continue expanding this tutorial into a second part, adding nodes consensus, Flask webserver and etc. please feel free to donate some Iotas on address:</p><p>EHNQJBGFAIUTJKPMSUCSDMIH9XTHANMJBVEZLFYURUXJUARTGKG9KDBHTCZHDKZZOGT9ENQEMHPOSLHPWXAELUPSDX</p><p>Thank you for your attention :)</p><blockquote><a href="https://coincodecap.com/?utm_source=coinmonks">Get Best Software Deals Directly In Your Inbox</a></blockquote><figure><a href="https://coincodecap.com/?utm_source=coinmonks"><img alt="" src="https://cdn-images-1.medium.com/max/584/0*OJ-qb5G6i863msBB.png" /></a></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=8e07677c55b5" width="1" height="1" alt=""><hr><p><a href="https://medium.com/coinmonks/simple-directed-acyclic-graph-iota-like-implementation-in-python-8e07677c55b5">Simple Directed Acyclic Graph (IOTA-like) implementation in Python</a> was originally published in <a href="https://medium.com/coinmonks">Coinmonks</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>