WO2020010490A1 - Method for arbitration-less resolution of accuracy and validity of transaction data recorded in blockchain - Google Patents

Abstract

A method for the arbitration-less resolution of the accuracy and validity of transaction data recorded in a blockchain, comprising the following steps: S1: a resource user A requests a resource R from a resource provider B; S2: B generates a unique identification TID (Transaction ID) of the current transaction with the addresses of A and B, the current timestamp ts, and a random salt, and sends the TID to A, TID=H (addrA, addrB, ts, salt); S3: B divides the resource R into several parts R= [R ₁,R ₂,...,R _N]； S4: B provides the resource R _X to A, and requests a commitment P_X from A: A acknowledges the receipt of a previous R _X and will pay V _X for same; S5: after A receives P_X, A verifies the content of P_X, signs Px with private key A to obtain PX', and sends PX' to B, PX' = Sign (P_X, KeyA); S6: B receives the signed commitment PX' of A, then continues to send the next resource R_X+1 (skip to step 4), or otherwise proceeds to the next step. The method solves the problem that, when obtaining off-chain data, the data provided by use of an oracle is not completely trusted, may require arbitration and involve time delays, and is high in cost.

Description

A real and effective method for solving transaction data entered into the blockchain without arbitration Technical field

The present invention relates to the field of Internet blockchains, and in particular, to a method for resolving real and effective transaction data entered into a blockchain without arbitration.

Background technique

In the general transaction process, the two parties to the transaction are likely to deny the transaction. For example, the buyer denies the receipt of the goods and refuses to pay. Generally, the dispute settlement method is arbitration. The arbitration requires the parties to provide verifiable proof. Then not all transactions can provide verifiable proof, and it may take a lot of resources to provide proof and verification.

The blockchain can ensure that transaction data is not tampered after entering the system, thereby achieving data security and credibility, but it cannot guarantee that the entered transaction data will be authentic and valid. The current approach is to use oracles to introduce external data. The user sends a contract request to the oracle to obtain data. The oracle is a centralized organization. Compared with the decentralized distributed network, the data is not completely tamperable, and the data is not completely trusted. When the data is wrong, it needs to be determined by a third-party arbitration agency, and the timeliness is delayed; , The use of the oracle needs to pay a certain cost of use. To this end, we propose a method for solving the real and effective transaction data entered into the blockchain without arbitration.

Summary of the invention

The main purpose of the present invention is to provide a method for solving the real and effective transaction data entered into the blockchain without arbitration. The present invention solves the real and effective transaction data entered into the blockchain; it is characterized by low overhead and undeniable transaction content; In the whole process, no third party arbitration is required, and real-time verification can be performed, which can effectively solve the problems in the background technology.

To achieve the above objective, the technical solution adopted by the present invention is: a method for solving the real and effective transaction data entered into the blockchain without arbitration, including the following steps

S1: Resource user A requests resource R from resource provider B;

S2: B uses the addresses of A and B, the current timestamp ts, and a random salt to generate the unique identifier TID (Transaction ID) of the current transaction, and sends the TID to ATID = H (addrA, addrB, ts, salt);

S3: B divides the resource R into several shares R = [R1, R2, ..., RN];

S4: B provides resource RX to A, and asks A for commitment PX: A acknowledges before receiving

And will pay V _{X for this}

S5: After A receives PX, verify the content of PX, sign Px with A private key to get PX ′, and send PX ′ to BPX ′ = Sign (PX, KeyA);

S6: B receives the signed commitment PX ′ from A, and then continues to send the next resource RX + 1 (skip to step 4), otherwise proceeds to the next step;

S7: B completes or interrupts the transaction, and puts the last received PX ′ on the blockchain for verification;

S8: The blockchain verifies the content of PX ′ and checks whether the TID is unique. After passing, the relevant contract is executed according to the content.

Further, in this transaction process, no matter how small the granularity of the transaction is, the transaction is actually executed only once, the overhead is very low, and the content of the transaction is undeniable. No third-party involvement is required throughout the process, and it can be verified in real time.

Compared with the prior art, this method that does not require arbitration to resolve the real and effective transaction data entered into the blockchain has the following beneficial effects:

1. Existing technologies use oracles to obtain data outside the blockchain; oracles are a centralized organization. Compared with decentralized distributed networks, they lack the data's tamper-proof attributes, and the data is not completely trusted. When it is wrong, it needs to be judged by a third-party arbitration agency, and the timeliness is lagging; in addition, the use of the oracle needs to pay a certain use fee.

2. The invention solves the problems that the data brought by using the oracle to obtain the data outside the chain is not completely credible, requires arbitration, lags in timeliness, and has a high cost.

3. The present invention provides a trading scheme. In the case of incomplete trust between the two parties to the transaction, the transaction is conducted with a small transaction granularity in order to reduce losses. Once a transaction fails, subsequent transactions are stopped, so that the two parties will only A transaction was disputed. When the transaction granularity is small enough, this loss will also become negligible. However, in the case of actual transaction overhead (such as fees), the granularity of the transaction will be limited, especially in the blockchain, the smaller granularity of the transaction overhead will become difficult to accept.

