CN110531924A

CN110531924A - For extending the method and apparatus, storage medium and system of block chain memory capacity

Info

Publication number: CN110531924A
Application number: CN201910470232.6A
Authority: CN
Inventors: 刘业章; 王志文; 吴思进
Original assignee: Nanjing Benchain Information Technology Co ltd; Hangzhou Fuzamei Technology Co Ltd
Current assignee: Nanjing Benchain Information Technology Co ltd; Hangzhou Fuzamei Technology Co Ltd
Priority date: 2019-05-31
Filing date: 2019-05-31
Publication date: 2019-12-03

Abstract

The invention discloses a kind of for extending the method and apparatus, storage medium and system of block chain memory capacity, belongs to block chain technical field.Method for extending block chain memory capacity, it is associated at least one data memory node including at least one block chain node, block data is written to the data memory node in block chain node, and block chain node receives the storage state that the data memory node is sent；Wherein, the data memory node is at least used for block data storage, and sends storage state to block chain node.Implement inconvenient technical problem for block chain dilatation in the prior art, using technical solution of the present invention, the expanding storage depth of block chain is convenient, does not need to stop block chain link point, without a large amount of data resynchronization or copy is carried out, the Highly Scalable of block data storage may be implemented.

Description

For extending the method and apparatus, storage medium and system of block chain memory capacity

Technical field

The present invention relates to block chain technical field, more particularly, to the method and apparatus of extension block chain memory capacity, Storage medium and system.

Background technique

Block chain in the prior art is increasing with the storing data scale of construction, if authentication each time will be passed through The verification of all certification nodes, hence it is evident that will lead to delay and handling capacity is lower；And taking together all identification authentication datas makes The data volume geometry grade for obtaining account book increases, if by individually authenticating node maintenance, it is clear that also result in entire block catenary system Carrying cost is higher.

In the block chain application system of existing decentralization, all calculating and storage are all on the node of block chain It executes, the hardware cost of required investment is higher, and especially large-scale application will need to expend a large amount of hardware cost, in addition, existing Since each node needs to store complete block in decentralization application system, and calculating task is executed, leads to data throughput Amount is smaller, is unable to satisfy application demand.

The block data module one of most crucial as block chain is entire block chain normal operation essential one Module；Existing implementation, it is local that block data is all stored in block chain node；Therefore, can storing data size according to Rely the size of local disk, once local disk is finished, needs to construct new node and again synchrodata, or existing Some data copies are to new disk, no matter which above scheme is used, it is all very high to the size requirements of single hard disk, and not Facilitate implementation；Block chain is run more long, and the data of accumulation are more, are just more difficult to implement.

Chinese invention patent application, publication No.: CN107832139A, date of publication: on March 23rd, 2018；It discloses and is used for Manage method, equipment and the system of the computing resource of block chain link point.The patent proposes to be that block chain node configures additional storage The concept of equipment, that is, be equivalent to and the memory capacity of existing block chain node is become larger, still fall within traditional extension How concept is also stored and be read using additional storage equipment there is no further open, the content of extension more cage System.

Summary of the invention

1. technical problems to be solved by the inivention

In order to overcome the above technical problems, the present invention provides for extending block chain memory capacity method and apparatus, Storage medium and system.Using technical solution of the present invention, the expanding storage depth of block chain is convenient, does not need to stop block chain The Highly Scalable of block data storage may be implemented without a large amount of data resynchronization or copy is carried out in node.

2. technical solution

To solve the above problems, technical solution provided by the invention are as follows:

In a first aspect, the present invention proposes the method for extending block chain memory capacity, it is suitable for block chain node, including It is associated at least one data memory node, block data is written to the data memory node, to receive the data The storage state that memory node is sent；

Wherein, the data memory node is at least used for block data storage, and sends storage shape to block chain node State.

Second aspect, the present invention propose the method for extending block chain memory capacity, are suitable for data memory node, packet Include it is associated at least one block chain node, to save the block data that the block chain node is sent, with to the block Chain node sends storage state.

The third aspect, the present invention separately propose a kind of storage method, are suitable for block chain node, including continuously to the first data Block data is written in memory node, until the first data memory node free memory has been expired, from the available number of memory space According to the second data memory node is selected in memory node, above step is repeated.

Fourth aspect, the present invention propose a kind of querying method, including according to the block height where data to be checked, inquiry The information of the data memory node recorded on block chain node finds the corresponding back end of the block height, reads institute The block data of the block height on back end is stated, to find data to be checked.

5th aspect, the present invention proposes the system for extending block chain memory capacity, including saves for storing to data Point write-in block data, receives the block chain node for the storage state that the data memory node is sent；For saving the area The block data that block chain node is sent, Xiang Suoshu block chain node send the data memory node of storage state；The block chain Node is associated at least one block chain node.

6th aspect, the present invention propose that a kind of equipment, the equipment include: one or more processors；Memory is used for One or more programs are stored, when one or more of programs are executed by one or more of processors, so that described One or more processors execute method described in the first to five aspect.

7th aspect, the present invention propose a kind of storage medium for being stored with computer program, which is executed by processor The described in any item methods of the such as the first to five aspect of Shi Shixian.

3. beneficial effect

Using technical solution provided by the invention, compared with prior art, have the following beneficial effects:

When existing block chain data space deficiency, only it need to simply increase a common machine as new data Memory node does not need to stop block chain link point, without a large amount of data resynchronization or copy is carried out, realizes that block data is deposited The Highly Scalable of storage, the function that block chain node does not have to undertake block data storage can increase number when executing calculating task According to handling capacity, meet most application demands.

Detailed description of the invention

Fig. 1 is the method flow diagram that the present invention is suitable for block chain node.

Fig. 2 is the method flow diagram of Fig. 1 preferred embodiment.

Fig. 3 is the expansion method flow chart that the present invention is suitable for data memory node.

Fig. 4 is the method flow diagram of Fig. 3 preferred embodiment.

Fig. 5 is storage method flow chart of the present invention.

Fig. 6 is querying method flow chart of the present invention.

Fig. 7 is present system structural schematic diagram.

Fig. 8 is one of the preferred embodiment of Fig. 7.

Fig. 9 is the two of the preferred embodiment of Fig. 7.

Figure 10 is the method flow diagram of High Availabitity technical solution of the present invention.

Figure 11 is the public chain BTY storage method flow chart using technical solution of the present invention.

Figure 12 is the public chain BTY querying method flow chart in embodiment 7 after dilatation.

Figure 13 is the method flow diagram of the High Availabitity technical solution after public chain BTY dilatation.

