Authors:
(1) Bennett Yi, Oasis Laboratory;
(2) Al -Fajr song, Oasis Laboratory;
(3) Patrick McCuri, Ingoura;
(4) Chris Backland, Ingoura.
Links table
Abstract and 1. Introduction
-
Main concepts
2.1 Record attached only and 2.2 cases of the virtual device
2.3 Transactions as curry functions
2.4 The natural names of the state
2.5 Earth’s truth
2.6 Effective state representations
2.7 checkpoints
2.8 Implementation parameters: Calldata
2.9 arrangement implementation
2.10 Decision on the right situation
-
Ideal layer design 2
3.1 VM job queue and arrangement of final transactions
3.2 Provides data and collecting garbage
3.3 state final
3.4 checkpoints
-
Conclusion and references
A. Security teachers to reveal the contradiction
a summary
Blockchains combines only a distributor attachment with a virtual device that determines how to explain registry entries. By displaying transactions such as the status conversion functions of the apparent device, we separate naming From a state from calculating its value and reaching consensus on this value. This discrimination allows us to separate an idea Arrange the final treatment from The value of the final state. More consider how Blockchain is treated with common failure in the common situation, such as zero day’s exploits that lead us to an idea Inspection.
The consensus on the order of the transaction determines the basic truth. Everything else-determines the value of the state or dealing with catastrophic failures such as errors / attacks that are based on zero-are just improvements.
1 introduction
The basic ideas behind smart contracts and clear Blockchain systems, based on only a central attachment record, and how we explain the meaning of these registry entries using an abstract virtual device (VM).
Although the basic idea is simple, there are many design options that must be taken before determining and implementing the full Blockchain system and becoming used, for example, coordinating messages that can be recorded and meaning, VM machine connotations, etc.
While practitioners understand the nuances, clarification of these concepts can make it easier for their influence to discuss them and to achieve alternative design options. This paper tries to use some basic ideas and blogging of programming languages, connotations, and group theory to help design smart contract systems as a way to direct how to look at these design options, safety issues that arise, and their expansion effects.
We offer the following distinctive flavors from the end:
• The final registry, when an irreversible entry is canceled for the Blockchain record.
• The final arrangement of transactions, when the effect of the transaction on the VM condition is irreversible, without computing first.
• The state value finals, when the value of the calculated condition as a data structure is determined efficiently. This is irreversible except for recovery from the failure of the critical infrastructure (determined by governance), for example, the opponent was able to have a code error that all participants or the opponent use to violate the assumption of security, such as bribery of the highest number of participants in the committee.
• The final point of the checkpoint, when it is no longer possible to change the value of the calculated condition by solid chocolate, and thus becomes truly unpopular.
We confirm that the arrangement of final transactions, created using Log Finality, is the key to thinking about Blockchain. However, the state value finals and the end of the checkpoints are important improvements: they, respectively, allow the application to be the identification of the independent special condition is very expensive and allows the storage layer to restore the storage.
In the next section, we present the ideas, processes and terms that we use to analyze the Blockchain properties and use them to discuss some known Blockchain systems and their characteristics. After that, in Section 3, we discuss what we think is “perfect” properties and try to draw the shape of such a system. Finally, we make final notes in Section 4.
