Radix

The trip to Radix began in 2013 year, saw the prospects and problems of bitcoin from our founder. He knew that in order to become a new global monetary system for Bitcoin or any other crypto currency, dan needs to be scaled to meet global demand. To check whether this is possible, dan started testing to see what the scaling limits of Bitcoin are.
Starting with Bitcoin
At the bottom, he opened the nodes from the coding cave (which is actually pretty good, although Dan's House is dirty kabinet in the back) and started spamming the test network to see what Bitcoin and blockade can do. He did everything, ranging from increasing the size of blocks to funny numbers using the best available equipment, and even make mining as cheap as possible. However, in the end, it can only reach 700-1000 operations per second (TPS).Blake. Knowing that Visa processed 24 000 TPS and Alipay carried out more than 725 000 transactions on its biggest shopping day, dan knew that these speeds would not be enough to achieve the goal of the global payment system.
Building with block-trees
Dan's next idea was as follows: If one block chain could only reach 1000 t / s, could a wide blockchain network work well? This next area of research, known as blocktri, is the first step to explore and understand Dan's sharding. The theory is that different branches of the block-tree can have different synchronization states, connected transactions can be in the same branch and in transactions that are not connected in other transactions.
The importance of grouping and grouping unrelated transactions has been an important point to ensure the effectiveness of a scalable book solution. You will see it appearing again in this post because it is stored in different stages and iterations of the accounting books learned by dan and the Radix team.
At the same time, we will return to the block trees. At a time when Dan was researching, building and testing block trees, dan also used the name eMunie to describe the project, which began to attract some loyal members of the team. This allowed team members to expand their testing experience with Danga and start beta testing in more "realistic" scenarios. Unfortunately, these tests have found that several hundred TPS can be achieved before block trees have problems.
When large branches of the Dan tree begin to differ in relation to the correct state of the transaction, this leads to a high level of load to adapt the network. This was due to an increase in the level of complexity of messages between nodes, which wanted to adjust the state of transactions. If it is necessary to perform one operation on the branch, then all operations on this branch and any branches should be aligned. Unfortunately, following the approach of the existence of transaction and mining blocks, it could not effectively solve the problems of network synchronization.
Do this with dagov
You or I would have destroyed this new one, you decided to pack it all up and you went down to the pub instead. But not dan, he took a cup of strong tea, metaphorically stroked his hands (it's very difficult to do this only when you wear T-shirts), and he decided to think differently. What if instead of grouping and synchronizing transactions to blocks, they are considered separately? With this in mind, dan began to study directed acyclic graphs (DAG).
Dag had similar characteristics to the blocktrees branch, but unlike blocktrees and blockchains, DAG allows you to link each transaction directly to the next one, having created the block and added each number/minute to the "chain". This approach had two main advantages — the DAG can perform operations immediately without the use of Block time, and they allow the removal of traditional deposits, which leads to greater efficiency.
So what was it? Dan has found the Holy Grail of a large-scale decentralized accounting book on a Global scale? The short answer is no. There is no long answer, but with great explanation. Although the DAG 1500 TPS can be reached without any problems, it has gone further-when trying to reach the visa level, it has faced security challenges. To achieve more scalability, you need the DAG segment, but DAG can only access all transactions that all nodes we know, you can protect against spending twice. Segmentation prevents this, that is, the scalable DAG is too weak for dual-spending attacks. Other projects solved this problem, creating centralized nodes of the "witness" or" coordinator", considered all transactions, but relying on these nodes, the accounting book is basically centralized, giving the system confidence and attack
Radix DLT Website: https://www.radixdlt.com/Radix DLT Medium Page: https://medium.com/@radixdltRadix DLT Official Telegram: https://t.me/radix_dltRadix DLT Official Twitter: https://twitter.com/RadixDLT