Figure 14 is one of the preferred embodiment of embodiment 8.

Figure 15 is the two of the preferred embodiment of embodiment 8.

Figure 16 is the former chain YCC storage method flow chart using technical solution of the present invention.

Figure 17 is the former chain YCC querying method flow chart in embodiment 8 after dilatation.

Figure 18 is the method flow diagram of the High Availabitity technical solution after former chain YCC dilatation.

Figure 19 is a kind of device structure schematic diagram of the invention.

Specific embodiment

To further appreciate that the contents of the present invention, in conjunction with accompanying drawings and embodiments, the present invention is described in detail.

Above description is only the general introduction of technical solution of the present invention, in order to better understand technology hand of the invention Section, can be implemented in accordance with the contents of the specification, and in order to allow above and other objects, features and advantages of the invention can It is clearer and more comprehensible, the followings are specific embodiments of the present invention.

Further effect possessed by above-mentioned non-usual optional way adds hereinafter in conjunction with specific embodiment With explanation.

The application is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched The specific embodiment stated is used only for explaining related invention, rather than the restriction to the invention.It also should be noted that in order to Convenient for description, part relevant to invention is illustrated only in attached drawing.

Heretofore described first, second equal words are convenient and be arranged in order to describe technical solution of the present invention, and There is no specific restriction effect, be to refer to, restriction effect is not constituted to technical solution of the present invention.

It should be noted that in the absence of conflict, the features in the embodiments and the embodiments of the present application can phase Mutually combination.The application is described in detail below with reference to the accompanying drawings and in conjunction with the embodiments.

Block chain node described herein also has existing area other than comprising technical characteristic disclosed in the present application Function possessed by block chain node, including routing, block chain database, digging mine or wallet service.Using the skill of present patent application Art scheme still can configure new data memory node, the two during block data is stored for block chain node It is parallel to carry out, greatly improve the memory space and scalability of block chain.

Each data memory node described herein is not uniquely corresponding with the storage equipment of an entity, visitor It in sight, can be made of, can actually be associated with one or more block chain nodes the storage equipment of multiple entities.

Embodiment 1

Method for extending block chain memory capacity, as shown in Figure 1, comprising:

S101, block chain node are associated at least one data memory node；

S103, block data is written to the data memory node, deposited with receive that the data memory node sends Storage state；

Transaction data is verified on block chain node, broadcasts, is then placed in the occasional trade pond of block chain node, Miner is waited to be packaged, after transaction data is packed into block, block is verified, and broadcast passes through block chain by common recognition Node-node transmission is stored on data memory node to data memory node, block data.One block chain node can with it is multiple Data memory node is associated, when the memory capacity of a data memory node is finished, is next deposited using another data It stores up node and continues memory block data, it is only necessary to which configuring multiple data memory nodes can meet the requirements, the storage of block catenary system Capacity extension is convenient.

In traditional block chain capacity extension mode, once the capacity that is locally stored of block chain node is finished or constructs New block chain node, which is laid equal stress on, new synchronous block data or copies existing block data to new disk；With block , there is the technical issues of time-consuming, performance difficulty and higher cost in the duration of catenary system operation.

And the proposition of the application creativeness is by multiple data memory nodes mode associated with block chain node, it will be original The store function of block data of block chain node be transferred to data memory node, block chain node does not need storage and occupies The biggish block data in space, so that it may when executing calculating task, improve data throughout, meet application demand；And data Memory node itself is also not necessary to have that the high performance requirement of block chain node.On the one hand it can be convenient, efficiently expand area The block data memory capacity of block chain node, on the other hand can be improved the data throughout of block chain node.

When available data memory space inadequate, it only need to simply increase a common machine as new data storage section Point does not need to stop block chain link point, without a large amount of data resynchronization or copy is carried out, realizes the height of block data storage It is expansible.

The storage state that the data memory node is sent includes: the current storage capacity of the data memory node, with And the block of block data that the data memory node currently saves starts height and terminates height.So, further, originally For extending the method for block chain memory capacity described in embodiment, can be improved to, as shown in Figure 2, comprising:

S101, block chain node are associated at least one data memory node；

S102, with to the data memory node be written block data；

S104, to receive the current storage capacity that the data memory node is sent, and the block data currently saved Block start height and terminate height；

Block chain node receives itself memory capacity that data memory node is sent, and passes through depositing for supervising data storage node Capacity is stored up, the available storage of data memory node is judged, block chain node is facilitated to be stored in the block data that can be held On the data memory node.

The block that block chain node receives the block data for the preservation that data memory node is sent starts height and terminates height Degree starts height and end height by monitoring the block that the data memory node saves, and judgement is stored in the data and deposits The block data content on node is stored up, so that corresponding block data content is inquired or read to the later period.

In order to which block chain node more effectively manages data memory node, data described in the block chain nodes records are deposited Store up the information of node.

All data memory nodes of block chain node administration, to control data memory node, according to The instruction of block chain node is acted, and realizes the storage of block data.

Further, the information of the data memory node, empty storage size, name including data memory node Whether title IP, port, is that current block data save the data memory node used, the beginning block of the block data of preservation Height and end block height.

The block chain node describes the information of data memory node using metadata, and block chain node passes through record institute The block for stating the block data of data memory node preservation starts height and terminates height, and the class indication for playing block data is made With convenient for judging and identifying the block data content being stored on the data memory node, so as to later period inquiry or reading pair The block data content answered.

The data memory node of the described block chain nodes records current block data write-in facilitates block chain to working as proparea Block number is managed and monitors according to the data memory node of write-in.

Further, the block chain node periodically receives the health status that data memory node is sent.Block chain node It needs to appoint with data memory node, for example sends out a hello to block chain node, if block chain node is confiscated for a long time The information sent to data memory node, then block chain node can think that data memory node is problematic, regular one As suggest 1S or 2S；With the health status of supervising data storage node.

When the block chain node does not receive the health status that data memory node is sent periodically, another number is specified According to the block data stored on memory node synchrodata memory node.

When the health status of data memory node is bad, that is, the block chain node does not receive data periodically and deposits The health status that storage node is sent, influences the health status of block chain, causes the block data stored on block chain normal It uses；So for the High Availabitity for solving the problems, such as the method, the block chain node specifies another data memory node same The block data stored on step data memory node.Concrete mode are as follows:

When individual data memory node breaks down, the data for rearranging other associated not yet memory block data are deposited Store up node, it is only necessary to synchronize the block data stored on the data memory node that breaks down, this part passes through block chain node The information of the data memory node of middle storage records, and inquires the block elevation information data of the corresponding storage of the data memory node, It is downloaded request from other or nearest block chain link point, is restored on selected data memory node, there is high availability.

