CN110648234B - Block generation method and device - Google Patents
Block generation method and device Download PDFInfo
- Publication number
- CN110648234B CN110648234B CN201910866543.4A CN201910866543A CN110648234B CN 110648234 B CN110648234 B CN 110648234B CN 201910866543 A CN201910866543 A CN 201910866543A CN 110648234 B CN110648234 B CN 110648234B
- Authority
- CN
- China
- Prior art keywords
- block
- transaction
- amount
- new
- threshold
- 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.)
- Active
Links
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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- 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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- Technology Law (AREA)
- Computing Systems (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a block generation method and a device, which are applied to nodes in a block chain network, wherein the block generation method comprises the following steps: acquiring first transaction information received from the blockchain network; writing the first transaction information into a buffer area, wherein the buffer area is used for storing transactions to be written into the block; judging whether the total amount of all transactions stored in the buffer zone reaches a lump sum threshold value; and if so, packaging all transactions stored in the buffer area to generate a new block. After the transaction is obtained, a new block is created by judging whether the total transaction amount stored in the buffer area reaches the block outlet amount threshold value or not so as to provide a brand-new block outlet mode, so that a block chain can generate blocks according to the amount of the transaction, and the requirements of some special environments are met.
Description
Technical Field
The present invention relates to the field of block chain data processing, and in particular, to a block generation method and apparatus.
Background
The block chain is an open network account book, and all information of transaction records can be packaged into a block for storage in the transaction process. As multiple transactions are performed, a plurality of blocks are generated, and the blocks are linked with each other to form a block chain. The conventional block chain performs deblocking according to the content size of the block, and the mode is too single.
For example, CN107005574A prior art discloses a block generation method, in which after a block is generated by a block generation apparatus, a private key signature is performed on the block, and a signature block obtained after the private key signature is issued to other node devices through a first node device in a block chain network. In this way, the other node device can verify the identity of the block generation apparatus by signature authentication of the signature block. Therefore, for an illegal block generation device, the block chain network can refuse to add the generated blocks in the block chain, and the safety of the block chain is ensured.
The invention aims to solve the problems of low degree of fit among multiple chains, low information security, inadequate compatibility and expansion among the multiple chains, inconvenient interaction among block chains, too single expansion and mode and the like which are common in the field.
Disclosure of Invention
The present invention provides a block generation method, which aims to overcome the defects of the existing block generation method and device.
In order to overcome the defects of the prior art, the invention adopts the following technical scheme:
a block generation method applied to a node in a block chain network, the method comprising:
acquiring first transaction information received from the blockchain network;
writing the first transaction information into a buffer area, wherein the buffer area is used for storing transactions to be written into the block;
judging whether the total amount of all transactions stored in the buffer zone reaches a lump sum threshold value;
and if so, packaging all the transactions stored in the buffer area to generate a new block.
Optionally, if the transaction is stored in the buffer, packaging all the transactions stored in the buffer to generate a new block.
Optionally, the method further includes:
and after the interval time from the last block output reaches a first preset time, if no transaction exists in the buffer area, generating an empty block, wherein the empty block is a block without transaction.
Optionally, after generating a new block by packaging all transactions stored in the buffer, the method further includes:
and when the M blocks generated recently meet a first condition, reducing the block yield threshold, wherein the first condition is that the total amount of the transactions in the blocks is smaller than the block yield threshold, and M is a positive integer greater than 1.
Optionally, after generating a new block by packaging all transactions stored in the buffer, the method further includes:
and within a second preset time length, if the number of the new blocks exceeds a preset number, increasing the block yield threshold.
Optionally, after the packaging all transactions stored in the buffer to generate a new block, the method further includes:
adjusting by using a pre-established lump sum yield setting model to obtain a new lump sum yield threshold value;
the setting model of the lump sum is as follows:
wherein Z is the new threshold of the lump sum; j is the number of tokens generated by the new block; i is the number of tokens generated by each of n blocks in a target block chain, the target block chain being the block chain in which the new block is located, the n blocks being parent blocks of the new block; x is the total amount of transactions in the n blocks; y is the total number of tokens circulating in the n blocks.
Optionally, before generating a new block by packaging all transactions stored in the buffer, the method further includes: determining that a total amount of all transactions stored in the buffer is less than a pre-chunking amount threshold, the pre-chunking amount threshold being greater than the chunking amount threshold; before the total amount of all transactions stored in the buffer is less than the draw amount threshold, the method further comprises: if the total sum of all transactions stored in the buffer area is larger than or equal to the threshold of the sum of the pre-chunking amount, and the sum of the first transaction information is larger than or equal to the threshold of the sum of the chunking amount, packaging the first transaction information to generate a new block; when the total sum of all transactions stored in the buffer area is larger than or equal to the threshold of the sum of the pre-chunking sum and the sum of the first transaction information is smaller than the threshold of the sum of the chunking sum, packaging the first transaction information and at least one transaction except the first transaction information in the buffer area to generate a new block; wherein the total amount of the first transaction information and the at least one transaction is greater than the threshold of the payout amount and less than the threshold of the pre-payout amount.
Optionally, the method further includes:
broadcasting an out-of-block signal into a blockchain network when all transactions stored in the buffer are packed to generate a new blocky.
Optionally, before generating a new block by packaging all transactions stored in the buffer, the method further includes:
and detecting whether a block-out signal sent by a node in a block chain is received, and if the block-out signal is received, not packaging all transactions stored in the buffer area to generate a new block.
In addition, the present invention also provides a block generation apparatus, which is applied to a node of a block chain, and includes:
an acquisition module, configured to acquire a first transaction received by the blockchain network;
the buffer module is used for writing the first transaction into a buffer area, and the buffer area is used for storing the transaction to be written into the block;
the judging module is used for judging whether the total sum of all the transactions stored in the buffer zone reaches a lump sum threshold value;
and the first packing module is used for packing all the transactions stored in the buffer area to generate a new block if the transaction is reached.
The beneficial effects obtained by the invention are as follows:
1. a new block is created by judging whether the total transaction amount stored in the buffer reaches a block amount threshold value or not so as to provide a brand-new block output mode, so that a block chain can generate blocks according to the transaction amount, and the requirements of some special environments are met;
2. a new block is generated by packaging all transactions stored in the buffer area, so that whether the total amount of the transactions reaches an amount threshold value or not can be rapidly obtained in the transactions;
3. the outgoing block signal is broadcast over a block chain network. Therefore, the nodes except the node in the block chain network determine that the node performs block output, the block output is not performed, and the transaction in different blocks in the block chain is not repeated.
Drawings
The invention will be further understood from the following description in conjunction with the accompanying drawings. The components in the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the embodiments. Like reference numerals designate corresponding parts throughout the different views.
Fig. 1 is a schematic structural diagram of a first embodiment of a flow chart of a block generation method according to the present invention.
Fig. 2 is a schematic structural diagram of a second embodiment of a flow chart of a block generation method according to another embodiment of the present invention.
Fig. 3 is a structural diagram of a third embodiment of a flow chart of a block generation method according to the present invention.
Fig. 4 is a block diagram of an electronic device of a block generation method according to the present invention.
Detailed Description
In order to make the objects and advantages of the present invention more apparent, the present invention will be further described in detail with reference to the following embodiments; it should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. Other systems, methods, and/or features of the present embodiments will become apparent to one with skill in the art upon examination of the following detailed description. It is intended that all such additional systems, methods, features and advantages be included within this description, be within the scope of the invention, and be protected by the accompanying claims. Additional features of the disclosed embodiments are described in, and will be apparent from, the detailed description that follows.
The same or similar reference numerals in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there is an orientation or positional relationship indicated by the term "upper" - "lower" - "left" - "right", etc., based on the orientation or positional relationship shown in the drawings, it is only for convenience of description and simplification of the description, but not to indicate or imply that the device or component referred to must have a specific orientation.
The first embodiment is as follows: fig. 1 is a flowchart illustrating a block generation method applied to a node in a blockchain network according to an embodiment of the present disclosure, where the method includes:
step 110: first transaction information received from a blockchain network is obtained.
In an optional implementation process of the present application, the first transaction information is a transaction currently received by the node from the blockchain network. In addition, the first transaction information may be an intra-chain transaction, that is, a transaction received by the node when the node creates and broadcasts the intra-chain transaction at another node in the blockchain. The first transaction information may also be a transaction created by the node or uplink service data, i.e. a transaction added to the blockchain by using an intelligent contract. The specific creation mode of the first transaction information can be selected according to the actual needs of the blockchain.
Step 120: and writing the first transaction information into a buffer area, wherein the buffer area is used for storing the transaction to be written into the block.
In an optional implementation process of the present application, when the first transaction information is written into the buffer, the buffer may hold transactions that have been written into the buffer before and have not been written into the tile, or may be a blank buffer. And transactions in the buffer may be more conveniently packed later, thereby generating corresponding tiles in the tile chain.
Step 130: and judging whether the total sum of all the transactions stored in the buffer zone reaches a lump sum threshold value.
In an optional implementation process of the application, a threshold value of the amount of the money to be processed can be preset, and then whether the total amount of the transaction stored in the buffer area reaches the threshold value of the amount of the money to be processed to determine whether the total amount of the transaction stored in the buffer area reaches the threshold value of the amount to be processed to determine whether the transaction can be packaged according to the amount of the money to generate a corresponding block, that is, a block chain can generate blocks according to the amount of the transaction to determine that the block chain provided by the embodiment of the application can meet the needs of some special environments, for example, special environments such as banks and accountants may require the block chain to be processed according to the amount of the money to realize a required accounting mode.
Step 140: and if so, packaging all the transactions stored in the buffer area to generate a new block.
In an optional implementation process of the application, at least one transaction of which the total amount reaches the threshold of the lump sum amount is made out, namely when the total amount of the transactions in the buffer area is accumulated to the threshold of the lump sum amount, all the transactions are made out at once, so that the total amount of the transactions in each block can be larger than the threshold of the lump sum amount, and the blocks can be generated more timely to realize timely updating of the blocks.
It should be noted that, if the total amount of all transactions in the buffer does not reach the threshold of the out-block amount, no block is generated, and the node continues to wait for the next transaction from the blockchain network and then executes the above steps.
It should be further noted that after a new block is generated, the transaction that has been written into the block in the buffer can be cleared, so as to prevent a certain transaction from being repeatedly packed in the process of generating the block in the subsequent packing transaction, and thus, the same transaction is recorded in the block chain for many times.
For example, if a transaction a is received at a node in the blockchain network, the transaction information is stored in a buffer corresponding to the node, wherein only the transaction B and the transaction C are pre-stored in the buffer. Therefore, the buffer area currently stores transaction A, transaction B and transaction C, whether the total sum of the transaction A, the transaction B and the transaction C reaches the lump sum threshold value is judged, and if the total sum of the transaction A, the transaction B and the transaction C reaches the lump sum threshold value, the transaction A, the transaction B and the transaction C are packaged in a block chain to generate a new block. And if the total sum of the transaction A, the transaction B and the transaction C does not reach the lump sum threshold value, not generating a new block in the block chain, waiting for the node to receive the new transaction again, and executing the steps. And if the node receives the transaction D again, the transaction D is continuously stored in the buffer area, whether the total sum of the transaction A, the transaction B, the transaction C and the transaction D reaches the threshold of the lump sum is judged, and if the total sum of the transaction A, the transaction B, the transaction C and the transaction D reaches the threshold of the lump sum, the transaction A, the transaction B, the transaction C and the transaction D are packaged to generate a new block.
On the basis of the above embodiment, the block generation method further includes: and after the interval time from the last block output reaches a first preset time, if the transaction is stored in the buffer area, packaging all the transactions stored in the buffer area to generate a new block.
In an optional implementation process of the application, if it is detected that a first preset time period has elapsed since the last block discharge, and a transaction with an unwritten block is also stored in a buffer area corresponding to the node, the node may not wait for receiving a new transaction, and the total amount of the transaction in the buffer area does not need to be compared with a block discharge amount threshold, and all transactions in the buffer area may be directly packed to generate a new block. When the transaction in the buffer area does not meet the threshold of the block discharging amount for a long time, the block discharging can be carried out according to the preset block discharging interval time. Therefore, when the amount of the transaction in the buffer is too small or the transaction is not frequent, the block can be released, and the block chain can be updated in time.
It should be noted that, after the interval time from the last block output reaches a first preset time, if no transaction exists in the buffer, an empty block is generated, where the empty block is a block that does not include a transaction.
If the first preset time length is detected after the last block is discharged, but the transaction needing to be written into the block does not exist in the buffer area corresponding to the node, a vacant block can be packed to discharge the block, and therefore the timely updating of the block chain is guaranteed.
It should be noted that, if it is detected that the interval duration does not reach the first preset duration after the last block dispensing, it may be determined whether the block dispensing is required by the above method according to the comparison between the total transaction amount and the threshold of the block dispensing amount. And when judging whether the total amount of all the transactions stored in the buffer area reaches the threshold of the block amount after receiving the transactions, whether the time difference between the current time and the last block-out time reaches a first preset time can be detected at the same time.
The timing may be started after each block is discharged, and when the timing reaches a first preset time, it may be determined that the interval time from the last block discharge has reached the first preset time. The time difference between the current time and the nearest block-out time is detected to reach the first preset time length by recording the block-out time each time, and the time interval between the current time and the last block-out time can be judged to reach the first preset time length. The specific manner of calculating the interval time may be adjusted according to actual requirements.
Meanwhile, whether the first preset time length is reached or not can be judged by detecting the time length from the last block output, whether the first preset time length is reached or not can be judged by detecting the time length from the last buffer area reset, and whether the first preset time length is reached or not can be judged by detecting the time length of the earliest transaction stored in the buffer area. The specific manner of judging whether the first preset time duration is reached can be adjusted according to actual requirements. Moreover, the first preset time period may be 10 minutes, 4 hours, or 12 hours, and the specific first preset time period may be adjusted according to the update frequency of the block chain requirement.
For example, assuming that the first preset time period is 4 hours and the last block time is 16 points, if it is detected that the current time is 20 points and the transaction B and the transaction C are stored in the buffer in advance, the transaction B and the transaction C may be packaged to generate a new block. If the current time is 20 o' clock, the transaction needing to be written into the block does not exist in the buffer area, and no new block can be generated. And, assuming the node receives a new transaction a at point 21, transaction a may be stored in a buffer and packaged to generate a new tile.
On the basis of the above embodiment, after step 140, the block generating method further includes: and when the M blocks generated recently meet a first condition, reducing the block fund amount threshold, wherein the first condition is that the total amount of the transactions in the blocks is smaller than the block fund amount threshold, and M is a positive integer larger than 1.
In an optional implementation of the present application, if it is detected that consecutive M new blocks satisfy a first condition, wherein the first condition is that the total amount of transactions in the blocks is less than the threshold of the payout amount. That is, the total amount of the transaction in the M consecutive blocks is smaller than the threshold of the out-block amount. It is also noted that the M consecutive blocks are generated by detecting that all transactions in the buffer have been blocked for a first predetermined time period since the last block blocking.
Therefore, in order to make the transaction more reasonable to carry out the block, the block yield threshold value can be adjusted to be smaller. Under the condition that the total amount of the transaction is small, the condition that the transaction can be carried out only after the time interval from the last block reaches the first preset time can be changed by reducing the block discharging amount threshold, so that the transaction can be carried out more reasonably, and the block chain can be updated more reasonably. Meanwhile, under the condition that the total amount of the transaction is small, the lump sum threshold value is reduced, and the total amount of the transaction in the generated block can be kept approximately the same to a certain extent.
For example, the preset number of times is set to 3, if there are a block e, a block f, a block g, and a block h that are newly generated, and the block e, the block f, the block g, and the block h are sequentially and continuously generated blocks. If block e, block f, and block g all satisfy the first condition, that is, the total amount of transactions in each block is less than the block payout amount threshold, and block h does not satisfy the first condition, it can be assumed that the transactions in block e, block f, and block g are all performed when it is detected that the block payout has been performed for the first preset time period since the last block payout was performed. Therefore, the number of consecutive times that the block e, the block f, and the block g satisfy the first condition has reached 3, the block payout threshold needs to be lowered. If block e, block f, and block h all satisfy the first condition, and block g does not satisfy the first condition, but block e, block f, and block h do not directly link with block h, so the number of consecutive times that block e, block f, and block h satisfy the first condition is actually 2, and does not reach the preset number of times, and therefore, the block amount threshold is not lowered.
On the basis of the above embodiment, after step 140, the block generating method further includes: and within a second preset time length, if the number of the new blocks exceeds the preset number, increasing the block-out amount threshold.
In an optional implementation process of the present application, the frequency of generating the blocks may be further determined by detecting whether the number of the generated new blocks exceeds the preset number in the second preset time period. If the number of the generated new blocks exceeds the preset number, it means that the transaction amount is too large in the second preset time period, so that the total transaction amount in the buffer area can reach the block fund amount threshold value more quickly, and the number of the generated blocks is too large. Therefore, the block amount threshold value can be increased, so that the speed of the total amount of the transaction in the buffer area reaching the threshold value can be slowed down under the condition that the amount of the transaction is large, the number of blocks generated in the second preset time length is slowed down, the block chain is guaranteed not to be updated too fast, and the calculation pressure of the block chain network is reduced.
It should be noted that the second preset time is longer than the first preset time, the second preset time may be 8 hours or 24 hours, and the specific second preset time and the preset number may be adjusted according to the update frequency required by the block chain.
On the basis of the above embodiment, after step 140, the block generating method further includes: and adjusting by using a pre-established lump sum yield setting model to obtain a new lump sum yield threshold value. The model for setting the lump sum is as follows:
wherein Z is a new lump sum threshold; j is the number of tokens generated by the new block; i is the number of tokens generated by each of the n blocks in the target block chain, the target block chain is the block chain in which the new block is located, and the n blocks are the parent blocks of the new block; x is the total amount of transactions in the n blocks; y is the total number of tokens circulating in the n blocks.
In an optional implementation of the present application, after each new tile is generated, the threshold of the lump sum in the next tile generation process may be determined by the following method: n blocks in the target block chain may be selected in advance, where the n blocks may be parent blocks of the new block to be generated and directly linked with the new block to be generated. And acquiring the total amount of all transactions in the n blocks, recording the total amount as x, and acquiring the total number of the tokens circulating in the n blocks, recording the total number as y. Meanwhile, the number of tokens generated by each of the n blocks can be obtained and is marked as i. Wherein the number of tokens generated by each of the n blocks is the same. The number of tokens that can be generated by a new block to be generated is preset and recorded as j. And then, calculating according to a preset block fund amount setting model to obtain a new block fund amount threshold value Z, namely the block fund amount threshold value of a new block to be generated.
The number of the blocks of the n blocks can be adjusted according to the actual requirement for reducing the block discharging amount, and the number j of the tokens which can be generated by the new block to be generated can be adjusted according to the block discharging requirement of the block chain.
It should be noted that the reduced threshold value of the payout amount and/or the increased threshold value of the payout amount may be calculated by a predetermined payout amount setting model, which is not described herein again.
Example two: as shown in fig. 2, the block generation method is applied to a node in a block chain network, and the method includes:
step 110: first transaction information received from a blockchain network is obtained.
Step 120: and writing the first transaction information into a buffer area, wherein the buffer area is used for storing the transaction to be written into the block.
Step 130: and judging whether the total amount of all the transactions stored in the buffer zone reaches a lump sum threshold value.
Step 140: and if so, packaging all the transactions stored in the buffer area to generate a new block.
And, before step 140, the method further comprises:
step 150: determining that the total amount of all transactions stored in the buffer is less than a pre-chunking amount threshold, the pre-chunking amount threshold being greater than a chunking amount threshold.
In an optional implementation process of the present application, before packaging all transactions stored in the buffer area to generate a new block, the total amount of all transactions stored in the buffer area may be compared with the pre-blocking amount threshold to determine that the total amount is smaller than the pre-blocking amount threshold, so as to ensure that the total amount of transactions in the generated block is within the preset amount range. Therefore, the total amount of the transaction in each block in the block chain is within a certain range, and the total amount of the transaction in the blocks does not differ too much.
The upper limit of the preset amount range may be a pre-first-out lump sum threshold, and the lower limit may be a lump sum threshold. The specific numerical value of the sum of the pre-discharged blocks can be adjusted according to the size of the sum of money stored in the required blocks.
On the basis of the above embodiment, before step 150, the block generating method further includes:
step 160: and judging whether the total sum of all the transactions stored in the buffer area is smaller than the pre-block sum threshold value.
Step 170: and if the total sum of all the transactions stored in the buffer area is greater than or equal to the threshold of the sum of the pre-chunking money and the sum of the first transaction information is greater than or equal to the threshold of the sum of the chunking money, packaging the first transaction information to generate a new block.
In an optional implementation process of the present application, if the total amount of all transactions stored in the buffer is greater than or equal to the threshold of the amount of money to be blocked in advance, it may be determined that the total amount of transactions requiring blocking is far greater than the threshold of the amount of money to be blocked, and if the transactions in the buffer are directly packaged to generate a block, the total amount of transactions in the generated new block is too large compared with other blocks.
Therefore, whether the amount of the received first transaction information is larger than the threshold of the amount of the lump sum can be judged, if the amount of the first transaction information is also larger than the threshold of the amount of the lump sum, the amount of the first transaction information can be judged to be huge, under the condition that the first transaction information is not stored in the buffer area, the total amount of the buffer area transactions is smaller than the threshold of the amount of the lump sum, and after the first transaction information is stored in the buffer area, the total amount of the buffer area transactions is larger than the threshold of the amount of the first-in-first-out lump sum, namely, the total amount of the buffer area is far larger than the threshold of the amount of the lump sum. Therefore, other packaging modes can be selected, the first transaction information is blocked in advance, and the first transaction information can be packaged separately to generate a new block. Namely, the new block comprises the first transaction information, and the transaction amount in the new block is larger than the threshold value of the block-out amount. Therefore, the total amount of the transaction in each block can be guaranteed to be within a certain range, and the total amount of the transaction in the blocks does not differ too much.
It should be noted that, after the first transaction information is packaged to generate a new block, the transaction in the buffer may continue to wait for the next time when the node receives a new transaction and stores the new transaction in the buffer, and then determine whether all the transactions in the buffer can be processed out of the block.
It should be noted that step 160 may be executed before step 140, before step 130, or simultaneously with step 130, and the execution order of the above steps is not limited, and may be adjusted according to actual needs.
On the basis of the above embodiment, before step 160, the block generating method further includes:
step 180: and if the total sum of all the transactions stored in the buffer area is greater than or equal to the threshold of the sum of the pre-chunked sum and the sum of the first transaction information is less than the threshold of the chunked sum, packaging the first transaction information and at least one transaction except the first transaction information in the buffer area to generate a new chunk. The total amount of the first transaction information and the at least one transaction is larger than the threshold value of the lump sum and smaller than the threshold value of the prior lump sum.
In an optional implementation process of the present application, if the total amount of all transactions stored in the buffer is greater than or equal to the pre-chunking amount threshold, and the amount of the received first transaction information is less than the chunking amount threshold, it may be selected to pre-pack the first transaction information with the rest of transactions in the buffer, that is, at least one transaction is selected from the transactions excluding the first transaction information from the buffer to be packed with the first transaction information to generate a new chunk. And performing preparation packaging on the selected transaction and the first transaction information each time until the total sum of the prepared packaged transactions is greater than the lump sum threshold value, and packaging all the prepared packaged transactions to generate a new block. Therefore, the total amount of the transaction in the new block can be smaller than the preset block discharge amount and larger than the preset block discharge amount, the total amount of the transaction in each block is guaranteed to be within a certain range, and the total amount of the transaction in the blocks does not differ too much.
It should be noted that, in the transactions stored in the buffer area without the first transaction information, the total amount of at least one transaction and the first transaction information may not be selected to be greater than the threshold of the payout amount, and after waiting for a next new transaction to be stored in the buffer area, it may be determined whether the total amount of at least one transaction and the first transaction information may be selected from the buffer area to be greater than the threshold of the payout amount.
And after the first transaction information and at least one transaction except the first transaction information in the buffer area are packaged to generate a new block, the transaction in the buffer area can continue to wait for the next time after the node receives the new transaction and stores the new transaction in the buffer area, and then whether all the transactions in the buffer area can be processed out of the block is judged.
It should be further noted that at least one transaction is selected from the transactions excluding the first transaction information from the buffer and is packaged with the first transaction information to generate a new block, the selection may be performed according to the sequence of the transactions stored in the buffer, or according to the size of the transactions in the buffer, and the specific selection method may be adjusted according to the actual block output requirement.
For example, if only transaction B and transaction C are pre-stored in the buffer, the first transaction information newly written into the buffer may be transaction A. At this time, the buffer currently stores transaction a, transaction B, and transaction C, and if the total amount of transaction a, transaction B, and transaction C reaches the threshold of the out-blocking amount, it may be determined whether the total amount of transaction a, transaction B, and transaction C is greater than the threshold of the out-blocking amount in advance. If so, it may be determined again whether the amount of transaction A is greater than the pre-chunking amount threshold. If the amount of transaction A is greater than or equal to the pre-chunking amount threshold, transaction A may be packaged separately to generate a new chunk. If the buffer area stores transaction B and transaction C, it can wait for new transactions to be stored in the buffer area, and then determine whether all transactions in the buffer area can be packaged into blocks.
If the amount of transaction A is less than the pre-chunking amount threshold, transaction B or transaction C may be selected from the buffer for preliminary packaging with the first transaction information. Assume that the threshold for the out-blocking amount is 120, the threshold for the pre-out-blocking amount is 150, the amount for transaction A is 60, the amount for transaction B is 70, and the amount for transaction C is 30. Then the total amount of the transaction A and the transaction C can be compared with the threshold value of the lump sum according to the amount of the transaction, if the total amount of the transaction A and the transaction C is smaller than the threshold value of the lump sum, the total amount of the transaction A and the transaction B is compared with the threshold value of the lump sum, if the total amount of the transaction A and the transaction B is larger than the threshold value of the lump sum, the transaction A and the transaction B are packaged to generate a new block.
Assume that the threshold for the out-of-block amount is 120, the threshold for the pre-out-of-block amount is 150, the amount for transaction A is 60, the amount for transaction B is 45, and the amount for transaction C is 50. The total amount of the transaction A and the transaction B can be compared with the threshold value of the lump sum according to the amount of the transaction, if the total amount of the transaction A and the transaction B is smaller than the threshold value of the lump sum, the total amount of the transaction A and the transaction C is compared with the threshold value of the lump sum, and the total amount of the transaction A and the transaction C is smaller than the threshold value of the lump sum. Then, after waiting for the new transaction to be stored in the buffer, it is determined whether at least one transaction can be selected from the transactions of transaction a that can be removed from the buffer for packaging with transaction a.
On the basis of the above embodiment, when all transactions stored in the buffer are packed to generate a new chunk, an out-of-chunk signal is broadcast into the blockchain network.
In an alternative embodiment of the present application, the node sends the outgoing block signal to at least one node except the node in the blockchain network while packaging all transactions stored in the buffer to generate a new block, i.e. broadcasts the outgoing block signal in the blockchain network. Therefore, the nodes except the node in the block chain network determine that the node performs block outputting, the block outputting is not performed, and the transaction in different blocks in the block chain is not repeated.
Meanwhile, before the packaging all transactions stored in the buffer to generate a new block, the method further comprises: and detecting whether the block output signal is received or not, and if the block output signal is received, not packaging all transactions stored in the buffer area to generate a new block.
It should be noted that, before a new block is generated by a node in a packet manner, whether the node receives a block output signal is detected, and if the node receives the block output signal, it is determined that a block is being output by the node, and the new block is not generated by the node in the packet manner, so that a situation that a transaction is repeated in blocks in a block chain is prevented.
Example three: as shown in fig. 3, an embodiment of the present application further provides a block generation apparatus, which is applied to a node in a block chain network, and includes: the acquisition module is used for acquiring first transaction information received from the blockchain network; the buffer module is used for writing the first transaction information into a buffer area, and the buffer area is used for storing the transaction of the block to be written; the judging module is used for judging whether the total sum of all the transactions stored in the buffer zone reaches a lump sum threshold value; and the first packing module is used for packing all the transactions stored in the buffer area to generate a new block if the transaction is reached.
On the basis of the embodiment, the device further comprises a second packing module, which is used for packing all the transactions stored in the buffer area to generate a new block if the transactions are stored in the buffer area after the interval time from the last block output reaches a first preset time length.
On the basis of the above embodiment, the apparatus further includes a first adjusting module, configured to decrease the threshold of the payout amount if the number of consecutive times that the plurality of new blocks satisfy the first condition reaches a preset number of times, in the plurality of new blocks, where the first condition is that the total amount of the transaction in the new blocks is smaller than the threshold of the payout amount.
On the basis of the above embodiment, the apparatus further includes a second adjusting module, configured to increase the threshold of the amount of the money to be dispensed if the number of the new blocks exceeds the preset number within a second preset time period.
On the basis of the embodiment, the device further comprises a third adjusting module, a second adjusting module and a third adjusting module, wherein the third adjusting module is used for adjusting by utilizing a pre-established block fund amount output setting model to obtain a new block fund amount output threshold value;
the model for setting the lump sum is as follows:
wherein Z is the new export lump sum threshold; j is the number of tokens generated by the new block; i is the number of tokens generated by each of the n blocks in the target block chain, the target block chain is the block chain in which the new block is located, and the n blocks are the parent blocks of the new block; x is the total amount of transactions in the n blocks; y is the total number of tokens circulating in the n blocks.
On the basis of the above embodiment, the apparatus further includes a secondary determination module, configured to determine that a total amount of all transactions stored in the buffer is smaller than a threshold of the pre-chunking amount, and that the threshold of the pre-chunking amount is larger than the threshold of the chunking amount.
On the basis of the above embodiment, the apparatus further includes a third packing module, configured to pack the first transaction information to generate a new block if the total amount of all transactions stored in the buffer is greater than or equal to the threshold of the amount of the pre-chunking money and the amount of the first transaction information is greater than or equal to the threshold of the amount of the chunking money.
On the basis of the above embodiment, the apparatus further includes a fourth packing module, configured to pack the first transaction information and at least one transaction excluding the first transaction information in the buffer to generate a new block if the total amount of all transactions stored in the buffer is greater than or equal to the threshold of the amount of the previously blocked transaction, and the amount of the first transaction information is less than the threshold of the amount of the blocked transaction; the total sum of the first transaction information and at least one transaction is larger than the threshold value of the lump sum and smaller than the threshold value of the preset lump sum.
The block generating device provided in the embodiment of the present application is used for executing the method, and the specific implementation manner thereof is consistent with that of the method, and is not described herein again.
Referring to fig. 4, fig. 4 is a block diagram illustrating a structure of an electronic device 10 applicable to the embodiment of the present application. The electronic device 10 may include a memory 101, a memory controller 102, a processor 103, a peripheral interface 104, an input-output unit 105, a display unit 107.
The memory 101, the memory controller 102, the processor 103, the peripheral interface 104, the input/output unit 105, and the display unit 107 are electrically connected to each other directly or indirectly to implement data transmission or interaction. For example, the components may be electrically connected to each other via one or more communication buses or signal lines. At least one software or firmware (firmware) is stored in the memory 101 or a software function module solidified in an Operating System (OS). The processor 103 is used to execute executable modules, software functional modules or computer programs stored in the memory 101.
The Memory 101 may be, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Read-Only Memory (EPROM), an electrically Erasable Read-Only Memory (EEPROM), and the like. The memory 101 is used for storing a program, and the processor 103 executes the program after receiving an execution instruction, and the method executed by the server defined by the flow process disclosed in any of the foregoing embodiments of the present application may be applied to the processor 103, or implemented by the processor 103.
The processor 103 may be an integrated circuit chip having signal processing capabilities. The Processor 103 may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor 103 may be any conventional processor or the like.
The peripheral interface 104 couples various input/output devices to the processor 103 as well as to the memory 101. In some embodiments, peripheral interface 104, processor 103, and memory controller 102 may be implemented in a single chip. In other examples, they may be implemented separately from the individual chips.
The input and output unit 105 is used for providing input data for a user to realize the interaction of the user and a server (or a local terminal). The input and output unit 105 may be, but is not limited to, a mouse, a keyboard, and the like.
The display unit 107 provides an interactive interface (e.g., a user interface) between the electronic device 10 and a user or for displaying image data to a user reference. In this embodiment, the display unit 107 may be a liquid crystal display or a touch display. In the case of a touch display, the display can be a capacitive touch screen or a resistive touch screen, which supports single-point and multi-point touch operations. Supporting single-point and multi-point touch operations means that the touch display can sense touch operations simultaneously generated from one or more positions on the touch display, and the sensed touch operations are sent to the processor 103 for calculation and processing.
The peripheral interface 104 couples various input/output devices to the processor 103 as well as to the memory 101. In some embodiments, peripheral interface 104, processor 103, and memory controller 102 may be implemented in a single chip. In other examples, they may be implemented separately from the individual chips.
The input/output unit 105 is used for providing input data for a user to realize the interaction of the user and the processing terminal. The input and output unit 105 may be, but is not limited to, a mouse, a keyboard, and the like.
It will be appreciated that the configuration shown in FIG. 4 is merely illustrative and that electronic device 10 may include more or fewer components than shown in FIG. 4 or may have a different configuration than shown in FIG. 4. The components shown in fig. 4 may be implemented in hardware, software, or a combination thereof.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working process of the apparatus described above may refer to the corresponding process in the foregoing method, and will not be described in too much detail herein.
To sum up, the embodiment of the present application provides a block generation method and apparatus, which are applied to a node in a block chain network, where the block generation method includes: acquiring first transaction information received from the blockchain network; writing the first transaction information into a buffer area, wherein the buffer area is used for storing transactions to be written into the block; judging whether the total sum of all the transactions stored in the buffer zone reaches a lump sum threshold value; and if so, packaging all transactions stored in the buffer area to generate a new block. After the transaction is obtained, a new block is created by judging whether the total transaction amount stored in the buffer area reaches the block amount threshold value, so that a brand-new block making mode is provided, and a block chain can generate the block according to the transaction amount, so that the requirements of some special environments are met.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. The apparatus embodiments described above are merely illustrative and, for example, the flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present application. 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 that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, an optical disk, or other various media capable of storing program codes.
Although the invention has been described above with reference to various embodiments, it should be understood that many changes and modifications can be made without departing from the scope of the invention. That is, the methods, systems, and devices discussed above are examples. Various configurations may omit, substitute, or add various procedures or components as appropriate. For example, in alternative configurations, the methods may be performed in an order different than described, and/or various components may be added, omitted, and/or combined. Moreover, features described with respect to certain configurations may be combined in various other configurations, as different aspects and elements of the configurations may be combined in a similar manner. Further, elements therein may be updated as technology evolves, i.e., many elements are examples and do not limit the scope of the disclosure or claims.
Specific details are given in the description to provide a thorough understanding of the exemplary configurations including implementations. However, configurations may be practiced without these specific details, for example, well-known circuits, processes, algorithms, structures, and techniques have been shown without unnecessary detail in order to avoid obscuring the configurations. This description provides example configurations only, and does not limit the scope, applicability, or configuration of the claims. Rather, the foregoing description of the configurations will provide those skilled in the art with an enabling description for implementing the described techniques. Various changes may be made in the function and arrangement of elements without departing from the spirit or scope of the disclosure.
In conclusion, it is intended that the foregoing detailed description be regarded as illustrative rather than limiting, and that it be understood that these examples are illustrative only and are not intended to limit the scope of the invention. After reading the description of the present invention, the skilled person can make various changes or modifications to the invention, and these equivalent changes and modifications also fall into the scope of the invention defined by the claims.
Claims (6)
1. A method for block generation, applied to a node in a blockchain network, the method comprising:
acquiring first transaction information received from the blockchain network;
writing the first transaction information into a buffer area, wherein the buffer area is used for storing transactions to be written into the block;
judging whether the total sum of all the transactions stored in the buffer zone reaches a lump sum threshold value;
if so, packaging all the transactions stored in the buffer area to generate a new block;
after the interval time from the last block output reaches a first preset time, if the transaction is stored in the buffer area, packaging all the transactions stored in the buffer area to generate a new block; if the transaction does not exist in the buffer area, generating an empty block, wherein the empty block does not include the transaction;
when M blocks in the generated new blocks meet a first condition, reducing the block fund amount threshold, wherein the first condition is that the total amount of transactions in the blocks is smaller than the block fund amount threshold, and M is a positive integer larger than 1;
and setting the time for the number of the new blocks to exceed the preset number as a second preset time length, and within the second preset time length, if the number of the new blocks exceeds the preset number, increasing the block yield threshold.
2. A block generation method as claimed in claim 1, wherein after said generating a new block by packaging all transactions stored in said buffer, said method further comprises:
adjusting by using a pre-established lump sum yield setting model to obtain a new lump sum yield threshold value;
the setting model of the lump sum is as follows:
wherein Z is the new export lump sum threshold; j is the number of tokens generated by the new block; i is the number of tokens generated by each of n blocks in a target block chain, the target block chain being the block chain in which the new block is located, the n blocks being parent blocks of the new block; x is the total amount of transactions in the n blocks; y is the total number of tokens circulating in the n blocks.
3. A block generation method according to claim 1 or 2, wherein before said packaging all transactions stored in said buffer to generate a new block, said method further comprises:
determining that a total amount of all transactions stored in the buffer is less than a pre-chunking amount threshold, the pre-chunking amount threshold being greater than the chunking amount threshold; before the total amount of all transactions stored in the buffer is less than the lump-sum threshold, the method further comprises:
if the total sum of all transactions stored in the buffer area is larger than or equal to the threshold of the sum of the pre-chunking amount, and the sum of the first transaction information is larger than or equal to the threshold of the sum of the chunking amount, packaging the first transaction information to generate a new block;
when the total sum of all transactions stored in the buffer area is greater than or equal to the threshold of the pre-block-out sum and the sum of the first transaction information is less than the threshold of the block-out sum, packaging the first transaction information and at least one transaction except the first transaction information in the buffer area to generate a new block; wherein the total amount of the first transaction information and the at least one transaction is greater than the threshold of the payout amount and less than the threshold of the pre-payout amount.
4. A block generation method according to claim 3, further comprising:
broadcasting an out-of-block signal into a blockchain network when all transactions stored in the buffer are packed to generate a new block.
5. A block generation method as claimed in claim 4, wherein after determining whether the total amount of all transactions stored in the buffer reaches a draw threshold, the method further comprises:
and detecting whether a block-out signal sent by a node in a block chain is received, and if the block-out signal is received, not packaging all transactions stored in the buffer area to generate a new block.
6. A block generation apparatus, applied to a node of a block chain, comprising:
the acquisition module is used for acquiring first transaction information received by the blockchain network;
the buffer module is used for writing the first transaction information into a buffer area, and the buffer area is used for storing the transaction to be written into the block;
the judging module is used for judging whether the total sum of all the transactions stored in the buffer zone reaches a lump sum threshold value;
the first packing module is used for packing all the transactions stored in the buffer area to generate a new block if the transaction is achieved;
the second packing module is used for packing all the transactions stored in the buffer area to generate a new block if the transactions are stored in the buffer area after the interval time from the last block output reaches a first preset time length; if the transaction does not exist in the buffer area, generating an empty block, wherein the empty block is a block not including the transaction;
the first adjusting module is used for reducing the block fund amount threshold value if M blocks in the generated new blocks meet a first condition, wherein the first condition is that the total amount of transactions in the blocks is smaller than the block fund amount threshold value, and M is a positive integer larger than 1;
and the second adjusting module is used for setting the time for the number of the new blocks to exceed the preset number as a second preset time length, and increasing the block yield threshold value if the number of the new blocks exceeds the preset number in the second preset time length.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910866543.4A CN110648234B (en) | 2019-09-12 | 2019-09-12 | Block generation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910866543.4A CN110648234B (en) | 2019-09-12 | 2019-09-12 | Block generation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110648234A CN110648234A (en) | 2020-01-03 |
| CN110648234B true CN110648234B (en) | 2022-08-19 |
Family
ID=69010562
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910866543.4A Active CN110648234B (en) | 2019-09-12 | 2019-09-12 | Block generation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110648234B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11516147B2 (en) * | 2019-10-02 | 2022-11-29 | Red Hat, Inc. | Blockchain-based dynamic storage provisioner |
| CN113497733A (en) * | 2020-04-08 | 2021-10-12 | 富士通株式会社 | Method, apparatus, and computer-readable storage medium for optimizing a network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017082238A1 (en) * | 2015-11-09 | 2017-05-18 | 日本電信電話株式会社 | Block chain generation device, block chain generation method, block chain verification device, block chain verification method and program |
| CN108595157A (en) * | 2018-04-28 | 2018-09-28 | 百度在线网络技术（北京）有限公司 | Processing method, device, equipment and the storage medium of block chain data |
| CN108768665A (en) * | 2018-07-02 | 2018-11-06 | 上海达家迎信息科技有限公司 | Block chain generation method, device, computer equipment and storage medium |
| CN109508970A (en) * | 2018-10-26 | 2019-03-22 | 阿里巴巴集团控股有限公司 | Money transfer method and device based on block chain |
| WO2019147339A1 (en) * | 2018-01-29 | 2019-08-01 | Mastercard International Incorporated | Method and system for facilitating atm transactions using blockchain |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9888007B2 (en) * | 2016-05-13 | 2018-02-06 | Idm Global, Inc. | Systems and methods to authenticate users and/or control access made by users on a computer network using identity services |
| CN109064171A (en) * | 2018-07-26 | 2018-12-21 | 杭州秘猿科技有限公司 | A kind of method, apparatus and electronic system of block chain parallel transaction |
| CN109213828B (en) * | 2018-09-18 | 2021-08-20 | 百度在线网络技术（北京）有限公司 | Block generation method, device, equipment and storage medium |
| CN109101662B (en) * | 2018-09-18 | 2021-05-14 | 百度在线网络技术（北京）有限公司 | Block generation method, device, equipment and storage medium |
| CN109544332B (en) * | 2018-10-17 | 2023-04-07 | 贵阳信息技术研究院（中科院软件所贵阳分部） | Block chain transaction block-out method based on user grade |
| CN109410063B (en) * | 2018-11-12 | 2021-09-10 | 众安信息技术服务有限公司 | Transaction processing method and device based on block chain and storage medium |
| CN109831425B (en) * | 2019-01-25 | 2022-02-15 | 中国联合网络通信集团有限公司 | Block chain consensus method, device, equipment and computer readable storage medium |
| CN110046896B (en) * | 2019-04-26 | 2022-03-01 | 腾讯科技（深圳）有限公司 | Block processing method, node and system |
| CN110222116B (en) * | 2019-05-07 | 2022-02-01 | 北京奇艺世纪科技有限公司 | Control method and device for transaction data storage and storage medium |
-
2019
- 2019-09-12 CN CN201910866543.4A patent/CN110648234B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017082238A1 (en) * | 2015-11-09 | 2017-05-18 | 日本電信電話株式会社 | Block chain generation device, block chain generation method, block chain verification device, block chain verification method and program |
| WO2019147339A1 (en) * | 2018-01-29 | 2019-08-01 | Mastercard International Incorporated | Method and system for facilitating atm transactions using blockchain |
| CN108595157A (en) * | 2018-04-28 | 2018-09-28 | 百度在线网络技术（北京）有限公司 | Processing method, device, equipment and the storage medium of block chain data |
| CN108768665A (en) * | 2018-07-02 | 2018-11-06 | 上海达家迎信息科技有限公司 | Block chain generation method, device, computer equipment and storage medium |
| CN109508970A (en) * | 2018-10-26 | 2019-03-22 | 阿里巴巴集团控股有限公司 | Money transfer method and device based on block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110648234A (en) | 2020-01-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110648234B (en) | Block generation method and device | |
| WO2019091466A1 (en) | Block chain transaction storage method and queuing method | |
| CN102135927B (en) | Method and device for system booting based on NAND FLASH | |
| CN105335099A (en) | Memory cleaning method and terminal | |
| CN105359120A (en) | Using dual PHYs to support multiple PCIE link widths | |
| CN104252419B (en) | A kind of method and device of Memory Allocation | |
| CN104750620B (en) | A kind of internal memory migration method and device | |
| TWI612473B (en) | Methods for garbage collection and apparatuses using the same | |
| US20180107590A1 (en) | Information processing apparatus | |
| CN102981944A (en) | Log storage method based on file system | |
| CN110705980A (en) | Method, device and storage medium for processing transaction payment operation based on data analysis | |
| CN107590144A (en) | A kind of file memory method and terminal | |
| CN107092678A (en) | A kind of method, device and equipment for obtaining application active degree | |
| CN103345434A (en) | Data backup method and device of display device | |
| CN100470524C (en) | Small-capacity FIFO storage device data-moving trigger and method | |
| CN104503868B (en) | Method of data synchronization, device and system | |
| CN109521970B (en) | Data processing method and related equipment | |
| CN104506636B (en) | A kind of method of data synchronization and device | |
| US9916129B1 (en) | Flow control for direct memory access transfers | |
| CN109165712A (en) | Distributed generation method, device and computer storage medium by stages number | |
| WO2020224218A1 (en) | Hbase-based data writing method, system, device, and readable storage medium | |
| CN107169767A (en) | Correction method and system are rushed in transaction | |
| CN103955854B (en) | A kind of account management device and method | |
| EP2942714A2 (en) | Monitoring method, monitoring apparatus, and electronic device | |
| CN109710187A (en) | Read command accelerated method, device, computer equipment and the storage medium of NVMe SSD main control chip |
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 |