CN114140102A - Transaction sending method, computer device and storage medium - Google Patents
Transaction sending method, computer device and storage medium Download PDFInfo
- Publication number
- CN114140102A CN114140102A CN202111457984.2A CN202111457984A CN114140102A CN 114140102 A CN114140102 A CN 114140102A CN 202111457984 A CN202111457984 A CN 202111457984A CN 114140102 A CN114140102 A CN 114140102A
- Authority
- CN
- China
- Prior art keywords
- transaction
- block height
- block
- node
- parallel
- 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 49
- 230000002776 aggregation Effects 0.000 claims abstract description 9
- 238000004220 aggregation Methods 0.000 claims abstract description 9
- 238000004590 computer program Methods 0.000 claims description 8
- 230000004931 aggregating effect Effects 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process 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/04—Payment circuits
- G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
- G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2365—Ensuring data consistency and integrity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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/3827—Use of message hashing
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Accounting & Taxation (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Finance (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Computer Security & Cryptography (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Technology Law (AREA)
- Software Systems (AREA)
- Computing Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a transaction sending method, computer equipment and a storage medium, wherein the method comprises the following steps: when the current node is a leader node with a first block height, acquiring first consensus contents with the first block height respectively generated by other parallel chain link points of the current parallel chain; generating a first block height first aggregation consensus transaction according to the second consensus content of the first block height generated by the current node and each first consensus content; the first aggregated consensus transaction is sent to the backbone. The method and the device enable the payment of the commission fee to be fair and keep the parallel chain consensus concise and stable.
Description
Technical Field
The present application relates to the field of parallel chain technology, and in particular, to a transaction sending method, a computer device, and a storage medium.
Background
In the existing main chain-parallel chain mechanism, if only one parallel chain link point is allowed to send the aggregation consensus transaction, only the commission charge of the node is consumed, and the mechanism is not fair.
Disclosure of Invention
In view of the above-mentioned deficiencies or inadequacies in the prior art, it would be desirable to provide a transaction sending method, computer device, and storage medium that are fair and maintain conciseness of parallel chain consensus.
In a first aspect, the present invention provides a transaction sending method, a computer device, and a storage medium suitable for parallel chain nodes, where the parallel chain nodes on the same parallel chain can communicate with each other, and each parallel chain node is sequentially fixed and sequentially used as a leader node, where the method includes:
when the current node is a leader node with a first block height, acquiring first consensus contents with the first block height respectively generated by other parallel chain link points of the current parallel chain;
generating a first block height first aggregation consensus transaction according to the second consensus content of the first block height generated by the current node and each first consensus content;
the first aggregated consensus transaction is sent to the backbone.
In a second aspect, the present invention also provides an apparatus comprising one or more processors and memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a method of transaction transmission 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 transaction transmission method provided according to embodiments of the present invention.
According to the transaction sending method, the computer device and the storage medium provided by the embodiments of the invention, when the current node is the leader node with the first block height, the first consensus content with the first block height respectively generated by other parallel chain link points of the current parallel chain is obtained; generating a first block height first aggregation consensus transaction according to the second consensus content of the first block height generated by the current node and each first consensus content; the method for sending the first aggregation consensus transaction to the main chain ensures that the payment of the commission fee is fair and the parallel chain consensus is kept concise and stable.
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 transaction sending method according to an embodiment of the present invention.
Fig. 2 is a flowchart of step S12 in a preferred embodiment of the method shown in fig. 1.
FIG. 3 is a flow chart of a preferred embodiment of the method shown in FIG. 2.
FIG. 4 is a flow chart of a preferred embodiment of the method shown in FIG. 3.
Fig. 5 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 transaction sending method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, the present invention provides a transaction sending method, a computer device, and a storage medium suitable for parallel chain nodes, where the parallel chain nodes on the same parallel chain can communicate with each other, and each parallel chain node is sequentially fixed and sequentially serves as a leader node, where the method includes:
s12: when the current node is a leader node with a first block height, acquiring first consensus contents with the first block height respectively generated by other parallel chain link points of the current parallel chain;
s13: generating a first block height first aggregation consensus transaction according to the second consensus content of the first block height generated by the current node and each first consensus content;
s14: the first aggregated consensus transaction is sent to the backbone.
Specifically, node indexes are sequentially configured for each parallel chain link point of the current parallel chain, and a base index with an initial value of 0 is configured; s12 includes "calculate base ═ (height/M)% nodes; wherein height is a first block height, M is a pre-configured first numerical value, and nodes is the number of parallel chain nodes of the current parallel chain; when the calculated base value is consistent with the node index of the current node, acquiring a first consensus content of a first block height respectively generated by other parallel chain link points of the current parallel chain as an example;
suppose that the current block chain is parachain1 (hereinafter referred to as pc1), and the pc1 is provided with parallel chain nodes N1-N4; the node indexes of N1-N4 are 0-3 respectively; m is 100; the first block height is 10; the current node is N1;
assume that there is a parallel chain transaction tx1 for pc1 in the main chain block (100_ master); N1-N4 respectively generate parallel chain blocks and consensus content according to tx 1; parallel chain blocks generated by N1-N4 are block (10_ pc1) _ N1-block (10_ pc1) _ N4, and consensus contents generated by N1-N4 are msg (10) _ N1-msg (10) _ N4;
n1 executes step S12, and calculates base ═ weight/M% > (10/100)% nodes ═ 0; since 0 is consistent with the node index of N1, determining N1 as a leader node of 10; n1 acquires the consensus content msg (10) _ N2-msg (10) _ N4 with the block height of 10 from N2-N4;
n1 executes the step S13, and generates an aggregation consensus transaction tx2 of the block height 10 according to msg (10) _ N1, msg (10) _ N2-msg (10) _ N4 in an aggregation mode;
n1 executes step S14, sending tx2 to the main chain.
It can be seen that N1-N4 rotate uniformly every 100 block heights;
in further embodiments, the above method may be performed by only the common node, assuming that the parallel chain is configured with common nodes and non-common nodes.
In further embodiments, step S12 may be configured according to actual requirements, for example, configured as: calculating base ═ height% nodes; when the calculated base value is consistent with the node index of the current node, acquiring first consensus content of a first block height respectively generated by other parallel chain link points of the current parallel chain; the same technical effect can be achieved.
How N1 generates tx2 according to msg (10) _ N1, msg (10) _ N2-msg (10) _ N4, and how tx2 is executed by a main chain node after tx2 is sent to the main chain can refer to the prior art, such as the patent application (application No.: 202010631494.9) previously proposed by the applicant, and is not specifically limited herein.
The embodiment makes the fee expenditure of the commission fee fair and keeps the consensus of the parallel chains simple and stable.
Fig. 2 is a flowchart of step S12 in a preferred embodiment of the method shown in fig. 1. As shown in fig. 2, in a preferred embodiment, each parallel chain link point of the current parallel chain is sequentially configured with a node index and a base index with an initial value of 0; step S12 includes:
s121: calculating base ═ (height/M)% nodes; wherein height is a first block height, M is a pre-configured first numerical value, and nodes is the number of parallel chain nodes of the current parallel chain;
s122: and when the calculated base value is consistent with the node index of the current node, acquiring first consensus contents of the first block height respectively generated by other parallel chain link points of the current parallel chain.
The transaction transmission principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
FIG. 3 is a flow chart of a preferred embodiment of the method shown in FIG. 2. In a preferred embodiment, as shown in fig. 3, each parallel link point of the current parallel chain is configured with an offset parameter, and the method further comprises:
s15: broadcasting a first heartbeat to other parallel chain link points of the current parallel chain every a first time length so as to enable the other parallel chain nodes to:
when the first heartbeat is not received in the second time length, calculating the offset which is (offset + 1)% nodes; wherein the second time period is longer than the first time period;
calculating base ═ (base + offset)% nodes;
and determining the parallel chain link point of the node index which is the same as the calculated base value as a new leader node.
Specifically, the first time duration is 2s, and the second time duration is 10 s;
n1 executing step S15, broadcasting heartbeats to N2-N4 every 2S;
for N2-N4: if the heartbeat broadcast by the N1 is not received within 10s, calculating the offset as (offset + 1)% nodes; and uniquely determining a parallel chain node with the same node index as the calculated base value as a new leader node according to the base + offset% nodes.
Specifically, N2 to N4 can be divided into two cases:
a) if N1 does not broadcast a heartbeat, N2-N4 reselect a new leader node; taking N2 as an example, if the selected new leader node is found to be itself, a heartbeat is broadcast by N2;
b) taking N2 as an example, if N2 simply loses contact with a heartbeat that was not broadcast by N1, then N2 itself shifts the leader node and N2 broadcasts the heartbeat until it is the leader node (for the embodiment shown in fig. 1, N2 waits until block height 100).
The embodiment ensures that the leader node is switched in time, and further keeps the consensus of the parallel chains stable.
FIG. 4 is a flow chart of a preferred embodiment of the method shown in FIG. 3. In a preferred embodiment, the first heartbeat includes a calculated base value and a calculated offset value, as shown in fig. 4; the method further comprises the following steps:
s16: receiving a second heartbeat;
s171: judging whether the base value in the second heartbeat is the same as the base value in the first heartbeat:
if not, executing step S172: finishing;
when the same, step S1731 is performed: determining whether the offset value in the second heartbeat is greater than the offset value in the first heartbeat:
if so, step S1732 is executed: determining the parallel chain link point which sends the second heartbeat as a leader node of the first block height, and updating the offset value of the current node to the offset value in the second heartbeat;
if not, step S1733 is executed: and (6) ending.
It can be seen that if the bases of the two heartbeats are different, the end is reached, which indicates that the two heartbeats are not from the same block height; and if the base is the same and the offsets are different, taking the node with a heartbeat with a large offset as a leader node, and updating the offset of the current node.
The embodiment further ensures that the leader node is switched in time, and further keeps the consensus of the parallel chains stable.
Preferably, before step S12, the method further includes:
acquiring a first main chain block from a main chain, and generating a first parallel chain block with a first block height according to each parallel chain transaction of a current parallel chain in the first main chain block;
the first main chain block is generated by each first transaction in the first to-be-packaged queue of the main chain node according to the height of the first main chain block; when the first transaction is received by the main chain node, calculating that the first transaction should be stored to a first to-be-packaged queue when the first main chain block height is packaged according to a pre-configured transaction storage rule; the difference between the first backbone block height and a second backbone block height that most recently generated the second backbone block when the first transaction was received is greater than a second value; the first transaction comprises a main chain transaction and a parallel chain transaction; generating the second backbone block is performed in parallel with storing the first transaction.
Specifically, the step of calculating, according to a preconfigured transaction storage rule, that the first transaction should be stored to the first queue to be packaged when the first main chain block height is packaged includes "obtaining a first fully hashed first M-bit first N-ary number of the first transaction; calculating a third backbone block height; the method for calculating the height of the third main chain block comprises the following steps: min (h1) mod N ^ M ═ > > (x1)2, min (h1) > current main chain block height + second value +1, min (h1) is third main chain block height, and (x1)2 is first N-ary number; and determining the third backbone block height as the first backbone block height; store the first transaction in the first queue to be packaged "as an example;
assume that the backbone node receives tx1 when the backbone block height is 93; the fully hashed, first 3 bits of the binary number of tx1 is 100 and the second value is 5;
the main chain node obtains the binary number of the first 3 bits of the full hash of tx1, and the binary number is 100;
calculating the height of a main chain block by using the main chain node, wherein the calculated height of the main chain block is 100;
determining 100 as the main chain block height of packed tx1 by the main chain node, and storing tx1 into a to-be-packed queue with the main chain block height of 100 by the main chain node;
the main chain node generates a block (93_ main) according to each transaction in the to-be-packaged queue with the main chain block height 93;
generating the block (93_ main) is performed in parallel with storing tx1 into the to-be-packed queue at main block height 100.
In further embodiments, the transaction storage rule may be configured according to actual requirements to configure the determination method of the height of the first main-chain block, so that the same technical effect can be achieved.
The above embodiments improve the throughput of the backbone.
Fig. 5 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 5, as another aspect, the present application also provides an apparatus 500 including one or more Central Processing Units (CPUs) 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the apparatus 500 are also stored. The CPU501, ROM502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 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 509, and/or installed from the removable medium 511.
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 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 (8)
1. A transaction sending method, wherein parallel-link nodes on the same parallel link can communicate with each other, and each of the parallel-link nodes is fixed in sequence and sequentially serves as a leader node, the method being applied to the parallel-link nodes, and the method comprising:
when the current node is a leader node with a first block height, acquiring first consensus contents of the first block height respectively generated by other parallel chain link points of the current parallel chain;
generating a first block height first aggregation consensus transaction by aggregating the second consensus content and each first consensus content of the first block height generated by the current node;
sending the first aggregated consensus transaction to a backbone.
2. The method according to claim 1, wherein each parallel chain link point of the current parallel chain is sequentially configured with a node index and configured with a base index with an initial value of 0;
when the current node is a leader node of the first block height, the obtaining of the first consensus content of the first block height respectively generated by other first parallel chain nodes of the current parallel chain includes:
calculating base ═ (height/M)% nodes; wherein height is the height of the first block, M is a pre-configured first numerical value, and nodes is the number of parallel chain nodes of the current parallel chain;
and when the calculated base value is consistent with the node index of the current node, acquiring first consensus contents of the first block height respectively generated by other parallel chain link points of the current parallel chain.
3. The method of claim 2, wherein each parallel link point of a current parallel chain is configured with an offset parameter, the method further comprising:
broadcasting a first heartbeat to other parallel chain link points of the current parallel chain every a first time length so as to enable the other parallel chain nodes to:
when the first heartbeat is not received in a second time length, calculating offset as (offset + 1)% nodes; wherein the second time period is longer than the first time period;
calculating base ═ (base + offset)% nodes;
and determining the parallel chain link point of the node index which is the same as the calculated base value as a new leader node.
4. The method of claim 3, wherein the first heartbeat includes a calculated base value and a calculated offset value; the method further comprises the following steps:
receiving a second heartbeat;
judging whether the base value in the second heartbeat is the same as the base value in the first heartbeat:
when the difference is not the same, ending;
if so, determining whether the offset value in the second heartbeat is greater than the offset value in the first heartbeat:
if so, determining the parallel chain link point which sends the second heartbeat as a leader node of the first block height, and updating the offset value of the current node to the offset value in the second heartbeat;
and when the value is not greater than the preset value, ending.
5. The method according to claim 1, wherein before obtaining the first common knowledge contents of the first block height respectively generated by other parallel chain nodes of the current parallel chain when the current node is the leader node of the first block height, the method further comprises:
acquiring a first main chain block from a main chain, and generating a first parallel chain block with the first block height according to each parallel chain transaction of a current parallel chain in the first main chain block;
the first main chain block is generated by each first transaction in a first to-be-packaged queue of a main chain node according to the height of the first main chain block; when the first transaction is received by the main chain node, calculating that the first transaction should be stored to the first to-be-packaged queue when the first main chain block height is packaged according to a pre-configured transaction storage rule; the difference between the first backbone block height and a second backbone block height that most recently generated a second backbone block when the first transaction was received is greater than a second value; the first transaction comprises a main chain transaction and a parallel chain transaction; generating the second backbone block is performed in parallel with storing the first transaction.
6. The method of claim 5, wherein the calculating according to the preconfigured transaction storage rule that the first transaction should be stored to the first to-be-packaged queue when the first master block height is packaged comprises:
acquiring a first N-system number of a first M bits of a first full hash of the first transaction;
calculating a third backbone block height; the method for calculating the height of the third main chain block comprises the following steps: min (h1) mod N ^ M ═ > > (x1)2, min (h1) > current main chain block height + second value +1, min (h1) is third main chain block height, and (x1)2 is first N-ary number; and the number of the first and second groups,
determining the third backbone block height as the first backbone block height;
and storing the first transaction into the first queue to be packaged.
7. 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-6.
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-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111457984.2A CN114140102A (en) | 2021-12-02 | 2021-12-02 | Transaction sending method, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111457984.2A CN114140102A (en) | 2021-12-02 | 2021-12-02 | Transaction sending method, computer device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114140102A true CN114140102A (en) | 2022-03-04 |
Family
ID=80386964
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111457984.2A Pending CN114140102A (en) | 2021-12-02 | 2021-12-02 | Transaction sending method, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114140102A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107909369A (en) * | 2017-10-13 | 2018-04-13 | 布比（北京）网络技术有限公司 | Based on the common recognition method, apparatus merchandised across chain and storage medium |
| CN109831425A (en) * | 2019-01-25 | 2019-05-31 | 中国联合网络通信集团有限公司 | Block chain common recognition method, apparatus, equipment and computer readable storage medium |
| CN110287196A (en) * | 2019-06-29 | 2019-09-27 | 杭州复杂美科技有限公司 | Block storage method, parallel chain transaction acquisition methods, equipment and storage medium |
| WO2020177537A1 (en) * | 2019-03-02 | 2020-09-10 | 杭州复杂美科技有限公司 | Parallel chain consensus method, data exception processing method, device and storage medium |
| CN111798238A (en) * | 2020-07-03 | 2020-10-20 | 杭州复杂美科技有限公司 | Parallel chain consensus method, device and storage medium |
| CN111798239A (en) * | 2020-07-03 | 2020-10-20 | 杭州复杂美科技有限公司 | Parallel chain consensus method, device and storage medium |
| CN111861471A (en) * | 2020-07-30 | 2020-10-30 | 杭州复杂美科技有限公司 | Parallel chain consensus method, parallel chain block rollback method, device and storage medium |
| KR102230471B1 (en) * | 2019-12-26 | 2021-03-23 | 주식회사 록스307 | Method of generating group proof for efficient transaction on blockchain network |
| US20210234703A1 (en) * | 2019-02-21 | 2021-07-29 | Tencent Technology (Shenzhen) Company Limited | Method for recording data block on blockchain, leader accounting node, and storage medium |
| CN113194146A (en) * | 2021-05-06 | 2021-07-30 | 杭州复杂美科技有限公司 | Leader node determination method, computer device, and storage medium |
-
2021
- 2021-12-02 CN CN202111457984.2A patent/CN114140102A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107909369A (en) * | 2017-10-13 | 2018-04-13 | 布比（北京）网络技术有限公司 | Based on the common recognition method, apparatus merchandised across chain and storage medium |
| CN109831425A (en) * | 2019-01-25 | 2019-05-31 | 中国联合网络通信集团有限公司 | Block chain common recognition method, apparatus, equipment and computer readable storage medium |
| US20210234703A1 (en) * | 2019-02-21 | 2021-07-29 | Tencent Technology (Shenzhen) Company Limited | Method for recording data block on blockchain, leader accounting node, and storage medium |
| WO2020177537A1 (en) * | 2019-03-02 | 2020-09-10 | 杭州复杂美科技有限公司 | Parallel chain consensus method, data exception processing method, device and storage medium |
| CN110287196A (en) * | 2019-06-29 | 2019-09-27 | 杭州复杂美科技有限公司 | Block storage method, parallel chain transaction acquisition methods, equipment and storage medium |
| KR102230471B1 (en) * | 2019-12-26 | 2021-03-23 | 주식회사 록스307 | Method of generating group proof for efficient transaction on blockchain network |
| CN111798238A (en) * | 2020-07-03 | 2020-10-20 | 杭州复杂美科技有限公司 | Parallel chain consensus method, device and storage medium |
| CN111798239A (en) * | 2020-07-03 | 2020-10-20 | 杭州复杂美科技有限公司 | Parallel chain consensus method, device and storage medium |
| CN111861471A (en) * | 2020-07-30 | 2020-10-30 | 杭州复杂美科技有限公司 | Parallel chain consensus method, parallel chain block rollback method, device and storage medium |
| CN113194146A (en) * | 2021-05-06 | 2021-07-30 | 杭州复杂美科技有限公司 | Leader node determination method, computer device, and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108984662B (en) | Block chain data synchronization method | |
| CN109271446B (en) | Parallel chain data synchronization method, equipment and storage medium | |
| CN110113408B (en) | Block synchronization method, equipment and storage medium | |
| CN110392121B (en) | Parallel chain block generation method, device and storage medium | |
| CN110287196B (en) | Block storage method, parallel chain transaction acquisition method, equipment and storage medium | |
| CN110083745B (en) | Data query method, device and storage medium | |
| CN109067516B (en) | Lottery drawing method, consensus method, device and storage medium | |
| CN111798316A (en) | Parallel chain consensus method, device and storage medium | |
| CN110852882A (en) | Packet consensus method, apparatus, device, and medium for blockchain networks | |
| CN111798238A (en) | Parallel chain consensus method, device and storage medium | |
| CN111858773A (en) | Transaction packaging method, device and storage medium | |
| CN111008249A (en) | Parallel chain block synchronization method, device and storage medium | |
| CN111611319A (en) | Distributed data storage method, device and storage medium | |
| CN109861922B (en) | Method and apparatus for controlling flow | |
| CN109213774B (en) | Data storage method and device, storage medium and terminal | |
| CN112055077B (en) | Block link access method, device and storage medium | |
| CN114140102A (en) | Transaction sending method, computer device and storage medium | |
| CN111988345B (en) | Information synchronization method and device | |
| CN112328693A (en) | Block synchronization method, device and storage medium | |
| CN110298756B (en) | Parallel chain self-consensus method, device and storage medium | |
| CN110516006B (en) | Parallel chain block generation method, device and storage medium | |
| CN111181803B (en) | Block chain performance measurement method, system, equipment and storage medium | |
| CN112929432B (en) | Broadcasting method, equipment and storage medium based on repeated broadcasting history | |
| CN112948388A (en) | Parallel chain arbitration consensus method, computer device and storage medium | |
| CN111432027B (en) | Parallel chain block synchronization method, device 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 |