极简解读BitVM：如何在BTC链上验证欺诈证明

The author Wu Yue geek consults the promoter of the Chinese community, but unfortunately, most of the written materials about it can't explain the principle in a popular way at present. This paper is a simple summary after we read the white paper with only one page and consulted the materials related to trees. In order to facilitate readers to understand that some of the expressions are different from those described in the white paper, we assume that readers have some understanding and can understand the simple idea of fraud proof. First, summarize the ideas in a few words, and then release the unnecessary data under the chain. And when only the fraud proof that promises to challenge is stored in the storage chain, we only need to prove that the data needed to be uploaded is related to the existence of the chain, and then the main network will check whether these data are problematic or not, and whether the node where the data producer handles the transaction has evil behavior or not. All this follows the Occam razor principle, and the entity can be added as little as possible unless necessary. The so-called online fraud proof verification scheme based on popular summary. First of all, the computer processor is an input and output composed of a large number of logic gates. One of the core ideas of the system is to simulate the input and output effects of logic gates with bitcoin scripts. As long as the logic gates can be simulated, Turing machine can theoretically complete all the computable tasks, that is to say, as long as you have more people and more money, you can call a group of engineers to help you simulate logic gates with simple codes and then use a huge number of logic gates to realize or functions. This screenshot comes from a teaching game, Turing is complete, and the core content is to use logic gates. Especially the NAND gate to build a complete processor. Some people have compared the idea of making a processor with Redstone circuit in my world or equivalent to building blocks out of the Empire State Building in New York. It is said that it took someone a year to build a processor in my world. So why do you have to use analog or this is not very troublesome? This is because most bitcoins often choose to support or wait for high-level languages, but what can be run directly on the bitcoin chain at present is this simple one. A code example of a non-Turing complete programming language composed of special opcodes. If Bitcoin intends to verify fraud and inherit security to a great extent like waiting for Ethereum, it needs to directly verify a controversial transaction or a controversial opcode on the chain, so it is necessary to put the opcode corresponding to the adopted language on the bitcoin chain and run it again. The problem comes down to the effect of using this crude programming language of Bitcoin or other virtual machines. Therefore, from the perspective of compilation principle, To understand the scheme, it takes the opcode logic gate circuit translated from the opcode as an intermediate form between the opcode and the opcode. The white paper talks about the general idea of executing some controversial instructions on the bitcoin chain. The final simulated effect is to put the instructions that can only be processed on the bitcoin chain directly. Although this scheme is feasible, the difficulty lies in how to express all the opcodes with a large number of logic gates as an intermediate form and the combination of logic gates. Direct expression of some extremely complicated transaction processing flows may produce huge workload. Let's talk about another core mentioned in the white paper, that is, interactive fraud proof which is highly similar. Interactive fraud proof will involve a word called assertion. Generally speaking, the proposer is often acted as a sorter, who will post an assertion on the website to declare that some transaction data state conversion results are valid and correct. If someone thinks that the submitted assertion is wrong, the related data will be disputed at this time and. Exchange information in turn and search disputed data by dichotomy to quickly locate a very fine-grained operation instruction and its associated data fragments. The disputed operation instruction needs to be directly executed on the computer with its input parameters and the output results will be verified. Nodes will compare their calculated output results with the previously published output results. In this interactive fraud proof protocol called one-step fraud proof, the published data will be retrieved by dichotomy as soon as possible. Locate the controversial instruction and execution result, and finally send the one-step fraud proof to the interactive fraud proof flow chart on the component structure interpreted by the technical ambassador before the final verification reference. The idea of one-step fraud proof is relatively rough here, and the vast majority of trading instructions do not need to be re-verified in the chain, but one of the controversial data segment opcodes should be replayed when challenged. If the detection conclusion is that the previously released data has The problem is to drop the pledged assets. If there is a problem, the pledged assets can be dropped. If they do not respond to the challenge for a long time, the above effects can also be achieved through the contract on the Ethereum. After the interactive fraud proof and the one-step fraud proof are simply finished, we will talk about the tree and the huge amount of logic gates involved in a large number of transaction data processed under the chain, but we need some party directly. The formula proves that these data originally needed under the chain are not fabricated casually, which is a kind of data often mentioned in cryptography. First of all, let's say that the full name of the tree is to transform the tree involved in the compilation principle into the later form, so what is the tree? Its Chinese name is abstract syntax tree. Simply speaking, it is to subdivide a complex instruction into a bunch of basic operating units through lexical analysis and then organize it into a tree-like data structure. A simple case of a tree will make this simple operation. The calculation is subdivided into the underlying opcode data, and the tree is treed to support the tree. One advantage is that it can achieve efficient data compression. For example, if you want to publish a certain piece of data on the tree to the chain when necessary, but you have to convince the outside world that this piece of data really exists on the tree instead of being picked by you, what should you do? You just need to record the tree in advance on the chain and show it in the future to prove the relationship between a certain piece of data and the corresponding tree, so there is no need to store the complete tree on the chain. Just disclose it in advance as a data fragment to be presented when necessary, which can greatly reduce the amount of data and ensure that the data really exists in the tree, and only a small number of data fragments are disclosed on the chain instead of all data, which can play a good privacy protection effect. Refer to the example of the reason why data detention and fraud prove that smart contracts are not supported. The scheme of the tree tries to express all the logic gates with bitcoin scripts and then organize them into a huge tree. The bottom leaf diagram of this tree corresponds to the logic gates realized with bitcoin scripts, and every tree will be frequently published on the chain. 比特币今日价格行情网_okx交易所app_永续合约_比特币怎么买卖交易_虚拟币交易所平台

注册有任何问题请添加 微信：MVIP619 拉你进入群

文章转载注明 网址：https://netpsp.com/?id=61211