The first problem is the problem of Star Cloud chain, which just released NaX and dstaking. What is dstaking? What are its advantages?
First of all, dstaking, compared with the one we often hear about, is a relatively centralized one. That is, you need to transfer your token to a contract or address, that is, gather assets together, and then do some financial acts. In order to ensure the security of assets, we propose a concept of dstaking, that is, users only need to interact with the contract once, and then they can reach a contract with the contract. Then the contract is responsible for randomly checking whether the amount of your holding is consistent with your contract. If it is inconsistent, it is automatically considered that the holding has been cancelled, The intuitive advantage is that it will not have security problems, and the potential advantage is that it will be used in some scenes of WiFi in the future, which may have more participation and broader imagination.
The second point is concerned about the pod consensus algorithm of the star cloud chain. Can you describe the direction of the pod consensus algorithm of the star cloud chain?
Pod has always been an important concept that distinguishes the star cloud chain from other public chains. Our block out is not only a reward miner, but also other roles in the blockchain, such as developers and application users. So we are trying this direction, maybe in the form of token environment, we will give each user in the ecosystem a certificate of motivation, that is, their contribution to the ecosystem. Through the certificate of contribution, they can use the token to vote or pledge, or they can use node campaign to make more people contribute more roles, and they can get the system The unified reward makes the whole blockchain system form a positive incentive. The more contributions you make to the blockchain, the more rewards you will get and attract more people to join the ecosystem.
The third is proposed by the chain guest community, which gives some relevant suggestions for the work proof algorithm that can be used to control the growth of blockchain.
Just now I have seen that the problem is relatively long, that is to say, first of all, the main description of his problem is that he wants to make an identity system on the blockchain, which is an algorithm that can adjust the difficulty of proof of work with the growth of the chain. First of all, the proof of work mechanism POW of bitcoin is simple enough, which is actually a hash algorithm, and then it is sufficient It’s simple enough, and at the same time it has its own function to adjust the difficulty. That’s why when our computing power is rising, bitcoin can still maintain a 10 minute block out mechanism, that is, it will automatically adjust, so I think this student can go back. He mentioned that bitcoin seems to have no application above, and I think I can suggest that he use ether Fang, go to study how POW can adjust its difficulty automatically and see how to apply it to its system.
The fourth equity certificate, how to prevent blockchain reconstruction?
This question is to say, I think his equity certificate means POS, which is the proof of workload compared to the pow we just mentioned. Bitcoin doesn’t have a finnsll. What does the so-called finaolity mean? If there is a supercomputer, or someone has mastered more than 50% of the computing power of the whole network for a long time, in theory it can rewrite all bitcoin, because it has the principle of the longest chain, and it has no final state. So for POS, the equity proof is very easy to be in. Now many chains that use POS or propose POS algorithm have a concept called finaolity, or apple concept. That is to say, if you spend Apple or finaolity, you can no longer tamper with the outgoing block of the previous chain, so don’t worry about it.
The fifth Paxos is a fault-tolerant distributed consistency algorithm. Does it follow the block framework of Python algorithm and add blocks with a block chain?
Pacthons is actually one of the most classical consensus algorithms in distributed systems. It was proposed by Lampel, who I think is one of the greatest computer scientists in the world. And this system has been widely used in many large-scale distributed systems before the emergence of blockchain. For example, the circle B of Google is actually used in the biktable of Google. Biktable is used to calculate the weight of web pages and so on. It does some correlation calculation database system, which is biktable in Google and one of Microsoft Cluster management system, many large systems are using pacthons.
This student mentioned whether there is a blockchain application framework using pacthons. In fact, there are some. In some alliance chains, for example, in the fauburick of hyoerledger, your consensus algorithm can be customized. You can use Byzantium. You can also use pacthons and supose. They have no work, because they are in the form of alliance chain, so many It’s permision, but you can think of it as safe. It doesn’t need to take those security issues into account.