CN110471922A - Expansion of content method, equipment and the computer readable storage medium of accounting nodes - Google Patents
Expansion of content method, equipment and the computer readable storage medium of accounting nodes Download PDFInfo
- Publication number
- CN110471922A CN110471922A CN201910732883.8A CN201910732883A CN110471922A CN 110471922 A CN110471922 A CN 110471922A CN 201910732883 A CN201910732883 A CN 201910732883A CN 110471922 A CN110471922 A CN 110471922A
- Authority
- CN
- China
- Prior art keywords
- data content
- accounting nodes
- data
- remainder
- block
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Engineering & Computer Science (AREA)
- 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)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the present invention provides expansion of content method, equipment and the computer readable storage medium of a kind of accounting nodes.Wherein accounting nodes generate a random number for each data content in multiple first data contents of storage respectively；Using preset algorithm, each first data content and corresponding random number are handled, the second data content is obtained；And recycle execution and count to the step of obtaining the second data content at random by generating, until obtaining the data content of predetermined number；When the quantity of data content in accounting nodes reaches the storage cap of accounting nodes, third data content to be stored, then delete one or more second data contents if it exists, to vacate memory space storage third data content.Scheme provided in an embodiment of the present invention can extend the quantity of accounting nodes storing data content, how much be the fairness and enthusiasm for improving accounting nodes in the scene for judge book keeping operation right and obtaining book keeping operation power with storing data.
Description
Technical field
The present embodiments relate to expansion of content method, the equipment of field of communication technology more particularly to a kind of accounting nodes
And computer readable storage medium.
Background technique
In the related art, the common recognition mechanism based on storage content that there are a kind of on block chain, i.e., in the multiple of block chain
The content that who is stored in accounting nodes is more, and the probability who obtains book keeping operation power is just high.But the block chain early stage of development or some
In the case that accounting nodes do not have more storage chance, the content of accounting nodes storage is limited.Those book keeping operations are thus deprived
The right and enthusiasm of node contention book keeping operation are also unfavorable for the development of block chain, and in the content of multiple accounting nodes storage
The identical situation of quantity under, also will increase the probability to collide between node.
Summary of the invention
The embodiment of the present invention provides a kind of Transaction Information recording method, equipment and computer readable storage medium, to expand
How much the quantity for opening up accounting nodes storing data content is being that book keeping operation section is improved in the scene for judge book keeping operation right with storing data
Point obtains the fairness and enthusiasm of book keeping operation power.
In a first aspect, the embodiment of the present invention provides a kind of expansion of content method of accounting nodes, this method comprises:
Accounting nodes generate one at random for each data content in multiple first data contents of storage respectively
Number；
The accounting nodes use preset algorithm, handle each first data content and corresponding random number, obtain
To the second data content；
The accounting nodes circulation, which is executed, counts to the step of obtaining second data content at random by generating, until obtaining
Until the data content of predetermined number；
When the quantity of data content in the accounting nodes reaches the storage cap of the accounting nodes, if it exists to
The third data content of storage, then the accounting nodes delete one or more second data contents, empty to vacate storage
Between store the third data content.
Second aspect, the embodiment of the present invention provide a kind of accounting nodes, comprising:
Memory；
Processor；
Communication interface；And
Computer program；
Wherein, the computer program stores in the memory, and is configured as being executed by the processor following
Operation:
For each data content in multiple first data contents of storage, a random number is generated respectively；
Using preset algorithm, each first data content and corresponding random number are handled, obtained in the second data
Hold；
Circulation, which is executed, counts to the step of obtaining second data content at random by generating, until obtaining the number of predetermined number
Until content；
When the quantity of data content reaches storage cap, third data content to be stored, then delete one if it exists
Or multiple second data contents, the third data content is stored to vacate memory space.
The third aspect, the embodiment of the present invention provide a kind of computer readable storage medium, are stored thereon with computer program,
The computer program is executed by processor to realize method described in first aspect.
Expansion of content method, equipment and the computer readable storage medium of accounting nodes provided in an embodiment of the present invention lead to
Overregistering node generates a random number for each data content in multiple first data contents of storage respectively；Then
Using preset algorithm, each first data content and corresponding random number are handled, obtain the second data content, and recycle
It executes and counts to the step of obtaining second data content at random by generating, until obtaining the data content of predetermined number；
And the quantity of the data content in storage is when reaching storage cap, third data content to be stored if it exists, delete one or
Multiple second data contents, to vacate memory space storage third data content, so that the embodiment of the present invention can reach
The purpose of data content in accounting nodes is extended, and how much is being to judge in the scene for keeping accounts right with storing data, it can
Improve fairness and enthusiasm that accounting nodes obtain book keeping operation power.
Detailed description of the invention
Fig. 1 is a kind of schematic diagram of application scenarios provided in an embodiment of the present invention；
Fig. 2 is the expansion of content method flow diagram of accounting nodes provided in an embodiment of the present invention；
Fig. 3 is Transaction Information recording method flow chart provided in an embodiment of the present invention；
Fig. 4 be another embodiment of the present invention provides Transaction Information recording method flow chart
Fig. 5 is the structural schematic diagram of accounting nodes provided in an embodiment of the present invention.
Through the above attached drawings, it has been shown that the specific embodiment of the disclosure will be hereinafter described in more detail.These attached drawings
It is not intended to limit the scope of this disclosure concept by any means with verbal description, but is by referring to specific embodiments
Those skilled in the art illustrate the concept of the disclosure.
Specific embodiment
Example embodiments are described in detail here, and the example is illustrated in the accompanying drawings.Following description is related to
When attached drawing, unless otherwise indicated, the same numbers in different drawings indicate the same or similar elements.Following exemplary embodiment
Described in embodiment do not represent all implementations consistent with this disclosure.On the contrary, they be only with it is such as appended
The example of the consistent device and method of some aspects be described in detail in claims, the disclosure.
The expansion of content method of accounting nodes provided in an embodiment of the present invention, can be adapted for communication system shown in FIG. 1.
As shown in Figure 1, the communication system includes: user node, accounting nodes, cloud storage node 1, cloud storage node 2, cloud storage node
3, cloud storage node 4, cloud storage node 5.Wherein, user node, accounting nodes, cloud storage node 1, cloud storage node 2, Yun Cun
Storage node 3, cloud storage node 4, cloud storage node 5 are the participation nodes in block chain network.It is appreciated that only illustrate herein
Property explanation, do not limit the node number and type in the block chain network.Wherein, cloud storage node can be one either
Multiple cloud servers, cloud server i.e. Cloud Server are a server clusters, there is many servers and general
Computer architecture it is similar, the composition of cloud server includes processor, hard disk, memory, system bus etc..User node is specific
It can be user terminal, for example, smart phone, tablet computer, personal computer etc..
The expansion of content method of accounting nodes provided in an embodiment of the present invention, it is intended to which the technology as above for solving the prior art is asked
Topic.
How to be solved with technical solution of the specifically embodiment to technical solution of the present invention and the application below above-mentioned
Technical problem is described in detail.These specific embodiments can be combined with each other below, for the same or similar concept
Or process may repeat no more in certain embodiments.Below in conjunction with attached drawing, the embodiment of the present invention is described.
Fig. 2 is the expansion of content method flow diagram of accounting nodes provided in an embodiment of the present invention, as shown in Fig. 2, this implementation
Example is extended the content of accounting nodes based on following methods:
Step 101, accounting nodes generate one for each data content in multiple first data contents of storage respectively
A random number.
In the present embodiment, the data that user node can be to be stored are stored to multiple cloud storage nodes, the user
Node can also sign to the cryptographic Hash of the data to be stored using the private key of oneself, and the cryptographic Hash after signature is broadcasted
Into the block chain network.Accounting nodes in the present embodiment can be the node that block book keeping operation is participated in the block chain network,
Alternatively, the accounting nodes are also possible to the cloud storage node in the block chain network.In the present embodiment, accounting nodes not only have
The function of having block chain to keep accounts also has the function of data storage.
There are multiple accounting nodes in block chain network in the scene of the present embodiment, multiple accounting nodes grab block chain
The book keeping operation of account book is weighed, and the probability of whose more acquisition book keeping operation power of the data content that who is stored in multiple accounting nodes is bigger.
In order to guarantee that the less accounting nodes of storing data content obtain the equity of book keeping operation power, the present embodiment by generate with
Machine data are extended based on quantity of the random number to the data content that accounting nodes store.
Wherein, in the operation for generating random number, accounting nodes be current stored each data content (hereinafter referred to as
First data content) random number is generated, wherein the first data content can be the data content of user node storage, it can also
To be the second data content extended before current extensions operation using the present embodiment method.
Step 102, the accounting nodes use preset algorithm, carry out to each first data content and corresponding random number
Processing, obtains the second data content.
As an example it is assumed that data 1 are stored in current accounting nodes, the random number generated in a step 101 for data 1
For random number 1, then it to be f (data 1, random number 1) that the second obtained data content is extended based on data 1 and random number 1, or
Person f (data 1, random number 1, the mark of user node 1)；Wherein function f () is preset algorithm, and data 1 are user's section
Point 1 is stored in block chain network, that is to say, that in one embodiment, accounting nodes can be based on preset algorithm pair
Each first data content, store first data content user node mark and corresponding random number handled,
Obtain the second data content, wherein if the data that the first data content sheet is obtained as extension, then the first data content is corresponding
The mark of user node can be the mark of user node corresponding to the corresponding initial data of the first data content.
Step 103, accounting nodes circulation execute and count to the step of obtaining second data content at random by generating,
Until obtaining the data content of predetermined number.
Wherein, in one embodiment, predetermined number can be the fixed value of any setting in the present embodiment, i.e., not
By extended operation several times is executed, the value of predetermined number is fixed and invariable, for example fixed value n, n are positive integer, that is to say, that with
Predetermined number setting value it is different, the number of the data content of the present embodiment extension can be different, or can be described as any
's.
In another embodiment, the so-called predetermined number of the present embodiment is also possible to the value of variation, for example is executing
It, can be according to the quantity and accounting nodes of currently stored data content itself memory space after the operation of complete one extension
The upper limit determines the value of predetermined number that extended operation next time is applicable in.
In above two mode, the number since extended operation to the data content of extension reaches predetermined number and is
Only, it is operated for one extension.
When step 104, the quantity of data content in the accounting nodes reach the storage cap of the accounting nodes,
Third data content to be stored if it exists, then the accounting nodes delete one or more second data contents, with sky
Memory space stores the third data content out.
Expansion of content method, equipment and the computer readable storage medium of accounting nodes provided in this embodiment, pass through note
Account node generates a random number for each data content in multiple first data contents of storage respectively；Then it uses
Preset algorithm handles each first data content and corresponding random number, obtains the second data content, and recycles execution
The step of obtaining second data content is counted at random by generating, until obtaining the data content of predetermined number；And
When the quantity of the data content of storage reaches storage cap, third data content to be stored, is deleted one or more if it exists
Second data content, to vacate memory space storage third data content, so that the present embodiment can reach extension book keeping operation
The purpose of data content in node, and how much be that can be improved book keeping operation in the scene for judging book keeping operation right with storing data
Node obtains the fairness and enthusiasm of book keeping operation power.
Fig. 3 is Transaction Information recording method flow chart provided in an embodiment of the present invention.As shown in figure 3, being mentioned in Fig. 2 embodiment
On the basis of the expansion of content method of confession, the embodiment of the invention also provides Transaction Information recording method, this method specific steps
It is as follows:
Step 201, accounting nodes determine a number N according to the cryptographic Hash of a block upper in block chain network.
In practice, the block in block chain account book is end to end, i.e., record has a upper block in current block
Information, for example, record has the cryptographic Hash of a upper block in current block.
By taking an accounting nodes as an example, which can be true according to the cryptographic Hash of a block upper in the block chain network
A number N is made, for example, the accounting nodes can take out the 5th byte on this in cryptographic Hash of block, and according to
Bit value in 5th byte calculates number N according to the algorithm made an appointment.
Step 202, the accounting nodes determine the n-th data of each data content in multiple data contents of its storage
Block.
In the present embodiment, each accounting nodes have data storage function, correspondingly, an accounting nodes can store
There are multiple data contents, multiple data content can be the data uploaded from different user node.Assuming that some is remembered
Account node is stored with 3 data contents, for example, data content 1, data content 2 and data content 3.The accounting nodes respectively from
Data content 1, data content are according to extraction n-th data block, i.e. the n-th data block of data content 1, number in 2 and data content 3
According to the n-th data block of content 2 and the n-th data block of data content 3.In the present embodiment, the size of each data block can
To be 256 bytes, alternatively, the size of each data block can be certain fixed quantity of Uniform provisions in block chain network
Byte.
Step 203, the accounting nodes calculate the corresponding data of n-th data block of each data content divided by area
Remainder after block chain difficulty value.
When the accounting nodes extract the n-th data block, the n-th data block of data content 2 and data of data content 1
After the n-th data block of content 3, the corresponding data of n-th data block of data content 1 can be further calculated divided by block
The corresponding data of n-th data block of remainder, data content 2 after chain difficulty value are divided by more than after block chain difficulty value
It counts, the corresponding data of n-th data block of data content 3 are divided by the remainder after block chain difficulty value.The remainder represents
Time phase Deadline.The expiration time, which refers to from a upper block, generates the moment to the time the new block generation moment
Interval.Optionally, the value of remainder is equal to the value of the Deadline, and the unit of the Deadline can be millisecond or second.
Step 204, the accounting nodes determine the minimum remainder in the corresponding remainder of the multiple data content.
Further, which determines data content 1, data content 2, in the corresponding remainder of data content 3
Minimum remainder.Assuming that the corresponding data of n-th data block of data content 3 are data divided by the remainder after block chain difficulty value
Content 1, data content 2, the minimum remainder in the corresponding remainder of data content 3.Assuming that the minimum remainder is 23, then this is most
The corresponding expiration time Deadline of small remainder be 23 milliseconds or second.
The preset time of step 205, the accounting nodes after a upper block generates generates new block, described
Preset time is corresponding with the minimum remainder.
For example, the accounting nodes can generate new block behind 23 seconds after the generation of a upper block.
Optionally, preset time of the accounting nodes after a upper block generates generates new block, comprising:
In the preset time after a upper block generates, if other accounting nodes do not determine minimum remainder, the note
Account node generates new block.
For example, the accounting nodes more than one in block chain network, other accounting nodes are also stored in multiple data
Hold, and multiple data contents that other accounting nodes also find oneself storage using method as described above are corresponding
Minimum remainder in remainder.
For example, behind 23 seconds after the generation of a upper block, if other accounting nodes do not calculate it is smaller than 23
Remainder, then the new block generates successfully.That is, each accounting nodes can calculate the more of oneself storage
The corresponding minimum remainder of a data content.And each calculated minimum remainder of accounting nodes may be also not identical, thus may be used
To determine that the calculated minimum remainder of which accounting nodes is the smallest.Therefore, more than the calculated minimum of which accounting nodes
Number is minimum, which can successfully create a new block.For theoretically, if the storage of some accounting nodes
Data are more, then the accounting nodes search out minimum remainder probability it is bigger.Therefore, accounting nodes are in order to calculating minimum
Remainder to successfully create new block, and obtains the book keeping operation power of the new block, which just needs to store more numbers
According to so just there is a greater chance that calculating minimum remainder.Therefore, the method through this embodiment, can promote each
Accounting nodes actively provide more storage services for the block chain network.
Further, accounting nodes needs submit corresponding evidence in block chain network after new block generates
(cryptographic Hash including original data content, or if it is extension content, then submit simultaneously for generates extend content with
Machine number), other nodes in block chain network find corresponding original data content, N according to the evidence that accounting nodes are submitted
A data block and random number etc. verify the minimum remainder determined in step 204, if being proved to be successful, accounting nodes can
Keep accounts in the new block.
Step 206, the accounting nodes record Transaction Information on the new block.
The accounting nodes can record Transaction Information in the new block.
The embodiment of the present invention determines one according to the cryptographic Hash of a block upper in block chain network by accounting nodes
Digital N determines the n-th data block of each data content in multiple data contents of its storage, calculates in each data
The corresponding data of n-th data block of appearance further, determine in the multiple data divided by the remainder after block chain difficulty value
Hold the minimum remainder in corresponding remainder, the minimum remainder is related to the expiration time that new block generates, theoretically for,
If the data of some accounting nodes storage are more, the probability which searches out minimum remainder is bigger.Therefore, it keeps accounts
Node is in order to calculate minimum remainder, to successfully create new block, and obtains the book keeping operation power of the new block, the book keeping operation
Node just needs to store more data, so just there is a greater chance that calculating minimum remainder.Therefore, institute through this embodiment
The method stated can promote each accounting nodes actively to provide more storage services for the block chain network, improve book keeping operation
The resource utilization of node.
Fig. 4 be another embodiment of the present invention provides Transaction Information recording method flow chart.On the basis of above-described embodiment
On, the accounting nodes after the preset time after a upper block generates generates new block, also wrap by the method
Include following steps:
The minimum remainder is sent to time stamp server by step 301, the accounting nodes, by the time-stamping service
Device gives the minimum remainder to identify upper timestamp, and using the private key of the time stamp server to the upper timestamp of mark
The minimum remainder is signed.
When some accounting nodes finds minimum remainder i.e. minimum Deadline and generates new block, the accounting nodes
It needs to stamp timestamp to the minimum remainder by time stamp server immediately.If accounting nodes are found most there are two or more
Small remainder is identical, then is subject to the earliest minimum remainder of the timestamp stamped.
For example, when some accounting nodes finds minimum remainder i.e. minimum Deadline and generates new block, the note
Account node sends the minimum remainder to time stamp server immediately.When the time stamp server receives the minimum remainder, give
The minimum remainder identifies upper timestamp, and using the private key of the time stamp server to described in the timestamp in the mark most
Small remainder is signed.Further, the time stamp server is by the minimum remainder of timestamp described in the mark after signature
It is sent to the accounting nodes.
Step 302, the accounting nodes receive the time in the mark after the signature that the time stamp server is sent
The minimum remainder of stamp.
Correspondingly, the accounting nodes receive the time stamp server transmission signature after mark on the timestamp institute
State minimum remainder.
Step 303, the accounting nodes send broadcast message in the block chain network, and the broadcast message includes institute
The cryptographic Hash of the minimum remainder of the timestamp and the corresponding data content of the minimum remainder in mark after stating signature.
In mark after the accounting nodes receive the signature of time stamp server transmission described in the timestamp
When minimum remainder, which sends broadcast message in the block chain network immediately, which includes by the time
In mark after stabbing privacy key signature in the minimum remainder of the timestamp and the corresponding data of the minimum remainder
The cryptographic Hash of appearance.For example, the corresponding data of n-th data block of data content 3 mentioned above divided by block chain difficulty value it
Remainder afterwards is minimum, then the corresponding data content of minimum remainder is the data content 3, the corresponding data content of minimum remainder
Cryptographic Hash be data content 3 cryptographic Hash.The cryptographic Hash that the accounting nodes send the data content 3 is in order to avoid the block
There are other accounting nodes to forge the minimum remainder in chain network to grab book keeping operation power.When other book keeping operation sections in the block chain network
When point receives broadcast message, which can be confirmed.
Optionally, before the accounting nodes send broadcast message in the block chain network, the method also includes:
The accounting nodes sign to the broadcast message using the private key of oneself；The accounting nodes are in the block chain network
Middle transmission broadcast message, comprising: the accounting nodes are by the broadcast after signature into the block chain network.
For example, the accounting nodes, when sending the broadcast message, which can be first using the private key of oneself to this
Broadcast message is signed, then again by the broadcast after signature into the block chain network.
Fig. 5 is the structural schematic diagram of accounting nodes provided in an embodiment of the present invention.Book keeping operation section provided in an embodiment of the present invention
Point can execute the process flow that the expansion of content embodiment of the method for accounting nodes provides, as shown in figure 5, accounting nodes 40 wrap
It includes: memory 41, processor 42, computer program and communication interface 43；Wherein, computer program is stored in memory 41,
And it is configured as executing following operation by processor 42: for each data content in multiple first data contents of storage,
A random number is generated respectively；Using preset algorithm, each first data content and corresponding random number are handled, obtained
Second data content；Circulation, which is executed, counts to the step of obtaining second data content at random by generating, until obtaining default
Until several data contents；When the quantity of data content reaches storage cap, third data content to be stored if it exists, then
One or more second data contents are deleted, store the third data content to vacate memory space.
Optionally, the processor is using preset algorithm, carries out to each first data content and corresponding random number
Processing, when obtaining the second data content, is used for:
Using preset algorithm, to the mark of each first data content, the user node for storing first data content with
And corresponding random number is handled, and the second data content is obtained.
Optionally, the processor, is also used to:
A number N is determined according to the cryptographic Hash of a block upper in block chain network；
Determine the n-th data block of each data content in multiple data contents of its storage；
The corresponding data of n-th data block of each data content are calculated divided by more than after block chain difficulty value
Number；
Determine the minimum remainder in the corresponding remainder of the multiple data content；
Preset time after the upper block generates generates new block, more than the preset time and the minimum
Number corresponds to；
Transaction Information is recorded on the new block.
Optionally, the processor is after the preset time after a upper block generates generates new block, also
For:
The minimum remainder is sent to time stamp server, by the time stamp server to the minimum remainder mark
Upper timestamp, and the minimum remainder for identifying the upper timestamp is signed using the private key of the time stamp server
Name；
The minimum remainder of the timestamp in mark after receiving the signature that the time stamp server is sent.
Optionally, processor timestamp on receiving the mark after the signature that the time stamp server is sent
The minimum remainder after, be also used to:
Broadcast message is sent in the block chain network, the broadcast message is including described in the mark after the signature
The minimum remainder of timestamp and the cryptographic Hash of the corresponding data content of the minimum remainder.
The accounting nodes of embodiment illustrated in fig. 5 can be used for executing the technical solution of above method embodiment, realization principle
Similar with technical effect, details are not described herein again.
In addition, the embodiment of the present invention also provides a kind of computer readable storage medium, it is stored thereon with computer program, institute
It states computer program and is executed by processor expansion of content method to realize accounting nodes described in above-described embodiment.
In several embodiments provided by the present invention, it should be understood that disclosed device and method can pass through it
Its mode is realized.For example, the apparatus embodiments described above are merely exemplary, for example, the division of the unit, only
Only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components can be tied
Another system is closed or is desirably integrated into, or some features can be ignored or not executed.Another point, it is shown or discussed
Mutual coupling, direct-coupling or communication connection can be through some interfaces, the INDIRECT COUPLING or logical of device or unit
Letter connection can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of hardware adds SFU software functional unit.
The above-mentioned integrated unit being realized in the form of SFU software functional unit can store and computer-readable deposit at one
In storage media.Above-mentioned SFU software functional unit is stored in a storage medium, including some instructions are used so that a computer
It is each that equipment (can be personal computer, server or the network equipment etc.) or processor (processor) execute the present invention
The part steps of embodiment the method.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (Read-
Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic or disk etc. it is various
It can store the medium of program code.
Those skilled in the art can be understood that, for convenience and simplicity of description, only with above-mentioned each functional module
Division progress for example, in practical application, can according to need and above-mentioned function distribution is complete by different functional modules
At the internal structure of device being divided into different functional modules, to complete all or part of the functions described above.On
The specific work process for stating the device of description, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations；To the greatest extent
Pipe present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: its according to
So be possible to modify the technical solutions described in the foregoing embodiments, or to some or all of the technical features into
Row equivalent replacement；And these are modified or replaceed, various embodiments of the present invention technology that it does not separate the essence of the corresponding technical solution
The range of scheme.
Claims (11)
1. a kind of expansion of content method of accounting nodes characterized by comprising
Accounting nodes generate a random number for each data content in multiple first data contents of storage respectively；
The accounting nodes use preset algorithm, handle each first data content and corresponding random number, obtain the
Two data contents；
The accounting nodes circulation, which is executed, counts to the step of obtaining second data content at random by generating, until being preset
Until the data content of number；
When the quantity of data content in the accounting nodes reaches the storage cap of the accounting nodes, if it exists wait store
Third data content, then the accounting nodes delete one or more second data contents, are deposited with vacating memory space
Store up the third data content.
2. the method according to claim 1, wherein the accounting nodes use preset algorithm, to each first
Data content and corresponding random number are handled, and the second data content is obtained, comprising:
The accounting nodes use preset algorithm, to each first data content, store the user node of first data content
Mark and corresponding random number handled, obtain the second data content.
3. method according to claim 1 or 2, which is characterized in that the method also includes:
The accounting nodes determine a number N according to the cryptographic Hash of a block upper in block chain network；
The accounting nodes determine the n-th data block of each data content in multiple data contents of its storage；
The accounting nodes calculate the corresponding data of n-th data block of each data content divided by block chain difficulty value it
Remainder afterwards；
The accounting nodes determine the minimum remainder in the corresponding remainder of the multiple data content；
Preset time of the accounting nodes after a upper block generates generates new block, the preset time and institute
It is corresponding to state minimum remainder；
The accounting nodes record Transaction Information on the new block.
4. according to the method described in claim 3, it is characterized in that, the accounting nodes are after a upper block generates
After preset time generates new block, the method also includes:
The minimum remainder is sent to time stamp server by the accounting nodes, gives the minimum by the time stamp server
Remainder identifies upper timestamp, and using the private key of the time stamp server to the minimum remainder for identifying the upper timestamp
It signs；
The accounting nodes receive the minimum of the timestamp in the mark after the signature that the time stamp server is sent
Remainder.
5. according to the method described in claim 4, it is characterized in that, the accounting nodes receive the time stamp server transmission
Signature after mark on the timestamp the minimum remainder after, the method also includes:
The accounting nodes send broadcast message in the block chain network, and the broadcast message includes the mark after the signature
The cryptographic Hash of the minimum remainder of the timestamp and the corresponding data content of the minimum remainder in knowledge.
6. a kind of accounting nodes characterized by comprising
Memory；
Processor；
Communication interface；And
Computer program；
Wherein, the computer program stores in the memory, and is configured as executing following operation by the processor:
For each data content in multiple first data contents of storage, a random number is generated respectively；
Using preset algorithm, each first data content and corresponding random number are handled, the second data content is obtained；
Circulation, which is executed, counts to the step of obtaining second data content at random by generating, until in the data for obtaining predetermined number
Until appearance；
When the quantity of data content reaches storage cap, third data content to be stored, then delete one or more if it exists
A second data content stores the third data content to vacate memory space.
7. accounting nodes according to claim 6, which is characterized in that the processor is using preset algorithm, to each
First data content and corresponding random number are handled, and when obtaining the second data content, are used for:
Using preset algorithm, mark to each first data content, the user node for storing first data content and right
The random number answered is handled, and the second data content is obtained.
8. accounting nodes according to claim 6 or 7, which is characterized in that the processor is also used to:
A number N is determined according to the cryptographic Hash of a block upper in block chain network；
Determine the n-th data block of each data content in multiple data contents of its storage；
The corresponding data of n-th data block of each data content are calculated divided by the remainder after block chain difficulty value；
Determine the minimum remainder in the corresponding remainder of the multiple data content；
Preset time after a upper block generates generates new block, the preset time and the minimum remainder pair
It answers；
Transaction Information is recorded on the new block.
9. accounting nodes according to claim 8, which is characterized in that the processor is after a upper block generates
Preset time generate new block after, be also used to:
The minimum remainder is sent to time stamp server, when by the time stamp server in the minimum remainder mark
Between stab, and signed using the private key of the time stamp server to the minimum remainder for identifying the upper timestamp；
The minimum remainder of the timestamp in mark after receiving the signature that the time stamp server is sent.
10. accounting nodes according to claim 9, which is characterized in that the processor is receiving the time-stamping service
In mark after the signature that device is sent after the minimum remainder of the timestamp, it is also used to:
Broadcast message is sent in the block chain network, the broadcast message includes the time in the mark after the signature
The minimum remainder of stamp and the cryptographic Hash of the corresponding data content of the minimum remainder.
11. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The method according to claim 1 to 5 is realized when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910732883.8A CN110471922B (en) | 2019-08-09 | 2019-08-09 | Content extension method and device for accounting node and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910732883.8A CN110471922B (en) | 2019-08-09 | 2019-08-09 | Content extension method and device for accounting node and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110471922A true CN110471922A (en) | 2019-11-19 |
| CN110471922B CN110471922B (en) | 2023-02-03 |
Family
ID=68511611
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910732883.8A Active CN110471922B (en) | 2019-08-09 | 2019-08-09 | Content extension method and device for accounting node and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110471922B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111627530A (en) * | 2020-05-19 | 2020-09-04 | 全链通有限公司 | Medical image identification method and equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180109541A1 (en) * | 2016-10-17 | 2018-04-19 | Arm Ltd. | Blockchain mining using trusted nodes |
| CN109102287A (en) * | 2018-08-13 | 2018-12-28 | 中国联合网络通信集团有限公司 | Block chain bookkeeping methods, device, equipment and storage medium |
| CN109408595A (en) * | 2018-10-26 | 2019-03-01 | 全链通有限公司 | Block chain bookkeeping methods, equipment and computer readable storage medium |
| CN109741039A (en) * | 2019-01-07 | 2019-05-10 | 深圳市红砖坊技术有限公司 | Bookkeeping methods, terminal device, digs mine node and mine pond at mine pool server |
-
2019
- 2019-08-09 CN CN201910732883.8A patent/CN110471922B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180109541A1 (en) * | 2016-10-17 | 2018-04-19 | Arm Ltd. | Blockchain mining using trusted nodes |
| CN109102287A (en) * | 2018-08-13 | 2018-12-28 | 中国联合网络通信集团有限公司 | Block chain bookkeeping methods, device, equipment and storage medium |
| CN109408595A (en) * | 2018-10-26 | 2019-03-01 | 全链通有限公司 | Block chain bookkeeping methods, equipment and computer readable storage medium |
| CN109741039A (en) * | 2019-01-07 | 2019-05-10 | 深圳市红砖坊技术有限公司 | Bookkeeping methods, terminal device, digs mine node and mine pond at mine pool server |
Non-Patent Citations (1)
| Title |
|---|
| 贾大宇等: "区块链的存储容量可扩展模型", 《计算机科学与探索》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111627530A (en) * | 2020-05-19 | 2020-09-04 | 全链通有限公司 | Medical image identification method and equipment and storage medium |
| CN111627530B (en) * | 2020-05-19 | 2023-11-17 | 全链通有限公司 | Medical image identification method, device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110471922B (en) | 2023-02-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107147501B (en) | Timestamp processing method and processing device | |
| CN109936457B (en) | Block chain multi-party witness method, device, equipment and computer readable storage medium | |
| CN108810119A (en) | block chain processing method, device and block chain node | |
| CN109102287A (en) | Block chain bookkeeping methods, device, equipment and storage medium | |
| CN109067724A (en) | Block chain data trade method, apparatus, equipment and storage medium | |
| CN109639782B (en) | Message sending platform and method | |
| CN106131057B (en) | Certification based on virtual reality scenario and device | |
| CN113347164B (en) | Block chain-based distributed consensus system, method, device and storage medium | |
| US8103245B2 (en) | Systems and methods for session records correlation | |
| CN110365766A (en) | Cloud storage method, equipment and computer readable storage medium based on block chain | |
| CN112800466B (en) | Data processing method and device based on privacy protection and server | |
| CN110351363A (en) | Data back up method, equipment and computer readable storage medium | |
| EP4287102A1 (en) | Cross-chain transaction processing method and apparatus, electronic device, and storage medium | |
| CN110233741B (en) | Service charging method, device, equipment and storage medium | |
| CN110351276A (en) | Data processing method, equipment and computer readable storage medium | |
| CN110336779A (en) | A kind of construction method, device and the electronic equipment of block chain | |
| CN110351364A (en) | Date storage method, equipment and computer readable storage medium | |
| WO2019153660A1 (en) | Transaction processing method and apparatus, and computer device and storage medium | |
| CN110471922A (en) | Expansion of content method, equipment and the computer readable storage medium of accounting nodes | |
| CN112699136B (en) | Cross-link certificate storage method and related device | |
| CN110351362A (en) | Data verification method, equipment and computer readable storage medium | |
| CN109087096A (en) | Block chain account checking method, device, equipment and storage medium | |
| CN109410049A (en) | Block chain bookkeeping methods, device, computer equipment and storage medium | |
| CN109460996A (en) | Processing method, equipment and the computer readable storage medium of publicly-owned block chain | |
| CN106452816B (en) | Information processing method, server and client |
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 |