CN113269636A - Block chain-oriented nested transaction method - Google Patents

Block chain-oriented nested transaction method Download PDF

Info

Publication number
CN113269636A
CN113269636A CN202011573940.1A CN202011573940A CN113269636A CN 113269636 A CN113269636 A CN 113269636A CN 202011573940 A CN202011573940 A CN 202011573940A CN 113269636 A CN113269636 A CN 113269636A
Authority
CN
China
Prior art keywords
agent
transaction
fuel
user
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202011573940.1A
Other languages
Chinese (zh)
Inventor
徐兵
林乐
兰春嘉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Neng Lian Tech Ltd
Original Assignee
Neng Lian Tech Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Neng Lian Tech Ltd filed Critical Neng Lian Tech Ltd
Priority to CN202011573940.1A priority Critical patent/CN113269636A/en
Publication of CN113269636A publication Critical patent/CN113269636A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/64Protecting data integrity, e.g. using checksums, certificates or signatures

Abstract

The invention relates to a block chain-oriented nested transaction method, which is applied to an online transaction system for providing agent services for transactions of users, and provides the block chain-oriented nested transaction method, wherein the application manages the value of the quantity of fuel identifiers provided by agent nodes through an agent cluster, limits the value by using a method similar to an algebraic system, discusses the condition that the value of the fuel identifiers is overlarge in cases, limits the value of the fuel identifiers, manages the grades of the agent nodes and the data of the agent nodes in a multi-level manner, adjusts the agent services and the balance of the fuel identifiers of the agent nodes, ensures that most of the agent nodes can have balance to serve the users, adjusts the process of intelligent contract transactions, and adds new contents and the intervention of the agent nodes, finally, a complete technical scheme is formed.

Description

Block chain-oriented nested transaction method
Technical Field
The invention relates to the technical field of online transaction, in particular to a block chain-oriented nested transaction method.
Background
In the ether house type blockchain, transactions are mainly divided into transactions of transfer and transactions of intelligent contract calling. The user can deploy the transaction called by the intelligent contract and can provide the intelligent contract for other users to call. The deployer of the intelligent contract, as a service provider, provides common users with public-link-based application services. In this process, the initiator requiring the transaction must hold a certain amount of the fuel identifier. Which to some extent provides the cost of using smart contracts by ordinary users. The popularization of the application of the intelligent contract is influenced. In order to reduce the user cost, the following solutions exist, the first solution is that the ordinary user sends the parameters of the intelligent contract to be called to the third party or intelligent contract deployer (i.e. txplayer), and the third party or intelligent contract deployer actually initiates the chain call transaction; the second scheme is that common users sign parameters of the intelligent contracts to be called one by one, send the parameters to the TxRelayer of the intelligent contract deployer, send the signed data to the chain by the TxRelayer, sign off the parameters one by one in the Etherhouse EVM, and really execute the signed data. The parameters called by the common user are directly sent to the TxRelayer without signature, and because the common user does not have the signature, the TxRelayer has the risk of possibly tampering the data, which has certain potential safety hazard. Ordinary users sign the intelligent contract parameters to be called one by one, and send the intelligent contract parameters to the TxRelayer, and the TxRelayer sends the signed data to the chain, and the signed data is de-signed and executed in the EtherFang EVM. Therefore, a technical solution to solve the above problems is urgently needed.
Disclosure of Invention
In view of the above, the present invention provides a block chain oriented nested transaction method that solves or partially solves the above-mentioned problems.
In order to achieve the effect of the technical scheme, the technical scheme of the invention is as follows:
the nested transaction method is applied to an online deployment system, the online deployment system is used for providing agent service for the transaction of a user, and the online deployment system comprises an agent organization, a deployment module, a packaging module, a multiple nested module and an examination and verification module; the agent organization comprises a plurality of agent cluster groups, each agent cluster group comprises agent nodes of the upper limit of the number of the fuel identifiers calculated according to the same operation rule, the agent nodes apply for agent services and calculate the upper limit of the number of the fuel identifiers provided by the agent nodes according to the operation rule of the agent cluster group, the agent nodes are added into the agent cluster group, the upper limit of the number of the fuel identifiers provided by the agent nodes is the maximum value of the number of the fuel identifiers used by the agent nodes for transaction of an intelligent contract which can be provided for a user, if the upper limit of the number of the fuel identifiers provided by the agent nodes is used by the user or is not used by the user for more than a time period T, and the agent nodes do not use the operation rule in the agent cluster group to calculate the upper limit of the number of the fuel identifiers, and the agent nodes are removed from the agent cluster group; the same agent node can join a plurality of agent cluster, but when the agent node starts to perform agent service for the user and the agent service is not finished, the copy of the meta-structure placed on the announcement position by the agent node is withdrawn; the agent nodes perform agent service for the whole transaction process of the user, the upper limit of the quantity of fuel identifiers provided by the agent nodes in each agent aggregation group changes according to an operation rule, the signature module is used for helping the agent nodes perform packaging signature on the transaction of the intelligent contract, the packaging module is used for helping the packaging service of the transaction of the intelligent contract, the multiple nested module is used for processing the transaction of the intelligent contract to be processed into the transaction of the intelligent contract finally placed on a block chain, and the examination and certification module is used for confirming certification in the transaction agent process of the intelligent contract of the user; the agent service provides the agent node with a fuel identifier required for successful transaction for the transaction of the intelligent contract of the user; the time period T is a time period and is determined by a management user on the online deployment system; each agent cluster group is matched with a meta-actor, and the meta-actor is used for expressing the operation rule of each agent cluster group and is a unary operator or a binary operator which can operate on positive and real numbers; the online deployment and management system is used for each agent cluster, is constructed into a variable and is assigned with the upper limit value of the number of the fuel identifiers used by the agent nodes of each agent cluster; each agent cluster is provided with an operation rule, the online processing system sets an upper limit of the amount of the fuel identifier in real time along with the change of time, the product of the upper limit of the amount of the fuel identifier which can be provided by each agent node and the unit price of the fuel identifier cannot exceed the upper limit of the amount of the fuel identifier, the fuel identifier is a fuel identifier issued by the online processing system, the fuel identifier is used for paying the transaction cost of the intelligent contract, the unit price of the fuel identifier is the price of each fuel identifier, and the unit price of the fuel identifier changes along with the change of time in real time and is determined by a management user; when the agent node applies to provide agent service for the user, the agent node needs to calculate the upper limit of the fuel identifier amount provided by the agent node, the agent node is added into the agent cluster, and the agent node has the right of checking the meta-actor in the agent cluster and the meta-structure in the upper limit discrete area of the agent cluster; the operation rule of the agent cluster is that after the agent nodes finish checking, one agent cluster is selected, when the selected agent cluster meta-actor is a unary operator, the unary operator on the on-line deployment system is limited to a copy operator, and the copy operator represents an operator for copying the value of one meta-construct in the upper discrete region, the concrete process is that the agent node can only select one meta-construct in the upper discrete region, the selected meta-construct acts on the unary operator, i.e., the value of the selected element is replicated, resulting in a replicated result, which acts as an upper limit on the number of fuel identifiers that the broker node can provide if the product of the replicated result multiplied by the unit price of the fuel identifier does not exceed the fuel identifier amount upper limit, and the agent node is verified, and the meta-structure copy with the same value as the copied result is extracted from the upper limit discrete area and placed in an advertisement bit in the advertisement area; when the element actor of the selected agent cluster is a binary operator, the agent node can select more than two elements from the upper discrete area, the elements are connected by using the element actor to obtain an operation formula, if the product of the operation result of the operation formula multiplied by the unit price of the fuel identifier does not exceed the upper limit of the amount of the fuel identifier, if no element value in the upper discrete area of the agent cluster is the same as the operation result of the operation formula, a new element structure is created, the new element structure is represented by adding a numerical subscript to a variable name of the agent cluster, the numerical subscript is a sequential number of the element structure, the new element structure is assigned as the operation result of the operation formula, the agent node is verified, the new element structure is placed in the upper discrete area, a copy of the new element structure is provided and placed in a notice bit of a notice area, and if the operation result of the operation formula has the element structure with the same value in the upper discrete area, placing a copy of the meta-structure of the same value in the upper discrete region in an advertisement bit of the advertisement region; the notice area comprises a plurality of notice positions and is used for placing the meta-structure with the same value as the upper limit value of the fuel identifier number of the agent node providing the agent service, the notice area is disclosed to all users, the user can select a copy of the meta-structure placed in the notice area after checking, the agent node placing the copy of the meta-structure provides the agent service for the user, and the selected agent node deletes the copy of all the meta-structures placed in the notice area; the advertising bit is a storage space for storing an upper limit of the number of fuel identifiers provided by the agent node providing the agent service at the current time, and the upper limit of the number of fuel identifiers is replaced by an element which is the same as the upper limit of the number of fuel identifiers provided by the agent node;
the process of the agent node for checking the resources is that the agent node extracts the value of the copy of the element placed on the notice position to the management user, the management user locks the fuel identifiers with the same number as the value of the copy of the element placed on the notice position in the account of the agent node, the initial value of the locking time is set, the initial value of the locking time is defaulted to be a time period T, but the agent node can adjust the initial value of the locking time according to the grade of the agent node, the specific process is that the online deployment system establishes the management system of the agent node, all the agent nodes are graded, the grade of all the agent nodes is from 1 to M, M is a positive integer, the management user determines, the grade of the agent node is determined according to the number of times of the agent node for carrying out the agent service, the T is arranged from less to more according to the number of times of the agent service of the agent node in each time period, the agent nodes are evenly distributed into the levels 1 to M, the more the times of agent service are, the higher the distributed level is, and all the agent nodes left in the average distribution are distributed into the level 1; determining an initial value of a locked time which can be set by the proxy node according to the level of the proxy node, assuming that the level of the proxy node is N, the initial value of the locked time can be set by the proxy node, if the initial value of the locked time is a time period T, if the initial value of the locked time is selected to be not set, the initial value of the locked time is a time period T, if the initial value of the locked time is selected to be set to be M times of the time period T, the initial value of the locked time is M times of the time period T, if the initial value of the locked time is selected by a user, directly dividing fuel identifiers with the same number of values of copies of the meta structure on a locked announcement bit into the users for use, returning the unused fuel identifiers to an account of the proxy node, if the locked time is not selected by the user, if the total length of the locked time is the time period T, directly unlocking, withdrawing the copies of the meta structure on the corresponding announcement bit, and if the total length of the locked time does not exceed the time period T, inquiring the user every M times of the time period T, withdrawing the corresponding copies of the meta-structures on the announcement positions if the user needs to withdraw, otherwise, continuing to lock the M times of the time period T, if the user inquires for M times, continuing to select locking, and finally dividing the locking time period T by the N times of the time period T; n is a natural number and represents the level of the proxy node, M is a natural number, and the value of M is equal to N;
in the online deployment system, each agent node is represented by using a dynamic connection point, the dynamic connection point is a storage space for storing data of the agent node, and the data of the agent node comprises the times of selecting an initial value of time for setting locking, the grade of the agent node and the value of the number of fuel identifiers owned in an account of the agent node; the dynamic connection point is divided into three subspaces, the first subspace stores the times of the initial value of the time for selecting and setting the locking for the agent node, a counter is used for counting the times of the initial value of the time for selecting and setting the locking for the agent node, the counter is automatically cleared every time period T, the counter is associated with the level of the agent node, the maximum value of the times of the initial value of the time for selecting and setting the locking is set according to the level of each agent node, when the maximum value of the times of the initial value of the time for locking is reached, the counter stops counting, the agent node cannot set the initial value of the time for locking in the time period T after the counting is stopped, and only a default value can be used; the level of the agent node is stored in the second subspace, the level is automatically adjusted every time T, the value of the fuel identifier number owned in the account of the agent node is stored in the third subspace, the value of the fuel identifier number in the account is automatically mapped and is mapped with the account which is provided by the agent node and is used for providing agent service; and, when the agent node permits, a dynamic dependency line is established between the third subspace and a third subspace of other dynamic connection points, the dynamic dependency line is used for connecting a line of the third subspace of the two dynamic connection points, indicating that a fuel identifier can be transferred between the two third subspaces, the dynamic dependency line is marked with a transfer time and a transfer number, the transfer time is a time for transferring the fuel identifier, the transfer number is the number of fuel identifiers for performing the transfer, and the process of transferring the fuel identifier is that a management user in the on-line deployment system reduces the value of the number of fuel identifiers stored in the third subspace, adds the reduced value to the value stored in the third subspace of the dynamic connection point connected to the dynamic dependency line, and adds the number of fuel identifiers of the transfer number to the value stored in the third subspace of the dynamic connection point connected by the dynamic dependency line by specifying the transfer time, and transferring the quantity of fuel identifiers of the quantity into accounts of corresponding proxy nodes of the dynamic connection points connected by the dynamic dependency line; and, it is specified that the fuel identifier that is not locked is not restricted, but that the locked fuel identifier can only be subtracted, if not selected by the user after a time period T from the start of the locking, to be accumulated into the values stored in the third subspace of other dynamic connection points;
when the product of the value of the more than 50 percent of the components in the upper limit discrete area and the unit price of the fuel identifier exceeds 80 percent of the value of the upper limit of the amount of the fuel identifier, the management user can reduce the components in the upper limit discrete area in three modes, wherein the first mode is that the management user can select to reduce the value of the copy of the placed components in the notice area, the maximum reduction is not more than 20 percent of the original value of the copy of the placed components in the notice area, the reduction times of the reduction in the first mode in each time period T are not more than K times, K is a positive integer and is determined by the management user, the second mode is that when the number of the components in the upper limit discrete area exceeds or is equal to the limit value of the maximum number of the components which can be placed in the upper limit discrete area, the value of the components in the upper limit discrete area is reduced, and each component reduces the value of 30 percent at most, and the third mode, when the number of the elements in the upper limit discrete area does not exceed the number limit value of the maximum elements which can be placed in the upper limit discrete area, the management user selects to place the dummy elements into the upper limit discrete area, the values of the dummy elements set by the management user are variables of real numbers, the variables are consistent with the elements, the variable names of the discrete clusters are added with subscripts, the subscripts are numbered in sequence, the dummy elements do not occupy the number limit value of the maximum elements which can be placed in the upper limit discrete area, the number of the dummy elements placed in each upper limit discrete area does not exceed 10% of the number limit value of the maximum elements which can be placed in the upper limit discrete area, and after the dummy elements are placed into the upper limit discrete area, the agent node can replace the elements for use; the dummy element can replace all functions of the element, is a type of element, but cannot represent the value of the upper limit of the number of the used fuel identifiers, and when the element operator is a binary operator, the agent node selects the element and the dummy element from the upper limit discrete area to generate the upper limit of the number of the fuel identifiers, and the number of the selectable dummy elements is limited by the management user; every time the number of the elements in the upper limit discrete area exceeds the limit value of the number of the maximum elements which can be placed in the upper limit discrete area, selecting the element with the maximum value for deleting, and deleting 50% of the number of the elements with the values from large to small in the upper limit discrete area; configuring an upper limit discrete area in each agent cluster, and placing used meta-structure not on the notice position and storage space of released pseudo-meta-structure of the agent cluster in the upper limit discrete area; the upper limit of the number of fuel identifiers is the maximum number of fuel identifiers that the agent node can provide for the transaction of the intelligent contract of the user; the copy of the meta-structure on the announcement site is not selected by the user in the time period T, and the meta-structure on the announcement site is automatically cleared; the number limit value of the maximum elements which can be placed in the upper limit discrete area is the maximum number of the elements which can be placed in the upper limit discrete area and is a natural number;
when a user needs to send out the transaction of the intelligent contract, a signature module firstly checks the copy of the element on the notice position, as long as the quantity of fuel identifiers required by the user for the transaction of the intelligent contract is less than or equal to the value of the copy of the element on the notice position, the user can select the copy of the element on the notice position, namely, an agent node for placing the copy of the element on the notice position is selected to carry out agent service for the transaction of the intelligent contract, and the copy of the element on the notice position is removed after selection; specifying values of copies of eligible elements to actual needs of the userThe difference between the fuel identifier numbers is controlled
Figure 828884DEST_PATH_IMAGE001
In the above-mentioned manner,
Figure 886970DEST_PATH_IMAGE001
the management user determines that the number is positive and real, the copies of the meta-structure which does not meet the condition can be selected only if all the announcement positions do not have the copies of the meta-structure which meets the condition or the copies of the meta-structure which meets the condition are selected by the user, and the number of the fuel identifiers actually required by the user is the number of the fuel identifiers required by the transaction execution of the intelligent contract of the user; the copies of the meta-structure are copies of the meta-structure;
then, the packaging module packages and sends data related to the transaction of the intelligent contract of the user and the number of the fuel identifiers actually required by the user to the agent node, the data related to the transaction of the intelligent contract comprises a data field related to the transaction of the intelligent contract and an account address of the user, the address of the intelligent contract called by the user and nonce data of the transaction, the data field related to the transaction of the intelligent contract is all data contained in the transaction of the intelligent contract, the account address of the user is the account address of the user who sends the transaction of the intelligent contract, the address of the intelligent contract called by the user is the address of the transaction of the intelligent contract, the nonce data of the transaction is the nonce field in the transaction of the Ethernet intelligent contract, the agent node selected by the user to carry out the agent service signs the data related to the transaction of the intelligent contract, the packaging module adds the address of the account of the number of the frozen fuel identifiers of the agent node on the data related to the transaction of the intelligent contract after the signature is successful, packaging the data to be used as data related to the transaction of the intelligent contract after the signature is packaged, and when the quantity of the fuel identifiers is frozen in the account of the proxy node, encrypting the quantity of the fuel identifiers by using a private key, attaching the decrypted public key to the data related to the transaction of the intelligent contract after the signature is packaged, and finally using the public key as the signature packaging transaction;
the multiple nested modules are responsible for assembling the signature packaging transaction into a nested transaction, and the nested transaction is processed on the basis of the original signature packaging transaction and is used as a transaction of an intelligent contract deployed on a blockchain network; firstly, at each time interval T, a multiple nested module applies for a special public key address as a sending address of nested transactions, the multiple nested module online deploys a processing system to construct a public key address library, the public key address library is used for placing a storage space of the special public key address, the special public key address is specially used as the sending address of the nested transactions and is not used by other users and agent nodes of the online deploys the processing system, only a counting identifier can be placed in each special public key address, the counting identifier is a special digital integral issued on the online deploys the processing system, and the number of the counting identifiers transferred each time is only a positive integer; taking a special public key address from the public key address library in each time period T as a sending address of all nested transactions in the time period T; the multiple nested module updates a special public key address in each time period T and stores a counting identifier of the number specified by a management user in the multiple nested module; the nested transaction of the multiple nested modules is divided into an external layer and an internal layer, the multiple nested modules add the signatures of the agent nodes into the data fields in the signature packed transaction and then encapsulate the signatures into the data fields of the nested transaction again to serve as a new signature packed transaction, the new signature packed transaction serves as the internal layer of the nested transaction after processing, the internal layer of the nested transaction is invisible to users except for the users owning the nested transaction and other users managing the users, the multiple nested modules are arranged outside the internal layer of the nested transaction, the sending address of the nested transaction is a special public key address distributed in the current time period T, and the nested transaction can be effectively sent to a block chain network only after the users sign the whole nested transaction;
the examination and certification module is provided with a plurality of certification nodes and a calculation address, the calculation address is a public key address and is used for calculating the times of successfully executing the nested transaction, only a counting identifier can be stored in the calculation address, the certification nodes are used for verifying the nested transaction when the nested transaction is executed, and the certification node verification steps are that firstly, the certification nodes identify whether the sending address of the nested transaction on the outer layer of the nested transaction is the special public key address distributed in the current time period T or not, check whether the balance in the special public key address distributed in the current time period T exceeds one counting identifier or not, lock one counting identifier in the special public key address distributed in the current time period T, the certification nodes unpack the inner layer of the nested transaction, and the unpacking times of the inner layer of the specified nested transaction are limited by a management user, if the conditions are met, the nested transaction is started and packaged into a block chain, a counting identifier locked in a special public key address is sent to a calculation address, and meanwhile, the quantity of the unlocked fuel identifiers is deducted from the account of the agent node;
the method comprises the following steps that a management user is responsible for managing agent cluster groups and appointing element function symbols of the agent cluster groups, a variable name is distributed to each agent cluster group, the variable name is expressed by using lower case letters, the number of the variable name is stipulated to firstly use one lower case letter to express the variable name, after all the lower case letters are used to express the variable name, an online deployment system uses the combination of two lower case letters to express the variable name, after all the two lower case letters are used, the online deployment system uses the combination of three lower case letters to express the variable name, and the number of the lower case letters expressing the variable name is increased in sequence; the variable name and the digital subscript are used for representing the element structure, the digital subscript is the sequential number of the element structure in the same agent cluster group, and the digital subscript is a positive integer.
The beneficial results of the invention are: the invention provides a block chain-oriented nested transaction method, which provides a transaction mode capable of deploying an intelligent contract for users without enough fuel identifier quantity, an agent node is responsible for providing the fuel identifiers required by the users, manages the value of the fuel identifier quantity provided by the agent node through an agent cluster, limits by using a method similar to an algebraic system, discusses the situation that the value of the fuel identifier is overlarge in cases, limits the value of the fuel identifier, performs multi-level management on the level of the agent node and the data of the agent node, adjusts the agent service and the fuel identifier balance of the agent node so that most of the agent nodes can have balance to serve the users, adjusts the transaction process of the intelligent contract, adds new content and the intervention of the agent node, finally, a complete technical scheme is formed.
Detailed Description
In order to make the technical problems, technical solutions and advantageous effects to be solved by the present invention more apparent, the present invention is described in detail below with reference to the embodiments. It should be noted that the specific embodiments described herein are only for illustrating the present invention and are not to be construed as limiting the present invention, and products that can achieve the same functions are included in the scope of the present invention.
Example 1: in an etherhouse type blockchain, the user's identity account is easier to generate than in a traditional centralized system. However, the need for sufficient fuel identifiers in the user's account address during the transmission of the transaction to the chain raises the user's threshold to some extent. The invention designs a nested TxRelay transaction and introduces the role of TxRelay, so that the transaction can be sent to the user even if no fuel identifier exists in the user address on the premise of ensuring the security.
The invention aims to design a safe and efficient relay transaction, and solve the pain point which is difficult to solve by the existing scheme.
i. User acquires TxRelayer signature
The transaction for the smart contract is ultimately issued by the user, who is required to request a signature from the txreleaser on behalf of gas in order to be authenticated by gas. Signature data of the txlayer mainly comprises: the parameters of the intelligent contract actually called by the user are a data field, the address to of the intelligent contract called by the user, the nonce of the user, the value field of the transaction, and the account address from of the user.
When the txplayer receives the user's data, this piece of information is signed using the method provided by web3 j. As a recognition of the transaction that the user is about to send, he is willing to pay a portion of gas for the transaction itself.
Assembling nested transactions by a user
When the user receives the signature of the TxRelayer on the transaction to be sent, the user needs to splice a special type of transaction again.
The main difference between this transaction and a common intelligent contract is that:
1) in order for a node of the block chain to recognize that this is a particular nested transaction, the user needs to specify the sending address of the transaction as a particular address, for example 0x 7777777777777777777777777777777777777777777777777777777777777777777777777777.
2) And packaging the signature sent by the TxRelayer and the original data field of the user into a new data field by the user, and stuffing the new data field into the nested transaction.
3) The user signs the reconstructed nested transaction, makes a transaction which can be identified by the Etheng, and sends the transaction to the chain.
Decapsulating nested transactions in nodes and validating through gas
When a node receives a nested transaction of a special type, the following work needs to be done:
node execution nested TxRelay Smart contract transactions
When each node executes the transaction in the block and encounters the nested txdelay intelligent contract transaction, the verification process in the step iii still needs to be performed on the node which has not verified the transaction before.
After verification is finished, the nested transaction is sufficient to be a normal intelligent contract calling msg, the msg is sent to an Ethernet virtual machine to be executed, and after the transaction is executed, the account address of the TxRelayer is used as a real gas withholding.
The key point and the point to be protected in the invention are the design of the TxRelay nested transaction and the analysis and execution of the TxRelay nested transaction.
The invention has the advantages that:
i. the user does not need to supplement gas in the address account of the user in advance, so that the use cost of the user is reduced;
the relay transaction is sent by the user, so that the transaction content is guaranteed not to be tampered;
the relay transaction is unlocked when the execution environment of the node runs, and the complex encryption algorithm unsealing transaction is not executed by the Ethenhouse virtual machine by means of the agent intelligent contract, so that the performance is greatly improved;
multiplexing a special address space, and not changing the original transaction and the related interface;
if all the announcement positions in all the announcement areas are provided with data, selecting the blocks which are arranged in the waiting chains of the announcement positions, arranging the blocks which need to be arranged in the blocks of the announcement positions in sequence according to the time sequence during arrangement, arranging each announcement position in the blocks which correspond to one waiting chain according to the time sequence, wherein the waiting chains are a chain of blocks, but the size of the storage space on the blocks on the waiting chains is limited, which is determined by a system management user specifically, and only data on one announcement position is arranged on each block; storing an upper limit of the number of fuel identifiers provided by the agent nodes, which are visible to all current users, of the currently valid element on an announcement bit in the announcement area;
in the patent, when a copy of a meta structure provided by a proxy node is selected by a user, the number of the locked fuel identifiers with the same number as the value of the copy of the meta structure on an announcement site is unlocked immediately, and after a period of time T, the number of the locked fuel identifiers with the same number as the value of the copy of the meta structure on the announcement site is unlocked immediately without the selection of the user; the operation rule is that the agent node can select elements in a limited upper limit discrete area, the elements are connected by using the element function character to obtain an operation formula, and if the product of the operation result of the operation formula multiplied by the unit price of the fuel identifier does not exceed the upper limit of the amount of the fuel identifier, the operation result of the operation formula is used as the upper limit of the number of the fuel identifiers provided by the agent node; after the agent node signature is successful, covering the signature on the data related to the transaction of the intelligent contract; in the method, each agent cluster is assigned with a variable name, the variable name is expressed by using lower case letters, the number of the variable name is specified to firstly use one lower case letter to express the variable name, after all the lower case letters are used to express the variable name, the online signature system uses the combination of two lower case letters to express the variable name, after all the two lower case letters are used, the online signature system uses the combination of three lower case letters to express the variable name, the number of the lower case letters expressing the variable name is sequentially increased, and when all the lower case letters are used, the agent cluster is not increased; the variable name and the digital subscript are used for representing the element structure, the digital subscript is the sequential number of the element structure in the same agent cluster group, and the digital subscript is a positive integer; the account of the agent node in the patent is an account for storing a fuel identifier; when the transaction of the intelligent contract is not successful, returning the fuel identifier which is unlocked and can be used to the account of the agent node;
the variable name plus the numerical subscript of one agent cluster are used for representing the element structure, the numerical subscript is the sequential number of the element structure in the same agent cluster, the numerical subscript is a positive integer, for example, the variable name of one agent cluster is aa, then the element structure of the agent cluster is from aa1Beginning with aa, the following element is in turn aa2、aa3、...;
gas is fuel, an EVM (ethernet virtual machine) code operating environment is implemented on an ethernet block chain, when a write operation is performed on the chain, each whole node in the network performs the same calculation and stores the same value, the consumption of the execution is expensive, in order to promote people to not put the calculation which can be performed under the chain on the chain, and to reward miners, therefore, when each write operation is performed on the chain, a certain fee is paid, the fee is counted by using gas as a unit, and each command which can be performed on the chain sets a consumed gas value, for example: PUSH operations require 3 gas to be consumed, a transfer typically consumes 21000gas, and gas is paid using ETH. The fuel identifier of this patent corresponds to gas;
note that: regardless of whether the executed command is successful or failed, a calculation fee needs to be paid, and even if the command is failed, the node verifies and executes the transaction (calculation), so that the same fee as the successful execution of the payment is necessary
Each tile has a gas limit, which is the maximum total amount of gas allowed by a single tile, and this can be used to determine how many transactions can be packed in a single tile.
Each transaction or contract call sets a gas limit, if the number of gas used by the operation is less than or equal to the gas limit set by you, the operation is executed, but if the total consumption of gas exceeds the gas limit, all operations are reset, but the fee is still charged. The sum of the gas values actually consumed in the execution is called gas used, and gas which is not used up can be returned to the original account.
If you try to pack a transaction that will use more than the current block gas limit, it will be rejected by the network and "below gas limit" will be fed back;
the price of gas, i.e., gas price, can be set by itself, typically in units of GWei (1 ETH = 1000000000 GWei), when initiating a transaction or contract invocation. The cost of miners can be saved through the gas price, but the packaging speed of the miners can be reduced, the miners can package the gas price preferentially to set high transaction, and if you want to accelerate the transfer, you can set the gas price higher, so you can cut into a queue ahead.
When defining gas price, it is recommended to browse https:// ethgastation. info/here can see the consumption unit price, recording time, waiting time, commission charge average price, etc. corresponding to the transaction completed recently on the EtherFang blockchain. According to the transaction requirements, the gasSource corresponding to the three speeds of Safelow/Standard/Fast at the lower right can be referred;
regarding nonces in Etherns, which are generally interpreted as transaction counters, there are in fact two meanings for nonces in Etherns, one of proof of word nonces and one of account nonces.
Proof of word nonce: a meaningless value may attempt to satisfy the constraint of the proof of word by adjusting the value of the value. This is in essence the excavation. This value makes finding values that satisfy the proof of word condition a lucrative and computationally intensive task.
Account nonce: a transaction counter in each account to prevent replay attacks. For example, a transaction in which 20 coins are sent from A to B may be repeated by B to consume A's balance. This is to prevent double flower attacks. For example, such as
A transaction with normal GASPRICE is issued, just as it is being processed into blocks by miners;
another transaction with a high gasratio is issued to invalidate the first transaction by making a second transaction before the first transaction. With a nonce field in the EtherFang, double-sessions will not occur, and the transaction of nonce2 will not be added into blocks (i.e., be terminated) before the transaction of nonce1, noting also that nonces cannot be skipped, i.e., if you sent a nonce3 transaction but not nonce2, then the transaction is useless. nonces must be sequential, yes, and the nonces inside the contract are also almost a counter. In an intelligent contract, the value of the nonce represents the number of contracts created by the contract. The value of the nonce is increased only when one contract creates another contract. But the value of the nonce is unchanged when one contract invokes the method in another contract. The nonce field in the transaction of a smart contract in this patent refers to the number of contracts created by the smart contract.
The above description is only for the preferred embodiment of the present invention, and should not be used to limit the scope of the claims of the present invention. While the foregoing description will be understood and appreciated by those skilled in the relevant art, other equivalents may be made thereto without departing from the scope of the claims.