Embodiment 2

The present embodiment proposes the method for extending block chain memory capacity, corresponding with the technical solution of embodiment 1, fits For data memory node, as shown in Figure 3, comprising:

S201, data memory node are associated at least one block chain node；

S203, the block data to save the block chain node transmission, to send storage shape to the block chain node State.

For data memory node for extending block chain memory capacity, entry criteria is not high, and extends block in traditional approach The technical solution of chain memory capacity is compared, and cost performance is high, and extension is convenient, has enhanced scalability.

The storage state includes: the current storage capacity and the data memory node of the data memory node The block of the block data currently saved starts height and terminates height.

Further, it can be improved to, for extending the method for block chain memory capacity such as Fig. 4 described in the present embodiment It is shown, comprising:

S201, data memory node are associated at least one block chain node；

S202, the block data to save the block chain node transmission；

S204, the current storage capacity to send data memory node to the block chain node, and currently save The block of block data starts height and terminates height.

Block chain node receives itself the current memory capacity that data memory node is sent, and passes through supervising data storage node Memory capacity, judge the available storage of data memory node, block chain node facilitated to deposit the block data that can be held Storage is on the data memory node.

In order to which block chain node more effectively manages data memory node, data institute described in the block chain nodes records All data memory nodes of block chain node administration stated, to control data memory node, according to block chain node Instruction acted, realize the storage of block data.

1 data memory node information of table

key	1	2	3
				name	Data1	Data2	Data3
ip	192.168.0.1	192.168.0.2	192.168.0.3
				port	12000	12000	12000
is_current_using	N	Y	N
				usable	N	Y	Y
block_start_height	0	10001	-
				block_end_height	10000	15000	-
storagespace	2T	8T	1T

The updated data memory node information of table 2

For example, having write full block data now with the memory space of 3 data memory nodes Data1-3, Data1, just Data are being write to Data2, Data3 is not used also, then the content of Master meta at this time is as shown in table 1.If herein When, block chain node is configured with a data memory node Data4 again, then the content of Master meta is as shown in table 2.

Above scheme is not related to High Availabitity, so, once some data memory node breaks down, for a block For chain node, need to synchronize from the beginning on all block datas to each data memory node of configuration, correspondingly, Master meta also will be updated.

In order to realize High Availabitity, the present invention is made that and further improves, when the block chain node does not receive periodically When the health status that data memory node is sent, the area stored on another data memory node synchrodata memory node is specified Block number evidence.

When the health status of data memory node is bad, that is, the block chain node does not receive data periodically and deposits The health status that storage node is sent, influences the health status of block chain, causes the block data stored on block chain normal It uses；So in order to solve the problems, such as High Availabitity existing for the method, the block chain node specifies another data storage section The block data stored on point synchrodata memory node.Concrete mode are as follows:

When the block chain node does not receive the health status that data memory node is sent, corresponding data storage section periodically When point breaks down；Rearrange new data memory node, it is only necessary to synchronize the block counts stored on the data memory node that breaks down According to being recorded by the information of data memory node stored in block chain node, inquire data memory node correspondence and deposit The block elevation information data of storage, block chain link point is downloaded request from other or nearby, is restored to new data storage and saves On point, there is high availability.

As shown in Figure 10, when the block chain node Master-node3 does not receive data memory node Data2 periodically When the health status sent, illustrate that data memory node Data2 associated with it breaks down, 1. such as the step in Figure 10；Block chain The data memory node Data4 that node M aster-node3 rearranges other associated not yet memory block data is replaced Data2, it is only necessary to synchronize the block of the block altitude range 10001-15000 stored on the data memory node Data2 that breaks down Data；2. such as the step in Figure 10, pass through the letter of the data memory node stored of Master-node3 in block chain node Breath record Master meta, inquires the block elevation information data of the corresponding storage of data memory node Data2, to other or Nearest block chain node Master-node issues request, downloads the block data of block altitude range 10001-15000, restores Onto data memory node Data4, as the step in Figure 10 3. 4. shown in, have high availability.

Further, the data memory node periodically sends health status to block chain node.Block chain node needs It is appointed with data memory node, for example sends out a hello to block chain node, if block chain node confiscates number for a long time According to the information that memory node is sent, then block chain node can think that data memory node is problematic, periodically generally builds Discuss 1S or 2S；With the health status of supervising data storage node.

Embodiment 3

The present embodiment proposes a kind of storage method on the basis of Examples 1 and 2 any technical solution, is suitable for area Block chain node, as shown in Figure 5, comprising:

Continuously block data is written to the first data memory node in S301, block chain node, saves until the first data store Point free memory has been expired；

S303, the second data memory node is selected from the available data memory node of memory space；Wherein, the second data Memory node be with the block chain node it is associated, not yet save block data data memory node；

S305, step S301 and S303 are repeated.

Block chain node knows that the full mode of the first data memory node free memory has much in step S301 Kind, the first is achieved in that: the first data memory node actively sends itself memory space residual capacity to block chain node, It can be regular transmission, be also possible to after the preservation of each block data terminates.It is achieved in that for second: block chain node It is communicated with the first data memory node, inquires its remaining memory capacity size, can be regular transmission, be also possible in each area After block number terminates according to preservation.The third is achieved in that: when the first data memory node memory capacity is full, to block chain link Point sends the notification information being filled with.The present embodiment only enumerates three of the above mode, and the present invention is not construed as limiting, and is needed based on practical application It asks, can also be other modes that block chain node can be allowed to know data memory node storage size.

For the availability for ensuring storage method, block chain node periodically receives the health status that data memory node is sent. Block chain node needs are appointed with data memory node, for example send out a hello to block chain node, if block chain node is very The information for confiscating data memory node transmission for a long time, then block chain node can think that data memory node is problematic , regular general recommendations 1S or 2S；With the health status of supervising data storage node.

When the block chain node does not receive the health status that data memory node is sent periodically, another number is specified According to memory node according to the block data stored on the synchronizing information data memory node of the data memory node.

When the health status of data memory node is bad, that is, the block chain node does not receive data periodically and deposits The health status that storage node is sent；So for the High Availabitity for solving the problems, such as the method, the block chain node is specified another The block data stored on a data memory node synchrodata memory node.Concrete mode are as follows:

When individual data memory node breaks down, new data memory node is rearranged, it is only necessary to synchronize the number that breaks down According to the block data stored on memory node, this part passes through the information of the data memory node stored in block chain node Record inquires the block elevation information data of the corresponding storage of the data memory node, and block chain link point carries out from other or nearby Downloading request, is restored on new data memory node, has high availability.

