CN112712366A - Block execution method, computer device and storage medium - Google Patents
Block execution method, computer device and storage medium Download PDFInfo
- Publication number
- CN112712366A CN112712366A CN202110028679.5A CN202110028679A CN112712366A CN 112712366 A CN112712366 A CN 112712366A CN 202110028679 A CN202110028679 A CN 202110028679A CN 112712366 A CN112712366 A CN 112712366A
- Authority
- CN
- China
- Prior art keywords
- transaction
- hash
- verification
- block
- storing
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000012795 verification Methods 0.000 claims abstract description 39
- 238000013507 mapping Methods 0.000 claims description 38
- 238000004590 computer program Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000010200 validation analysis Methods 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3825—Use of electronic signatures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Abstract
The invention provides a block execution method, computer equipment and a storage medium, wherein the method comprises the following steps: receiving a first transaction, verifying first signature information of the first transaction, storing the first transaction into a memory pool when the verification is passed, and storing a first transaction hash of the first transaction; receiving a first block, and executing the following operations on each second transaction in the first block: determining whether a transaction hash identical to a second transaction hash of the second transaction is stored: if yes, ending; and if not, verifying the second signature information of the second transaction. The method and the device can effectively avoid repeated check verification and improve tps of the block link node.
Description
Technical Field
The present application relates to the field of block chaining technologies, and in particular, to a block execution method, a computer device, and a storage medium.
Background
tx1 when sent to the memory pool, tx1 requires basic checks including transaction signature verification. When the new block is executed, since the new block may come from other nodes in the network, the above basic check is required to verify the validity of the whole block for each transaction in the new block, and if tx1 is included in the new block, the signature verification of tx1 is performed twice. The above mechanism results in a reduction of tps for blockchain nodes.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies of the prior art, it is desirable to provide a block execution method, a computer device, and a storage medium that can effectively avoid duplicate checking verification and improve tps of a blockchain node.
In a first aspect, the present invention provides a method for performing a block in a blockchain node, where the method includes:
receiving a first transaction, verifying first signature information of the first transaction, storing the first transaction into a memory pool when the verification is passed, and storing a first transaction hash of the first transaction;
receiving a first block, and executing the following operations on each second transaction in the first block:
determining whether a transaction hash identical to a second transaction hash of the second transaction is stored:
if yes, ending;
and if not, verifying the second signature information of the second transaction.
In a second aspect, the present invention provides a method for performing a block at a blockchain node, where the method includes:
receiving a first transaction, verifying first signature information of the first transaction:
when the verification is passed, storing the first transaction in a memory pool, and storing a first data set of the first transaction; wherein the first data set comprises a first transaction hash and a verification passing identifier of the first transaction;
deleting the first transaction if the verification fails and storing a second set of data for the first transaction; wherein the second data set comprises a first transaction hash and a verification failure identification of the first transaction;
receiving a first block, and executing the following operations on each second transaction in the first block:
determining whether a third transaction hash included in a third data set is stored that is the same as the second transaction hash of the second transaction:
if yes, ending when the third data set comprises the verification passing identification;
when the third set of data includes the validation failed identification, not performing the second transaction;
and if not, verifying the second signature information of the second transaction.
In a third aspect, the present invention also provides a computer device comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform the block execution methods provided according to the embodiments of the present invention.
In a fourth aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the block execution method provided according to the embodiments of the present invention.
In the block execution method, the computer device, and the storage medium according to embodiments of the present invention, the first transaction is received, the first signature information of the first transaction is verified, and the first transaction is stored in the memory pool and the first transaction hash of the first transaction is stored when the verification is passed; receiving a first block, and executing the following operations on each second transaction in the first block: determining whether a transaction hash identical to a second transaction hash of the second transaction is stored: if yes, ending; and if not, the method for verifying the second signature information of the second transaction can effectively avoid repeated check verification and improve tps of the block link node.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a block execution method according to an embodiment of the present invention.
Fig. 2 is a flowchart of another block execution method according to an embodiment of the present invention.
Fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of a block execution method according to an embodiment of the present invention. As shown in fig. 1, in the present embodiment, the present invention provides a block execution method for a blockchain node, where the method includes:
s12: receiving a first transaction, verifying first signature information of the first transaction, storing the first transaction into a memory pool when the verification is passed, and storing a first transaction hash of the first transaction;
receiving a first block, and executing the following operations on each second transaction in the first block:
s141: determining whether a transaction hash identical to a second transaction hash of the second transaction is stored:
otherwise, step S142 is executed: second signature information for the second transaction is verified.
Specifically, the block link point performs step S12, receives tx1, verifies the signature information of tx1, stores tx1 in the memory pool when the verification is passed, and stores hash (tx 1);
suppose that the time zone blockchain node stores hash (tx10), hash (tx50) and hash (tx 1); the received block (100) comprises transactions tx 10-tx 20;
the block link point pairs tx10 tx20 perform the following operations, respectively:
for tx 10:
the block chain node executes step S141 to determine whether a hash is stored (tx 10):
since the hash (tx10) is stored, the blockchain node does not verify the signature information of tx 10;
for tx 11:
the block chain node executes step S141 to determine whether a hash is stored (tx 11):
since the hash is not stored (tx11), step S142 is performed to verify the signature information of tx 11;
tx 12-tx 20 are the same as tx11 and are not described in detail.
Those skilled in the art will understand that the tx1 can be configured according to actual requirements to verify the operation in failure, for example, configured to delete tx1, which is not limited in detail here.
The embodiment can effectively avoid repeated check verification and improve tps of the block link node.
Preferably, storing the first transaction in the memory pool upon verification, and storing the first transaction hash of the first transaction comprises:
when the verification is passed, storing the first transaction into a memory pool, and calculating a first transaction hash of the first transaction;
calculating a first number of first mapping positions of the first transaction hash, and setting each first mapping position of the bloom filter to be 1;
determining whether a transaction hash identical to a second transaction hash of the second transaction is stored comprises:
calculating a first number of second mapping bits of a second transaction hash;
and judging whether each second mapping bit is 1 or not.
It should be understood by those skilled in the art that, in the current embodiment, when each second mapping bit is 1, it cannot be determined whether a transaction hash identical to a second transaction hash of the second transaction is stored, and then the second transaction should be checked for duplicates by using the prior art scheme.
The embodiment reduces the memory overhead required by transaction duplication checking.
With the increase of the block height, more and more mapping bits of the transaction are stored in the bloom filter, and finally the bloom filter is full, so that a better query effect cannot be obtained. Mapping bits of part of the transactions stored longer in the bloom filter should be deleted, but the bit with the bloom filter set to 1 cannot be set to 0 because a transaction is deleted, and once a transaction needs to be deleted, the value of each mapping bit in the bloom filter needs to be fully recalculated.
The above problems can be solved by the following embodiments.
Further preferably, after setting each first mapping position of the bloom filter to 1, the method further includes:
adding one to the first counter of each first mapping bit to update the first counter;
the method further comprises the following steps:
when the storage duration of the first transaction hash reaches a first duration, performing the following operations on each first mapping bit:
judging whether a first counter of the first mapping bit is 1:
if yes, updating the first counter to be 0, and setting the first mapping position to be 0;
otherwise, the first counter is decreased by one to update the first counter.
Specifically, the first time period is taken as 2min as an example; assume that the mapping bits of hash (tx1) are 3, 8, 9; when tx1 is not received, the value of mapping bit 3 of the bloom filter is 0, the values of mapping bits 8 and 9 are 1, the counter of mapping bit 3 is 0, the counter of mapping bit 8 is 2, and the counter of mapping bit 9 is 3;
the block chain node receives tx1, verifies the signature information of tx1, stores tx1 into a memory pool when the signature passes, and calculates the mapping bit of hash (tx1), wherein the calculated mapping bits are 3, 8 and 9;
the block chain node sets all mapping positions 3, 8 and 9 as 1;
the block chain node updates the counter of the mapping position 3 to 1, the counter of the mapping position 8 to 3 and the counter of the mapping position 9 to 4;
assume that within 2min, the values of mapping bits 3, 8, 9 and the counter have not changed;
when the storage time of the hash (tx1) reaches 2min, setting the value of the mapping bit 3 to 0, and updating the counter to 0; the value of the mapping bit 8 is not changed, and the counter is updated to be 2; the value of the mapping bit 9 is unchanged and its counter is updated to 3.
The embodiment further reduces the memory overhead required by transaction duplication checking.
Fig. 2 is a flowchart of another block execution method according to an embodiment of the present invention. As shown in fig. 2, in the present embodiment, the present invention provides a block execution method for a blockchain node, where the method includes:
s22: receiving a first transaction, verifying first signature information of the first transaction:
when the verification is passed, storing the first transaction in a memory pool, and storing a first data set of the first transaction; wherein the first data set comprises a first transaction hash and a verification passing identifier of the first transaction;
deleting the first transaction if the verification fails and storing a second set of data for the first transaction; wherein the second data set comprises a first transaction hash and a verification failure identification of the first transaction;
receiving a first block, and executing the following operations on each second transaction in the first block:
s2411: determining whether a third transaction hash included in a third data set is stored that is the same as the second transaction hash of the second transaction:
if yes, go to step S2412: when the third data set comprises the verification passing identification, ending;
s2413: when the third set of data includes the validation failed identification, not performing the second transaction;
otherwise, step S242 is executed: second signature information for the second transaction is verified.
Specifically, assuming that the blockchain node receives tx2 and tx3 in sequence, the signature information of tx2 is verified to be passed, and the signature information of tx3 is not verified to be passed;
for tx 2:
the block chain node executes step S22, receives tx2, verifies the signature information of tx2, and stores tx2 in the memory pool and stores the data set { hash (tx2),0} because the signature information of tx2 passes the verification; wherein 0 represents that the verification passes, and 1 represents that the verification fails; in further embodiments, the verification-passing identifier and the verification-failing identifier may also be configured according to actual requirements, for example, the verification-passing identifier is configured as s, and the verification-failing identifier is configured as f, which may achieve the same technical effect.
For tx 3:
the blockchain node executes step S22, receives tx3, verifies the signature information of tx3, and stores the data set { hash (tx3),1} since the signature information of tx3 fails to verify;
suppose that the time zone blockchain node stores { hash (tx2),0}, { hash (tx3),1}, { hash (tx10),0}, { hash (tx11),1 }; the received block (100) comprises transactions tx 10-tx 20;
the block link point pairs tx10 tx20 perform the following operations, respectively:
for tx 10:
the blockchain node performs step S2411 to determine whether a data set including a hash (tx10) is stored:
since { hash (tx10),0} is stored and the identification thereof is that the verification is passed, the block link point executes step S2412, and ends;
for tx 11:
the blockchain node performs step S2411 to determine whether a data set including a hash (tx11) is stored:
since { hash (tx11),1} is stored and it is identified as verification failed, step S142 is performed without tx 11;
for tx 12:
the blockchain node performs step S2411 to determine whether a data set including a hash (tx12) is stored:
since the data set including the hash (tx12) is not stored, step S242 is performed to verify the signature data of tx 12.
tx 13-tx 20 are the same as tx12 and are not described in detail.
The difference between the above embodiment and the embodiment shown in fig. 1 is that the node may also obtain the transaction information that has been verified and failed to verify while performing the block, so as to avoid secondary verification.
The embodiment can effectively avoid repeated check verification and improve tps of the block link node.
Fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present invention. As shown in fig. 3, as another aspect, the present application also provides a computer apparatus including one or more Central Processing Units (CPUs) 301 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)302 or a program loaded from a storage section 308 into a Random Access Memory (RAM) 303. In the RAM303, various programs and data necessary for the operation of the computer apparatus are also stored. The CPU301, ROM302, and RAM303 are connected to each other via a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.
The following components are connected to the I/O interface 305: an input portion 306 including a keyboard, a mouse, and the like; an output section 307 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 308 including a hard disk and the like; and a communication section 309 including a network interface card such as a LAN card, a modem, or the like. The communication section 309 performs communication processing via a network such as the internet. A drive 310 is also connected to the I/O interface 305 as needed. A removable medium 311 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 310 as necessary, so that a computer program read out therefrom is mounted into the storage section 308 as necessary.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 309, and/or installed from the removable medium 311.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a computer-readable storage medium that exists separately and is not assembled into a computer device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (6)
1. A method for block execution, adapted for use in a blockchain node, the method comprising:
receiving a first transaction, verifying first signature information of the first transaction, storing the first transaction into a memory pool when the first transaction passes verification, and storing a first transaction hash of the first transaction;
receiving a first block, and executing the following operations on each second transaction in the first block:
determining whether a transaction hash identical to a second transaction hash of the second transaction is stored:
and if not, verifying the second signature information of the second transaction.
2. The method of claim 1, wherein storing the first transaction in a memory pool upon verification, and storing a first transaction hash of the first transaction comprises:
when the first transaction passes the verification, storing the first transaction into a memory pool, and calculating a first transaction hash of the first transaction;
calculating a first number of first mapping positions of the first transaction hash, and setting each first mapping position of a bloom filter to be 1;
the determining whether a transaction hash identical to a second transaction hash of the second transaction is stored comprises:
calculating a first number of second mapping bits of the second transaction hash;
and judging whether each second mapping bit is 1 or not.
3. The method of claim 2, wherein setting each of the first mapping locations of the bloom filter to 1 further comprises:
adding one to a first counter of each of the first mapping bits to update the first counter;
the method further comprises the following steps:
when the storage duration of the first transaction hash reaches a first duration, performing the following operations on each first mapping bit:
judging whether a first counter of the first mapping bit is 1:
if yes, updating the first counter to be 0, and setting the first mapping position to be 0;
and if not, subtracting one from the first counter to update the first counter.
4. A method for block execution, adapted for use in a blockchain node, the method comprising:
receiving a first transaction, verifying first signature information of the first transaction:
when the first transaction passes the verification, storing the first transaction into a memory pool, and storing a first data set of the first transaction; wherein the first data set comprises a first transaction hash and a verification pass identification of the first transaction;
deleting the first transaction when the verification fails and storing a second set of data for the first transaction; wherein the second set of data includes a first transaction hash and a verification failure identification for the first transaction;
receiving a first block, and executing the following operations on each second transaction in the first block:
determining whether a third transaction hash included in a third data set is stored that is the same as a second transaction hash of the second transaction:
if yes, ending when the third data set comprises a verification passing identifier;
when the third set of data includes a verification failed identification, not performing the second transaction;
and if not, verifying the second signature information of the second transaction.
5. A computer device, the device comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-4.
6. 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-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110028679.5A CN112712366A (en) | 2021-01-11 | 2021-01-11 | Block execution method, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110028679.5A CN112712366A (en) | 2021-01-11 | 2021-01-11 | Block execution method, computer device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112712366A true CN112712366A (en) | 2021-04-27 |
Family
ID=75548723
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110028679.5A Pending CN112712366A (en) | 2021-01-11 | 2021-01-11 | Block execution method, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112712366A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105719185A (en) * | 2016-01-22 | 2016-06-29 | 杭州复杂美科技有限公司 | Block chain data comparison and consensus method |
| CN106548349A (en) * | 2016-11-02 | 2017-03-29 | 江苏通付盾科技有限公司 | Transaction Information verification method and system |
| CN106682907A (en) * | 2016-12-10 | 2017-05-17 | 江苏恒为信息科技有限公司 | Comparison and consensus method for block chain data |
| CN110490734A (en) * | 2019-07-15 | 2019-11-22 | 杭州复杂美科技有限公司 | Trading group building, broadcasting method and system, equipment and storage medium |
| CN111078696A (en) * | 2019-12-04 | 2020-04-28 | 杭州复杂美科技有限公司 | Block generation method, device and storage medium |
| CN111523896A (en) * | 2020-05-06 | 2020-08-11 | 杭州复杂美科技有限公司 | Anti-attack method, device and storage medium |
| CN111723406A (en) * | 2020-06-08 | 2020-09-29 | 上海朝夕网络技术有限公司 | Consensus algorithm and system of block chain |
| CN111768202A (en) * | 2019-04-24 | 2020-10-13 | 北京京东尚科信息技术有限公司 | Payment verification method, payment verification node, full-amount node and storage medium |
| US20210004777A1 (en) * | 2018-03-23 | 2021-01-07 | Blockchain Labs Inc. | Blockchain system to which proof-of-transaction consensus algorithm is applied, and method therefor |
-
2021
- 2021-01-11 CN CN202110028679.5A patent/CN112712366A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105719185A (en) * | 2016-01-22 | 2016-06-29 | 杭州复杂美科技有限公司 | Block chain data comparison and consensus method |
| CN106548349A (en) * | 2016-11-02 | 2017-03-29 | 江苏通付盾科技有限公司 | Transaction Information verification method and system |
| CN106682907A (en) * | 2016-12-10 | 2017-05-17 | 江苏恒为信息科技有限公司 | Comparison and consensus method for block chain data |
| US20210004777A1 (en) * | 2018-03-23 | 2021-01-07 | Blockchain Labs Inc. | Blockchain system to which proof-of-transaction consensus algorithm is applied, and method therefor |
| CN111768202A (en) * | 2019-04-24 | 2020-10-13 | 北京京东尚科信息技术有限公司 | Payment verification method, payment verification node, full-amount node and storage medium |
| CN110490734A (en) * | 2019-07-15 | 2019-11-22 | 杭州复杂美科技有限公司 | Trading group building, broadcasting method and system, equipment and storage medium |
| CN111078696A (en) * | 2019-12-04 | 2020-04-28 | 杭州复杂美科技有限公司 | Block generation method, device and storage medium |
| CN111523896A (en) * | 2020-05-06 | 2020-08-11 | 杭州复杂美科技有限公司 | Anti-attack method, device and storage medium |
| CN111723406A (en) * | 2020-06-08 | 2020-09-29 | 上海朝夕网络技术有限公司 | Consensus algorithm and system of block chain |
Non-Patent Citations (1)
| Title |
|---|
| 潘吉飞;黄德才;: "基于跳跃Hash和异步共识组的区块链动态分片模型", 计算机科学, no. 03 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11914712B1 (en) | Blockchain based secure naming and update verification | |
| CN110690974B (en) | Block chain based data verification method, device, equipment and readable storage medium | |
| CN110837505B (en) | State data storage method, state data synchronization device and storage medium | |
| CN111275438B (en) | Consensus method, device, equipment and storage medium of block chain network | |
| CN107423163B (en) | Error surveying method and system for block chain of overall serial added blocks | |
| WO2022148320A1 (en) | Transaction execution method, computer device, and storage medium | |
| CN113626416A (en) | Data verification method and device, computing equipment and storage medium | |
| US20220092224A1 (en) | Data management system with tamper-evidence | |
| CN112445841B (en) | Account query method, device, system, server and medium | |
| CN111523896B (en) | Attack prevention method, apparatus and storage medium | |
| CN107451011B (en) | Error correction method and system for block chain of parallel added blocks | |
| CN112712366A (en) | Block execution method, computer device and storage medium | |
| CN105630625A (en) | Method and device for detecting consistency between data copies | |
| CN110049049B (en) | DNS zone data checking method and device | |
| CN109743133B (en) | Data reconciliation method and device | |
| CN107426293B (en) | Error correction method and system for block chain of single serial added block | |
| US20220083656A1 (en) | Apparatus and method for tolerating byzantine faults in blockchain platforms | |
| US20220131704A1 (en) | Blockchain machine compute acceleration engine | |
| CN108965257B (en) | Error correction method for block chain system and block chain link points | |
| AU2019222794A1 (en) | Method and system for testing and validation of cryptographic algorithms | |
| CN115550378A (en) | Block broadcasting and execution method, computer device and storage medium | |
| CN110347691B (en) | Certificate type verification method, certificate type verification device, computer equipment and storage medium | |
| CN115314382B (en) | Configuration information processing method | |
| CN111260476B (en) | Parallel chain segment self-consensus method, device and storage medium | |
| CN114268624B (en) | Version file transmission method and device and server |
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 |