Claims (1)

1. A block chain-oriented nested transaction method is characterized by comprising the following steps:
the nested transaction method is applied to an online deployment system, the online deployment system is used for providing agent service for the transaction of a user, and comprises an agent organization, a deployment module, a packaging module, a multiple nested module and an examination and certification module; the agent organization comprises a plurality of agent cluster groups, each agent cluster group comprises agent nodes of the upper limit of the number of the fuel identifiers calculated according to the same operation rule, the agent nodes apply for agent services and calculate the upper limit of the number of the fuel identifiers provided by the agent nodes according to the operation rule of the agent cluster group, the agent nodes are added into the agent cluster group, the upper limit of the number of the fuel identifiers provided by the agent nodes is the maximum value of the number of the fuel identifiers used by the agent nodes for transaction of an intelligent contract which can be provided for a user, if the upper limit on the number of fuel identifiers provided by the broker node has been used by the user or has not been used by the user for more than a time period T, and the agent node no longer calculates the upper limit of the number of the fuel identifiers by using the operation rule in the agent cluster, and the agent node is removed from the agent cluster; the same agent node can join a plurality of agent cluster, but when the agent node starts to perform agent service for the user and the agent service is not finished, the copy of the meta-structure placed on the announcement position by the agent node is withdrawn; the fuel identifier is used for paying a cash roll of the transaction of the intelligent contract, the fuel identifier has unit price, the unit price of the fuel identifier is the price of each fuel identifier, and the unit price of the fuel identifier changes in real time along with time and is determined by a management user; the agent nodes perform agent service for the whole transaction process of the user, the upper limit of the quantity of fuel identifiers provided by the agent nodes in each agent aggregation group is changed according to the operation rule, the signature module is used for helping the agent nodes perform packaging and signature on the transaction of the intelligent contract, the packaging module helps perform packaging service on the transaction of the intelligent contract, the multiple nested modules are used for processing the transaction of the intelligent contract and processing the transaction into the transaction of the intelligent contract finally placed on a block chain, and the examination and certification module is used for confirming certification in the transaction agent process of the intelligent contract of the user; the agent service provides the agent node with a fuel identifier required for successful transaction for the transaction of the intelligent contract of the user; the time period T is a time period and is determined by a management user on the on-line deployment system; each agent cluster group is matched with a meta-actor, and the meta-actor is used for expressing the operation rule of each agent cluster group and is a unary operator or a binary operator which can operate on positive and real numbers; the online deployment agency system is used for each agent cluster, the meta-structure is a variable and is assigned with a value of an upper limit of the number of fuel identifiers used by the agent nodes of each agent cluster; each agent cluster is provided with an operation rule, the online deployment system sets an upper limit of the amount of the fuel identifier in real time along with the change of time, the product of the upper limit of the amount of the fuel identifier which can be provided by each agent node and the unit price of the fuel identifier cannot exceed the upper limit of the amount of the fuel identifier, and the transaction cost of the specific intelligent contract is consistent with the transaction cost of the intelligent contract on the ether house; when the agent node applies to provide agent service for the user, the agent node needs to calculate the upper limit of the fuel identifier amount provided by the agent node, the agent node is added into the agent cluster, and the agent node has the right of checking the meta-actor in the agent cluster and the meta-structure in the upper limit discrete area of the agent cluster; the operation rule of the agent cluster is that after the agent nodes finish checking, one agent cluster is selected, when the selected meta-actors of the agent cluster are unary operators, the unary operators on the on-line signature system are limited to copy operators, the replication operator represents an operator for replicating the value of an element in an upper discrete region by the agent node selecting only one element in the upper discrete region, the selected element acting on the unary operator, i.e., the value of the selected element is replicated, resulting in a replicated result, which acts as an upper limit on the number of fuel identifiers that the broker node can provide if the product of the replicated result multiplied by the unit price of the fuel identifier does not exceed the fuel identifier amount upper limit, and the agent node is verified, and the meta-structure copy with the same value as the copied result is extracted from the upper limit discrete area and placed in an advertisement bit in the advertisement area; when the element actor of the selected agent cluster is a binary operator, the agent node can select more than two elements from the upper discrete area, the elements are connected by using the element actor to obtain an operation formula, if the product of the operation result of the operation formula multiplied by the unit price of the fuel identifier does not exceed the upper limit of the amount of the fuel identifier, if the value of none of the elements in the upper discrete area of the agent cluster is the same as the operation result of the operation formula, a new element is created, the new element is represented by adding a numerical subscript to the variable name of the agent cluster, the numerical subscript is the sequence number of the element, the sequence number of the element is the number of the maximum value of the element in the upper discrete area of the agent cluster added with one, and the new element is assigned as the operation result of the operation formula, and the agent node is verified, and the new element is placed in the upper discrete area, providing a new element copy to be placed in an announcement bit of the announcement area, and if the operation result of the operation formula has the element with the same value in the upper discrete area, placing the element copy with the same value in the upper discrete area in the announcement bit of the announcement area; the announcement area comprises a plurality of announcement positions and is used for placing the meta-structure with the same value as the upper limit value of the fuel identifier number of the agent node providing the agent service, the announcement area is disclosed to all users, after the users look up the meta-structure, the copies of one meta-structure placed in the announcement area can be selected, the agent node placing the copies of the meta-structure provides the agent service for the users, and the selected agent node deletes the copies of all the meta-structures placed in the announcement area; the advertising bit is a storage space for storing an upper limit of the number of fuel identifiers provided by the agent node providing the agent service at the current time, and the upper limit of the number of fuel identifiers is replaced by an element which is the same as the upper limit of the number of fuel identifiers provided by the agent node;
the process of the agent node for checking the resources is that the agent node extracts the value of the copy of the element placed on the notice position to a management user, the management user locks the fuel identifiers with the same number as the value of the copy of the element placed on the notice position in the account of the agent node, the initial value of the locking time is set, the initial value of the locking time is defaulted to be a time period T, but the agent node can adjust the initial value of the locking time according to the grade of the agent node, the specific process is that the online deployment system establishes the management system of the agent node, all the agent nodes are graded, the grade of all the agent nodes is from 1 to M, M is a positive integer, the management user determines, the grade of the agent node is determined according to the number of times of agent service of the agent node, and the T is arranged from less to more according to the number of times of agent service of the agent node in each time period, the agent nodes are evenly distributed into the levels 1 to M, the more the times of agent service are, the higher the distributed level is, and all the agent nodes left in the average distribution are distributed into the level 1; determining an initial value of a locked time which can be set by the proxy node according to the level of the proxy node, assuming that the level of the proxy node is N, the initial value of the locked time can be set by the proxy node, if the initial value of the locked time is a time period T, if the initial value of the locked time is selected to be not set, the initial value of the locked time is a time period T, if the initial value of the locked time is selected to be set to be M times of the time period T, the initial value of the locked time is M times of the time period T, if the initial value of the locked time is selected by a user, directly dividing fuel identifiers with the same number of values of copies of the meta structure on a locked announcement bit into the users for use, returning the unused fuel identifiers to an account of the proxy node, if the locked time is not selected by the user, if the total length of the locked time is the time period T, directly unlocking, withdrawing the copies of the meta structure on the corresponding announcement bit, and if the total length of the locked time does not exceed the time period T, inquiring the user every M times of the time period T, withdrawing the corresponding copies of the meta-structures on the announcement positions if the user needs to withdraw, otherwise, continuing to lock the M times of the time period T, if the user inquires for M times, continuing to select locking, and finally dividing the locking time period T by the N times of the time period T; n is a natural number and represents the level of the proxy node, M is a natural number, and the value of M is equal to N;
in the online deployment system, each agent node is represented by using a dynamic connection point, the dynamic connection point is a storage space for storing data of the agent node, and the data of the agent node comprises the number of times of selecting an initial value of time for setting lock, the level of the agent node and the value of the amount of gas owned by an account of the agent node; the dynamic connection point is divided into three subspaces, the first subspace stores the times of the initial value of the time for selecting and setting the locking for the agent node, a counter is used for counting the times of the initial value of the time for selecting and setting the locking for the agent node, the counter is automatically cleared every time period T, the counter is associated with the level of the agent node, the maximum value of the times of the initial value of the time for selecting and setting the locking is set according to the level of each agent node, when the maximum value of the times of the initial value of the time for locking is reached, the counter stops counting, the agent node cannot set the initial value of the time for locking in the time period T after the counting is stopped, and only a default value can be used; the level of the agent node is stored in the second subspace, the level is automatically adjusted every time T, the value of the fuel identifier number owned in the account of the agent node is stored in the third subspace, the value of the fuel identifier number in the account is automatically mapped and is mapped with the account which is provided by the agent node and is used for providing agent service; and, when the agent node permits, a dynamic dependency line is established between a third subspace and a third subspace of other dynamic connection points, the dynamic dependency line is used for connecting a line of the third subspace of the two dynamic connection points, the dynamic dependency line indicates that a fuel identifier can be transferred between the two third subspaces, the dynamic dependency line is marked with a transfer time and a transfer number, the transfer time is a time for transferring the fuel identifier, the transfer number is a number of fuel identifiers for performing the transfer, and the process for transferring the fuel identifier is that a management user in the on-line processing system cuts down a value of the number of fuel identifiers stored in the third subspace, adds the cut value to a value stored in the third subspace of the dynamic connection point connected to the dynamic dependency line, and adds the number of fuel identifiers of the transfer number to the third subspace of the dynamic connection point connected by the dynamic dependency line by specifying the transfer time The value stored in the middle, and the number of fuel identifiers of the transfer number is transferred into the account of the corresponding proxy node of the dynamic connection points connected by the dynamic dependency line; and, it is specified that the fuel identifier that is not locked is not restricted, but that the locked fuel identifier can only be subtracted, if not selected by the user after a time period T from the start of the locking, to be accumulated into the values stored in the third subspace of other dynamic connection points;
when the product of the value of more than 50 percent of the components in the upper limit discrete area and the unit price of the fuel identifier exceeds 80 percent of the value of the upper limit of the amount of the fuel identifier, the management user can reduce the components in the upper limit discrete area in three modes, wherein the first mode is that the management user can select to reduce the value of the copy of the placed components in the notice area, the reduction is not more than 20 percent of the original value of the copy of the placed components in the notice area at most, the reduction times of the first mode in each time period T are not more than K times, K is a positive integer and is determined by the management user, and the second mode is that when the number of the components in the upper limit discrete area exceeds or is equal to the limit value of the number of the maximum components which can be placed in the upper limit discrete area, the value of the components in the upper limit discrete area is reduced, and each component is reduced by 30 percent at most, in a third mode, when the number of the element structures in the upper-limit discrete area does not exceed the number limit value of the maximum element structures that can be placed in the upper-limit discrete area, the management user selects to place dummy element structures into the upper-limit discrete area, the dummy element structures are variables with real numbers set by the management user and are consistent with the element structures, the variables are represented by variable names of discrete cluster groups and numerical subscripts, the numerical subscripts are sequentially numbered and are one of the numerical subscripts with the maximum value of the element structures in the upper-limit discrete area, the dummy element structures do not occupy the number limit value of the maximum element structures that can be placed in the upper-limit discrete area, the number of the dummy element structures placed in each upper-limit discrete area does not exceed 10% of the number limit value of the maximum element structures that can be placed in the upper-limit discrete area, and after the dummy element structures are placed into the upper-limit discrete area, the agent node can use the dummy element structures instead of the element structures; the dummy element can replace all functions of the element, is a type of element, but cannot represent the value of the upper limit of the number of used fuel identifiers, and when the element operator is a binary operator, the agent node selects the element and the dummy element from the upper limit discrete area to generate the upper limit of the number of the fuel identifiers, and the number of the selectable dummy elements is limited by the management user; every time the number of the elements in the upper limit discrete area exceeds the limit value of the number of the maximum elements which can be placed in the upper limit discrete area, selecting the element with the maximum value for deleting, and deleting 50% of the number of the elements with the values from large to small in the upper limit discrete area; configuring an upper limit discrete area in each agent cluster, wherein the upper limit discrete area is used for placing used elements of the agent cluster which are not on the bulletin position and storage space of released dummy elements; the upper limit of the number of fuel identifiers is the maximum number of fuel identifiers that the agent node can provide for the transaction of the intelligent contract of the user; the copy of the meta-structure on the announcement site is not selected by the user in the time period T, and the meta-structure on the announcement site is automatically cleared; the number limit value of the maximum elements which can be placed in the upper limit discrete area is the maximum number of the elements which can be placed in the upper limit discrete area and is a natural number;
when a user needs to send out the transaction of the intelligent contract, the signature module firstly checks the copy of the meta-structure on the notice position, as long as the quantity of the fuel identifiers required by the user for the transaction of the intelligent contract is less than or equal to the value of the copy of the meta-structure on the notice position, the user can select the copy of the meta-structure on the notice position, namely, an agent node for placing the copy of the meta-structure on the notice position is selected for carrying out agent service for the transaction of the intelligent contract, and the copy of the meta-structure on the notice position is removed after selection; the difference between the value of the copy specifying the eligible element and the number of fuel identifiers actually required by the user is controlled to
Figure 527705DEST_PATH_IMAGE001
In the above-mentioned manner,
Figure 726605DEST_PATH_IMAGE001
the management user determines that the number is positive and real, the copies of the meta-structure which does not meet the condition can be selected only if all the announcement positions do not have the copies of the meta-structure which meets the condition or the copies of the meta-structure which meets the condition are selected by the user, and the number of the fuel identifiers actually required by the user is the number of the fuel identifiers required by the transaction execution of the intelligent contract of the user; the copies of the meta-structure are copies of the meta-structure;
then, the packaging module packages and sends data related to the transaction of the intelligent contract of the user and the quantity of the fuel identifiers actually required by the user to the proxy node, wherein the data related to the transaction of the intelligent contract comprises data fields of the transaction of the intelligent contract, an account address of the user, an address of calling the intelligent contract by the user and nonce data of the transaction; nonce refers to an arbitrary or non-repeating random number that is used only once; the data field of the intelligent contract transaction is all data contained in the intelligent contract transaction, the account address of the user is the account address of the user who sends out the intelligent contract transaction, the address of the user calling the intelligent contract is the address of the intelligent contract transaction, the nonce data of the transaction is the nonce field in the Ethernet intelligent contract transaction, the proxy node which selects proxy service is used for signing the data related to the intelligent contract transaction, the packaging module adds the address of the account of the frozen fuel identifier of the proxy node on the data related to the intelligent contract transaction after the signature is successful and packages the data, the data is used as the data related to the intelligent contract transaction after the signature is packaged, and when the fuel identifier is frozen in the account of the proxy node, the fuel identifier is encrypted by using a private key, attaching the decrypted public key to the data related to the transaction of the intelligent contract after the signature is packaged, and finally using the public key as the signature packaged transaction;
the multiple nested modules are responsible for assembling the signature packaging transaction into a nested transaction, and the nested transaction is processed on the basis of the original signature packaging transaction and is used as a transaction of an intelligent contract deployed on a blockchain network; firstly, every time T, the multiple nested module applies a special public key address as a sending address of the nested transaction, the multiple nested module constructs a public key address library on the online processing system, the public key address library is used for placing a storage space of the special public key address, the special public key address is specially used as the sending address of the nested transaction and is not used by other users and agent nodes of the online processing system, only a counting identifier can be placed in each special public key address, the counting identifier is a special digital integral issued on the online processing system, and the number of the counting identifier transferred each time is only a positive integer; taking a special public key address from the public key address library in each time period T as a sending address of all nested transactions in the time period T; the multiple nested module updates a special public key address in each time period T and stores a counting identifier of a number specified by a management user in the multiple nested module; the nested transaction of the multiple nested module is divided into an external layer and an internal layer, the multiple nested module adds a signature of an agent node into a data field in the signature packed transaction and then encapsulates the signature into the data field of the nested transaction again to serve as a new signature packed transaction, the new signature packed transaction serves as the internal layer of the nested transaction after processing, the internal layer of the nested transaction is invisible except for a user with the nested transaction and other users managing the user, the multiple nested module is arranged outside the internal layer of the nested transaction, a sending address of the nested transaction is placed in the external layer of the nested transaction and is a special public key address distributed in the current time period T, and the nested transaction can be sent to a block chain network only after the user signs the whole nested transaction;
the examination module is provided with a plurality of examination nodes and a calculation address, the calculation address is a public key address and is used for calculating the times of successfully executing the nested transaction, only counting identifiers can be stored in the calculation address, the examination nodes are used for verifying the nested transaction when the nested transaction is executed, the examination nodes verify that whether the sending address of the nested transaction on the outer level of the nested transaction is the special public key address distributed in the current time period T or not is firstly identified by the examination nodes, whether the balance in the special public key address distributed in the current time period T exceeds one counting identifier or not is checked, one counting identifier in the special public key address distributed in the current time period T is locked, and the examination nodes unseal the inner level of the nested transaction, and the number of unsealing of the internal layer of the specified nested transaction is limited by the management user, the nested transaction is invalid when the number of unsealing exceeds the limited number of unsealing, and the nested transaction is automatically deleted from the online deployment system, the signature of the agent node and the data related to the transaction of the intelligent contract are verified after the internal layer of the nested transaction is unsealed, whether the public key stored in the internal layer of the unsealed nested transaction can unseal the frozen fuel identifier on the account of the agent node or not is verified, if the conditions are met, the nested transaction is started and packaged into a block chain, a counting identifier locked in a special public key address is sent to a calculating address, and the number of the unlocked fuel identifiers is deducted from the account of the agent node;
the management user is responsible for managing the agent cluster and appointing the element function sign of the agent cluster, a variable name is distributed to each agent cluster, the variable name is expressed by using lower case letters, the number of the variable name is stipulated to firstly use one lower case letter to express the variable name, after all the lower case letters are used to express the variable name, the online deployment system uses the combination of two lower case letters to express the variable name, after all the two lower case letters are used, the online deployment system uses the combination of three lower case letters to express the variable name, and the number of the lower case letters expressing the variable name is increased in sequence; the variable name plus the numerical subscript are used for representing the meta-structure, the numerical subscript is the sequential number of the meta-structure in the same agent cluster group, the numerical subscript is a positive integer, each agent cluster group generates the meta-structure each time, and the meta-structure is represented by the variable name plus the numerical subscript representing the sequential number of the agent cluster group.
CN202011573940.1A 2020-12-28 2020-12-28 Block chain-oriented nested transaction method Pending CN113269636A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011573940.1A CN113269636A (en) 2020-12-28 2020-12-28 Block chain-oriented nested transaction method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011573940.1A CN113269636A (en) 2020-12-28 2020-12-28 Block chain-oriented nested transaction method

Publications (1)

Publication Number Publication Date
CN113269636A true CN113269636A (en) 2021-08-17

Family

ID=77227863

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011573940.1A Pending CN113269636A (en) 2020-12-28 2020-12-28 Block chain-oriented nested transaction method

Country Status (1)

Country Link
CN (1) CN113269636A (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108876337A (en) * 2018-05-24 2018-11-23 深圳前海益链网络科技有限公司 A kind of block chain network method for supporting different Token exchange money transfer transactions verifyings
CN110245942A (en) * 2019-05-20 2019-09-17 阿里巴巴集团控股有限公司 In conjunction with the receipt storage method and node of user type and Rule of judgment
CN110245490A (en) * 2019-05-20 2019-09-17 阿里巴巴集团控股有限公司 The receipt storage method and node of conditional combination code mark and type dimension
CN110264195A (en) * 2019-05-20 2019-09-20 阿里巴巴集团控股有限公司 It is marked and transaction, the receipt storage method of user type and node in conjunction with code
CN110716980A (en) * 2018-06-27 2020-01-21 上海掌颐网络科技有限公司 Virtual coverage management consensus block chain operating system based on nested container
CN110932854A (en) * 2019-12-09 2020-03-27 华北电力大学 Block chain key distribution system and method for Internet of things
WO2020108138A1 (en) * 2018-11-30 2020-06-04 阿里巴巴集团控股有限公司 Method for implementing privacy protection in blockchain
CN112102033A (en) * 2020-09-03 2020-12-18 西安电子科技大学 Electric power distributed transaction nested consensus method, system and application based on block chain

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108876337A (en) * 2018-05-24 2018-11-23 深圳前海益链网络科技有限公司 A kind of block chain network method for supporting different Token exchange money transfer transactions verifyings
CN110716980A (en) * 2018-06-27 2020-01-21 上海掌颐网络科技有限公司 Virtual coverage management consensus block chain operating system based on nested container
WO2020108138A1 (en) * 2018-11-30 2020-06-04 阿里巴巴集团控股有限公司 Method for implementing privacy protection in blockchain
CN110245942A (en) * 2019-05-20 2019-09-17 阿里巴巴集团控股有限公司 In conjunction with the receipt storage method and node of user type and Rule of judgment
CN110245490A (en) * 2019-05-20 2019-09-17 阿里巴巴集团控股有限公司 The receipt storage method and node of conditional combination code mark and type dimension
CN110264195A (en) * 2019-05-20 2019-09-20 阿里巴巴集团控股有限公司 It is marked and transaction, the receipt storage method of user type and node in conjunction with code
WO2020233616A1 (en) * 2019-05-20 2020-11-26 创新先进技术有限公司 Receipt storage method and node employing code marking in combination with transaction type and user type
CN110932854A (en) * 2019-12-09 2020-03-27 华北电力大学 Block chain key distribution system and method for Internet of things
CN112102033A (en) * 2020-09-03 2020-12-18 西安电子科技大学 Electric power distributed transaction nested consensus method, system and application based on block chain

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
石润华;石泽;: "基于区块链技术的物联网密钥管理方案", 信息网络安全, no. 08 *

Similar Documents

Publication Publication Date Title
CN109598616B (en) Method for protecting privacy of blockchain data by introducing arbitration mechanism
CN109766722B (en) Method for constructing intelligent contract in block chain
CN111355592B (en) Ethernet intelligent contract electronic signature system and method based on block chain
EP2477165B1 (en) Multi-application smart card, and system and method for multi-application management of smart card
CN106506244A (en) A kind of unified supervision device of mixed cloud
CN110599177A (en) Transaction verification method and related equipment
JPH1139219A (en) Data-to-be-verified generating device, data verifying device, and medium recording verified data generating program
CN101320408A (en) Digital contents hardware binding and emigration method with both copyright sides controllable function
CN105976177A (en) NFC (near field communication)-oriented cloud payment method
EP4300398A1 (en) Smart contract-based data processing method and apparatus, electronic device, computer-readable storage medium, and computer program product
CN110706113A (en) Cross-block-chain data processing method, device, equipment and medium
CN104780048B (en) The image file encryption system and method for a kind of lightweight
CN112700240B (en) UTXO architecture-based transaction commission fee promotion method and system in block chain
CN106487505A (en) Key management, acquisition methods and relevant apparatus and system
EP3907644B1 (en) Blockchain
CN113269636A (en) Block chain-oriented nested transaction method
CN113676446B (en) Communication network safety error-proof control method, system, electronic equipment and medium
CN115250354A (en) Resource allocation method, device, equipment and storage medium based on block chain network
CN113064675A (en) Sustainable block chain lossless reconstruction method
CN102999570B (en) The Off-line control method of application program critical data and system in mobile equipment
CN113128988A (en) Self-adaptive and combinable on-chain privacy protection transaction system and method
CN101930552B (en) Method for identifying communication object of smart card
Deng et al. PSSC: Practical and Secure Sidechains Construction for Heterogeneous Blockchains Orienting IoT
CN109767222A (en) The dangerous method and system of insuring of flight delay based on block chain
CN112651055B (en) Data sharing method based on PoA improvement and intelligent contract technology

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information

Address after: 200120 building C3, No. 101 Eshan Road, China (Shanghai) pilot Free Trade Zone, Pudong New Area, Shanghai

Applicant after: Shanghai Lingshuzhonghe Information Technology Co.,Ltd.

Address before: C3, 101 Eshan Road, Pudong New Area, Shanghai, 200120

Applicant before: NENG LIAN TECH. LTD.

CB02 Change of applicant information