CN111884809B

CN111884809B - Method and device for preventing branch chain transaction replay and electronic equipment

Info

Publication number: CN111884809B
Application number: CN202010697655.4A
Authority: CN
Inventors: 王晓亮; 张亚宁
Original assignee: Hangzhou Rivtower Technology Co Ltd
Current assignee: Hangzhou Rivtower Technology Co Ltd
Priority date: 2020-07-20
Filing date: 2020-07-20
Publication date: 2023-05-05
Anticipated expiration: 2040-07-20
Also published as: CN111884809A

Abstract

The embodiment of the specification relates to a method and a device for preventing replay of a bifurcation chain transaction and an electronic device, and mainly comprises the following steps: before sending the transaction, determining whether a corresponding prior associated transaction exists; when the transaction to be sent has the prior correlation transaction, inquiring the block height and the block hash prefix of the prior correlation transaction; writing the queried block height and block hash prefix of the prior associated transaction into the transaction to be sent; and sending the transaction to a transaction pool, judging the validity of the transaction according to the block height and the block hash prefix, and packaging the legal transaction into a block. By locking the height of the block where the transaction is related and the hash prefix of the block, the state where the transaction is executed correctly and the global state of the block chain of the block where the transaction is located are locked, the certainty of the environment before the transaction is executed is ensured, and the safety problem caused by the fact that the transaction is packaged by mistake when the chain is forked is prevented.

Description

Method and device for preventing branch chain transaction replay and electronic equipment

Technical Field

The embodiment of the specification relates to the technical field of networks, in particular to a method and a device for preventing replay of a bifurcation chain transaction and electronic equipment.

Background

Currently, there are two main types of consensus algorithms in the blockchain technology, one is a BFT type consensus algorithm with final certainty, and the other is a probability deterministic consensus algorithm, such as a PoW type consensus algorithm. In probabilistic deterministic consensus algorithms, transactions need to wait a period of time after being uplinked due to the possibility of bifurcation, resulting in higher certainty of the transaction.

However, due to the existence of chain forking, common traders are very vulnerable to various types of attacks. For example, a contract between users A and B, B first makes a transaction, then A sends the transaction to B for a fee after a period of time confirms that the transaction was successful. Thus, the correct execution of a transaction depends on a certain order and dependency between two transactions. However, there is a risk that a sends transaction tx2 after a observes that transaction tx1 of B is uplink, but that the blockchain is chain-recombined so that the current chain becomes a bifurcation chain, and the main chain contains only tx2 and not tx1, thus causing a certain loss to a.

Disclosure of Invention

The embodiment of the specification provides a method, a device and electronic equipment for preventing transaction replay of a bifurcation chain, which are used for solving the problem that the transaction replay in the bifurcation chain in the prior art causes loss of users.

In order to solve the above technical problems, the embodiment of the present specification adopts the following technical solutions:

in a first aspect, a method for preventing replay of a bifurcated chain transaction is provided, for use in a blockchain system, the method comprising:

before sending the transaction, determining whether a corresponding prior associated transaction exists;

when the transaction to be sent has the prior correlation transaction, inquiring the block height and the block hash prefix of the prior correlation transaction;

writing the queried block height and block hash prefix of the prior associated transaction into the transaction to be sent;

and sending the transaction to a transaction pool, judging the validity of the transaction according to the block height and the block hash prefix, and packaging the legal transaction into a block.

In a second aspect, there is provided an apparatus for preventing replay of a bifurcated chain transaction, for use in a blockchain system, the apparatus comprising:

a prior-association transaction confirmation unit: before being used for sending the transaction, determining whether a corresponding prior association transaction exists;

query unit: the method comprises the steps of inquiring the block height and the block hash prefix of a prior associated transaction when the prior associated transaction exists in the transaction to be sent;

an information writing unit: the block hash prefix used for writing the queried block height of the prior related transaction into the transaction to be sent;

transaction transmitting and packaging unit: and the method is used for sending the transaction to the transaction pool, judging the validity of the transaction according to the block height and the block hash prefix, and packaging the legal transaction into blocks.

In a third aspect, an electronic device is provided, comprising: one or more processors and memory, wherein the memory contains one or more computer programs executable by the one or more processors to cause the one or more processors to perform a method of preventing replay of a bifurcated chain transaction provided in accordance with embodiments of the invention.

In a fourth aspect, the present invention also provides a storage medium storing a computer program for causing a computer to execute the method for preventing replay of a bifurcation chain transaction provided according to embodiments of the present invention.

The above-mentioned at least one technical scheme that this description embodiment adopted can reach following beneficial effect: by locking the height of the block where the transaction is related and the hash prefix of the block, the state where the transaction is executed correctly and the global state of the block chain of the block where the transaction is located are locked, the certainty of the environment before the transaction is executed is ensured, and the safety problem caused by the fact that the transaction is packaged by mistake when the chain is forked is prevented. Once the block where the prior transaction is located is recombined, the post transaction is certainly invalid, so that the safety of the subsequent transaction is fully ensured.

Drawings

In order to more clearly illustrate the embodiments of the present description or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some of the embodiments described in the embodiments of the present description, and that other drawings may be obtained according to these drawings without inventive effort to a person skilled in the art.

FIG. 1 is a schematic diagram of steps in a method for preventing replay of a bifurcation chain transaction according to an embodiment of the present disclosure;

FIG. 2 is a schematic diagram of a device for preventing replay of a bifurcated chain transaction according to an embodiment of the present disclosure;

fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the embodiments of the present specification more apparent, the technical solutions of the embodiments of the present specification will be clearly and completely described below in connection with the specific embodiments of the present specification and the corresponding drawings. It will be apparent that the described embodiments are only some, but not all, of the embodiments of the present specification. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the embodiments herein, are intended to be within the scope of the embodiments herein.

The following describes in detail the technical solutions provided by the embodiments of the present specification with reference to the accompanying drawings.

Example 1

Referring to fig. 1, a schematic diagram of steps of a method for preventing replay of a bifurcation chain transaction according to an embodiment of the present disclosure is provided, and the method is applied to a blockchain system, and includes:

step 101: before sending the transaction, determining whether a corresponding prior associated transaction exists;

step 102: when the transaction to be sent has the prior correlation transaction, inquiring the block height and the block hash prefix of the prior correlation transaction;

step 103: writing the queried block height and block hash prefix of the prior associated transaction into the transaction to be sent;

step 104: and sending the transaction to a transaction pool, judging the validity of the transaction according to the block height and the block hash prefix, and packaging the legal transaction into a block.

Optionally, in step 104, determining the validity of the transaction according to the block height and the block hash prefix may further include:

if the block height and the block hash prefix are found from the main chain history block, judging that the transaction is legal; otherwise, judging the transaction illegal, and ending the transaction.

Optionally, querying the block height and the block hash prefix of the prior association transaction in step 102 further includes: and setting an RPC interface for the block chain system, and calling the RPC interface to acquire the block height and the block hash prefix.

It should be noted that: the associated prior transaction includes a prior transaction of a business logic association.

For example, user A first sends a prior association transaction tx1, transaction tx1 being packaged in block-A at height 100. B observes that the prior association transaction tx1 is packed into blocks of height 100 and executed correctly, and begins sending transaction tx2. At this time, when the transaction tx2 is sent, the RPC interface is called to query the block height and the block hash prefix where the transaction tx1 is located, and two fields ref_block_number and ref_block_prefix are added to the transaction tx2 to respectively characterize the block height and the block hash prefix where the transaction tx1 is located. Where transaction tx2 is ultimately packed into a block of height 103.

According to the consensus rule, transaction tx2 is considered legal only if ref_block_number, ref_block_prefix in tx2 can be found from the backbone history block. Thus, once the subsequent transaction fills in ref_block_number and ref_block_prefix of the previous transaction, it can be ensured that transaction tx1 does not appear on the bifurcation chain preceding this block, which is equivalent to not being bifurcated from a certain height, nor would the transaction succeed in being uplinked once bifurcated.

If a blockchain diverges, blocks are reorganized, the bifurcation height starts at 101, at which time the 100-height block where tx1 is located does not change, and tx2 is packed to the 104-height of another bifurcation chain, and this bifurcation chain becomes the main chain, and tx2 can be packed normally at this time.

If at this point the blockchain diverges from height 100, then the new bifurcated block of height 100 is reorganized, regardless of whether tx1 is contained in the height 100 block and the subsequent blocks, tx2 must not be repackaged into the block because the block height and prefix referenced by tx2 at this point are already different from the current chain. Once the height 100 has been reorganized as a block, tx1 may be culled or the result of its execution may be different from before even if it is successfully packed.

According to the technical scheme of the specification, the block height and the block hash prefix of the prior associated transaction are locked, so that the state that the prior transaction is correctly executed and the global state of the block chain of the block are locked, the certainty of the environment before the transaction is executed is ensured, and the safety problem caused by the fact that the transaction is packaged by mistake when the chain is forked is prevented. Once the block where the prior transaction is located is recombined, the post transaction is certainly invalid, so that the safety of the subsequent transaction is fully ensured.

Example two

Referring to fig. 2, a schematic structural diagram of an apparatus for preventing replay of a bifurcation chain transaction according to an embodiment of the present disclosure is shown, and the apparatus is applied to a blockchain system, and mainly includes:

the prior-association transaction confirmation unit 201: before being used for sending the transaction, determining whether a corresponding prior association transaction exists;

query unit 202: the method comprises the steps of inquiring the block height and the block hash prefix of a prior associated transaction when the prior associated transaction exists in the transaction to be sent;

an information writing unit 203: the block hash prefix used for writing the queried block height of the prior related transaction into the transaction to be sent;

transaction transmitting and packaging unit 204: and the method is used for sending the transaction to the transaction pool, judging the validity of the transaction according to the block height and the block hash prefix, and packaging the legal transaction into blocks.

Optionally, determining the validity of the transaction according to the block height and the block hash prefix may further include:

Optionally, the apparatus further includes an RPC interface, and the block height and the block hash prefix are obtained by calling the RPC interface.

It should be understood that the apparatus for preventing replay of a bifurcation chain transaction described in the second embodiment may perform all technical solutions related to the method for preventing replay of a bifurcation chain transaction in the form of a functional module, and achieve corresponding technical effects, which are not described herein.

Example III

The electronic device of the embodiment of the present specification is described in detail below with reference to fig. 3. Referring to fig. 3, at a hardware level, the electronic device includes one or more processors and a memory. Optionally also including an internal bus, a network interface. The Memory may include a Memory, such as a Random-Access Memory (RAM), and may further include a Non-Volatile Memory (Non-Volatile Memory), such as at least 1 disk Memory. Of course, the electronic device may also include hardware required for other services.

The processor, network interface, and memory may be interconnected by an internal bus, which may be an industry standard architecture (Industry Standard Architecture, ISA) bus, a peripheral component interconnect standard (Peripheral Component Interconnect, PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, among others. The buses may be classified as address buses, data buses, control buses, etc. For ease of illustration, only one bi-directional arrow is shown in FIG. 3, but not only one bus or type of bus.

And a memory for storing a computer program. In particular, the computer program may comprise program code comprising computer operating instructions. The memory may include memory and non-volatile storage and provide instructions and data to the processor.

The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs, forming means for preventing replay of the bifurcation chain transaction at the logic level. A processor executing the program stored in the memory and specifically for executing the method operations performed when the apparatus for preventing replay of a bifurcated chain transaction as described above is used as an execution subject.

The method performed by the apparatus disclosed in the embodiment shown in fig. 1 of the present specification may be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or by instructions in the form of software. The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), etc.; but also digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The methods, steps, and logic blocks disclosed in one or more embodiments of the present description may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with one or more embodiments of the present disclosure may be embodied directly in a hardware decoding processor or in a combination of hardware and software modules in a decoding processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method.

Of course, in addition to the software implementation, the electronic device of the embodiments of the present disclosure does not exclude other implementations, such as a logic device or a combination of software and hardware, that is, the execution subject of the following processing flow is not limited to each logic unit, but may also be hardware or a logic device.

Example IV

The present description embodiments also provide a storage medium storing a computer program that stores one or more programs for use by a processor in performing the method of preventing replay of a bifurcation chain transaction described herein.

In summary, the foregoing description is only a preferred embodiment of the present invention and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present specification should be included in the protection scope of the present specification.

The systems, devices, modules, or units illustrated in one or more of the embodiments described above may be implemented in particular by a computer chip or entity, or by a product having some function. One typical implementation is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.

In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, as relevant to see a section of the description of method embodiments.

The foregoing describes specific embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

Claims

1. A method of preventing replay of a bifurcated chain transaction for use in a blockchain system, the method comprising:

transmitting a transaction to a transaction pool, judging the validity of the transaction according to the block height and the block hash prefix, and packaging the legal transaction into a block;

wherein determining the validity of the transaction according to the block height and the block hash prefix further comprises:

if the block height and the block hash prefix are found from the main chain history block, judging that the transaction is legal; otherwise, judging the transaction illegal, and ending the transaction;

wherein the main chain is the chain where the traffic to be sent is located.

2. The method of claim 1, wherein querying the prior associated transaction for the present chunk height and chunk hash prefix further comprises: and setting an RPC interface for the block chain system, and calling the RPC interface to acquire the block height and the block hash prefix.

3. The method of claim 1 or 2, the associated prior transaction comprising a prior transaction of business logic association.

4. An apparatus for preventing replay of bifurcated chain transactions for use in a blockchain system, the apparatus comprising:

transaction transmitting and packaging unit: the method comprises the steps of sending a transaction to a transaction pool, judging the validity of the transaction according to the block height and the block hash prefix, and packaging the legal transaction into a block;

wherein the main chain is the chain where the traffic to be sent is located.

5. The apparatus of claim 4, further comprising an RPC interface, the block height and block hash prefix being obtained by invoking the RPC interface.

6. The apparatus of any of claims 4-5, the associated prior transaction comprising a prior transaction of a business logic association.

7. An electronic device, comprising:

one or more processors;

a memory for storing one or more computer programs;

the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-3.

8. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-3.