CN112734586A - Data processing method and system based on block chain - Google Patents
Data processing method and system based on block chain Download PDFInfo
- Publication number
- CN112734586A CN112734586A CN202110113064.2A CN202110113064A CN112734586A CN 112734586 A CN112734586 A CN 112734586A CN 202110113064 A CN202110113064 A CN 202110113064A CN 112734586 A CN112734586 A CN 112734586A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- nodes
- intelligent contract
- preset
- 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.)
- Pending
Links
- 238000003672 processing method Methods 0.000 title claims description 8
- 238000000034 method Methods 0.000 claims abstract description 50
- 238000004806 packaging method and process Methods 0.000 claims abstract description 19
- 238000012856 packing Methods 0.000 claims description 10
- 230000008569 process Effects 0.000 abstract description 25
- 230000009471 action Effects 0.000 description 3
- 230000005611 electricity Effects 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/08—Insurance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Economics (AREA)
- General Engineering & Computer Science (AREA)
- Marketing (AREA)
- Data Mining & Analysis (AREA)
- Health & Medical Sciences (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Water Supply & Treatment (AREA)
- Primary Health Care (AREA)
- Human Resources & Organizations (AREA)
- Tourism & Hospitality (AREA)
- General Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Public Health (AREA)
- Software Systems (AREA)
- Development Economics (AREA)
- Technology Law (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The block chain service system comprises a plurality of nodes, after receiving first data of a preset type, the first nodes broadcast information of the first data chain, each node stores a region obtained by packaging the first data by a first master node into a local block chain, and generates an intelligent contract corresponding to the first data, so that the problem of data loss caused by the fact that the data is stored in a single node when the single node fails can be solved. After receiving second data associated with the first data in a preset mode, the first nodes broadcast messages of a second data uplink, each node stores an area obtained by packaging the second data by a second master node into a local block chain, and executes an intelligent contract corresponding to the first data according to the second data to obtain an execution result. By applying the scheme provided by the application, the problem that the claim settlement process is long due to the fact that a large number of people are required to check in the claim settlement process can be avoided.
Description
Technical Field
The present application relates to the field of electronic information, and in particular, to a data processing method and system based on a block chain.
Background
In order to prevent some risks from causing huge economic losses in the process of enterprise operation, insurance contracts are generally made with insurance companies to avoid enterprise losses.
Currently, insurance products, signatures of insurance contracts and the like are stored in a server of an insurance company, if the stored data of the server of the insurance company is damaged, the claim settlement flow of an insured party is affected, and the claim settlement process is long because a large number of personnel are required to check in the insurance claim settlement process.
Disclosure of Invention
The application provides a data processing method and system based on a block chain, and aims to solve the problems that the claim settlement process of an insured party is affected due to damage of archived data of an insurance company server, and the claim settlement process is long due to the fact that a large number of personnel are required to check in the insurance claim settlement process.
In order to achieve the above object, the present application provides the following technical solutions:
a data processing method based on a block chain is applied to a block chain service system, the block chain service system comprises a plurality of nodes, and the method comprises the following steps:
after receiving first data of a preset type, a first node broadcasts a message of a first data uplink; the first node is any one of the plurality of nodes;
each node in the plurality of nodes stores an area obtained by packaging the first data by a first main node into a local block chain, and generates an intelligent contract corresponding to the first data; the first master node is one of the plurality of nodes;
after receiving second data associated with the first data preset, the first node broadcasts a message of the second data uplink;
each node in the plurality of nodes stores an area obtained by packaging the second data by a second main node into the local block chain, and executes the intelligent contract according to the second data to obtain an execution result; the second master node is one of the plurality of nodes.
In the foregoing method, optionally, the first host node and the second host node are: nodes generated by the plurality of nodes through competition or nodes preset in the plurality of nodes.
In the foregoing method, optionally, the process of generating the first master node by the plurality of nodes through contention includes:
each node calculates and obtains an alternative score of the node according to a preset node credit level and a preset function, and broadcasts the alternative score;
each node determines the sequence between the calculated alternative scores and the alternative scores broadcasted by other received nodes, and determines to be an alternative node when the sequence is within a preset sequence range;
each alternative node packs the first data into blocks, generates unique priorities of the blocks, and broadcasts the blocks with the highest priority in a block set, wherein the block set comprises the blocks generated by the alternative nodes and the blocks obtained by packing the first data and broadcasted by other received alternative nodes;
and each alternative node takes the alternative node generating the block with the priority as the main node when the number of other alternative nodes receiving the block with the same broadcast priority is larger than a threshold value.
Optionally, the method for generating, by the node, an intelligent contract corresponding to the first data includes:
the node generates an intelligent contract template corresponding to the preset type according to the preset type of the first data, and sends the intelligent contract template to a preset user, so that the user fills in an item to be filled in the intelligent contract template;
and after receiving the intelligent contract template returned by the user, the node takes the returned intelligent contract template as the intelligent contract corresponding to the first data.
The method described above, optionally, before the node executes the intelligent contract, further includes:
and the node determines the first data associated with the second data according to the identifier carried by the second data, and acquires the intelligent contract corresponding to the first data.
In the above method, optionally, after each node obtains the execution result, the method further includes packing the execution result into a block and storing the block into the local block chain.
A blockchain service system, the blockchain service system comprising a plurality of nodes;
the first node is used for broadcasting the information of the first data uplink after receiving first data of a preset type; the first node is any one of the plurality of nodes;
each node in the plurality of nodes is used for storing an area obtained by packaging the first data by the first main node into a local block chain and generating an intelligent contract corresponding to the first data; the first master node is one of the plurality of nodes;
the first node is further configured to broadcast a message of the second data uplink after receiving second data associated with the first data preset;
each node in the plurality of nodes is further configured to store an area obtained by packing the second data by the second host node into the local block chain, and execute the intelligent contract to obtain an execution result; the second master node is one of the plurality of nodes.
In the above block chain service system, optionally, the first host node and the second host node are: nodes generated by the plurality of nodes through competition or nodes preset in the plurality of nodes.
In the above block chain service system, optionally, the node is configured to generate an intelligent contract corresponding to the first data, and the node is specifically configured to: generating an intelligent contract template corresponding to the preset type according to the preset type of the first data, and sending the intelligent contract template to a preset user to enable the user to fill in an item to be filled in the intelligent contract template; and after receiving the intelligent contract template returned by the user, taking the returned intelligent contract template as the intelligent contract corresponding to the first data.
In the above block chain service system, optionally, the node is further configured to: and determining the first data associated with the second data according to the identifier carried by the second data, and acquiring the intelligent contract corresponding to the first data.
The method is applied to a block chain service system, the block chain service system comprises a plurality of nodes, after a first node receives first data (such as an insurance contract) of a preset type, a message of a chain of the first data is broadcasted, each node in the plurality of nodes stores a region obtained by packaging the first data by a first main node into a local block chain, and an intelligent contract (such as an insurance claim intelligent contract) corresponding to the first data is generated, namely each node in the block chain service system stores the first data, and the problem that data is stored in a single node to cause data loss when the single node fails can be avoided.
Further, after receiving second data (for example, claim information associated with an insurance contract) preset and associated with the first data, the first node broadcasts a message for chaining the second data, each node of the plurality of nodes stores an area obtained by packaging the second data by the second master node into a local block chain, and executes an intelligent contract corresponding to the first data according to the second data to obtain an execution result, for example, executes the claim intelligent contract according to the claim information to obtain a claim result, so that the problem that the claim settlement process is long due to the fact that a large number of people are required to check in the claim settlement process is solved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of a data processing method based on a block chain according to an embodiment of the present application;
fig. 2 is a flowchart of a method for generating a first master node by a plurality of nodes through contention according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a data processing system based on a block chain according to an embodiment of the present disclosure.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The data processing method based on the block chain provided by the embodiment of the application can be applied to a block chain service system, and the block chain service system comprises a plurality of nodes. The method provided by the embodiment can comprise the following steps:
s101, after receiving first data of a preset type, a first node broadcasts a first data uplink message.
The first node is any one of a plurality of nodes included in the block chain service system. After receiving the first data uploaded by the user, the first node may determine whether the first data is data of a preset type according to the identifier of the data type carried by the first data. The preset type of first data may be an insurance contract.
After receiving the first data of the preset type, the first node broadcasts the information of the first data uplink, so that each node of the block chain service system can receive the information of the first data uplink.
S102, each node in the plurality of nodes stores the area obtained by packaging the first data by the first master node into a local block chain, and generates an intelligent contract corresponding to the first data.
The first master node is one of the nodes, and in this embodiment, the first master node may be a node generated by the nodes through contention, and may be a preset node of the nodes. In which a plurality of nodes generate a first master node through contention, the process shown in fig. 2 has been referred.
The specific implementation manner of the node generating the intelligent contract corresponding to the first data may be: the node generates an intelligent contract template corresponding to the preset type according to the preset type of the first data, sends the intelligent contract template to a preset user, enables the user to fill in the items to be filled in the intelligent contract template, and after receiving the intelligent contract template returned by the user, the node takes the returned intelligent contract template as an intelligent contract corresponding to the first data. The node can generate an intelligent contract template corresponding to a preset type according to the preset type of the first data stored in advance and a generation rule of the intelligent contract template. For example, if the preset type of first data is insurance contracts, the intelligent contract template may be an insurance claim intelligent contract template. The specific generation rule can be set according to the content of the intelligent contract template.
S103, after receiving second data associated with the first data preset, the first node broadcasts a second data uplink message.
The first node is any one of a plurality of nodes. The first node may determine the first data associated with the second data according to the identifier carried by the second data. The identifier carried by the second data may be a preset code of the first data.
After receiving second data associated with the first data preset, the first node broadcasts a second data uplink message, so that each node of the block chain service system can receive the second data uplink message.
And S104, each node in the plurality of nodes stores the area obtained by packaging the second data by the second master node into the local block chain, and executes an intelligent contract according to the second data to obtain an execution result.
Wherein the second master node is one of the plurality of nodes. The second master node may be a node generated by a plurality of nodes through contention, and may be a preset one of the plurality of nodes. The process of generating the second host node by the plurality of nodes through contention is the same as the process of generating the first host node by the plurality of nodes through contention, and details are not repeated here.
And S105, each node stores the execution result to the local block chain.
Because the local block chain of each node stores a block including first data and an intelligent contract corresponding to the first data, after the node receives the block including second data, the node determines the first data associated with the second data according to an identifier that can be carried by the second data, acquires the intelligent contract corresponding to the first data, and finally executes the intelligent contract according to the second data to obtain an execution result, for example, executes the intelligent contract according to claim settlement information to obtain a claim settlement result.
The method is applied to a block chain service system, the block chain service system comprises a plurality of nodes, after a first node receives first data (such as an insurance contract) of a preset type, a message of a chain of the first data is broadcasted, each node in the plurality of nodes stores a region obtained by packaging the first data by a first main node into a local block chain, and an intelligent contract (such as an insurance claim intelligent contract) corresponding to the first data is generated, namely each node in the block chain service system stores the first data, and the problem that data is stored in a single node to cause data loss when the single node fails can be avoided.
Further, after receiving second data (for example, claim information associated with an insurance contract) preset and associated with the first data, the first node broadcasts a message for chaining the second data, each node of the plurality of nodes stores an area obtained by packaging the second data by the second master node into a local block chain, and executes an intelligent contract corresponding to the first data according to the second data to obtain an execution result, for example, executes the claim intelligent contract according to the claim information to obtain a claim result, so that the problem that the claim settlement process is long due to the fact that a large number of people are required to check in the claim settlement process is solved.
Furthermore, the safety and reliability of the uplink data information of the user can be ensured by utilizing the non-tamper property and traceability of the block link data of the block link.
Fig. 2 is a flowchart of a method for generating a first master node by a plurality of nodes through contention in the foregoing embodiment, and may include the following steps:
s201, each node calculates to obtain an alternative score of the node according to a preset node credit level and a preset function, and broadcasts the alternative score.
And each node takes the preset node credit level as a calculation parameter of a preset function, and calculates to obtain the candidate score of the node, wherein optionally, the higher the node credit level is, the higher the candidate score calculated by adopting the preset function is. After each node calculates the candidate score of itself, the node broadcasts the candidate score, so that other nodes can acquire the broadcasted candidate score.
S202, each node determines the sequence between the calculated alternative score and the received alternative scores broadcasted by other nodes, and determines to be an alternative node under the condition that the sequence is in a preset sequence range.
The sequential range may be set according to a preset number of candidate nodes, for example, if the preset number of candidate nodes is 5, the sequential range may be that the candidate scores are sorted from high to low in the top five.
Each node determines the rank between its own candidate score and the candidate scores of other nodes, and if the rank is in a preset rank range, for example, the rank range is the top five ranks, and the rank of the candidate score of the node is the third, then it is determined that it becomes the candidate node.
S203, each alternative node packs the first data into blocks, generates the unique priority of the blocks and broadcasts the blocks with the highest priority in the block set.
The priority of the block can be obtained according to the hash value of the block, and since the hash value of each block is different, the priority of the block can be ensured to be unique.
Each node broadcasts the block with the highest priority in the block set, wherein the block set comprises the blocks generated by the alternative nodes and the blocks obtained by packaging the first data and broadcasted by other alternative nodes. And under the condition that other blocks broadcasted by other nodes are not received by any node, the block set only comprises the block obtained by self packaging of the node, and the block broadcasted by the node is the block packaged by the node.
And S204, when the number of other alternative nodes of the block with the same broadcast priority is greater than a threshold value, each alternative node takes the alternative node of the block with the priority as a main node.
For example, there are 5 candidate nodes in total, and each candidate node takes the candidate node generating the block with the priority level of 5 as the master node when the total number of other candidate nodes receiving the broadcasted block with the priority level of 5 reaches 4.
According to the scheme provided by the application, the preset number of the alternative nodes are selected from the multiple nodes, the generated alternative nodes of the block with the highest priority are used as the main nodes, and the difficulty of the common identification of the main nodes is low when all the nodes achieve the purpose of selecting the main nodes, so that the efficiency of selecting the main nodes is improved.
The following describes the scheme provided by the present application, taking a plurality of nodes included in the blockchain service system as nodes of an insurance company, an electricity company, an electric power company, and a supervision organization, respectively, as an example:
the electric power company refers to a company providing electric power, and the electric power company makes an electric power insurance contract with the electric power company through an insurance company, and the supervision institution may be an institution related to electric power management.
The present embodiment may include the following steps:
(1) and each node packs the uploaded power serial numbers of the power utilization companies into blocks and stores the blocks into a local block chain.
(2) After receiving an insurance contract which is set by an insurance company and is signed between the power utilization company and the electric power company, any node generates a first main node through competition.
(3) And each node stores the blocks obtained by packaging the insurance contracts by the first main node into a local block chain and generates corresponding claim settlement intelligent contracts.
(4) After receiving the power consumption claim data carrying the power serial number of the power consumption company, any node generates a second main node through competition.
(5) And each node stores the blocks obtained by packing the power claim data by the second main node into a local block chain, and executes automatic claim settlement according to a claim settlement intelligent contract to obtain a claim settlement result.
(6) And each node packs the claim settlement result into blocks and stores the blocks into the local block chain.
In the method provided by the embodiment, based on the characteristic that the blockchain cannot be tampered, the nodes of an insurance company, an electricity company, an electric power company and a supervision organization are used as common identification nodes, and all the nodes store the full amount of data to guarantee the safety and the reliability of the data together. The problem that the filing data of the server of the insurance company is damaged, so that the claim settlement process of an insured party is influenced is solved. And the claim settlement result is that automatic claim settlement is executed according to the claim settlement intelligent contract, so that the problem that the claim settlement process is long because a large number of personnel are required to check in the insurance claim settlement process can be avoided.
Referring to fig. 3, the present application further provides a blockchain service system, which includes a plurality of nodes (e.g., node 1 to node m shown in fig. 3).
The first node is used for broadcasting the information of the first data uplink after receiving the first data of the preset type; the first node is any one of the plurality of nodes;
each node in the plurality of nodes is used for storing an area obtained by packing the first data by the first master node into a local block chain and generating an intelligent contract corresponding to the first data; the first master node is one of the plurality of nodes;
the first node is further configured to broadcast a second data uplink message after receiving second data associated with the first data preset;
each node in the plurality of nodes is further configured to store an area obtained by packing second data by the second master node into the local block chain, and execute an intelligent contract to obtain an execution result; the second master node is one of the plurality of nodes.
Optionally, in the block chain service system, the first host node and the second host node are: the nodes generated by the plurality of nodes through competition or preset nodes in the plurality of nodes. Wherein the process of generating the first master node by a plurality of nodes through contention comprises:
each node calculates and obtains an alternative score of the node according to a preset node credit level and a preset function, and broadcasts the alternative score;
each node determines the sequence between the calculated alternative scores and the alternative scores broadcasted by other received nodes, and determines to be an alternative node when the sequence is within a preset sequence range;
each alternative node packs the first data into blocks, generates unique priorities of the blocks, and broadcasts the blocks with the highest priority in a block set, wherein the block set comprises the blocks generated by the alternative nodes and the blocks obtained by packing the first data and broadcasted by other received alternative nodes;
and each alternative node takes the alternative node generating the block with the priority as the main node when the number of other alternative nodes receiving the block with the same broadcast priority is larger than a threshold value.
Optionally, in the above block chain service system, the node configured to generate an intelligent contract corresponding to the first data includes that the node is specifically configured to: and generating an intelligent contract template corresponding to the preset type according to the preset type of the first data, sending the intelligent contract template to a preset user, filling the to-be-filled item in the intelligent contract template by the user, and taking the returned intelligent contract template as the intelligent contract corresponding to the first data after receiving the intelligent contract template returned by the user.
Optionally, in the above block chain service system, the node is further configured to: and determining the first data associated with the second data according to the identifier carried by the second data, and acquiring the intelligent contract corresponding to the first data.
Optionally, in the block chain service system, the node is further configured to pack the execution result into a block and store the block into the local block chain.
The block chain service system comprises a plurality of nodes, wherein after a first node receives first data (such as an insurance contract) of a preset type, a message of a first data chain is broadcasted, each node in the plurality of nodes stores a region obtained by packaging the first data by a first master node into a local block chain, and generates an intelligent contract (such as an insurance claim intelligent contract) corresponding to the first data, namely each node in the block chain service system stores the first data, and the problem of data loss caused by data storage in a single node when the single node fails can be avoided.
Further, after receiving second data (for example, claim information associated with an insurance contract) preset and associated with the first data, the first node broadcasts a message for chaining the second data, each node of the plurality of nodes stores an area obtained by packaging the second data by the second master node into a local block chain, and executes an intelligent contract corresponding to the first data according to the second data to obtain an execution result, for example, executes the claim intelligent contract according to the claim information to obtain a claim result, so that the problem that the claim settlement process is long due to the fact that a large number of people are required to check in the claim settlement process is solved.
Furthermore, the safety and reliability of the uplink data information of the user can be ensured by utilizing the non-tamper property and traceability of the block link data of the block link.
It should be noted that, in the present specification, the embodiments are all described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments may be referred to each other. For the device-like embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functions of the units may be implemented in the same software and/or hardware or in a plurality of software and/or hardware when implementing the invention.
From the above description of the embodiments, it is clear to those skilled in the art that the present invention can be implemented by software plus necessary general hardware platform. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which may be stored in a storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the embodiments or some parts of the embodiments.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A data processing method based on a block chain is applied to a block chain service system, the block chain service system comprises a plurality of nodes, and the method comprises the following steps:
after receiving first data of a preset type, a first node broadcasts a message of a first data uplink; the first node is any one of the plurality of nodes;
each node in the plurality of nodes stores an area obtained by packaging the first data by a first main node into a local block chain, and generates an intelligent contract corresponding to the first data; the first master node is one of the plurality of nodes;
after receiving second data associated with the first data preset, the first node broadcasts a message of the second data uplink;
each node in the plurality of nodes stores an area obtained by packaging the second data by a second main node into the local block chain, and executes the intelligent contract according to the second data to obtain an execution result; the second master node is one of the plurality of nodes.
2. The method of claim 1, wherein the first host node and the second host node are: nodes generated by the plurality of nodes through competition or nodes preset in the plurality of nodes.
3. The method of claim 2, wherein the step of the plurality of nodes generating the first master node through contention comprises:
each node calculates and obtains an alternative score of the node according to a preset node credit level and a preset function, and broadcasts the alternative score;
each node determines the sequence between the calculated alternative scores and the alternative scores broadcasted by other received nodes, and determines to be an alternative node when the sequence is within a preset sequence range;
each alternative node packs the first data into blocks, generates unique priorities of the blocks, and broadcasts the blocks with the highest priority in a block set, wherein the block set comprises the blocks generated by the alternative nodes and the blocks obtained by packing the first data and broadcasted by other received alternative nodes;
and each alternative node takes the alternative node generating the block with the priority as the main node when the number of other alternative nodes receiving the block with the same broadcast priority is larger than a threshold value.
4. The method of claim 1, wherein the node generates an intelligent contract corresponding to the first data, comprising:
the node generates an intelligent contract template corresponding to the preset type according to the preset type of the first data, and sends the intelligent contract template to a preset user, so that the user fills in an item to be filled in the intelligent contract template;
and after receiving the intelligent contract template returned by the user, the node takes the returned intelligent contract template as the intelligent contract corresponding to the first data.
5. The method of claim 1, wherein the node, prior to executing the intelligent contract, further comprises:
and the node determines the first data associated with the second data according to the identifier carried by the second data, and acquires the intelligent contract corresponding to the first data.
6. The method of claim 1, wherein after obtaining the execution result, each node further comprises packing the execution result into a block and storing the block into the local blockchain.
7. A blockchain service system, the blockchain service system comprising a plurality of nodes;
the first node is used for broadcasting the information of the first data uplink after receiving first data of a preset type; the first node is any one of the plurality of nodes;
each node in the plurality of nodes is used for storing an area obtained by packaging the first data by the first main node into a local block chain and generating an intelligent contract corresponding to the first data; the first master node is one of the plurality of nodes;
the first node is further configured to broadcast a message of the second data uplink after receiving second data associated with the first data preset;
each node in the plurality of nodes is further configured to store an area obtained by packing the second data by the second host node into the local block chain, and execute the intelligent contract to obtain an execution result; the second master node is one of the plurality of nodes.
8. The blockchain service system of claim 7, wherein the first host node and the second host node are: nodes generated by the plurality of nodes through competition or nodes preset in the plurality of nodes.
9. A blockchain services system according to claim 7 wherein the node being configured to generate an intelligent contract corresponding to the first data includes the node being specifically configured to: generating an intelligent contract template corresponding to the preset type according to the preset type of the first data, and sending the intelligent contract template to a preset user to enable the user to fill in an item to be filled in the intelligent contract template; and after receiving the intelligent contract template returned by the user, taking the returned intelligent contract template as the intelligent contract corresponding to the first data.
10. A blockchain service system according to claim 7 wherein said node is further configured to: and determining the first data associated with the second data according to the identifier carried by the second data, and acquiring the intelligent contract corresponding to the first data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110113064.2A CN112734586A (en) | 2021-01-27 | 2021-01-27 | Data processing method and system based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110113064.2A CN112734586A (en) | 2021-01-27 | 2021-01-27 | Data processing method and system based on block chain |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112734586A true CN112734586A (en) | 2021-04-30 |
Family
ID=75594209
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110113064.2A Pending CN112734586A (en) | 2021-01-27 | 2021-01-27 | Data processing method and system based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112734586A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116192881A (en) * | 2023-04-27 | 2023-05-30 | 天津市城市规划设计研究总院有限公司 | Access control method and system for block chain data in urban planning field |
| WO2024001032A1 (en) * | 2022-06-29 | 2024-01-04 | 蚂蚁区块链科技(上海)有限公司 | Method for executing transaction in blockchain system, and blockchain system and nodes |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107222482A (en) * | 2017-06-01 | 2017-09-29 | 黑龙江卓亚科技有限公司 | A kind of data management system and method based on compound block chain network |
| CN107402824A (en) * | 2017-05-31 | 2017-11-28 | 阿里巴巴集团控股有限公司 | A kind of method and device of data processing |
| CN109102411A (en) * | 2018-07-26 | 2018-12-28 | 厦门快商通信息技术有限公司 | A kind of settlement of insurance claim method and system based on block chain intelligence contract technology |
| CN109685504A (en) * | 2018-12-20 | 2019-04-26 | 北京比新科技有限公司 | It is a kind of that economic bookkeeping methods is shared based on block chain |
| CN110602705A (en) * | 2019-09-20 | 2019-12-20 | 浙江树人学院（浙江树人大学） | Improved PBFT consensus method suitable for Internet of vehicles environment |
| CN111192143A (en) * | 2019-12-25 | 2020-05-22 | 达闼科技成都有限公司 | Data processing method, data processing device, storage medium and block link point |
| CN111428269A (en) * | 2020-03-24 | 2020-07-17 | 北京金山云网络技术有限公司 | Data access method and device and terminal equipment |
| CN112104517A (en) * | 2020-11-23 | 2020-12-18 | 腾讯科技（深圳）有限公司 | Data processing method based on block chain network and related device |
| CN112118239A (en) * | 2020-09-03 | 2020-12-22 | 腾讯科技（深圳）有限公司 | Block chain consensus method and device, electronic equipment and storage medium |
| CN112163241A (en) * | 2020-09-09 | 2021-01-01 | 法信公证云（厦门）科技有限公司 | Notarization archive information processing method, system, platform, equipment and storage medium |
-
2021
- 2021-01-27 CN CN202110113064.2A patent/CN112734586A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107402824A (en) * | 2017-05-31 | 2017-11-28 | 阿里巴巴集团控股有限公司 | A kind of method and device of data processing |
| CN107222482A (en) * | 2017-06-01 | 2017-09-29 | 黑龙江卓亚科技有限公司 | A kind of data management system and method based on compound block chain network |
| CN109102411A (en) * | 2018-07-26 | 2018-12-28 | 厦门快商通信息技术有限公司 | A kind of settlement of insurance claim method and system based on block chain intelligence contract technology |
| CN109685504A (en) * | 2018-12-20 | 2019-04-26 | 北京比新科技有限公司 | It is a kind of that economic bookkeeping methods is shared based on block chain |
| CN110602705A (en) * | 2019-09-20 | 2019-12-20 | 浙江树人学院（浙江树人大学） | Improved PBFT consensus method suitable for Internet of vehicles environment |
| CN111192143A (en) * | 2019-12-25 | 2020-05-22 | 达闼科技成都有限公司 | Data processing method, data processing device, storage medium and block link point |
| CN111428269A (en) * | 2020-03-24 | 2020-07-17 | 北京金山云网络技术有限公司 | Data access method and device and terminal equipment |
| CN112118239A (en) * | 2020-09-03 | 2020-12-22 | 腾讯科技（深圳）有限公司 | Block chain consensus method and device, electronic equipment and storage medium |
| CN112163241A (en) * | 2020-09-09 | 2021-01-01 | 法信公证云（厦门）科技有限公司 | Notarization archive information processing method, system, platform, equipment and storage medium |
| CN112104517A (en) * | 2020-11-23 | 2020-12-18 | 腾讯科技（深圳）有限公司 | Data processing method based on block chain network and related device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024001032A1 (en) * | 2022-06-29 | 2024-01-04 | 蚂蚁区块链科技(上海)有限公司 | Method for executing transaction in blockchain system, and blockchain system and nodes |
| CN116192881A (en) * | 2023-04-27 | 2023-05-30 | 天津市城市规划设计研究总院有限公司 | Access control method and system for block chain data in urban planning field |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106815530B (en) | Data storage method, data verification method and device | |
| CN112734586A (en) | Data processing method and system based on block chain | |
| CN110599177A (en) | Transaction verification method and related equipment | |
| CN112000730B (en) | Tracing information writing and tracing information verification method and system based on block chain | |
| CN108241350A (en) | A kind of Intelligent Dynamic manufacture execution method and relevant device | |
| CN110796545A (en) | Batch processing method, equipment and storage medium for blockchain transaction | |
| CN111061735A (en) | Capacity expansion method and device based on single-chain block chain | |
| CN109670800A (en) | Transaction processing method and system, storage medium and terminal based on ether mill | |
| CN112348596A (en) | Bidding and quotation method, system, equipment and storage medium based on block chain | |
| CN112967119A (en) | Bidding method, device and medium based on block chain | |
| CN113762956A (en) | Transaction method and device based on block chain and electronic equipment | |
| CN111245897A (en) | Data processing method, device, system, storage medium and processor | |
| CN107908481A (en) | A kind of method of data synchronization, device and system | |
| CN112488688A (en) | Transaction processing method, device, equipment and storage medium based on block chain | |
| CN103685084B (en) | A kind of method generating Frame and device | |
| CN114969803A (en) | Data storage method, device and storage medium | |
| CN111311150B (en) | Distribution task grouping method, platform, electronic equipment and storage medium | |
| CN115460224A (en) | Calculation power resource scheduling method and device based on block chain technology | |
| CN109257430B (en) | System, method and server for block chain-based internet application | |
| CN111062673A (en) | Logistics safety supervision method and system based on block chain | |
| CN113610482B (en) | System, method, electronic device and computer readable medium for tracing events | |
| CN112258184A (en) | Method and device for freezing area block chain network, electronic equipment and readable storage medium | |
| CN108021443B (en) | Event processing method and device | |
| CN113535334A (en) | Docker-based project construction method, Docker-based project construction equipment and storage medium | |
| CN114679466B (en) | Consensus processing method, device, computer equipment and medium for block chain network |
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 |