<\/p>\n
One of the many constants when it comes to the world of technology is that the best is never absolute. When a lot of technology experts were thinking about the awesomeness of blockchain and the possibilities, there came a possibility for a backless blockchain. Since it is made up of vertices and arrows that could be intertwined in any fashion, it was aptly named \u2018Tangle\u2019. It would take quite some time for this term to come out from its Disney connotation to one of the most advanced technologies when it comes to facilitating transactions.<\/p>\n
\u2018Tangle\u2019 is more of a moniker used to describe IOTA\u2019s directed acyclic graph (DAG) based transaction settlement and data integrity layer. A much-needed digress would be to introduce IOTA – IOTA is a blockchain created exclusively for IoT devices and has been embraced even by the likes of Bosch and Volkswagen. The Tangle, in essence, is a string of individual transactions that are connected with each other, and are stored through a decentralized network of node participants.<\/p>\n
The Key Advantage of Tangle:<\/strong><\/p>\n One of the greatest advantages with the Tangle is that it does not have an exclusive set of miners. The miners themselves are constantly performing small computational Proofs Of Work (PoW) for every transaction by verifying the previous transactions that have happened on the network. As opposed to the transactions of users being incorporated in blocks created by miners on the blockchain, the users function both as miners and creators of transactions.<\/p>\n The absence of distinct \u2018miners\u2019 would mean that the \u2018participants\u2019 in the transaction are also the \u2018approvers\u2019 of other transactions – which is not true with Bitcoin and many other cryptocurrencies. With this concept of the approvers being miners, Tagle has the potential to scale globally, and it can be used to create a global micropayment network. As an extension, the \u2018scalability\u2019 makes Tangle a congenial platform for securing data transmitted to and from IoT devices – the reason why it came into existence in the first place.<\/p>\n How Does Tangle Do This?<\/strong><\/p>\n Tangle makes it possible because it comprises of a DAG and not a blockchain to store its ledger. Theoretically, the scalability of the DAG is directly proportional to the number of transactions being submitted to the network. Tangle is designed to eradicate one of the greatest disadvantages plaguing cryptocurrency and blockchain – scalability. The new technology can facilitate a vast growth of a network of interconnected devices and can be the global solution to micropayments and IoT data.<\/p>\n Tangle creates a plot-twist by mandating that any creator of the transaction must verify the previous two transactions within the network. This requires a small computational PoW on behalf of the user, and there are no transaction fees to use Tangle, as the network is not heterogeneous.<\/p>\n The Way Tangle Works:<\/strong><\/p>\n The secret to Tangle\u2019s awesomeness is in the DAG – the directed acyclic graphs are finite directed graphs similar to vectors, that have a collection of vertices connected by arrows. The \u2018vertex\u2019 represents a transaction and the \u2018arrow\u2019 represents the approval-connection between two transactions. The first transaction or the \u20180 transactions\u2019 in the case of IOTA contained all the IOTA coin (MIOTA) that has been and will ever be created. The last transaction in the line of approval is called the transaction tip. The arrows, akin to vectors, represent the \u2018direction\u2019 of the flow of approval. Just like how the longest chain is considered the PoW in blockchain and bitcoin, the heaviest chain is considered the PoW in Tangle.<\/p>\n The DAG is not evenly spread – it\u2019s quite chaotic from an outsider\u2019s perspective. There is an intentional delay to make it reflect the real-world latency. The randomness of the transaction-spread is accomplished through the Poisson Point Process, a probability-method used to map random points in a mathematical space.<\/p>\n Each incoming Tangle, as a \u2018fee\u2019, needs to approve two previous transactions. The transaction tips to be approved among the many that await approval are chosen using a method called \u2018Random Walk\u2019. The \u2018Walk\u2019 is essentially a selection process that starts from the Genesis transaction and progresses towards the tips.<\/p>\n Random Walks – Not so Random After All:<\/strong><\/p>\n There are two types of random walks.<\/p>\n The Unweighted random walk uses the classic \u2018equal probability\u2019 method to determine the tip that needs to be approved. The Weighted random walk is a complicated process that factors in a cumulative weight on each jump of a tip. The cumulative weight is proportional to the number of transactions that a tip has been approving both directly and indirectly. This will ensure that there are no \u2018lazy tips\u2019 that count on the equally distributed probability to have their transaction approved without doing much work themselves.<\/p>\n Now a question arises on whether or not genuine transactions will be approved. While it can only be left to chance, Tangle has assigned a probability-score called the confirmation-confidence and is represented in percentage. While there are chances that this quantity can be maliciously manipulated, the chances are quite low.<\/p>\n Tangle has also introduced a \u2018centralizing\u2019 factor that acts to mitigate the chances of malicious attacks. The \u2018Coordinator\u2019 – as the centralized, voluntary and temporary alternative consensus mechanism is called – issues a milestone transaction every two minutes and all the transactions approved by the Coordinator immediately, in effect, have confirmation confidence of 100%!<\/p>\n The \u2018Centralization\u2019 raises questions, but eventually, when the network scales and the number of transactions increase, the Coordinator will be rendered obsolete, and Tangle will function as a completely decentralized network.<\/p>\n