CN108667836B - Block chain consensus method - Google Patents
Block chain consensus method Download PDFInfo
- Publication number
- CN108667836B CN108667836B CN201810429726.5A CN201810429726A CN108667836B CN 108667836 B CN108667836 B CN 108667836B CN 201810429726 A CN201810429726 A CN 201810429726A CN 108667836 B CN108667836 B CN 108667836B
- Authority
- CN
- China
- Prior art keywords
- current
- hash value
- data file
- verification node
- node
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000012795 verification Methods 0.000 claims abstract description 57
- 125000002015 acyclic group Chemical group 0.000 claims description 4
- 238000010200 validation analysis Methods 0.000 claims 1
- 238000004364 calculation method Methods 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 4
- 238000003672 processing method Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 230000003139 buffering effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 229920003171 Poly (ethylene oxide) Polymers 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/12—Applying verification of the received information
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a block chain consensus method, which comprises the following steps: the first verification node acquires at least two hash values; based on the at least two hash values, the first verification node determines data blocks corresponding to the at least two hash values in the current main data file stored by the first verification node; the first verification node performs hash operation on the data block, so that a current root hash value corresponding to the current main data file is determined; and the first verification node and the rest verification nodes respectively determine the correctness of the current root hash value. The block chain consensus method does not need to consume a large amount of CPU calculation, meanwhile, participants of the network can be stimulated in a reward and punishment mode, and safety guarantee is provided for block chain data.
Description
Technical Field
The present invention relates to a block chain technology, and more particularly, to a block chain consensus method.
Background
The block chain is a novel distributed system which combines distributed data storage, point-to-point transmission, an encryption algorithm, a consensus mechanism and other computer technologies, a set of distributed accounts book is jointly maintained by a plurality of participating nodes, the characteristics of data information such as tamper resistance and traceability are realized, and a set of safe distributed trust system is created.
Maintaining an open ledger in a blockchain requires a powerful, efficient and secure consensus algorithm. A safe and stable consensus algorithm is the fundamental guarantee that data in a blockchain keeps consistent. POW, also known as a workload proving algorithm, is used in bitcoin networks, and since such an algorithm consumes a lot of computing resources and causes a great waste of power, various new consensus algorithms are continuously proposed in an attempt to improve it.
Up to now, besides POW, the mainstream block chain consensus algorithm has rights and interests certification (POS), delegation rights and interests certification (DPOS), Practical Byzantine Fault Tolerance (PBFT), and the like.
The POS is known as Proof Of office stamp, which refers to a Proof Of ownership Of money, and the age Of the money consumed by a transaction can be considered as a form Of POS. The digging of the POS was first achieved by the PPC (Point and Point coin) issued by Sunny King at 8 months 2012. POS is becoming a new consensus algorithm choice because it does not actually consume significant computer resources, while at the same time it can replace most of the POW's functionality.
However, in practical applications, POW causes a lot of waste of resources, and POS is not consuming a lot of resources, but is prone to cause shortages, which increases the risk of system attack.
The fields related to the block chain are very numerous, and different consensus algorithms may need to be adopted in different fields according to the characteristics of the fields to achieve the maximum benefit.
Disclosure of Invention
The invention provides a block chain consensus method, which comprises the following steps: the first verification node acquires at least two hash values; based on the at least two hash values, the first verification node determines data blocks corresponding to the at least two hash values in a current master data file stored by the first verification node; the first verification node performs a hash operation on the data block, so as to determine a current root hash value corresponding to the current master data file; and the first verification node and the rest verification nodes respectively determine the correctness of the current root hash value.
In one embodiment, the determining, by the first verification node and the remaining verification nodes, the correctness of the current root hash value comprises: the first verification node broadcasting the current root hash value to a blockchain network; and the first verification node and the other verification nodes respectively determine whether the current root hash value is the same as the historical root hash value.
In one embodiment, the first verification node generates a presence attestation indicating that a historical master data file corresponding to the historical root hash value is present in the first verification node and that the current master data file is the same data file as the historical master data file if the verification node exceeding a specified threshold determines that the current root hash value and the historical root hash value are the same.
In one embodiment, the first verification node is a block-out node of a current block-out turn, and all verification nodes may lease the corresponding storage space by respective storage lease contracts.
In one embodiment, the method further comprises saving the presence credential in a blockchain ledger.
In one embodiment, the first verification node hashing the data block such that determining a current root hash value corresponding to the current master data file comprises: the first verification node performs hash operation on the data block to obtain a current hash value corresponding to the data block; and calculating a current root hash value corresponding to the current main data file according to the current hash value.
In one embodiment, the specified threshold is two-thirds.
In one embodiment, the historical master data file is stored in the respective verification node divided into a plurality of data blocks by a merkel directed acyclic data structure.
The invention also provides a method for storing the block chain, wherein the block chain comprises a plurality of storage nodes, and the method comprises the following steps: the plurality of storage nodes receive a request for storing a data file and a storage request contract; determining a node to be stored among the plurality of storage nodes based on a storage lease contract and the storage request contract, wherein the plurality of storage nodes lease respective storage spaces based on the storage lease contract; and storing the data file to be stored in the node to be stored.
In one embodiment, the method further comprises: and the node to be stored divides the data file to be stored into a plurality of data blocks for storage by adopting a Meckel directed acyclic data structure.
The invention also provides a computer readable storage medium having stored thereon processor executable instructions which, when executed by a processor, perform the method of any of the above methods.
The technical effects are as follows: the invention fully utilizes the hard disk space and the network bandwidth of a common computer, and greatly improves the network operation efficiency and the data transmission; not only is the Byzantine fault tolerance realized, but also unnecessary invalid CPU calculation and power consumption are greatly reduced; the pledge storage space and the method for dynamically adjusting the voting right can resist the behavior that the node forges the fake data to deceive the network and obtain improper profit, thereby ensuring the safe operation of the whole network; the node can quickly perform hash verification on the random file, so that the network verification efficiency is improved, and the block output speed is high.
Drawings
Fig. 1 is a flow chart of a block chain consensus method according to an embodiment of the present invention;
FIG. 2 is a flow diagram of a node storing files according to an embodiment of the invention;
fig. 3 is a flow diagram of an exemplary downloading of a file, according to an embodiment of the present invention.
Detailed Description
In the following detailed description of the preferred embodiments, reference is made to the accompanying drawings which form a part hereof. The accompanying drawings illustrate, by way of example, specific embodiments in which the invention may be practiced. The illustrated embodiments are not intended to be exhaustive of all embodiments according to the invention. It is to be understood that other embodiments may be utilized and structural or logical changes may be made without departing from the scope of the present invention. The following detailed description, therefore, is not to be taken in a limiting sense, and the scope of the present invention is defined by the appended claims.
First, some terms related to the present invention are explained, a block chain may include a plurality of nodes, but the present invention is directed to a verification node, and all the nodes, storage nodes and out-block nodes referred to herein refer to the verification node, and all the nodes, storage nodes and out-block nodes can rent corresponding storage space by storing a lease contract to store corresponding data files, where the storing lease contract refers to an agreed term for the verification node to rent the corresponding storage space (for example, a service provider a wants to rent own space, and then gives a storing lease contract, which specifies that the lease space is 100G, the lease unit price is 1.8M, the effective time is 20 months, and the like), and may be adjusted according to a specific situation of the node. In addition, the current master data file and the historical master data file are data files existing in nodes at different times, and in this document, after the historical master data file is divided into a plurality of data blocks and stored in corresponding nodes, each data block corresponds to one hash value, each historical data file corresponds to one historical root hash value, and if the current root hash value corresponding to the current master data file and the historical root hash value corresponding to the historical data file, which are obtained through hash operation, are the same, the current master data file and the historical data file are considered to be the same data file. In each round, according to the size of the voting weight proportion, the node with the largest voting weight proportion is selected to carry out block sending, and if the node obtaining the block weight really stores a corresponding data file, the existence of the data file needs to be proved, wherein the size of the storage space which is rented by the node and used by a client influences the size of the voting weight proportion. It should be understood that the size of the voting weight percentage is determined at least based on the size of the storage space that the node has leased and is actually available to the user (e.g., the length of the storage time may also affect the size of the voting weight percentage), and the size of the storage space may be adjusted to change the size of the voting weight percentage. It should also be understood that the voting weight score of each node may be set randomly for the first round of chunking, e.g., all nodes have the same voting weight score. And then in the subsequent block output rounds, selecting the node with the maximum voting weight as a block output node to output the block, and providing a existence Proof (POE) when the block output node stores a corresponding data file so as to ensure the stable operation of the network.
The present invention is described in detail below with reference to the attached drawings.
As shown in fig. 1, the present invention provides a block chain consensus method, which includes:
in step S101, the first verification node acquires at least two hash values. It should be understood that the first authentication node referred to herein is the out-blocking node of the current round in the blockchain network and stores the data file that needs to be authenticated, and the out-blocking node obtains two or more hash values.
In step S102, based on the at least two hash values, the first verification node determines data blocks corresponding to the at least two hash values in the current master data file stored by the first verification node. Specifically, according to the two or more hash values, the storage positions of the data blocks corresponding to the two or more hash values in the first verification node are found, so that the corresponding data blocks are found.
In step S103, the first verification node performs a hash operation on the data block, thereby determining a current root hash value corresponding to the current master data file. Specifically, the first verification node performs a hash operation on the found corresponding data block to obtain a current hash value corresponding to the found corresponding data block, and then determines a current root hash value corresponding to the found corresponding data block (it should be understood that the root hash value is a merkel root hash value).
In step S104, the first verification node and the remaining verification nodes respectively determine correctness of the current root hash value. Specifically, the first verification node broadcasts the determined current root hash value to the blockchain network; the first verification node and the other verification nodes respectively determine whether the current root hash value is the same as the historical root hash value.
FIG. 2 is a flow diagram of a node storing files according to the present invention.
In step S201, the servers a1, a2, A3 (or nodes a1, a2, A3) lease the corresponding storage spaces in their respective storage lease contracts.
It should be understood that leased storage space may be provided by multiple servers (two or more), both the servers and the customers comprising the nodes in the blockchain.
It should also be understood that all nodes in the blockchain whole network will agree and record in the blockchain ledger the information that the facilitator a1, a2, A3 leases the corresponding storage space by the respective storage leasing contract.
In one embodiment, the facilitators A1, A2, A3 mortgage respective shares of assets (it is understood that the respective shares of assets can be customized, e.g., 1M space for 1 RMB, 1024 for RMB if the facilitator rents 1G of space) according to the amount of storage space they rent, and lock these storage spaces for rental.
In step S202, the client C1 (or the node C1) issues a request for storing the data file F1 (e.g., profile. jpg), and attaches a storage request contract, wherein the storage request contract is about the agreed terms of the service that the client C1 accepts to store the data file (e.g., the client C1 requires a lease space size: 10G, an acceptable lease unit price: 1.5M, a lease period: 15 months, etc.).
In step S203, all the service providers match the storage request contract of the client C1 with their own storage lease contracts, respectively, and determine the service provider whose storage lease contract matches the storage request contract.
In step S204, the customer C1 uploads the data file F1 to the determined facilitator.
In step S205, the determined facilitator divides the data file F1 uploaded by customer C1 into a plurality of data blocks (e.g., each data block is 256K in size, it being understood that the size of each data block can be adjusted as needed) using a merkel directed acyclic (Merkle DAG) data structure for storage, while performing a hash operation on each data block and storing the calculated hash value corresponding to each data block and the merkel root hash value corresponding to data file F1 in the block book. It should be understood that other suitable ways to store the uploaded data file in blocks may also be used.
Fig. 3 is a flow diagram of an exemplary downloading of a file, according to an embodiment of the present invention.
In step S301, the client C1 submits a request to the blockchain network to download the data file F1. Specifically, the client C1 may input a request instruction to download the data file F1 via a node in the blockchain network (e.g., a computer connected to the network).
In step S302, in response to the request to download the data file F1, the blockchain network finds the storage node storing the data file F1 (e.g., according to a storage lease contract being fulfilled that satisfies the storage data file F1), and submits to the storage node two or more hash values corresponding to the data blocks into which the data file F1 is partitioned.
In step S303, the storage node obtains the submitted two or more hash values.
In step S304, the storage node finds current data blocks stored in the storage space of the storage node according to the two or more hash values, where the current data blocks correspond to the two or more hash values, performs hash operation on the found data blocks to obtain corresponding current hash values, and then calculates a current merkel root hash value corresponding to a current master data file corresponding to the current data block according to the current hash values.
In step S305, the storage node broadcasts the calculated current merkel root hash value to the blockchain network.
In step S306, the storage node and the remaining nodes respectively determine the correctness of the current merkel root hash value (i.e., determine whether the current merkel root hash value and the historical merkel root hash value corresponding to the data file F1 are the same), and the remaining nodes feed back the determination result to the storage node.
In step S307, if the more than two-thirds node determines that the current merkel root hash value is the same as the historical merkel root hash value, step S308 is performed, otherwise step S311 is performed.
It should be understood that the number of nodes that determine that the current merkel root hash value is the same as the historical merkel root hash value (i.e., the number of verification nodes that specify the threshold value) may be adjusted according to practical circumstances and is not limited to two-thirds.
In step S308, the storage node generates a presence attestation (POE) indicating that the data file F1 exists in the storage space of the storage node and that the current master data file is identical to the data file F1.
In step S309, POE is saved in the block chain ledger together with the transaction information packed in the current block-out turn, thereby forming a new block and storing the node block-out.
In step S310, the client C1 downloads the data file F1 from the storage space of the storage node.
In step S311, the presence attestation (POE) is not generated, and the procedure is terminated.
It should be appreciated that the application of the consensus method of the present invention is not limited to the above illustrated application scenario of downloading a data file in a blockchain, but it can be applied to any suitable application scenario. In this example, since a file is uploaded for the first time, a corresponding service provider (node) is found and then block storage is directly performed, when a new data file to be stored is uploaded, a root hash value of the new data file to be uploaded is calculated first, and then the calculated root hash value of the new data file is compared with a stored historical root hash value to determine whether the new file is not stored yet, if not, block storage is performed on the new data file, otherwise, no processing is performed. In one embodiment, when a user needs to view a certain data file or otherwise obtain a certain data file, the data file can be proved to be stored through the common identification method. It should be further understood that in other embodiments, a plurality of data files may be stored in the blockchain network, and a download request submitted by a client other than client C1 may be made by the network to download the stored data files through the present consensus method.
According to the block chain consensus method, the storage nodes in the network guarantee the storage requirements of customers through the existence of the certification file, all POEs are stored in the block chain account book, the source tracing and the counterfeiting prevention can be realized, a large amount of CPU calculation is not consumed, meanwhile, participants of the network can be stimulated through a reward and punishment mode to stabilize the operation of the network, and safety guarantee is provided for block chain data.
The flows of the data processing methods in fig. 1, 2 and 3 also represent machine readable instructions, including programs executed by a processor. The program may be embodied in software stored on a tangible computer readable medium such as a CD-ROM, floppy disk, hard disk, Digital Versatile Disk (DVD), blu-ray disk, or other form of memory. Alternatively, some or all of the steps in the example methods of fig. 1, 2, and 3 may be implemented using any combination of Application Specific Integrated Circuits (ASICs), Programmable Logic Devices (PLDs), field programmable logic devices (EPLDs), discrete logic, hardware, firmware, etc. In addition, although the flowcharts shown in fig. 1, 2, and 3 describe the data processing method, steps in the processing method may be modified, deleted, or combined.
As described above, the example processes of fig. 1, 2, and 3 may be implemented using coded instructions (e.g., computer readable instructions) stored on a tangible computer readable medium such as a hard disk, a flash memory, a Read Only Memory (ROM), a Compact Disc (CD), a Digital Versatile Disc (DVD), a cache, a Random Access Memory (RAM), and/or any other storage medium on which information may be stored for any duration (e.g., for any duration, permanently, brief instances, for temporarily buffering, and/or for caching of the information). As used herein, the term tangible computer readable medium is expressly defined to include any type of computer readable stored signal. Additionally or alternatively, the example processes of fig. 1, 2, and 3 may be implemented using coded instructions (e.g., computer readable instructions) stored on a non-transitory computer readable medium such as a hard disk, a flash memory, a read-only memory, a compact disk, a digital versatile disk, a cache, a random-access memory, and/or any other storage medium where information may be stored for any duration (e.g., for long periods of time, permanently, brief instances, for temporarily buffering, and/or for caching of the information).
It should be noted that the above-mentioned embodiments are only specific examples of the present invention, and obviously, the present invention is not limited to the above-mentioned embodiments, and many similar variations exist. All modifications which would occur to one skilled in the art and which are, therefore, directly derived or suggested from the disclosure herein are deemed to be within the scope of the present invention.
Claims (7)
1. A method of blockchain consensus, the blockchain including a plurality of verification nodes, the method comprising:
the first verification node acquires at least two hash values;
based on the at least two hash values, the first verification node determines data blocks corresponding to the at least two hash values in a current master data file stored by the first verification node;
the first verification node performs a hash operation on the data block, so as to determine a current root hash value corresponding to the current master data file;
the first verification node broadcasting the current root hash value to a blockchain network;
the first verification node and the rest verification nodes respectively determine whether the current root hash value is the same as the historical root hash value;
the first verification node generates a presence attestation indicating that a historical master data file corresponding to the historical root hash value is present in the first verification node and that the current master data file is the same data file as the historical master data file if the verification node exceeding a specified threshold determines that the current root hash value and the historical root hash value are the same.
2. The method of claim 1, wherein the first verification node is a block-out node of a current block-out turn, and all verification nodes may lease respective memory space by respective memory lease contracts.
3. The method of claim 1 or 2, further comprising: and storing the existence certification in a block chain account book.
4. The method of claim 1, the first verification node hashing the data block such that determining a current root hash value corresponding to the current master data file comprises:
the first verification node performs hash operation on the data block to obtain a current hash value corresponding to the data block;
and calculating a current root hash value corresponding to the current main data file according to the current hash value.
5. The method of claim 1, wherein the specified threshold is two-thirds.
6. The method of claim 1, wherein the historical master data file is stored in the respective validation node partitioned into a plurality of data blocks by a merkel directed acyclic data structure.
7. A computer-readable storage medium having stored thereon processor-executable instructions that, when executed by a processor, perform the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810429726.5A CN108667836B (en) | 2018-05-08 | 2018-05-08 | Block chain consensus method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810429726.5A CN108667836B (en) | 2018-05-08 | 2018-05-08 | Block chain consensus method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108667836A CN108667836A (en) | 2018-10-16 |
| CN108667836B true CN108667836B (en) | 2021-01-26 |
Family
ID=63778735
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810429726.5A Active CN108667836B (en) | 2018-05-08 | 2018-05-08 | Block chain consensus method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108667836B (en) |
Families Citing this family (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109493222A (en) * | 2018-10-18 | 2019-03-19 | 尚维斯 | A kind of method of any number of block chain account book real-time synchronizations |
| CN109525648A (en) * | 2018-10-26 | 2019-03-26 | 全链通有限公司 | Block chain common recognition mechanism, equipment and computer readable storage medium |
| CN109544158B (en) * | 2018-11-02 | 2021-04-30 | 北京新唐思创教育科技有限公司 | Block data processing method and computer storage medium |
| CN109859044B (en) * | 2019-01-15 | 2022-12-27 | 中山大学 | Block chain construction method |
| EP3916606A4 (en) * | 2019-01-23 | 2022-10-19 | Scalar, Inc | Data management system with falsification detectability |
| AU2019204730C1 (en) * | 2019-04-03 | 2021-04-29 | Advanced New Technologies Co., Ltd. | Processing and storing blockchain data under a trusted execution environment |
| CN110399338B (en) * | 2019-04-13 | 2022-03-08 | 西安电子科技大学 | Distributed file index system and method based on block chain and cloud storage server |
| CN110245950B (en) * | 2019-06-17 | 2020-08-04 | 北京瑞策科技有限公司 | Block discharging method and device related to block chain |
| SG11202002017YA (en) * | 2019-07-11 | 2020-04-29 | Alibaba Group Holding Ltd | Shared blockchain data storage |
| CN110991962A (en) * | 2019-11-29 | 2020-04-10 | 中国工商银行股份有限公司 | Freight waybill processing method and device based on block chain, computing equipment and medium |
| CN111428277B (en) * | 2020-03-20 | 2023-08-18 | 中国建设银行股份有限公司 | Block chain data verification method, device and system |
| CN111523148B (en) * | 2020-04-16 | 2023-10-27 | 丝链(常州)控股有限公司 | Data storage method based on block chain |
| CN111523896B (en) * | 2020-05-06 | 2023-05-30 | 杭州复杂美科技有限公司 | Attack prevention method, apparatus and storage medium |
| CN111612471A (en) * | 2020-06-08 | 2020-09-01 | 杭州复杂美科技有限公司 | Block restoring method, equipment and storage medium |
| CN111984613B (en) * | 2020-08-04 | 2023-06-16 | 中国人民银行数字货币研究所 | Method, device and system for sharing files |
| CN112199716B (en) * | 2020-09-30 | 2024-04-02 | 卓望数码技术（深圳）有限公司 | Block chain block-out method, device, equipment and storage medium |
| CN112699081B (en) * | 2020-10-23 | 2024-01-26 | 中国工商银行股份有限公司 | File self-certification method and device based on blockchain |
| CN112767110B (en) * | 2021-01-20 | 2024-08-09 | 中国工商银行股份有限公司 | Big data decentralized uplink method and system |
| CN114880397B (en) * | 2022-04-28 | 2024-04-26 | 中国电信股份有限公司 | Decentralised data storage method and device, computer medium and electronic equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106656974A (en) * | 2016-10-17 | 2017-05-10 | 江苏通付盾科技有限公司 | Block chain grouping consensus method and system |
| CN106815530A (en) * | 2016-12-26 | 2017-06-09 | 北京爱接力科技发展有限公司 | Data deposit card method, data verification method and device |
| CN107220130A (en) * | 2017-05-12 | 2017-09-29 | 北京众享比特科技有限公司 | A kind of information common recognition method realized at the node of block chain, apparatus and system |
| CN107249046A (en) * | 2017-08-15 | 2017-10-13 | 李俊庄 | A kind of distributed cloud storage system construction method based on block chain |
| CN107360156A (en) * | 2017-07-10 | 2017-11-17 | 广东工业大学 | P2P network method for cloud storage based on block chain under a kind of big data environment |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102411637B (en) * | 2011-12-30 | 2013-07-24 | 创新科软件技术（深圳）有限公司 | Metadata management method of distributed file system |
| US10204341B2 (en) * | 2016-05-24 | 2019-02-12 | Mastercard International Incorporated | Method and system for an efficient consensus mechanism for permissioned blockchains using bloom filters and audit guarantees |
| CN106354994B (en) * | 2016-08-22 | 2019-01-18 | 布比（北京）网络技术有限公司 | Handle the method and system of medical data |
-
2018
- 2018-05-08 CN CN201810429726.5A patent/CN108667836B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106656974A (en) * | 2016-10-17 | 2017-05-10 | 江苏通付盾科技有限公司 | Block chain grouping consensus method and system |
| CN106815530A (en) * | 2016-12-26 | 2017-06-09 | 北京爱接力科技发展有限公司 | Data deposit card method, data verification method and device |
| CN107220130A (en) * | 2017-05-12 | 2017-09-29 | 北京众享比特科技有限公司 | A kind of information common recognition method realized at the node of block chain, apparatus and system |
| CN107360156A (en) * | 2017-07-10 | 2017-11-17 | 广东工业大学 | P2P network method for cloud storage based on block chain under a kind of big data environment |
| CN107249046A (en) * | 2017-08-15 | 2017-10-13 | 李俊庄 | A kind of distributed cloud storage system construction method based on block chain |
Non-Patent Citations (1)
| Title |
|---|
| "区块链技术发展现状与展望";袁勇，王飞跃;《自动化学报》;20160331;第42卷(第4期);481-493页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108667836A (en) | 2018-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108667836B (en) | Block chain consensus method | |
| US10965445B2 (en) | Blockchain-based unexpected data detection | |
| Wan et al. | Recent advances in consensus protocols for blockchain: a survey | |
| US10965446B2 (en) | Blockchain-based automated user matching | |
| EP3639468B1 (en) | Systems and methods for avoiding or reducing cryptographically stranded resources on a blockchain network | |
| Zhang et al. | Overview of blockchain consensus mechanism | |
| US11461310B2 (en) | Distributed ledger technology | |
| US20190268139A1 (en) | Data authentication using a blockchain approach | |
| WO2017082238A1 (en) | Block chain generation device, block chain generation method, block chain verification device, block chain verification method and program | |
| WO2017082237A1 (en) | Block chain generation device, block chain generation method, block chain verification device, block chain verification method and program | |
| US20210014042A1 (en) | Lightweight Blockchain Based on Split-Trust | |
| Ferrer-Gomila et al. | A fair contract signing protocol with blockchain support | |
| CN112907369B (en) | Block chain-based data consensus method and device, electronic equipment and storage medium | |
| US20190354968A1 (en) | Utilization Management Method, Utilization Management System, and Node | |
| JP7003995B2 (en) | Blockchain management device, blockchain management method and program | |
| JP6495346B2 (en) | Information processing system | |
| Lycklama à Nijeholt et al. | Decreg: A framework for preventing double-financing using blockchain technology | |
| US20200402026A1 (en) | Blockchain management system, blockchain management apparatus, information providing apparatus, and blockchain management method | |
| CN115941691A (en) | Method, device, equipment and medium for modifying data on block chain | |
| Hei et al. | Themis: An accountable blockchain-based P2P cloud storage scheme | |
| Esmaili et al. | A distributed blockchain-based video sharing system with copyright, integrity, and immutability | |
| CN112700333B (en) | Electronic archive consensus method based on block chain | |
| Chishti et al. | Increasing TPS rate of state‐based blockchains by parallel mining | |
| Anand et al. | A unified trust management strategy for content sharing in Peer-to-Peer networks | |
| CN114365173A (en) | System and method for providing authenticity, integrity and non-repudiation for advertising technology |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210913 Address after: Room 201, building a, No.1 Qianwan 1st Road, Shenzhen Hong Kong cooperation zone, Qianhai, Shenzhen, Guangdong 518066 Patentee after: ZHONGAN INFORMATION TECHNOLOGY SERVICE Co.,Ltd. Patentee after: Baibao (Shanghai) Technology Co.,Ltd. Address before: 518000 Room 201, building A, 1 front Bay Road, Shenzhen Qianhai cooperation zone, Shenzhen, Guangdong Patentee before: ZHONGAN INFORMATION TECHNOLOGY SERVICE Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240227 Address after: Room 1179, W Zone, 11th Floor, Building 1, No. 158 Shuanglian Road, Qingpu District, Shanghai, 201702 Patentee after: Shanghai Zhongan Information Technology Service Co.,Ltd. Country or region after: China Patentee after: Baibao (Shanghai) Technology Co.,Ltd. Address before: Room 201, building a, No.1 Qianwan 1st Road, Shenzhen Hong Kong cooperation zone, Qianhai, Shenzhen, Guangdong 518066 Patentee before: ZHONGAN INFORMATION TECHNOLOGY SERVICE Co.,Ltd. Country or region before: China Patentee before: Baibao (Shanghai) Technology Co.,Ltd. |
|
| TR01 | Transfer of patent right |