All data memory nodes of block chain node administration described in data described in the block chain nodes records, so as to Data memory node is controlled, is acted according to the instruction of block chain node, realizes the storage of block data.

For with the matched data memory node of block chain node for, be divided into following three kinds of states: the first, for For the data memory node of one block data for saving the transmission of block chain link point, constantly receives block chain link point and send The block data come, until the memory capacity of data memory node is used up.Second, full block data has been saved for one Data memory node for, periodically to block chain node send health status, with monitor storage block data availability, The beginning block height of the block data of data memory node storage is recorded on block chain node and terminates block height, so as to Later period is queried and reads.The third waits block chain link point to make for the data memory node that one is not used The storage of block data, or the block data for restoring to store on impaired data memory node are carried out with it.

Embodiment 4

The present embodiment is on the basis of Examples 1 and 2 any technical solution, 3 a kind of storage method in conjunction with the embodiments, phase Ying Di, the present embodiment propose a kind of querying method, as shown in Figure 6, comprising:

S401, according to the block height where data to be checked, inquire the data memory node recorded on block chain link point Information, find the corresponding back end of block height；

S403, the block data for reading the block height on the back end, to find data to be checked.

The information of the data memory node, empty storage size, title, IP, port including data memory node, It whether is that current block data save the data memory node used, the beginning block height of the block data of preservation and end zone Block height.

Embodiment 5

The system that the present embodiment is used to extend block chain memory capacity, comprising:

For block data to be written to data memory node, the area for the storage state that the data memory node is sent is received Block chain node；

The block data sent for saving the block chain node, Xiang Suoshu block chain node send the number of storage state According to memory node；

The block chain node is associated at least one block chain node.

As shown in fig. 7, Master node is block chain node, has P2P, common recognition, digs mine and wallet service function, deposit It stores up Merkel tree (Block metaData), has reading and writing data port (Block IO), with multiple data memory node (Data Node 1, Data node 2,, Data node n) it is associated, establish network connection.Data memory node has reading and writing data Port (Block IO), memory block data (Block Data).

Data-node:

It is appointed as data memory node in configuration, and block chain link point need to be configured, the access mode of itself is sent to Block chain node periodically sends health status and gives block chain node, mutually passes number by Block IO and Master node node According to, and acted according to the instruction of Master node.Wherein, access mode refers to IP and the port of Data-node.

Master-node:

It is appointed as block chain node in configuration, manages all Data-node nodes, and records the write-in of current block data Data-node node；Block data continuously is written to some Data-node node, until Data-node returns to available space Full response, then a data memory node is selected to continue to repeat above step in available Data-node list again, it is complete The storage of pairs of block data.

It records the block that each data-node is saved to start height and terminate height, so that the later period carries out block data Inquiry is read.

The information of data memory node, the information of the data memory node, including data storage are described using metadata Whether the empty storage size of node title, IP, port, is that current block data save the data memory node used, is protected The beginning block height and end block height for the block data deposited.

Block chain node periodically receives the health status that data memory node is sent, when the block chain node periodically receives When the health status sent less than data memory node, specify another data memory node according to the data memory node The block data stored on synchronizing information data memory node.

Embodiment 6

By the virtual coin that miner digs --- for the block chain where bit coin, over time, in the block chain The block data of upper storage is more and more, more and more, on the one hand the node of bit coin will be responsible for verifying, common recognition, dig the function such as mine Can, on the other hand memory block data again, can't bear the heavy load, bit coin is under the pressure of each side's surface pressure, it would be highly desirable to dilatation, it is proposed that Following several schemes:

1, increase additional memory devices directly to each node, undoubtedly need to put into huge cost purchase storage equipment, Existing block data is copied in storage equipment, it is higher to the storage capacity requirement of single hard disk.

2, increase new node, it is still desirable to put into huge cost purchase hardware device, and need to synchronize complete area Block number evidence implements relatively complicated.

For the memory capacity for further expanding bit coin, in view of various drawbacks, this patent present in prior art The inventor of application creatively proposes a kind of scheme of tile system dilatation, it may be assumed that for extending block chain memory capacity Method can belong to distributed storage with the memory capacity of Quick Extended bit coin.Assuming that Master-node1, Master- Node2, Master-node3 are any 3 blocks chain node on bit coin, and the capacity that is locally stored of these three nodes can be with It is the state close to quota, is also possible to vacant more state, above 3 nodes can part or be entirely with wallet, mine Work, network route and the full node of intact block chain, or the node routed comprising intact block chain, network, or includes complete section Block chain, the node for digging mine function and the routing of P2P network.Other kinds of node is completed such as simple payment verification (SPV) The SPV node (including wallet and bit coin P2P network node without block chain) of transaction verification, or run other agreements Node (such as mine pond dig mine node (Pool server), Stratum node), or dig mine node (comprising without block chain but Have Stratum protocol node or the digging mine function of mine protocol node dug in other mine ponds) or light weight (SPV) Stratum wallet (network node comprising wallet, operation Stratum agreement without block chain)；Since these nodes itself do not store completely Block chain may be assumed that main occupancy memory space is biggish herein and not examine for block data so the demand of dilatation is not present Consider, if the memory space inadequate of these nodes itself can also when needing extension storage space with the development of block chain technology The effect for being easy to extend may be implemented in the technical issues of to solve lack of memory capacity using the technical solution of the application.

Data-node1, Data-node2,, Data-node20 be data memory node, be respectively provided with certain deposit Capacity is stored up, and can be dominated and be controlled by block chain node.The method and system for being used to extend block chain memory capacity of the application There are following several situations in the specific implementation:

The first, block chain node and data memory node are one-to-many relationship, if an i.e. block chain node configuration Dry data memory node, and do not intersect mutually between this several data memory node.Entitled Data-node1, Data- Node2 and Data-node3 is configured as the data memory node of block chain node Master-node1；Entitled Data- Node4, Data-node5, Data-node6 and Data-node7 are configured as the data of block chain node Master-node2 Memory node；Entitled Data-node8, Data-node9, Data-node10, Data-node11 and Data-node12 are matched The data memory node as block chain node Master-node3 is set, as shown in Figure 8.It is herein it should be strongly noted that every The number of the data memory node of a block chain node configuration is unrestricted, can be selected according to actual needs, number herein Limitation is just to illustrate the technical solution content for understanding the application, the actually protection scope of the technical solution of the application Without limitation.

Master-node (block chain node): the institute being responsible for other than memory block data is functional, and increases block counts According to metadata management function, for managing Data-node.

