CN115834087A - Block chain fragmentation method, system, equipment and storage medium based on stacked network - Google Patents
Block chain fragmentation method, system, equipment and storage medium based on stacked network Download PDFInfo
- Publication number
- CN115834087A CN115834087A CN202310139898.XA CN202310139898A CN115834087A CN 115834087 A CN115834087 A CN 115834087A CN 202310139898 A CN202310139898 A CN 202310139898A CN 115834087 A CN115834087 A CN 115834087A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- fragment
- fragments
- randomly
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A block chain fragmentation method, a system, equipment and a storage medium based on a stacked network are provided, wherein the method comprises the following steps: s1, randomly and uniformly distributing nodes into fragments; s2, after the nodes are randomly and uniformly distributed to one fragment, adding a plurality of other fragments to form a stacked network model; determining precondition to be met by eliminating 51% of attack difficulty of each fragment and minimum and maximum values of adding different fragment quantities to each node; and S3, managing the neighbor nodes, and storing and managing the neighbor nodes in each segment added by the node. The invention has the advantages that: according to the method and the device, 51% of attack difficulty is improved to a single fragment, so that the safety and the decentralization degree of a fragment block chain system are enhanced, and the communication efficiency among nodes in different fragments is improved.
Description
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to a block chain fragmentation method, a system, equipment and a storage medium based on a stacked network.
Background
Blockchain scalability is currently a major bottleneck preventing widespread adoption of distributed ledger technology. The fragmentation technology is one of the mainstream modes for expanding the block chain, and can realize high-performance on-chain expansion without reducing the decentralized degree of the block chain, thereby solving the problems of insufficient expandability and low throughput of the block chain.
However, there are also significant limitations to the fragmentation technique, such as the security of the fragmented blockchain system. In a blockchain system employing PoW consensus, malicious nodes may attack by forging blocks if they control over 50% of the capacity to mine. In fact, it is difficult for an attacker to control over 50% of the mining capacity, but much easier in a tiled blockchain system.
Disclosure of Invention
In order to enhance the security and decentralization degree of a partitioned blockchain system and improve the communication efficiency among nodes in different partitions, the invention provides a blockchain partitioning method, a system, equipment and a storage medium based on a stacked network, and the specific technical scheme is as follows:
the block chain fragmentation method based on the overlay network comprises the following steps:
s1, randomly and uniformly distributing nodes into fragments;
s2, after the nodes are randomly and uniformly distributed to one fragment, adding a plurality of other fragments to form a stacked network model; determining precondition to be met by eliminating 51% of attack difficulty of each fragment and minimum and maximum values of adding different fragment quantities to each node;
and S3, managing the neighbor nodes, and storing and managing the neighbor nodes in each segment added by the node.
Specifically, the specific steps of randomly and uniformly distributing the nodes to the fragments in the step S1 are as follows:
s11, at the beginning of a new network fragmentation period, randomly adding different fragments into each node;
s12, after each node randomly solves a PoW problem based on the node ID and the fragmentation cycle, participating in the fragmentation cycle; finally, nodes are randomly assigned to different shards based on node ID and randomness of the shard period.
Specifically, step S2 includes determining nodes of regions thereof, each of which is divided into regions, according to a random allocation method
A sub-region, each node in the sub-region is added with other fragments in sequence, wherein
Is the number of slices of the entire blockchain system.
Specifically, the minimum value and the maximum value in step S2 are respectively
Wherein
Is the number of slices of the entire blockchain system,
the ratio of the upper limit and the lower limit of the number of the added fragments is set by a block chain system.
Specifically, step S2 further includes an average value
Specifically, the steps of determining the precondition to be satisfied by eliminating 51% of attack difficulty of each fragment are as follows:
if a malicious node wants to control a fragment, the mining capacity must exceed
I.e. by
Wherein
Is the computational effort of the entire blockchain system,
is the number of segments added by a node;
if the security of the tiled blockchain system is not degraded, the following inequality is satisfied:
namely that
。
Specifically, in step S3, a distributed hash table is used to perform storage management on the neighbor node in each segment added by the node.
The system for using the block chain fragmentation method based on the overlay network is characterized by comprising the following modules,
stacking network models, wherein after nodes in the models are randomly and uniformly distributed into different fragments, other different fragments are added, and any node communicates with the nodes in the fragment to acquire block, transaction and state data;
the node distribution unit is used for randomly and uniformly distributing the nodes to one fragment and then adding a plurality of other fragments;
the security management module is used for determining a precondition which needs to be met by eliminating 51% of attack difficulty of each fragment and the minimum value and the maximum value of the number of different fragments added into each node;
and the neighbor node storage unit is used for storing neighbor nodes of the nodes in each fragment.
An apparatus comprising a memory and a processor; wherein the memory is configured to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement the above-described method.
A storage medium having stored thereon computer instructions which, when executed by a processor, implement the above-described method.
The invention has the advantages that:
according to the method and the device, 51% of attack difficulty is improved to a single fragment, so that the safety and the decentralization degree of a fragment block chain system are enhanced, a plurality of other fragments are added after the nodes are randomly and uniformly distributed to one fragment, a stacked network model is formed, and the communication efficiency among the nodes in different fragments is improved.
Maximum value
The arrangement of (3) can avoid the decentralization degree reduction of the partitioned block chain system; minimum value of
The arrangement of the method ensures the safety of the fragments and prevents miners from adding too few fragments.
Drawings
Fig. 1 is a diagram of a stacked network model.
Fig. 2 is a schematic diagram of nodes allocated in different regions.
Fig. 3 is a schematic diagram of adding other multiple segments to a node.
FIG. 4 is a diagram of a computer system that can be used to implement aspects of the present invention.
Detailed Description
As shown in fig. 1, the block chain fragmentation method based on the overlay network of the present embodiment includes the following steps:
s1, randomly and uniformly distributing nodes into fragments; the slice forming method comprises the following steps: firstly, at the beginning of a new network fragmentation period, each node randomly adds different fragments; specifically, at regular intervals (for example, 3 days), all nodes of the block chain are randomly re-allocated to be added to different fragments to prevent node cheating; then, each node participates in a fragmentation cycle after solving a PoW problem based on node identity (node ID) and fragmentation period randomness; finally, the nodes are randomly assigned to different shards based on the node ID and the randomness of the sharding period. As shown in fig. 2. The number of regions U, V and W equal to the number of tiles is created by the blockchain randomness. In fig. 2, each node in the U, V and W regions is assigned to a slice s1, s2 and s3, respectively, and thus nodes n1 and n2 are assigned to a slice s1.
S2, adding the node into other multiple fragments as shown in the figure 1; after being randomly and uniformly distributed to one segment, the nodes are added with a plurality of other segments to form a stacked network model, and in fig. 3, each area (U, V and W in fig. 2) is divided into
A sub-region therein
Is the number of slices of the whole blockchain system; each node in the sub-region adds other shards in sequence. In fig. 3, the area U is divided into 2 (i.e. 3-1) sub-areas U1 and U2, and each node in the areas U1 and U2 connects the slices s2 and s3, respectively, so that the node n1 connects the slice s2 and the node n2 connects the slice s3. Similarly, each node may add more other shards. Since the node n1 and the node n2 in the segment s1 are also respectively allocated to the segment s2 and the segmentIn s3, the node n1 of the segment s2 stores the full data of the segment s2, and similarly, the node n2 of the segment s3 stores the full data of the segment s3, so that the segment s1 and the segment s2 can realize high-efficiency communication through the node n1, and the segment s1 and the segment s3 can realize high-efficiency communication through the node n 2.
In a tiled blockchain system, one of the major security issues is an attack on a single tile. For example, in a system employing PoW consensus, if a malicious node controls over 50% of the capacity to mine, an attack may be launched by forging a block. It is assumed that the mining capacity of a malicious node in a non-sharded blockchain system does not exceed 50%, but in a sharded blockchain system, each shard must satisfy the condition that a malicious participant has less than 50% mining capacity in each shard. This will result in a reduced security of the sharded blockchain.
If a malicious node wants to control a fragment, the mining capacity must exceed
I.e. by
Wherein
Is the computational effort of the entire blockchain system,
is the number of segments added by a node;
if the security of the tiled blockchain system is not degraded, the following inequality is satisfied:
namely, it is
。
If too few fragments are added by miners, a malicious node may control more than 50% of mining capacity in one fragment, and if too many fragments are added by miners, the decentralization degree of the block chain system is reduced, so that the number of the added fragments of the miners needs to be determined within a range. Wherein miners tend to add more slices, or even all slices, to obtain more mine digging rewards, but with greater energy consumption and less decentralization. Therefore, according to the IT resource capacity of miners, the miners can add the average value of different fragment numbers
Minimum value of
And maximum value
Are respectively as
Wherein the content of the first and second substances,
to avoid the decentralization degree of the partitioned blockchain system from being reduced;
the method is used for ensuring the safety of the fragments and preventing miners from adding too few fragments, so that malicious nodes can control the fragments more easily;
is added to the ratio of the upper and lower limits of the number of the fragments, and is a block chain systemThe system is set by itself. For example, the average number of different slices added by the miners is 12,
and when the number of the added different fragments is 25%, the number of the added different fragments is 9 to 15.
S3, managing neighbor nodes; because each node can be added with a plurality of fragments, the node has neighbor nodes in each fragment, so the neighbor nodes of the node in each fragment need to be managed and stored, and subsequent cross-fragment communication, transaction and other behaviors are facilitated. The neighbor nodes in each segment that the node joins are stored by employing DHT (distributed hash table). For example, the neighbor nodes of node n1 are shown in table 1.
TABLE 1
Node n1 has a DHT of two neighboring nodes because it connects two slices s1 and s2. In the segment s1, the node n1 has three adjacent nodes n2, n4 and n5, which are also added to other segments, respectively.
The embodiment further includes a system using the above method for partitioning a blockchain based on a stacked network, including:
stacking network models, wherein after nodes in the models are randomly and uniformly distributed into different fragments, other different fragments are added, and any node communicates with the nodes in the fragment to acquire data such as blocks, transactions, states and the like; as shown in fig. 1, in the overlay network model, nodes are randomly and uniformly distributed to different slices. In addition, each node must add more shards to ensure the security of the sharded blockchain system.
The node distribution unit is used for randomly and uniformly distributing the nodes to one fragment and then adding a plurality of other fragments; as shown in fig. 1, nodes n1 and n2 are assigned to a slice s1. Meanwhile, the node n1 adds another segment s2, and the node n2 adds another segment s3. There are 4 nodes in the slice s 1: n1, n2, n4 and n5, wherein the nodes n1 and n4 also add the segment s2, and the nodes n2 and n5 also add the segment s3. Therefore, the slice s1 may acquire the data of the slice s2 from n1, and may also acquire the data of the slice s3 from n 2.
The safety management module is used for determining a precondition which needs to be met by eliminating 51% of attack difficulty of each fragment and the minimum value and the maximum value of the number of different fragments added into each node;
the precondition to be satisfied for determining that each fragment eliminates 51% of attack difficulty is as follows:
if a malicious node wants to control a fragment, the mining capacity must exceed
I.e. by
Wherein
Is the computational effort of the entire blockchain system,
is the number of segments added by a node;
if the security of the tiled blockchain system is not degraded, the following inequality is satisfied:
namely, it is
。
Determining the average value, the minimum value and the maximum value of the number of different fragments added into each node as follows:
adding averages of different numbers of slices
Minimum value of
And maximum value
Are respectively as
Wherein
Is the number of slices of the entire blockchain system,
is the ratio of the upper and lower limits of the number of added fragments and is set by the block chain system.
And the neighbor node storage unit is used for storing the neighbor nodes of the nodes in each fragment.
The present embodiment also includes an apparatus comprising a memory and a processor; wherein the memory is configured to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement the above-mentioned stacked network based blockchain fragmentation method.
As shown in fig. 4, the present embodiment also discloses a computer system 1000 including a processor (CPU, GPU, FPGA, etc.) 1001 that can perform part or all of the processing in the embodiment shown in the above-described drawings according to a program stored in a Read Only Memory (ROM) 1002 or a program loaded from a storage section 1008 into a Random Access Memory (RAM) 1003. In the RAM1003, various programs and data necessary for the operation of the system 1000 are also stored. The processor 1001, ROM1002, and RAM1003 are connected to each other by a bus 1004. An input/output (I/O) interface 1005 is also connected to bus 1004. The following components are connected to the I/O interface 1005: an input section 1006 including a keyboard, a mouse, and the like; an output portion 1007 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 1008 including a hard disk and the like; and a communication section 1009 including a network interface card such as a LAN card, a modem, or the like. The communication section 1009 performs communication processing via a network such as the internet. A drive 1010 is also connected to the I/O interface 1005 as necessary. A removable medium 1011 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1010 as necessary, so that a computer program read out therefrom is mounted into the storage section 1008 as necessary.
In particular, according to embodiments of the present disclosure, the methods described above with reference to the figures may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a medium readable thereby, the computer program comprising program code for performing the methods of the figures. In such embodiments, the computer program may be downloaded and installed from a network through the communication section 1009 and/or installed from the removable medium 1011.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowcharts or block diagrams may represent a module, a program segment, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present disclosure may be implemented by software or hardware. The units or modules described may also be provided in a processor, and the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.
The present disclosure also provides a computer storage medium, it is understood that the computer storage medium is a computer readable storage medium, which may be the computer readable storage medium included in the node in the above embodiments; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present disclosure.
The invention is not to be considered as limited to the specific embodiments shown and described, but is to be understood to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. The block chain fragmentation method based on the overlay network is characterized by comprising the following steps:
s1, randomly and uniformly distributing nodes into fragments;
s2, after the nodes are randomly and uniformly distributed to one fragment, adding a plurality of other fragments to form a stacked network model; determining precondition to be met by eliminating 51% of attack difficulty of each fragment and minimum and maximum values of adding different fragment quantities to each node;
and S3, managing the neighbor nodes, and storing and managing the neighbor nodes in each segment added by the node.
2. The method for slicing a blockchain based on a stacked network according to claim 1, wherein the specific steps of randomly and uniformly distributing the nodes to the slices in step S1 are as follows:
s11, at the beginning of a new network fragmentation period, randomly adding different fragments into each node;
s12, after each node randomly solves a PoW problem based on the node ID and the fragmentation cycle, participating in the fragmentation cycle; finally, nodes are randomly assigned to different shards based on node ID and randomness of the shard period.
3. The method according to claim 1, wherein step S2 comprises determining nodes of areas thereof according to a random allocation method, each area being divided into areas
A sub-region, each node in the sub-region is added with other fragments in sequence, wherein
Is the number of slices of the entire blockchain system.
4. The method for stacking network based blockchain fragmentation of claim 1, wherein the minimum and maximum values in step S2 are respectively
Wherein
Is the number of slices of the entire blockchain system,
is added into the ratio of the upper and lower limits of the number of the fragments, and is automatically added by the block chain systemAnd setting a row.
5. The method for stacking network based blockchain fragmentation of claim 4, wherein step S2 further comprises averaging
6. The method for stacking network-based blockchain fragmentation according to claim 1, wherein the step of determining the precondition to be satisfied for each fragment to eliminate 51% of attack difficulty is:
if a malicious node wants to control a fragment, the mining capacity must exceed
I.e. by
Wherein
Is the computational effort of the entire blockchain system,
is the number of added fragments of a node;
if the security of the tiled blockchain system is not degraded, the following inequality is satisfied:
namely, it is
。
7. The method for stacking network-based blockchain fragmentation according to claim 1, wherein in step S3, a distributed hash table is used to perform storage management on the neighbor nodes in each fragmentation added by the node.
8. System for using the method for stacking network based blockchain fragmentation according to any of claims 1 to 7, characterized in that it comprises the following modules,
stacking network models, wherein after nodes in the models are randomly and uniformly distributed into different fragments, other different fragments are added, and any node communicates with the nodes in the fragment to acquire block, transaction and state data;
the node distribution unit is used for randomly and uniformly distributing the nodes to one fragment and then adding a plurality of other fragments;
the security management module is used for determining a precondition which needs to be met by eliminating 51% of attack difficulty of each fragment and the minimum value and the maximum value of the number of different fragments added into each node;
and the neighbor node storage unit is used for storing neighbor nodes of the nodes in each fragment.
9. An apparatus comprising a memory and a processor; wherein the memory is to store one or more computer instructions, wherein the one or more computer instructions are to be executed by the processor to implement the method of any one of claims 1 to 7.
10. A storage medium having stored thereon computer instructions which, when executed by a processor, implement the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310139898.XA CN115834087B (en) | 2023-02-21 | 2023-02-21 | Block chain slicing method, system, equipment and storage medium based on stacked network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310139898.XA CN115834087B (en) | 2023-02-21 | 2023-02-21 | Block chain slicing method, system, equipment and storage medium based on stacked network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115834087A true CN115834087A (en) | 2023-03-21 |
| CN115834087B CN115834087B (en) | 2023-06-06 |
Family
ID=85521966
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310139898.XA Active CN115834087B (en) | 2023-02-21 | 2023-02-21 | Block chain slicing method, system, equipment and storage medium based on stacked network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115834087B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020011154A1 (en) * | 2018-07-09 | 2020-01-16 | 云图有限公司 | Method, apparatus, and system for blockchain transparent fragmentation |
| CN112468255A (en) * | 2020-12-10 | 2021-03-09 | 电子科技大学 | Block link point time synchronization method based on network consensus and VRF algorithm |
| US20210256016A1 (en) * | 2018-06-25 | 2021-08-19 | Commonwealth Scientific And Industrial Research Organisation | Blockchain system and method |
| CN113626875A (en) * | 2021-07-06 | 2021-11-09 | 北京理工大学 | Knowledge graph file storage method for block chain fragment enabling |
-
2023
- 2023-02-21 CN CN202310139898.XA patent/CN115834087B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20210256016A1 (en) * | 2018-06-25 | 2021-08-19 | Commonwealth Scientific And Industrial Research Organisation | Blockchain system and method |
| WO2020011154A1 (en) * | 2018-07-09 | 2020-01-16 | 云图有限公司 | Method, apparatus, and system for blockchain transparent fragmentation |
| CN112468255A (en) * | 2020-12-10 | 2021-03-09 | 电子科技大学 | Block link point time synchronization method based on network consensus and VRF algorithm |
| CN113626875A (en) * | 2021-07-06 | 2021-11-09 | 北京理工大学 | Knowledge graph file storage method for block chain fragment enabling |
Non-Patent Citations (1)
| Title |
|---|
| 王柯元，姜鑫，贾林鹏，段田田，孙毅: "区块链星型分片架构通量模型及应用" * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115834087B (en) | 2023-06-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10664485B2 (en) | Block chain mining method, device, and node apparatus | |
| US20190349185A1 (en) | Block generation method in blockchain-based system | |
| EP3454519B1 (en) | Block generation method and device, and blockchain network | |
| US11190525B2 (en) | Blockchain system and permission management method thereof | |
| US20190303622A1 (en) | Bicameral framework for fast and tamper-resistant blockchain validation | |
| CN109474423A (en) | Data encryption/decryption method, server and storage medium | |
| CN102449616A (en) | Swarm-based synchronization over a network of object stores | |
| US20230009961A1 (en) | Graphic-blockchain-orientated sharding storage apparatus and method thereof | |
| US20220101318A1 (en) | Transaction Assignment Method and Apparatus Based on Structured Directed Acyclic Graph | |
| US9785515B2 (en) | Directed backup for massively parallel processing databases | |
| CN108519917A (en) | A kind of resource pool distribution method and device | |
| CN106156159A (en) | A kind of table connection processing method, device and cloud computing system | |
| CN110336668B (en) | Random number generation method and device, application, equipment and storage medium | |
| WO2021190179A1 (en) | Synchronous processing method and related apparatus | |
| CN115834087A (en) | Block chain fragmentation method, system, equipment and storage medium based on stacked network | |
| King et al. | Scalable byzantine computation | |
| CN111988345A (en) | Information synchronization method and device | |
| CN115878729B (en) | Node block storage allocation optimization method and system based on alliance chain | |
| CN116962176A (en) | Data processing method, device and system of distributed cluster and storage medium | |
| CN111340623A (en) | Data storage method and device | |
| CN116112507A (en) | Hierarchical blockchain-based multitasking asynchronous execution method and device | |
| CN113468200B (en) | Method and device for expanding fragments in block chain system | |
| CN114637472A (en) | DHT-based block chain storage expansion method, electronic equipment and storage medium | |
| CN103281395A (en) | Data piece equipartition selecting system and method based on number of client-sides | |
| CN105653710A (en) | Method and device for constructing file system |
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 |