4. The present invention proposes an algorithm to solve the above problem. The core idea is an incremental commitment algorithm. Through the algorithm of the present invention, no matter how small the transaction granularity is, the transaction is actually executed only once, and the overhead is Very low, and the content of the transaction is undeniable. No third-party intervention is required during the entire process, and it can be verified in real time.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a software flowchart of a method for resolving the real and effective transaction data entered into the blockchain without arbitration according to the present invention.

detailed description

In order to make the objectives, technical solutions, and advantages of the present invention more clear, the present invention is further described in detail below with reference to specific embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention. Based on the embodiments of the present invention, all other embodiments obtained by a person of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

Example 1

S1: Resource user A requests resource R from resource provider B;

S2: B uses the addresses of A and B, the current timestamp ts, and a random salt to generate the unique identifier TID (Transaction ID) of the current transaction, and sends the TID to ATID = H (addrA, addrB, ts, salt);

S3: B divides the resource R into several shares R = [R1, R2, ..., RN];

S4: B provides resource RX to A, and asks A for commitment PX: A acknowledges before receiving

And will pay V _{X for this}

S5: After A receives PX, verify the content of PX, sign Px with A private key to get PX ′, and send PX ′ to BPX ′ = Sign (PX, KeyA);

S6: B receives the signed commitment PX ′ from A, and then continues to send the next resource RX + 1 (skip to step 4), otherwise proceeds to the next step;

S7: B completes or interrupts the transaction, and puts the last received PX ′ on the blockchain for verification;

S8: The blockchain verifies the content of PX ′ and checks whether the TID is unique. After passing, the relevant contract is executed according to the content.

Among them, in this transaction process, no matter how small the transaction granularity is, the transaction is actually executed only once, the overhead is very low, and the content of the transaction is undeniable. No third-party intervention is required during the entire process, and it can be verified in real time.

To sum up: The method provided by the present invention does not require arbitration to solve the real and effective method of entering transaction data entered into the blockchain, and has the following advantages compared with the prior art:

1. Existing technologies use oracles to obtain data outside the blockchain; oracles are a centralized organization. Compared with decentralized distributed networks, they lack the data's tamper-proof attributes, and the data is not completely trusted. When it is wrong, it needs to be judged by a third-party arbitration agency, and the timeliness is lagging; in addition, the use of the oracle needs to pay a certain use fee.

2. The invention solves the problems that the data brought by using the oracle to obtain the data outside the chain is not completely credible, requires arbitration, lags in timeliness, and has a high cost.

3. The present invention provides a trading scheme. In the case of incomplete trust between the two parties to the transaction, the transaction is conducted with a small transaction granularity in order to reduce losses. Once a transaction fails, subsequent transactions are stopped, so that the two parties will only A transaction was disputed. When the transaction granularity is small enough, this loss will also become negligible. However, in the case of actual transaction overhead (such as fees), the granularity of the transaction will be limited, especially in the blockchain, the smaller granularity of the transaction overhead will become difficult to accept.

4. The present invention proposes an algorithm for solving the above problem, and its core idea is an incremental commitment algorithm.

5. Through the algorithm of the present invention, during this transaction process, no matter how small the transaction granularity is, the transaction is actually executed only once, the overhead is very low, and the content of the transaction is undeniable. No third-party intervention is required during the entire process, and it can be verified in real time.

Finally, it should be noted that the above descriptions are merely preferred embodiments of the present invention and are not intended to limit the present invention. Although the present invention has been described in detail with reference to the foregoing embodiments, it will remain to those skilled in the art. Modifications to the technical solutions described in the foregoing embodiments, or equivalent replacement of some of the technical features may be made. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall be included in Within the scope of the present invention.

Claims (2)

1. A method for solving the real and effective transaction data entered into the blockchain without arbitration, which is characterized by the following steps:

   S1: Resource user A requests resource R from resource provider B;

   S2: B uses the addresses of A and B, the current timestamp ts, and a random salt to generate the unique identifier TID (Transaction ID) of the current transaction, and sends the TID to ATID = H (addrA, addrB, ts, salt);

   S3: B divides the resource R into several shares R = [R1, R2, ..., RN];

   S4: B provides resource RX to A, and asks A for commitment PX: A acknowledges before receiving

   

   And will pay V _{X for this}

   

   S5: After A receives PX, verify the content of PX, sign Px with A private key to get PX ′, and send PX ′ to BPX ′ = Sign (PX, KeyA);

   S6: B receives the signed commitment PX ′ from A, and then continues to send the next resource RX + 1 (skip to step 4), otherwise proceeds to the next step;

   S7: B completes or interrupts the transaction, and puts the last received PX ′ on the blockchain for verification;

   S8: The blockchain verifies the content of PX ′ and checks whether the TID is unique. After passing, the relevant contract is executed according to the content.
2. The method according to claim 1 for realizing the transaction data entered into the blockchain without arbitration, which is characterized in that: in this transaction process, no matter how small the transaction granularity is, only one transaction is actually executed, and the overhead is Very low, and the content of the transaction is undeniable. No third party involvement is required throughout the process, and it can be verified in real time.

Images