Data-node (data memory node): being responsible for the storage of block data, and communicate with Master-node, so that Master-node knows the size of itself memory capacity.

Master-node (block chain node) receives the transaction that other block chain nodes are sent, and is verified, and verifying is logical Later, it being broadcasted, is put into the occasional trade pond on block chain node, waiting, which is packaged, to be carried out in block, after being packed into block, Broadcast carries out block verifying, common recognition, and block data is saved on Data-node, is continuously stored in area to same Data-node Block number evidence expires until Data-node is stored, and replaces another and continues memory block data.

Second, block chain node is the relationship of multi-to-multi with data memory node, if an i.e. data memory node quilt Dry block chain node configuration is for storing respective block data, e.g., entitled Data-node1, Data-node2 and Data-node3 is configured as the data memory node of block chain node Master-node1；Entitled Data-node4, Data-node5, Data-node6 are configured as the data memory node of block chain node Master-node2；It is entitled Data-node8, Data-node9 and Data-node10 are configured as the data storage of block chain node Master-node3 Node, the memory space of Data-node7 and Data-node11 kind are divided into several pieces, serve Master- respectively Node1, Master-node2 and Master-node3, divided each section is respectively independent, respectively by Master-node1, Master-node2 and Master-node3 is dominated, as shown in Figure 9.The memory space of data memory node Data-node7 is drawn 3 parts are divided into, are respectively labeled as 701,702 and 703, to distinguish, distribute virtual ip address, this three parts to this three parts Memory space is respectively used to the block data that storage Master-node1, Master-node2 and Master-node3 are sent, when The data of the currently stored block counts evidence of any of Master-node1, Master-node2 and Master-node3 node store When node storage is full, a progress block data preservation, usage and independence can be selected from corresponding data memory node Data memory node is identical.The memory space of data memory node Data-node11 has been partitioned into 3 parts, marks respectively It is 1101,1102 and 1103, to distinguish, distributes virtual ip address to this three parts, this three parts memory space is respectively used to deposit The block data that storage Master-node1, Master-node2 and Master-node3 are sent.The present embodiment only lists one kind Situation, i.e., same storage equipment are divided into three parts, and respectively with three block chain node matchings；The present embodiment is enumerated specific Situation is only used for the technical solution content of present patent application for clarity, does not constitute to the practical scope of protection of the application It limits, in practical applications, can be selected according to actual needs.

Embodiment 7

By taking the public chain bit-cell (abbreviation BTY) of the complicated U.S. 33 in Hangzhou as an example, using the technical solution of the present embodiment to BTY's Part of nodes BTY-node001, BTY-node002 and BTY-node003 carry out dilatation, wherein BTY-node001 is configured with number According to memory node DataBTY-node101, DataBTY-node102 and DataBTY-node103；BTY-node002 is configured with Data memory node DataBTY-node201, DataBTY-node202 and DataBTY-node203；BTY-node003 configuration Data memory node DataBTY-node301, DataBTY-node302 and DataBTY-node303.BTY-node001, The storage information BTY- of the data memory node of each self-configuring is described on BTY-node002 and BTY-node003 respectively meta001、BTY-meta002、BTY-meta003。

Such as Figure 11, the method for data storage are as follows:

Block data is written to data memory node DataBTY-node101 in S1101, block chain node BTY-node001；

S1103, the residual storage capacity size that data memory node DataBTY-node101 is sent is received；

S1105, judge whether DataBTY-node101 is filled with according to the content recorded on BTY-meta001, if do not had It is filled with, repeats step S1101 and S1103；If be filled with, step S1107 is executed；

S1107, one is selected from the available node DataBTY-node102 or DataBTY-node103 of memory space, Repeat step S1101 and S1103.

Block data storing process and BTY-node001 on other two nodes BTY-node002 and BTY-node003 It is similar.

Assuming that the block height where data content BTY-Value on BTY to be checked is BTY-H258, then corresponding The method of data query be the block height BTY-H258 where data to be checked, inquire block chain link point BTY- The information BTY- of the data memory node recorded in node001, BTY-node002 and BTY-node003 any node Meta001, BTY-meta002, BTY-meta003, this illustrates this for sentencing the block data of query node BTY-node002 The query process of application, as shown in figure 12:

The BTY-meta002 recorded on S1201, query node BTY-node002, finding block height is BTY-H258's Data memory node where block data, it is assumed that on node DataBTY-node203；

S1203, the block data that block height on DataBTY-node203 is BTY-H258 is read, it is to be checked to find Ask data content BTY-Value.

For the high availability of BTY after raising dilatation, the technical solution of the present embodiment is further modified, the section on BTY Between point BTY-node001, BTY-node002 and BTY-node003, and the data memory node of each configuration, especially That those have been filled between the node of block data, appoint by data memory node periodically (1 or 2 second, can be according to specific feelings Depending on condition needs, the special value that do not enumerated by the embodiment of the present application is limited) health status is sent to BTY block chain node, When partial data memory node is impaired or failure, BTY block chain node will not receive health status notice, thus sentence Fixed corresponding data memory node is not in good state or failure, so as to the health status of monitoring system, it is ensured that BTY block chain health Orderly function.Failure occur after solution there are two types of, one is BTY block chain node is to there being complete BTY block chain Node sends the request of synchronous block data, and after request passes through, BTY block chain node is by all block datas according to above-mentioned storage Method is stored in again on paired data memory node.

Second of solution is exactly that present patent application emphasis is described, in this example, it is assumed that node BTY- Data memory node DataBTY-node301, DataBTY-node302 and DataBTY-node303 of node003 configuration are It is filled with, and configured new node DataBTY-node304, DataBTY- of node BTY-node003 before this Node305, DataBTY-node306 and DataBTY-node307；At this point, node BTY-node003 continuously to DataBTY-node305 memory block data, node DataBTY-node304, DataBTY-node306 and DataBTY- Node307 memory space is blank state.Assuming that node BTY-node003 and its data memory node are arranged: every 4 seconds The data memory node for being filled with block data sends health status, such as a string of character " Hell0 to node BTY-node003！ Chain33！", if node BTY-node003 time-out does not receive the health status feedback words that DataBTY-node302 is sent Symbol string " Hell0！Chain33！", thus determine that corresponding data memory node is not in good state or failure.Node BTY- Node003 enables High Availabitity technical solution immediately, as shown in figure 13, method particularly includes:

S1301, node BTY-node003 receive the health status feedback character string " Hell0 that data memory node is sent！ Chain33！"；

S1303, with the presence or absence of received over time less than data memory node, if not, being run after BTY block chain dilatation good Good, this method execution terminates；If so, the node failure is determined, it is assumed herein that received over time is sent out less than DataBTY-node302 The health status come feeds back character string " Hell0！Chain33！", i.e. node DataBTY-node302 failure；

The BTY-meta003 recorded on S1305, query node BTY-node003 inquires the corresponding storage of the malfunctioning node Block altitude range, it is assumed that block altitude range are as follows: 20000-35000；

S1307, to have complete BTY block chain other or nearby node issue download the block altitude range block The block data that the request of data, i.e. request downloading block height are 20000-35000；

After S1309, request pass through, the block data of the block altitude range is saved in any one and is allocated to BTY- On the vacant data memory node of the memory space of node003, for example it is saved on node DataBTY-node304.

Embodiment 8

IPFS is the underlying protocol of an internet, similar http protocol, and IPFS target is to make one more open, is fast The internet of speed, safety is solved the transmission and orientation problem of data using distributed hashtable, point-to-point unicast is changed Become the transmission of P2P (multi-multipoint), wherein the structure of storing data is hash chain.One can be deposited on each IPFS node A map interconnects between each map, and all IPFS node maps, which add up, becomes a distributed hashtable.When to this It, can be according to the ID cryptographic Hash of data itself, by the way of a kind of mathematical computations, to search pair when a network request packet Then the resource answered sets up a kind of connection on which platform loom, data required for downloading.

IPFS can be with persistence data, but cannot be tamperproof, as long as changing, cryptographic Hash becomes；Also, node itself The data of storage have absolute permission, the operation that the controller of node can delete file, deposit, adding.IPFS is not block Chain project does not use any block chain technology.

Former chain YCC has drawn bit coin, auspicious wave coin, bit stock, ether mill, super account book as a kind of block chain project The advantages of each system, incorporates multinomial innovative technology, forms a kind of completely new block chain network framework, and on the one hand the performance of public chain can With more than ten thousand/second, on the other hand information interconnection is may be implemented in public chain and license chain, is worth intercommunication.Both had in the going of public chain Heart feature, and requirement of the license chain to performance and privacy can be taken into account.

The novel aspects of former chain mainly include that it is mutual that heat replaces intelligent contract, intelligent contract isomery, across chain information interconnection value Lead to, generate free flow amount, mobile terminal private key hardware management scheme, encryption retrieval scheme, data comparison and common recognition side with cash in hand Method, Sign-On authentication and secret protection, across the chain authentication of public chain license chain and management, nearly 10 blocks chain attack resistance are arranged safely It applies.

For block chain project --- for former chain YCC, with time stepping method, can exist because of the big influence of data back amount It is the technical issues of speed of service, available when a kind of scheme of the block chain dilatation proposed using the present embodiment carries out dilatation IPFS node solves the technical problem as data memory node.

Assuming that YCC-node1, YCC-node2, YCC-node3 are any 3 blocks chain node on former chain YCC, this three The capacity that is locally stored of a node can be state close to quota, be also possible to vacant more state, above 3 nodes are deposited In the demand of dilatation, if with the development of block chain technology, the memory space inadequate of these nodes itself needs extension storage empty Between when, the technical issues of can also solving lack of memory capacity using the technical solution of the application, may be implemented to be easy to extend Effect.

IPFS-node1, IPFS-node2,, IPFS-node20 be IPFS node, be respectively provided with certain storage and hold Amount, and allow to be dominated and controlled by the block chain node on former chain YCC.The side for being used to extend block chain memory capacity of the application Method and system have following several situations in the specific implementation:

The first, former chain YCC node and IPFS node are one-to-many relationship, i.e., one former chain YCC node configuration is several A IPFS node, and do not intersect mutually between this several IPFS node.Entitled IPFS-node1, IPFS-node2 and IPFS-node3 is configured as the data memory node of former chain YCC node YCC-node1；Entitled IPFS-node4, IPFS- Node5, IPFS-node6 and IPFS-node7 are configured as the data memory node of block chain node YCC-node2；Title Former chain YCC is configured as IPFS-node8, IPFS-node9, IPFS-node10, IPFS-node11 and IPFS-node12 The data memory node of node YCC-node3, as shown in figure 14.Herein it should be strongly noted that each original chain YCC was configured The number of IPFS node is unrestricted, can be selected according to actual needs, and number limitation herein is clear just to illustrate The technical solution content of Chu the application, the actually protection scope of the technical solution of the application are without limitation.

YCC-node (former chain YCC node): the institute being responsible for other than memory block data is functional, and increases block data Metadata management function, for managing IPFS-node.

IPFS-node (data memory node): it is responsible for the storage of block data, and is communicated with YCC-node, so that YCC- Node knows the size of itself memory capacity.

YCC-node (former chain YCC node) receives the transaction that other former chain YCC nodes are sent, and is verified, verifying is logical Later, it is broadcasted, is put into the occasional trade pond on former chain YCC node, waiting, which is packaged, be packed into block in block Afterwards, it broadcasts, carries out block verifying, common recognition, block data is saved on IPFS-node, is continuously stored in same IPFS-node Block data is expired until IPFS-node is stored, and is replaced another and is continued memory block data.

Second, former chain YCC node and IPFS node are the relationship of multi-to-multi, i.e. an IPFS node is by several former chains The configuration of YCC node is for the respective block data of storage, e.g., entitled IPFS-node1, IPFS-node2 and IPFS-node3 It is configured as the data memory node of former chain YCC node YCC-node1；Entitled IPFS-node4, IPFS-node5, IPFS-node6 is configured as the data memory node of former chain YCC node YCC-node2；Entitled IPFS-node8, IPFS- Node9 and IPFS-node10 is configured as the data memory node of former chain YCC node YCC-node3, IPFS-node7 and The memory space of IPFS-node11 kind is divided into several pieces, serves YCC-node1, YCC-node2 and YCC- respectively Node3, divided each section is respectively independent, is dominated respectively by YCC-node1, YCC-node2 and YCC-node3, such as Figure 15 It is shown.The memory space of data memory node IPFS-node7 has been partitioned into 3 parts, is respectively labeled as 7001,7002 and 7003, for distinguish, to this three parts distribute virtual ip address, this three parts memory space be respectively used to storage YCC-node1, The block data that YCC-node2 and YCC-node3 are sent, when any of YCC-node1, YCC-node2 and YCC-node3 are saved When the data memory node storage of the currently stored block counts evidence of point is full, can be selected from corresponding data memory node one into Row block data saves, and usage is identical as independent data memory node.The memory space of data memory node IPFS-node11 3 parts are had been partitioned into, are respectively labeled as 1111,1112 and 1113, to distinguish, distribute virtual ip address to this three parts, This three parts memory space is respectively used to the block data that storage YCC-node1, YCC-node2 and YCC-node3 are sent.This reality Apply example and only list a kind of situation, i.e., same storage equipment is divided into three parts, and respectively with three former chain YCC node matchings； The specific condition that the present embodiment is enumerated is only used for the technical solution content of present patent application for clarity, to the application reality Scope of protection does not constitute restriction, in practical applications, can be selected according to actual needs.

Such as Figure 16, the method for the data storage that the present embodiment proposes is illustrated according to the first above-described situation are as follows:

Block data is written to IPFS node IP FS-node1 in S1401, original chain YCC node YCC-node1；

S1403, the residual storage capacity size that IPFS node IP FS-node1 is sent is received；

S1405, judge whether IPFS-node1 is filled with according to the content recorded on YCC-meta001, if be not filled with, Repeat step S1401 and S1403；If be filled with, step S1407 is executed；

S1407, one is selected from the available node IP FS-node2 or IPFS-node3 of memory space, repeat step S1401 and S1403.

Block data storing process on other two nodes YCC-node2 and YCC-node3 is similar with YCC-node1.

Assuming that the block height where data content YCC-Value on former chain YCC to be checked is YCC-H258, then The method of corresponding data query is the block height YCC-H258 where data to be checked, inquires former chain YCC node The information YCC-meta001 of the data memory node recorded in YCC-node1, YCC-node2 and YCC-node3 any node, YCC-meta002, YCC-meta003, this sentences the inquiry for illustrating the application for the block data of query node YCC-node2 Process, as shown in figure 17:

The YCC-meta002 recorded on S1501, query node YCC-node2 finds the area that block height is YCC-H258 Block number according to place data memory node, it is assumed that on node IP FS-node5；

S1503, the block data that block height on IPFS-node5 is YCC-H258 is read, to find data to be checked Content YCC-Value.

For the high availability of chain YCC former after raising dilatation, the technical solution of the present embodiment is further modified, in former chain Between node YCC-node1, YCC-node2, YCC-node3 on YCC, and the data memory node of each configuration, especially It is that those have been filled between the node of block data, appoint by data memory node periodically (1 or 2 second, can be according to specific Depending on situation needs, the special value that do not enumerated by the embodiment of the present application is limited) Xiang Yuanlian YCC node transmission health status, When partial data memory node is impaired or failure, former chain YCC node will not receive health status notice, thus determine Corresponding data memory node is not in good state or failure, so as to the health status of monitoring system, it is ensured that former chain YCC is healthy and orderly Operation.There are two types of solutions after failure generation, one is former chain YCC node is sent together to there being complete former chain YCC node The request of block data is walked, after request passes through, former chain YCC node stores all block datas according to above-mentioned storage method again On paired data memory node.

Second of solution is exactly that present patent application emphasis is described, in this example, it is assumed that node YCC- Data memory node IPFS-node8, IPFS-node9, IPFS-node10, IPFS-node11 and IPFS- of node3 configuration Node12 has been filled with, and configured new node IP FS-node17, IPFS- of node YCC-node3 before this Node16, IPFS-node15, IPFS-node14 and IPFS-node13；At this point, node YCC-node3 is continuously to IPFS- Node15 memory block data, node IP FS-node17, IPFS-node16, IPFS-node14 and IPFS-node13 storage are empty Between be blank state.Assuming that node YCC-node3 and its data memory node are arranged: being filled with block data every 4 seconds Data memory node sends health status, such as a string of character " Hell0 to node YCC-node3！YCC！", if node YCC- Node3 time-out does not receive the health status feedback character string " Hell0 that IPFS-node12 is sent！YCC！", thus determine to correspond to Data memory node be not in good state or failure.Node YCC-node3 enables High Availabitity technical solution immediately, as shown in figure 18, Method particularly includes:

S1601, node YCC-node3 receive the health status feedback character string " Hell0 that data memory node is sent！ YCC！"；

S1603, with the presence or absence of received over time less than data memory node, if not, being run after former chain YCC dilatation good Good, this method execution terminates；If so, the node failure is determined, it is assumed herein that received over time was sent less than IPFS-node12 Health status feeds back character string " Hell0！YCC！", i.e. node IP FS-node12 failure；

The YCC-meta003 recorded on S1605, query node YCC-node3 inquires the area of the corresponding storage of the malfunctioning node Block altitude range, it is assumed that block altitude range are as follows: 20000-35000；

S1607, to have former chain YCC other or nearby node issues and downloads the block data of the block altitude range The block data that request, i.e. request downloading block height are 20000-35000；

After S1609, request pass through, the block data of the block altitude range is saved in any one and is allocated to YCC- On the vacant data memory node of the memory space of node3, for example it is saved on node IP FS-node16.

Embodiment 9

A kind of equipment, the equipment include: one or more processors；Memory, for storing one or more programs, When one or more of programs are executed by one or more of processors, so that one or more of processors execute Method as described above.

A kind of storage medium being stored with computer program realizes such as above embodiments 1- when the program is executed by processor 8 described in any item methods.

Figure 19 is a kind of structural schematic diagram for equipment that one embodiment of the invention provides.

As shown in figure 19, as on the other hand, present invention also provides a kind of equipment 500, including one or more centers Processing unit (CPU) 501, can be according to the program being stored in read-only memory (ROM) 502 or from storage section 508 The program that is loaded into random access storage device (RAM) 503 and execute various movements appropriate and processing.In RAM503, also It is stored with equipment 500 and operates required various programs and data.CPU501, ROM502 and RAM503 pass through bus 504 each other It is connected.Input/output (I/O) interface 505 is also connected to bus 504.

I/O interface 505 is connected to lower component: the importation 506 including keyboard, mouse etc.；It is penetrated including such as cathode The output par, c 507 of spool (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.；Storage section 508 including hard disk etc.； And the communications portion 509 of the network interface card including LAN card, modem etc..Communications portion 509 via such as because The network of spy's net executes communication process.Driver 510 is also connected to I/O interface 505 as needed.Detachable media 511, such as Disk, CD, magneto-optic disk, semiconductor memory etc. are mounted on as needed on driver 510, in order to read from thereon Computer program be mounted into storage section 508 as needed.

Particularly, according to disclosed embodiments, the method for any of the above-described embodiment description may be implemented as counting Calculation machine software program.For example, disclosed embodiments include a kind of computer program product comprising be tangibly embodied in Computer program on machine readable media, the computer program include the method for executing any of the above-described embodiment description Program code.In such embodiments, which can be downloaded and be pacified from network by communications portion 509 Dress, and/or be mounted from detachable media 511.

As another aspect, present invention also provides a kind of computer readable storage medium, the computer-readable storage mediums Matter can be computer readable storage medium included in the device of above-described embodiment；It is also possible to individualism, it is unassembled Enter the computer readable storage medium in equipment.Computer-readable recording medium storage has one or more than one program, should Program is used to execute by one or more than one processor is described in the present processes.

Flow chart and block diagram in attached drawing are illustrated according to the system of various embodiments of the invention, method and computer journey The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation A part of one module, program segment or code of table, a part of the module, program segment or code include one or more use The executable instruction of the logic function as defined in realizing.It should also be noted that in some implementations as replacements, being marked in box The function of note can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are actually It can be basically executed in parallel, they can also be executed in the opposite order sometimes, this is depending on related function.Also it wants It is noted that the combination of each box in block diagram and or flow chart and the box in block diagram and or flow chart, Ke Yitong The dedicated hardware based system of functions or operations as defined in executing is crossed to realize, or by specialized hardware and can be calculated The combination of machine instruction is realized.

Being described in the embodiment of the present application involved unit or module can be realized by way of software, can also be with It is realized by way of hardware.Described unit or module also can be set in the processor, for example, each unit can To be the software program being arranged in computer or intelligent movable equipment, it is also possible to the hardware device being separately configured.Wherein, this The title of a little units or module does not constitute the restriction to the unit or module itself under certain conditions.

Above description is only the preferred embodiment of the application and the explanation to institute's application technology principle.Those skilled in the art Member is it should be appreciated that invention scope involved in the application, however it is not limited to technology made of the specific combination of above-mentioned technical characteristic Scheme, while should also cover in the case where not departing from the application design, appointed by above-mentioned technical characteristic or its equivalent feature Other technical solutions of meaning combination and formation.Such as features described above and (but being not limited to) disclosed herein have similar functions Technical characteristic replaced mutually and the technical solution that is formed.

Claims

1. being suitable for block chain node for extending the method for block chain memory capacity, which is characterized in that including at least one Data memory node is associated, block data is written to the data memory node, to receive the data memory node hair The storage state come；

Wherein, the data memory node is at least used for block data storage, and sends storage state to block chain node.

2. the method according to claim 1, wherein the storage state that the data memory node is sent, comprising: The block for the block data that the current storage capacity of the data memory node and the data memory node currently save is opened The height that begins and end height.

3. the method according to claim 1, wherein data memory node described in the block chain nodes records Information.

4. according to the method described in claim 3, it is characterized in that, the information of the data memory node, including data store Whether the empty storage size of node title, IP, port, is that current block data save the data memory node used, is protected The beginning block height and end block height for the block data deposited.

5. the method according to claim 1, wherein the block chain node periodically receives data memory node hair The health status come.

6. method according to claim 4, which is characterized in that deposited when the block chain node does not receive data periodically When the health status that storage node is sent, the block counts stored on another data memory node synchrodata memory node are specified According to.

7. being suitable for data memory node for extending the method for block chain memory capacity, which is characterized in that including at least one A block chain node is associated, to save the block data that the block chain node is sent, to send to the block chain node Storage state.

8. method according to claim 7, which is characterized in that the storage state, comprising: the data memory node Current storage capacity and the block of block data that currently saves of the data memory node start height and terminate high Degree.

9. the method according to the description of claim 7 is characterized in that data memory node described in the block chain nodes records Information.

10. according to the method described in claim 9, it is characterized in that, the information of the data memory node, including data store Whether the empty storage size of node title, IP, port, is that current block data save the data memory node used, is protected The beginning block height and end block height for the block data deposited.

11. the method according to the description of claim 7 is characterized in that the block chain node periodically receives data memory node The health status sent.

12. method according to claim 11, which is characterized in that when the block chain node does not receive data periodically When the health status that memory node is sent, specify another data memory node according to the synchronizing information of the data memory node The block data stored on data memory node.

13. a kind of storage method is suitable for block chain node, which is characterized in that including continuously writing to the first data memory node Enter block data, until the first data memory node free memory has been expired, from the available data memory node of memory space The second data memory node of middle selection repeats above step.

14. according to the method for claim 13, which is characterized in that periodically receive the healthy shape that data memory node is sent State.

15. according to the method for claim 14, which is characterized in that deposited when the block chain node does not receive data periodically When the health status that storage node is sent, specify another data memory node according to the synchronizing information number of the data memory node According to the block data stored on memory node.

16. according to the method for claim 15, which is characterized in that record the storage information of data memory node.

17. method according to claim 15 or 16, which is characterized in that the information of the data memory node, including number According to the empty storage size of memory node, title, IP, port, whether be current block data save use data storage Node, the beginning block height and end block height of the block data of preservation.

18. a kind of querying method, which is characterized in that including inquiring block chain link according to the block height where data to be checked The information of the data memory node recorded on point finds the corresponding back end of the block height, reads the data section The block data of the block height on point, to find data to be checked.

19. according to the method for claim 18, which is characterized in that the information of the data memory node, including data are deposited It stores up the empty storage size of node, title, IP, port, whether be that current block data save the data memory node used, The beginning block height and end block height of the block data of preservation.

20. the system for extending block chain memory capacity, which is characterized in that including for block to be written to data memory node Data receive the block chain node for the storage state that the data memory node is sent；

The block data sent for saving the block chain node, the data that Xiang Suoshu block chain node sends storage state are deposited Store up node；

The block chain node is associated at least one block chain node.

21. system according to claim 20, which is characterized in that the information of the data memory node, including data are deposited It stores up the empty storage size of node, title, IP, port, whether be that current block data save the data memory node used, The beginning block height and end block height of the block data of preservation.

22. system according to claim 20, which is characterized in that block chain node periodically receives data memory node and sends Health status.

23. system according to claim 21, which is characterized in that deposited when the block chain node does not receive data periodically When the health status that storage node is sent, specify another data memory node according to the synchronizing information number of the data memory node According to the block data stored on memory node.

24. a kind of equipment, which is characterized in that the equipment includes:

One or more processors；

Memory, for storing one or more programs,

When one or more of programs are executed by one or more of processors, so that one or more of processors Execute the method as described in any one of claim 1-19.

25. a kind of storage medium for being stored with computer program, which is characterized in that realize when the program is executed by processor as weighed Benefit requires method described in any one of 1-19.