CN111290733A - Settlement method, apparatus and storage medium - Google Patents
Settlement method, apparatus and storage medium Download PDFInfo
- Publication number
- CN111290733A CN111290733A CN202010099032.7A CN202010099032A CN111290733A CN 111290733 A CN111290733 A CN 111290733A CN 202010099032 A CN202010099032 A CN 202010099032A CN 111290733 A CN111290733 A CN 111290733A
- Authority
- CN
- China
- Prior art keywords
- settlement
- block
- transaction
- hash
- random numbers
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/588—Random number generators, i.e. based on natural stochastic processes
-
- 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 settlement method, a device and a storage medium, wherein the method comprises the following steps: while performing the first settlement transaction in the first block, crediting a settlement request for the first settlement transaction over the block chain; after generating the first block hash of the first block, finding whether a second settlement transaction exists in a previous block of the first block: if yes, generating a plurality of random numbers according to the first block hash; and, settling the settlement request for the second settlement transaction based on the plurality of random numbers. According to the method and the system, the delayed settlement mechanism that only evidence is stored in the current block and settlement is carried out in the next block is configured in the intelligent contract, so that even if the transaction related to the benefits of the transaction is packed into the current block by the successful mine digging accounting node, the random number depended by the settlement of the transaction needs to be generated according to the block hash of the next block and cannot be manipulated by the cheating accounting node of the current block, and cheating by manipulating the random number by the successful mine digging accounting node is avoided.
Description
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a settlement method, a settlement device, and a storage medium.
Background
In many application scenarios of blockchains, such as game settlement, guess settlement, etc., settlement is usually performed based on random numbers. However, since the data on the blockchain needs to be identified, the random numbers can only be generated based on the data that can be identified, so that there is a security risk that the random numbers that can be generated by the blockchain are manipulated.
For example, in the mechanism for generating the random number according to the block hash of the latest block, when the user a succeeds in mining and obtains the packing right of the block with the block height H, the user a can pack the transaction participating in the guess into the block, and change the block hash by adjusting the sequence of the transaction in the block and the like to adjust the generated random number, thereby realizing the cheating of winning the prize.
In view of the above security problem that random numbers may be manipulated, the applicant has previously proposed a random number generation scheme in the application No. CN201811351787.0, however, the principle of generating random numbers in this scheme is deeply coupled with the consensus mechanism of chain33, and cannot be applied to more consensus mechanisms.
Disclosure of Invention
In view of the above-mentioned deficiencies or inadequacies in the prior art, it would be desirable to provide a settlement method, apparatus, and storage medium that avoids cheating by manipulating random numbers by a billing node that is successful in mining.
In a first aspect, the present invention provides a settlement method comprising:
while performing the first settlement transaction in the first block, crediting a settlement request for the first settlement transaction over the block chain;
after generating the first block hash of the first block, finding whether a second settlement transaction exists in a previous block of the first block:
if yes, generating a plurality of random numbers according to the first block hash; and the number of the first and second groups,
the settlement request for the second settlement transaction is settled based on the plurality of random numbers.
In a second aspect, the present invention also provides an apparatus 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 a settlement method provided according to embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute a settlement method provided according to embodiments of the present invention.
According to the settlement method, the settlement equipment and the settlement medium provided by the embodiments of the invention, the delayed settlement mechanism that the current block only stores the certificate and the next block performs settlement is configured in the intelligent contract, so that even if the successful mine digging accounting node packs the transaction related to the own interests into the current block, the random number depended by the settlement of the transaction needs to be generated according to the block hash of the next block and cannot be manipulated by the accounting node of the current block trying to cheat, and therefore the cheating of the successful mine digging accounting node by manipulating the random number is avoided;
the settlement method, the settlement equipment and the storage medium provided by some embodiments of the invention further delay settlement of the settlement transaction when the accounting node happens to be a relevant party of the settlement transaction stored in the previous block, thereby ensuring that the accounting node which succeeds in mining still cannot cheat by operating the random number under a coincidence scene with extremely low probability.
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 settlement method according to an embodiment of the present invention.
FIG. 2 is a flow diagram of a preferred embodiment of the method shown in FIG. 1.
Fig. 3 is a schematic structural diagram of an apparatus 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 settlement method according to an embodiment of the present invention.
As shown in fig. 1, in the present embodiment, the present invention provides a settlement method, including:
s12: while performing the first settlement transaction in the first block, crediting a settlement request for the first settlement transaction over the block chain;
s14: after generating the first block hash of the first block, finding whether a second settlement transaction exists in a previous block of the first block:
if yes, go to step S16: generating a plurality of random numbers according to the first block hash; and the number of the first and second groups,
s18: the settlement request for the second settlement transaction is settled based on the plurality of random numbers.
The users A and B are respectively at the block height H1、H1The foregoing method is illustratively described for the case where +1 mining was successful in obtaining accounting qualifications.
When the user A obtains the block height H1After accounting qualification, user A's node A is taken as the block height H1Accounting node packing Block Block1，Block1The settlement transaction tx1 generated by the user side including user c and the settlement transaction tx2 generated by node a.
In step S12, the node a is executing Block1When the settlement transactions tx1 and tx2 are in the above-mentioned state, only the settlement request of each settlement transaction is stored, and the settlement is not carried out;
in step S14, the node a generates Block1Block hash of (Block)1) Then, find Block1Last block (block height H)1-1)Block0Whether there is a settlement transaction: and if not, ending the process.
When Block1Successful consensus, user B obtains the block height H1+1 billing qualification, user B's node B as the block height H1+1 accounting node packing Block Block2，Block2Including the settlement transaction tx3 generated at the user end of the customer.
In step S12, the node B is performing Block2When the transaction tx3 is settled, only the settlement request of tx3 is stored, and settlement is not performed;
in step S14, the node B generates Block2Block hash of (Block)2) Then, find Block2Last Block of1Whether there is a settlement transaction:
if yes, go to step S16, node B sends a hash (Block)2) Generating random numbers r1, r 2; and the number of the first and second groups,
in step S18, the node B settles the settlement requests for tx1 and tx2 according to the random numbers r1 and r2 generated in step S16, respectively.
In this embodiment, step S16 specifically includes:
determining the number of random numbers required for settlement according to a settlement request of the second settlement transaction;
a random number is generated according to the first block hash and a number of pre-configured algorithms.
For example, if it is determined that 1 random number is required according to the settlement request of tx1, and 2 random numbers are required according to the settlement request of tx2, Block is determined1The settlement of each settlement transaction requires 2 random numbers according to the hash (Block)2) And a preconfigured algorithm generates 2 random numbers r1 and r 2. Those skilled in the art will appreciate that, in step S16, any random number generation algorithm or encryption algorithm commonly used in the art may be used to generate the random number, the random number may be generated only from the first tile hash, or the random number may be generated from the first tile hash and the tile hashes of any number of previous tiles, which may achieve the same technical effect.
For another example, if it is determined that 1 random number is required according to the settlement request of tx1, it is determined according to hash (Block)2) And a preconfigured algorithm generating random number r 1; determining that 2 random numbers are needed according to the settlement request of tx2, and then according to hash (Block)2) And a preconfigured algorithm generates random numbers r2 and r3 (also r1 and r 2).
In another embodiment, step S16 may also be configured to generate a fixed number of random numbers, e.g., 2 random numbers r1 and r 2. If 3 random numbers need to be used in step S18, r3 is generated from r1 and r 2.
In the above embodiment, although user A may package his own interest-related settled transaction tx2 into Block when mining succeeds1In, but user A cannot manipulate hash (Block)2) Therefore, user a cannot do cheating.
In the embodiment, the delayed settlement mechanism that the current block only performs evidence storage and the next block performs settlement is configured in the intelligent contract, so that even if the transaction related to the benefits of the transaction is packed into the current block by the successful mine digging accounting node, the random number depended by the settlement of the transaction needs to be generated according to the block hash of the next block and cannot be manipulated by the cheating attempting accounting node of the current block, thereby preventing the cheating by the cheating accounting node of the successful mine digging through manipulating the random number.
FIG. 2 is a flow diagram of a preferred embodiment of the method shown in FIG. 1. As shown in fig. 2, in a preferred embodiment, step S18 includes:
s181: verifying whether the first user corresponding to the accounting node of the first block is a interested party of the settlement request of the second settlement transaction:
otherwise, step S183 is executed: settling the settlement request for the second settlement transaction based on the plurality of random numbers;
if yes, go to step S185: the first transaction hash of the second settlement transaction is stored in a delayed settlement list.
The method further comprises the following steps:
s131: judging whether a second transaction hash of a third settlement transaction exists in the delayed settlement list:
if yes, go to step S133: verifying whether the first user is a stakeholder to a settlement request for the third settlement transaction:
otherwise, step S135 is executed: the settlement request for the third settlement transaction is settled according to the plurality of random numbers and the second transaction hash is deleted from the delayed settlement list.
Specifically, forIn the scenario shown in FIG. 1, the users A and B are at the block height H1、H1In the +1 example of successful mining to obtain billing qualifications, assuming user B sent a settled transaction tx4 with very coincidence (very low probability), tx4 is packed at block height H1Block of (2)1While user B obtains the block height H1+1 Block accounting qualification, user B can manipulate hash (Block)2) To cheat the settlement of tx 4.
For the above security risk, the present embodiment further perfects the delayed settlement mechanism.
The block heights H of A, B and C are respectively1、H1+1、H1+2 successful mine mining accounting qualifications, user B sent settled transaction tx4, packed at block height H1Block of (2)1The scheme shown in fig. 2 is exemplarily illustrated by way of example.
In step S131, the node B determines whether a transaction hash exists in the deferred settlement list: otherwise, it indicates that the settlement transaction is not currently being further delayed.
In step S181, the node B verifies whether the user B is a stakeholder of tx1, tx2, tx4 (by comparing public keys, addresses, check signatures, etc.):
the user B is not a stakeholder of tx1 and tx2, and settles the settlement request of tx1 and the settlement request of tx2 according to the random numbers generated in the step S16;
user B, who is the stakeholder of tx4, stores the transaction hash of tx4 (tx4) into the deferred settlement list.
When Block2Successful consensus, user C obtains the block height H1+2 billing qualification, user C's node C as the block height H1+2 accounting node packing Block Block3。
In step S131, the node C determines whether the transaction hash exists in the delayed settlement list:
hash (tx4) exists, node C verifies that user C is a stakeholder of tx 4:
otherwise, the node C sends the hash (Block) to the node C3) Several random numbers are generated (the generation principle is the same as that of step S16) to settle tx4, and the hash is deleted from the delayed settlement list (tx 4).
Wherein if user C is also a stakeholder of tx4 (in some business logics, there may be multiple stakeholders for a transaction), node C does not settle tx4 as well, leaving hash (tx4) in the delayed settlement list, defined by block height H1The accounting node of the block of +3 verifies whether to settle.
The steps S12, S14, S16 and S18 performed by the node C are not described in detail.
The embodiment further delays the settlement of the settlement transaction when the accounting node happens to be the interested party of the settlement transaction stored in the previous block, thereby ensuring that the accounting node which succeeds in mining still cannot cheat by operating the random number under the coincidence scene with extremely low probability.
Fig. 3 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 3, as another aspect, the present application also provides an apparatus 300 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 apparatus 300 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 separate computer readable storage medium not incorporated into the 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 unit 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 (5)
1. A settlement method, comprising:
while performing a first settlement transaction in a first block, crediting a settlement request for the first settlement transaction over a block chain;
after generating a first block hash of the first block, searching whether a second settlement transaction exists in a last block of the first block:
if yes, generating a plurality of random numbers according to the first block hash; and the number of the first and second groups,
the settlement request for the second settlement transaction is settled according to the plurality of random numbers.
2. The method of claim 1, wherein said settling the request for settlement of the second settlement transaction based on the number of random numbers comprises:
verifying whether the first user corresponding to the accounting node of the first block is a interested party of the settlement request of the second settlement transaction:
if not, the settlement request of the second settlement transaction is settled according to the plurality of random numbers;
if yes, storing the first transaction hash of the second settlement transaction into a delayed settlement list;
the method further comprises the following steps:
judging whether a second transaction hash of a third settlement transaction exists in the delayed settlement list:
if so, verifying that the first user is a stakeholder of a settlement request for the third settlement transaction:
and if not, settling the settlement request of the third settlement transaction according to the plurality of random numbers, and deleting the second transaction hash from the delayed settlement list.
3. The method of claim 1 or 2, wherein the generating a number of random numbers from the first chunk hash comprises:
determining the number of random numbers required for settlement according to the settlement request of the second settlement transaction;
generating the random number according to the first block hash and a number of pre-configured algorithms.
4. An apparatus, characterized in that the apparatus comprises:
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-3.
5. 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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010099032.7A CN111290733B (en) | 2020-02-18 | 2020-02-18 | Settlement method, apparatus and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010099032.7A CN111290733B (en) | 2020-02-18 | 2020-02-18 | Settlement method, apparatus and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111290733A true CN111290733A (en) | 2020-06-16 |
| CN111290733B CN111290733B (en) | 2022-07-19 |
Family
ID=71021405
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010099032.7A Active CN111290733B (en) | 2020-02-18 | 2020-02-18 | Settlement method, apparatus and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111290733B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112600664A (en) * | 2020-12-09 | 2021-04-02 | 杭州复杂美科技有限公司 | Delayed transaction generation method, delayed transaction execution device and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106682907A (en) * | 2016-12-10 | 2017-05-17 | 江苏恒为信息科技有限公司 | Comparison and consensus method for block chain data |
| US20170149819A1 (en) * | 2015-11-25 | 2017-05-25 | International Business Machines Corporation | Resisting replay attacks efficiently in a permissioned and privacy- preserving blockchain network |
| CN107169764A (en) * | 2017-05-10 | 2017-09-15 | 山东大学 | Fair data trade method based on block chain |
| CN107807984A (en) * | 2017-10-31 | 2018-03-16 | 上海分布信息科技有限公司 | A kind of block chain network of subregion and its method for realizing subregion common recognition |
| US20180232261A1 (en) * | 2015-10-28 | 2018-08-16 | Fractal Industries, Inc. | System and method for optimization and load balancing of computer clusters |
| CN108415686A (en) * | 2017-12-29 | 2018-08-17 | 北京欧链科技有限公司 | Divide account computational methods and device during random number offer |
| CN110226177A (en) * | 2017-01-11 | 2019-09-10 | 科因普拉格株式会社 | The method of payment gateway service is provided using the agreement based on UTXO and utilizes its server |
| CN110599164A (en) * | 2019-09-02 | 2019-12-20 | 北京航空航天大学 | Method for rapidly paying by any payee under supervision chain |
-
2020
- 2020-02-18 CN CN202010099032.7A patent/CN111290733B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180232261A1 (en) * | 2015-10-28 | 2018-08-16 | Fractal Industries, Inc. | System and method for optimization and load balancing of computer clusters |
| US20170149819A1 (en) * | 2015-11-25 | 2017-05-25 | International Business Machines Corporation | Resisting replay attacks efficiently in a permissioned and privacy- preserving blockchain network |
| CN106682907A (en) * | 2016-12-10 | 2017-05-17 | 江苏恒为信息科技有限公司 | Comparison and consensus method for block chain data |
| CN110226177A (en) * | 2017-01-11 | 2019-09-10 | 科因普拉格株式会社 | The method of payment gateway service is provided using the agreement based on UTXO and utilizes its server |
| CN107169764A (en) * | 2017-05-10 | 2017-09-15 | 山东大学 | Fair data trade method based on block chain |
| CN107807984A (en) * | 2017-10-31 | 2018-03-16 | 上海分布信息科技有限公司 | A kind of block chain network of subregion and its method for realizing subregion common recognition |
| CN108415686A (en) * | 2017-12-29 | 2018-08-17 | 北京欧链科技有限公司 | Divide account computational methods and device during random number offer |
| CN110599164A (en) * | 2019-09-02 | 2019-12-20 | 北京航空航天大学 | Method for rapidly paying by any payee under supervision chain |
Non-Patent Citations (3)
| Title |
|---|
| THANH NGUYEN-VAN等: ""Scalable Distributed Random Number Generation Based on Homomorphic Encryption"", 《2019 IEEE INTERNATIONAL CONFERENCE ON BLOCKCHAIN (BLOCKCHAIN)》 * |
| 王海龙等: "基于区块链的大数据确权方案", 《计算机科学》 * |
| 陈爱林等: ""跨国电力交易的区块链存证技术"", 《全球能源互联网》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112600664A (en) * | 2020-12-09 | 2021-04-02 | 杭州复杂美科技有限公司 | Delayed transaction generation method, delayed transaction execution device and storage medium |
| CN112600664B (en) * | 2020-12-09 | 2022-06-24 | 杭州复杂美科技有限公司 | Delayed transaction generation method, delayed transaction execution device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111290733B (en) | 2022-07-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11461777B2 (en) | Cross-ledger transfers between distributed ledgers | |
| US10678597B2 (en) | Event-driven blockchain workflow processing | |
| RU2709673C2 (en) | Methods and apparatus for distributing distributed database on network | |
| US20210232558A1 (en) | Data isolation in a blockchain network | |
| TWI828857B (en) | Computer-implemented systems and methods for implementing transfers over a blockchain network | |
| CN111869159B (en) | Tamper detection system and tamper detection method | |
| US20190251557A1 (en) | Executing multi-party transactions using smart contracts | |
| KR102354776B1 (en) | Method and device for providing transaction data to a blockchain system for processing | |
| US20180159682A1 (en) | Distributed ledger | |
| CN112600664B (en) | Delayed transaction generation method, delayed transaction execution device and storage medium | |
| WO2020258858A1 (en) | Authorization method, system, apparatus and device in blockchain-type account book | |
| US10936734B2 (en) | Blockchain authorization | |
| CN113783935A (en) | Byzantine fault-tolerant method and device | |
| KR20180005542A (en) | Apparatus and method for verifing data integrity | |
| CN111476670B (en) | Block chain rollback insurance method, apparatus and storage medium | |
| KR20210102470A (en) | A method and system for verifying blockchain data stored in a storage format different from that of the blockchain. | |
| CN110766410B (en) | Trusted cross-chain event construction and verification method and device based on Merker tree | |
| CN111290733B (en) | Settlement method, apparatus and storage medium | |
| CN113132459B (en) | Distributed storage method, system, storage medium, information data processing terminal | |
| CN111523896A (en) | Anti-attack method, device and storage medium | |
| CN111524011B (en) | Parallel link consensus validation method, apparatus, and storage medium | |
| WO2021093590A1 (en) | Random number generation method, game method, apparatus, and storage medium | |
| US20210141780A1 (en) | Data structure storage optimisation | |
| CN111523897B (en) | Anti-attack method, device and storage medium | |
| CN111476671A (en) | Block chain rollback insurance method, equipment and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |