CN112235429A

CN112235429A - Central accounting type decentralized distributed data processing method and system

Info

Publication number: CN112235429A
Application number: CN202011495082.3A
Authority: CN
Inventors: 吴刚; 蔺静茹
Original assignee: Dark Chain Technology Shenzhen Co ltd
Current assignee: Dark Chain Technology Shenzhen Co ltd
Priority date: 2020-12-17
Filing date: 2020-12-17
Publication date: 2021-01-15
Anticipated expiration: 2040-12-17
Also published as: CN112235429B

Abstract

The invention relates to a central accounting type decentralized distributed data processing method and system. Wherein the method comprises: acquiring data information to be stored; verifying the validity of the data information; if the data information is legal, sequentially processing the data information of the candidate pool, packaging the data information into a new block and signing the new block; broadcast to the P2P network; verifying the validity of the new block; if the verification passes, the new block is appended to the back of the blockchain. The invention eliminates the 'coin' attribute of the block chain, reduces the complexity of the system, greatly improves the efficiency, purifies the purposiveness of the system, restores the pure credible evidence storage function, can avoid the bifurcation when updating the block chain software and enhances the safety of the system.

Description

Central accounting type decentralized distributed data processing method and system

Technical Field

The invention belongs to the technical field of block chains, and particularly relates to a central accounting type decentralized distributed data processing method and system.

Background

Block chaining technology has developed to date, and the common uplink in data storage has been a focus and pain point problem. The distributed nature of the blockchain technology itself, particularly the open nature adopted to achieve decentralization, makes achieving consistency of data at all nodes its principle requirement, in other words, if the data is not consistent, the so-called non-tamper-able ability and natural "trustworthiness" of the blockchain defeats. The blockchain is also a kind of stream data, new data is continuously added, and the consistency necessarily requires that the new data generation must go through a consistency process. In practice, the content submitted will often be larger than the content that can be packed at a time, even if not larger, the versions will be diversified under the rule that many nodes are simultaneously given peer-to-peer data access (packing) rights. The process of reconciliation is the process of fixing these diverse versions into one version and the so-called consensus-achieving mechanism.

There are several mainstream commonalities at present: PoW, PoS, DPoS and PoC. PoW, the workload proof, is a consensus that allows packaged versions to be distinguished temporally by an algorithm that allows easy verification, and selects the first. The problem is that each version owner needs to compete for the calculation power in order to obtain the first algorithm, and the competition does not generate the residual social value, thereby causing no-side environmental pollution; on the other hand, in order to sufficiently separate the time division, the algorithm always maintains a certain inter-block time interval through the adjustment of difficulty, so that the efficiency (TPS) is low and locked, which cannot be improved.

PoS is a proof of entitlement that determines block versions from digital asset production. Although reducing environmental pollution, it has more problems, including 1, the distributed ledger must run digital assets; 2, excitation double throw causes consensus to break; 3, constructing a Tunbu to obstruct the circulation; 4, the richer the enricher gains the advantage of the equity, the more the community malformation results. DPoS is an improved version of PoS, using a representative system that can greatly improve efficiency (TPS), but also has many of the drawbacks of PoS, even creating an oligopedical, more malformed community form.

PoC, i.e. capacity certification, is an improvement on PoW, and converts competitive competition into competition for storage space, so that environmental pollution of PoW can be avoided. However, PoC does not essentially leave PoW, and also has the problem of time differentiation, i.e. the efficiency (TPS) is low and locked, only the apparent efficiency is better than PoW.

The consensus is established based on the concept of autonomous communities, the peer-to-peer rights and interests of each node (citizen) can be solved from the inside of the system, and one hundred percent of autonomy independent of the outside is achieved. For the current human society of which the governing system is already formed and matured, a one hundred percent pure autonomous system is not necessary and is extremely easy to conflict with the existing system, and the proposal of the Libra project and the objection of global government right are the best cases.

CN111183446A discloses a centralized ledger system, which comprises one or more ledger servers. The application is actually a decentralized account book system.

In addition, the prior art fails to balance the negative correlation between decentralization and efficiency: all of the above-identified inventions are from the western world, and this conflict is partly due to western social philosophy, and decentralization has led to its being a first problem, and then efficiency improvements are considered. The traditional block chain consensus mechanism is constrained by the method and is based on an internal autonomy concept, and the contradiction between decentralization and efficiency is difficult to break through.

Also, forking of block chain software updates may occur: a greater common problem with the above consensus is that their implementation can lead to forking when software updates occur, since communities split when consensus groups occur. This is normally avoided (nodes that do not keep on the rules can be kicked off according to the rules), but when the software itself is updated and a consensus step is involved, it is difficult to handle (in an asynchronous environment, it cannot be kicked off because of the relative early or late time or fast and slow time of node upgrade, otherwise the community will be discrete, the system will self-solve), and finally the result of the block chain branching is very serious.

Disclosure of Invention

The invention tries to embed a decision mechanism in an external treatment system into a proper link in the treatment of the decentralized system, thereby not only leading the decentralized and inherent low-efficiency fetal replacement, but also leading an emerging decentralized credible system to be beyond the scope of the traditional centralized system, and be in tacit cooperation with the traditional centralized system, and bring out the best in each other.

In order to achieve the above object, the present invention provides a centralized accounting decentralized distributed data processing method, which comprises the following steps:

the client node acquires data information needing to be stored;

sending the data information to a centralized service node;

the centralized service node caches the data information in a transaction pool and verifies the validity of the data information;

if the data information is legal, the centralized service node moves the data information into a candidate pool in batches; the centralized service node processes the candidate pool data information according to the batch sequence;

the centralized service node packs the processed data information into new blocks according to the sequence of batches;

the centralized service node signs the new block;

the centralized service node broadcasts the new tile to the P2P network;

the accounting node receives the broadcasted new block and verifies the validity of the new block;

if the verification passes, the new block is appended to the back of the blockchain.

Further, the client node acquiring the data information needing to be stored comprises:

providing a user interface at the client node;

and submitting the data information through the user interface.

attaching the signature of the client node to the data information.

Further, the sending, by the client node, the data information to the centralized service node includes:

sending data information to the centralized service node through a Remote Procedure Call (RPC) interface;

or, data information is sent to a P2P network through broadcasting, and the centralized service node acquires the data information from the P2P network;

further, the verifying the validity of the data information by the centralized service node comprises:

verifying the validity of the signature;

and deleting the data information with illegal signature.

Further, the processing, by the centralized service node, the candidate pool data information in a batch order includes:

pre-establishing a data information selection rule;

and selecting the pre-packaged data information according to the data information selection rule.

Further, the pre-establishing of the data information selection rule by the centralized service node includes:

establishing a data information priority selection algorithm;

data information with high priority is preferentially selected.

The rule is executed or not executed.

Further, the pre-establishing of the data information selection rule by the centralized service node further includes:

providing an API interface to allow an external system to participate in the selection of the data information;

the external system returns the selection result to the centralized service node;

the centralized service node integrates the return result into the selection of the data information;

the rule is executed or not executed.

Further, the centralized service node providing an API interface to allow an external system to participate in the selection of the data information includes:

pushing the data information needing to be processed to an external centralized examination server;

the centralized examination server returns an examination result according to a self-defined examination rule;

and the centralized service node removes the data information which returns the result and requires to be removed from the candidate pool.

According to another aspect of the present invention, the present invention further provides a centralized billing decentralized distributed data storage system, comprising:

a client node for providing an interface for data chaining for users requiring data chaining and an interface for data entering the central booked decentralized distributed data storage system, and submitting data into the system through the client node;

the centralized service node is used for processing the data submitted to the central accounting type decentralized distributed data storage system, packaging the data into new blocks in batch sequence and broadcasting the new blocks to a P2P network;

and the accounting node is used for receiving the new blocks broadcast by the centralized service node and adding the new blocks into the local block chain to form the decentralized distributed account book.

Optionally, the system further comprises: and the examination server is used for examining the examined data received by the external interface on the centralized service node and returning the examination result to the centralized service node.

The advantages of the invention include at least the following:

(1) the 'coin' attribute of the block chain is removed, the complexity of the system is reduced, the purpose of the system is purified, and a pure credible evidence storage function is restored. (2) The efficiency is greatly improved. Because the main calculation work is processed by the centralized service node, the efficiency is equivalent to that of a centralized system, at the moment, the ore digging is no longer the speed-limiting step of the whole process, and theoretically, the block output can be as smooth as showing an online film; (3) providing the most desirable confidence level. Although blockchain technology is considered to make data mechanistically trusted, due to the existence of consensus, the possibility of rolling back the uplink data still exists, such as 51% PoW-based attacks, DPoS practical byzantine fault tolerance exceeding 1/3, etc., which may result in data being rewritten, tampered with, and assets being double-bloomed. Under the mechanism of the invention, unbiased final rules can be naturally set, and the rollback possibility is thoroughly eliminated, so that the data can not be tampered once the data is uplinked. Therefore, the invention can provide the reliability of the block chain technology in the optimal state. (4) An external supervisory interface is provided. The centralized service node of the present invention provides a policing interface to external access that gives authorities the ability to audit uplink data prior to data uplink. This function does not interfere with the confidence level of the uplink data. (5) The contradiction between credibility and efficiency is solved. There is a natural negative correlation between decentralization and efficiency. Decentralization can lead to confidence that there is no natural negative correlation between confidence and efficiency. This problem is solved when converting contradictions into credibility and efficiency. (6) The block chain software updating method can avoid the bifurcation. The bifurcation of blockchain software updates is due to consensus, which is solved if the consensus requirement is removed in the steps associated with it. (7) A hacker cannot implement a 51% attack on the control block because the system is not competitive. (8) Hackers cannot do double flowers because the block-out mechanism of the system is final. (9) Whether bribery or otherwise, cannot rollback records, and thus these attacks or malicious incentives are struck to a large extent. (10) Although corruption of centralized nodes can cause problems with the selectivity of the uplink data, since the uplink data cannot be changed, it is easily detected by public inspection and difficult to hide if large data analysis is combined.

Drawings

The above and other objects, features and advantages of exemplary embodiments of the present disclosure will become readily apparent from the following detailed description read in conjunction with the accompanying drawings. Several embodiments of the present disclosure are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar or corresponding parts and in which:

FIG. 1 is a flow diagram illustrating a method for centralized, decentralized distributed data processing in a centralized billing system consistent with an embodiment of the present invention;

FIG. 2 is a flow chart illustrating a method of unexamined data uplink consistent with certain embodiments of the present invention;

FIG. 3 is a flow chart illustrating a method of auditable data uplink consistent with certain embodiments of the present invention; and

FIG. 4 is a block diagram illustrating a system architecture for centralized billing decentralized distributed data processing, according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, 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 invention.

Some of the concepts to which the invention relates:

POW (Proof-of-Work) is workload certification, each node in the whole system provides computing power for the whole system, and the nodes which finish computing Work most excellence obtain reward of the system through a competition mechanism to finish new distribution.

POS (Proof-of-stamp) is a Proof of equity, and like current stockholder mechanisms, people with larger numbers of tokens are easier to obtain accounting rights.

DPOS (released-Proof-of-Stake) is an authorized equity Proof, POS-derived based solution, similar to the board voting mechanism, community membership voting supports a super representative to secure their network, who will receive a reward by verifying the transaction of the next block.

Poc (proof Of capacity), a proof Of capacity, was proposed in 2014. POC is a simple modification on the basis of POW, a storage-reusable problem solving mode + local search replaces repeated Hash calculation, chip calculation power with high power consumption is converted into hard disk space search with low power consumption, a POC algorithm stores numerous pseudo-random numbers into a hard disk, and matched random Hash numbers are searched by reading the disk when competing for packing blocks.

Alternative embodiments of the present invention are described in detail below with reference to the accompanying drawings.

The first embodiment,

As shown in fig. 1, the present invention discloses a centralized accounting decentralized distributed data processing method, which comprises the following steps:

the client node acquires data information needing to be stored;

sending the data information to a centralized service node;

the centralized service node signs the new block;

the centralized service node broadcasts the new tile to the P2P network;

providing a user interface at the client node;

and submitting the data information through the user interface.

attaching the signature of the client node to the data information.

verifying the validity of the signature;

and deleting the data information with illegal signature.

pre-establishing a data information selection rule;

the rule is executed or not executed.

Example II,

The data processing of the invention can be divided into three parts:

(1) data submission: the user can run the client interface of the system application at a desktop computer end, a notebook computer end, a mobile phone end or other equipment ends. The data submitted by the client is broadcasted to the whole network through the network node (the client application software is provided with the function) of the system P2P connected with the network node. This is the step where the client submits the data. Wherein the client application, the client device and the system P2P network node connected thereto are all open, meaning that they can join and leave at any time. This feature provides a decentralized unlicensed service, meaning that data trust is independent of enrollee/submitter external reputation, i.e., not authority dependent.

(2) Writing an account book: this step is a distinction (detailed below). The function is to organize the information into groups ready to be uplinked to record them down. The block chain is recorded in a block-by-block mode in the recording rule, so that a new account book is generated firstly, the account book is packaged into a block, block maintenance information is added, and the new block is issued to the P2P network and received by the accounting node.

(3) Account book recording: i.e. the uplink, records the data of the revision book to make each accounting node consistent to the same position, so as to ensure that each account book (the collection of the account book) is consistent at any time. Wherein the nodes with accounting rights are open throughout the system. The method can be unlicensed, has the best effect, and can ensure the maximum node independence; there may also be permissions, but there are other mechanisms for the nodes to gain independence. The open accounting node makes the record once saved, non-tamper and non-wear out.

In the second section, when data submitted by a client is broadcast to a P2P network, data is collected, selected, sorted and sorted by a plurality of service nodes, miners, in the same role, and packaged into new blocks. In a PoW and PoC mechanism, a unique new block version is competed out through a mining algorithm in a finalizing stage and delivered to all accounting nodes; in the PoS and DPoS mechanism, the packing right of miners is first obtained by an algorithm, and then the miners who obtain the packing right pack out blocks, and the algorithm is closely connected with the intrinsic digital currency, so that the mechanism needs to be accompanied by the digital currency attribute.

In the invention, when data submitted by a client is broadcasted to a P2P network, a centralized service node is responsible for collecting, selecting, sorting, sequencing, packaging, finalizing and delivering to all accounting nodes. Because digital currency is not needed, the currency attribute of the block chain natural times can be thoroughly eliminated, a clean decentralized distributed account book system is formed, and a more concise and better trusted system is created.

Example III,

As shown in fig. 2, consistent with an embodiment of the present invention, an unexamined uplink data method is proposed.

Suppose client a has data a to keep as a permanent record:

step 1, A logs in a client management interface through a mobile phone APP client provided by the system, fills data a into a submitted form, and clicks to submit the data a.

And 2, automatically creating a node of the block chain by a mobile phone APP client of the system when a user installs the mobile phone APP client, wherein the node is a client node, and simultaneously creating an initial account, an account private key and a public key of the node during creation. At the moment, the data submitted by the user is attached with the signature of the primary account by the node program and is sent to the centralized service node through the RPC interface as a piece of signature transaction information.

signdatatransactionwithkey "hexstring" ["privatekey",...] ( [{"txid":"hex","data":"hex",...] )

The first parameter hexstring is a transaction 16-system code string;

the second parameter [ "privatekey",. ] stores the base58 code of the private key, type json;

the third parameter is the transaction information content, including the transaction id (txid), user data (data).

And 3, the centralized service node receives the data request, places the data request into a transaction pool for caching, and returns the received information.

{

"hex" : "value",

"received" : true|false,

"errors" : [

{

"txid" : "hash",

"scriptSig" : "hex",

"sequence" : n,

"error" : "text"

}

]

}

And 4, calling a plurality of processes by the centralized service node to sequentially process the data in the transaction pool in batches and in parallel, verifying the data validity and the client signature validity, if the data is in a problem, returning an error and moving the error out of the transaction pool, and if the data is in a legal state, moving the error into a candidate pool.

{

"hex" : "value",

"validation" : true|false,

"errors" : [

{

"txid" : "hash",

"scriptSig" : "hex",

"sequence" : n,

"error" : "text"

}

]

}

And 5, the centralized service node calculates the data priority index in the candidate pool according to the data selection rule.

The data priority algorithm in the data selection rule is as follows:

a) request time by datatSorting to obtain the sort numberT；

b)MThe number of blocks which are missed continuously; weight ofw _m(ii) a Multiplying; is subtracted by the previous step;

c)Lthis timeThe length of the data stored; weight ofw _l(ii) a Multiplying; are added in the previous step;

d) obtaining the priority index of the dataPThe lower value is preferred;

and 6, the centralized service node takes out a batch of prior transaction data from the candidate pool according to the priority index, packs the transaction data into a new block and broadcasts the new block to the P2P network.

Block head: version, upper block hash, block body data hash, timestamp, block height, service node signature.

Table parameter details in block header

Zone block body: data selection rules, user data.

And 7, the accounting node receives the broadcast new block, verifies the block validity, including whether the block format is legal, whether the signature is legal, whether the content such as height, timestamp and the like conflicts with the existing block, and the like. If the verification passes, the new block is appended to the back of the blockchain. And finishing the uplink.

Example four,

As shown in fig. 3, consistent with an embodiment of the present invention, a method for auditable data uplink is provided.

Suppose client B has data B to keep as a permanent record:

step 1, a client B logs in a client management interface through a mobile phone APP client provided by the invention, fills data B into a submitted form, and clicks to submit the data B.

And 2, the mobile phone APP client of the system automatically creates a node of the block chain when a user installs the mobile phone APP client, the node is a client node and does not participate in accounting, and a primary account, an account private key and a public key of the node are created simultaneously when the node is created. At the moment, the data submitted by the user is attached with the signature of the primary account by the node program and is sent to the centralized service node as a piece of signature transaction information through a Remote Procedure Call (RPC) interface.

The first parameter hexstring is a transaction 16-system code string;

{

"hex" : "value",

"received" : true|false,

"errors" : [

{

"txid" : "hash",

"scriptSig" : "hex",

"sequence" : n,

"error" : "text"

}

]

}

And 4, calling a plurality of processes by the centralized service node to sequentially process the data in the transaction pool in batches and in parallel, verifying the validity and the signature of the data, if the data are in a problem, returning an error and moving the data out of the transaction pool, and if the data are in a legal state, moving the data into a candidate pool.

{

"hex" : "value",

"validation" : true|false,

"errors" : [

{

"txid" : "hash",

"scriptSig" : "hex",

"sequence" : n,

"error" : "text"

}

]

}

And 5, the centralized service node pushes the data entering the candidate pool to a server of an external authoritative checking organization through an API (application programming interface), the server returns a checking result (0 |1| N) according to a checking algorithm preset by the organization, N is a natural number greater than 1 and represents the priority classification of the data in the checking process, and the larger the N is, the higher the priority is. The centralized service node removes the data with the returned result of 0 from the candidate pool and returns the examination result.

{

"hex" : "value",

"review" : true|false,

"errors" : [

{

"txid" : "hash",

"scriptSig" : "hex",

"sequence" : n,

"error" : "text"

}

]

}

And 6, the centralized service node calculates the data priority index in the candidate pool according to the data selection rule.

The data priority selection algorithm of the data selection rule is as follows:

a) request time by datatSorting to obtain the sort numberT；

b)NThe returned value is externally inspected; weight ofw _n(ii) a Multiplying; is subtracted by the previous step;

c)Mthe number of blocks which are missed continuously; weight ofw _m(ii) a Multiplying; is subtracted by the previous step;

d)Lthe length of the data stored this time; weight ofw _l(ii) a Multiplying; are added in the previous step;

e) obtain the piece of dataPriority index ofPThe lower value is preferred;

and 7, taking a batch of prior transaction data from the candidate pool by the centralized service node according to the priority index, packaging the transaction data into a new block, and broadcasting the new block to the P2P network.

Block head: version, upper block hash, block body data hash, timestamp, block height, service node signature

Table two block header parameter details

Zone block body: data selection rules, user data.

And 8, the accounting node receives the broadcast new block, verifies the block validity, including whether the block format is legal, whether the signature is legal, whether the content such as height, timestamp and the like conflicts with the existing block, and the like. If the verification passes, the new block is appended to the back of the blockchain. And finishing the uplink.

EXAMPLE five

Referring to FIG. 4, a centralized bookkeeping decentralized distributed data processing system is shown, in accordance with an embodiment of the present invention, comprising:

the centralized service node is used for processing the original data submitted to the central accounting type decentralized distributed data storage system, packaging the original data into new blocks in batch sequence and broadcasting the new blocks to a P2P network;

In one embodiment, the central billing decentralized distributed data processing system further comprises:

and the examination server is used for examining the examined data received by the external interface on the centralized service node and returning the examination result to the centralized service node.

EXAMPLE six

The disclosed embodiments provide a non-volatile computer storage medium having stored thereon computer-executable instructions that may perform the method steps as described in the embodiments above.

Description of the other

Distinction of the invention from distributed databases

The distributed database is a unified whole logically, and is stored on different physical nodes respectively physically. An application may access a database distributed over different geographic locations through a network connection. The distributivity of the method is represented by that the data in the database are not stored in the same place. Rather, it is not stored on a memory device of the same computer. This is a distinction from centralized databases. From the user's perspective, a distributed database system is logically identical to a centralized database system, and the user can execute global applications at any one site as if those data were stored on the same computer.

The invention relates to a decentralized distributed ledger, wherein target data are stored on different physical nodes, and each node stores a complete copy. The user does not need to visit different physical nodes to obtain the segments of the data to splice into the required data, and all the data can be obtained from any one node.

The differences between the present invention and the private chain are:

private chains refer to blockchain systems that establish admission rules, specifying who can view and write blockchains (which are environments that require permission). The private chain is not a decentralized system because of the explicit hierarchy in control. The private chain is distributed, with the nodes maintaining copies of the blockchain. The private chain cannot guarantee the credibility of the data because the private chain is not a peer-to-peer network, the positions of the nodes are unequal, and the owner of the private chain has enough authority to change the data of all copies.

The invention is an admission rule-free and unlicensed block chain system, the copies of each node are independently controlled by the nodes, and in principle, no main body has ownership of the system and no main body has control right to all the nodes. Thus, once the data is copied into a full network copy, it is not tampered with.

The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.

The units described in the embodiments of the present disclosure may be implemented by software or hardware. Where the name of an element does not in some cases constitute a limitation on the element itself.

The foregoing describes preferred embodiments of the present invention, and is intended to provide a clear and concise description of the spirit and scope of the invention, and not to limit the same, but to include all modifications, substitutions, and alterations falling within the spirit and scope of the invention as defined by the appended claims.

Claims

1. A central accounting type decentralized distributed data storage method is characterized by comprising the following steps:

the client node acquires data information needing to be stored;

sending the data information to a centralized service node;

the centralized service node signs the new block;

the centralized service node broadcasts the new tile to the P2P network;

if the verification is passed, the new block is added behind the block chain;

wherein the client node acquiring the data information needing to be stored comprises:

providing a user interface at the client node;

and submitting the data information through the user interface.

2. The method of claim 1, wherein the client node obtaining data information to be stored comprises:

attaching the signature of the client node to the data information.

3. The method of claim 1, wherein the client node sending data information to a centralized service node comprises:

or, data information is sent to a P2P network through broadcasting, and the centralized service node acquires the data information from the P2P network.

4. The method of one of claims 1 or 2, wherein the centralized service node verifying the validity of the data information comprises:

verifying the validity of the signature;

and deleting the data information with illegal signature.

5. The method of claim 1, wherein the processing the candidate pool data information by the centralized service node in batch order comprises:

pre-establishing a data information selection rule;

6. The method of claim 5, wherein the centralized service node pre-establishing data information selection rules comprises:

establishing a data information priority selection algorithm;

preferentially selecting data information with high priority;

the rule is executed or not executed.

7. The method of claim 5, wherein the centralized service node pre-establishing data information selection rules further comprises:

the rule is executed or not executed.

8. The method of claim 7, wherein the centralized service node providing an API interface to allow an external system to participate in the selection of the data information comprises:

and the centralized examination server returns an examination result according to the customized examination rule.

9. The method of claim 8, wherein the centralized service node provides an API interface to allow an external system to participate in the selection of the data information, further comprising:

10. A central billed decentralized distributed data storage system according to any one of claims 1 to 9, comprising: