CN108924252A - Mitigate method, medium and the block catenary system of node storage load in block catenary system - Google Patents
Mitigate method, medium and the block catenary system of node storage load in block catenary system Download PDFInfo
- Publication number
- CN108924252A CN108924252A CN201810856931.XA CN201810856931A CN108924252A CN 108924252 A CN108924252 A CN 108924252A CN 201810856931 A CN201810856931 A CN 201810856931A CN 108924252 A CN108924252 A CN 108924252A
- Authority
- CN
- China
- Prior art keywords
- block
- node
- catenary system
- chain network
- last
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9015—Buffering arrangements for supporting a linked list
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3297—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving time stamps, e.g. generation of time stamps
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of methods for mitigating node storage load in block catenary system, include the following steps：After block produces node acquisition task requests and executes, the memory node address of the block production last block of node inquiry when meeting block working condition；Self address and block Hash are sent to block production node by the memory node of last block；Block produces node and is packaged new block, and generates set of random numbers according to node total number, and set of random numbers is packaged as Web broadcast packet with new block and is broadcasted；After other nodes receive Web broadcast packet, the task in new block is parsed and executed to Web broadcast packet, judges that node whether is represented in random number is directed toward itself；If so, then being stored to new block；Correspondingly, the invention also discloses a kind of media and block catenary system, can be realized the node that random selection stores block, while guaranteeing block chained file integrality, mitigate the storage load of block catenary system interior joint.
Description
Technical field
Mitigate the side of node storage load the present invention relates to block chain technical field, in particular in a kind of block catenary system
Method, medium and block catenary system.
Background technique
Block chain because of its decentralization and goes to be widely deployed in each technical field due to the mode of trust, existing
In block catenary system, all history blocks in each node federation memory block chain, to guarantee the integrality of block chained file
And facilitate user query.However, this method when block chain reaches certain length, expends the storage resource of single node
It is very big.
Summary of the invention
The present invention is directed to solve one of the technical problem in above-mentioned technology at least to a certain extent.For this purpose, of the invention
One purpose is to propose to mitigate the method for node storage load in a kind of block catenary system, can be realized random selection to block
The node stored while guaranteeing block chained file integrality, mitigates the storage load of block catenary system interior joint.
Second object of the present invention is to propose a kind of computer readable storage medium.
Third object of the present invention is to propose a kind of block catenary system.
In order to achieve the above objectives, first aspect present invention embodiment, which proposes, mitigates node storage in a kind of block catenary system
The method of load, includes the following steps：When the node with block production permission any in block catenary system obtains task requests
And after executing, whether judgement currently meets block working condition；If meeting block working condition, there is block to produce permission for this
Node then to block chain network broadcast the last block of inquiry memory node address；The memory node of last block by itself ground
Location and block Hash information are sent to the node with block production permission；The node with block production permission will be last
The memory node address of block is compiled into address list, and with after the block Hash information of last block, last block timeline
Mission bit stream and timestamp be packaged into new block together, and generated according to the node total number in the block chain network random
Manifold is closed, and the set of random numbers and the new block are packaged as Web broadcast packet to carry out extensively to the block chain network
It broadcasts, wherein the number of the random number in the set of random numbers is less than or equal to node total number；When its in the block chain network
After his node receives the Web broadcast packet, the task in new block is parsed and executed to the Web broadcast packet, with
And the current node address table of the block chain network is inquired according to the set of random numbers after the completion of task execution, with judgement
Node whether is represented in random number is directed toward itself；If so, then the node stores new block.
Mitigate the method for node storage load in block catenary system according to an embodiment of the present invention, firstly, working as block linkwork
After any node with block production permission obtains task requests and executes in system, whether judgement currently meets block production item
Part；Then, if meeting block working condition, if this has the node of block production permission in the broadcast inquiry of block chain network
The memory node address of a block；Then, Self address and block Hash information are sent to this by the memory node of last block
Node with block production permission；Then, this has the node of block production permission by the memory node address of last block
Compile into address list, and with the mission bit stream and timestamp after the block Hash information of last block, last block timeline
It is packaged into new block together, and set of random numbers is generated according to the node total number in block chain network, and by set of random numbers
Web broadcast packet is packaged as to be broadcasted to block chain network with new block, wherein of the random number in set of random numbers
Number is less than or equal to node total number；Then, after other nodes in block chain network receive Web broadcast packet, to Web broadcast
Packet is parsed and is executed the task in new block, and inquires block link network according to set of random numbers after the completion of task execution
The current node address table of network, to judge that whether representing node in random number is directed toward itself；Then, if so, the then node
New block is stored；The node of memory block is randomly choosed to realize, and the node by being randomly selected
Block is stored, while guaranteeing block chained file integrality, mitigates the storage load of block catenary system interior joint.
In addition, the method for mitigating node storage load in the block catenary system proposed according to that above embodiment of the present invention may be used also
To have following additional technical characteristic：
Optionally, it keeps not repeating between random number, and the number of random number obtains according to the following formula：M=rounding（n/k）,
In, M is the number of random number, and n is node total number, and k is the default integer chosen according to the actual conditions of block chain network.
Optionally, the quantity of memory node and k value are in inverse correlation relationship.
Optionally, the also timing of each node in block chain network sends network inquiry packet to block chain network, with inquiry
In block chain network there is currently node, and current node address table and node total number are updated after obtaining the response returned.
Optionally, when judging that not representing node in random number is directed toward itself, which abandons new block.
In order to achieve the above objectives, second aspect of the present invention embodiment proposes a kind of computer readable storage medium, thereon
It is stored with the program for mitigating node storage load in block catenary system, mitigates the program of node storage load in the block catenary system
The method for mitigating node storage load in above-mentioned block catenary system is realized when being executed by processor.
In order to achieve the above objectives, third aspect present invention embodiment proposes a kind of block catenary system, including multiple nodes,
Wherein when the node with block production permission any in multiple nodes obtains task requests and executes, whether judgement is current full
Sufficient block working condition, and to the memory node of the block chain network broadcast last block of inquiry when meeting block working condition
Location；Self address and block Hash information are sent to the node with block production permission by the memory node of last block；
The node with block production permission compiles the memory node address of last block into address list, and the area with last block
Mission bit stream and timestamp after block Hash information, last block timeline are packaged into new block together, and according to described
Node total number in block chain network generates set of random numbers, and the set of random numbers and the new block are packaged as network
Broadcast packet to the block chain network to be broadcasted, wherein the number of the random number in the set of random numbers is less than or equal to
Node total number；After other nodes in the block chain network receive the Web broadcast packet, to the Web broadcast packet
The task in new block is parsed and executed, and the area is inquired according to the set of random numbers after the completion of task execution
The current node address table of block chain network, to judge that whether representing node in random number is directed toward itself；If so, the then node
New block is stored.
Block catenary system according to an embodiment of the present invention, including multiple nodes, wherein there is area when any in multiple nodes
When the node of block production permission obtains task requests and executes, whether judgement currently meets block working condition, and is meeting area
To the memory node address of the block chain network broadcast last block of inquiry when block working condition；The memory node of last block will be certainly
Body address and block Hash information are sent to the node with block production permission；The node with block production permission will
The memory node address of last block is compiled into address list, and with the block Hash information of last block, last block timeline
Mission bit stream and timestamp later is packaged into new block together, and is generated at random according to the node total number in block chain network
Manifold is closed, and set of random numbers and new block are packaged as Web broadcast packet to broadcast to block chain network, wherein random
The number of random number in manifold conjunction is less than or equal to node total number；When other nodes in block chain network receive Web broadcast
Bao Hou is parsed to Web broadcast packet and is executed the task in new block, and according to random number after the completion of task execution
The current node address table of collection query block chain network, to judge that whether representing node in random number is directed toward itself；If
Have, then the node stores new block；The node of memory block is randomly choosed to realize, and by selecting at random
The node selected out stores block, while guaranteeing block chained file integrality, mitigates depositing for block catenary system interior joint
Store up load.
In addition, the block catenary system proposed according to that above embodiment of the present invention can also have following additional technology special
Sign：
Optionally, it keeps not repeating between the random number, and the number of the random number obtains according to the following formula：M=rounding
（n/k）, wherein M is the number of the random number, and n is the node total number, and k is the practical feelings according to the block chain network
The default integer that condition is chosen.
Optionally, the also timing of each node in the multiple node sends network inquiry packet to the block chain network,
With in block chain network described in inquiry there is currently node, and obtain return response after update current node address table and
Node total number.
Optionally, when judging that not representing node in random number is directed toward itself, which abandons new block.
Detailed description of the invention
Fig. 1 is to be illustrated according to the process for mitigating the method that node stores load in the block catenary system of the embodiment of the present invention
Figure.
Specific embodiment
The embodiment of the present invention is described below in detail, examples of the embodiments are shown in the accompanying drawings, wherein from beginning to end
Same or similar label indicates same or similar element or element with the same or similar functions.Below with reference to attached
The embodiment of figure description is exemplary, it is intended to is used to explain the present invention, and is not considered as limiting the invention.
In existing block catenary system, all history blocks, this method exist in each node federation memory block chain
When block chain reaches certain length, the storage resource of single node is expended very big；The block linkwork that the embodiment of the present invention proposes
Mitigate the method for node storage load in system, firstly, when having the node of block production permission to get task requests and execute,
Then, when meeting block working condition, to the memory node address of the last block of block chain network inquiry, then, last area
Self address and block Hash information are sent to the node with block production permission, then, the tool by the memory node of block
There is the node of block production permission to compile the memory node address of last block into address list, and it is fast to be packaged new district, Yi Jigen
Set of random numbers is generated according to node total number, and set of random numbers is packaged as Web broadcast packet with new district fastly and is broadcasted；Then,
After other nodes receive Web broadcast packet, is parsed and judge that whether representing node in random number is directed toward itself, such as
Fruit has, then the node stores new district fastly；The node of memory block is randomly choosed to realize, and by random
The node selected stores block, while guaranteeing block chained file integrality, mitigates block catenary system interior joint
Store load.
In order to better understand the above technical scheme, the exemplary reality that the present invention will be described in more detail below with reference to accompanying drawings
Apply example.Although showing exemplary embodiment of the present invention in attached drawing, it being understood, however, that may be realized in various forms this hair
It is bright and should not be limited by the embodiments set forth herein.It is to be able to thoroughly understand this on the contrary, providing these embodiments
Invention, and the scope of the present invention can be fully disclosed to those skilled in the art.
In order to better understand the above technical scheme, in conjunction with appended figures and specific embodiments to upper
Technical solution is stated to be described in detail.
Fig. 1 is that the process for the method for mitigating node storage load in a kind of block catenary system of proposition of the embodiment of the present invention is shown
It is intended to, as shown in Figure 1, the method for mitigating node storage load in the block catenary system includes the following steps：
S101, after the node with block production permission any in block catenary system obtains task requests and executes, judgement is worked as
It is preceding whether to meet block working condition.
That is, after the node with block production permission any in block catenary system gets task requests,
Task requests are parsed and are executed, after executing to task requests, whether judgement currently meets block formation condition.
Wherein, block production permission refers to after meeting block working condition, after upper block timeline
Task is packaged as the permission of new block, it should be noted that and block produces there are many determination modes of permission, such as：Pos equity
Mode of proof, pow proof of work mode and dpos share authorisation verification mode；Therefore, herein not to block production permission
Method of determination is limited.
Wherein, there are many current modes for whether meeting block working condition of judgement, such as：When by default block production
Between, the node with block production permission after executing task requests, judge in current time and a upper block timestamp it
Between time difference whether be greater than the preset block production time；And it determines currently meet block production item when the judgment result is yes
Part；Alternatively, presetting the task amount threshold of each block, have the node of block production permission after executing task requests,
Judge whether the task quantity in a upper block after timeline reaches task amount threshold, and determines when the judgment result is yes
Currently meet block working condition.
S102, if meeting block working condition, this is broadcasted if having the node of block production permission to block chain network
The memory node address of the last block of inquiry.
That is, having the node of block production permission when judgement currently meets block working condition, then to block
Chain network broadcasts the memory node address of the last block of inquiry, to obtain the address set of the memory node of last block, after being convenient for
It is continuous that the address set of the memory node of last block is written to new block, so that any node is after obtaining new block, it can
The downloading of last block is carried out according to the address set of the memory node of the last block stored in block, and then in a recursive manner
Obtain entire block chained file.
S103, Self address and block Hash information are sent to this by the memory node of last block has block manufacturing right
The node of limit.
That is, memory node of the node with block production permission to the block chain network broadcast last block of inquiry
Address, after the memory node of last block receives the inquiry, Self address and block Hash information, which are sent to this, to be had
The node of block production permission.
S104, there is the node of block production permission to compile the memory node address of last block into address list for this, and
New district is packaged into together with the mission bit stream and timestamp after the block Hash information of last block, last block timeline
Block, and set of random numbers is generated according to the node total number in block chain network, and set of random numbers and new block are packaged as
Web broadcast packet to block chain network to be broadcasted, wherein the number of the random number in set of random numbers is less than or equal to node
Sum.
In other words, the Self address that the node with block production permission is sent in the memory node for receiving each last block
And after block Hash information, the memory node address of all last blocks is compiled into address list；And by the address list,
Mission bit stream and timestamp after the block Hash information of last block, last block timeline are packaged into new area together
Block；And set of random numbers is generated according to the node total number in block chain network, and set of random numbers and new block are packaged as
Web broadcast packet in block chain network to broadcast, wherein it is total that the number of the random number in set of random numbers is less than or equal to node
Number.
Wherein, there are many acquisition modes of node total number, for example, when block chain network is added in new node, by new node
The address addition such as node address table in block catenary system, and the node in block catenary system is controlled every preset time to block
Chain network sends heartbeat packet, with the current node address table of more new block chain network.
As an example, each node timing in block chain network sends network inquiry packet to block chain network, with
In inquiry block chain network there is currently node, and obtain return response after update current node address table and node it is total
Number.That is, the timing of each node to block chain network send network inquiry packet in inquiry block chain network there is currently
Node, other nodes return to confirmation message and own node address, when receiving the network inquiry packet to send net
The node of network inquiry packet updates current node address table according to the confirmation message received and own node address and node is total
Number.
Wherein, there are many generating algorithms of random number, for example, Monte carlo algorithm, Las Vegas algorithm, Sherwood are calculated
Method etc.；The generating algorithm of random number is not limited herein.
Wherein, there are many set-up modes of the generation number of random number, such as：Directly according to the node in block chain network
Sum, generating number is the random number less than or equal to node total number.
As an example, it keeps not repeating between random number, to guarantee that each random number all points to different nodes；With
The number of machine number obtains according to the following formula：M=rounding（n/k）, wherein M be random number number, n be block chain network in when
Front nodal point sum, k is the default integer chosen according to the actual conditions of block chain network, wherein there are many selection modes of k,
For example, according to the health value of node total number, each node in current block chain network（Hardware configuration information including each node,
The network rate of each node and each node tasks response time etc.）Carry out the selected of k value；Alternatively, according to current block link network
Task requests book carries out the selected of k value in node total number and preset period of time in network；Alternatively, according in current block chain network
Idle node number and block production frequency carry out the selected of k value；To prevent because of memory block by reasonably determining k value
The node of block is very few and causes block chain network unstable, the hair because the case where history block can not obtain caused by node exception
It is raw.
It should be noted that the quantity of memory node and k value are in inverse correlation relationship, that is to say, that k value is bigger, storage section
Point is fewer, and the node storage load in block catenary system is smaller, conversely, k value is smaller, memory node is bigger, in block catenary system
Node storage load it is bigger.
S105 parses Web broadcast packet after other nodes in block chain network receive Web broadcast packet
And the task in new block is executed, and prosthomere is worked as according to set of random numbers inquiry block chain network after the completion of task execution
Dot address table, to judge that whether representing node in random number is directed toward itself.
That is, after other nodes in block chain network receive Web broadcast packet, to Web broadcast packet into
Row parses and executes task therein, and after the completion of task execution, inquires working as block chain network according to set of random numbers
Front nodal point address table judges that node whether is represented in random number is directed toward itself, in other words, judges block link network where own node
The position of the current node address table of network whether be random number be directed toward position, with judge own node whether need to new block into
Row storage.
As an example, when generating the current node address table of block chain network, according to each in node address table
Node address is numbered, when other nodes in block chain network receive Web broadcast packet and to broadcast packet carry out parsing and
After executing task therein, judge the set of random numbers in Web broadcast packet whether include block chain network present node
The number of own node address in the table of location, and when the judgment result is yes, judge that node is represented in random number is directed toward itself.
S106, if so, then the node stores new block.
As an example, when the node judges that representing node in random number is directed toward itself, new block is deposited
Storage；When the node judges that not representing node in random number is directed toward itself, then the node abandons new block, not to new block
It is stored.
In conclusion mitigating the method for node storage load in block catenary system according to an embodiment of the present invention, firstly, working as
After any node with block production permission obtains task requests and executes in block catenary system, whether judgement currently meets area
Block working condition；Then, if meeting block working condition, this have block production permission node if it is wide to block chain network
Broadcast the memory node address of the last block of inquiry；Then, the memory node of last block is by Self address and block Hash information
It is sent to the node with block production permission；Then, this has the node of block production permission by the storage of last block
Node address is compiled into address list, and with the mission bit stream after the block Hash information of last block, last block timeline
New block is packaged into together with timestamp, and set of random numbers is generated according to the node total number in block chain network, and will be with
Machine manifold closes and with new block is packaged as Web broadcast packet to be broadcasted to block chain network, wherein in set of random numbers with
The number of machine number is less than or equal to node total number；Then, right after other nodes in block chain network receive Web broadcast packet
Web broadcast packet is parsed and is executed the task in new block, and is inquired after the completion of task execution according to set of random numbers
The current node address table of block chain network, to judge that whether representing node in random number is directed toward itself；Then, if so,
Then the node stores new block；The node of memory block is randomly choosed to realize, and passes through random selection
Node out stores block, while guaranteeing block chained file integrality, mitigates the storage of block catenary system interior joint
Load.
In order to realize above-described embodiment, the embodiment of the present invention proposes a kind of computer readable storage medium, stores thereon
There is the program for mitigating node storage load in block catenary system, the program for mitigating node storage load in the block catenary system is located
Reason device realizes the method for mitigating node storage load in above-mentioned block catenary system when executing.
In order to realize above-described embodiment, the embodiment of the present invention proposes a kind of block catenary system, which includes
Multiple nodes, wherein when the node with block production permission any in multiple nodes obtains task requests and executes, judgement
Currently whether meet block working condition, and when meeting block working condition to the block chain network broadcast last block of inquiry
Memory node address；Self address and block Hash information are sent to this by the memory node of last block has block manufacturing right
The node of limit；This with block production permission node the memory node address of last block is compiled into address list, and with it is upper
Mission bit stream and timestamp after the block Hash information of a block, last block timeline are packaged into new block together, with
And set of random numbers is generated according to the node total number in block chain network, and it is wide that set of random numbers with new block is packaged as network
Packet is broadcast to be broadcasted to block chain network, wherein the number of the random number in set of random numbers is less than or equal to node total number；When
After other nodes in block chain network receive Web broadcast packet, Web broadcast packet is parsed and is executed in new block
Task, and according to the current node address table of set of random numbers inquiry block chain network after the completion of task execution, with judgement
Node whether is represented in random number is directed toward itself；If so, then the node stores new block.
In conclusion block catenary system according to an embodiment of the present invention, including multiple nodes, wherein when appointing in multiple nodes
When one node with block production permission obtains task requests and executes, whether judgement currently meets block working condition, and
When meeting block working condition to the memory node address of the block chain network broadcast last block of inquiry；The storage of last block
Self address and block Hash information are sent to the node with block production permission by node；There is block to produce permission for this
Node the memory node address of last block is compiled into address list, and with the block Hash information of last block, last area
Mission bit stream and timestamp after block timeline are packaged into new block together, and according to the node total number in block chain network
It generates set of random numbers, and set of random numbers and new block is packaged as Web broadcast packet to broadcast to block chain network,
Wherein, the number of the random number in set of random numbers is less than or equal to node total number；When other nodes in block chain network receive
To after Web broadcast packet, Web broadcast packet is parsed and executes the task in new block, and after the completion of task execution
The current node address table of block chain network is inquired according to set of random numbers, is directed toward with judging whether to represent node in random number
Itself；If so, then the node stores new block；The node of memory block is randomly choosed to realize, and
Block is stored by the node being randomly selected, while guaranteeing block chained file integrality, mitigates block catenary system
The storage load of interior joint.
In some embodiments, it in the block catenary system that the embodiment of the present invention proposes, keeps not repeating between random number, and
The number of random number obtains according to the following formula：M=rounding（n/k）, wherein M is the number of random number, and n is node total number, and k is
The default integer chosen according to the actual conditions of block chain network.
In some embodiments, in the block catenary system that the embodiment of the present invention proposes, each node in multiple nodes is also
Timing sends network inquiry packet to block chain network, in inquiry block chain network there is currently node, and returned
Response after update current node address table and node total number.
In some embodiments, in the block catenary system that the embodiment of the present invention proposes, when judging not represent in random number
When node is directed toward itself, which abandons new block.
It should be understood by those skilled in the art that, the embodiment of the present invention can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the present invention
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the present invention, which can be used in one or more,
Usable storage medium（Including but not limited to magnetic disk storage, CD-ROM, optical memory etc.）The computer program of upper implementation produces
The form of product.
The present invention be referring to according to the method for the embodiment of the present invention, equipment（System）And the process of computer program product
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
It should be noted that in the claims, any reference symbol between parentheses should not be configured to power
The limitation that benefit requires.Word "comprising" does not exclude the presence of component or step not listed in the claims.Before component
Word "a" or "an" does not exclude the presence of multiple such components.The present invention can be by means of including several different components
It hardware and is realized by means of properly programmed computer.In the unit claims listing several devices, these are filled
Several in setting, which can be, to be embodied by the same item of hardware.The use of word first, second, and third is not
Indicate any sequence.These words can be construed to title.
Although preferred embodiments of the present invention have been described, it is created once a person skilled in the art knows basic
Property concept, then additional changes and modifications may be made to these embodiments.So it includes excellent that the following claims are intended to be interpreted as
It selects embodiment and falls into all change and modification of the scope of the invention.
Obviously, various changes and modifications can be made to the invention without departing from essence of the invention by those skilled in the art
Mind and range.In this way, if these modifications and changes of the present invention belongs to the range of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to include these modifications and variations.
In the description of the present invention, it is to be understood that, term " first ", " second " are used for description purposes only, and cannot
It is interpreted as indication or suggestion relative importance or implicitly indicates the quantity of indicated technical characteristic.Define as a result, " the
One ", the feature of " second " can explicitly or implicitly include one or more of the features.In the description of the present invention,
The meaning of " plurality " is two or more, unless otherwise specifically defined.
In the present invention unless specifically defined or limited otherwise, term " installation ", " connected ", " connection ", " fixation " etc.
Term shall be understood in a broad sense, for example, it may be being fixedly connected, may be a detachable connection, or integral；It can be mechanical connect
It connects, is also possible to be electrically connected；It can be directly connected, can also can be in two elements indirectly connected through an intermediary
The interaction relationship of the connection in portion or two elements.It for the ordinary skill in the art, can be according to specific feelings
Condition understands the concrete meaning of above-mentioned term in the present invention.
In the present invention unless specifically defined or limited otherwise, fisrt feature in the second feature " on " or " down " can be with
It is that the first and second features directly contact or the first and second features pass through intermediary mediate contact.Moreover, fisrt feature exists
Second feature " on ", " top " and " above " but fisrt feature be directly above or diagonally above the second feature, or be merely representative of
First feature horizontal height is higher than second feature.Fisrt feature can be under the second feature " below ", " below " and " below "
One feature is directly under or diagonally below the second feature, or is merely representative of first feature horizontal height less than second feature.
In the description of this specification, reference term " one embodiment ", " some embodiments ", " example ", " specifically show
The description of example " or " some examples " etc. means specific features, structure, material or spy described in conjunction with this embodiment or example
Point is included at least one embodiment or example of the invention.In the present specification, schematic expression of the above terms are not
It is interpreted as that identical embodiment or example must be directed to.Moreover, particular features, structures, materials, or characteristics described
It may be combined in any suitable manner in any one or more of the embodiments or examples.In addition, without conflicting with each other, this
The technical staff in field can be by the spy of different embodiments or examples described in this specification and different embodiments or examples
Sign is combined.
Although the embodiments of the present invention has been shown and described above, it is to be understood that above-described embodiment is example
Property, it is not considered as limiting the invention, those skilled in the art within the scope of the invention can be to above-mentioned
Embodiment is changed, modifies, replacement and variant.
Claims (10)
1. mitigating the method for node storage load in a kind of block catenary system, which is characterized in that include the following steps：
After the node with block production permission any in block catenary system obtains task requests and executes, judgement it is current whether
Meet block working condition；
If meeting block working condition, the last area of inquiry is broadcasted to block chain network if this has the node of block production permission
The memory node address of block；
Self address and block Hash information are sent to the node with block production permission by the memory node of last block；
This with block production permission node the memory node address of last block is compiled into address list, and with last block
Block Hash information, the mission bit stream after last block timeline and timestamp be packaged into new block together, and according to
Node total number in the block chain network generates set of random numbers, and the set of random numbers and the new block are packaged as
Web broadcast packet to the block chain network to be broadcasted, wherein the number of the random number in the set of random numbers is less than
Equal to node total number；
After other nodes in the block chain network receive the Web broadcast packet, the Web broadcast packet is solved
The task in new block is analysed and executed, and the block link network is inquired according to the set of random numbers after the completion of task execution
The current node address table of network, to judge that whether representing node in random number is directed toward itself；
If so, then the node stores new block.
2. mitigating the method for node storage load in block catenary system as described in claim 1, which is characterized in that described random
It keeps not repeating between number, and the number of the random number obtains according to the following formula：
M=rounding（n/k）, wherein M is the number of the random number, and n is the node total number, and k is according to the block link network
The default integer that the actual conditions of network are chosen.
3. mitigating the method for node storage load in block catenary system as claimed in claim 2, which is characterized in that memory node
Quantity and k value be in inverse correlation relationship.
4. mitigating the method for node storage load in block catenary system as claimed in any one of claims 1-3, feature exists
In each node also timing in the block chain network sends network inquiry packet to the block chain network, described in inquiry
In block chain network there is currently node, and current node address table and node total number are updated after obtaining the response returned.
5. in block catenary system as described in claim 1 mitigate node storage load method, which is characterized in that when judge with
When not representing node in machine number and being directed toward itself, which abandons new block.
6. a kind of computer readable storage medium, which is characterized in that it is negative to be stored thereon with mitigation node storage in block catenary system
The program of lotus mitigates in the block catenary system when program of node storage load is executed by processor and realizes such as claim 1-5
Any one of described in block catenary system in mitigate node storage load method.
7. a kind of block catenary system, which is characterized in that including multiple nodes, wherein
When the node with block production permission any in multiple nodes obtains task requests and executes, whether judgement is current full
Sufficient block working condition, and to the memory node of the block chain network broadcast last block of inquiry when meeting block working condition
Location；
Self address and block Hash information are sent to the node with block production permission by the memory node of last block；
This with block production permission node the memory node address of last block is compiled into address list, and with last block
Block Hash information, the mission bit stream after last block timeline and timestamp be packaged into new block together, and according to
Node total number in the block chain network generates set of random numbers, and the set of random numbers and the new block are packaged as
Web broadcast packet to the block chain network to be broadcasted, wherein the number of the random number in the set of random numbers is less than
Equal to node total number；
After other nodes in the block chain network receive the Web broadcast packet, the Web broadcast packet is solved
The task in new block is analysed and executed, and the block link network is inquired according to the set of random numbers after the completion of task execution
The current node address table of network, to judge that whether representing node in random number is directed toward itself；
If so, then the node stores new block.
8. block catenary system as claimed in claim 7, which is characterized in that keep not repeating between the random number, and described
The number of random number obtains according to the following formula：
M=rounding（n/k）, wherein M is the number of the random number, and n is the node total number, and k is according to the block link network
The default integer that the actual conditions of network are chosen.
9. block catenary system as claimed in claim 7 or 8, which is characterized in that each node in the multiple node is also fixed
When to the block chain network send network inquiry packet, in block chain network described in inquiry there is currently node, and obtaining
Current node address table and node total number are updated after the response that must be returned.
10. block catenary system as claimed in claim 7 or 8, which is characterized in that when judging that not representing node in random number refers to
When to itself, which abandons new block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810856931.XA CN108924252B (en) | 2018-07-31 | 2018-07-31 | Method, medium, and blockchain system for reducing storage load of nodes in blockchain system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810856931.XA CN108924252B (en) | 2018-07-31 | 2018-07-31 | Method, medium, and blockchain system for reducing storage load of nodes in blockchain system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108924252A true CN108924252A (en) | 2018-11-30 |
| CN108924252B CN108924252B (en) | 2021-06-04 |
Family
ID=64393371
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810856931.XA Active CN108924252B (en) | 2018-07-31 | 2018-07-31 | Method, medium, and blockchain system for reducing storage load of nodes in blockchain system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108924252B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109714398A (en) * | 2018-12-11 | 2019-05-03 | 新华三技术有限公司 | Date storage method and device |
| CN110009180A (en) * | 2019-01-23 | 2019-07-12 | 曲阜师范大学 | A kind of block chain JIT production management method |
| CN110321723A (en) * | 2019-07-08 | 2019-10-11 | 白静 | A kind of block chain security information processing system and method, electronic equipment, medium |
| CN110427763A (en) * | 2019-07-24 | 2019-11-08 | 上海朝夕网络技术有限公司 | A kind of common recognition method based on the predefined distributed system for executing code |
| CN110851448A (en) * | 2019-11-08 | 2020-02-28 | 四川长虹电器股份有限公司 | Local data storage optimization method based on block chain intelligent contract |
| CN110990490A (en) * | 2019-12-19 | 2020-04-10 | 北京海益同展信息科技有限公司 | Method, device, equipment and medium for posting block chain in block chain network |
| CN113672680A (en) * | 2021-07-19 | 2021-11-19 | 哈尔滨工业大学（深圳） | Lightweight probability verification method and device in block chain, block chain node and medium |
| CN113867690A (en) * | 2021-12-07 | 2021-12-31 | 中移(上海)信息通信科技有限公司 | Generation method and device of random number in block chain and block chain link point |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106713412A (en) * | 2016-11-09 | 2017-05-24 | 弗洛格（武汉）信息科技有限公司 | Block chain system and construction method of block chain system |
| CN107079059A (en) * | 2016-12-21 | 2017-08-18 | 深圳前海达闼云端智能科技有限公司 | Block chain storage method and device and node equipment |
| CN107122477A (en) * | 2017-05-02 | 2017-09-01 | 成都中远信电子科技有限公司 | A kind of block chain storage system |
| CN107657438A (en) * | 2017-09-18 | 2018-02-02 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
| US20180089760A1 (en) * | 2016-09-26 | 2018-03-29 | Shapeshift Ag | System and method of providing a multi-asset rebalancing mechanism |
-
2018
- 2018-07-31 CN CN201810856931.XA patent/CN108924252B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180089760A1 (en) * | 2016-09-26 | 2018-03-29 | Shapeshift Ag | System and method of providing a multi-asset rebalancing mechanism |
| CN106713412A (en) * | 2016-11-09 | 2017-05-24 | 弗洛格（武汉）信息科技有限公司 | Block chain system and construction method of block chain system |
| CN107079059A (en) * | 2016-12-21 | 2017-08-18 | 深圳前海达闼云端智能科技有限公司 | Block chain storage method and device and node equipment |
| CN107122477A (en) * | 2017-05-02 | 2017-09-01 | 成都中远信电子科技有限公司 | A kind of block chain storage system |
| CN107657438A (en) * | 2017-09-18 | 2018-02-02 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
Non-Patent Citations (2)
| Title |
|---|
| MINGJUN DAI等: ""A Low Storage Room Requirement Framework for Distributed Ledger in Blockchain"", 《IEEE ACCESS》 * |
| 于雷，金岩: ""区块链全局账本数据的拆分技术研究"", 《高技术通讯》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109714398A (en) * | 2018-12-11 | 2019-05-03 | 新华三技术有限公司 | Date storage method and device |
| CN110009180A (en) * | 2019-01-23 | 2019-07-12 | 曲阜师范大学 | A kind of block chain JIT production management method |
| CN110009180B (en) * | 2019-01-23 | 2020-12-22 | 曲阜师范大学 | A blockchain-based just-in-time production control method |
| CN110321723A (en) * | 2019-07-08 | 2019-10-11 | 白静 | A kind of block chain security information processing system and method, electronic equipment, medium |
| CN110427763A (en) * | 2019-07-24 | 2019-11-08 | 上海朝夕网络技术有限公司 | A kind of common recognition method based on the predefined distributed system for executing code |
| CN110427763B (en) * | 2019-07-24 | 2021-07-23 | 上海朝夕网络技术有限公司 | Consensus method of distributed system based on predefined execution codes |
| CN110851448A (en) * | 2019-11-08 | 2020-02-28 | 四川长虹电器股份有限公司 | Local data storage optimization method based on block chain intelligent contract |
| CN110851448B (en) * | 2019-11-08 | 2022-05-03 | 四川长虹电器股份有限公司 | Local data storage optimization method based on block chain intelligent contract |
| CN110990490A (en) * | 2019-12-19 | 2020-04-10 | 北京海益同展信息科技有限公司 | Method, device, equipment and medium for posting block chain in block chain network |
| CN110990490B (en) * | 2019-12-19 | 2023-09-01 | 京东科技信息技术有限公司 | Method, device, equipment and medium for checking in blockchain network |
| CN113672680A (en) * | 2021-07-19 | 2021-11-19 | 哈尔滨工业大学（深圳） | Lightweight probability verification method and device in block chain, block chain node and medium |
| CN113867690A (en) * | 2021-12-07 | 2021-12-31 | 中移(上海)信息通信科技有限公司 | Generation method and device of random number in block chain and block chain link point |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108924252B (en) | 2021-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108924252A (en) | Mitigate method, medium and the block catenary system of node storage load in block catenary system | |
| Beck et al. | Texture-based heuristics for scheduling revisited | |
| US9916250B2 (en) | Method for using service level objectives to dynamically allocate cache resources among competing workloads | |
| JP6380110B2 (en) | Resource control system, control pattern generation device, control device, resource control method, and program | |
| Poppenborg et al. | A flow-based tabu search algorithm for the RCPSP with transfer times | |
| Nelson et al. | Spatial TDMA: A collision-free multihop channel access protocol | |
| US8819653B2 (en) | Automated improvement of executable applications based on evaluating independent execution heuristics | |
| CN105207947B (en) | A kind of gradual traffic scheduling method and system of filtering shake | |
| Fernandez et al. | Communication and computation in distributed CSP algorithms | |
| KR20200062887A (en) | Apparatus and method for assuring quality of control operations of a system based on reinforcement learning. | |
| JPWO2016189926A1 (en) | Information processing apparatus, information processing method, information processing program, and information processing system | |
| Bansal et al. | Weighted k-server bounds via combinatorial dichotomies | |
| Frangioni et al. | Delay-constrained shortest paths: approximation algorithms and second-order cone models | |
| JP2009541876A (en) | System real-time performance evaluation method | |
| Tiourine et al. | Local search algorithms for the radio link frequency assignment problem | |
| JP2015060566A (en) | Work plan scheduling apparatus and method thereof | |
| US20100103932A1 (en) | Data distribution apparatus, relay apparatus and data distribution method | |
| KR102165763B1 (en) | Apparatus and method for checking completion status of service control | |
| CN106407636A (en) | Integration result statistics method and apparatus | |
| CN108600147A (en) | A kind of speed of download prediction technique and device | |
| Montemanni et al. | An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem | |
| Neogy et al. | A reliable service discovery protocol using mobile agents in MANET | |
| CN106131129B (en) | The method and apparatus of management data synchronization time of global load balancing | |
| JP2013037593A (en) | Equipment management device, equipment management method and equipment management program | |
| Larson et al. | Using performance profile trees to improve deliberation control |
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 | ||
| CP03 | Change of name, title or address |
Address after: 361000 B1F-065, Zone A, Huaxun Building, Software Park, Xiamen Torch Hi-tech Zone, Huli District, Xiamen City, Fujian Province Patentee after: Ke'an (Xiamen) Technology Co.,Ltd. Address before: B1f-065, zone a, Huaxun building, software park, torch hi tech Zone, Xiamen City, Fujian Province, 361000 Patentee before: TAILIAN (XIAMEN) TECHNOLOGY Co.,Ltd. |
|
| CP03 | Change of name, title or address |